{"meta":{"query_hash":"09dbf0475f87","filters":{"topic":"Computability, Logic, AI Algorithms"},"cohort_total":805,"direct_labels_cover":0,"predictions_cover":805,"exported":805,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/09dbf0475f87","api":"https://metacan.xera.ac/api/v1/cohort?topic=Computability%2C+Logic%2C+AI+Algorithms"},"results":[{"id":"W1040854756","doi":"10.1017/cbo9780511841453.016","title":"Channel coding","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Coding (social sciences); Computer science; Channel (broadcasting); Channel code; Computer network; Algorithm; Mathematics; Decoding methods; Statistics","score_opus":0.026459560636202088,"score_gpt":0.19657162021328245,"score_spread":0.17011205957708037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1040854756","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017915987,0.000055043176,0.19674031,0.000055804394,0.001284125,0.0004059378,0.0000628752,0.00055948214,0.8008185],"genre_scores_gemma":[0.0010581583,0.000033165248,0.0059394906,0.000117116906,0.0003440633,9.0038213e-7,0.000015536938,0.000046356323,0.99244523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747086,0.00005204645,0.000269789,0.0011909547,0.0004962696,0.0005200645],"domain_scores_gemma":[0.9971228,0.0001714232,0.00029918598,0.0017722241,0.00030330627,0.00033106486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024627137,0.0005633351,0.00057243404,0.000310784,0.0003714474,0.00020071468,0.0029651874,0.0006633653,0.0000055953337],"category_scores_gemma":[0.000019465158,0.0006789202,0.00035018293,0.000021580496,0.00033815057,0.00026082684,0.002870795,0.001235586,0.000054477736],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009812275,0.000014605627,4.1600006e-7,0.000051581697,0.00006036336,0.00039767465,0.000088597364,0.000007162969,0.00007264031,0.99114615,0.003888519,0.004262496],"study_design_scores_gemma":[0.00049272814,0.00007864307,0.000018825081,0.00009559025,0.0000719121,0.00007690528,0.000006932098,0.006952303,0.00076120737,0.00048818823,0.9900174,0.00093932514],"about_ca_topic_score_codex":0.00009591221,"about_ca_topic_score_gemma":0.00000473672,"teacher_disagreement_score":0.9906579,"about_ca_system_score_codex":0.0002538723,"about_ca_system_score_gemma":0.00019696284,"threshold_uncertainty_score":0.9995662},"labels":[],"label_agreement":null},{"id":"W107779203","doi":"","title":"Efficiently Approximable Real-Valued Functions","year":2000,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Oracle; Class (philosophy); Generalization; Turing machine; Complexity class; Discrete mathematics; Combinatorics; Mathematics; Probabilistic logic; Boolean function; Running time; Computer science; Construct (python library); Turing; Contrast (vision); Time complexity; Theoretical computer science; Algorithm; Artificial intelligence; Computation","score_opus":0.01296254320909403,"score_gpt":0.2281263839812784,"score_spread":0.21516384077218437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107779203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031209495,0.000029334116,0.714363,0.00062026596,0.0004347873,0.0002527387,0.0000018188064,0.0009884244,0.25210017],"genre_scores_gemma":[0.41849497,0.000025877951,0.47581622,0.0010697213,0.00033707102,0.000079436606,0.00001101079,0.000033129672,0.10413258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981508,0.000086972264,0.0002710813,0.00067182136,0.00036854623,0.00045073844],"domain_scores_gemma":[0.99849313,0.000091184345,0.00003454085,0.0011383949,0.000087485656,0.00015523411],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003915391,0.00017326925,0.00018547845,0.000091583584,0.00024084377,0.00022673306,0.0009629945,0.00006501173,0.0016795875],"category_scores_gemma":[0.0000197206,0.00014913891,0.000107361964,0.00087567675,0.000070851966,0.00035706392,0.00023606255,0.00013879036,0.0019204792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022926823,0.0013733354,0.00088531914,0.000026035706,0.000049534843,0.000032913136,0.0010345018,0.022660576,0.00035861862,0.118175216,0.022872131,0.8325089],"study_design_scores_gemma":[0.00048436245,0.00016912856,0.004476599,0.0000047359417,0.000007697826,0.00003850148,0.000026582,0.9537714,0.00031701522,0.0063795256,0.03397747,0.00034699487],"about_ca_topic_score_codex":0.00027093646,"about_ca_topic_score_gemma":0.000020963429,"teacher_disagreement_score":0.9311108,"about_ca_system_score_codex":0.000080911894,"about_ca_system_score_gemma":0.00007969504,"threshold_uncertainty_score":0.999233},"labels":[],"label_agreement":null},{"id":"W11357342","doi":"","title":"Software Documents: Comparison and Measurement.","year":2007,"lang":"en","type":"article","venue":"Software Engineering and Knowledge Engineering","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Credence; Software metric; Software measurement; Software; Entropy (arrow of time); Software engineering; Software construction; Metric (unit); Software sizing; Source code; Software development; Data science; Data mining; Theoretical computer science; Machine learning; Programming language; Engineering","score_opus":0.014603294983171434,"score_gpt":0.23604701915274437,"score_spread":0.22144372416957295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11357342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02864487,0.007707936,0.9603397,0.000023461824,0.0012559297,0.00020815051,0.0000018850957,0.0017685458,0.00004951576],"genre_scores_gemma":[0.5923889,0.000035485067,0.4072046,0.000013309331,0.00024344026,0.000017846232,0.0000023207185,0.00005145591,0.000042611104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977023,0.000018912557,0.0004745594,0.00068576634,0.00038670836,0.00073174323],"domain_scores_gemma":[0.9984266,0.00045317755,0.000058485013,0.0005030222,0.00017743313,0.00038124886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012221602,0.00043982477,0.0004322873,0.00035174278,0.00013503303,0.00023019896,0.00048076446,0.00015019855,0.0000031371505],"category_scores_gemma":[0.00092209165,0.00046991013,0.00007443041,0.00055141846,0.00003412833,0.00045064997,0.000565143,0.00041487033,0.000012854971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027574326,0.00059450365,0.06201003,0.0027885668,0.00050278736,0.00015467145,0.0086064935,0.06144833,0.004284424,0.012971926,0.0014423365,0.84516835],"study_design_scores_gemma":[0.0018133523,0.00032302435,0.07949816,0.0006568167,0.000064824606,0.00022030353,0.000079068435,0.86406904,0.004220377,0.00039406776,0.04634642,0.0023145487],"about_ca_topic_score_codex":0.000012253024,"about_ca_topic_score_gemma":0.000009913482,"teacher_disagreement_score":0.8428538,"about_ca_system_score_codex":0.00019853043,"about_ca_system_score_gemma":0.000043418797,"threshold_uncertainty_score":0.99977523},"labels":[],"label_agreement":null},{"id":"W117030520","doi":"10.1007/978-3-642-30385-2_12","title":"Time Machines, the Multiverse and Other Fantasies","year":2012,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Everyday life; Art history; History; Art; Psychoanalysis; Aesthetics; Psychology; Epistemology; Philosophy","score_opus":0.020731790805858467,"score_gpt":0.22461168500053527,"score_spread":0.2038798941946768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117030520","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033226104,0.0022853308,0.04558404,0.0010003147,0.0005962478,0.0008630452,0.00003410804,0.00046548035,0.9491382],"genre_scores_gemma":[0.00079294894,0.00010398691,0.044119228,0.0019132007,0.00064826506,0.000016692908,0.0000052627197,0.00007149674,0.9523289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985779,0.00004441718,0.00022907469,0.00054777326,0.00031197115,0.00028887088],"domain_scores_gemma":[0.99840033,0.00032321172,0.0001217481,0.0009846028,0.00006192294,0.0001081619],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035792173,0.00037777363,0.00032153033,0.000082193576,0.00014791703,0.00014840008,0.0010554675,0.00018222352,0.0013120552],"category_scores_gemma":[0.000013561133,0.00022493555,0.00012196888,0.000034579785,0.00034466144,0.00020259475,0.0013182189,0.0003102141,0.0010675422],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060622147,0.00004170618,0.0001286182,0.000025481815,0.00010924819,0.000014138883,0.0012517888,0.000007929415,0.000013727977,0.60844517,0.0049667936,0.38498935],"study_design_scores_gemma":[0.00028097612,0.00006274792,0.0005200541,0.000026940525,0.00004198787,0.000107384294,0.000008477903,0.041887496,0.000011962153,0.04402145,0.9123606,0.00066990935],"about_ca_topic_score_codex":0.000087450644,"about_ca_topic_score_gemma":0.000033771354,"teacher_disagreement_score":0.9073938,"about_ca_system_score_codex":0.000044195356,"about_ca_system_score_gemma":0.0000342609,"threshold_uncertainty_score":0.99971026},"labels":[],"label_agreement":null},{"id":"W118729324","doi":"","title":"Proceedings of the 2007 international symposium on Symbolic and algebraic computation","year":2007,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computer science; Symbolic-numeric computation; Algebra over a field; Computation; Theoretical computer science; Software; Automatic differentiation; Algorithm; Programming language; Mathematics; Pure mathematics","score_opus":0.009354170939972843,"score_gpt":0.24142804220333314,"score_spread":0.2320738712633603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118729324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67717034,0.000017850769,0.27572972,0.0037002426,0.0012507604,0.0003361801,0.0000010796219,0.00015547236,0.04163834],"genre_scores_gemma":[0.9807308,0.0000024968515,0.018452236,0.0004958375,0.00010246643,0.0000021912638,4.2626644e-7,0.0000048530296,0.00020871699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99885494,0.000009579327,0.0002531348,0.00031375434,0.00039372043,0.00017489566],"domain_scores_gemma":[0.99931806,0.00015424832,0.00010966309,0.00014346767,0.00021786797,0.00005668757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005599988,0.00010669806,0.000110159635,0.00008048572,0.00006655951,0.00009305088,0.0006740489,0.00004569965,0.000010588291],"category_scores_gemma":[0.00004204555,0.00007436576,0.00004591958,0.00031671926,0.00008603412,0.00023446974,0.00041522752,0.000104644765,0.000007791424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003468281,0.00057262834,0.054748535,0.00006645803,0.00006738017,0.000003614062,0.0030396855,0.0006319731,0.008106154,0.7611582,0.0032383753,0.16833226],"study_design_scores_gemma":[0.00084249274,0.00031153683,0.6550851,0.00005816784,0.00001029813,0.00008542953,0.00014497129,0.2776405,0.020033885,0.04355067,0.0018673639,0.00036960788],"about_ca_topic_score_codex":0.000022299866,"about_ca_topic_score_gemma":0.0000051097863,"teacher_disagreement_score":0.71760756,"about_ca_system_score_codex":0.000052231586,"about_ca_system_score_gemma":0.00001733385,"threshold_uncertainty_score":0.30325475},"labels":[],"label_agreement":null},{"id":"W12283636","doi":"","title":"Proceedings of the thiry-fourth annual ACM symposium on Theory of computing","year":2002,"lang":"en","type":"article","venue":"Symposium on the Theory of Computing","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Computation; Graph theory; Quantum computer; Library science; Theoretical computer science; Algorithm; Quantum; Mathematics","score_opus":0.020151196742199482,"score_gpt":0.22963101977264205,"score_spread":0.20947982303044257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12283636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93068534,0.00013185585,0.03310214,0.0045591886,0.0015634334,0.0012988255,0.000023310131,0.00035088114,0.02828505],"genre_scores_gemma":[0.99217755,0.000010196873,0.0066409805,0.00058110117,0.00029433714,0.000004651191,5.962177e-7,0.000052163006,0.00023844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942458,0.0010892571,0.0014354866,0.0010008818,0.001380119,0.0008484518],"domain_scores_gemma":[0.9887462,0.006439104,0.0016822162,0.0022554446,0.00074054406,0.00013644829],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0071902964,0.00062898337,0.0009544082,0.0003049064,0.0005815536,0.00011342843,0.0070670717,0.00020483413,0.00003468453],"category_scores_gemma":[0.0008839166,0.00040393817,0.0005827866,0.0013501091,0.0010663111,0.0002796675,0.003278348,0.0008649306,0.000022331702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013061917,0.00085939374,0.00094435655,0.00027104214,0.00018700844,0.0000027542599,0.032208297,0.016924243,0.013836646,0.91657037,0.00041752923,0.017647762],"study_design_scores_gemma":[0.0022742967,0.0029785263,0.010518276,0.00240252,0.00019930361,0.00013907539,0.0053239786,0.41818345,0.17462353,0.3814173,0.0003034248,0.0016363448],"about_ca_topic_score_codex":0.000009668843,"about_ca_topic_score_gemma":4.7602828e-7,"teacher_disagreement_score":0.53515303,"about_ca_system_score_codex":0.00011657835,"about_ca_system_score_gemma":0.000078859426,"threshold_uncertainty_score":0.9998413},"labels":[],"label_agreement":null},{"id":"W124027644","doi":"","title":"A note on the complexity of computing cyclicity.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Theoretical computer science; Computer science","score_opus":0.05052226703837889,"score_gpt":0.26080830461380883,"score_spread":0.21028603757542993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124027644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93368316,0.0000954071,0.037836283,0.009000957,0.0035109748,0.0006507459,0.000005242425,0.00048803524,0.014729215],"genre_scores_gemma":[0.9911338,0.000003626983,0.008222962,0.0005615923,0.000019945679,0.0000050785006,6.727174e-7,0.00001249206,0.00003981614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997677,0.0003133877,0.00045252402,0.0005291945,0.0005965815,0.00043130474],"domain_scores_gemma":[0.9970382,0.0010350402,0.00023382145,0.001420371,0.00016598511,0.0001065731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007250921,0.00023866945,0.00035505995,0.00009302189,0.00028468648,0.00010997854,0.0020450242,0.00008147416,0.000062628154],"category_scores_gemma":[0.00026083,0.0001827222,0.00016102947,0.00078907027,0.00042866316,0.00016474776,0.00084052375,0.0003652882,0.00014454171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022850816,0.00037849645,0.00067107717,0.000011466767,0.000014792954,0.000006960425,0.0012277445,0.00013782833,0.00010887211,0.98741823,0.0011990311,0.008823215],"study_design_scores_gemma":[0.00046263495,0.00022503178,0.013335901,0.000028485752,0.000005322478,0.000010466534,0.000017580385,0.38676545,0.0014123924,0.5970544,0.00045772354,0.00022459573],"about_ca_topic_score_codex":0.00007955769,"about_ca_topic_score_gemma":0.000006135435,"teacher_disagreement_score":0.3903638,"about_ca_system_score_codex":0.00009406933,"about_ca_system_score_gemma":0.000022823366,"threshold_uncertainty_score":0.74511945},"labels":[],"label_agreement":null},{"id":"W125126158","doi":"","title":"Cartesian Products and Edge Domination.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Enhanced Data Rates for GSM Evolution; Cartesian coordinate system; Combinatorics; Geometry; Computer science; Artificial intelligence","score_opus":0.010252911786325402,"score_gpt":0.22255594244867813,"score_spread":0.21230303066235273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125126158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95062464,0.0008120626,0.026216015,0.011251859,0.0061660553,0.00082023046,0.0000021926498,0.0007041791,0.0034027302],"genre_scores_gemma":[0.97405344,0.000008570246,0.025661908,0.00014255455,0.000026619142,0.000019339386,0.0000016862314,0.00001107488,0.000074818076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984531,0.00006575878,0.00022550672,0.0006289294,0.00030116545,0.00032555356],"domain_scores_gemma":[0.99872166,0.00008637865,0.000072705254,0.00077288004,0.00020862199,0.00013776393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039379075,0.00018136662,0.00020182997,0.00010316963,0.0001770616,0.00019902988,0.00067975593,0.00006967632,0.000003393423],"category_scores_gemma":[0.00017352459,0.00017928348,0.00003698178,0.0006091007,0.00010380433,0.0005261488,0.0004346869,0.00015561172,0.000050988096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017543534,0.0001692879,0.0006720186,0.000019810868,0.000008854708,0.00002119004,0.0008635723,0.000030819345,0.0002663674,0.9818344,0.00028191908,0.015829977],"study_design_scores_gemma":[0.0012572055,0.00017746662,0.020965375,0.000015152601,0.000006543085,0.00005387401,0.000019567602,0.0016423992,0.0040057003,0.9700205,0.0015449236,0.0002913044],"about_ca_topic_score_codex":0.000048960956,"about_ca_topic_score_gemma":0.0000058523738,"teacher_disagreement_score":0.023428757,"about_ca_system_score_codex":0.00013567819,"about_ca_system_score_gemma":0.00014871568,"threshold_uncertainty_score":0.7310968},"labels":[],"label_agreement":null},{"id":"W131197506","doi":"10.1016/j.apal.2005.06.003","title":"What can be efficiently reduced to the Kolmogorov-random strings?","year":2005,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Time complexity; Mathematics; Decidability; PSPACE; Monotone polygon; Discrete mathematics; Reduction (mathematics); Set (abstract data type); Upper and lower bounds; Binary logarithm; Computational complexity theory; Computer science; Algorithm","score_opus":0.0468738684075537,"score_gpt":0.28981120707797775,"score_spread":0.24293733867042405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131197506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.811783,0.0020359042,0.05325609,0.127053,0.0006332352,0.0014210531,0.000013977377,0.00024573327,0.0035579947],"genre_scores_gemma":[0.9857971,0.00013257076,0.005496624,0.0081946775,0.00022286539,0.000036800484,0.000002641322,0.000008340101,0.000108401364],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981983,0.000060990405,0.00034079058,0.0005781277,0.00037858658,0.00044324147],"domain_scores_gemma":[0.9986319,0.00021476828,0.00012521898,0.0007326844,0.00011841811,0.00017700536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078250177,0.00022176706,0.00032771533,0.00009186613,0.00018298584,0.00031034034,0.0010856494,0.000080961065,0.000015723943],"category_scores_gemma":[0.00004432715,0.00014941566,0.00009586081,0.00050265575,0.000099846984,0.00020522739,0.00056682987,0.00017241368,0.000018578565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010672351,0.0005512996,0.000056212433,0.000052573665,0.000079321275,0.00000903371,0.009223608,0.01770158,0.0063446867,0.13310952,0.01395906,0.8188064],"study_design_scores_gemma":[0.008874752,0.0035145304,0.022380728,0.00031882667,0.00017207052,0.0001870539,0.0069844113,0.07995606,0.35308087,0.19262192,0.32720548,0.0047033154],"about_ca_topic_score_codex":0.000014645469,"about_ca_topic_score_gemma":0.000045262223,"teacher_disagreement_score":0.81410307,"about_ca_system_score_codex":0.000013043367,"about_ca_system_score_gemma":0.00004624785,"threshold_uncertainty_score":0.6092994},"labels":[],"label_agreement":null},{"id":"W134244963","doi":"","title":"The turing ratio: metrics for open-ended tasks","year":2002,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Turing; Computer science; Turing test; Assertion; Task (project management); Measure (data warehouse); Key (lock); Turing machine; Super-recursive algorithm; Artificial intelligence; Extension (predicate logic); Human intelligence; Theoretical computer science; Computation; Machine learning; Universal Turing machine; Algorithm; Data mining; Programming language; Computer security","score_opus":0.07175759230155587,"score_gpt":0.2876305788093069,"score_spread":0.21587298650775105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134244963","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031715957,0.00030152957,0.9757739,0.0044555888,0.000747132,0.00071009813,0.0000013454365,0.00020091029,0.017492367],"genre_scores_gemma":[0.4660156,0.000032914842,0.5236906,0.0010156438,0.00021131977,0.00015471646,0.0000011440236,0.000015383373,0.008862714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859,0.0000680696,0.00026559457,0.00044865708,0.00026727622,0.00036038048],"domain_scores_gemma":[0.99769396,0.0010687194,0.000070375514,0.00093543174,0.00014642217,0.000085093765],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00078697654,0.00013117403,0.00014978672,0.00006880032,0.00048644523,0.0012392367,0.0030565248,0.000044572815,0.000044753513],"category_scores_gemma":[0.00036175307,0.000085053834,0.00007982311,0.00071252295,0.000043441196,0.0005298187,0.0013498216,0.00010589944,0.000059752314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004021983,0.00019150216,0.00016139746,0.000011472145,0.000031018684,0.000004237498,0.00048934267,0.00049708516,0.00010003801,0.3621043,0.0320662,0.6043394],"study_design_scores_gemma":[0.00039474593,0.000096053824,0.00047115027,0.000001760526,0.0000034519749,0.000008121963,0.000022445554,0.9208204,0.0014397231,0.027881607,0.04868915,0.00017140311],"about_ca_topic_score_codex":0.000034043544,"about_ca_topic_score_gemma":0.000042890082,"teacher_disagreement_score":0.9203233,"about_ca_system_score_codex":0.00006637483,"about_ca_system_score_gemma":0.000025558886,"threshold_uncertainty_score":0.9997976},"labels":[],"label_agreement":null},{"id":"W141509276","doi":"","title":"On Infinite Kuratowski Theorems.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.011276499343480247,"score_gpt":0.23362716481231094,"score_spread":0.2223506654688307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141509276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8923035,0.00016493358,0.059835736,0.0035975566,0.009580444,0.000652945,0.000004280528,0.0013847116,0.032475844],"genre_scores_gemma":[0.99092597,0.000006005038,0.0080831265,0.0008642471,0.00002015573,0.000020970148,0.0000022531608,0.000019274028,0.00005797388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783343,0.00011211697,0.0003311499,0.00068588654,0.00053597527,0.0005014387],"domain_scores_gemma":[0.9978177,0.0003514518,0.000108205844,0.0013809144,0.00014413298,0.00019761256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049253914,0.00028057862,0.00027808826,0.00015495044,0.00019680092,0.0002383236,0.0016380019,0.0001185366,0.00002995968],"category_scores_gemma":[0.00020701862,0.00025738942,0.00012986091,0.00080284965,0.00011876094,0.0004101553,0.0005635083,0.0003360345,0.0006269074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005665473,0.0002825036,0.00019253258,0.0000051796014,0.000012498973,0.00003958648,0.0003780795,0.0005617062,0.000054952103,0.99171174,0.00030982678,0.0064457343],"study_design_scores_gemma":[0.0011681969,0.0003754401,0.00270823,0.000022620556,0.0000037753348,0.000019224804,0.000009094855,0.0020064933,0.0016094265,0.9907429,0.0010213668,0.0003132069],"about_ca_topic_score_codex":0.000043337008,"about_ca_topic_score_gemma":0.00000432614,"teacher_disagreement_score":0.09862244,"about_ca_system_score_codex":0.00021056065,"about_ca_system_score_gemma":0.00016057453,"threshold_uncertainty_score":0.99998784},"labels":[],"label_agreement":null},{"id":"W145319911","doi":"10.1007/978-1-4614-3549-5_5","title":"On Divisibility by 4","year":2012,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Divisibility rule; Property (philosophy); Infinite divisibility; Mathematics; Focus (optics); Pure mathematics; Mathematics education; Philosophy; Epistemology; Physics","score_opus":0.021057390142176884,"score_gpt":0.22953234478238174,"score_spread":0.20847495464020485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145319911","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016722419,0.00047628884,0.29841208,0.00040986494,0.0009766931,0.00034530697,0.000020928097,0.00053748215,0.6988046],"genre_scores_gemma":[0.012993607,0.00005013616,0.032673303,0.0017638706,0.00052324426,0.000017373211,0.00003719824,0.00007749073,0.95186377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970448,0.000045151326,0.0004559977,0.0012163714,0.0007333674,0.00050430733],"domain_scores_gemma":[0.9963911,0.00046614767,0.00017372734,0.0025593017,0.00012174111,0.00028794113],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006113185,0.0005341488,0.0005174308,0.00011332479,0.00010031005,0.00016481172,0.0019669945,0.0003932173,0.0017920554],"category_scores_gemma":[0.00004650648,0.00044803476,0.00027781344,0.000052806605,0.00012684887,0.0002648587,0.0013277212,0.00057583617,0.0023426865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020777734,0.00009529717,0.000017560349,0.000016520353,0.000021538463,0.000004127151,0.000040009712,0.0000029865769,0.0000031182435,0.7967385,0.025715971,0.17734231],"study_design_scores_gemma":[0.0001942097,0.00024115854,0.00020902166,0.00002987869,0.000014674756,0.000010198536,5.0470743e-7,0.0031319188,0.000074454394,0.63666046,0.35855955,0.00087393966],"about_ca_topic_score_codex":0.000027067272,"about_ca_topic_score_gemma":0.000009496603,"teacher_disagreement_score":0.3328436,"about_ca_system_score_codex":0.00023477309,"about_ca_system_score_gemma":0.00007330194,"threshold_uncertainty_score":0.99979717},"labels":[],"label_agreement":null},{"id":"W145947616","doi":"10.1007/978-1-4471-5102-9_154-2","title":"Information and Communication Complexity of Networked Control Systems","year":2020,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Systems and Control","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Information exchange; Control (management); State (computer science); Set (abstract data type); State information; Telecommunications network; Distributed computing; Stochastic control; Information structure; Networked control system; Actuator; Optimal control; Mathematical optimization; Computer network; Mathematics; Telecommunications; Artificial intelligence; Algorithm","score_opus":0.015493052787689109,"score_gpt":0.20465910530738818,"score_spread":0.18916605251969906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145947616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039662092,0.041900855,0.7345236,0.0010744159,0.0020534387,0.0051784916,0.00048007828,0.0002723044,0.21412018],"genre_scores_gemma":[0.9948936,0.0017837695,0.0011420783,0.000089534806,0.00028013883,0.00006896091,0.000039726365,0.000023662766,0.0016784891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730945,0.00020624044,0.0014469352,0.0003313978,0.0004909745,0.00021501549],"domain_scores_gemma":[0.99643743,0.0005261443,0.0015033162,0.00089947367,0.0004623606,0.0001712668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007924252,0.00038353054,0.0013455471,0.00015000625,0.000105456136,0.00016011501,0.0007471445,0.00030056306,0.0000037317543],"category_scores_gemma":[0.000060003826,0.00035075998,0.00012220348,0.00007260676,0.00035208664,0.00052609795,0.00029841435,0.0003182048,0.0000058729606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075769356,0.00003207117,0.0004265735,0.0016342736,0.00031529545,0.0000029505404,0.0011244301,0.0015801768,0.00000836429,0.97341216,0.0006818695,0.020706082],"study_design_scores_gemma":[0.0045773834,0.00057650637,0.0015077384,0.0010182001,0.00023945702,0.000057104393,0.00017367811,0.84421146,7.60148e-7,0.015406311,0.13142814,0.0008032899],"about_ca_topic_score_codex":0.0004944813,"about_ca_topic_score_gemma":0.000013583235,"teacher_disagreement_score":0.994497,"about_ca_system_score_codex":0.000046325797,"about_ca_system_score_gemma":0.00011528102,"threshold_uncertainty_score":0.99989444},"labels":[],"label_agreement":null},{"id":"W1461336424","doi":"10.1112/tlm3.12001","title":"On the logical strengths of partial solutions to mathematical problems","year":2017,"lang":"en","type":"article","venue":"Transactions of the London Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Fondation Sciences Mathématiques de Paris; Fonds Wetenschappelijk Onderzoek; Universiteit Gent; Agence Nationale de la Recherche; John Templeton Foundation","keywords":"Computer science; Calculus (dental); Management science; Mathematical economics; Mathematics; Medicine; Engineering","score_opus":0.044370950898161544,"score_gpt":0.28066589412578513,"score_spread":0.2362949432276236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1461336424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026516942,0.000009945899,0.955412,0.01574892,0.00016960973,0.000830449,0.00001922265,0.00007817199,0.0012147417],"genre_scores_gemma":[0.93041426,0.0000047782564,0.0690953,0.00015104799,0.000031960317,0.00008824975,2.0476006e-7,0.000012200517,0.0002019786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765795,0.00016115395,0.000639408,0.00037995342,0.000739284,0.00042226765],"domain_scores_gemma":[0.9951834,0.0017534748,0.00027291398,0.0025042056,0.00014563235,0.0001403715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011621775,0.00022769105,0.00043591982,0.00002200227,0.0009584405,0.00013965183,0.0030592333,0.00013670824,0.00032147544],"category_scores_gemma":[0.000636178,0.00012223766,0.0007720487,0.00026170554,0.00078738795,0.0001782831,0.00034203366,0.0004159849,0.00007291452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001192515,0.0019890703,0.000019067327,0.00024030557,0.00014793682,4.87873e-7,0.0031296138,0.0068660104,0.001069893,0.9787562,0.00072601985,0.007043467],"study_design_scores_gemma":[0.00040042758,0.0002574291,0.0005471367,0.00017753446,0.00007798865,0.000014503808,0.0001267147,0.29270315,0.005635173,0.6996581,0.0001689319,0.0002329125],"about_ca_topic_score_codex":0.000014419027,"about_ca_topic_score_gemma":0.000004159458,"teacher_disagreement_score":0.90389735,"about_ca_system_score_codex":0.00006156988,"about_ca_system_score_gemma":0.000069513626,"threshold_uncertainty_score":0.7371646},"labels":[],"label_agreement":null},{"id":"W1482787054","doi":"10.1023/a:1010010009897","title":"From Language Concepts to Implementation Concepts","year":2000,"lang":"en","type":"article","venue":"LISP and Symbolic Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Programming language; Correctness; Computer science; Equivalence (formal languages); Linguistics; Philosophy","score_opus":0.010921123976275511,"score_gpt":0.33894488961967156,"score_spread":0.328023765643396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482787054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7540744,0.00013101389,0.24342732,0.00081773114,0.0002675774,0.00032072977,0.000017019043,0.00020136283,0.0007428489],"genre_scores_gemma":[0.9663894,0.000014052351,0.032191012,0.0009083012,0.00028498602,0.000022875518,0.00006564948,0.000009964124,0.00011374704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998428,0.00014204274,0.00032274163,0.0005784351,0.00024730194,0.00028151824],"domain_scores_gemma":[0.9991965,0.00018162583,0.00006409212,0.00030461425,0.00007101217,0.00018214199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017983501,0.00018357535,0.00022936484,0.000089332534,0.0001421921,0.00027368334,0.00033496277,0.000056578017,0.00027120134],"category_scores_gemma":[0.000013913358,0.0001860691,0.00004851473,0.00036827,0.00004281453,0.00039585048,0.00014770425,0.00008858589,0.000119823766],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063462835,0.00003584835,0.0006257517,0.0000044533804,0.000012694397,0.000006109534,0.020088617,0.0014486839,0.00031832015,0.0018261529,0.0005138618,0.97511315],"study_design_scores_gemma":[0.0039844243,0.0007497821,0.32564178,0.000063602616,0.00004750237,0.000053134492,0.004195723,0.5973332,0.0034588845,0.048239864,0.014750436,0.0014816916],"about_ca_topic_score_codex":0.0010642301,"about_ca_topic_score_gemma":0.00009685591,"teacher_disagreement_score":0.97363144,"about_ca_system_score_codex":0.00004849519,"about_ca_system_score_gemma":0.000041285093,"threshold_uncertainty_score":0.7587677},"labels":[],"label_agreement":null},{"id":"W1484429910","doi":"10.1007/3-540-45526-4_8","title":"Computing Entropy Maps of Finite-Automaton-Encoded Binary Images","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hausdorff dimension; Automaton; Computer science; ENCODE; Entropy (arrow of time); Algorithm; Theoretical computer science; Finite-state machine; Hausdorff distance; Image (mathematics); Nondeterministic finite automaton; Artificial intelligence; Mathematics; Pattern recognition (psychology); Automata theory; Combinatorics","score_opus":0.015561732029839721,"score_gpt":0.24614620578490468,"score_spread":0.23058447375506497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484429910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003552952,0.0008436763,0.98968226,0.0007163856,0.0029149961,0.00071765215,0.000029008024,0.00055204576,0.0041886605],"genre_scores_gemma":[0.18838517,0.000103577564,0.80957836,0.0008121024,0.00075361214,0.0000079647,0.000024045848,0.00008434323,0.0002507865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920601,0.00015106102,0.0015288332,0.0028788617,0.002009482,0.0013716542],"domain_scores_gemma":[0.9926235,0.002362532,0.0009580824,0.0030123326,0.00070400815,0.00033955567],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018591508,0.0010987864,0.0014636234,0.0017123693,0.00037919125,0.0006092625,0.007337404,0.0005478313,0.000059506143],"category_scores_gemma":[0.00032792034,0.0010489891,0.0004235526,0.0018169073,0.0017778606,0.00083393865,0.005290434,0.0013971196,0.00006818818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017031363,0.00026103915,0.00063775014,0.00023706669,0.000048415717,0.00073873566,0.0012151981,0.21767047,0.00073189096,0.02316319,0.00016274553,0.75511646],"study_design_scores_gemma":[0.0004805208,0.00038910215,0.00029316763,0.0005237316,0.000015108259,0.00018985651,6.0816797e-7,0.8372979,0.002666212,0.1562287,0.0008758118,0.0010392534],"about_ca_topic_score_codex":0.00006659625,"about_ca_topic_score_gemma":0.000021304684,"teacher_disagreement_score":0.7540772,"about_ca_system_score_codex":0.0005236736,"about_ca_system_score_gemma":0.0009542171,"threshold_uncertainty_score":0.99919605},"labels":[],"label_agreement":null},{"id":"W1494502516","doi":"10.1007/978-3-540-69407-6_15","title":"Computable Categoricity of Graphs with Finite Components","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Categorical variable; Graph; Discrete mathematics; Finite graph; Combinatorics","score_opus":0.022347056287216168,"score_gpt":0.22304239964019493,"score_spread":0.20069534335297876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494502516","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013761617,0.00056104554,0.9929051,0.0002554866,0.0014691475,0.00074545125,0.000014974792,0.00029227213,0.0023803834],"genre_scores_gemma":[0.46281645,0.000098402714,0.53618413,0.0004909526,0.00020145373,0.000010635893,0.000014142134,0.000059014805,0.00012480638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929191,0.00009804337,0.0010920768,0.002556926,0.0021927983,0.0011410902],"domain_scores_gemma":[0.99409497,0.001274097,0.0007792678,0.002693364,0.00081503426,0.00034326254],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009451743,0.0010112914,0.0014338514,0.0014844941,0.0003859687,0.00030532115,0.005922148,0.00042651032,0.000020632227],"category_scores_gemma":[0.00007872263,0.0008627653,0.0002717403,0.001912773,0.0022894535,0.0007574571,0.0028127327,0.0012475107,0.000032072603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004843031,0.00045422424,0.0017356832,0.00023030546,0.00009141168,0.00066099054,0.001848106,0.6045936,0.00015012332,0.01599885,0.00007583249,0.37411243],"study_design_scores_gemma":[0.0007799851,0.00074272323,0.0017202542,0.0003753371,0.000018133615,0.0003358641,1.8420823e-7,0.88260317,0.0011380771,0.11018106,0.0008295391,0.0012756535],"about_ca_topic_score_codex":0.00023989042,"about_ca_topic_score_gemma":0.00009476119,"teacher_disagreement_score":0.46144027,"about_ca_system_score_codex":0.0004041494,"about_ca_system_score_gemma":0.0009148669,"threshold_uncertainty_score":0.9994563},"labels":[],"label_agreement":null},{"id":"W1495848779","doi":"10.1007/3-540-36136-7","title":"Algorithms and computation : 13th International Symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 : proceedings","year":2002,"lang":"en","type":"book","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Discrete mathematics; Chordal graph; Combinatorics; Treewidth; Clique problem; Pathwidth; 1-planar graph; Graph","score_opus":0.012903307262344831,"score_gpt":0.21906448728948555,"score_spread":0.2061611800271407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495848779","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042518997,0.00082757045,0.21141456,0.0027129555,0.009149014,0.0013491833,0.00013090041,0.0007328663,0.77364045],"genre_scores_gemma":[0.00021530142,0.00017375287,0.081557564,0.0018601693,0.0013259244,0.000052537787,0.00008130746,0.00010606947,0.9146274],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937733,0.0000453504,0.001113585,0.0021507598,0.0020267258,0.0008903079],"domain_scores_gemma":[0.99663055,0.00033679113,0.00065153546,0.00065075146,0.0012270329,0.00050331623],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045778073,0.0010329306,0.0009357815,0.00034371225,0.00028514842,0.0007660581,0.0022391682,0.0005386452,0.0010279134],"category_scores_gemma":[0.000058364556,0.0010320976,0.00020079238,0.00043120957,0.00021366903,0.0010517472,0.0016481774,0.00091280375,0.00020110604],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005186657,0.00013564689,0.00006166297,0.00009772161,0.00013524653,0.000058285008,0.0002625068,0.0003622022,0.000004311154,0.0021724908,0.9594746,0.037230097],"study_design_scores_gemma":[0.00078771147,0.00012780137,0.00032328008,0.00011370573,0.00004319762,0.00012218703,0.000022753664,0.46867558,0.00001658816,0.0026153345,0.5260321,0.0011197502],"about_ca_topic_score_codex":0.042112913,"about_ca_topic_score_gemma":0.15358524,"teacher_disagreement_score":0.4683134,"about_ca_system_score_codex":0.0020856299,"about_ca_system_score_gemma":0.0012994218,"threshold_uncertainty_score":0.99988526},"labels":[],"label_agreement":null},{"id":"W1498847683","doi":"10.1007/978-3-642-04081-8_20","title":"A Demonic Approach to Information in Probabilistic Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Probabilistic logic; Information system; Theoretical computer science; Artificial intelligence; Electrical engineering","score_opus":0.01772023911460869,"score_gpt":0.2282436103661312,"score_spread":0.2105233712515225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498847683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013995236,0.00025552095,0.9877297,0.00048743273,0.0016002632,0.0019484006,0.000004450764,0.00028298993,0.0075512314],"genre_scores_gemma":[0.23778392,0.000012725996,0.7597016,0.0017795112,0.0004376505,0.00009094769,0.000013540981,0.000033502372,0.00014661952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99438035,0.00009406971,0.0011737533,0.0018016357,0.001509683,0.001040481],"domain_scores_gemma":[0.9963732,0.00045379126,0.00035509077,0.0021114575,0.00039661364,0.00030989118],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020721182,0.00072471803,0.0008663381,0.0019794297,0.00017354892,0.0013140253,0.005042154,0.00043775587,0.0000025431214],"category_scores_gemma":[0.0003063578,0.0006751496,0.00013391809,0.0019044142,0.0003467639,0.0015273801,0.0018311949,0.0010524754,0.00009080662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038150115,0.00005821285,0.00002219135,0.00008612523,0.0000029073642,0.000017113096,0.00095345837,0.5216653,0.0000028442414,0.020706685,0.000010851416,0.45647055],"study_design_scores_gemma":[0.0002456799,0.00023694057,0.0005370201,0.00030755778,0.0000038111466,0.000106073625,3.904278e-7,0.90166074,0.0000120870845,0.09512052,0.001050298,0.0007188672],"about_ca_topic_score_codex":0.00009527922,"about_ca_topic_score_gemma":0.000059367936,"teacher_disagreement_score":0.4557517,"about_ca_system_score_codex":0.0013809676,"about_ca_system_score_gemma":0.00089236937,"threshold_uncertainty_score":0.9997227},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01797516866140384,"score_gpt":0.24184146276996477,"score_spread":0.22386629410856093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499541096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8743827,0.00003321305,0.09898613,0.00095750735,0.00090757187,0.00047011688,0.0000049121622,0.00017844069,0.024079435],"genre_scores_gemma":[0.9473112,8.434404e-7,0.052158315,0.00020483047,0.0001302373,0.0000023863756,1.5132576e-7,0.000008325261,0.00018371054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984027,0.000056375902,0.00038188492,0.00029990854,0.00046923885,0.00038988257],"domain_scores_gemma":[0.99819,0.00047763914,0.0002598106,0.0007015974,0.00028386107,0.00008709898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014297693,0.00016492733,0.00025265702,0.000079176476,0.00009077758,0.000031158477,0.002232646,0.00006507981,0.0000132971745],"category_scores_gemma":[0.00022846043,0.000102625934,0.00014364747,0.00049830397,0.00015282219,0.00040894898,0.0018829276,0.00016769652,0.00000676644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019877138,0.00074029464,0.07531029,0.00012481082,0.000047846486,2.9516508e-7,0.012089953,0.0003727033,0.0027889812,0.870441,0.0011315082,0.0369324],"study_design_scores_gemma":[0.0013448318,0.0012151041,0.6539373,0.00025088456,0.00006101406,0.000084543855,0.0026932932,0.0809133,0.14635828,0.11027035,0.0018199781,0.00105113],"about_ca_topic_score_codex":0.000012578965,"about_ca_topic_score_gemma":9.0774796e-7,"teacher_disagreement_score":0.7601707,"about_ca_system_score_codex":0.000038961025,"about_ca_system_score_gemma":0.00004160366,"threshold_uncertainty_score":0.4184964},"labels":[],"label_agreement":null},{"id":"W1503390214","doi":"10.1007/bfb0032065","title":"Provable computable functions on abstract data types","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Assertion; Primitive recursive function; Corollary; Computable function; Computability; Scheme (mathematics); Computer science; Context (archaeology); Theoretical computer science; Data type; Mathematics; Type (biology); Natural number; Function (biology); Algebra over a field; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.04394122110418095,"score_gpt":0.2713834169118484,"score_spread":0.22744219580766747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503390214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050053117,0.00054863864,0.9739966,0.0017564308,0.0037956187,0.0007784477,0.000051049756,0.00055854896,0.018464644],"genre_scores_gemma":[0.07006395,0.00006567637,0.91967547,0.0030513834,0.0032220625,0.00001593098,0.00011544952,0.00012403239,0.0036660645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99236745,0.000049466737,0.00090551097,0.00376223,0.0017188395,0.001196535],"domain_scores_gemma":[0.99169385,0.001088931,0.00043512453,0.006065665,0.00038755048,0.000328893],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018317098,0.00091564975,0.00087058,0.0010460286,0.00053432945,0.0012764969,0.010447732,0.00046705516,0.00016472703],"category_scores_gemma":[0.0001980302,0.0008378815,0.00016462425,0.0010649147,0.00080896565,0.0015320844,0.0059796805,0.0016451299,0.0006799629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072235857,0.00015750852,0.000026235542,0.00003707119,0.000021721202,0.00007735815,0.00012426804,0.20775726,0.000018099265,0.006347867,0.00041885822,0.7850065],"study_design_scores_gemma":[0.00031966827,0.00032165583,0.00030096158,0.0002655723,0.000015776259,0.000102974074,1.6133703e-7,0.9078076,0.00014539297,0.059516918,0.030162059,0.0010412452],"about_ca_topic_score_codex":0.000092031194,"about_ca_topic_score_gemma":0.0002477742,"teacher_disagreement_score":0.7839653,"about_ca_system_score_codex":0.0006492065,"about_ca_system_score_gemma":0.0012413962,"threshold_uncertainty_score":0.99976027},"labels":[],"label_agreement":null},{"id":"W1504640313","doi":"10.2178/jsl/1174668397","title":"Bounding homogenous models","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Decidability; Bounding overwatch; Homogeneous; Mathematics; Peano axioms; Extension (predicate logic); Discrete mathematics; Combinatorics; Computer science; Physics; Artificial intelligence","score_opus":0.031414162483599004,"score_gpt":0.2687297140358942,"score_spread":0.23731555155229517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504640313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13855216,0.00092126033,0.8531438,0.0006790047,0.0013652378,0.0000998685,4.3394152e-7,0.00007482077,0.005163377],"genre_scores_gemma":[0.8916911,0.00004497444,0.107125014,0.00047204352,0.00059696485,6.138782e-7,1.3930357e-7,0.00001029082,0.00005886259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755996,0.00008764877,0.00082378584,0.00027408215,0.0006879475,0.0005666008],"domain_scores_gemma":[0.9980449,0.00028480857,0.00049557956,0.00050768285,0.00038343342,0.0002835838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002838134,0.00019854434,0.00043122348,0.00038112327,0.0001692485,0.000214114,0.0016477698,0.00010913429,0.000017650778],"category_scores_gemma":[0.00011454809,0.00015496729,0.00024964564,0.000652662,0.00008094174,0.00083267095,0.0003340221,0.00041905363,0.000026747746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008615601,0.0016900881,0.0035620038,0.000098440774,0.00027208021,0.0036073714,0.012695964,0.03242441,0.0073341224,0.5263402,0.0014732366,0.41041595],"study_design_scores_gemma":[0.0011217808,0.0009819474,0.010774421,0.000064762855,0.000037496,0.006273782,0.00025940445,0.07826738,0.001401924,0.89784694,0.0023908978,0.0005792942],"about_ca_topic_score_codex":0.000015206168,"about_ca_topic_score_gemma":0.000005605085,"teacher_disagreement_score":0.75313896,"about_ca_system_score_codex":0.000250211,"about_ca_system_score_gemma":0.00018321609,"threshold_uncertainty_score":0.6319383},"labels":[],"label_agreement":null},{"id":"W1513242670","doi":"10.1090/pspum/073","title":"Graphs and Patterns in Mathematics and Theoretical Physics","year":2005,"lang":"en","type":"book","venue":"Proceedings of symposia in pure mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics education; Mathematics; Theoretical physics; Physics","score_opus":0.00884121184517954,"score_gpt":0.21915499442110978,"score_spread":0.21031378257593022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513242670","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.414649,0.006146933,0.094172336,0.0039789136,0.00090670394,0.011691798,0.00016446559,0.0014044053,0.46688545],"genre_scores_gemma":[0.0962822,0.0020160407,0.8960015,0.00016191695,0.00033969033,0.00021463897,0.000011367136,0.0002714817,0.0047011673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967651,0.000008662978,0.001208775,0.000818593,0.00069604325,0.00050281954],"domain_scores_gemma":[0.9980914,0.0005049634,0.0006228979,0.0003996665,0.00023247545,0.0001485886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000938296,0.0006332748,0.0012415458,0.000429757,0.000042535452,0.00026845327,0.0011597067,0.0004922371,0.000007803239],"category_scores_gemma":[0.00013817305,0.0005890578,0.000120356126,0.00036980287,0.0004941925,0.00041629036,0.0011993423,0.00073387974,0.000003278154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022189888,0.0003977755,0.00071599457,0.003830359,0.000025394122,0.0000070563897,0.006397336,0.0000033461245,0.000060910606,0.9842843,0.00009557466,0.0041797585],"study_design_scores_gemma":[0.0004357224,0.00013359863,0.0001739887,0.001909186,0.00004267722,0.00011159569,0.00017265261,0.060449906,0.000148525,0.9357971,0.00008796573,0.0005371147],"about_ca_topic_score_codex":0.0000020451946,"about_ca_topic_score_gemma":0.0000042664606,"teacher_disagreement_score":0.80182916,"about_ca_system_score_codex":0.00015833921,"about_ca_system_score_gemma":0.00009610588,"threshold_uncertainty_score":0.9996561},"labels":[],"label_agreement":null},{"id":"W1521571748","doi":"10.1007/3-540-44491-2_13","title":"Logical Decision Rules: Teaching C4.5 to Speak Prolog","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Prolog; Computer science; Programming language; Logic programming; Artificial intelligence","score_opus":0.020074059094574808,"score_gpt":0.26696229658448484,"score_spread":0.24688823748991004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521571748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010008373,0.00026363242,0.9821266,0.0015143235,0.0025058938,0.0010897802,0.000008516724,0.00054672844,0.010943691],"genre_scores_gemma":[0.07373775,0.000021711663,0.9210906,0.0038223823,0.0010288004,0.000020574491,0.000005500066,0.00005397384,0.00021871256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99123424,0.00014747898,0.0011019808,0.0039161,0.0021352074,0.0014650006],"domain_scores_gemma":[0.9940409,0.001666606,0.0002846504,0.0031396167,0.0002675907,0.0006006037],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025928465,0.0010594637,0.001103272,0.0014290476,0.0005650437,0.0012710545,0.008745113,0.0006614129,0.00012974978],"category_scores_gemma":[0.00046166516,0.00089788885,0.00031254842,0.0008559715,0.00085810106,0.0007595517,0.004976068,0.0021864374,0.00063052855],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016581907,0.00008497119,0.00004454843,0.000014015941,0.000006977091,0.00022110513,0.00061510137,0.0467899,0.000025199859,0.016330186,0.00004966733,0.93580174],"study_design_scores_gemma":[0.0003019542,0.00064958597,0.00065657037,0.00037042043,0.000008007441,0.00025329491,1.479099e-7,0.3886933,0.00009928552,0.5992733,0.008518121,0.0011759843],"about_ca_topic_score_codex":0.000045180044,"about_ca_topic_score_gemma":0.000079653124,"teacher_disagreement_score":0.93462574,"about_ca_system_score_codex":0.0007277585,"about_ca_system_score_gemma":0.0005913389,"threshold_uncertainty_score":0.9997657},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.040473696472154964,"score_gpt":0.2762703952587099,"score_spread":0.23579669878655493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526810261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22545716,0.000067689376,0.77145946,0.00075422344,0.000317637,0.00014628576,0.0000014243741,0.00010095795,0.0016951704],"genre_scores_gemma":[0.59761983,0.00000704703,0.4021436,0.000096085336,0.000077025,0.0000025496468,2.6375443e-7,0.000009769315,0.0000438301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971085,0.00024781298,0.00093077373,0.00037414973,0.00088327413,0.00045547084],"domain_scores_gemma":[0.9976308,0.0005860191,0.0002920021,0.00082615233,0.0003197641,0.00034530915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012288804,0.00023197506,0.00057564705,0.000114007504,0.0002404743,0.00009773251,0.0014831381,0.000098730416,0.00020081615],"category_scores_gemma":[0.00043378133,0.00018216233,0.0002568161,0.00044027017,0.0003322975,0.00041124003,0.0005610916,0.00048458955,0.00012914646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015777217,0.017556243,0.03602728,0.001930573,0.0007264134,0.0030571928,0.027073301,0.00631419,0.0054662786,0.49539614,0.022097196,0.3841974],"study_design_scores_gemma":[0.0007874057,0.00036627412,0.016007505,0.000082432794,0.000016869357,0.0062080044,0.00003072845,0.34956008,0.0015097385,0.6246868,0.00035900154,0.00038519877],"about_ca_topic_score_codex":0.0000027160281,"about_ca_topic_score_gemma":3.578672e-7,"teacher_disagreement_score":0.38381222,"about_ca_system_score_codex":0.00009631108,"about_ca_system_score_gemma":0.0001909211,"threshold_uncertainty_score":0.7428364},"labels":[],"label_agreement":null},{"id":"W1528942851","doi":"10.1609/aimag.v31i2.2292","title":"SARA 2009: The Eighth Symposium on Abstraction, Reformulation, and Approximation","year":2010,"lang":"en","type":"article","venue":"AI Magazine","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Abstraction; Computer science; Programming language; Software engineering; Calculus (dental); Theoretical computer science; Epistemology; Philosophy; Medicine","score_opus":0.008406835382477247,"score_gpt":0.2374518104324796,"score_spread":0.22904497505000235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528942851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32188678,0.00009018217,0.55725414,0.085587464,0.0036938307,0.0013429569,0.000010915289,0.00085823174,0.029275523],"genre_scores_gemma":[0.98028487,0.000009577191,0.017526828,0.001223144,0.00033905637,0.000020120011,0.000008705579,0.00001065556,0.0005770188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882066,0.000045050674,0.00024854942,0.00039246675,0.00028872013,0.00020457902],"domain_scores_gemma":[0.998712,0.00014893308,0.00010599299,0.0007866351,0.00017436434,0.0000720465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005057268,0.0001469429,0.000116382704,0.00007798763,0.00022838978,0.00023435359,0.0004551356,0.00007857453,0.00003282501],"category_scores_gemma":[0.0000628787,0.000097236545,0.000035434587,0.00029215903,0.00007655092,0.00058463303,0.00015953784,0.00034056848,0.00020640547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060971823,0.0009062736,0.0073013427,0.00010008049,0.00006940145,0.000020128216,0.0026060964,0.004466716,0.054651625,0.516754,0.028717432,0.38434598],"study_design_scores_gemma":[0.0006370182,0.0002483438,0.3649808,0.000012251162,0.000013715306,0.00013398536,0.000008303919,0.49695414,0.0029735682,0.06379496,0.06984301,0.00039990075],"about_ca_topic_score_codex":0.00002021105,"about_ca_topic_score_gemma":0.00003984209,"teacher_disagreement_score":0.6583981,"about_ca_system_score_codex":0.000030050065,"about_ca_system_score_gemma":0.00003427977,"threshold_uncertainty_score":0.39651912},"labels":[],"label_agreement":null},{"id":"W1529889279","doi":"10.1007/s00153-017-0545-8","title":"Equimorphy: the case of chains","year":2017,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Corollary; Isomorphism (crystallography); Mathematics; Chain (unit); Class (philosophy); Algebra over a field; Pure mathematics; Combinatorics; Discrete mathematics; Computer science; Crystal structure; Crystallography; Artificial intelligence","score_opus":0.0625853413362719,"score_gpt":0.3267031561761004,"score_spread":0.2641178148398285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529889279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01465598,0.000020655414,0.97371334,0.0030240596,0.00015697349,0.0006142801,0.000027273161,0.00006860268,0.00771885],"genre_scores_gemma":[0.7133479,0.000001250953,0.28627083,0.00013508412,0.00007176578,0.00006344167,0.0000013247278,0.000007729864,0.00010068775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987366,0.00007997959,0.00032820023,0.0003553195,0.00016016772,0.00033970346],"domain_scores_gemma":[0.9959587,0.0017919765,0.00022928978,0.0018669877,0.00005905951,0.00009401206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078978715,0.00015657941,0.00029671245,0.000039135673,0.00053780706,0.000159278,0.002195036,0.000038168775,0.000021448428],"category_scores_gemma":[0.0011188413,0.00009156892,0.00021515443,0.000054879605,0.00052206067,0.00016041336,0.0011754117,0.0001282155,0.00005267337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004229724,0.00014000839,0.000016881468,0.00006846323,0.000016848391,0.00008736445,0.0005685628,0.000016155796,0.0001257021,0.98364985,0.00015276148,0.015153143],"study_design_scores_gemma":[0.00018254296,0.00017078234,0.00033550267,0.000013931941,0.000009868501,0.00032907032,0.000028708657,0.23717873,0.00019123433,0.76132435,0.0001414526,0.00009382307],"about_ca_topic_score_codex":0.000021119326,"about_ca_topic_score_gemma":0.00002481545,"teacher_disagreement_score":0.6986919,"about_ca_system_score_codex":0.000014242909,"about_ca_system_score_gemma":0.000035897137,"threshold_uncertainty_score":0.41364315},"labels":[],"label_agreement":null},{"id":"W1536365843","doi":"10.1007/978-3-540-74510-5_41","title":"Generic Complexity of Undecidable Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Undecidable problem; Decidability; Turing machine; Halting problem; Construct (python library); Word problem (mathematics education); Mathematics; Computational complexity theory; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Arithmetic; Programming language","score_opus":0.07644337339592297,"score_gpt":0.27647507757776096,"score_spread":0.200031704181838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536365843","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001429746,0.00070391904,0.9869313,0.00039141864,0.0021849289,0.0008078371,0.000009066766,0.00025869333,0.008569851],"genre_scores_gemma":[0.070365146,0.00003568586,0.9280221,0.00075057254,0.0004725218,0.000009718441,0.0000066872344,0.000050336323,0.0002872233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993299,0.00006837767,0.0012104072,0.002346638,0.0019292925,0.0011462542],"domain_scores_gemma":[0.9947972,0.0007515882,0.0006774277,0.002787672,0.00068031123,0.00030576784],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023782775,0.0007926307,0.0011105449,0.0013503606,0.00025824533,0.00037561342,0.006414457,0.00048142555,0.000060302005],"category_scores_gemma":[0.00011936493,0.00073990016,0.00028175584,0.0017449851,0.002789948,0.00059264916,0.0036577934,0.0010441109,0.000045642824],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007998453,0.00018102139,0.00020231128,0.00019661953,0.000027469145,0.00010547713,0.0006564633,0.101684056,0.00027761539,0.08922474,0.000028524355,0.8074077],"study_design_scores_gemma":[0.0002721046,0.0002906244,0.00051130756,0.00021478631,0.000007943717,0.000084237836,1.1522976e-7,0.50636727,0.0014106982,0.48899865,0.0011177437,0.0007245224],"about_ca_topic_score_codex":0.00013908227,"about_ca_topic_score_gemma":0.0003673386,"teacher_disagreement_score":0.8066832,"about_ca_system_score_codex":0.0006501957,"about_ca_system_score_gemma":0.00093336473,"threshold_uncertainty_score":0.9999239},"labels":[],"label_agreement":null},{"id":"W1537398163","doi":"10.1007/978-3-642-31951-8_2","title":"Beyond Reward: The Problem of Knowledge and Data","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Commonsense knowledge; Meaning (existential); Knowledge base; Artificial intelligence; Reinforcement learning; Knowledge management; Cognitive science; Epistemology; Psychology","score_opus":0.03249919021536033,"score_gpt":0.27527754977510144,"score_spread":0.2427783595597411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537398163","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005670009,0.0068740463,0.9849129,0.0011568988,0.0011536229,0.0006652183,0.000020404073,0.00010897059,0.0050512874],"genre_scores_gemma":[0.07931632,0.00020543013,0.91868347,0.00055742095,0.00092474977,0.000010547652,0.000012633128,0.000044141132,0.00024528714],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552256,0.00010349507,0.00070866744,0.001989762,0.00093059766,0.0007449152],"domain_scores_gemma":[0.9932174,0.001379121,0.00040654602,0.004464792,0.0003287643,0.00020334614],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0032480317,0.0005597124,0.0006783772,0.00046785412,0.00028156844,0.00035705915,0.010132955,0.00029021097,0.000015161265],"category_scores_gemma":[0.00009223477,0.00039436464,0.00008968595,0.00075162493,0.0019500194,0.00092389813,0.013244734,0.0008973255,0.000021032612],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022530187,0.000052771076,0.00017426944,0.000085116124,0.000013517691,0.00000839286,0.0013452788,0.0006969285,0.00002765624,0.028198056,0.0000758401,0.96931994],"study_design_scores_gemma":[0.00032055334,0.00023533283,0.0011095573,0.0003175378,0.000031892352,0.0002037226,3.8614064e-7,0.44477126,0.00032708343,0.5369332,0.01484384,0.0009056608],"about_ca_topic_score_codex":0.00003505995,"about_ca_topic_score_gemma":0.00012907549,"teacher_disagreement_score":0.96841425,"about_ca_system_score_codex":0.00014416513,"about_ca_system_score_gemma":0.00062032306,"threshold_uncertainty_score":0.9998508},"labels":[],"label_agreement":null},{"id":"W1538905248","doi":"10.1007/978-3-7908-1846-8_14","title":"Expressiveness of $-Calculus: What Matters?","year":2000,"lang":"en","type":"book-chapter","venue":"Intelligent Information Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Process calculus; Computer science; Turing machine; Theoretical computer science; Synchronization (alternating current); Automaton; Situation calculus; Representation (politics); Process (computing); Artificial intelligence; Computation; Algorithm; Programming language","score_opus":0.022598745789686604,"score_gpt":0.23257042114331786,"score_spread":0.20997167535363126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538905248","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025274534,0.0019515177,0.811292,0.00024624358,0.004773693,0.0013722683,0.000056976693,0.00034771886,0.17993428],"genre_scores_gemma":[0.27234724,0.031397842,0.04550276,0.01701576,0.007794211,0.002149069,0.0037225008,0.0010752606,0.61899537],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99614304,0.00006649666,0.001960746,0.0003981934,0.0010931531,0.0003383901],"domain_scores_gemma":[0.9962957,0.00021001909,0.0012398231,0.001502395,0.0005964253,0.00015567036],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052904984,0.00050492183,0.0007804915,0.00057631126,0.00008147183,0.0010599665,0.0018649682,0.00041910372,0.00027685615],"category_scores_gemma":[0.000015315662,0.0004719977,0.00032532957,0.00012956442,0.000110801484,0.004462646,0.00047772346,0.0003219332,0.0022240384],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029172483,0.000059209127,0.0000045097404,0.0013293289,0.0002049136,0.000014354116,0.006274265,0.015611921,0.0000076096085,0.43304345,0.00447681,0.5389445],"study_design_scores_gemma":[0.00019042881,0.00009530774,0.0000059100526,0.001860645,0.000022980199,0.00010501239,0.00031578992,0.04674353,0.0005275734,0.0057043834,0.94372153,0.0007069314],"about_ca_topic_score_codex":0.0000640986,"about_ca_topic_score_gemma":0.0000012032177,"teacher_disagreement_score":0.9392447,"about_ca_system_score_codex":0.00025011203,"about_ca_system_score_gemma":0.00014519568,"threshold_uncertainty_score":0.99997705},"labels":[],"label_agreement":null},{"id":"W1542485741","doi":"10.11647/obp.0008.01","title":"Never Say Always Again: Reflections on the Numbers Game","year":2010,"lang":"en","type":"book-chapter","venue":"Open Book Publishers","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Mathematical economics; Sociology; History; Economics","score_opus":0.06231292320551908,"score_gpt":0.2916600403319586,"score_spread":0.22934711712643951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542485741","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036847052,0.000089951325,0.008894264,0.029344304,0.00390461,0.001763266,0.000018168885,0.00039130216,0.9555904],"genre_scores_gemma":[0.000170806,0.000023301212,0.014107834,0.024633037,0.0007041607,0.0001663283,0.00003857352,0.00014033314,0.96001565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99530786,0.00016596282,0.000695553,0.001898099,0.0011283682,0.0008041801],"domain_scores_gemma":[0.99351215,0.0007523187,0.0005079007,0.004390696,0.00043055988,0.0004063736],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016615341,0.0008251409,0.00071666454,0.00030141376,0.0006789185,0.008990466,0.010249655,0.00080562825,0.0047334037],"category_scores_gemma":[0.00025939618,0.0006325363,0.00045764548,0.00029127093,0.000492646,0.0060203294,0.003975425,0.0027039084,0.0015612717],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010027642,0.000061405866,0.000002150626,0.0000075116336,0.00011319415,0.000033937515,0.0003669618,0.00003892209,0.000016277898,0.57553065,0.4086757,0.015143243],"study_design_scores_gemma":[0.00025216216,0.00012299421,0.000024346353,0.00005686932,0.000024733548,0.000036271525,0.000018899136,0.0004242044,0.000030351423,0.11182181,0.88648266,0.0007046874],"about_ca_topic_score_codex":0.0004648188,"about_ca_topic_score_gemma":0.00059834454,"teacher_disagreement_score":0.47780696,"about_ca_system_score_codex":0.00052795827,"about_ca_system_score_gemma":0.00088977034,"threshold_uncertainty_score":0.99961257},"labels":[],"label_agreement":null},{"id":"W1556245666","doi":"10.1109/lics.2004.52","title":"VTC: A Second-Order Theory for TC","year":2004,"lang":"en","type":"article","venue":"TSpace","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Order (exchange); Discrete mathematics; Class (philosophy); Combinatorics; Model theory; Axiom; Polynomial; Computer science; Mathematical analysis","score_opus":0.021996272043038598,"score_gpt":0.3094834608469236,"score_spread":0.28748718880388496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556245666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01842581,0.00021547475,0.97015435,0.0035514892,0.00056621514,0.0003931568,0.0000020132768,0.00036065443,0.0063308184],"genre_scores_gemma":[0.36761555,0.000004167793,0.624456,0.0016431594,0.0003028383,0.00009426269,0.000002670456,0.000028325549,0.0058530187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869287,0.000071732786,0.00015967575,0.0004965584,0.00018869396,0.0003904796],"domain_scores_gemma":[0.9985727,0.00033668644,0.00006022121,0.0007837703,0.00013679308,0.00010984528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069508905,0.00016362402,0.00018338056,0.00006763374,0.0001230215,0.00012402145,0.00087942806,0.00007047868,0.00013044216],"category_scores_gemma":[0.00017218274,0.00014887932,0.00009897395,0.00036136815,0.00006726011,0.00021315308,0.0003317769,0.0001224137,0.00012256068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002793208,0.00032212274,0.00007941436,0.00006998369,0.00004435007,0.000021162934,0.011918219,0.0024972337,0.0010246849,0.8788948,0.0022480828,0.10285201],"study_design_scores_gemma":[0.002085522,0.00042611043,0.0015651605,0.000025118734,0.000013280231,0.0000663365,0.00041609822,0.027879778,0.006252601,0.89642864,0.06417319,0.0006681492],"about_ca_topic_score_codex":0.000029909963,"about_ca_topic_score_gemma":0.000045924528,"teacher_disagreement_score":0.34918973,"about_ca_system_score_codex":0.000098558485,"about_ca_system_score_gemma":0.00016339208,"threshold_uncertainty_score":0.6071122},"labels":[],"label_agreement":null},{"id":"W1561454518","doi":"","title":"Sending Large Files without Mucking Up the Works","year":2005,"lang":"en","type":"article","venue":"Teacher librarian","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"World Wide Web; Computer science","score_opus":0.025715802097390657,"score_gpt":0.25483031634577674,"score_spread":0.22911451424838608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561454518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041537806,0.00068079773,0.9117059,0.017063405,0.0014181274,0.000492046,0.0000041670046,0.0016863683,0.025411393],"genre_scores_gemma":[0.9232012,0.000004806527,0.07252417,0.0011242762,0.0010797341,0.00002104583,0.0000041066833,0.000028801078,0.002011856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977269,0.00030205245,0.0003245337,0.0006232172,0.00037155076,0.000651705],"domain_scores_gemma":[0.9982191,0.00023563122,0.00011944971,0.0012504115,0.00002698199,0.0001484299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009309917,0.00025845066,0.00023569455,0.00010042754,0.00040363072,0.0009776993,0.0018733416,0.00012886724,0.00042302464],"category_scores_gemma":[0.00008230518,0.0001879186,0.0001280332,0.0005460019,0.00007924737,0.0018755348,0.0011700188,0.00057571894,0.00019218211],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009204793,0.00031542603,0.031530447,0.000014649596,0.000072365765,0.00001907043,0.017569587,0.00055225077,0.00008810865,0.100526765,0.010493697,0.8388084],"study_design_scores_gemma":[0.0010063762,0.00005644504,0.04318089,0.00008801384,0.000020611868,0.00006761155,0.0006453773,0.73205394,0.0006280673,0.013475788,0.20798811,0.0007887426],"about_ca_topic_score_codex":0.000023381002,"about_ca_topic_score_gemma":0.000028375016,"teacher_disagreement_score":0.8816634,"about_ca_system_score_codex":0.00007389978,"about_ca_system_score_gemma":0.00008420133,"threshold_uncertainty_score":0.94279766},"labels":[],"label_agreement":null},{"id":"W1565737137","doi":"10.1007/978-3-319-06880-0","title":"Horizons of the Mind. A Tribute to Prakash Panangaden","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Tribute; Computer science; Computer graphics (images); Artificial intelligence; Cognitive science; Art history; Art; Psychology","score_opus":0.01281223973820065,"score_gpt":0.2435674027424812,"score_spread":0.23075516300428056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565737137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042610918,0.0001668156,0.9876137,0.00548041,0.0041210875,0.0011345942,0.000019005676,0.000118208496,0.0009200928],"genre_scores_gemma":[0.08258603,0.000006572194,0.9099082,0.003065277,0.0016040138,0.000058004756,0.000006414754,0.00006795699,0.0026975414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99341714,0.0002930715,0.0009383694,0.0022604696,0.001980081,0.0011108662],"domain_scores_gemma":[0.99306095,0.0014762817,0.00055177056,0.0040313085,0.00056078006,0.0003189273],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002386672,0.00069707626,0.0009849613,0.0008039648,0.00031746156,0.0004785725,0.012324418,0.00041612098,0.000011161783],"category_scores_gemma":[0.0007308828,0.0005111477,0.00035760188,0.0035735136,0.001053114,0.00036707317,0.006846793,0.0011152002,0.00005418435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065597587,0.00012597669,0.0002780018,0.000093785886,0.000022232754,0.000029292609,0.0017466188,0.04201342,0.00021394492,0.0017669658,0.0023423992,0.9513608],"study_design_scores_gemma":[0.0008130151,0.0012460105,0.0042083883,0.0010984322,0.00004452844,0.00018713187,6.120915e-7,0.75506216,0.00732693,0.17696679,0.05098251,0.0020634844],"about_ca_topic_score_codex":0.000047090398,"about_ca_topic_score_gemma":0.00031065123,"teacher_disagreement_score":0.9492973,"about_ca_system_score_codex":0.00074707303,"about_ca_system_score_gemma":0.0024142817,"threshold_uncertainty_score":0.999734},"labels":[],"label_agreement":null},{"id":"W1569306067","doi":"","title":"Future Prospects for Computer-Assisted Mathematics","year":2005,"lang":"en","type":"article","venue":"University of North Texas Digital Library (University of North Texas)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Context (archaeology); Computer science; Computation; Software; Computer software; Mathematics education; Theoretical computer science; Mathematics; Software engineering; Algorithm; Programming language","score_opus":0.011224954690092865,"score_gpt":0.17376625486848374,"score_spread":0.16254130017839089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569306067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6860683,0.000066025306,0.30745074,0.0015406631,0.00024108763,0.00094453275,0.0007731033,0.000601995,0.0023135638],"genre_scores_gemma":[0.5622202,0.00004620319,0.43443578,0.00008745324,0.00021076943,6.6103894e-8,0.00027007962,0.000031507945,0.002697914],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99772143,0.000051856787,0.00033457443,0.00083231897,0.0005308539,0.00052896136],"domain_scores_gemma":[0.99756765,0.0002630093,0.0005516666,0.0010164402,0.00026761997,0.00033359395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009017191,0.0003993207,0.00070670946,0.00041139196,0.0003326766,0.00013176611,0.0031351792,0.00014867118,0.000090005706],"category_scores_gemma":[0.000013022482,0.00051057833,0.00050504744,0.0011295432,0.00043160826,0.004905225,0.0019486606,0.00025430653,0.00009261966],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116871146,0.0014926934,0.82432896,0.00034454468,0.00020190795,0.00010263884,0.00043966222,0.0011063791,1.7782516e-7,0.0040161116,0.0057045496,0.1621455],"study_design_scores_gemma":[0.0015423051,0.00052085944,0.89900583,0.000056906578,0.000057118552,0.000026175778,0.000056327644,0.036799375,0.000011845439,0.0004909382,0.06087023,0.0005621093],"about_ca_topic_score_codex":0.000033562632,"about_ca_topic_score_gemma":0.00044528797,"teacher_disagreement_score":0.16158338,"about_ca_system_score_codex":0.00011134298,"about_ca_system_score_gemma":0.0002704732,"threshold_uncertainty_score":0.9997346},"labels":[],"label_agreement":null},{"id":"W1569725705","doi":"10.1017/cbo9780511546907.007","title":"Randomness Measurements and <i>m</i>-Sequences","year":2005,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Sequence (biology); Golomb coding; Mathematics; Section (typography); Property (philosophy); Discrete mathematics; Pseudorandom number generator; Field (mathematics); Combinatorics; Algorithm; Computer science; Statistics; Pure mathematics; Artificial intelligence","score_opus":0.041299324601440944,"score_gpt":0.20682215964462433,"score_spread":0.16552283504318338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569725705","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009064161,0.0007685816,0.041491594,0.000079426194,0.00051102735,0.0006269566,0.00004295222,0.00036580648,0.95602304],"genre_scores_gemma":[0.002027453,0.00018575307,0.0066391304,0.00014959773,0.000235489,0.0000016169798,0.000009171362,0.000034723547,0.99071705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99738145,0.00010439331,0.00029665092,0.0011330496,0.0006623822,0.0004220634],"domain_scores_gemma":[0.99792945,0.00014860995,0.00027758846,0.0010579767,0.00029905344,0.0002873406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000382475,0.00053650414,0.0006290841,0.0002288162,0.00029288058,0.00021886092,0.0018100701,0.0003433148,0.000003468356],"category_scores_gemma":[0.000017175786,0.0005932266,0.0002124606,0.00002024183,0.00041486384,0.0003558637,0.0016089245,0.00046026582,0.000013732922],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006163646,0.000032508837,0.000016096898,0.00012140412,0.00022271353,0.00025978268,0.00013701734,0.000030497718,0.00005795454,0.9313315,0.006767798,0.060961064],"study_design_scores_gemma":[0.0022498022,0.000098418466,0.00007392078,0.00016361348,0.0001494361,0.000089602145,0.000007501309,0.0023135662,0.00031570595,0.00024005875,0.9932617,0.0010366886],"about_ca_topic_score_codex":0.000106320666,"about_ca_topic_score_gemma":0.000007298405,"teacher_disagreement_score":0.9864939,"about_ca_system_score_codex":0.00027219477,"about_ca_system_score_gemma":0.00018121998,"threshold_uncertainty_score":0.9996519},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020637534447903984,"score_gpt":0.23768265941672223,"score_spread":0.21704512496881825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574394872","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017932145,0.0010123217,0.5817299,0.0004596769,0.00029955318,0.0011839258,0.00004442064,0.00064437476,0.3966937],"genre_scores_gemma":[0.3266191,0.0053693275,0.3969689,0.0023658532,0.001247096,0.00031687622,0.00023935082,0.00046559056,0.2664079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964969,0.00077842124,0.0005884196,0.0010941405,0.0004881501,0.00055393873],"domain_scores_gemma":[0.9969266,0.0014738515,0.00013886933,0.0009523011,0.000091480404,0.00041691237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027919945,0.00057917373,0.0009732758,0.00011567925,0.00020443992,0.0004656049,0.0007271851,0.00051602325,0.00041981105],"category_scores_gemma":[0.000109312015,0.00044132117,0.00025225253,0.00021381,0.00081082317,0.00015097776,0.0009050171,0.00057339616,0.00015574794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009274157,0.0003981235,0.0013640028,0.00047223177,0.00012797095,0.00013213229,0.0005318447,0.0000015650319,0.0000013229484,0.8497346,0.003465625,0.1437613],"study_design_scores_gemma":[0.00025356203,0.00013472856,0.006912184,0.000104050145,0.000050469927,0.0001790035,0.0000041230405,0.005106636,0.000003849164,0.981537,0.0050957548,0.0006186595],"about_ca_topic_score_codex":0.000008814134,"about_ca_topic_score_gemma":0.000009062952,"teacher_disagreement_score":0.30868694,"about_ca_system_score_codex":0.00003568781,"about_ca_system_score_gemma":0.00006622675,"threshold_uncertainty_score":0.99980384},"labels":[],"label_agreement":null},{"id":"W1577042948","doi":"10.4230/lipics.ccc.2017.16","title":"Information complexity is computable","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computable general equilibrium; Computer science; Economics; Microeconomics","score_opus":0.05894242586725465,"score_gpt":0.29261671203688366,"score_spread":0.23367428616962901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577042948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019427884,0.0001231637,0.95241874,0.0017146199,0.006652889,0.0041419016,0.0029715912,0.0014544261,0.011094803],"genre_scores_gemma":[0.20829543,0.00008366724,0.77225286,0.0091811875,0.0012157444,0.0007925445,0.0075723073,0.00017284743,0.00043338162],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920818,0.00016053826,0.0033723328,0.00077447697,0.0019017562,0.0017090945],"domain_scores_gemma":[0.99069506,0.0002741815,0.0020442838,0.0037642284,0.002451934,0.00077032775],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.0024227998,0.0013673162,0.0017011451,0.00083922886,0.0005814537,0.003176591,0.006146108,0.0011121435,0.000070391674],"category_scores_gemma":[0.00026707677,0.0013461444,0.0008199657,0.00076693326,0.00040948272,0.0056161555,0.010597053,0.0020810484,0.0009230132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041331584,0.0031069973,0.006116129,0.014297471,0.0019277479,0.0000250936,0.15603255,0.048719864,0.000006022532,0.10252962,0.4285978,0.23822738],"study_design_scores_gemma":[0.002367268,0.00026415434,0.00044972546,0.0002343416,0.000055718712,0.000077476725,0.0004955514,0.7623255,0.000090410365,0.056077674,0.17616466,0.0013975059],"about_ca_topic_score_codex":0.00019797531,"about_ca_topic_score_gemma":0.00002314037,"teacher_disagreement_score":0.71360564,"about_ca_system_score_codex":0.0010747198,"about_ca_system_score_gemma":0.0009686549,"threshold_uncertainty_score":0.99990773},"labels":[],"label_agreement":null},{"id":"W1578863054","doi":"10.1007/3-540-39568-7_38","title":"Sequence Complexity as a Test for Cryptographic Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Plaintext; Ciphertext; Mathematics; Computational complexity theory; Algorithm; Encryption; Cryptography; Sequence (biology); Theoretical computer science; Computer science","score_opus":0.07686619966551514,"score_gpt":0.3052293521594427,"score_spread":0.22836315249392755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578863054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085986474,0.0008351425,0.9875272,0.00064452906,0.004513743,0.0020922106,0.00004601173,0.0006216174,0.003633545],"genre_scores_gemma":[0.09015429,0.000042683354,0.90615594,0.0017827895,0.001379391,0.00008208308,0.000018517674,0.00009556179,0.00028876387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99144745,0.00007178775,0.0012801851,0.003507659,0.0019935886,0.0016993546],"domain_scores_gemma":[0.99090105,0.0036894893,0.0006659286,0.0031387217,0.0010945718,0.00051025127],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033302775,0.0011400131,0.0012556091,0.0018220431,0.0006446296,0.0014504314,0.007677839,0.00069336704,0.000019261373],"category_scores_gemma":[0.0006406025,0.0010860285,0.00043298642,0.0018263013,0.0026451142,0.0008157956,0.0025247836,0.0013078935,0.000077046134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022845981,0.00025098884,0.00033775746,0.00042858784,0.000045019442,0.00036721272,0.0007613761,0.030718967,0.00027200405,0.37321585,0.000058842914,0.5935205],"study_design_scores_gemma":[0.00035613848,0.0005594808,0.00016945384,0.00035181045,0.000012099412,0.000304303,2.9646228e-7,0.59664077,0.00016982782,0.397675,0.0027367529,0.0010240884],"about_ca_topic_score_codex":0.00021539163,"about_ca_topic_score_gemma":0.00023483344,"teacher_disagreement_score":0.59249645,"about_ca_system_score_codex":0.0008128556,"about_ca_system_score_gemma":0.0012191018,"threshold_uncertainty_score":0.99958616},"labels":[],"label_agreement":null},{"id":"W1582149994","doi":"","title":"Mastering Algorithms with C","year":2000,"lang":"en","type":"article","venue":"Linux journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Algorithm","score_opus":0.010602010554703174,"score_gpt":0.2126784579643558,"score_spread":0.20207644740965264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582149994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09038831,0.00021612302,0.896992,0.0014832399,0.0007026729,0.000118137905,0.0000010672885,0.0002293405,0.0098691005],"genre_scores_gemma":[0.2947764,0.00006181868,0.7009995,0.00060093816,0.0013114924,0.0000060151924,6.3409084e-7,0.000028094444,0.0022151326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982442,0.00008997679,0.00032806257,0.00036232377,0.0005020545,0.00047335163],"domain_scores_gemma":[0.9989554,0.00006232019,0.000094694566,0.0005116788,0.000110469664,0.0002653917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045675965,0.00019265013,0.00021384428,0.000102205166,0.00025815028,0.0005883858,0.0011427687,0.000056552904,0.0007102443],"category_scores_gemma":[0.000011285043,0.00014486523,0.00008923414,0.00038673845,0.000058108104,0.0007001337,0.00015695218,0.0004750925,0.00020639406],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001573638,0.00009400131,0.0007932415,0.0000055345636,0.000028149847,0.00041226027,0.0008273464,0.0031856536,0.00005547369,0.00040725697,0.0003059908,0.99386936],"study_design_scores_gemma":[0.00370329,0.002088348,0.031940296,0.00022322607,0.00004039906,0.02884563,0.00016519528,0.7860171,0.0011491854,0.032277312,0.11188667,0.0016633363],"about_ca_topic_score_codex":0.00000869156,"about_ca_topic_score_gemma":0.00000411526,"teacher_disagreement_score":0.99220604,"about_ca_system_score_codex":0.00007751291,"about_ca_system_score_gemma":0.00010654023,"threshold_uncertainty_score":0.7776677},"labels":[],"label_agreement":null},{"id":"W1588005922","doi":"","title":"Oral history interview with Stephen Cook","year":2002,"lang":"en","type":"article","venue":"University of Minnesota Digital Conservancy (University of Minnesota)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Killam Trusts; Canada Council for the Arts; University of Toronto; Strong","keywords":"NP; Presentation (obstetrics); Nondeterministic algorithm; Turing; Computer science; Mathematics; Calculus (dental); Turing machine; Algorithm; Medicine; Programming language","score_opus":0.03164360827287684,"score_gpt":0.1670977301083709,"score_spread":0.13545412183549405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588005922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6156639,0.003673525,0.2964149,0.0086507015,0.00076652446,0.0013821146,0.00030129927,0.0008328433,0.0723142],"genre_scores_gemma":[0.91664505,0.0004537923,0.061875198,0.00022252345,0.000035012188,1.7326319e-7,0.000036769758,0.000044723754,0.020686755],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974341,0.0001900382,0.0002957437,0.000907214,0.00063920155,0.00053372263],"domain_scores_gemma":[0.99700505,0.0002837696,0.00051434804,0.0012486894,0.00063355005,0.00031458633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027754158,0.0004151721,0.00082445407,0.00039967024,0.00022422947,0.000040391235,0.0027765473,0.00018462389,0.000889753],"category_scores_gemma":[0.000039691786,0.0005255707,0.00036914725,0.00075643917,0.0012337597,0.002877475,0.0013069572,0.00027183528,0.00015489942],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014639625,0.009051355,0.054540142,0.0026113256,0.0022228272,0.0064673983,0.068658635,0.0005331249,0.0007367766,0.035649166,0.3244172,0.49364808],"study_design_scores_gemma":[0.007169281,0.002203374,0.016234115,0.0005744107,0.00030295257,0.00028681362,0.010693707,0.03692787,0.00007623711,0.0007998536,0.9227535,0.0019778823],"about_ca_topic_score_codex":0.0003663714,"about_ca_topic_score_gemma":0.00057434785,"teacher_disagreement_score":0.5983363,"about_ca_system_score_codex":0.00042107565,"about_ca_system_score_gemma":0.00020367009,"threshold_uncertainty_score":0.99971956},"labels":[],"label_agreement":null},{"id":"W1590796097","doi":"10.1007/11552451_21","title":"Swarm Intelligence and the Holonic Paradigm: A Promising Symbiosis for a Medical Diagnostic System","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mirroring; Swarm intelligence; Computer science; Task (project management); Swarm behaviour; Set (abstract data type); Artificial intelligence; Simple (philosophy); Ant colony; Architecture; Swarm robotics; Distributed computing; Engineering; Ant colony optimization algorithms; Machine learning; Systems engineering; Communication","score_opus":0.018134357750293824,"score_gpt":0.25364758184005026,"score_spread":0.23551322408975645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590796097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017743051,0.0027626164,0.98593885,0.0064674877,0.0020245682,0.0020307847,0.0000060375287,0.00029309405,0.000299121],"genre_scores_gemma":[0.65687567,0.00026308955,0.33927512,0.001915195,0.0013693277,0.00018513549,0.0000030181927,0.000060623697,0.000052842057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938974,0.00014775762,0.0010091258,0.0023255819,0.0016196141,0.0010005314],"domain_scores_gemma":[0.985559,0.01158117,0.00041100383,0.0018367002,0.00025421905,0.0003579067],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004275492,0.00073664146,0.0010027731,0.0005004584,0.00056736433,0.0010394516,0.0055377535,0.00048313904,0.0000068748873],"category_scores_gemma":[0.0019265892,0.00051905744,0.00025795776,0.00067663426,0.0027142498,0.0004308474,0.0027922143,0.0010787864,0.000017653501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021011278,0.00004645679,0.000038128863,0.00021359799,0.000026897607,0.00009505987,0.0012935752,0.008561359,0.0000010253207,0.15711732,0.000009360682,0.8325762],"study_design_scores_gemma":[0.0005361017,0.00019459914,0.00006202001,0.0010004088,0.000026219584,0.0005322591,6.635308e-7,0.84401274,0.00010767007,0.15257235,0.00038036754,0.0005745756],"about_ca_topic_score_codex":0.000043074153,"about_ca_topic_score_gemma":0.000095496674,"teacher_disagreement_score":0.8354514,"about_ca_system_score_codex":0.0005769784,"about_ca_system_score_gemma":0.0009719972,"threshold_uncertainty_score":0.9999998},"labels":[],"label_agreement":null},{"id":"W1593338279","doi":"10.1007/978-0-387-49820-1_7","title":"Resource-Bounded Complexity","year":2008,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounded function; Recursion (computer science); Resource (disambiguation); Kolmogorov complexity; Mathematics; Computational resource; Computer science; Discrete mathematics; Computational complexity theory; Algorithm; Mathematical analysis","score_opus":0.06048207433089553,"score_gpt":0.26865886142873807,"score_spread":0.20817678709784254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593338279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003737317,0.00058294693,0.7887454,0.0010764468,0.0028283745,0.00095082715,0.0000134581705,0.0010298442,0.20439894],"genre_scores_gemma":[0.01862772,0.00015333439,0.9426936,0.0025648873,0.001541028,0.000031748266,0.00001741065,0.00013392438,0.03423636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99139154,0.00011552721,0.0012036257,0.0033478271,0.0025215498,0.0014199408],"domain_scores_gemma":[0.9938998,0.00047740134,0.00052439957,0.004141139,0.00043351777,0.00052369083],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020294215,0.0009667786,0.0011243606,0.0014279311,0.0007424503,0.0008920368,0.010638943,0.00041504196,0.000099233504],"category_scores_gemma":[0.00006768162,0.0009818097,0.0003194205,0.0011657728,0.0041475394,0.0011097916,0.00732674,0.0013536452,0.0005072434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010546465,0.00022636403,0.000067516965,0.00006016744,0.000022627239,0.0008356853,0.0016224247,0.0015020869,0.000010826315,0.46747738,0.0066574397,0.52150697],"study_design_scores_gemma":[0.00078525534,0.00039933875,0.0022236628,0.00031799343,0.000008923484,0.00075018004,0.0000015095437,0.4635024,0.00006836107,0.3448179,0.18506587,0.0020586196],"about_ca_topic_score_codex":0.00005820107,"about_ca_topic_score_gemma":0.00006955245,"teacher_disagreement_score":0.51944834,"about_ca_system_score_codex":0.0010398142,"about_ca_system_score_gemma":0.0012614784,"threshold_uncertainty_score":0.9992632},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Theoretical computer science; Data science; Mathematical economics; Mathematics","score_opus":0.10776381053310918,"score_gpt":0.340904778139331,"score_spread":0.23314096760622183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636577564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38772595,0.00025393825,0.6020938,0.0022629758,0.0053511853,0.0012118093,0.00001957339,0.00055298384,0.000527792],"genre_scores_gemma":[0.8726125,0.0000067107603,0.12431438,0.0006058023,0.001962235,0.000039998286,0.000077144454,0.000050377446,0.00033088276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458367,0.00034556328,0.0010853342,0.002214738,0.0007499458,0.0010207645],"domain_scores_gemma":[0.9930811,0.0019378476,0.000766977,0.003339144,0.0006837918,0.00019113666],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034757527,0.0006089932,0.0006470619,0.00029238116,0.0018742332,0.00209503,0.004941377,0.00031180753,0.00002936852],"category_scores_gemma":[0.0005817479,0.0005114686,0.0005340976,0.00089546473,0.0005079533,0.00038717975,0.007893563,0.0010926788,0.00016147649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032601354,0.0016349124,0.2227529,0.0009712922,0.00072616624,0.000034890218,0.01975332,0.21417487,0.0005652233,0.059538487,0.021106992,0.45870835],"study_design_scores_gemma":[0.00036178977,0.000050533767,0.14781821,0.00013977558,0.00004378324,0.00001542654,0.00005193744,0.82280046,0.00011019565,0.010126456,0.017843451,0.0006380035],"about_ca_topic_score_codex":0.00016034319,"about_ca_topic_score_gemma":0.00012034005,"teacher_disagreement_score":0.6086256,"about_ca_system_score_codex":0.0004179573,"about_ca_system_score_gemma":0.0006351487,"threshold_uncertainty_score":0.9997337},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03527172603760496,"score_gpt":0.2774204450242962,"score_spread":0.24214871898669124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636748716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6486561,0.0010027881,0.3307816,0.010486019,0.003672619,0.0012899867,0.000012134249,0.00041367294,0.0036850842],"genre_scores_gemma":[0.984874,0.000006964977,0.014394189,0.00035018026,0.0002085176,0.000034116463,0.0000030618185,0.000016833495,0.000112153364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9945852,0.0014943441,0.0009329664,0.000978104,0.0009804446,0.0010289113],"domain_scores_gemma":[0.9868578,0.008198997,0.00035895073,0.0038683112,0.00045484686,0.000261141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062242113,0.00039825126,0.00045905577,0.00007203529,0.0011333998,0.00022125435,0.0031792729,0.00012964192,0.000052809],"category_scores_gemma":[0.0012227996,0.00023869917,0.0003539963,0.0012983623,0.001400927,0.00068687316,0.0017668213,0.0009108739,0.00009866742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009141574,0.002557365,0.06658769,0.000101748854,0.00016119807,0.0000017017011,0.003981337,0.033448942,0.0002618583,0.81648386,0.0043585724,0.071964316],"study_design_scores_gemma":[0.00044647587,0.000204368,0.40571487,0.000043002583,0.000025482579,0.00003172381,0.00024402379,0.37606433,0.00091343164,0.21193062,0.0037833212,0.00059833564],"about_ca_topic_score_codex":0.00013037544,"about_ca_topic_score_gemma":0.000022936172,"teacher_disagreement_score":0.6045532,"about_ca_system_score_codex":0.0004411922,"about_ca_system_score_gemma":0.00027553263,"threshold_uncertainty_score":0.97338694},"labels":[],"label_agreement":null},{"id":"W1655294445","doi":"10.1016/j.jalgebra.2015.06.004","title":"Independence in computable algebra","year":2015,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; David and Lucile Packard Foundation; National Science Foundation","keywords":"Mathematics; Computable number; Computable analysis; Abelian group; Computable function; Algebra over a field; Independence (probability theory); Pure mathematics; Algebraic number; Torsion (gastropod); Cover (algebra); Basis (linear algebra); Discrete mathematics; Mathematical analysis","score_opus":0.03148040757211418,"score_gpt":0.26490837281705143,"score_spread":0.23342796524493725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1655294445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42086625,0.0009894732,0.5708337,0.002822835,0.0020884033,0.00016854652,6.554004e-7,0.00007840076,0.002151785],"genre_scores_gemma":[0.9060402,0.000021910133,0.09308599,0.00042841877,0.00032463306,0.0000015839223,2.739729e-7,0.000012870102,0.00008410342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695504,0.00023620471,0.0008835893,0.0003391817,0.0011286847,0.00045728544],"domain_scores_gemma":[0.99767977,0.00023841328,0.0004828516,0.00056170905,0.0006288574,0.0004083706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025503926,0.00021426038,0.0004933808,0.0004429056,0.000044859487,0.00025286604,0.0021036537,0.00013151322,0.000028595328],"category_scores_gemma":[0.00035059673,0.00018576108,0.00014409778,0.0011240845,0.00007272004,0.0014796336,0.0006485455,0.00068445696,0.000070049886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033118768,0.0040783,0.2170189,0.00013033269,0.00029842224,0.00810966,0.015102535,0.072959356,0.00095592556,0.17298023,0.030197864,0.4778373],"study_design_scores_gemma":[0.005489991,0.0020991806,0.06355253,0.00022773899,0.000027455057,0.0056721945,0.0005138421,0.24790342,0.0015662588,0.6601262,0.011738838,0.0010823293],"about_ca_topic_score_codex":0.000063826534,"about_ca_topic_score_gemma":0.000023533563,"teacher_disagreement_score":0.487146,"about_ca_system_score_codex":0.00028968664,"about_ca_system_score_gemma":0.000616556,"threshold_uncertainty_score":0.75751173},"labels":[],"label_agreement":null},{"id":"W1761989984","doi":"10.1007/978-3-642-39521-5_18","title":"A Note on Tractability and Artificial Intelligence","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cognition; Artificial intelligence; Cognitive science; Context (archaeology); Human intelligence; Artificial general intelligence; Computational intelligence; Cognitive systems; Applications of artificial intelligence; Computation; Psychology; Algorithm","score_opus":0.031625331408654235,"score_gpt":0.26973848986118804,"score_spread":0.2381131584525338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1761989984","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006156368,0.0001897588,0.9909396,0.0020968497,0.0022519066,0.00087579346,0.0000062301488,0.00028448825,0.0027397037],"genre_scores_gemma":[0.39677638,0.00003593291,0.60055447,0.0016859259,0.0007646299,0.000026517224,0.0000028178495,0.00004706141,0.000106264626],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935124,0.00009485184,0.00094039453,0.0030994895,0.0013819247,0.0009709224],"domain_scores_gemma":[0.9945898,0.0018605237,0.00034065562,0.0024626527,0.00036998707,0.00037635496],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016599522,0.00085320283,0.00083191786,0.0008209953,0.0003447505,0.0011380911,0.0038779988,0.0005071617,0.000086028376],"category_scores_gemma":[0.0003888614,0.0007585981,0.00018215523,0.00075294735,0.0017067541,0.00078427856,0.0023930816,0.0015149663,0.00021139105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062965382,0.00007811707,0.000013215036,0.00003159589,0.0000045180245,0.00004406151,0.00055790663,0.007864443,0.000050893537,0.049541205,0.000004749909,0.941803],"study_design_scores_gemma":[0.000045364384,0.000299259,0.00024818996,0.00010913786,0.0000041134267,0.00004764496,1.7378241e-7,0.4900082,0.00086361374,0.5075512,0.00025631307,0.0005667809],"about_ca_topic_score_codex":0.00006870072,"about_ca_topic_score_gemma":0.000116411364,"teacher_disagreement_score":0.9412362,"about_ca_system_score_codex":0.0005032594,"about_ca_system_score_gemma":0.00053378113,"threshold_uncertainty_score":0.99989885},"labels":[],"label_agreement":null},{"id":"W1783801419","doi":"10.1109/tit.2016.2516022","title":"Non-Signaling Parallel Repetition Using de Finetti Reductions","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Institut Périmètre de physique théorique; Ministry of Education - Singapore; CHIST-ERA; Ministry of Education, India; European Commission; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; European Research Council; National Science Foundation","keywords":"Repetition (rhetorical device); Context (archaeology); Mathematical proof; Statement (logic); Mathematical economics; Computer science; Zero-knowledge proof; Theoretical computer science; Discrete mathematics; Mathematics; Cryptography; Combinatorics; Algorithm","score_opus":0.015860960667843288,"score_gpt":0.23945487012832672,"score_spread":0.22359390946048344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1783801419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012609634,0.0000059362533,0.98424083,0.00062672974,0.0010239547,0.00024988016,0.000014580357,0.00037240624,0.0008560287],"genre_scores_gemma":[0.88337857,0.000012881266,0.11590157,0.00035236942,0.000082497,0.000055272252,0.0000018976043,0.000009713167,0.00020522454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855894,0.00013626572,0.0004780079,0.00022900524,0.00028331397,0.00031449302],"domain_scores_gemma":[0.9986651,0.0002700839,0.00016735648,0.0006005284,0.0001820945,0.00011481763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008553325,0.00017667758,0.00014369868,0.00036001788,0.00041464696,0.00015069537,0.00042953066,0.000107500615,0.0001610274],"category_scores_gemma":[0.000024274941,0.00014475132,0.00013791608,0.000442528,0.00009541736,0.0029104142,0.0000057585385,0.00017961547,0.00022869304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105356354,0.00026015425,0.000012979704,0.000052928863,0.00008283723,0.0000033138858,0.0040644426,0.40970668,0.010849873,0.05118937,0.00029373597,0.5233783],"study_design_scores_gemma":[0.0025811417,0.00043522092,0.000522347,0.00035073844,0.000083192404,0.0004310103,0.0006174866,0.681303,0.13133752,0.17813188,0.0029677672,0.0012386965],"about_ca_topic_score_codex":0.000017175882,"about_ca_topic_score_gemma":0.000001837972,"teacher_disagreement_score":0.87076896,"about_ca_system_score_codex":0.00032119776,"about_ca_system_score_gemma":0.00015410279,"threshold_uncertainty_score":0.59027874},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012139363615030176,"score_gpt":0.2661813547541859,"score_spread":0.25404199113915577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809268447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18273316,0.000064014246,0.8003655,0.01518816,0.00031511625,0.00016092042,9.577128e-7,0.000056666195,0.0011154704],"genre_scores_gemma":[0.4187443,0.000011512186,0.5785563,0.002206048,0.0003231148,0.000001832646,4.3406576e-8,0.000012685242,0.00014417314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977224,0.00011015388,0.00069939456,0.00023618106,0.00081605196,0.0004158407],"domain_scores_gemma":[0.9975437,0.0004171514,0.00085836975,0.0007506367,0.00021570982,0.00021446323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012329575,0.00020533465,0.00058659597,0.00002953513,0.00017560812,0.00017078049,0.0023936713,0.000044215103,0.000039665618],"category_scores_gemma":[0.0001411739,0.00012276773,0.0008345048,0.00073434075,0.0003610982,0.0003898075,0.00078970223,0.00051198044,0.000087054104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006641668,0.005936111,0.0057088817,0.0004274925,0.0014209202,0.00006724379,0.02415071,0.04833177,0.0044709756,0.031555645,0.29589525,0.58196855],"study_design_scores_gemma":[0.0005578885,0.00030928824,0.00790769,0.00008406328,0.000054592794,0.00061608694,0.00022997575,0.8728918,0.00087652344,0.109567344,0.0065489467,0.00035582375],"about_ca_topic_score_codex":0.0000051251614,"about_ca_topic_score_gemma":3.9522394e-7,"teacher_disagreement_score":0.82456,"about_ca_system_score_codex":0.00022981432,"about_ca_system_score_gemma":0.00015046238,"threshold_uncertainty_score":0.5006322},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Test (biology); Sequence (biology); Computer science; Forecast skill; Econometrics; Mathematics; Statistics","score_opus":0.19342918531555678,"score_gpt":0.2551249838271196,"score_spread":0.061695798511562844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813435591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31573325,0.0011827372,0.5870859,0.0033026976,0.0014566634,0.00062455476,0.000012044872,0.00046280483,0.09013934],"genre_scores_gemma":[0.8897582,0.00000923822,0.11004736,0.00004302668,0.00005955113,0.000006173885,4.046631e-7,0.000004451186,0.000071533526],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988653,0.000052338404,0.00035008055,0.0003035802,0.0001535746,0.00027510588],"domain_scores_gemma":[0.9975683,0.0013255709,0.00017874654,0.00071716134,0.00013166989,0.000078530706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000466183,0.00010116813,0.00019652044,0.00021881347,0.00034250214,0.000073158764,0.0012740184,0.000027852942,0.000017239561],"category_scores_gemma":[0.0007995824,0.00007663928,0.00008024331,0.0022205948,0.00044905025,0.00026670014,0.00055462687,0.000105516505,0.000047637244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006574757,0.0003716343,0.090122536,0.000026167114,0.00005575896,0.000020520667,0.0008333556,0.0008088116,0.00003184123,0.14153719,0.002188554,0.7639971],"study_design_scores_gemma":[0.00034683803,0.00030191347,0.5407434,0.000005016132,0.0000032057692,0.00012328493,0.000026747275,0.38147026,0.00037476982,0.06539642,0.010921365,0.0002867365],"about_ca_topic_score_codex":0.000058799757,"about_ca_topic_score_gemma":0.000006451976,"teacher_disagreement_score":0.7637103,"about_ca_system_score_codex":0.000064376516,"about_ca_system_score_gemma":0.00007212738,"threshold_uncertainty_score":0.3125259},"labels":[],"label_agreement":null},{"id":"W182921546","doi":"10.1007/978-0-387-21790-1_12","title":"The Rematch — Games 3–5: Endgame Standoffs","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Deep blue; Pride; IBM; Visual arts; Situated; Art; Media studies; Computer science; Computer graphics (images); Art history; Advertising; Artificial intelligence; Sociology; Political science; Law; Physics; Business","score_opus":0.018146908030797732,"score_gpt":0.22261700734066267,"score_spread":0.20447009930986493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182921546","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015417395,0.0017930588,0.24232697,0.0028629238,0.0016035801,0.0004836206,0.0000062085596,0.00045158347,0.7504705],"genre_scores_gemma":[0.00013670018,0.00060129055,0.04590732,0.0012427139,0.0002939905,0.00002130378,0.0000034558827,0.000060538434,0.9517327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965169,0.000092995724,0.0006777287,0.001139467,0.00095780886,0.00061513175],"domain_scores_gemma":[0.9955084,0.00088190153,0.00029607365,0.002816059,0.00030260163,0.00019501061],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001009077,0.0006000688,0.00059168297,0.000113018956,0.00033017306,0.0006628331,0.002891068,0.000345302,0.00039367296],"category_scores_gemma":[0.00009191173,0.00038519304,0.00036854978,0.00010369031,0.00027847654,0.00021340301,0.0010740862,0.00065753824,0.00053704437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026421885,0.000014800857,0.0000028765226,0.000014317197,0.000047360772,0.000032416574,0.000086336775,0.000008261824,0.0000013760517,0.8809503,0.025585968,0.09325335],"study_design_scores_gemma":[0.00013334122,0.00007038612,0.000009358654,0.000024878636,0.000010432995,0.00005648786,0.000005274877,0.0018048389,0.000027372525,0.34248292,0.6549855,0.00038922447],"about_ca_topic_score_codex":0.000017556618,"about_ca_topic_score_gemma":0.00006706539,"teacher_disagreement_score":0.6293995,"about_ca_system_score_codex":0.00022439181,"about_ca_system_score_gemma":0.00021735055,"threshold_uncertainty_score":0.99986},"labels":[],"label_agreement":null},{"id":"W1831390059","doi":"10.1016/j.aim.2018.03.012","title":"Scott ranks of models of a theory","year":2018,"lang":"en","type":"preprint","venue":"Advances in Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Countable set; Mathematics; Combinatorics; Omega; Bounded function; Rank (graph theory); Isomorphism (crystallography); Model theory; Discrete mathematics; Measure (data warehouse); Spectrum (functional analysis); Set theory; Set (abstract data type); Philosophy; Physics","score_opus":0.02706178459283569,"score_gpt":0.2989693452877062,"score_spread":0.2719075606948705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831390059","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009313795,0.0033503082,0.9774033,0.000024662351,0.0007296851,0.00052980304,0.0000150053565,0.00007800646,0.008555427],"genre_scores_gemma":[0.19160955,0.00049689715,0.80773246,0.000013647265,0.00005245455,0.000033274664,0.0000017805365,0.000019226154,0.00004068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727744,0.00017572098,0.0011174135,0.00058325595,0.0005636257,0.0002825687],"domain_scores_gemma":[0.9955924,0.0010707573,0.0008899279,0.0020890608,0.00030955294,0.000048282076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017564663,0.0003116877,0.00091801985,0.00024061056,0.000021005122,0.000029925537,0.0027744535,0.00022171436,0.000021078673],"category_scores_gemma":[0.00034486197,0.0002787051,0.00019087516,0.00036549402,0.00041398604,0.00040277388,0.0030154479,0.0003891528,0.000005461161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014711932,0.00089951366,0.000119678116,0.0052008023,0.00005261958,0.0000070292294,0.010351429,0.11640509,0.000037213133,0.80746686,0.000018553736,0.05942652],"study_design_scores_gemma":[0.000120364835,0.000040950108,0.000017323066,0.00048233126,0.000008724187,0.0000031271104,0.0000460086,0.37974384,0.0005588623,0.6188107,0.000018859824,0.00014888105],"about_ca_topic_score_codex":0.000006096694,"about_ca_topic_score_gemma":0.000008141801,"teacher_disagreement_score":0.26333874,"about_ca_system_score_codex":0.000065859655,"about_ca_system_score_gemma":0.00015558438,"threshold_uncertainty_score":0.9999665},"labels":[],"label_agreement":null},{"id":"W1844691172","doi":"10.14288/1.0051998","title":"The schematics of computation","year":2011,"lang":"en","type":"book","venue":"cIRcle (University of British Columbia)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Langara College","funders":"","keywords":"Glossary; Recursion (computer science); Schematic; Computer science; Scheme (mathematics); Computation; Reading (process); Theoretical computer science; Bibliography; Programming language; Library science; Mathematics; Engineering; Linguistics; Philosophy","score_opus":0.014859893652803118,"score_gpt":0.17732293907647495,"score_spread":0.16246304542367182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844691172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02112708,0.0015010457,0.77434343,0.00017187279,0.0015636759,0.0015069708,0.0002242306,0.00042112573,0.19914053],"genre_scores_gemma":[0.37761363,0.0011386708,0.2610022,0.00010438536,0.0003147399,0.0000029134997,0.00013544591,0.00013805245,0.35954994],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99818903,0.00010438395,0.0003316722,0.0005450197,0.0005609692,0.00026891442],"domain_scores_gemma":[0.9972885,0.00034730803,0.0006916013,0.0008868829,0.00068222225,0.00010343681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051160535,0.0000918816,0.0005279114,0.00006403167,0.00030284596,0.00015936447,0.0022166863,0.00026226425,0.00002372692],"category_scores_gemma":[0.000050419607,0.00027459586,0.0002814357,0.00026197577,0.0006992776,0.00030182098,0.001073791,0.00030547412,0.000027525804],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002548808,0.000120310775,0.000097281256,0.0002948081,0.00009767044,0.00005492055,0.0004330306,0.000026476046,0.0000036056106,0.00045976663,0.01783183,0.98057777],"study_design_scores_gemma":[0.002010622,0.0007114066,0.6114938,0.0016172909,0.00026276914,0.0002703055,0.00052612246,0.05586609,0.0000026507678,0.3097413,0.015971797,0.0015258156],"about_ca_topic_score_codex":0.009016717,"about_ca_topic_score_gemma":0.038540047,"teacher_disagreement_score":0.97905195,"about_ca_system_score_codex":0.00016484698,"about_ca_system_score_gemma":0.0005234478,"threshold_uncertainty_score":0.9999706},"labels":[],"label_agreement":null},{"id":"W1849716023","doi":"10.1002/malq.201400110","title":"Computable axiomatizability of elementary classes","year":2016,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Ultraproduct; Class (philosophy); Algebra over a field; New class; Calculus (dental)","score_opus":0.018746146630212374,"score_gpt":0.25473146860272017,"score_spread":0.2359853219725078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849716023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0795188,0.000031730277,0.91391146,0.0022037015,0.00019667108,0.00039840423,0.000010153892,0.0003279675,0.0034011093],"genre_scores_gemma":[0.73809135,0.000001000079,0.26162612,0.00012695864,0.000045116874,0.000025900283,0.0000010527662,0.000009936611,0.00007256204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701595,0.00025227884,0.0009281163,0.0006642925,0.0005987195,0.0005406543],"domain_scores_gemma":[0.9965896,0.0014810393,0.00022853537,0.0013332852,0.00017948129,0.00018805322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010061645,0.00028589997,0.0006076487,0.0001061937,0.00007885105,0.00008341595,0.0014262915,0.00010500161,0.0005170787],"category_scores_gemma":[0.00016132632,0.00017363121,0.00020056678,0.0003959277,0.00030834065,0.0004844189,0.00028670602,0.00010265369,0.0003582927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012020046,0.0013686855,0.0009331083,0.00031771604,0.000054510598,0.000018682038,0.0009718567,0.000009696126,0.0036080868,0.77973384,0.0006869429,0.21228488],"study_design_scores_gemma":[0.00051646156,0.0010288504,0.0019489982,0.00007340356,0.000011835475,0.000037167385,0.000076066426,0.024162458,0.0013712558,0.9702901,0.00019921725,0.0002841696],"about_ca_topic_score_codex":0.000011664511,"about_ca_topic_score_gemma":0.0000031329444,"teacher_disagreement_score":0.65857255,"about_ca_system_score_codex":0.00010383948,"about_ca_system_score_gemma":0.000064567655,"threshold_uncertainty_score":0.7080475},"labels":[],"label_agreement":null},{"id":"W1849765400","doi":"10.3233/fun-2001-48106","title":"Computability in Type-2 Objects with Well-Behaved Type-1 Oracles is p-Normal","year":2001,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computability; Type (biology); Computer science; Programming language; Mathematics; Discrete mathematics; Algorithm","score_opus":0.01929553382772611,"score_gpt":0.2530119135057787,"score_spread":0.23371637967805256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849765400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9265958,0.000092251365,0.045852993,0.00087077916,0.0007911801,0.0009815469,0.0000063363095,0.0004865583,0.02432252],"genre_scores_gemma":[0.9488549,0.000024035095,0.049210545,0.0016139983,0.000059501024,0.00001937153,0.000015155952,0.000017355449,0.00018509],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715006,0.00011188727,0.000805347,0.0004928057,0.00067923643,0.0007606769],"domain_scores_gemma":[0.9978613,0.00021932059,0.00021023481,0.001242048,0.00022991697,0.00023713335],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068263075,0.00036959603,0.00045930242,0.00025300914,0.00016984408,0.000407265,0.0013043557,0.00012321008,0.00052393513],"category_scores_gemma":[0.000059747585,0.00031053077,0.000075798,0.001651433,0.00019735954,0.0017191955,0.00081132684,0.00038295705,0.00092602754],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080218486,0.003220985,0.6704302,0.0006825456,0.00024206181,0.0003484409,0.047755074,0.008242469,0.00015972226,0.011017615,0.0072499784,0.24984872],"study_design_scores_gemma":[0.0043705516,0.002448783,0.34419972,0.00020690555,0.000041193194,0.00053509173,0.00196949,0.5837115,0.000993126,0.0056439475,0.053943813,0.0019358397],"about_ca_topic_score_codex":0.00022429742,"about_ca_topic_score_gemma":0.0001672571,"teacher_disagreement_score":0.5754691,"about_ca_system_score_codex":0.0003207311,"about_ca_system_score_gemma":0.00024750424,"threshold_uncertainty_score":0.9999347},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034808456705364976,"score_gpt":0.23662688197796752,"score_spread":0.20181842527260255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854153889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8865043,0.00009003338,0.10489273,0.00027668444,0.00023947854,0.0012023721,0.0000070369124,0.0000798138,0.006707541],"genre_scores_gemma":[0.6053192,0.000004935535,0.39458874,0.000011373276,0.000016163545,0.000015105752,4.1207862e-8,0.000010165938,0.00003427959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981698,0.00001088461,0.0006067193,0.00033081544,0.0006518211,0.00022999816],"domain_scores_gemma":[0.99806195,0.00010290482,0.0005776399,0.00044633247,0.00072002533,0.00009115107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089483726,0.00022363302,0.00058839435,0.00017167228,0.00006662175,0.00003512238,0.001581613,0.00006590492,0.0000017424478],"category_scores_gemma":[0.000492083,0.0001413492,0.00009645177,0.0007248197,0.00042669039,0.00041242279,0.0008078491,0.00012787843,9.767746e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008905284,0.0040102163,0.024874715,0.012428885,0.0010245445,0.000013197193,0.12517302,0.0003701611,0.057371125,0.68749875,0.00077854114,0.08556632],"study_design_scores_gemma":[0.009391269,0.0040625264,0.028468156,0.0049243146,0.00050117227,0.0006223655,0.0030157433,0.03693658,0.6838752,0.22530952,0.001124629,0.0017685231],"about_ca_topic_score_codex":0.000037626785,"about_ca_topic_score_gemma":0.000015245132,"teacher_disagreement_score":0.62650406,"about_ca_system_score_codex":0.000029721314,"about_ca_system_score_gemma":0.000085009946,"threshold_uncertainty_score":0.5764053},"labels":[],"label_agreement":null},{"id":"W1856627737","doi":"10.1109/ccece.2002.1013077","title":"Processing noisy analog signals from microsensor arrays and VLSI imagers using stochastic binary computations","year":2003,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Very-large-scale integration; Binary number; Signal processing; Computer science; Computation; CMOS; Computer hardware; Parallel computing; SIGNAL (programming language); Digital signal processing; Algorithm; Electronic engineering; Arithmetic; Mathematics; Embedded system; Engineering","score_opus":0.028702607988727286,"score_gpt":0.2684220664244538,"score_spread":0.23971945843572653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1856627737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23045193,0.0003384125,0.76804274,0.00018637444,0.00018716643,0.00023686094,0.000006873848,0.00022167955,0.00032793754],"genre_scores_gemma":[0.5671539,9.814324e-7,0.43256944,0.00020001509,0.000035282806,0.0000036288855,0.0000031676996,0.000011750934,0.000021865259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776894,0.00019221938,0.00041869064,0.0008580483,0.00030371884,0.00045838853],"domain_scores_gemma":[0.9985243,0.0004461053,0.00015090113,0.00045204055,0.00022213724,0.00020448818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034587985,0.00028752626,0.00033861442,0.00020349273,0.00042569844,0.0005582318,0.00045348788,0.00008216227,0.000037647133],"category_scores_gemma":[0.00012069525,0.00027354984,0.00007572837,0.00074943894,0.00021209854,0.0006536255,0.00024023214,0.00019057532,0.000018199898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020962872,0.0010144488,0.0035312872,0.00014859866,0.00016013141,0.00020723318,0.0066827983,0.6347885,0.26472756,0.0057763397,0.00033623207,0.0826059],"study_design_scores_gemma":[0.00040974165,0.00006497899,0.0024694416,0.00003642868,0.000022437267,0.00006786261,0.00017068384,0.9811849,0.0019280881,0.013222876,0.00003193425,0.000390629],"about_ca_topic_score_codex":0.00018445849,"about_ca_topic_score_gemma":0.000014857532,"teacher_disagreement_score":0.34639642,"about_ca_system_score_codex":0.00009390818,"about_ca_system_score_gemma":0.00020312188,"threshold_uncertainty_score":0.9999717},"labels":[],"label_agreement":null},{"id":"W1875432820","doi":"10.1007/978-3-642-21341-0_19","title":"Computations with Uncertain Time Constraints: Effects on Parallelism and Universality","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Universality (dynamical systems); Computer science; Computation; Spacetime; Focus (optics); Theoretical computer science; Class (philosophy); Mathematical optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.015359543649017354,"score_gpt":0.22701599209689244,"score_spread":0.2116564484478751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875432820","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043031396,0.00015862609,0.9912171,0.00082628353,0.0006348094,0.0008149433,0.000010226573,0.0003214604,0.0055862432],"genre_scores_gemma":[0.23404568,0.00003307494,0.7627905,0.0023479352,0.00035479755,0.000017021548,0.000013758602,0.00006316512,0.0003340683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540365,0.00013887096,0.0004778262,0.0022487077,0.00096760754,0.0007633334],"domain_scores_gemma":[0.9956865,0.001796434,0.00031503156,0.0015309582,0.00033317687,0.00033795464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087478384,0.0007789401,0.0007875618,0.0007411055,0.00036622013,0.00046328962,0.0024885389,0.00033781497,0.00003569472],"category_scores_gemma":[0.000089604844,0.0006550909,0.000108980246,0.0007163618,0.002519859,0.000516334,0.0013051877,0.00094386056,0.000069373564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021452848,0.00008765053,0.000078899946,0.00008921675,0.00003955196,0.00045350706,0.0012482231,0.024494156,0.000017467368,0.07309901,0.000021764197,0.9003491],"study_design_scores_gemma":[0.0011402,0.0014759632,0.0014128138,0.00083850586,0.00003264474,0.00031484762,4.815877e-7,0.56062925,0.00028864294,0.4317546,0.0005791209,0.0015329757],"about_ca_topic_score_codex":0.000057891713,"about_ca_topic_score_gemma":0.00004417523,"teacher_disagreement_score":0.8988161,"about_ca_system_score_codex":0.0003868859,"about_ca_system_score_gemma":0.00066962023,"threshold_uncertainty_score":0.99959004},"labels":[],"label_agreement":null},{"id":"W187615170","doi":"","title":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","year":2005,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Symbolic computation; Computer science; Symbolic-numeric computation; Automatic differentiation; Theoretical computer science; Algebra over a field; Software; Computation; Algorithm; Mathematics; Programming language; Pure mathematics","score_opus":0.00882742594242721,"score_gpt":0.23010653133138823,"score_spread":0.221279105388961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187615170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8375567,0.00004046861,0.08675954,0.03840265,0.0008542251,0.00051453826,0.0000026245066,0.00026314217,0.035606068],"genre_scores_gemma":[0.9732455,0.0000055794567,0.025553033,0.000669649,0.00013449747,0.0000057987218,4.5259662e-7,0.000004881782,0.00038061853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894243,0.000013308204,0.00022278412,0.0003161282,0.0003477902,0.0001575513],"domain_scores_gemma":[0.99947524,0.00008220759,0.00009887768,0.00014732608,0.000145007,0.00005136353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023977653,0.00010791499,0.00011177225,0.00006188679,0.000064919135,0.00011673492,0.0007038853,0.00003888322,0.000017322198],"category_scores_gemma":[0.00002607075,0.00007487526,0.00004656304,0.00020455352,0.00007307569,0.00034575854,0.00042173686,0.00009583326,0.000014006236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019689613,0.0007534288,0.015650004,0.00005370066,0.00007677571,9.0246675e-7,0.0034324457,0.0058565564,0.00759584,0.6522623,0.007929226,0.30636916],"study_design_scores_gemma":[0.0005446942,0.00011571391,0.09231086,0.00003186649,0.0000067214487,0.0000417735,0.00004014732,0.8798539,0.008916429,0.013496837,0.004417724,0.00022331248],"about_ca_topic_score_codex":0.000011669347,"about_ca_topic_score_gemma":0.000008780455,"teacher_disagreement_score":0.8739974,"about_ca_system_score_codex":0.00006231163,"about_ca_system_score_gemma":0.000022017539,"threshold_uncertainty_score":0.30533245},"labels":[],"label_agreement":null},{"id":"W1883221139","doi":"10.1016/j.apal.2015.08.001","title":"Measuring complexities of classes of structures","year":2015,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Turing; Mathematics; Class (philosophy); Ordinal data; Ordinal regression; Discrete mathematics; Bounded function; Computer science; Artificial intelligence; Statistics","score_opus":0.22346921515104232,"score_gpt":0.3130626732780226,"score_spread":0.0895934581269803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883221139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9047713,0.0026476586,0.07326396,0.0010198148,0.00020358109,0.00036985314,0.000021301463,0.00009893504,0.017603561],"genre_scores_gemma":[0.9771373,0.000021323744,0.022662917,0.00012266096,0.00003948013,0.0000031491907,0.0000014020413,0.0000040315817,0.000007713272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884164,0.000042827527,0.00035462825,0.00024556534,0.00033337963,0.00018195069],"domain_scores_gemma":[0.9989402,0.00012443704,0.00023325958,0.0003607692,0.00026157647,0.000079698715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041063476,0.00013276788,0.00040090334,0.00009267815,0.000027623295,0.000020994345,0.00052585854,0.00006293439,0.000005929647],"category_scores_gemma":[0.000046601646,0.00010599307,0.00006145986,0.00021234415,0.00023824214,0.000097616,0.00034857012,0.00007730434,7.476909e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032844247,0.00013994558,0.0010649747,0.00023611735,0.000052312585,0.0000018894788,0.0016846659,0.0013588856,0.0045778537,0.96337485,0.00086881913,0.026606828],"study_design_scores_gemma":[0.0003044852,0.0002896109,0.012409024,0.000019876343,0.000008325495,0.000006873622,0.00048528568,0.0012224425,0.07264512,0.9121273,0.00031403993,0.00016760775],"about_ca_topic_score_codex":0.000029713026,"about_ca_topic_score_gemma":0.00000870308,"teacher_disagreement_score":0.072365984,"about_ca_system_score_codex":0.000003837444,"about_ca_system_score_gemma":0.00005338639,"threshold_uncertainty_score":0.43222722},"labels":[],"label_agreement":null},{"id":"W188789192","doi":"","title":"Two Properties of the Generalized Sequence {Wn} Relevant to Recurring Decimal.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Decimal; Arithmetic; Genetics; Biology","score_opus":0.030353350422732527,"score_gpt":0.25616821161044423,"score_spread":0.2258148611877117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188789192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938001,0.00025845843,0.0006884387,0.0014032483,0.0018777124,0.00052043714,0.0000017768422,0.00018220898,0.0012676329],"genre_scores_gemma":[0.97979975,0.00001512639,0.01946781,0.00038941993,0.000017346689,0.000038669517,2.5989755e-7,0.000015748605,0.00025586862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768317,0.00026321207,0.0004615828,0.000593376,0.00056225556,0.00043639983],"domain_scores_gemma":[0.9979531,0.000091203365,0.000107814645,0.0015085363,0.00020306073,0.00013624459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058087066,0.00022579356,0.00031339953,0.000067515495,0.00019575983,0.000120996054,0.002325109,0.000057363442,0.00003813901],"category_scores_gemma":[0.00018408099,0.00016064948,0.0001347231,0.00090572325,0.00012912878,0.0003116803,0.00076476467,0.00021041516,0.000075308766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007390418,0.00056635856,0.004152996,0.00008520435,0.00006713899,0.00002948093,0.0047362926,0.005001877,0.0454427,0.801145,0.0010900048,0.13760902],"study_design_scores_gemma":[0.0028175733,0.00053960667,0.013257525,0.00045478335,0.000033302378,0.000104501225,0.000054552627,0.09617747,0.13325065,0.742312,0.009769706,0.0012283169],"about_ca_topic_score_codex":0.00029528642,"about_ca_topic_score_gemma":0.000018750321,"teacher_disagreement_score":0.1363807,"about_ca_system_score_codex":0.00014532452,"about_ca_system_score_gemma":0.00015369522,"threshold_uncertainty_score":0.6551095},"labels":[],"label_agreement":null},{"id":"W1919650993","doi":"10.1007/978-3-642-21875-0_14","title":"Computability of the Radon-Nikodym Derivative","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computability; Measure (data warehouse); Derivative (finance); Operator (biology); Discrete mathematics; Computer science; Mathematics; Algebra over a field; Pure mathematics; Data mining","score_opus":0.025102700577793163,"score_gpt":0.23717267869667738,"score_spread":0.21206997811888423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919650993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071934966,0.00033743196,0.9889866,0.000728949,0.003464537,0.000977966,0.00001185363,0.00019501628,0.004578257],"genre_scores_gemma":[0.5698069,0.000018786812,0.42863616,0.00094115693,0.00037594902,0.0000135108385,0.0000021808637,0.000050206374,0.00015513635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935951,0.00019413474,0.0011665113,0.0024377645,0.0016849503,0.0009215425],"domain_scores_gemma":[0.9926835,0.001268461,0.0008344979,0.0042186705,0.00077097595,0.00022389698],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019226186,0.0008601422,0.0010954367,0.0005775406,0.00036179984,0.0002646491,0.0102230795,0.0004637723,0.000054751832],"category_scores_gemma":[0.0003374639,0.00062634447,0.0004478965,0.0014747586,0.0034332583,0.0006016875,0.0071466393,0.0014005977,0.000026306472],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014329552,0.00023292223,0.0013973012,0.0001515397,0.000042950905,0.000038688777,0.0033115789,0.02049169,0.00014456263,0.064470194,0.000028154556,0.9096761],"study_design_scores_gemma":[0.00035896362,0.0002771527,0.0069486313,0.00034477696,0.000016124244,0.000078222474,3.1261993e-7,0.26121536,0.004092541,0.725107,0.00062796654,0.0009329066],"about_ca_topic_score_codex":0.00012363108,"about_ca_topic_score_gemma":0.00011628623,"teacher_disagreement_score":0.9087432,"about_ca_system_score_codex":0.0005348135,"about_ca_system_score_gemma":0.0011923759,"threshold_uncertainty_score":0.99961877},"labels":[],"label_agreement":null},{"id":"W192669604","doi":"","title":"On an Extension of Nagell's Totient Function and Some Applications.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Euler's totient function; Mathematics; Extension (predicate logic); Computer science; Mathematical analysis; Euler's formula; Programming language","score_opus":0.015321320835616195,"score_gpt":0.22297333290140386,"score_spread":0.20765201206578768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192669604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9382025,0.00060207385,0.056331836,0.00075356965,0.0021164431,0.0007528605,0.000002421039,0.00032652554,0.00091178436],"genre_scores_gemma":[0.9969411,0.000017757688,0.0027445273,0.00020995659,0.000014764385,0.000026405165,0.000001822684,0.0000081667895,0.000035517864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870807,0.00008659185,0.00022859333,0.0005092652,0.00028874606,0.00017871684],"domain_scores_gemma":[0.99861366,0.00016414067,0.0000987906,0.00086916704,0.00014725307,0.00010699337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002474299,0.00013229309,0.00016798331,0.00008624555,0.00010907315,0.00005742259,0.00039479873,0.000064331136,0.000013898009],"category_scores_gemma":[0.000040823285,0.00012810755,0.000038722363,0.00032045436,0.000062697545,0.00040338948,0.00022320004,0.0001122576,0.00004274175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004949862,0.0005026583,0.000422655,0.000011441394,0.000005205476,0.000001218278,0.00012767305,0.00008279613,0.0002439404,0.9345466,0.0004546418,0.06359624],"study_design_scores_gemma":[0.0005148331,0.00070663844,0.015367677,0.000010376092,0.0000061388537,0.000004754295,0.000008989039,0.058065817,0.00032558257,0.9242998,0.00053930696,0.00015008631],"about_ca_topic_score_codex":0.000011124398,"about_ca_topic_score_gemma":6.9732636e-7,"teacher_disagreement_score":0.06344616,"about_ca_system_score_codex":0.00005538742,"about_ca_system_score_gemma":0.000012080829,"threshold_uncertainty_score":0.5224074},"labels":[],"label_agreement":null},{"id":"W194279835","doi":"10.1007/978-3-642-30891-8_5","title":"The Impact of Parameterized Complexity to Interdisciplinary Problem Solving","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Computer science; Computational complexity theory; Theoretical computer science; Artificial intelligence; Data science; Algorithm","score_opus":0.04007682157717889,"score_gpt":0.3117525082969771,"score_spread":0.2716756867197982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194279835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016108168,0.0004255886,0.99226344,0.0008709874,0.0013691107,0.0011468531,0.000012878654,0.0001823334,0.0021180024],"genre_scores_gemma":[0.40861326,0.000017311266,0.59073925,0.00014096953,0.00037845524,0.000018548235,0.000002940613,0.000038353428,0.00005093172],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944192,0.00014636945,0.0011146968,0.0017229436,0.0012554367,0.0013413272],"domain_scores_gemma":[0.9937011,0.0018269363,0.0006080128,0.0029333995,0.000503642,0.00042689862],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002730048,0.0008200913,0.0010264602,0.00070782175,0.0006268901,0.000736241,0.007471321,0.0002909153,0.000026072192],"category_scores_gemma":[0.00017332127,0.000555778,0.00050996634,0.0010933587,0.0018137023,0.0006808209,0.0118726045,0.0010281231,0.00004266231],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028988958,0.000096948206,0.00015743867,0.000044377546,0.00004096691,0.000020000722,0.0025365753,0.027301123,0.00040916944,0.005871398,0.00003656977,0.96345645],"study_design_scores_gemma":[0.000306191,0.000876643,0.004010714,0.00037229416,0.000012341308,0.000119272336,7.567397e-7,0.49581268,0.00058081927,0.49679053,0.00017039222,0.0009473794],"about_ca_topic_score_codex":0.000102566555,"about_ca_topic_score_gemma":0.00011249709,"teacher_disagreement_score":0.96250904,"about_ca_system_score_codex":0.0008541155,"about_ca_system_score_gemma":0.00072772155,"threshold_uncertainty_score":0.9996894},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013638678405637029,"score_gpt":0.2547967305169723,"score_spread":0.24115805211133529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966303569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97067803,0.000050609768,0.010973327,0.010271686,0.00017511065,0.0034310562,0.000021932521,0.000066967084,0.004331301],"genre_scores_gemma":[0.8924415,0.0000162894,0.105565056,0.0011903414,0.00007853641,0.000098310054,2.2769834e-7,0.00003281007,0.00057692325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672437,0.000054553595,0.0010915208,0.00055885466,0.00095434417,0.0006163649],"domain_scores_gemma":[0.99563557,0.0012897727,0.0015923365,0.0007866282,0.00060610485,0.000089616995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021502757,0.00040883414,0.0008732534,0.000046756657,0.0003958524,0.000128748,0.0026850011,0.00013357404,0.000042907584],"category_scores_gemma":[0.0019713615,0.00021681328,0.0009062346,0.0024884567,0.0010283462,0.00020182959,0.0008641825,0.0005872726,0.000006354892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010337613,0.0039283494,0.0013925857,0.0015795723,0.000240828,1.281682e-7,0.03902246,0.00027188187,0.010365295,0.9308876,0.0053957766,0.0068121413],"study_design_scores_gemma":[0.00039928636,0.0005014622,0.0033264325,0.0003758268,0.00007103959,0.000010432215,0.00371793,0.33883965,0.008541189,0.64363736,0.0003187576,0.00026065524],"about_ca_topic_score_codex":0.000025070878,"about_ca_topic_score_gemma":0.0000043720015,"teacher_disagreement_score":0.33856776,"about_ca_system_score_codex":0.00031606387,"about_ca_system_score_gemma":0.00018523287,"threshold_uncertainty_score":0.8841389},"labels":[],"label_agreement":null},{"id":"W1968556728","doi":"10.1016/j.shpsa.2011.09.004","title":"Descartes’ influence on Turing","year":2011,"lang":"en","type":"article","venue":"Studies in History and Philosophy of Science Part A","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Dalhousie University","keywords":"Turing; Philosophy; Epistemology; Computer science; Mathematical economics; Mathematics; Programming language","score_opus":0.15936993220327178,"score_gpt":0.29051474050228104,"score_spread":0.13114480829900926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968556728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95266044,0.005661117,0.0006829622,0.00032701442,0.0024114263,0.00028895482,0.0000012915942,0.00010575072,0.037861057],"genre_scores_gemma":[0.9924427,0.00007360506,0.007233024,0.00016768654,0.000047691407,0.000015844205,2.8410735e-8,0.0000028736386,0.00001653154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983628,0.00005028956,0.00029745666,0.0006063618,0.00038506885,0.0002980272],"domain_scores_gemma":[0.9989809,0.0001463312,0.00011243841,0.0005134743,0.00015878359,0.000088102526],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010190955,0.00015184717,0.00025802894,0.00028987732,0.00021655535,0.000009469632,0.0009924661,0.000028506529,0.0000045339716],"category_scores_gemma":[0.00024121912,0.00013563865,0.000038151342,0.0005639205,0.004790682,0.0006388759,0.0006203153,0.00014275029,0.0000063381576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007679255,0.0008516097,0.04143108,0.00039173762,0.00004838555,0.00010365887,0.18789458,0.0005135347,0.0017165948,0.7392343,0.0005252517,0.027212415],"study_design_scores_gemma":[0.00088108267,0.0017634858,0.09093706,0.0006556898,0.000015543494,0.00004310155,0.00079075346,0.0040545096,0.005428406,0.8899346,0.0044277715,0.0010679992],"about_ca_topic_score_codex":0.00002271898,"about_ca_topic_score_gemma":0.0000052379205,"teacher_disagreement_score":0.18710382,"about_ca_system_score_codex":0.00026066133,"about_ca_system_score_gemma":0.0001024313,"threshold_uncertainty_score":0.9979177},"labels":[],"label_agreement":null},{"id":"W1974374936","doi":"10.1016/j.jlap.2008.02.002","title":"Primitive recursive selection functions for existential assertions over abstract algebras","year":2008,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Existentialism; Selection (genetic algorithm); Primitive recursive function; Mathematics; Algebra over a field; Computer science; Pure mathematics; Discrete mathematics; Epistemology; Philosophy; Artificial intelligence","score_opus":0.03612114453709036,"score_gpt":0.27456630116533814,"score_spread":0.23844515662824778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974374936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29717773,0.00048472302,0.7000747,0.0011396148,0.0005043621,0.00039630287,0.0000016445233,0.00006406704,0.00015687653],"genre_scores_gemma":[0.93437725,0.00007548143,0.06487582,0.00016852231,0.0003742716,0.000016968834,0.000001680574,0.000009913255,0.00010010783],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985022,0.00012516245,0.00048214744,0.00023038356,0.00031919,0.00034092832],"domain_scores_gemma":[0.9981894,0.0005913042,0.00047164032,0.00019704197,0.0004236234,0.00012701092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010300544,0.00017786685,0.00025963917,0.00012993613,0.00077155756,0.00011566502,0.00047407957,0.00008021676,0.000012225212],"category_scores_gemma":[0.00024384474,0.00011873843,0.00019671206,0.00038881705,0.0002050608,0.00057945907,0.00013061137,0.00035361364,0.000002972701],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057802367,0.002233071,0.008005426,0.00013841178,0.0010388705,0.00012186897,0.011650361,0.0012775551,0.004818983,0.12962899,0.005257166,0.8352513],"study_design_scores_gemma":[0.007137054,0.010831233,0.5276397,0.00030969246,0.0008907156,0.018039746,0.0035347806,0.026124902,0.0035564236,0.37057713,0.029390791,0.001967824],"about_ca_topic_score_codex":0.000016998478,"about_ca_topic_score_gemma":0.000012699903,"teacher_disagreement_score":0.8332834,"about_ca_system_score_codex":0.000083654246,"about_ca_system_score_gemma":0.00015744471,"threshold_uncertainty_score":0.5934275},"labels":[],"label_agreement":null},{"id":"W1974410793","doi":"10.5539/jmr.v6n1p76","title":"A Minimal Pair of Turing Degrees","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Turing; Natural number; Order (exchange); Substructure; Discrete mathematics","score_opus":0.12715112959559946,"score_gpt":0.37824602646818895,"score_spread":0.25109489687258946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974410793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44789195,0.00014129105,0.5489659,0.00094127643,0.00017534125,0.000121424426,4.6603213e-7,0.000018750243,0.0017436462],"genre_scores_gemma":[0.5962268,0.000008123175,0.40354455,0.0000061195237,0.00013581513,0.0000012697268,3.1047943e-8,0.0000073386764,0.00006992268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658775,0.00037996477,0.0007795913,0.00016608344,0.0017148488,0.00037176552],"domain_scores_gemma":[0.9954239,0.0023099277,0.00037371807,0.0006103551,0.0011141648,0.00016794742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009442704,0.00010752844,0.00039381953,0.0004652894,0.00008339052,0.0001300359,0.0019492825,0.000063982974,0.000023448014],"category_scores_gemma":[0.0020610294,0.000079881174,0.00016568566,0.0005144882,0.00015491483,0.0002814582,0.0007347366,0.0005253365,0.000019370595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001504224,0.010251281,0.01628696,0.0059837652,0.00066354993,0.00048688508,0.045196656,0.0075960946,0.047209714,0.35949945,0.015779832,0.49089536],"study_design_scores_gemma":[0.0009353143,0.0016746857,0.00638396,0.00047494174,0.000013162573,0.0005727404,0.00061642635,0.7515917,0.01668226,0.21909203,0.0017076571,0.00025511836],"about_ca_topic_score_codex":0.000006288794,"about_ca_topic_score_gemma":0.0000029360388,"teacher_disagreement_score":0.7439956,"about_ca_system_score_codex":0.00007590622,"about_ca_system_score_gemma":0.00017769019,"threshold_uncertainty_score":0.36222842},"labels":[],"label_agreement":null},{"id":"W1977783668","doi":"10.1016/j.jsc.2012.06.005","title":"Special issue on symbolic and algebraic computation: Foundations, algorithmics and applications: ISSAC 2011","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Theory of computation; Algorithmics; Symbolic computation; Computation; Algebraic number; Algebra over a field; Theoretical computer science; Computer science; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.01787019344714847,"score_gpt":0.2822707966391717,"score_spread":0.26440060319202324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977783668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037452847,0.0012228035,0.95474315,0.0022931884,0.0021469628,0.0006231186,0.000005466855,0.000103024824,0.0014094686],"genre_scores_gemma":[0.7170713,0.00051734026,0.25005397,0.0010810333,0.03101892,0.000043451437,0.000026524795,0.000061189305,0.00012625725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997347,0.00023267923,0.0009413804,0.0004044139,0.00066796987,0.00040658627],"domain_scores_gemma":[0.99744403,0.00063289073,0.0007268147,0.00028476375,0.0005368905,0.00037460352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011238764,0.0003137723,0.0004997567,0.00055058085,0.000342005,0.0003757345,0.0004440223,0.00013054204,0.000034911063],"category_scores_gemma":[0.00007704198,0.0003043939,0.00010811648,0.0005340152,0.0001601336,0.0013339461,0.00024712214,0.00037995272,0.000081688224],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018452445,0.00040444412,0.0020189364,0.000055979803,0.00007357635,0.0000059744925,0.0025597613,0.0020143748,0.000029682838,0.019838624,0.003960987,0.96901923],"study_design_scores_gemma":[0.004522133,0.0016315449,0.33852234,0.00021678761,0.00024021741,0.0032832494,0.0008783207,0.36903733,0.000208377,0.15913334,0.120619595,0.0017067675],"about_ca_topic_score_codex":0.00001348802,"about_ca_topic_score_gemma":0.0000020337898,"teacher_disagreement_score":0.96731246,"about_ca_system_score_codex":0.00016378173,"about_ca_system_score_gemma":0.00013220731,"threshold_uncertainty_score":0.9999408},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04680070270485933,"score_gpt":0.26789864610753344,"score_spread":0.2210979434026741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979127885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69953907,0.0005778499,0.26906708,0.025364693,0.00047089433,0.00044712244,0.000002445378,0.00027817726,0.0042527067],"genre_scores_gemma":[0.9767657,0.000059109705,0.02176875,0.0008254322,0.00047674114,0.00001450334,0.0000015651273,0.000004611539,0.00008357694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894226,0.000018785022,0.0002022163,0.0004200372,0.00018232534,0.00023440344],"domain_scores_gemma":[0.9993307,0.000038090482,0.000062379055,0.00038443808,0.00009049903,0.00009387808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002348768,0.00012739399,0.00021138563,0.00008862328,0.00012604149,0.00003500819,0.00035083163,0.000052669526,0.00001213411],"category_scores_gemma":[0.000027477534,0.00010836853,0.000038883703,0.00034508223,0.000079743,0.00013604779,0.0002969578,0.00009232189,0.000024283394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053476186,0.0003916351,0.00073354784,0.000111568705,0.00005830777,0.000029750932,0.0062807137,0.0040846677,0.013359849,0.72182983,0.036178045,0.21688862],"study_design_scores_gemma":[0.0007369177,0.001174323,0.05593351,0.000018200068,0.000018430212,0.00030889869,0.00040030072,0.0030244568,0.24580844,0.6146452,0.07658147,0.0013498779],"about_ca_topic_score_codex":0.0000107649,"about_ca_topic_score_gemma":0.0000033697304,"teacher_disagreement_score":0.27722666,"about_ca_system_score_codex":0.000005700705,"about_ca_system_score_gemma":0.00002088944,"threshold_uncertainty_score":0.44191402},"labels":[],"label_agreement":null},{"id":"W1984336238","doi":"10.2178/jsl/1264433915","title":"Schnorr triviality and genericity","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Triviality; Corollary; Turing; Connection (principal bundle); Computer science; Mathematics; Pure mathematics; Programming language","score_opus":0.010843327650220754,"score_gpt":0.24386712989320267,"score_spread":0.23302380224298191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984336238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7273367,0.00022286318,0.26788035,0.0021172184,0.0015226973,0.00009097116,9.318094e-7,0.000056319306,0.0007719336],"genre_scores_gemma":[0.90857315,0.000034752098,0.090389065,0.00044004616,0.00052984356,0.0000011129978,1.0379503e-7,0.0000053393287,0.000026586651],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837136,0.00011665183,0.00054023514,0.00027326166,0.00041222599,0.00028623643],"domain_scores_gemma":[0.998397,0.0001774803,0.00039012555,0.0004966828,0.0002966037,0.00024212811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014723669,0.00016482694,0.00039316356,0.0001620788,0.00011544015,0.00019049722,0.0010966099,0.00012364813,0.000029790815],"category_scores_gemma":[0.0003378543,0.000120789155,0.00013742736,0.0003821609,0.00026709016,0.0004822451,0.00042975243,0.0006429181,0.000009442426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050133374,0.0012973471,0.06612915,0.000092582275,0.00014806139,0.00043942677,0.0020813171,0.00025600588,0.054406278,0.32545146,0.0020174729,0.5476308],"study_design_scores_gemma":[0.0023067882,0.0010776321,0.42933145,0.000029115783,0.000057577075,0.005081862,0.00006687412,0.036084168,0.0051614805,0.507913,0.012063103,0.0008269803],"about_ca_topic_score_codex":0.000015344962,"about_ca_topic_score_gemma":0.000007681983,"teacher_disagreement_score":0.5468038,"about_ca_system_score_codex":0.000036669087,"about_ca_system_score_gemma":0.00013931691,"threshold_uncertainty_score":0.49256387},"labels":[],"label_agreement":null},{"id":"W1985919329","doi":"10.1142/s012962640600271x","title":"THREE COUNTEREXAMPLES TO DISPEL THE MYTH OF THE UNIVERSAL COMPUTER","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Turing machine; Counterexample; Computer science; Universal Turing machine; Computable function; Computation; Function (biology); Turing; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Programming language","score_opus":0.012982692665661022,"score_gpt":0.2118979385103161,"score_spread":0.1989152458446551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985919329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062595844,0.00008565,0.8917371,0.044546306,0.00037295133,0.00030919735,0.0000025979798,0.00011758533,0.00023277444],"genre_scores_gemma":[0.8475799,6.661131e-7,0.14015771,0.011857389,0.0003329932,0.000012373514,0.0000015036355,0.000018299927,0.000039145332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981377,0.00009047538,0.0003331449,0.00050724327,0.00052201987,0.00040942262],"domain_scores_gemma":[0.9985953,0.00017359934,0.00019110812,0.00087739143,0.000108868655,0.00005374582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034545816,0.00022693243,0.00022476791,0.000066350585,0.00032650886,0.00029709705,0.0024791094,0.00004274689,0.0000041657104],"category_scores_gemma":[0.00001496139,0.00013407643,0.00012522044,0.00062595983,0.00029676585,0.00030385825,0.0008368783,0.00019979056,0.000016862992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010091323,0.00088435935,0.042039882,0.00044484602,0.00015107446,0.000060298324,0.010419729,0.42660394,0.0075610513,0.052024942,0.17513955,0.2845694],"study_design_scores_gemma":[0.0008486331,0.000093620816,0.23221995,0.00015595912,0.000033268534,0.000052062926,0.00006045645,0.73441607,0.00038928987,0.01148662,0.019555815,0.0006882502],"about_ca_topic_score_codex":0.00042078973,"about_ca_topic_score_gemma":0.0001097331,"teacher_disagreement_score":0.78498405,"about_ca_system_score_codex":0.00008935712,"about_ca_system_score_gemma":0.00008597102,"threshold_uncertainty_score":0.5467478},"labels":[],"label_agreement":null},{"id":"W1989276782","doi":"10.1090/s0002-9947-2012-05416-x","title":"Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem","year":2012,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sigma; Context (archaeology); Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.016434916785768507,"score_gpt":0.2418264658372554,"score_spread":0.2253915490514869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989276782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2193075,0.000051492156,0.7786014,0.001086844,0.000045646786,0.00025818788,0.0000051250654,0.00006315615,0.00058065925],"genre_scores_gemma":[0.8538541,0.00000667241,0.14594965,0.000100629055,0.000019726316,0.000021733546,3.292144e-7,0.000013020134,0.000034147644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772173,0.00032151426,0.00048500032,0.00030237867,0.0007026756,0.00046669095],"domain_scores_gemma":[0.9966046,0.0012120177,0.00043316133,0.0014812491,0.00014133261,0.00012764722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012284566,0.00025149787,0.00076017604,0.000066163855,0.00028307055,0.000054368513,0.0017703556,0.000044867935,0.00004756739],"category_scores_gemma":[0.00003495981,0.0001283457,0.00093352137,0.0029566698,0.0022499189,0.00022425332,0.00011982946,0.00036028458,0.000004894342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015897899,0.010723248,0.059651352,0.0010018253,0.017085604,0.0000020189602,0.07719707,0.086729996,0.00550163,0.669527,0.0002521657,0.07216912],"study_design_scores_gemma":[0.0007869787,0.00047224865,0.10132443,0.00008117493,0.0036041536,0.000086022184,0.0068530138,0.8157815,0.0068320017,0.06330448,0.00007049669,0.0008035121],"about_ca_topic_score_codex":0.000106598825,"about_ca_topic_score_gemma":0.000007895803,"teacher_disagreement_score":0.7290515,"about_ca_system_score_codex":0.00007117449,"about_ca_system_score_gemma":0.000058223977,"threshold_uncertainty_score":0.828992},"labels":[],"label_agreement":null},{"id":"W1989974420","doi":"10.1007/s00012-006-1996-7","title":"Walter Taylor’s contributions to Universal Algebra","year":2006,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mathematics; Algebra over a field; Universal algebra; Pure mathematics","score_opus":0.006643549964862548,"score_gpt":0.22731783308574727,"score_spread":0.22067428312088472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989974420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048659813,0.000084809704,0.9245799,0.01093657,0.0010187564,0.0005873906,0.00012115046,0.0010904702,0.0129211],"genre_scores_gemma":[0.9636778,0.0000043668224,0.033062,0.0011486553,0.00040649014,0.000010555984,0.00005795888,0.00003171212,0.0016004348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710935,0.00018975651,0.00037509168,0.0009627991,0.0005265929,0.00083642435],"domain_scores_gemma":[0.99750113,0.00026644117,0.00011839204,0.0012744047,0.00046671904,0.0003729177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031963098,0.0003658224,0.0003706211,0.00042641824,0.00035485942,0.00028385752,0.001893997,0.00015921776,0.00020670012],"category_scores_gemma":[0.00008680912,0.0003898588,0.00021472796,0.0016369739,0.00015896323,0.0010477577,0.0010228939,0.00026256277,0.0005518163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016476006,0.0002371045,0.00058289815,0.0000072286616,0.000049667706,0.00026317293,0.00054859056,0.0010138326,0.0007566967,0.9618418,0.026303262,0.008379275],"study_design_scores_gemma":[0.0061498582,0.0011894848,0.026789889,0.000074769974,0.00019575928,0.0003115803,0.0006427885,0.09907766,0.013415768,0.25804856,0.59022003,0.003883812],"about_ca_topic_score_codex":0.0018659913,"about_ca_topic_score_gemma":0.0003304915,"teacher_disagreement_score":0.915018,"about_ca_system_score_codex":0.0006437936,"about_ca_system_score_gemma":0.00019733727,"threshold_uncertainty_score":0.99985534},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008618561469826036,"score_gpt":0.2262105296436449,"score_spread":0.21759196817381887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990125233","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57956976,0.0002418125,0.41673622,0.000748361,0.00095845095,0.00050527084,0.000019260067,0.00032188132,0.0008990015],"genre_scores_gemma":[0.9919311,0.000008673564,0.007683156,0.00007685208,0.00019958359,0.0000128769525,0.000014988063,0.00002398693,0.000048831247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968171,0.00019334412,0.0007376541,0.0011035166,0.00050285656,0.0006455152],"domain_scores_gemma":[0.99775726,0.00055687845,0.00023120269,0.00084860733,0.00019262162,0.00041342253],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013369514,0.00041559275,0.0007269454,0.00010860457,0.0003396245,0.0010725764,0.0008304992,0.00026562306,0.0000033349042],"category_scores_gemma":[0.00017537049,0.0003530663,0.00011432948,0.00026998686,0.00036836788,0.00037593732,0.0009061472,0.0007041476,0.0000049628325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000362075,0.00035594733,0.07840027,0.00041047507,0.00018119784,0.00015557141,0.0015455933,0.0005917739,0.002852318,0.5162206,0.000057294834,0.39919272],"study_design_scores_gemma":[0.00046126978,0.00010986636,0.065959714,0.000046088462,0.00001706791,0.00028040254,0.00016568058,0.9287517,0.000008395465,0.0035681468,0.00017214626,0.00045953016],"about_ca_topic_score_codex":0.0010084572,"about_ca_topic_score_gemma":0.0005808334,"teacher_disagreement_score":0.9281599,"about_ca_system_score_codex":0.00006703263,"about_ca_system_score_gemma":0.000055986657,"threshold_uncertainty_score":0.9999644},"labels":[],"label_agreement":null},{"id":"W1991083015","doi":"10.2307/2586561","title":"The real line in elementary submodels of set theory","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cardinality (data modeling); Mathematics; Topological space; Transitive closure; Transitive relation; Simple (philosophy); Closure (psychology); Axiom; Reachability; Real line; Discrete mathematics; Elementary theory; Set (abstract data type); Cardinal number (linguistics); Space (punctuation); Combinatorics; Computer science","score_opus":0.021729688863343078,"score_gpt":0.27613476911184864,"score_spread":0.25440508024850556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991083015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95806706,0.0010581375,0.033634838,0.0027513453,0.00044351522,0.00021265807,0.0000038213298,0.00002831964,0.003800336],"genre_scores_gemma":[0.9892203,0.00084446766,0.009271426,0.00032436487,0.00021802277,0.0000022484671,4.985231e-7,0.000006740848,0.00011188933],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976498,0.00041605023,0.0009228842,0.00019578393,0.00048546787,0.0003300373],"domain_scores_gemma":[0.9983143,0.00056522025,0.0003652319,0.0005015201,0.00015875502,0.00009496289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031113068,0.00014949168,0.00036954973,0.00014304805,0.000077880686,0.000059061902,0.0015756427,0.00006300345,0.000100949765],"category_scores_gemma":[0.000063980355,0.00009071252,0.00016676546,0.00047081348,0.0001323884,0.0003240239,0.00018731497,0.00034888572,0.000009719313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003180703,0.0009632592,0.009764587,0.000044185137,0.00014741284,0.0002904517,0.0054369336,0.022428574,0.0008035447,0.1350522,0.0007973834,0.8239534],"study_design_scores_gemma":[0.0015857017,0.0011637412,0.056706343,0.00007162871,0.000026057827,0.00040410282,0.00030426917,0.051317263,0.0007573392,0.88586694,0.0014970789,0.00029951494],"about_ca_topic_score_codex":0.000060768485,"about_ca_topic_score_gemma":0.00002799925,"teacher_disagreement_score":0.8236539,"about_ca_system_score_codex":0.000102549086,"about_ca_system_score_gemma":0.00014930405,"threshold_uncertainty_score":0.36991495},"labels":[],"label_agreement":null},{"id":"W1991716756","doi":"10.5539/jmr.v6n3p21","title":"Compactness Theorem for Some Generalized Second-Order Language","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ultraproduct; Mathematics; Compact space; Order (exchange); Ultrafilter; Type (biology); Interpretation (philosophy); Factorization; Combinatorics; Discrete mathematics; Pure mathematics; Algorithm; Computer science","score_opus":0.08885580934656623,"score_gpt":0.4004201850019939,"score_spread":0.31156437565542766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991716756","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23673606,0.00021717662,0.7600105,0.001298273,0.00035253947,0.00032627725,0.000003146565,0.000032624943,0.001023437],"genre_scores_gemma":[0.38413906,0.000014302058,0.6142515,0.00014155003,0.0006843057,0.000014274629,8.9349027e-7,0.000029885834,0.00072422664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968195,0.00049205445,0.0006870104,0.00022965923,0.0012324962,0.0005392884],"domain_scores_gemma":[0.99452543,0.0029353802,0.00032058492,0.0007579159,0.0012331274,0.00022753364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010467802,0.00015667613,0.00049552845,0.00040817217,0.00017982478,0.00036430685,0.002082041,0.00007252362,0.000101366524],"category_scores_gemma":[0.0016753165,0.00011304448,0.00019902053,0.00046654983,0.00014228285,0.00044126442,0.00045187963,0.00050586805,0.000030282328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051289135,0.0014018002,0.000075973425,0.00087158213,0.0001647602,0.000057044996,0.010103912,0.0008731733,0.011728073,0.91770995,0.008990369,0.047972094],"study_design_scores_gemma":[0.0014744207,0.0005117564,0.00019514086,0.00008332416,0.000009192005,0.00024068833,0.00046540427,0.4712498,0.0063848794,0.51559347,0.0035832205,0.00020873488],"about_ca_topic_score_codex":0.0000045147845,"about_ca_topic_score_gemma":0.0000057655548,"teacher_disagreement_score":0.4703766,"about_ca_system_score_codex":0.00011380523,"about_ca_system_score_gemma":0.0002142702,"threshold_uncertainty_score":0.46098202},"labels":[],"label_agreement":null},{"id":"W1993827888","doi":"10.1016/j.apal.2005.04.005","title":"Structures interpretable in models of bounded arithmetic","year":2005,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto","keywords":"Pigeonhole principle; Mathematics; Bounded function; Converse; Discrete mathematics; Injective function; Reverse mathematics; Intuitionism; Combinatorics; Mathematical analysis; Axiom","score_opus":0.047674248122388595,"score_gpt":0.2869142189680694,"score_spread":0.2392399708456808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993827888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6049093,0.002292802,0.3747418,0.0024266231,0.000110990135,0.00053626177,0.000009417442,0.00009731857,0.0148754995],"genre_scores_gemma":[0.9491158,0.00005824742,0.050317075,0.00044683012,0.000030288107,0.000008927112,0.0000011800531,0.000004921214,0.00001673316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868906,0.000039019164,0.00040292073,0.0003771527,0.00021722082,0.0002746092],"domain_scores_gemma":[0.9992039,0.00010127707,0.00014140148,0.0004152794,0.000074563344,0.00006354444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038086655,0.0001589077,0.00038390543,0.00015387285,0.000029978763,0.000043991262,0.00058759627,0.00009306012,0.0000144016385],"category_scores_gemma":[0.000016909527,0.00013296341,0.00006186606,0.00033232858,0.00012403652,0.00022353185,0.00034482937,0.0001416908,0.0000017943024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027170236,0.0002467962,0.00019375418,0.00008559404,0.000025431189,0.0000028550455,0.0014014337,0.020901486,0.0017609819,0.8353411,0.00020996804,0.13980342],"study_design_scores_gemma":[0.00027199514,0.00011261151,0.0017136914,0.00001524978,0.0000040831687,0.0000060871525,0.000057659043,0.101648346,0.009539631,0.8862959,0.0001735053,0.00016124798],"about_ca_topic_score_codex":0.0000261785,"about_ca_topic_score_gemma":0.000035197274,"teacher_disagreement_score":0.3442065,"about_ca_system_score_codex":0.000008722255,"about_ca_system_score_gemma":0.000036155692,"threshold_uncertainty_score":0.542209},"labels":[],"label_agreement":null},{"id":"W1993915007","doi":"10.2178/jsl/1191333856","title":"The settling-time reducibility ordering","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Countable set; Mathematics; Combinatorics; Settling; Enumeration; Sequence (biology); Invariant (physics); Isomorphism (crystallography); Function (biology); Discrete mathematics; Physics; Crystallography; Chemistry; Mathematical physics","score_opus":0.014190568153691853,"score_gpt":0.26542623838567236,"score_spread":0.2512356702319805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993915007","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5381312,0.001379824,0.44717863,0.0065346328,0.0024780042,0.00024607277,7.0946254e-7,0.0001463551,0.003904627],"genre_scores_gemma":[0.95065856,0.000048748774,0.048027195,0.00036784387,0.0007416861,9.828982e-7,1.4105424e-7,0.000010802504,0.00014401131],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997352,0.00016879066,0.000946386,0.0003360194,0.0006478641,0.00054894935],"domain_scores_gemma":[0.99687374,0.0009788678,0.0005466413,0.0009073667,0.00047549343,0.00021790917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073950216,0.00019136231,0.00035781073,0.00013833644,0.00032028405,0.00025930683,0.0020478212,0.000093162365,0.000019552359],"category_scores_gemma":[0.0008240622,0.00011682533,0.00024039714,0.00063621375,0.00016309055,0.0003963272,0.00047142073,0.0004932403,0.000049605234],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017182517,0.0011340193,0.00873811,0.0000725783,0.00028901498,0.000756039,0.0049726125,0.0057442407,0.0141535895,0.052359395,0.0039581666,0.9076504],"study_design_scores_gemma":[0.0024723469,0.002054617,0.22844927,0.00015650495,0.000083410305,0.0059914878,0.0005869447,0.09995445,0.0072776144,0.61539036,0.036176275,0.0014067556],"about_ca_topic_score_codex":0.000010218265,"about_ca_topic_score_gemma":0.000005377417,"teacher_disagreement_score":0.9062437,"about_ca_system_score_codex":0.00020106645,"about_ca_system_score_gemma":0.0001890027,"threshold_uncertainty_score":0.47639987},"labels":[],"label_agreement":null},{"id":"W1995451043","doi":"10.3166/ria.16.63-86","title":"Sciences de l'artificiel, modélisation et rationalité","year":2002,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Philosophy; Mathematics; Discrete mathematics","score_opus":0.19215410266001307,"score_gpt":0.3391415738035228,"score_spread":0.1469874711435097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995451043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011311237,0.008640636,0.91957146,0.041120805,0.0030478414,0.0005523861,0.000018016477,0.00026257677,0.015475056],"genre_scores_gemma":[0.8876262,0.0007523859,0.08278319,0.0021262264,0.0007673192,0.00007109113,0.000008916004,0.000042108684,0.025822587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994502,0.0008957485,0.0011516629,0.0014674133,0.0007693402,0.0012137974],"domain_scores_gemma":[0.9963259,0.0013257099,0.00034158846,0.0012176745,0.0004450118,0.00034411764],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0038635223,0.00047280212,0.00043798593,0.00028734005,0.0009125108,0.0012198472,0.001828971,0.000281421,0.0033112078],"category_scores_gemma":[0.0009417219,0.00053015555,0.00029092524,0.0022879129,0.0012124295,0.0016600789,0.000543567,0.0005673621,0.0037225948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032056214,0.000601489,0.0002436684,0.0000774696,0.000014596352,0.000030723262,0.007722662,0.47842494,0.0006327511,0.39018503,0.003323544,0.11873994],"study_design_scores_gemma":[0.000048386428,0.00029229163,0.00013913814,0.0001494005,0.000019579147,0.00020531924,0.0005146586,0.88441885,0.008804819,0.08025946,0.024630427,0.0005176714],"about_ca_topic_score_codex":0.00036268358,"about_ca_topic_score_gemma":0.00008389035,"teacher_disagreement_score":0.87631494,"about_ca_system_score_codex":0.00035568597,"about_ca_system_score_gemma":0.00028189976,"threshold_uncertainty_score":0.99981695},"labels":[],"label_agreement":null},{"id":"W1995730325","doi":"10.1016/j.tcs.2011.04.012","title":"Continuity of operators on continuous and discrete time streams","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Swansea University","keywords":"Hadamard transform; Metric space; Computer science; Theoretical computer science; Discrete space; Spacetime; Metric (unit); Range (aeronautics); STREAMS; Discrete time and continuous time; Semantics (computer science); Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Programming language; Mathematical analysis","score_opus":0.009724069923910086,"score_gpt":0.22600280106757506,"score_spread":0.21627873114366497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995730325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36945665,0.000017292929,0.6222519,0.00014635037,0.00033581708,0.00025388598,0.0000043938903,0.00017357462,0.0073600877],"genre_scores_gemma":[0.8732979,0.0000018017153,0.12645033,0.00018111407,0.000046481342,0.0000038093692,2.754089e-7,0.0000075328376,0.000010747012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708325,0.00019336189,0.00041990168,0.0010139045,0.00070016494,0.00058939337],"domain_scores_gemma":[0.99773544,0.00035544325,0.00011827879,0.0011566938,0.00026942044,0.00036469742],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017030193,0.00026802282,0.00044105953,0.00018183107,0.0002210238,0.00022084665,0.0025362123,0.00006940284,0.000068399786],"category_scores_gemma":[0.00014159294,0.00020472414,0.0000794384,0.00084048015,0.0048908,0.0005186255,0.0019854687,0.00021320867,0.00005358376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016053473,0.00014070807,0.0006851463,0.000006715803,0.0000057755,0.000014052718,0.001092607,0.000012072315,0.00041750667,0.92105955,0.000010513543,0.07653927],"study_design_scores_gemma":[0.00072192826,0.0024391338,0.029703338,0.00007712746,0.000013984002,0.00007236898,0.000021723537,0.67268616,0.028152376,0.26542115,0.00003631732,0.00065440795],"about_ca_topic_score_codex":0.000018499777,"about_ca_topic_score_gemma":4.6588102e-7,"teacher_disagreement_score":0.67267406,"about_ca_system_score_codex":0.00004094725,"about_ca_system_score_gemma":0.00009822706,"threshold_uncertainty_score":0.99781734},"labels":[],"label_agreement":null},{"id":"W1996431919","doi":"10.1016/j.jlamp.2014.11.001","title":"Models of computation for partial functions on the reals","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Countable set; Computability; Mathematics; Disjoint sets; Computation; Disjoint union (topology); Domain (mathematical analysis); Discrete mathematics; Sequence (biology); Algorithm; Mathematical analysis","score_opus":0.10855918832622603,"score_gpt":0.37975196510477655,"score_spread":0.2711927767785505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996431919","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02594917,0.00010420599,0.9715787,0.0016564892,0.00031045085,0.00025299337,4.0075437e-7,0.000015542844,0.00013201247],"genre_scores_gemma":[0.34447396,0.0000050751937,0.6552915,0.00011318306,0.00009955282,0.000008841982,1.9554356e-7,0.0000029840987,0.000004694992],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977444,0.00087441533,0.00070657354,0.00021610802,0.0002492279,0.00020931463],"domain_scores_gemma":[0.9946633,0.0044726613,0.00042253797,0.00016934426,0.00019056245,0.00008157715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006859328,0.000116667834,0.00035705286,0.00011053569,0.00009400481,0.00008823258,0.00037940382,0.00007022972,0.0000029064263],"category_scores_gemma":[0.0012165171,0.000065935266,0.00014773938,0.00031102265,0.000114510694,0.00018428994,0.00012730311,0.0002482125,2.5454352e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026069461,0.00014792013,0.000102739396,0.00001845612,0.000013016919,0.0000011759441,0.00023270026,0.004664988,0.00017013725,0.13690577,0.000018300976,0.85769874],"study_design_scores_gemma":[0.00036032771,0.0009940782,0.0006697705,0.00003770239,0.000011415517,0.000029449864,0.00005351912,0.46009997,0.00036871573,0.5364043,0.00089348975,0.00007724924],"about_ca_topic_score_codex":0.0000032953922,"about_ca_topic_score_gemma":8.6431066e-7,"teacher_disagreement_score":0.8576215,"about_ca_system_score_codex":0.000020503361,"about_ca_system_score_gemma":0.00002862879,"threshold_uncertainty_score":0.2688762},"labels":[],"label_agreement":null},{"id":"W1997006459","doi":"10.1016/j.tcs.2012.01.011","title":"Effectively approximating measurable sets by open sets","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Algorithm; Discrete mathematics; Combinatorics","score_opus":0.022850413530175428,"score_gpt":0.28853472834075244,"score_spread":0.265684314810577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997006459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04333117,0.0001037736,0.9440465,0.0008138747,0.0012607164,0.0008002787,0.000004769798,0.00043205052,0.009206892],"genre_scores_gemma":[0.6347391,8.8139797e-7,0.36463997,0.000483436,0.00008566891,0.000029457718,0.0000011793555,0.000012926702,0.0000073591586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99436384,0.00059869513,0.00054996007,0.0013737867,0.0014038703,0.0017098234],"domain_scores_gemma":[0.9960276,0.0009427106,0.00018119553,0.0016633259,0.00032988106,0.00085528544],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.008809047,0.00041734157,0.00052197283,0.00017517013,0.00096413895,0.001840883,0.008555507,0.00010439646,0.00005920278],"category_scores_gemma":[0.00045731352,0.00034568427,0.00010629298,0.0020463497,0.0023096977,0.0036563012,0.008103801,0.0004370013,0.0002458004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008252774,0.0003882972,0.0008064212,0.000022044862,0.000010520737,0.000005734885,0.0010034556,0.0001102216,0.0010928405,0.8388795,0.0005195204,0.15715317],"study_design_scores_gemma":[0.0004918733,0.00030189235,0.003551437,0.000045620534,0.000008318148,0.00012864417,0.00001152781,0.8263317,0.009133782,0.15904927,0.00027991447,0.00066604995],"about_ca_topic_score_codex":0.000028477552,"about_ca_topic_score_gemma":5.083725e-7,"teacher_disagreement_score":0.82622147,"about_ca_system_score_codex":0.00027046129,"about_ca_system_score_gemma":0.00018987831,"threshold_uncertainty_score":0.99991846},"labels":[],"label_agreement":null},{"id":"W1998220929","doi":"10.1016/j.apal.2009.06.008","title":"Effectiveness in RPL, with applications to continuous logic","year":2009,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decidability; Mathematics; Discrete mathematics; Model theory; Abstract model theory; Extension (predicate logic); Computability; Algebra over a field; Pure mathematics; Computer science","score_opus":0.031871769687497095,"score_gpt":0.2976856607751662,"score_spread":0.2658138910876691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998220929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21685432,0.00046230198,0.7703086,0.0042219646,0.00003195359,0.0017279299,0.0000046142113,0.0001660689,0.006222219],"genre_scores_gemma":[0.97564775,0.000017301469,0.022570135,0.0015902258,0.00003055668,0.00012743707,0.0000021936655,0.000004740072,0.000009647506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986206,0.000059892,0.00024149015,0.0005618903,0.0001924003,0.00032372467],"domain_scores_gemma":[0.99904865,0.00016961775,0.00008640872,0.0004769561,0.00010095008,0.00011740788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050287443,0.0001885647,0.00037935041,0.00014124782,0.00006155675,0.000059706388,0.00054393854,0.000079407866,0.0000032333514],"category_scores_gemma":[0.000014079367,0.00014495432,0.00003858876,0.00074333174,0.00006628732,0.00009631972,0.00014800492,0.00013136612,0.000012052801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008375167,0.0006508806,0.0011469935,0.00007277575,0.00001746091,0.000016885777,0.00040862238,0.002266879,0.003929566,0.6870929,0.0001508784,0.3041624],"study_design_scores_gemma":[0.0010641314,0.0019828186,0.21899146,0.00006957286,0.000011942812,0.000033928452,0.00010916388,0.0009786283,0.012157824,0.76212966,0.0017943244,0.0006765691],"about_ca_topic_score_codex":0.000009835194,"about_ca_topic_score_gemma":0.000011502394,"teacher_disagreement_score":0.7587935,"about_ca_system_score_codex":0.000010919533,"about_ca_system_score_gemma":0.000030739942,"threshold_uncertainty_score":0.5911066},"labels":[],"label_agreement":null},{"id":"W2001755005","doi":"10.1145/2483852.2483869","title":"Information distance between what I said and what it heard","year":2013,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; International Development Research Centre; University of Waterloo; Canada Foundation for Innovation; Microsoft","keywords":"Computer science; World Wide Web","score_opus":0.037572999657453324,"score_gpt":0.27809257495627876,"score_spread":0.24051957529882545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001755005","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09615317,0.008734666,0.08851554,0.80223733,0.0007085656,0.0015712382,0.000009506926,0.00024090701,0.0018290558],"genre_scores_gemma":[0.7670503,0.0021949692,0.22992451,0.00071923184,0.000016779582,0.00004614417,0.000007714975,0.000004360671,0.00003594924],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990748,0.00017225849,0.00031912018,0.00010900029,0.000188968,0.00013585806],"domain_scores_gemma":[0.9772918,0.0006183667,0.00017809586,0.021649541,0.000211551,0.00005062715],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00036622604,0.00009227865,0.00014322535,0.00005126596,0.0002596974,0.0010189596,0.021381674,0.000042966538,0.0000058682513],"category_scores_gemma":[0.0012830636,0.0000710525,0.000053478565,0.00034449456,0.0002768646,0.008524392,0.02639734,0.00016317915,0.00005265489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011563847,0.000077426535,0.007955486,0.000042208398,0.000029977842,2.0091484e-8,0.0067011197,0.00007173145,0.00004391128,0.021717248,0.0067479485,0.95661175],"study_design_scores_gemma":[0.00052804424,0.000086383785,0.27477783,0.00038714687,0.000027649208,0.00000796508,0.0038307442,0.044193238,0.00057682715,0.5649277,0.110207126,0.0004493636],"about_ca_topic_score_codex":0.00010074606,"about_ca_topic_score_gemma":0.00002570082,"teacher_disagreement_score":0.9561624,"about_ca_system_score_codex":0.000043288805,"about_ca_system_score_gemma":0.00003490248,"threshold_uncertainty_score":0.9839131},"labels":[],"label_agreement":null},{"id":"W2002393837","doi":"10.1016/s0303-2647(02)00020-5","title":"No Free Lunch: Why Specified Complexity Cannot be Purchased Without Intelligence, William Dembski, Rowman and Littlefield, 2002","year":2002,"lang":"en","type":"article","venue":"Biosystems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Department of Electronics and Information Technology, Ministry of Communications and Information Technology","keywords":"Mathematical economics; Mathematics","score_opus":0.08520510025240266,"score_gpt":0.2517812186450466,"score_spread":0.16657611839264394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002393837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05296878,0.0061418647,0.8269838,0.011124303,0.010654067,0.0040605315,0.00026881747,0.0024754133,0.085322395],"genre_scores_gemma":[0.9553686,0.000099474746,0.03912637,0.0012991849,0.0011260263,0.0000627563,0.000009338784,0.0000479876,0.0028602574],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960648,0.00029791912,0.0008170912,0.0012492016,0.0007764664,0.00079452666],"domain_scores_gemma":[0.9965445,0.00025476157,0.00026896672,0.0021693998,0.00032222774,0.00044014386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064084085,0.00050032005,0.0006828745,0.00022647167,0.0003264616,0.00051756424,0.0022164292,0.00024568586,0.0003453994],"category_scores_gemma":[0.00023562016,0.00045554023,0.00015677774,0.0007548668,0.00032790468,0.00047516738,0.0010095284,0.0003726014,0.00030908757],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002079907,0.0039135516,0.04209989,0.001940572,0.00074509444,0.00060456904,0.014075723,0.00041933294,0.004005247,0.16735493,0.6081315,0.15650155],"study_design_scores_gemma":[0.0014529558,0.00089687336,0.0069175563,0.00021694791,0.00003818262,0.00031250145,0.00017363722,0.50449866,0.0017598347,0.007098172,0.4748297,0.0018049645],"about_ca_topic_score_codex":0.0009820597,"about_ca_topic_score_gemma":0.00080450263,"teacher_disagreement_score":0.90239984,"about_ca_system_score_codex":0.00015267226,"about_ca_system_score_gemma":0.000046142137,"threshold_uncertainty_score":0.99978966},"labels":[],"label_agreement":null},{"id":"W2003846114","doi":"10.1016/j.jpaa.2008.04.010","title":"The category of 3-computads is not cartesian closed","year":2008,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cartesian closed category; Mathematics; Corollary; Topos theory; Pure mathematics; Cartesian coordinate system; Argument (complex analysis); Algebra over a field; Geometry","score_opus":0.0157071749816032,"score_gpt":0.22380407183351428,"score_spread":0.20809689685191107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003846114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87465054,0.0012417211,0.11662705,0.0047707665,0.0006151939,0.00024542003,0.0000025687502,0.000042428826,0.0018043334],"genre_scores_gemma":[0.9888689,0.00011467825,0.010186998,0.00049634394,0.00027908414,0.0000017685935,1.9323747e-7,0.000008693169,0.000043342414],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983063,0.000058063284,0.00061495724,0.00023092337,0.00051941106,0.00027038247],"domain_scores_gemma":[0.998498,0.00028749558,0.00046245923,0.00041131797,0.00018822572,0.00015250209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062434806,0.00017428011,0.00038313537,0.000098283934,0.00026565974,0.00008573277,0.0009619567,0.00008174935,0.0000073721644],"category_scores_gemma":[0.000019784837,0.00011267617,0.00015653612,0.0003102244,0.00021166315,0.00017529321,0.00024154791,0.0003345912,0.0000051926277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002167251,0.0007724914,0.0031082528,0.00012757782,0.00044543442,0.00030822682,0.017923106,0.00051016576,0.015146644,0.29071242,0.02122348,0.6495055],"study_design_scores_gemma":[0.0084626265,0.0029057513,0.23099403,0.00012746933,0.0002308072,0.0062640696,0.001562984,0.035176035,0.12483866,0.54447854,0.04285442,0.0021046267],"about_ca_topic_score_codex":0.000005422221,"about_ca_topic_score_gemma":0.0000027288718,"teacher_disagreement_score":0.64740086,"about_ca_system_score_codex":0.000026916989,"about_ca_system_score_gemma":0.00016516144,"threshold_uncertainty_score":0.45948008},"labels":[],"label_agreement":null},{"id":"W2005167350","doi":"10.1007/s00220-014-2218-3","title":"Non-Computable Impressions of Computable External Rays of Quadratic Polynomials","year":2014,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quadratic equation; Prime (order theory); Computability; Construct (python library); Julia set; Algebra over a field","score_opus":0.037165089797624576,"score_gpt":0.3100786385459146,"score_spread":0.27291354874829005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005167350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024557345,0.0001263787,0.9692759,0.00028487752,0.00009105373,0.00039184935,0.000004730929,0.00006914709,0.005198747],"genre_scores_gemma":[0.5883499,0.000010557296,0.41153482,0.000027833818,0.000024125879,0.000023182089,0.000002351279,0.00001082958,0.0000164302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744284,0.0003657046,0.0011155157,0.00034198086,0.00039365282,0.00034031505],"domain_scores_gemma":[0.9925283,0.002467738,0.00045265676,0.0042044944,0.00023848623,0.00010831533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011925822,0.00022712044,0.0007773677,0.00012967059,0.00012935365,0.00006364671,0.0042527243,0.000093521645,0.000017479875],"category_scores_gemma":[0.00029321547,0.0002116229,0.00017215025,0.00084256433,0.00045156595,0.0003567591,0.0026203434,0.00034106767,0.000035319557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065255617,0.0036012256,0.0010839185,0.00048173504,0.000040523122,6.0120357e-7,0.0025078815,0.023177436,0.008024213,0.91803414,0.00021470261,0.042827122],"study_design_scores_gemma":[0.00026825254,0.00005195297,0.0005876794,0.00018683507,0.00000920283,0.000002525229,0.000021556049,0.6036694,0.0025622344,0.39248163,0.000033416083,0.00012530925],"about_ca_topic_score_codex":0.000048086156,"about_ca_topic_score_gemma":0.000003490377,"teacher_disagreement_score":0.58049196,"about_ca_system_score_codex":0.00006280809,"about_ca_system_score_gemma":0.000114866714,"threshold_uncertainty_score":0.86297315},"labels":[],"label_agreement":null},{"id":"W2006852187","doi":"10.1139/p07-136","title":"Relations entre l’entropie physique, le codage de l’information et l’énergie de simulation","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Binary number; Physical system; Entropy (arrow of time); Thermodynamics; Statistical physics; Quantum mechanics; Arithmetic; Mathematics","score_opus":0.011847010356914336,"score_gpt":0.24406721510719573,"score_spread":0.23222020475028138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006852187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055120476,0.000045540466,0.94147307,0.0012417068,0.0002615043,0.000082208964,0.0000050545577,0.000022889706,0.0017475653],"genre_scores_gemma":[0.9705934,0.000002626272,0.028568909,0.000554197,0.00024121052,5.1787123e-7,0.0000050114286,0.000006690976,0.000027456314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887073,0.00007552579,0.0003690104,0.000093663926,0.00021391289,0.0003771465],"domain_scores_gemma":[0.9984319,0.00021320827,0.00030003116,0.0002244317,0.00036564117,0.00046477994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071230275,0.00010944478,0.00013931106,0.00017727367,0.00018248647,0.00019373244,0.0004565019,0.000064049986,0.000010409305],"category_scores_gemma":[0.00015064198,0.0001179218,0.00010972465,0.00043770974,0.00004718187,0.001690895,0.000029104065,0.00028381887,0.000016430165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051330517,0.000044902412,0.0042800447,0.000012551005,0.000032407326,0.000057352263,0.0065744077,0.71955734,0.00020744675,0.15816124,0.0015387681,0.109528385],"study_design_scores_gemma":[0.00094133243,0.00016084005,0.10643128,0.00005260029,0.000028810462,0.0001151134,0.0003898387,0.745433,0.001701614,0.12565841,0.018700747,0.00038641074],"about_ca_topic_score_codex":0.0014374306,"about_ca_topic_score_gemma":0.0035090223,"teacher_disagreement_score":0.9154729,"about_ca_system_score_codex":0.0007166293,"about_ca_system_score_gemma":0.0026845906,"threshold_uncertainty_score":0.48087117},"labels":[],"label_agreement":null},{"id":"W2009212476","doi":"10.2178/jsl/1294170990","title":"Computability of Fraïssé limits","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Countable set; Limit (mathematics); Mathematics; Computability; Pure mathematics; Quantifier (linguistics); Finitely-generated abelian group; Focus (optics); Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.06807033090625696,"score_gpt":0.25830321598898537,"score_spread":0.1902328850827284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009212476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5069215,0.0006229681,0.48397812,0.00061256974,0.0014777953,0.00020795777,0.0000022041327,0.000081491395,0.0060953433],"genre_scores_gemma":[0.85798514,0.000026674232,0.14155266,0.00023839375,0.00017400247,0.0000011307286,1.4283727e-7,0.000007982734,0.000013891385],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99710387,0.00029010908,0.0012448295,0.00033032076,0.0006598943,0.00037095885],"domain_scores_gemma":[0.9968936,0.0003440673,0.0009790977,0.00078432064,0.00076034723,0.00023857104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017770701,0.00022819822,0.000727016,0.00026175953,0.00006461751,0.000043096734,0.0020992996,0.00013030547,0.000097982695],"category_scores_gemma":[0.00033538876,0.00017269075,0.00035730505,0.00063774595,0.00020979857,0.0005196101,0.0004069485,0.00040758352,0.000023468741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032915303,0.010903039,0.18424913,0.00061043655,0.00078194175,0.0008873173,0.032820977,0.0027025726,0.008061343,0.29993123,0.0032030938,0.45551977],"study_design_scores_gemma":[0.0015300397,0.0026112036,0.53658384,0.00010654568,0.000064364154,0.0011516059,0.00020508145,0.0144936405,0.008862435,0.43301916,0.0007787586,0.00059330714],"about_ca_topic_score_codex":0.000034566194,"about_ca_topic_score_gemma":0.0000031393158,"teacher_disagreement_score":0.45492646,"about_ca_system_score_codex":0.000093639836,"about_ca_system_score_gemma":0.00021676428,"threshold_uncertainty_score":0.7042124},"labels":[],"label_agreement":null},{"id":"W2010459186","doi":"10.1017/s0140525x1000227x","title":"Deceiving ourselves about self-deception","year":2011,"lang":"en","type":"article","venue":"Behavioral and Brain Sciences","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Unconscious mind; Self-deception; Deception; Consciousness; Psychology; Darwinism; Cognitive science; Cognitive psychology; Psychoanalysis; Social psychology; Epistemology; Philosophy; Neuroscience","score_opus":0.0845447453294604,"score_gpt":0.3081422998306822,"score_spread":0.22359755450122182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010459186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96805453,0.00017572178,0.028778538,0.00065937004,0.00050810905,0.00015591852,0.0000011792162,0.0003689504,0.0012976977],"genre_scores_gemma":[0.8588352,0.000011995971,0.14085245,0.00015484568,0.000054560063,0.000010174613,3.187672e-7,0.0000034389834,0.00007697725],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99827147,0.000093614,0.00021488586,0.00064254,0.00039096505,0.0003865339],"domain_scores_gemma":[0.999332,0.0000833599,0.000084974694,0.00028828153,0.00006332998,0.0001480453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000963822,0.00015840307,0.00015553244,0.00013041127,0.00044856558,0.00034545764,0.0010003201,0.00005848859,0.00004721446],"category_scores_gemma":[0.00002813284,0.00012212267,0.000056325232,0.0005942335,0.00039371508,0.0010757275,0.00044027314,0.00009651614,0.000024438126],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003991648,0.00075636944,0.23262511,0.000016423837,0.0000058326973,0.000029343722,0.017943451,0.0000067739793,0.0021620952,0.023658616,0.0006264303,0.7221656],"study_design_scores_gemma":[0.00028192095,0.0008304346,0.95932746,0.000029938741,0.000013815124,0.00009697557,0.0006696891,0.015529613,0.001291017,0.020160444,0.0012112757,0.0005574152],"about_ca_topic_score_codex":0.00020874015,"about_ca_topic_score_gemma":0.00006534691,"teacher_disagreement_score":0.72670233,"about_ca_system_score_codex":0.000023241357,"about_ca_system_score_gemma":0.000074127216,"threshold_uncertainty_score":0.49800178},"labels":[],"label_agreement":null},{"id":"W2011276709","doi":"10.1142/s0129054114400152","title":"DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Axiom; Mathematics; Descriptive complexity theory; Complexity class; Quantum complexity theory; Discrete mathematics; Theoretical computer science; Computer science; Time complexity; Quantum; Quantum information","score_opus":0.07310804458958418,"score_gpt":0.33139587111233093,"score_spread":0.25828782652274673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011276709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11342187,0.00002237734,0.88033026,0.0031638115,0.0025275287,0.00014276175,0.000006712533,0.000029702962,0.0003549804],"genre_scores_gemma":[0.56861365,0.000004287445,0.43100402,0.00016537718,0.00020053667,0.0000020005605,0.0000021487795,0.0000034906952,0.0000045069373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576503,0.00023286632,0.0011617831,0.0004419296,0.0020585805,0.00033979522],"domain_scores_gemma":[0.9952078,0.000486014,0.00089548423,0.0005113327,0.0027152735,0.00018411144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029943387,0.00019850048,0.0003983277,0.0012222619,0.000178325,0.00065037684,0.0050289147,0.00004156247,0.00004129791],"category_scores_gemma":[0.00034644757,0.00018778612,0.00016211778,0.0012207297,0.0014821975,0.0025922377,0.00092037115,0.00028823366,0.000013874439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071381844,0.001464638,0.014064449,0.000037079797,0.00009385549,0.000032576543,0.0018480206,0.040029947,0.0017798791,0.7740274,0.0002704601,0.16628031],"study_design_scores_gemma":[0.00087817543,0.00036202717,0.07026854,0.00009100715,0.0000047430217,0.0002199948,0.000025065861,0.6964021,0.0004969799,0.22983518,0.0012035292,0.00021270917],"about_ca_topic_score_codex":0.00007569967,"about_ca_topic_score_gemma":0.00007692318,"teacher_disagreement_score":0.65637213,"about_ca_system_score_codex":0.00037089878,"about_ca_system_score_gemma":0.0007543377,"threshold_uncertainty_score":0.9345058},"labels":[],"label_agreement":null},{"id":"W2012638757","doi":"10.1145/2556663.2556672","title":"Review of computability and complexity theory by Steven Homer and Alan L. Selman","year":2013,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computability; Computer science; Computability theory; Mathematical economics; Cognitive science; Programming language; Theoretical computer science; Mathematics; Algorithm; Psychology","score_opus":0.029992200508590493,"score_gpt":0.2634734976997031,"score_spread":0.23348129719111257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012638757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79983675,0.06533333,0.1122102,0.015654324,0.0005723505,0.0035696458,0.00005936237,0.0005268389,0.0022372105],"genre_scores_gemma":[0.9107381,0.0041921125,0.07968601,0.0051096263,0.00008628385,0.000052941377,0.000018436034,0.000028107967,0.00008834559],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975521,0.0005588528,0.00054081803,0.00071550015,0.00028692413,0.00034580255],"domain_scores_gemma":[0.996726,0.0010378847,0.00021932296,0.0016008813,0.00017798203,0.00023794106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011119894,0.00027188618,0.0006270131,0.000052576455,0.00010408639,0.000113013964,0.001211673,0.000078285324,0.00013070404],"category_scores_gemma":[0.0004385732,0.00022424865,0.000085855165,0.00030645594,0.00043625914,0.0005065165,0.0016734916,0.00020994537,0.000023257746],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013321921,0.00059875066,0.04843171,0.004580799,0.00011138795,0.000004065279,0.0014642803,0.0000035813339,0.0012668963,0.013490876,0.035272565,0.89476174],"study_design_scores_gemma":[0.0019009671,0.0009451715,0.411479,0.0016623158,0.00009443658,0.00012738882,0.00018693433,0.01858913,0.0011242608,0.525615,0.036605246,0.0016701675],"about_ca_topic_score_codex":0.00060001854,"about_ca_topic_score_gemma":0.000022694576,"teacher_disagreement_score":0.8930916,"about_ca_system_score_codex":0.00004148497,"about_ca_system_score_gemma":0.000046816614,"threshold_uncertainty_score":0.91445947},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014138392930325094,"score_gpt":0.2619920865501573,"score_spread":0.24785369361983223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014032276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960694,0.00032012074,0.031651635,0.002259769,0.0033756217,0.00016957673,0.0000026373314,0.000085067906,0.0014415361],"genre_scores_gemma":[0.9302163,0.000028180006,0.06896233,0.00019154033,0.0005490412,0.000002041783,2.7184242e-7,0.000008604082,0.00004170964],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976787,0.00015435711,0.000738172,0.0004859606,0.0005185263,0.00042429994],"domain_scores_gemma":[0.99758786,0.0003916855,0.00046478317,0.00084214297,0.0003859884,0.0003275537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024399199,0.0002246582,0.00052598957,0.00022082141,0.00015876054,0.00027574535,0.0013075741,0.00017560222,0.00006067872],"category_scores_gemma":[0.0009626533,0.00016904579,0.00015904408,0.0005266386,0.00021546303,0.000773702,0.00048593924,0.00089888513,0.000016079915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019545069,0.002836567,0.049339104,0.00020614851,0.0002509453,0.0006660771,0.004286269,0.00046946396,0.044941813,0.1703675,0.0044047474,0.72203594],"study_design_scores_gemma":[0.0036409416,0.0016502136,0.24985373,0.00005994941,0.00007729657,0.006601914,0.0001478719,0.03646525,0.004080253,0.6897732,0.006672678,0.0009767051],"about_ca_topic_score_codex":0.000023198681,"about_ca_topic_score_gemma":0.000009516354,"teacher_disagreement_score":0.7210592,"about_ca_system_score_codex":0.00006145287,"about_ca_system_score_gemma":0.00028246536,"threshold_uncertainty_score":0.6893487},"labels":[],"label_agreement":null},{"id":"W2014139076","doi":"10.1016/j.jalgebra.2014.02.027","title":"Infinite dimensional proper subspaces of computable vector spaces","year":2014,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Mathematics; Subspace topology; Vector space; Discrete mathematics; Halting problem; Turing machine; Combinatorics; Pure mathematics; Algorithm; Mathematical analysis; Computation","score_opus":0.01173103183963514,"score_gpt":0.22348163840054974,"score_spread":0.2117506065609146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014139076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87521696,0.000414116,0.11913298,0.0032413977,0.001281424,0.0001284853,0.0000013885852,0.00004684037,0.00053641],"genre_scores_gemma":[0.9037104,0.000008502528,0.095709115,0.00018271474,0.0003119296,8.0286287e-7,3.3252826e-7,0.000010740794,0.0000654602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977005,0.00022934914,0.0007003724,0.00025707152,0.00080843933,0.0003042781],"domain_scores_gemma":[0.9974647,0.0005079397,0.00072408613,0.0004461532,0.00066698,0.00019014397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013144236,0.00019637278,0.0005302784,0.00025235376,0.00008095398,0.00014798224,0.0011043013,0.000076090946,0.00004847573],"category_scores_gemma":[0.00025476856,0.00014206822,0.00020306472,0.00048605952,0.0001356593,0.00068676454,0.00042361504,0.00030090866,0.000019035595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078958937,0.0075301942,0.15728961,0.0012117529,0.0018555617,0.00046371846,0.015832534,0.1365215,0.09107358,0.29031715,0.054282423,0.24283239],"study_design_scores_gemma":[0.004958951,0.006562426,0.21307774,0.00065734284,0.00013901794,0.0015938395,0.00014665474,0.6093569,0.034677606,0.08633689,0.040943727,0.0015489314],"about_ca_topic_score_codex":0.000019559371,"about_ca_topic_score_gemma":0.000004899877,"teacher_disagreement_score":0.4728354,"about_ca_system_score_codex":0.000048549267,"about_ca_system_score_gemma":0.00019943282,"threshold_uncertainty_score":0.5793374},"labels":[],"label_agreement":null},{"id":"W2014332513","doi":"10.1016/j.jlap.2013.11.001","title":"Characterizations of semicomputable sets of real numbers","year":2013,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Mathematics; Class (philosophy); Algebraic number; Projection (relational algebra); Real number; Algebra over a field; Rational number; Algebraic operation; Discrete mathematics; Pure mathematics; Computer science; Algorithm","score_opus":0.03507238830327356,"score_gpt":0.3478299379551908,"score_spread":0.3127575496519172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014332513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.400507,0.00016881377,0.5985196,0.00027865282,0.0001971691,0.00016716275,4.8217584e-7,0.000015025916,0.00014605337],"genre_scores_gemma":[0.29291692,0.00005411333,0.70694566,0.000031471856,0.000035399655,0.0000040973628,3.7620933e-7,0.000004211473,0.0000077816685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974814,0.0005664032,0.0011233122,0.00024328199,0.0003047121,0.00028091096],"domain_scores_gemma":[0.997672,0.0009066501,0.000754534,0.00022964505,0.00030758017,0.0001295724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023893125,0.00015286819,0.0006191094,0.00020530076,0.000042600634,0.00007708528,0.000601646,0.000107280735,0.000034292196],"category_scores_gemma":[0.000425271,0.00011039031,0.00014146758,0.0006732165,0.00017148071,0.00047392698,0.00036296409,0.00030672702,6.464662e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074968057,0.00033169662,0.012181497,0.00008179406,0.000029746308,0.000011942346,0.00069458026,0.00009866418,0.01015809,0.009393476,0.000009049287,0.967002],"study_design_scores_gemma":[0.0024908092,0.0026577287,0.27486894,0.0006013165,0.000074689044,0.0009503894,0.00060042494,0.12298619,0.0145126395,0.5779412,0.001446348,0.00086933596],"about_ca_topic_score_codex":0.000051652933,"about_ca_topic_score_gemma":0.0000012919744,"teacher_disagreement_score":0.96613264,"about_ca_system_score_codex":0.000028610575,"about_ca_system_score_gemma":0.000064061365,"threshold_uncertainty_score":0.45015863},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013050184563876042,"score_gpt":0.29113544322349133,"score_spread":0.2780852586596153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016571584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057251908,0.00005552894,0.9399822,0.00029220458,0.00025279087,0.0002617894,0.0000019842103,0.00016845603,0.0017331474],"genre_scores_gemma":[0.99688065,0.0000032536032,0.0018803577,0.0010058596,0.0001518157,0.00004984626,8.8774226e-7,0.0000059303807,0.000021371503],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887466,0.00023415648,0.00014108012,0.000417105,0.00015552859,0.00017744012],"domain_scores_gemma":[0.99835014,0.0010059653,0.00007374801,0.00037414805,0.00012037105,0.00007562016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008638927,0.00010590294,0.00014374823,0.000052539766,0.000097227545,0.0002643157,0.0007903898,0.000045863468,0.000004841229],"category_scores_gemma":[0.00013870187,0.00009346517,0.000027320062,0.00019042408,0.000095438125,0.00053124473,0.0002104893,0.00008838228,0.000033246957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027099444,0.00008854929,0.006473352,0.000020319534,0.000020912059,0.0000018609388,0.00030968536,0.00014576022,0.00039438333,0.1302428,0.000110306006,0.862165],"study_design_scores_gemma":[0.0014292101,0.00012246298,0.09711296,0.000016820459,0.000022634973,0.000019000043,0.000014699059,0.41254735,0.0032844448,0.48379838,0.0012603353,0.00037169326],"about_ca_topic_score_codex":0.000024910976,"about_ca_topic_score_gemma":0.000008557547,"teacher_disagreement_score":0.9396288,"about_ca_system_score_codex":0.000014393094,"about_ca_system_score_gemma":0.000017147086,"threshold_uncertainty_score":0.3811399},"labels":[],"label_agreement":null},{"id":"W2017816090","doi":"10.1137/s0097539700379346","title":"There are No Sparse NP<sub><i>w</i></sub>-Hard Sets","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Context (archaeology); Mathematics; Discrete mathematics; Computer science","score_opus":0.02927383581484306,"score_gpt":0.2552256822994979,"score_spread":0.22595184648465483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017816090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68166125,0.0003892379,0.30677012,0.0025659872,0.0040326975,0.00024922568,0.000002277798,0.0004730814,0.0038561167],"genre_scores_gemma":[0.9558435,0.000099719095,0.039928354,0.0020675396,0.0019458708,0.0000021220385,0.0000013148028,0.000049586935,0.000061988176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955182,0.0004942662,0.0008866053,0.00090019556,0.0010887297,0.0011120149],"domain_scores_gemma":[0.99658173,0.000597282,0.0007400036,0.0010162542,0.0005370317,0.00052771653],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018403707,0.0005139273,0.0005956636,0.000304417,0.0008094,0.0009230506,0.0021454196,0.0001667938,0.000047231206],"category_scores_gemma":[0.00027853245,0.00045833178,0.00037842555,0.00088918797,0.00008998647,0.0005673853,0.00086164393,0.001385693,0.0008553954],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010122846,0.0010958065,0.023955697,0.00008032061,0.0002087656,0.004824903,0.0013173291,0.049737368,0.005160997,0.002588424,0.015198111,0.89573103],"study_design_scores_gemma":[0.002991325,0.001374818,0.09049457,0.00086030434,0.000042157786,0.011204162,0.00017200987,0.8355356,0.0049974555,0.016318979,0.03387677,0.0021318635],"about_ca_topic_score_codex":0.0000055201904,"about_ca_topic_score_gemma":0.000006180159,"teacher_disagreement_score":0.8935992,"about_ca_system_score_codex":0.00031340524,"about_ca_system_score_gemma":0.00017347066,"threshold_uncertainty_score":0.9999226},"labels":[],"label_agreement":null},{"id":"W2018207776","doi":"10.1016/j.ipl.2007.01.007","title":"Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Natural Sciences and Engineering Research Council of Canada; Tsinghua University; National Science Foundation","keywords":"Quicksort; Binary tree; Computer science; Tree (set theory); Mathematics; Parallel computing; Algorithm; Combinatorics; Sorting; Sorting algorithm","score_opus":0.017267737570640127,"score_gpt":0.26163612009311654,"score_spread":0.24436838252247642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018207776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5044126,0.00002277958,0.49511874,0.00015850014,0.00006168403,0.00008780233,0.0000016057808,0.00007149995,0.00006479863],"genre_scores_gemma":[0.9262652,9.598442e-7,0.07289834,0.00079798885,0.000020200987,0.0000024808226,0.0000102780095,0.0000035986202,9.5032453e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820215,0.00006169483,0.0008283383,0.00026298623,0.0003870403,0.0002578248],"domain_scores_gemma":[0.99864143,0.000119772216,0.0004956586,0.0004226306,0.00022640673,0.000094085604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012236569,0.00016783681,0.00028482545,0.00085138064,0.00022616745,0.0002372645,0.00031934,0.00007482355,0.0000047688045],"category_scores_gemma":[0.00006885119,0.00015833414,0.000089002024,0.0018931091,0.00012718457,0.0041715386,0.00024359132,0.0001407973,0.0000015917644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084603,0.00022591154,0.07689373,0.00063455635,0.00025769058,0.00012757919,0.017300075,0.08924661,0.010327927,0.00029868374,0.000044265587,0.8045584],"study_design_scores_gemma":[0.00026240473,0.00002753602,0.11481283,0.000025369998,0.0000634872,0.000113717084,0.00009701268,0.8829665,0.0012698569,0.00012918023,0.00005253021,0.0001795343],"about_ca_topic_score_codex":0.000121253375,"about_ca_topic_score_gemma":0.000020608399,"teacher_disagreement_score":0.8043788,"about_ca_system_score_codex":0.00013186723,"about_ca_system_score_gemma":0.00006447944,"threshold_uncertainty_score":0.64566785},"labels":[],"label_agreement":null},{"id":"W2018522462","doi":"10.1007/s00037-007-0225-x","title":"Special Issue “Conference on Computational Complexity 2006” Guest Editors’ Foreword","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computational complexity theory; Theoretical computer science; Algorithm","score_opus":0.09065063507808688,"score_gpt":0.3221336832850516,"score_spread":0.23148304820696472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018522462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008394492,0.000023837109,0.92994195,0.0053115226,0.018930828,0.0008988455,0.00019418352,0.00089819025,0.03540616],"genre_scores_gemma":[0.42445242,0.000001633065,0.49775124,0.0023831704,0.074377745,0.000029083123,0.0006414053,0.00006539074,0.0002979145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99261206,0.00040029004,0.0014337925,0.0018363529,0.0024275451,0.001289948],"domain_scores_gemma":[0.9943802,0.0017485521,0.00055282895,0.0011510492,0.0014879233,0.0006794719],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019061093,0.00082872034,0.0008641662,0.00058006635,0.0010616347,0.00064394216,0.0028119094,0.000273531,0.00093083363],"category_scores_gemma":[0.00025887217,0.00088682486,0.0003839353,0.0014338256,0.0012181367,0.0008780079,0.001251999,0.00093632657,0.0013569404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015618998,0.0013249825,0.0016969048,0.00005879144,0.000091033864,0.000103146405,0.0007346129,0.064792186,0.000007849385,0.7397461,0.16857624,0.022711946],"study_design_scores_gemma":[0.0009696121,0.0003402562,0.10794029,0.000036546433,0.000010451585,0.00007655494,0.000030396068,0.3355552,0.000029494973,0.51182073,0.04243831,0.0007521911],"about_ca_topic_score_codex":0.0001428938,"about_ca_topic_score_gemma":0.00020958115,"teacher_disagreement_score":0.4321907,"about_ca_system_score_codex":0.0006342036,"about_ca_system_score_gemma":0.0005198509,"threshold_uncertainty_score":0.9999825},"labels":[],"label_agreement":null},{"id":"W2020046292","doi":"10.2178/jsl/1164060461","title":"Every 1-generic computes a properly 1-generic","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Algorithm","score_opus":0.022602612792350076,"score_gpt":0.22841434701812988,"score_spread":0.2058117342257798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020046292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3830142,0.004096388,0.6032061,0.0031002152,0.0025883734,0.00034135114,0.0000025311542,0.00025150093,0.0033993223],"genre_scores_gemma":[0.85320646,0.00005013325,0.14435504,0.0007024489,0.0014226533,0.000005467675,0.0000013103041,0.000020310894,0.00023620744],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967556,0.00023281868,0.0010834185,0.0004684504,0.00086342794,0.0005962617],"domain_scores_gemma":[0.99759775,0.00018754619,0.0007277893,0.00068777066,0.0005779242,0.00022121784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092966907,0.0003492485,0.00069276954,0.00038146545,0.00016356516,0.00031881,0.0021399232,0.00013490024,0.000031329586],"category_scores_gemma":[0.00007705146,0.0002534385,0.000365223,0.0011838904,0.00013992624,0.00072046893,0.00048130142,0.00041617392,0.000068868045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001611055,0.0074875425,0.03484639,0.00045441976,0.00065615517,0.004234448,0.0030742588,0.093034744,0.06566379,0.12723783,0.07200933,0.59114],"study_design_scores_gemma":[0.005507377,0.0051124287,0.31553718,0.00028341933,0.00020768816,0.014879465,0.00016971432,0.24071307,0.010787375,0.3577575,0.045868363,0.003176392],"about_ca_topic_score_codex":0.00006201701,"about_ca_topic_score_gemma":0.0000057635407,"teacher_disagreement_score":0.5879636,"about_ca_system_score_codex":0.00021991313,"about_ca_system_score_gemma":0.00034822003,"threshold_uncertainty_score":0.9999918},"labels":[],"label_agreement":null},{"id":"W2021405727","doi":"10.1145/505372.505375","title":"Abstract computability and algebraic specification","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computable analysis; Computability; Computable function; Mathematics; Computable number; Bounded function; Algebra over a field; Algebraic number; Dimension of an algebraic variety; Isomorphism (crystallography); Discrete mathematics; Pure mathematics","score_opus":0.0547705234772416,"score_gpt":0.25926482882248475,"score_spread":0.20449430534524315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021405727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023531422,0.00017031038,0.96681184,0.0070197787,0.0004518865,0.00039442163,0.000017805824,0.0005237699,0.0010787471],"genre_scores_gemma":[0.779994,0.000024814084,0.21925934,0.0005703616,0.000057877016,0.000027305265,0.000009232246,0.000012403653,0.000044652574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997403,0.00013971365,0.00053386507,0.00097594276,0.0005810101,0.00036644857],"domain_scores_gemma":[0.99708635,0.0013526205,0.00014118954,0.0009902193,0.00022531349,0.000204317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038508736,0.00031419043,0.00029155193,0.00025495383,0.00046211656,0.0002558921,0.0010225406,0.00012649881,0.0004691256],"category_scores_gemma":[0.00007861642,0.0003107899,0.00014358004,0.0006776537,0.00021011001,0.0005662671,0.000057431123,0.00039164035,0.00038390997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017384325,0.0016672987,0.0003657395,0.00005490308,0.000069280104,0.000022302187,0.00070696976,0.2512004,0.000083983636,0.050412092,0.00037107835,0.69502854],"study_design_scores_gemma":[0.0006027973,0.00021774757,0.1016891,0.000013648941,0.0000115915345,0.000094723866,0.000022310365,0.55634874,0.00007185142,0.33983168,0.0006739598,0.0004218477],"about_ca_topic_score_codex":0.00001766787,"about_ca_topic_score_gemma":0.000006822239,"teacher_disagreement_score":0.7564626,"about_ca_system_score_codex":0.0001495564,"about_ca_system_score_gemma":0.000037671714,"threshold_uncertainty_score":0.99993443},"labels":[],"label_agreement":null},{"id":"W2023707737","doi":"10.1090/s0002-9939-05-08086-x","title":"A minimal pair of 𝐾-degrees","year":2005,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Computer science","score_opus":0.014031969935496914,"score_gpt":0.2441160346080103,"score_spread":0.23008406467251338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023707737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9404666,0.000047652844,0.047961015,0.0072441045,0.000042980293,0.00034934873,0.0000032491648,0.00017525465,0.0037097908],"genre_scores_gemma":[0.56355715,0.000003293653,0.43613857,0.00017682013,0.000049418526,0.00000938756,3.4914382e-8,0.000007617415,0.000057712747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982327,0.000012459081,0.0005029018,0.0003365545,0.0005960899,0.00031925266],"domain_scores_gemma":[0.9984429,0.00027767016,0.00058300723,0.00033509298,0.000271078,0.00009027369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006446993,0.00018005399,0.0004990158,0.00002284923,0.000075958145,0.000043928863,0.0018773426,0.000040702154,0.000017182541],"category_scores_gemma":[0.00029005922,0.00011860003,0.0004989319,0.00078854006,0.0009023846,0.00024990068,0.0010506683,0.00017614936,0.000010413457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006385155,0.004805218,0.036004517,0.0023947265,0.00062507595,6.233814e-7,0.04094802,0.0002872953,0.06909135,0.6061237,0.027276002,0.21237965],"study_design_scores_gemma":[0.0007587465,0.0007975123,0.034872476,0.00025127485,0.00010441539,0.000060816437,0.0027968187,0.6976484,0.049922846,0.21027802,0.0017003282,0.0008083393],"about_ca_topic_score_codex":0.000009904019,"about_ca_topic_score_gemma":2.2970973e-7,"teacher_disagreement_score":0.6973611,"about_ca_system_score_codex":0.00006300721,"about_ca_system_score_gemma":0.000042358224,"threshold_uncertainty_score":0.4836369},"labels":[],"label_agreement":null},{"id":"W2024261644","doi":"10.1007/s001530100082","title":"Index sets and parametric reductions","year":2001,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Mathematics; Index (typography); Set (abstract data type); Degree (music); Computable function; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.037541640230142496,"score_gpt":0.29213862169588384,"score_spread":0.25459698146574133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024261644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02163924,0.00006144587,0.97112566,0.0017620575,0.0001297599,0.0005223136,0.0000075476883,0.00020825843,0.0045436923],"genre_scores_gemma":[0.47056082,0.0000143686575,0.528931,0.000188269,0.00005767228,0.00009261847,0.0000035613298,0.000009634363,0.00014201469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985501,0.00007012051,0.00029554905,0.00049174286,0.00020855504,0.00038389134],"domain_scores_gemma":[0.9976958,0.0014746464,0.000067344816,0.0005294527,0.0000568474,0.00017590843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036442114,0.00016871931,0.00026259976,0.00018447121,0.00018056796,0.00012141959,0.00054171914,0.00005419677,0.00003311985],"category_scores_gemma":[0.0006481902,0.00013352835,0.000104168685,0.0005172929,0.0001943482,0.0001789568,0.0004044409,0.00014720162,0.000063410946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007775616,0.00032677737,0.00031257333,0.00005922819,0.000020563437,0.000011384417,0.00033842702,0.00012618204,0.00004525216,0.953451,0.0004367597,0.04486411],"study_design_scores_gemma":[0.0001881933,0.00016147237,0.0027917663,0.000008545282,0.0000073901992,0.00018646613,0.00001812817,0.24126594,0.000015202356,0.7544213,0.0008045181,0.00013107347],"about_ca_topic_score_codex":0.0000041863696,"about_ca_topic_score_gemma":0.0000020220145,"teacher_disagreement_score":0.4489216,"about_ca_system_score_codex":0.000025855607,"about_ca_system_score_gemma":0.000027867662,"threshold_uncertainty_score":0.5445128},"labels":[],"label_agreement":null},{"id":"W2027737305","doi":"10.1016/j.apal.2010.07.004","title":"A measure-theoretic proof of Turing incomparability","year":2010,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lemma (botany); Turing; Mathematics; Existential quantification; Description number; Discrete mathematics; Turing machine; Combinatorics; NSPACE; Set (abstract data type); Measure (data warehouse); Computer science; Universal Turing machine; Algorithm","score_opus":0.04048729888383151,"score_gpt":0.2811536320011267,"score_spread":0.24066633311729518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027737305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92299736,0.0002369881,0.06849564,0.0011603201,0.00015904615,0.00048724774,0.000004052302,0.000086610606,0.006372763],"genre_scores_gemma":[0.9815841,0.0000056329213,0.018164912,0.0001606325,0.000054372114,0.000018499593,8.677149e-7,0.0000057607294,0.000005265195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998404,0.00006052278,0.0004298495,0.00048702728,0.00033052583,0.00028806453],"domain_scores_gemma":[0.99851876,0.00019652309,0.0002112698,0.00075997395,0.00020161753,0.00011185895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012135145,0.00018698591,0.00043514892,0.00008672527,0.00006237739,0.000036856956,0.0007798163,0.00012079255,0.000019585665],"category_scores_gemma":[0.000095169155,0.00014824406,0.00009805701,0.00031971693,0.0003645839,0.00011445192,0.00044224883,0.00028130726,0.0000026901719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005292859,0.0007867811,0.0030865187,0.00036709852,0.00004686465,0.0000036452157,0.0012619703,0.0002936005,0.035793427,0.8193616,0.00015104968,0.13879447],"study_design_scores_gemma":[0.0003136972,0.00022265094,0.018063486,0.0000189641,0.000010597195,0.00001320346,0.00003839179,0.0038169136,0.157575,0.81949025,0.00017061712,0.0002662355],"about_ca_topic_score_codex":0.000009991586,"about_ca_topic_score_gemma":0.000017798717,"teacher_disagreement_score":0.13852823,"about_ca_system_score_codex":0.000003670849,"about_ca_system_score_gemma":0.000050825616,"threshold_uncertainty_score":0.60452175},"labels":[],"label_agreement":null},{"id":"W2032558432","doi":"10.4204/eptcs.151.16","title":"Similarity density of the Thue-Morse word with overlap-free infinite binary words","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Mathematics; Generalization; Complement (music); Similarity (geometry); Binary number; Combinatorics; Measure (data warehouse); Natural number; Discrete mathematics; Arithmetic; Artificial intelligence; Computer science; Mathematical analysis; Data mining","score_opus":0.004434492969161611,"score_gpt":0.20834336137438172,"score_spread":0.2039088684052201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032558432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57473046,0.000026471484,0.42093864,0.001735548,0.0003148203,0.0003958313,6.588418e-7,0.00017105103,0.0016864813],"genre_scores_gemma":[0.94190794,0.0000056808976,0.057380553,0.0005562094,0.0001136049,0.000015212107,1.7339264e-7,0.000015137876,0.000005488109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479496,0.00013354671,0.00058168435,0.0014182188,0.0015864724,0.0014851188],"domain_scores_gemma":[0.9969198,0.000490683,0.00027944206,0.0015584539,0.0005290795,0.00022250455],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.004618558,0.00041151966,0.0005381208,0.00032995734,0.00043224613,0.00038267672,0.008274128,0.0001311055,0.0000068398053],"category_scores_gemma":[0.0007748944,0.00027675566,0.00013251633,0.0047306707,0.0045454456,0.0010070186,0.005160922,0.0010496207,0.0000050230237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038672177,0.00019187103,0.009485324,0.000025978668,0.0000066037537,0.0000028228692,0.00060254533,0.00023566715,0.00042857,0.97366154,0.000022412212,0.01529801],"study_design_scores_gemma":[0.00059143576,0.00072535046,0.041071787,0.000086685985,0.000008254582,0.00007389759,0.000013228393,0.49733767,0.0056591146,0.45400393,0.00006819181,0.0003604612],"about_ca_topic_score_codex":0.00001573145,"about_ca_topic_score_gemma":0.000019811625,"teacher_disagreement_score":0.5196576,"about_ca_system_score_codex":0.00040312554,"about_ca_system_score_gemma":0.00060592324,"threshold_uncertainty_score":0.99996847},"labels":[],"label_agreement":null},{"id":"W2034179316","doi":"10.4006/1.3458576","title":"Ontologically three-dimensional reality violates experiment","year":2010,"lang":"en","type":"article","venue":"Physics Essays","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Theoretical physics; Epistemology; Philosophy","score_opus":0.030666727408710567,"score_gpt":0.2762015067499163,"score_spread":0.2455347793412057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034179316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16980876,0.00007378791,0.80674165,0.0017523159,0.0018339499,0.00039376586,0.000007935609,0.00072115305,0.018666672],"genre_scores_gemma":[0.9062331,8.212665e-7,0.09312357,0.00023531896,0.00033672125,0.000035411922,0.000005855497,0.0000103703405,0.000018840821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792355,0.000080197955,0.00030361596,0.0007579535,0.0004948205,0.0004398716],"domain_scores_gemma":[0.99801534,0.00027761378,0.000119320204,0.0012121783,0.00019777066,0.00017776065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046068404,0.00025622247,0.00029655907,0.00002694917,0.0002050955,0.00015826791,0.0012599434,0.00010808958,0.00005869161],"category_scores_gemma":[0.000058388578,0.00021356418,0.00014654719,0.0002722771,0.00015861656,0.0003629327,0.00093667425,0.0004302965,0.00011629895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009363856,0.00080583565,0.0022973162,0.000009916616,0.000026104824,0.000020110409,0.00029116124,0.00062137714,0.025080916,0.8926028,0.0005396847,0.07769544],"study_design_scores_gemma":[0.00025695856,0.000096843425,0.0057316967,0.000005444961,0.000004841084,0.000012622105,0.0000027276649,0.20087925,0.008074722,0.78430915,0.00029917134,0.00032657982],"about_ca_topic_score_codex":0.00017598413,"about_ca_topic_score_gemma":0.00009997003,"teacher_disagreement_score":0.7364243,"about_ca_system_score_codex":0.000047607817,"about_ca_system_score_gemma":0.00009371702,"threshold_uncertainty_score":0.8708895},"labels":[],"label_agreement":null},{"id":"W2034594082","doi":"10.1016/j.top.2007.02.002","title":"Betti numbers of finitely presented groups and very rapidly growing functions","year":2007,"lang":"en","type":"article","venue":"Topology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Betti number; Mathematics; Turing machine; Halting problem; Combinatorics; Turing; Function (biology); Discrete mathematics; Group (periodic table); Algorithm; Computer science","score_opus":0.015986201598177072,"score_gpt":0.2591690357356309,"score_spread":0.2431828341374538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034594082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44323996,0.00029081316,0.5508864,0.001407197,0.0010346652,0.00013282214,0.0000023373457,0.0001460281,0.0028597591],"genre_scores_gemma":[0.976382,0.000009338804,0.022990149,0.000297779,0.00012720858,0.000003951582,0.0000027549197,0.0000072356333,0.00017957452],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986835,0.00010339482,0.0003141477,0.00039010722,0.0001527969,0.0003560232],"domain_scores_gemma":[0.9985526,0.0007161525,0.000088207446,0.00046397082,0.000080617705,0.00009842553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058672833,0.0001253012,0.0002333025,0.00017162763,0.000103994775,0.000016287737,0.00042192885,0.000108870845,0.00004571925],"category_scores_gemma":[0.00013198753,0.00012530752,0.00006537571,0.00040261005,0.00030469705,0.00029411452,0.00043793456,0.00016605674,0.000017460914],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020814495,0.0011635105,0.20440194,0.0002079002,0.00035587535,0.00029919515,0.0067589604,0.0008662187,0.0076770145,0.3212288,0.0070562027,0.44977626],"study_design_scores_gemma":[0.0039200336,0.0020983976,0.7560486,0.000048842125,0.0001003909,0.00087175716,0.0016707601,0.060458556,0.009718143,0.1335872,0.030069817,0.0014075061],"about_ca_topic_score_codex":0.00027159663,"about_ca_topic_score_gemma":0.00008941715,"teacher_disagreement_score":0.55164665,"about_ca_system_score_codex":0.00003140718,"about_ca_system_score_gemma":0.00003681084,"threshold_uncertainty_score":0.51098925},"labels":[],"label_agreement":null},{"id":"W2035590515","doi":"10.4064/fm224-2-5","title":"Errata to ``Lindelöf indestructibility, topological games and selection principles'' (Fund. Math. 210 (2010), 1–46)","year":2014,"lang":"en","type":"article","venue":"Fundamenta Mathematicae","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Selection (genetic algorithm); Mathematics; Discrete mathematics; Mathematical economics; Computer science; Artificial intelligence","score_opus":0.0640664222806581,"score_gpt":0.28930094086726743,"score_spread":0.2252345185866093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035590515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.439674,0.00002342149,0.5543687,0.0022502437,0.00046529478,0.00068896194,0.0000049012715,0.00041953463,0.0021050037],"genre_scores_gemma":[0.69138557,0.000004104021,0.30710846,0.0006028635,0.00018239502,0.000071538016,0.000002797282,0.000023377579,0.00061887805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642974,0.0002754191,0.00073347427,0.0012575147,0.0006092227,0.00069461635],"domain_scores_gemma":[0.99745184,0.0005570889,0.00020473862,0.0012242238,0.0001391567,0.0004229378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016663953,0.00041675763,0.0005857705,0.00020001015,0.00030935276,0.0006663528,0.0012867037,0.00019615988,0.00019630973],"category_scores_gemma":[0.0005570023,0.00035250597,0.00011011108,0.0005738289,0.00022899346,0.0005239641,0.0018957914,0.00036272898,0.00027868865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032385495,0.00091056817,0.010968935,0.0003346778,0.00007564843,0.000009492504,0.0030562538,0.00015328918,0.0015733023,0.93537736,0.0010626231,0.046445467],"study_design_scores_gemma":[0.0011785814,0.0015886645,0.081542194,0.00012043188,0.00005264771,0.0005800221,0.00033274715,0.43053934,0.0015748839,0.47006342,0.01112456,0.0013025217],"about_ca_topic_score_codex":0.00004526023,"about_ca_topic_score_gemma":0.00005528061,"teacher_disagreement_score":0.46531394,"about_ca_system_score_codex":0.00020681259,"about_ca_system_score_gemma":0.00007445725,"threshold_uncertainty_score":0.9998927},"labels":[],"label_agreement":null},{"id":"W2036366580","doi":"10.1093/philmat/nkt042","title":"Finitistic Arithmetic and Classical Logic†","year":2014,"lang":"en","type":"article","venue":"Philosophia Mathematica","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Predicative expression; Arithmetic; Intuition; Mathematics; Classical logic; Algebra over a field; Quantifier (linguistics); Relation (database); Computer science; Calculus (dental); Epistemology; Discrete mathematics; Pure mathematics; Philosophy; Artificial intelligence; Linguistics","score_opus":0.03340117916933689,"score_gpt":0.2537953424692618,"score_spread":0.2203941632999249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036366580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018398967,0.00008465587,0.9485869,0.02028016,0.00025815074,0.00028579234,0.0000026816087,0.00043723307,0.02822455],"genre_scores_gemma":[0.71369886,0.0000051939555,0.28529322,0.0006568019,0.00024093896,0.000030273482,0.0000011444453,0.000015454068,0.00005812619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792945,0.00016234152,0.0004174976,0.00065958855,0.000428518,0.00040257713],"domain_scores_gemma":[0.99728674,0.0012353993,0.00011255663,0.0010399674,0.00008573437,0.00023960177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064052286,0.00026842643,0.00045026795,0.00011669991,0.000154903,0.00024342662,0.0008991195,0.0000960636,0.000048827755],"category_scores_gemma":[0.0008993835,0.00022530068,0.00008505148,0.0002753524,0.00024860416,0.0002247796,0.0007048369,0.00022516031,0.00034280788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013776195,0.00015708836,0.000021457177,0.000095532145,0.000010179556,0.00001246996,0.00014453704,0.0000061460605,0.00002889363,0.98885477,0.00013478572,0.01053276],"study_design_scores_gemma":[0.00021390007,0.00013774184,0.00056154846,0.000027918995,0.000012955656,0.00012227413,0.0000022979352,0.2391358,0.000026974874,0.7589676,0.00057824736,0.00021274698],"about_ca_topic_score_codex":0.00000171173,"about_ca_topic_score_gemma":7.087629e-7,"teacher_disagreement_score":0.7118589,"about_ca_system_score_codex":0.000034089753,"about_ca_system_score_gemma":0.000028180324,"threshold_uncertainty_score":0.9187495},"labels":[],"label_agreement":null},{"id":"W2036695067","doi":"10.1016/j.dam.2006.05.001","title":"The proof theoretic strength of the Steinitz exchange theorem","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Mathematical proof; Discrete mathematics; Compactness theorem; Analytic proof; Combinatorics; Algebra over a field; Fundamental theorem; Pure mathematics; Fixed-point theorem","score_opus":0.008982201345938648,"score_gpt":0.21642624557041187,"score_spread":0.2074440442244732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036695067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03600626,0.00042534235,0.84764946,0.0014539849,0.00050696306,0.0023195,0.000023827208,0.00030630283,0.11130839],"genre_scores_gemma":[0.9466861,0.000010626812,0.05271063,0.000054865857,0.00011302683,0.00011800563,0.0000024670028,0.000029725286,0.00027457793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977359,0.000094799434,0.0006147709,0.0003931205,0.00070579955,0.0004555755],"domain_scores_gemma":[0.9963442,0.0009792288,0.00041411238,0.0021064132,0.00010318829,0.000052858486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010289551,0.00028722154,0.00032521575,0.000041990916,0.00034729912,0.00018915068,0.0026963528,0.0000842914,0.00001713643],"category_scores_gemma":[0.00008535737,0.00014493955,0.0001814872,0.0005506915,0.0005829498,0.00008754473,0.0011189699,0.00022700161,0.00001677529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031205188,0.00012808737,0.000013449667,0.000110687964,0.00001568186,6.5791727e-7,0.0013984782,0.000100970574,0.0002932854,0.98696,0.00019153829,0.01078403],"study_design_scores_gemma":[0.00028139222,0.00004237754,0.00024513924,0.00003405057,0.000026614814,0.00000764637,0.0004091265,0.049141724,0.011444102,0.9373123,0.0008256417,0.00022985847],"about_ca_topic_score_codex":0.000009257558,"about_ca_topic_score_gemma":0.00001998695,"teacher_disagreement_score":0.9106798,"about_ca_system_score_codex":0.000046638543,"about_ca_system_score_gemma":0.00006750301,"threshold_uncertainty_score":0.59104633},"labels":[],"label_agreement":null},{"id":"W2040650323","doi":"10.1109/icl.2012.6402055","title":"Design and construction of an 8-bit computer, along with the design of its graphical simulator for pedagogical purposes","year":2012,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Computer science; Computer architecture simulator; Simple (philosophy); Software; Central processing unit; Architecture; Computer hardware; Hardware architecture; Computer architecture; Simulation; Operating system","score_opus":0.0886843224862618,"score_gpt":0.30157714456974444,"score_spread":0.21289282208348265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040650323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17476872,0.000121223675,0.82381445,0.00019294437,0.000121411955,0.0009026698,0.0000014744118,0.000070574504,0.0000065116424],"genre_scores_gemma":[0.5158634,0.0000031602115,0.48402637,0.00003476431,0.000050015446,0.000014154902,4.1401842e-7,0.0000049453365,0.000002740691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983118,0.00037419665,0.00032499922,0.00036083368,0.00031499288,0.00031314755],"domain_scores_gemma":[0.9973262,0.0016559626,0.0001629719,0.00043743427,0.00026604105,0.00015138247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012044325,0.00018345134,0.0003194875,0.00008415506,0.00011541847,0.000059679587,0.0005403911,0.00008733046,0.000005878707],"category_scores_gemma":[0.000041942465,0.000107290456,0.000056376557,0.00030806597,0.00036031994,0.0005481494,0.00019811356,0.000100396755,5.1196065e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008332635,0.002569794,0.015515329,0.00038770412,0.00032797453,0.00000824495,0.0069121323,0.15778328,0.0046578064,0.45850134,0.00020753843,0.3522956],"study_design_scores_gemma":[0.0007026718,0.001586838,0.0052066306,0.000012159296,0.000027523825,0.00010255586,0.00007845258,0.981622,0.0066371206,0.0037805827,0.000054324602,0.00018913629],"about_ca_topic_score_codex":0.000010724462,"about_ca_topic_score_gemma":0.0000022241206,"teacher_disagreement_score":0.8238387,"about_ca_system_score_codex":0.000012688713,"about_ca_system_score_gemma":0.000067695575,"threshold_uncertainty_score":0.4375178},"labels":[],"label_agreement":null},{"id":"W2041027694","doi":"10.1109/icip.2010.5653405","title":"Generic image similarity based on Kolmogorov complexity","year":2010,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kolmogorov complexity; Similarity (geometry); Image (mathematics); Computer science; Set (abstract data type); Range (aeronautics); Theoretical computer science; Image retrieval; Computational complexity theory; Key (lock); Image processing; Image compression; Algorithm; Artificial intelligence; Data mining","score_opus":0.03567744049534726,"score_gpt":0.2650435367835368,"score_spread":0.22936609628818955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041027694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042328425,0.0000035155467,0.9198514,0.004506709,0.0013455541,0.00028856666,0.000007555408,0.0008395638,0.03082866],"genre_scores_gemma":[0.4817414,2.5749154e-7,0.515842,0.0021503263,0.00013839031,0.000009865229,0.0000039474003,0.000009651455,0.00010412324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977062,0.00013239021,0.00029698602,0.0008462631,0.0005275411,0.0004906432],"domain_scores_gemma":[0.9972694,0.0003100817,0.000078533565,0.0019097356,0.00018350106,0.00024877288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068363757,0.00026717965,0.00026978448,0.00012198055,0.00022011872,0.00030695065,0.0018213744,0.00011758181,0.0006351953],"category_scores_gemma":[0.00015840467,0.00022853892,0.00015180014,0.00053861435,0.0002521929,0.0003438228,0.00061681133,0.0005312482,0.00029818364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006870304,0.0057919757,0.017759433,0.00014128428,0.00005768045,0.0002851593,0.00055775215,0.0034235334,0.047499537,0.55425984,0.030223148,0.33993196],"study_design_scores_gemma":[0.0003577011,0.0001379779,0.045145527,0.000001911723,0.000002909511,0.000010230219,0.0000024924364,0.9224816,0.0041158665,0.0235294,0.003889026,0.00032534194],"about_ca_topic_score_codex":0.0001664009,"about_ca_topic_score_gemma":0.00022881964,"teacher_disagreement_score":0.9190581,"about_ca_system_score_codex":0.000056182365,"about_ca_system_score_gemma":0.00013163834,"threshold_uncertainty_score":0.9319547},"labels":[],"label_agreement":null},{"id":"W2041420358","doi":"10.1017/s0140525x01220123","title":"Some robotic imitations of biological movements can be counterproductive","year":2001,"lang":"en","type":"article","venue":"Behavioral and Brain Sciences","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Clinical Research Institute; Université de Montréal; Centre for Interdisciplinary Research in Rehabilitation","funders":"","keywords":"Robotics; Artificial intelligence; Robot; Computer science; Cognitive science; Human–computer interaction; Control (management); Psychology","score_opus":0.11034784644249275,"score_gpt":0.3397465574631748,"score_spread":0.22939871102068204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041420358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9854121,0.00014552962,0.008403046,0.0053720507,0.00033255154,0.00018737366,0.0000073922697,0.000055610777,0.000084349245],"genre_scores_gemma":[0.9840734,0.000018718913,0.015318606,0.00043344643,0.000050247487,0.000011298994,0.0000017157,0.0000018300792,0.000090723115],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985186,0.00008030186,0.00023036893,0.0005483954,0.00034668713,0.00027566263],"domain_scores_gemma":[0.9993627,0.00013606284,0.000090587986,0.00022970136,0.00009414616,0.000086768225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005465218,0.00012141048,0.00017984193,0.000107034444,0.0002430299,0.00012045878,0.0007085169,0.000039032682,0.000011421466],"category_scores_gemma":[0.00006484676,0.00008704604,0.000044417462,0.00063975644,0.0008349611,0.0004935709,0.0003424995,0.00006629719,0.0000016384525],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024162036,0.002927357,0.61730725,0.000026820742,0.00002750477,0.000077726894,0.011310645,0.0017565149,0.035096686,0.1103607,0.00080453185,0.22028011],"study_design_scores_gemma":[0.00070594595,0.0029958782,0.8528041,0.000038250862,0.000017242344,0.00010493213,0.001776438,0.030459035,0.0027667263,0.10693961,0.00063343695,0.00075837557],"about_ca_topic_score_codex":0.00031927731,"about_ca_topic_score_gemma":0.00006491519,"teacher_disagreement_score":0.2354969,"about_ca_system_score_codex":0.000026060723,"about_ca_system_score_gemma":0.000078780686,"threshold_uncertainty_score":0.35496348},"labels":[],"label_agreement":null},{"id":"W2044442024","doi":"10.1109/jproc.2013.2274907","title":"The Reasonable Ineffectiveness of Mathematics [Point of View]","year":2013,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Massachusetts Institute of Technology; University of Cape Town; Carnegie Mellon University; Arizona State University; University of Waterloo","keywords":"Miracle; Presupposition; Point (geometry); Mathematics; Mathematical economics; Epistemology; Philosophy; Theology","score_opus":0.009238316646757484,"score_gpt":0.21085031601339366,"score_spread":0.20161199936663618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044442024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822896,0.00018812309,0.012679079,0.0009800656,0.00042701748,0.000906253,0.000001482409,0.000049872615,0.0024785055],"genre_scores_gemma":[0.97470397,0.00001554943,0.025069151,0.000017853314,0.000032111133,0.000042488387,2.5792609e-8,0.000008996112,0.00010985679],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986851,0.000017540255,0.00044203462,0.00021233993,0.00043030165,0.00021265884],"domain_scores_gemma":[0.99773014,0.00041498526,0.0005296765,0.0004176236,0.0008705238,0.000037036098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010623537,0.00013227022,0.0003103462,0.000040008472,0.00008983892,0.000054843313,0.0020980972,0.000046861216,0.000004711559],"category_scores_gemma":[0.00040823006,0.00007179513,0.00013628797,0.0005164446,0.000230273,0.00032231913,0.00064656744,0.000115022565,0.000005038118],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037931834,0.002307931,0.027245076,0.0059107835,0.0003562817,4.6525932e-7,0.014121871,0.0004770119,0.4538777,0.35977852,0.007092401,0.12879403],"study_design_scores_gemma":[0.00033523075,0.0002484894,0.017658668,0.00035208592,0.000027481869,0.000020272211,0.0004036743,0.08192706,0.610124,0.28846487,0.00022814961,0.0002100408],"about_ca_topic_score_codex":0.00010774009,"about_ca_topic_score_gemma":0.0000016927743,"teacher_disagreement_score":0.1562463,"about_ca_system_score_codex":0.000036441925,"about_ca_system_score_gemma":0.000042167307,"threshold_uncertainty_score":0.38988215},"labels":[],"label_agreement":null},{"id":"W2045810234","doi":"10.2178/jsl/1333566632","title":"A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Packing dimension; Hausdorff dimension; Effective dimension; Dimension (graph theory); Mathematics; Dimension function; Minkowski–Bouligand dimension; Combinatorics; Mathematical analysis; Fractal dimension; Fractal","score_opus":0.020407418884620655,"score_gpt":0.268995094939475,"score_spread":0.24858767605485432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045810234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91542053,0.00032017435,0.08130151,0.0002255107,0.001304444,0.0008952263,0.000011824335,0.0000647998,0.0004559477],"genre_scores_gemma":[0.973372,0.00015954797,0.025871383,0.0001000225,0.00045495614,0.000008884313,0.0000020642244,0.00002695375,0.0000041922594],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99490225,0.0012625643,0.0011965643,0.00053605257,0.0013459214,0.0007566399],"domain_scores_gemma":[0.99280953,0.0028442044,0.0022588652,0.00065578206,0.0010882244,0.00034336824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029420466,0.00048067246,0.0015021691,0.00060605013,0.00018626873,0.00007556295,0.00091291737,0.000251098,0.000005996757],"category_scores_gemma":[0.00030384053,0.00033277765,0.0005240653,0.00088660425,0.0002622393,0.0011331614,0.0009717738,0.00070139655,0.0000047204153],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016822553,0.006376719,0.18413225,0.0008291508,0.0019283746,0.00039126162,0.04628268,0.0027982194,0.47538918,0.035271965,0.000090767,0.24482717],"study_design_scores_gemma":[0.0021581713,0.003281806,0.818216,0.00091992225,0.00021962078,0.00035233708,0.0003293293,0.008370935,0.15704866,0.008600134,0.0000043779073,0.0004986998],"about_ca_topic_score_codex":0.00037187408,"about_ca_topic_score_gemma":0.000009170228,"teacher_disagreement_score":0.63408375,"about_ca_system_score_codex":0.00048300275,"about_ca_system_score_gemma":0.00013631074,"threshold_uncertainty_score":0.99991244},"labels":[],"label_agreement":null},{"id":"W2047873655","doi":"10.1016/s0097-8485(00)80012-1","title":"Intelligent systems in molecular biology (ISMB98), 27 June–1 July, 1998, Montreal","year":2000,"lang":"en","type":"article","venue":"Computers & Chemistry","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Biology; Library science; Environmental ethics; Computational biology; Computer science; Philosophy","score_opus":0.009038390683431938,"score_gpt":0.2348205717300241,"score_spread":0.22578218104659217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047873655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13010426,0.0030773801,0.8552217,0.00074528495,0.002643498,0.000554471,0.000013459673,0.00071754167,0.006922407],"genre_scores_gemma":[0.94465035,0.00015666074,0.052513186,0.00059717085,0.000588771,0.00007614436,0.00005994095,0.0000603911,0.0012973734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673134,0.00014905003,0.0007288529,0.0012620931,0.00032491997,0.0008037533],"domain_scores_gemma":[0.9978398,0.00020573587,0.00013608045,0.0014653747,0.00006707673,0.00028591198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037329964,0.0004564914,0.0005792347,0.00010012342,0.00007815359,0.000237268,0.002364375,0.00028278108,0.00004217304],"category_scores_gemma":[0.000022980852,0.000471226,0.00020025464,0.0006506782,0.00017361144,0.00017847306,0.000711042,0.00046827254,0.0002507704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084838575,0.0021912155,0.0021426294,0.00081995083,0.00030723744,0.0020161087,0.003204746,0.1281964,0.0384561,0.0031099846,0.016575627,0.8028952],"study_design_scores_gemma":[0.0012088536,0.00011879571,0.0005525254,0.00018709971,0.00001753237,0.0003785565,0.000033929802,0.90171945,0.018525241,0.0069312504,0.06908497,0.001241813],"about_ca_topic_score_codex":0.000377113,"about_ca_topic_score_gemma":0.000009491882,"teacher_disagreement_score":0.8145461,"about_ca_system_score_codex":0.00028160185,"about_ca_system_score_gemma":0.00012219908,"threshold_uncertainty_score":0.9997739},"labels":[],"label_agreement":null},{"id":"W2049763834","doi":"10.1080/17445760.2011.613834","title":"Computing with uncertainty and its implications to universality","year":2012,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computation; Turing machine; Universality (dynamical systems); Executable; Theoretical computer science; Focus (optics); Model of computation; Theory of computation; Computational problem; Mathematical optimization; Algorithm; Mathematics; Programming language","score_opus":0.028833857023950027,"score_gpt":0.2898491929551212,"score_spread":0.26101533593117116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049763834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27038062,0.00067147927,0.72545165,0.0023192177,0.0009108335,0.00013846412,0.000037741433,0.000021509151,0.000068496855],"genre_scores_gemma":[0.99525666,0.00003574366,0.004322059,0.000054417982,0.00029751647,0.0000022657575,0.0000111362315,0.000004099558,0.000016088006],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99866617,0.00009690055,0.00044193811,0.00017987724,0.000396641,0.00021848272],"domain_scores_gemma":[0.9983647,0.0001051553,0.00030519083,0.00014344686,0.00075697614,0.00032456362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057777885,0.00013021038,0.00021051294,0.00011798826,0.00009216029,0.00014055082,0.0005479354,0.000036987087,0.000005133145],"category_scores_gemma":[0.00006507059,0.00010163053,0.000047100457,0.00020151574,0.00002668765,0.00045131572,0.00026718373,0.000109650086,0.000003287414],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003040547,0.0009860807,0.38946977,0.00010406673,0.0012245002,0.00007915077,0.0049540815,0.2700584,0.0010563686,0.31024262,0.006411341,0.015109556],"study_design_scores_gemma":[0.0029389684,0.00057272165,0.5626971,0.00024078143,0.00008448694,0.002111274,0.0013367329,0.39146692,0.000057913552,0.0014338697,0.036246117,0.0008131429],"about_ca_topic_score_codex":0.00006700328,"about_ca_topic_score_gemma":0.000007666057,"teacher_disagreement_score":0.72487605,"about_ca_system_score_codex":0.00012489928,"about_ca_system_score_gemma":0.00005979139,"threshold_uncertainty_score":0.4144373},"labels":[],"label_agreement":null},{"id":"W2050243630","doi":"10.1016/j.tcs.2006.10.018","title":"Computability of analog networks","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computability; Metric space; Computable function; Mathematics; Discrete mathematics; Continuous function (set theory); Metric (unit); Fixed point; Computation; Topology (electrical circuits); Function (biology); Contraction mapping; Computer science; Algorithm; Mathematical analysis; Combinatorics","score_opus":0.005925309535869799,"score_gpt":0.22441266324461875,"score_spread":0.21848735370874894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050243630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06427979,0.00006394525,0.9301288,0.00049087487,0.0009341107,0.0002704705,0.0000020221062,0.0003582218,0.0034717717],"genre_scores_gemma":[0.73393697,0.0000010469452,0.26569664,0.00014192224,0.00020825001,0.0000038316266,0.0000011643115,0.0000073960614,0.0000027822425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552274,0.00027607038,0.00078185264,0.0013250952,0.0011448615,0.0009493551],"domain_scores_gemma":[0.99628896,0.0007562816,0.00019594686,0.0019048278,0.00056411995,0.0002898927],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0030834668,0.0003236306,0.0005238915,0.0002720459,0.00035761116,0.00033671685,0.004619647,0.00010462164,0.00004424404],"category_scores_gemma":[0.00009651799,0.00027526688,0.00018808927,0.0028774801,0.006217143,0.00066520984,0.0027197883,0.00032215935,0.000023934204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055966025,0.0002462092,0.001403839,0.00001059397,0.0000033704287,0.000010331504,0.00005216759,0.024637718,0.00013750946,0.93871015,0.000047610443,0.03473489],"study_design_scores_gemma":[0.00017744148,0.000183205,0.02235155,0.000010964412,0.0000037761595,0.00002770095,0.0000011230026,0.6898549,0.0009530891,0.2861783,0.000033247794,0.00022470186],"about_ca_topic_score_codex":0.000053672116,"about_ca_topic_score_gemma":0.000003954581,"teacher_disagreement_score":0.6696572,"about_ca_system_score_codex":0.00012862662,"about_ca_system_score_gemma":0.0001916235,"threshold_uncertainty_score":0.99996996},"labels":[],"label_agreement":null},{"id":"W2050619681","doi":"10.1167/10.7.759","title":"Complexity and similarity in visual memory","year":2010,"lang":"en","type":"article","venue":"Journal of Vision","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Similarity (geometry); Mnemonic; Visual short-term memory; Computer science; Contrast (vision); Iconic memory; Short-term memory; Visual memory; Working memory; Object (grammar); Artificial intelligence; Cognitive psychology; Pattern recognition (psychology); Cognition; Psychology; Neuroscience; Image (mathematics)","score_opus":0.023039251498950118,"score_gpt":0.31896500589547816,"score_spread":0.295925754396528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050619681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9494162,0.0000706907,0.047575627,0.0017636172,0.00087942637,0.00006460518,3.8355438e-7,0.000016718532,0.00021268617],"genre_scores_gemma":[0.91701776,0.000008618612,0.08268918,0.00012992225,0.00014539092,1.9343446e-7,1.03388686e-7,0.000003245533,0.000005572506],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987795,0.000109284,0.00040195833,0.00018507219,0.00036116966,0.00016306734],"domain_scores_gemma":[0.9990756,0.00019891263,0.00020296566,0.00023130908,0.00015837408,0.00013286952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014925601,0.00009631982,0.00023389627,0.0001749517,0.000060830545,0.00011874276,0.0005150065,0.00007478057,0.00002080705],"category_scores_gemma":[0.0001897304,0.000076935365,0.00006257627,0.00022910805,0.00010148582,0.0005673438,0.0003974228,0.00060474593,0.0000032259284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118845346,0.0020530503,0.055618227,0.000072420364,0.000025074312,0.00046425106,0.0023125522,0.00030262998,0.05421664,0.008972508,0.001317172,0.8745266],"study_design_scores_gemma":[0.00075333286,0.0004936127,0.81234443,0.000027126192,0.0000031280922,0.00033103136,0.000021470933,0.15110771,0.0006734997,0.033507112,0.0006076253,0.0001299035],"about_ca_topic_score_codex":0.000022374375,"about_ca_topic_score_gemma":0.00008177283,"teacher_disagreement_score":0.87439674,"about_ca_system_score_codex":0.000033368175,"about_ca_system_score_gemma":0.000068383415,"threshold_uncertainty_score":0.3137333},"labels":[],"label_agreement":null},{"id":"W2052568580","doi":"10.5539/jedp.v4n1p84","title":"Cognitive Processes Associated with the Perception of Randomness","year":2014,"lang":"en","type":"article","venue":"Journal of Educational and Developmental Psychology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Randomness; Heuristic; Set (abstract data type); Matching (statistics); Symmetry (geometry); Mathematics; Order (exchange); Sample (material); Computer science; Statistics; Mathematical optimization","score_opus":0.021695854811733375,"score_gpt":0.3038488345999408,"score_spread":0.2821529797882074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052568580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89987737,0.00012686272,0.089385904,0.009055237,0.00026321184,0.00008893744,9.033374e-7,0.0000038133478,0.0011977614],"genre_scores_gemma":[0.98722976,0.000015610163,0.011995201,0.00062156096,0.00007746626,0.0000031322961,0.0000021028836,0.000002486058,0.000052687457],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992618,0.000103644525,0.0002263402,0.00012695616,0.00019205338,0.0000892033],"domain_scores_gemma":[0.99815375,0.00094192417,0.00028134396,0.000049567567,0.00053003186,0.000043367123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005636314,0.000071461036,0.00015780774,0.000060297647,0.00008918216,0.000024552402,0.00024856976,0.00003158216,0.0000652464],"category_scores_gemma":[0.00036232136,0.000042777876,0.000022699942,0.00020710961,0.00016976702,0.00016485044,0.000040657065,0.00009994063,0.0000040909526],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015155281,0.005386292,0.4950594,0.00019965309,0.0009632583,0.000008820356,0.056086496,0.00009049061,0.0025172718,0.006688618,0.018180158,0.413304],"study_design_scores_gemma":[0.0015859929,0.0003044552,0.9845941,0.000060800885,0.000013270227,0.00044688061,0.00069723645,0.00010322956,0.000037882008,0.011810598,0.00025695664,0.000088613844],"about_ca_topic_score_codex":0.0000025522147,"about_ca_topic_score_gemma":0.00001117642,"teacher_disagreement_score":0.48953468,"about_ca_system_score_codex":0.000022663124,"about_ca_system_score_gemma":0.00027715685,"threshold_uncertainty_score":0.17444313},"labels":[],"label_agreement":null},{"id":"W2055767407","doi":"10.1016/j.apal.2011.01.011","title":"The complexity of central series in nilpotent computable groups","year":2011,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computable number; Nilpotent; Central series; Turing; Nilpotent group; Series (stratigraphy); Turing machine; Degree (music); Discrete mathematics; Computable function; Algebra over a field; Pure mathematics; Computable analysis; Computer science; Algorithm; Computation","score_opus":0.11724217098113329,"score_gpt":0.2690373915610357,"score_spread":0.15179522057990238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055767407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84904355,0.0021538283,0.12538366,0.005093072,0.0004810697,0.0011286056,0.000019544992,0.00016697729,0.016529664],"genre_scores_gemma":[0.983899,0.0001188725,0.015720194,0.00020935756,0.000025558187,0.00000899172,0.0000014716516,0.0000042725173,0.0000123124155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859434,0.00007025049,0.00040401472,0.00032068603,0.0002132882,0.0003974302],"domain_scores_gemma":[0.9991322,0.000093378876,0.00017436118,0.00043759705,0.00008486667,0.000077576165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005487843,0.00015556919,0.00033387326,0.000053572174,0.00010119073,0.000036092726,0.00074492407,0.00006444275,0.000009895264],"category_scores_gemma":[0.000014963894,0.00010714402,0.000067624416,0.00030993947,0.00059218134,0.00014171388,0.00050677464,0.00013682242,0.0000021431617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048242196,0.00028438843,0.0019423681,0.000048572703,0.000019942283,0.0000045831102,0.0016063963,0.00022376746,0.00026843292,0.97304183,0.00022773587,0.022283716],"study_design_scores_gemma":[0.00026961532,0.00026267613,0.12831923,0.000013283219,0.0000040293826,0.000010616906,0.00027258936,0.004269319,0.0069654095,0.8590758,0.00035994253,0.0001774985],"about_ca_topic_score_codex":0.00008456047,"about_ca_topic_score_gemma":0.00008734502,"teacher_disagreement_score":0.13485539,"about_ca_system_score_codex":0.0000067072547,"about_ca_system_score_gemma":0.00002996215,"threshold_uncertainty_score":0.43692064},"labels":[],"label_agreement":null},{"id":"W205929165","doi":"","title":"Is it enough to get the behaviour right","year":2009,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Argument (complex analysis); Computer science; Turing; Mental model; Cognitive science; Epistemology; Work (physics); Artificial intelligence; Human–computer interaction; Cognitive psychology; Psychology; Philosophy; Engineering; Programming language","score_opus":0.025313335987507717,"score_gpt":0.2833736122017608,"score_spread":0.2580602762142531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205929165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024368094,0.00005717121,0.700094,0.2358148,0.00064262905,0.00049472204,0.0000029044322,0.00041082944,0.038114853],"genre_scores_gemma":[0.8435742,0.000002276842,0.123000495,0.02830694,0.0001673157,0.0000101414635,5.8458863e-7,0.000005344146,0.0049326806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983955,0.000065999804,0.00023023043,0.0005332342,0.00039407532,0.00038092825],"domain_scores_gemma":[0.9983464,0.00010180032,0.0000376266,0.0012670845,0.00010059529,0.00014650928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038748272,0.00016355263,0.00015109939,0.000057139685,0.00018509154,0.00027834947,0.002000797,0.000052081363,0.0004209632],"category_scores_gemma":[0.00002813097,0.00010043692,0.000097063996,0.0005146759,0.000030564668,0.00024516307,0.0004490447,0.00014564821,0.0006484667],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007481715,0.00087793247,0.002514344,0.000004974492,0.000023882998,0.00009151638,0.01183971,0.00047234932,0.00028148614,0.23157777,0.32421476,0.4280938],"study_design_scores_gemma":[0.000795694,0.0015114819,0.2642961,0.000021521984,0.000029657924,0.00019718311,0.00020582747,0.12161174,0.012503086,0.111737266,0.48559108,0.0014993661],"about_ca_topic_score_codex":0.0001132599,"about_ca_topic_score_gemma":0.000037381713,"teacher_disagreement_score":0.8192061,"about_ca_system_score_codex":0.000055395587,"about_ca_system_score_gemma":0.000049121227,"threshold_uncertainty_score":0.8334944},"labels":[],"label_agreement":null},{"id":"W2059295095","doi":"10.1016/j.entcs.2012.08.009","title":"Timed Sets, Functional Complexity, and Computability","year":2012,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computability; P; Modulo; Categorical variable; Distributive property; Theoretical computer science; Mathematics; Discrete mathematics; Basis (linear algebra); Computer science; Time complexity; Algebra over a field; Pure mathematics","score_opus":0.02085770852822977,"score_gpt":0.2670126453691139,"score_spread":0.24615493684088413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059295095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16900915,0.00033787847,0.8272594,0.0015918243,0.00080809195,0.0003372609,0.0000016357042,0.00025599802,0.00039871436],"genre_scores_gemma":[0.8381241,0.0000065149097,0.16115619,0.00048425538,0.00020019978,0.0000140733655,0.0000021057788,0.000011292501,0.0000012809088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945204,0.00041620637,0.0005609145,0.0013237302,0.0010559959,0.0021227533],"domain_scores_gemma":[0.9964877,0.0015120782,0.00010376213,0.001163016,0.00019506668,0.00053838734],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00525838,0.0003905919,0.000456598,0.00033415906,0.00048394085,0.00041417187,0.00218153,0.000116242874,0.00009459842],"category_scores_gemma":[0.00036048025,0.0003511318,0.00009564164,0.0019682355,0.0051674163,0.0013507077,0.0031068064,0.00073357555,0.00005987419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011175011,0.00029931497,0.0077610356,0.000011518772,0.0000056181907,0.000003006885,0.0003051904,0.0003145627,0.00009229258,0.91838825,0.000009516265,0.0727985],"study_design_scores_gemma":[0.00032382636,0.000184955,0.06291538,0.000009857806,0.000003288939,0.00011963722,0.0000021886965,0.51585263,0.00054093054,0.41966668,0.00006769801,0.000312962],"about_ca_topic_score_codex":0.000019444231,"about_ca_topic_score_gemma":0.000010525736,"teacher_disagreement_score":0.66911495,"about_ca_system_score_codex":0.00055801816,"about_ca_system_score_gemma":0.00037783312,"threshold_uncertainty_score":0.9998941},"labels":[],"label_agreement":null},{"id":"W2059414344","doi":"10.1007/s10044-014-0432-4","title":"An investigation of implicit features in compression-based learning for comparing webpages","year":2014,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Feature (linguistics); Feature selection; Web page; Compression (physics); Task (project management); Phishing; Pattern recognition (psychology); Artificial intelligence; Cover (algebra); Feature vector; Image compression; Space (punctuation); Data compression; Selection (genetic algorithm); Information retrieval; Data mining; Image (mathematics); The Internet; Image processing; World Wide Web","score_opus":0.01604752687691857,"score_gpt":0.27934949015732446,"score_spread":0.2633019632804059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059414344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2436714,0.000019756679,0.75588316,0.00018788234,0.000005349561,0.00017552893,0.0000015441626,0.000036002704,0.000019387408],"genre_scores_gemma":[0.9742092,0.000001935479,0.0254674,0.00009190795,0.000028155499,0.00014779493,0.00004633752,0.000004180041,0.000003079586],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902606,0.000101867336,0.0002596145,0.00037382072,0.00011227965,0.00012635913],"domain_scores_gemma":[0.99904096,0.00024837043,0.00015064515,0.00041385784,0.00007741524,0.000068778696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037621387,0.00009354721,0.00026687374,0.00026231556,0.00012311773,0.00007915077,0.00035677457,0.000037215083,0.0000026323453],"category_scores_gemma":[0.000011784659,0.000087118824,0.0000734987,0.0006510003,0.00004658522,0.000093771814,0.000070412796,0.00008486659,7.4699744e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001117913,0.000060753104,0.81003594,0.000031390624,0.000028842567,4.9145072e-8,0.00019624058,0.0635607,0.0027468547,0.0019676287,0.0000043397486,0.121366166],"study_design_scores_gemma":[0.000114660106,0.000019367984,0.40714282,0.000004921411,0.000029834662,1.809793e-7,0.000011272095,0.59005594,0.0011047114,0.0014104453,0.000046207504,0.000059631137],"about_ca_topic_score_codex":0.0003206887,"about_ca_topic_score_gemma":0.00038281616,"teacher_disagreement_score":0.73053783,"about_ca_system_score_codex":0.000013679478,"about_ca_system_score_gemma":0.000011611595,"threshold_uncertainty_score":0.35526025},"labels":[],"label_agreement":null},{"id":"W2059499379","doi":"10.1080/03081070290018056","title":"Statistical learning theory, model identification and system information content","year":2002,"lang":"en","type":"article","venue":"International Journal of General Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Toronto Metropolitan University","funders":"","keywords":"Computer science; Statistical learning theory; Mathematical theory; Simple (philosophy); Expression (computer science); Statistical theory; Probability theory; Identification (biology); Statistical model; Information theory; Artificial intelligence; Algorithmic learning theory; Learning theory; Management science; Industrial engineering; Machine learning; Mathematics; Active learning (machine learning); Engineering; Support vector machine","score_opus":0.03248984344631063,"score_gpt":0.2473958668784426,"score_spread":0.21490602343213194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059499379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03411189,0.0002649986,0.9621814,0.00042860312,0.0021795977,0.000112212634,0.000008015625,0.000044224507,0.0006690903],"genre_scores_gemma":[0.98692876,0.000028153556,0.012332894,0.000042648528,0.0003164485,0.0000050220056,0.000003648887,0.000004695422,0.0003377196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978806,0.00022505558,0.0008534448,0.00013674732,0.0007709577,0.00013324597],"domain_scores_gemma":[0.99807197,0.00011891869,0.00063058623,0.0001396176,0.00093432213,0.000104572726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011557295,0.00011042658,0.00019476481,0.00021311535,0.000074441756,0.00062896585,0.00065990875,0.000049559505,0.0000054841503],"category_scores_gemma":[0.00017307253,0.000092192735,0.000058759542,0.00008021941,0.00003625133,0.001279391,0.00013991051,0.00017611081,0.000024874049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003486863,0.00008770422,0.0014624122,0.00006874024,0.00018174743,0.00004614579,0.0020240382,0.20488238,0.0010791083,0.7049186,0.0011382427,0.08407597],"study_design_scores_gemma":[0.00038843165,0.000067653666,0.0014258008,0.00004848952,0.000008465258,0.00072464894,0.00018317995,0.9949559,0.000048482747,0.0011852025,0.00086915854,0.00009457622],"about_ca_topic_score_codex":0.000030188492,"about_ca_topic_score_gemma":5.766475e-7,"teacher_disagreement_score":0.9528169,"about_ca_system_score_codex":0.00024242485,"about_ca_system_score_gemma":0.000028612569,"threshold_uncertainty_score":0.60651326},"labels":[],"label_agreement":null},{"id":"W2061253069","doi":"10.1109/icassp.2014.6853787","title":"Adaptive windowing for optimal visualization of medical images based on normalized information distance","year":2014,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Visualization; Computer science; Entropy (arrow of time); Range (aeronautics); Computer vision; Parametric statistics; Artificial intelligence; Mutual information; High-dynamic-range imaging; Image processing; Similarity (geometry); Image (mathematics); High dynamic range; Dynamic range; Mathematics","score_opus":0.012396116203276962,"score_gpt":0.2723149394480491,"score_spread":0.2599188232447721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061253069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010006118,0.000003662298,0.9957195,0.0006744885,0.00022295893,0.0003575302,0.0000049009514,0.00015841637,0.0018579325],"genre_scores_gemma":[0.71356124,6.8383747e-7,0.28583133,0.0005038951,0.000044769135,0.000027617969,0.000015304193,0.0000045522224,0.000010583309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982261,0.00010967974,0.00042233433,0.00023000618,0.00080245675,0.0002094192],"domain_scores_gemma":[0.9984739,0.0006202091,0.00016694405,0.0003674452,0.00027816082,0.000093341725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012259082,0.00013175815,0.00021139876,0.00012717687,0.000081545135,0.00009360941,0.0006791935,0.00008280079,0.00003141227],"category_scores_gemma":[0.0006237946,0.00011151064,0.000086037,0.0003057829,0.00006340081,0.00096622726,0.00014604659,0.000066928544,0.0000074192635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022728764,0.00031396528,0.0007666884,0.00018353447,0.00002324631,9.661079e-7,0.0010840009,0.08920651,0.00009938165,0.6307004,0.000982528,0.27641144],"study_design_scores_gemma":[0.0010880262,0.0003772669,0.0012975202,0.00003246477,0.000003529701,8.845173e-7,0.000021165348,0.99183196,0.003039877,0.0012377502,0.00093722035,0.00013234765],"about_ca_topic_score_codex":0.000026172891,"about_ca_topic_score_gemma":0.0000045918296,"teacher_disagreement_score":0.90262544,"about_ca_system_score_codex":0.00005029936,"about_ca_system_score_gemma":0.00010028899,"threshold_uncertainty_score":0.4547272},"labels":[],"label_agreement":null},{"id":"W2061768116","doi":"10.1145/1232425.1232438","title":"Dimensions of complexity of intelligent agents","year":2006,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Intelligent agent; Value (mathematics); Data science; Artificial intelligence; Management science; Engineering; Machine learning","score_opus":0.06860189240028682,"score_gpt":0.28464986956422006,"score_spread":0.21604797716393326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061768116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13176624,0.00004573306,0.8610588,0.00029109826,0.00025407862,0.00016364161,0.0000040633786,0.00008970805,0.006326655],"genre_scores_gemma":[0.8099032,0.0000022874174,0.18987805,0.000039358387,0.000015432584,0.0000015220841,0.0000016905532,0.000002841279,0.00015559529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877256,0.00006147314,0.00041955206,0.00026899492,0.00030217553,0.00017525311],"domain_scores_gemma":[0.9988783,0.00011396964,0.000121645426,0.0006666527,0.00017050361,0.000048916307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022986805,0.00009978663,0.00022642576,0.000084489184,0.00003425422,0.000013224154,0.0006997165,0.00003313985,0.000097616015],"category_scores_gemma":[0.000024597852,0.00007349535,0.00010128879,0.00037746492,0.00020291265,0.000097182114,0.00063018885,0.00005650015,0.00001922472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006948451,0.001841784,0.01738557,0.00007003356,0.000035515935,0.000007952951,0.0004328898,0.0029314787,0.004353706,0.9367768,0.004235602,0.031921703],"study_design_scores_gemma":[0.00032026443,0.00023015801,0.13866031,0.000021419224,0.00000972761,0.000010086235,0.000030575113,0.45759928,0.07677812,0.32410967,0.001961437,0.00026892114],"about_ca_topic_score_codex":0.0008893213,"about_ca_topic_score_gemma":0.00008743802,"teacher_disagreement_score":0.678137,"about_ca_system_score_codex":0.000028961784,"about_ca_system_score_gemma":0.000035786918,"threshold_uncertainty_score":0.29970536},"labels":[],"label_agreement":null},{"id":"W2061943950","doi":"10.1007/s00165-010-0157-0","title":"A probability perspective","year":2010,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of California, Irvine; Georgia Institute of Technology","keywords":"Perspective (graphical); Bayesian probability; Computer science; Formalism (music); Equating; Probability theory; Theory of computation; Theoretical computer science; Frequentist probability; Imprecise probability; Mathematics; Artificial intelligence; Algorithm; Statistics","score_opus":0.016045458321300575,"score_gpt":0.25137281756923313,"score_spread":0.23532735924793255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061943950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4956946,0.000029534382,0.4728661,0.00047775696,0.00094937754,0.00034881177,0.0000016234378,0.0003878729,0.029244324],"genre_scores_gemma":[0.7726162,2.493437e-7,0.22710672,0.000047081616,0.00020979105,0.000002542048,5.648954e-7,0.000008510889,0.000008318261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976735,0.00007360897,0.0005077005,0.00063724816,0.00048691925,0.000620984],"domain_scores_gemma":[0.99766314,0.00031146858,0.00026878438,0.0010044118,0.00059443107,0.00015774672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011003494,0.00024122394,0.0003690844,0.00014422514,0.00022518542,0.00012518292,0.0015808297,0.00010343772,0.00002642479],"category_scores_gemma":[0.00041120034,0.00022291747,0.00018974554,0.0006415297,0.00020504658,0.00082972867,0.0014288233,0.000575479,0.000027891681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071483837,0.00027723052,0.0014973751,0.00004058925,0.000020833326,0.000009226801,0.0027753843,0.00065262005,0.0014202982,0.95674914,0.000021075872,0.03652905],"study_design_scores_gemma":[0.0005914558,0.00038990597,0.055427387,0.000026057718,0.000008535003,0.000118880605,0.00018548651,0.43137687,0.00884669,0.502273,0.00029604312,0.0004596507],"about_ca_topic_score_codex":0.00011539631,"about_ca_topic_score_gemma":0.00007016567,"teacher_disagreement_score":0.45447612,"about_ca_system_score_codex":0.000096529126,"about_ca_system_score_gemma":0.0002150795,"threshold_uncertainty_score":0.9090311},"labels":[],"label_agreement":null},{"id":"W2062744773","doi":"10.4204/eptcs.24.6","title":"Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Ergodic theory; Computable analysis; Computable number; Invariant measure; Invariant (physics); Dynamical systems theory; Pseudorandom number generator; Metric space; Computable function","score_opus":0.003661521673900922,"score_gpt":0.2232164987631307,"score_spread":0.21955497708922977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062744773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6899687,0.00015255157,0.30821073,0.00041604394,0.0004950731,0.00045354772,6.671087e-7,0.000056089415,0.00024659347],"genre_scores_gemma":[0.9794701,0.000026990987,0.02035882,0.000058327936,0.00006724099,0.0000053386643,2.5463282e-7,0.000011311119,0.0000016406009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956617,0.00011983329,0.000990626,0.0011023436,0.0009690871,0.0011564298],"domain_scores_gemma":[0.9975361,0.0009787587,0.00033176094,0.00055357174,0.00042426717,0.0001755116],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.006496115,0.0003225796,0.000692067,0.00046784952,0.00018682874,0.0002836848,0.003505723,0.00013519326,0.000007138921],"category_scores_gemma":[0.00045056,0.0002453997,0.00007814567,0.003029747,0.0042220624,0.0006329981,0.002001818,0.0010749936,0.0000020217637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003089362,0.00016695392,0.011226802,0.00008811188,0.00000605405,0.0000056359117,0.0009675708,0.0012957681,0.0036454268,0.97799724,0.00000311883,0.0045664166],"study_design_scores_gemma":[0.0007799601,0.0002828786,0.009174676,0.00010107934,0.000004035581,0.00017491348,0.000038764476,0.8799568,0.0022748495,0.106973514,0.000007185561,0.00023137248],"about_ca_topic_score_codex":0.000073993884,"about_ca_topic_score_gemma":0.000012646022,"teacher_disagreement_score":0.878661,"about_ca_system_score_codex":0.0001557636,"about_ca_system_score_gemma":0.00036236618,"threshold_uncertainty_score":0.9999998},"labels":[],"label_agreement":null},{"id":"W2063926602","doi":"10.1145/1806689.1806758","title":"Complexity theory for operators in analysis","year":2010,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.027560677600028997,"score_gpt":0.28825145981746825,"score_spread":0.26069078221743924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063926602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17603572,0.000006291019,0.82053167,0.00057516294,0.00032910096,0.00022730735,0.0000029887497,0.0001414976,0.0021502443],"genre_scores_gemma":[0.69938856,2.2837783e-7,0.30016476,0.00025917057,0.00003756236,0.000021337057,0.0000021920364,0.0000033462836,0.00012281864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987372,0.00009301345,0.00024785518,0.0004872565,0.00015653823,0.0002781065],"domain_scores_gemma":[0.99852896,0.00041418476,0.000036237,0.000827963,0.00010348448,0.000089156456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012792117,0.00012100002,0.00025085412,0.00025969843,0.00007888484,0.000143131,0.0011027097,0.00006341484,0.00018647696],"category_scores_gemma":[0.00014512634,0.00009849599,0.00015775033,0.0012898704,0.0001003968,0.00024194653,0.00035938778,0.00016829102,0.000018682393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045568336,0.00015772672,0.019695133,0.00000482078,0.000052693096,0.0000021122776,0.00031985875,0.00041058238,0.0003005418,0.95015603,0.00009217788,0.02880374],"study_design_scores_gemma":[0.00028690248,0.000042801286,0.087549426,6.5233337e-7,0.000019279956,0.0000019080885,0.000025044283,0.6698842,0.00075227174,0.24032873,0.0009072736,0.00020152012],"about_ca_topic_score_codex":0.00013929883,"about_ca_topic_score_gemma":0.0022728231,"teacher_disagreement_score":0.7098273,"about_ca_system_score_codex":0.000027181142,"about_ca_system_score_gemma":0.000052415755,"threshold_uncertainty_score":0.401655},"labels":[],"label_agreement":null},{"id":"W2066080230","doi":"10.1007/s00153-008-0112-4","title":"Linear orders with distinguished function symbol","year":2008,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Automorphism; Rational number; Symbol (formal); Categorical variable; Function (biology); Algebra over a field; Discrete mathematics; Fixed point; Automorphism group; Arithmetic; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.031924201733800436,"score_gpt":0.2463704260378365,"score_spread":0.21444622430403604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066080230","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013869672,0.0000117369855,0.9797469,0.0005281635,0.0001304297,0.0006702609,0.000007113674,0.00038017827,0.004655546],"genre_scores_gemma":[0.39172137,0.0000011453363,0.60763115,0.00025425304,0.000114021685,0.0001051427,0.000010683552,0.000016637165,0.00014560828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982765,0.00006980365,0.0003216767,0.00056414126,0.00032877113,0.0004391388],"domain_scores_gemma":[0.9978702,0.0011110448,0.000099521276,0.0006323565,0.00013079704,0.00015605713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027418745,0.00022924936,0.0003310069,0.00007740209,0.00028622852,0.00004666923,0.00065249624,0.000049470073,0.00003768741],"category_scores_gemma":[0.0005667122,0.00015763,0.00013202748,0.0002802882,0.0002687262,0.0001517729,0.00025710088,0.00016398363,0.00012062327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006911185,0.00064894167,0.0004705526,0.00019045969,0.00005987925,0.000047853377,0.0011901798,0.00058088655,0.00014054433,0.990345,0.00073368166,0.005522905],"study_design_scores_gemma":[0.0004945673,0.00074502337,0.0017870123,0.000023480785,0.000016695147,0.0001329085,0.000023382163,0.26520717,0.00006641171,0.7306232,0.0006370176,0.00024314522],"about_ca_topic_score_codex":0.0000052255186,"about_ca_topic_score_gemma":0.0000036687752,"teacher_disagreement_score":0.3778517,"about_ca_system_score_codex":0.000030384945,"about_ca_system_score_gemma":0.00006441248,"threshold_uncertainty_score":0.64279646},"labels":[],"label_agreement":null},{"id":"W2067933951","doi":"10.1016/j.hm.2009.02.001","title":"Sufficient conditions, fields and the calculus of variations","year":2009,"lang":"en","type":"article","venue":"Historia Mathematica","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Calculus (dental); Mathematics; Applied mathematics; Medicine","score_opus":0.010123866726675446,"score_gpt":0.23645459798762614,"score_spread":0.22633073126095068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067933951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021727215,0.00022664522,0.98475945,0.004606991,0.0005505885,0.00028285565,0.000002715383,0.00008647767,0.0073115733],"genre_scores_gemma":[0.94801843,0.000006637351,0.051445387,0.0002010609,0.00006381669,0.000016777447,0.0000010017898,0.000003190971,0.00024370546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904776,0.00008436733,0.0003034712,0.0001974547,0.00023481365,0.00013214257],"domain_scores_gemma":[0.9986052,0.0005105012,0.00012191976,0.0006186219,0.000095250354,0.00004848742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005313149,0.00009117291,0.00021181705,0.000054277134,0.00014544222,0.000043758657,0.0004505816,0.000044150383,0.000034621924],"category_scores_gemma":[0.00026210566,0.00006269483,0.00006489942,0.00022619449,0.00013169035,0.000096214404,0.00010341548,0.000085721316,0.0000130752815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021957421,0.00012579087,0.000001331315,0.0000132855075,0.000005817846,0.0000010299965,0.0034738588,0.000030884024,0.000028171879,0.99379927,0.001552641,0.0009657161],"study_design_scores_gemma":[0.0009240839,0.00014414258,0.00085902703,0.000025859194,0.00003786323,0.000040588184,0.000060984694,0.39666972,0.00010255344,0.5976069,0.0033475985,0.00018068493],"about_ca_topic_score_codex":0.000016172407,"about_ca_topic_score_gemma":0.0000023025034,"teacher_disagreement_score":0.9458457,"about_ca_system_score_codex":0.00006130056,"about_ca_system_score_gemma":0.000048107468,"threshold_uncertainty_score":0.25566208},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015557387784364229,"score_gpt":0.24657308649536594,"score_spread":0.23101569871100172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068458312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5077227,0.00009392373,0.48754838,0.000111439665,0.0020568983,0.0007673673,0.0000043306572,0.0002334153,0.0014615607],"genre_scores_gemma":[0.97305304,8.786462e-7,0.026664523,0.000032978096,0.00018163162,0.000009024814,0.0000022983616,0.000022775934,0.00003282134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951428,0.0013815516,0.0013098725,0.00084126013,0.0007736141,0.0005508782],"domain_scores_gemma":[0.9937348,0.002892331,0.00078468525,0.0019012933,0.0005056312,0.0001812671],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007861274,0.00038818835,0.0012591936,0.00020414754,0.00014927522,0.00012943654,0.0020877915,0.0001872035,0.0000141890305],"category_scores_gemma":[0.00047131852,0.00032739868,0.00028832952,0.0006582173,0.00049051165,0.00019702104,0.0008170923,0.00055951683,0.000021216048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012015839,0.0009295724,0.001150646,0.001135318,0.00008658071,0.0000063277653,0.0019099723,0.04166989,0.0022474031,0.9180165,0.00004865502,0.03267901],"study_design_scores_gemma":[0.0019450221,0.00048269724,0.0042387233,0.00048853323,0.00002424902,0.00009997301,0.00008763972,0.8944809,0.0016440963,0.09583446,0.00017559626,0.00049814145],"about_ca_topic_score_codex":0.00008449632,"about_ca_topic_score_gemma":0.00000593202,"teacher_disagreement_score":0.852811,"about_ca_system_score_codex":0.00008153674,"about_ca_system_score_gemma":0.00015933462,"threshold_uncertainty_score":0.9999178},"labels":[],"label_agreement":null},{"id":"W2069455994","doi":"10.5539/mas.v5n3p119","title":"Nature, Information &amp; [Digital] Technology [NIT]: Introduction &amp; Elements","year":2011,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Realm; Presentation (obstetrics); Arrow; Point (geometry); Data science; Mathematics; Law; Political science","score_opus":0.018042984840547983,"score_gpt":0.23473492737476245,"score_spread":0.21669194253421448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069455994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032830898,0.000019699417,0.95133406,0.0006082594,0.000825574,0.00042315523,0.000003866524,0.00069527194,0.013259229],"genre_scores_gemma":[0.79944605,0.0000017353085,0.20004623,0.0002576743,0.00009120183,0.00004799461,0.000009762848,0.0000067086085,0.000092647635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970241,0.0000140246275,0.0004889478,0.00087808515,0.0009170414,0.00067778677],"domain_scores_gemma":[0.9976246,0.000023630788,0.00023453844,0.0016118692,0.00034816217,0.00015719779],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009723216,0.0002458069,0.00020514571,0.00078681996,0.00042307234,0.00055448565,0.0029607476,0.00018657777,0.000034823643],"category_scores_gemma":[0.0001953007,0.00023369174,0.000044205568,0.0027962702,0.0006536421,0.0034404716,0.0014520086,0.0004721302,0.00081009464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028344604,0.0003853255,0.0016222285,0.00003131423,0.000018080487,0.0000018658569,0.004990981,0.00038568946,0.030606026,0.25029027,0.0012534425,0.71038646],"study_design_scores_gemma":[0.0007538413,0.00012341603,0.0052381586,0.000010075987,0.000010085405,0.00009775292,0.00010682762,0.1810053,0.01802693,0.71100676,0.082524836,0.0010960089],"about_ca_topic_score_codex":0.000008684366,"about_ca_topic_score_gemma":0.000011625159,"teacher_disagreement_score":0.76661515,"about_ca_system_score_codex":0.00029148505,"about_ca_system_score_gemma":0.00027153225,"threshold_uncertainty_score":0.9999679},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017827411931607442,"score_gpt":0.2971551657201182,"score_spread":0.27932775378851077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069661173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56250495,0.0035830166,0.41655725,0.014238801,0.00048390776,0.0015055181,0.0000015097878,0.00023584958,0.00088921183],"genre_scores_gemma":[0.9628005,0.00007330513,0.029699206,0.007220957,0.00009328521,0.00009736834,0.0000017238632,0.000008644781,0.0000049936284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987067,0.00012108407,0.00027350278,0.00034191643,0.00034065108,0.00021614577],"domain_scores_gemma":[0.999031,0.0001492429,0.00013422339,0.0005385544,0.00006095054,0.000086006774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014084711,0.00014860874,0.00032877346,0.000028730916,0.000031748026,0.000044070373,0.00069311215,0.000008242814,0.000045716046],"category_scores_gemma":[0.000045367247,0.00012582888,0.00018155733,0.0002860527,0.000085719745,0.0004943485,0.0002576302,0.00009616203,0.00021424078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002721618,0.0014209113,0.0005201039,0.0016250436,0.000040332947,0.00001104729,0.0016455643,0.00007216486,0.31999093,0.009078199,0.0121114645,0.65348154],"study_design_scores_gemma":[0.0017190233,0.0008445952,0.020829456,0.0028818618,0.00011579095,0.000069604626,0.000058178175,0.7820736,0.16311091,0.015299917,0.010482909,0.002514141],"about_ca_topic_score_codex":0.000044192988,"about_ca_topic_score_gemma":1.8923707e-7,"teacher_disagreement_score":0.78200144,"about_ca_system_score_codex":0.00005913197,"about_ca_system_score_gemma":0.0000132561545,"threshold_uncertainty_score":0.5131153},"labels":[],"label_agreement":null},{"id":"W2069749777","doi":"10.4171/owr/2004/41","title":"Probability Theory on Trees and Analysis of Algorithms","year":2005,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Computer science; Mathematics","score_opus":0.02649879911408616,"score_gpt":0.254800416682085,"score_spread":0.22830161756799883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069749777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72623956,0.0003715784,0.26574743,0.00070335495,0.00029014688,0.00048546962,0.000008553731,0.00028978195,0.005864094],"genre_scores_gemma":[0.9117964,0.000008190262,0.087730825,0.00010882413,0.000059086266,0.00002055925,0.000006721338,0.000009139563,0.0002602821],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9969752,0.00024049442,0.0008251284,0.0010332897,0.00058400515,0.00034189495],"domain_scores_gemma":[0.9970579,0.00039861194,0.00040983455,0.0017826483,0.00018299288,0.00016798748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021987928,0.0002528139,0.0005867631,0.00035751984,0.0001016205,0.0000907504,0.00043458724,0.00010554546,0.00006324323],"category_scores_gemma":[0.00031617226,0.00021203015,0.00026269685,0.001284753,0.0001967597,0.0003250032,0.0004041552,0.00017315694,0.0000043992873],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016441401,0.0009542653,0.07805547,0.000032303524,0.00058456144,0.00014447338,0.0012826978,0.008772206,0.00025864504,0.02404513,0.00011770793,0.8857361],"study_design_scores_gemma":[0.00023964918,0.00030022906,0.7191392,0.000017735549,0.0003336651,0.00017124007,0.000022939126,0.20650588,0.0024503258,0.06765367,0.0026553425,0.0005101188],"about_ca_topic_score_codex":0.000065418135,"about_ca_topic_score_gemma":0.00009234569,"teacher_disagreement_score":0.885226,"about_ca_system_score_codex":0.00010158737,"about_ca_system_score_gemma":0.00007674049,"threshold_uncertainty_score":0.86463386},"labels":[],"label_agreement":null},{"id":"W2070111789","doi":"10.4018/ijcini.2013070104","title":"Chaotic Walk in Simulated Annealing Search Space for Task Allocation in a Multiprocessing System","year":2013,"lang":"en","type":"article","venue":"International Journal of Cognitive Informatics and Natural Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Simulated annealing; Chaotic; Computer science; Multiprocessing; Mathematical optimization; Adaptive simulated annealing; Rate of convergence; Parallel computing; Algorithm; Mathematics; Artificial intelligence","score_opus":0.0212202124421118,"score_gpt":0.3062549307020358,"score_spread":0.285034718259924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070111789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42010754,0.00025565005,0.5785724,0.0003219495,0.0003930182,0.00029495888,0.0000023769533,0.000011166957,0.000040952535],"genre_scores_gemma":[0.97038084,0.000049245464,0.029362839,0.00012171792,0.000064010834,0.000006458164,0.0000039000684,0.0000049526648,0.000006052745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981306,0.000054619166,0.0009777053,0.00012943058,0.00047795154,0.00022967951],"domain_scores_gemma":[0.99601847,0.0010690885,0.0004104707,0.00007416009,0.0023521679,0.00007564719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008760661,0.00014378424,0.00023529821,0.00059141754,0.000043874898,0.00036422053,0.00063920656,0.0000662759,0.000002382538],"category_scores_gemma":[0.0006321543,0.0001205448,0.000060840302,0.0003712443,0.000061591054,0.0017694386,0.00017966317,0.00035995606,0.000005342777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020680297,0.00022959219,0.0049327356,0.0003708587,0.00012637927,0.00006114777,0.028735569,0.111216106,0.00051930494,0.007372802,0.00000906356,0.84621966],"study_design_scores_gemma":[0.0004912527,0.000107807406,0.003928486,0.0009235917,0.000003791117,0.0001223658,0.0033313807,0.98675466,0.0018360162,0.002358886,0.000006456762,0.00013528705],"about_ca_topic_score_codex":0.00009530737,"about_ca_topic_score_gemma":0.00001690472,"teacher_disagreement_score":0.8755386,"about_ca_system_score_codex":0.00021281253,"about_ca_system_score_gemma":0.000108187385,"threshold_uncertainty_score":0.49156743},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.043784538552229905,"score_gpt":0.28950073382088015,"score_spread":0.24571619526865024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070787093","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35844177,0.0037147715,0.016759837,0.6074166,0.0005043773,0.0016416895,0.000010344386,0.0005152863,0.010995297],"genre_scores_gemma":[0.48475024,0.000035231104,0.5149767,0.00012911553,0.00001583686,0.000026632084,0.0000012617401,0.0000043192526,0.000060649036],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987739,0.00023038342,0.00034427925,0.00021871102,0.00023056248,0.00020216225],"domain_scores_gemma":[0.9411366,0.0003807954,0.00012613526,0.058207955,0.000108509,0.00004001976],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006890961,0.000099058234,0.00015883471,0.00012011126,0.00014278168,0.000060120383,0.08519865,0.000052240608,0.000004646284],"category_scores_gemma":[0.0031491218,0.000069893926,0.00009969391,0.0012577823,0.00030319404,0.0002666711,0.07416269,0.00027190652,0.000024828694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033506587,0.0016258917,0.0631302,0.00002195316,0.000021084816,2.671187e-7,0.0019713484,0.0005668598,0.00022922234,0.021484371,0.004962143,0.9059833],"study_design_scores_gemma":[0.0009501119,0.00009157759,0.24965009,0.00011345074,0.000014819723,0.00002455785,0.00012646275,0.10488786,0.001723621,0.60101897,0.040990025,0.00040847997],"about_ca_topic_score_codex":0.00010009821,"about_ca_topic_score_gemma":0.00059798744,"teacher_disagreement_score":0.90557486,"about_ca_system_score_codex":0.000091269256,"about_ca_system_score_gemma":0.00006221529,"threshold_uncertainty_score":0.9333253},"labels":[],"label_agreement":null},{"id":"W2075941278","doi":"10.1145/353171.353194","title":"An Aristotelian understanding of object-oriented programming","year":2000,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Jerome's University; University of Waterloo","funders":"","keywords":"Computer science; Object (grammar); Logic programming; Predicate (mathematical logic); Object-oriented programming; Programming language; First-order logic; Programming paradigm; Epistemology; Relation (database); Artificial intelligence; Philosophy","score_opus":0.029441972229723074,"score_gpt":0.26524195454130967,"score_spread":0.23579998231158658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075941278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047695465,0.000026601781,0.94182086,0.00021866319,0.0002022052,0.00023042249,7.9610044e-7,0.00045551604,0.009349458],"genre_scores_gemma":[0.75561666,0.0000022728102,0.24412125,0.000054853,0.00003389469,0.000004393999,0.0000016240035,0.000006863204,0.0001581823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983935,0.00008792015,0.00032087843,0.000496454,0.0003474933,0.00035380403],"domain_scores_gemma":[0.99883753,0.00007677523,0.000064443935,0.00081106345,0.00006519573,0.00014500122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003979432,0.00014862111,0.00020305115,0.000121818724,0.00012640987,0.00011908734,0.0007802809,0.000062242034,0.00022025136],"category_scores_gemma":[0.000017599701,0.00013352711,0.0000761271,0.0008214804,0.000105371146,0.00048754885,0.000110475274,0.00011541078,0.000025072268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014263458,0.00062857394,0.0034227096,0.00003182193,0.000026083182,0.000020839312,0.002940869,0.0011684763,0.00042849488,0.15889455,0.00009908528,0.8323242],"study_design_scores_gemma":[0.0012361472,0.0015839636,0.008306275,0.000052927226,0.000020087975,0.000073656585,0.0012232573,0.90924954,0.0043649,0.05999396,0.012907206,0.0009880762],"about_ca_topic_score_codex":0.00021352696,"about_ca_topic_score_gemma":0.000057254343,"teacher_disagreement_score":0.90808105,"about_ca_system_score_codex":0.0001474958,"about_ca_system_score_gemma":0.00006778085,"threshold_uncertainty_score":0.54450774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Functor; Probabilistic logic; Mathematics; Equivalence (formal languages); Metric (unit); Probability measure; Discrete mathematics; Statistics","score_opus":0.01054023630763494,"score_gpt":0.22712271224983321,"score_spread":0.21658247594219826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076087052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3376896,0.00006611992,0.66072446,0.00021060827,0.00035080165,0.00031673137,0.0000012388828,0.00019163375,0.0004488116],"genre_scores_gemma":[0.8106363,5.625858e-7,0.18919341,0.000044563778,0.000106566804,0.000009358907,0.0000012868331,0.0000069568464,0.0000010117129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651384,0.00024190021,0.0006614576,0.0010954149,0.00073906244,0.00074832805],"domain_scores_gemma":[0.99853206,0.00044933576,0.0001251936,0.0005688479,0.0001587164,0.00016587497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026027027,0.00026340934,0.00036636123,0.0002372669,0.0004108061,0.0009865838,0.0013794964,0.000064812644,0.0000019369884],"category_scores_gemma":[0.00006250151,0.00022917784,0.000048605496,0.0013711859,0.0023976655,0.0007845356,0.0007128115,0.00026832963,0.0000042959314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033109616,0.000118440985,0.0014418626,0.000047044978,9.05474e-7,0.000024835737,0.0006342503,0.011194127,0.00009528306,0.9709526,0.0000015661558,0.015485823],"study_design_scores_gemma":[0.00025208172,0.00010791846,0.016307566,0.00007803031,0.0000031728873,0.000089123976,0.000023349809,0.87001437,0.00006014072,0.112799875,0.000002194411,0.0002622093],"about_ca_topic_score_codex":0.0001512835,"about_ca_topic_score_gemma":0.000013960195,"teacher_disagreement_score":0.8588202,"about_ca_system_score_codex":0.00016843066,"about_ca_system_score_gemma":0.00008143784,"threshold_uncertainty_score":0.951365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.01072900924257724,"score_gpt":0.24329269683461782,"score_spread":0.23256368759204057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077525424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010819455,0.00020367876,0.9578375,0.025094623,0.0005096057,0.0004676372,0.0000012335639,0.00020805496,0.0048581753],"genre_scores_gemma":[0.9503016,0.000013263039,0.04390583,0.005644714,0.00011166726,0.000008342065,1.3329002e-7,0.0000049567375,0.0000094941715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580306,0.0005775063,0.00037366062,0.0010998646,0.0013964972,0.00074943725],"domain_scores_gemma":[0.9923295,0.0051399274,0.0001107734,0.001929966,0.00023176968,0.00025805575],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0066304947,0.00029846933,0.00034910333,0.0003025532,0.0011782043,0.0012027499,0.0054641557,0.00005851793,0.000021605949],"category_scores_gemma":[0.001436179,0.00014428799,0.0001228545,0.006135699,0.006713334,0.00046149062,0.001556262,0.0005309744,0.000035129513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015893274,0.000074944415,0.000018201856,0.0000016795229,0.0000030486194,0.000006285916,0.00021442249,0.00022787177,0.00000447166,0.9225156,0.000075503965,0.076842085],"study_design_scores_gemma":[0.00026239612,0.00018835017,0.00422007,0.0000062261684,0.0000045030392,0.000020367212,0.000002937388,0.47344404,0.00013138409,0.5215073,0.0000757797,0.00013661118],"about_ca_topic_score_codex":0.000004882281,"about_ca_topic_score_gemma":6.232655e-7,"teacher_disagreement_score":0.93948215,"about_ca_system_score_codex":0.00009998308,"about_ca_system_score_gemma":0.00009408786,"threshold_uncertainty_score":0.99991673},"labels":[],"label_agreement":null},{"id":"W2078527353","doi":"10.4153/cmb-2007-038-5","title":"Expansions in Complex Bases","year":2007,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cellular automaton; Fractal; Dynamical systems theory; Automaton; Pure mathematics; Algebra over a field; Theoretical computer science; Algorithm; Mathematical analysis; Computer science","score_opus":0.02912242085588765,"score_gpt":0.25562883788111496,"score_spread":0.2265064170252273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078527353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07931267,0.00006557839,0.8233322,0.02453711,0.00023310867,0.000629355,0.000010107052,0.0002744817,0.07160538],"genre_scores_gemma":[0.86959565,0.0000010303272,0.12725982,0.0026203867,0.00007092342,0.000014596929,0.000004189795,0.000015742224,0.00041767614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979808,0.00007298331,0.00044754895,0.0004400666,0.0002706511,0.0007879757],"domain_scores_gemma":[0.99773455,0.0006216155,0.000040962008,0.00072446157,0.00006600133,0.000812385],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001060889,0.00018158634,0.00027508766,0.00032623127,0.00011109393,0.00010576235,0.0009315199,0.00009546,0.0051738694],"category_scores_gemma":[0.00056521274,0.00017496335,0.00007598058,0.0005303251,0.00011537559,0.00005688886,0.00017800095,0.00021994443,0.0051590027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057715642,0.0004501353,0.0017288467,0.00011478235,0.000015623717,0.0013988592,0.0020258247,0.00011289258,0.0001602793,0.8967418,0.050287567,0.046957586],"study_design_scores_gemma":[0.0012421388,0.00021837655,0.04735973,0.00019120592,0.000013015897,0.00038206627,0.000617547,0.120872125,0.00031391776,0.35733896,0.46986878,0.0015821402],"about_ca_topic_score_codex":0.003011143,"about_ca_topic_score_gemma":0.015487912,"teacher_disagreement_score":0.79028296,"about_ca_system_score_codex":0.000300502,"about_ca_system_score_gemma":0.00021136703,"threshold_uncertainty_score":0.9957355},"labels":[],"label_agreement":null},{"id":"W20811199","doi":"10.1007/978-3-642-16083-7_14","title":"System Complexity and Its Measures: How Complex Is Complex","year":2010,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Complex system; Computer science; Structural complexity; Theoretical computer science; Complexity science; Data science; Dynamical systems theory; Management science; Social complexity; Cognitive complexity; Key (lock); Artificial intelligence; Cognition; Engineering; Biology; Sociology; Social science","score_opus":0.316914039330049,"score_gpt":0.36659789009917787,"score_spread":0.049683850769128846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20811199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001228682,0.008052943,0.93548423,0.006285916,0.0032715737,0.0021275817,0.00034116494,0.00082296965,0.043490764],"genre_scores_gemma":[0.61261356,0.0011388314,0.37261176,0.0017034967,0.0009745161,0.00013663448,0.00014448294,0.0001717758,0.010504957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99409926,0.0001826575,0.0012870011,0.0020949568,0.0015988256,0.00073728786],"domain_scores_gemma":[0.99409604,0.0019885032,0.0006906933,0.0010500429,0.0019077631,0.00026693847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001123189,0.0010906097,0.0016327647,0.00058550655,0.0006275861,0.00037190388,0.0023921034,0.00045158868,0.000086322754],"category_scores_gemma":[0.0002565994,0.0010969423,0.00028931996,0.00034369,0.0017327312,0.00039553692,0.0030283525,0.0013763722,0.00017531327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001530523,0.000074554715,0.00003705511,0.00068844453,0.00030955192,0.00011925577,0.0024521467,0.0032916241,0.0000130947265,0.9720909,0.0011637906,0.019744296],"study_design_scores_gemma":[0.0002539597,0.00018591143,0.00066897424,0.0005796794,0.000042447136,0.00030786,0.00035861158,0.46556914,0.000041192776,0.5105296,0.02015088,0.0013117669],"about_ca_topic_score_codex":0.000029272978,"about_ca_topic_score_gemma":0.00024267283,"teacher_disagreement_score":0.6124907,"about_ca_system_score_codex":0.00063318596,"about_ca_system_score_gemma":0.00025098992,"threshold_uncertainty_score":0.9991481},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033442403603979744,"score_gpt":0.29050743332241197,"score_spread":0.2570650297184322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081148745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013611667,0.00034204414,0.972606,0.00030927776,0.00008641916,0.00035038483,0.000003145113,0.00015504945,0.012536005],"genre_scores_gemma":[0.4017339,0.000022108541,0.59799844,0.00016042996,0.000036145535,0.000022656228,7.1302367e-7,0.00000946776,0.00001609792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998109,0.000021892829,0.0006707437,0.00043089045,0.00042605144,0.00034142222],"domain_scores_gemma":[0.9981168,0.000489012,0.00029037002,0.0009780737,0.000057590132,0.000068175905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045152544,0.00021864504,0.00047798155,0.00013646756,0.00005650712,0.000037342128,0.001328682,0.00006338717,0.000030507397],"category_scores_gemma":[0.00005151021,0.00020612564,0.0000743676,0.00060572306,0.00022766163,0.00030421582,0.0006451461,0.00016951034,0.000053608783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005900067,0.0007257557,0.0006144533,0.0004124202,0.0000091502125,0.0000017296485,0.0042616595,0.0054880497,0.0003645084,0.7487874,0.000050516846,0.23927845],"study_design_scores_gemma":[0.00052755995,0.000039430914,0.00050817954,0.000048145146,0.000005037456,0.000012939429,0.00015444486,0.35328054,0.0036516576,0.63123035,0.010229939,0.0003117736],"about_ca_topic_score_codex":0.000006261664,"about_ca_topic_score_gemma":0.00003580577,"teacher_disagreement_score":0.38812226,"about_ca_system_score_codex":0.000084004285,"about_ca_system_score_gemma":0.000036576024,"threshold_uncertainty_score":0.84055597},"labels":[],"label_agreement":null},{"id":"W2081154953","doi":"10.7202/1005464ar","title":"Why Intermediality — if at all?","year":2011,"lang":"en","type":"article","venue":"Intermédialités Histoire et théorie des arts des lettres et des techniques","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Intertextuality; Hermeneutics; Epistemology; Closure (psychology); Aesthetics; Sociology; Philosophy; Literature; Art; Political science; Law","score_opus":0.052480247801609425,"score_gpt":0.2942363077097874,"score_spread":0.241756059908178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081154953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050706618,0.00057723565,0.7455898,0.0030679563,0.0021679264,0.0013319751,0.00007179391,0.00626452,0.19022217],"genre_scores_gemma":[0.6660077,0.00021034018,0.31679556,0.012401177,0.00030535547,0.00047004534,0.000050168215,0.00016618273,0.0035934714],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99382347,0.0009661909,0.0013084128,0.0017723094,0.00078869855,0.0013409312],"domain_scores_gemma":[0.9951923,0.00058600557,0.0004862244,0.002559797,0.00063703145,0.00053863326],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0019629723,0.0009806815,0.0009447326,0.00052642706,0.0007656027,0.000549285,0.0035169935,0.00041152936,0.00029126718],"category_scores_gemma":[0.00066098373,0.00091945747,0.0006270515,0.0006330643,0.0031201085,0.0022961667,0.0032062465,0.00077346235,0.000071384864],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026124387,0.0013843923,0.0052508228,0.0004114861,0.0002543334,0.00090477226,0.028548371,0.000003944686,0.0056933267,0.13799599,0.03321414,0.7860772],"study_design_scores_gemma":[0.00074743,0.0019630387,0.008626744,0.0006935729,0.00011155331,0.00093920704,0.00018933305,0.0012264419,0.07896315,0.32834443,0.5754782,0.0027169301],"about_ca_topic_score_codex":0.0018578073,"about_ca_topic_score_gemma":0.0019152133,"teacher_disagreement_score":0.78336024,"about_ca_system_score_codex":0.0018418814,"about_ca_system_score_gemma":0.00015753723,"threshold_uncertainty_score":0.99959284},"labels":[],"label_agreement":null},{"id":"W2081850291","doi":"10.1017/s0140525x10002177","title":"Beyond the building blocks model","year":2011,"lang":"en","type":"article","venue":"Behavioral and Brain Sciences","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bootstrapping (finance); Computer science; Process (computing); Unitary state; Cognitive science; Theoretical computer science; Artificial intelligence; Programming language; Psychology; Mathematics; Econometrics","score_opus":0.1041171531559967,"score_gpt":0.3134447822475273,"score_spread":0.2093276290915306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081850291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8639286,0.00014936247,0.13043639,0.0025176515,0.00032344804,0.00016528871,0.0000018718828,0.0001294046,0.0023479757],"genre_scores_gemma":[0.87394226,0.0000026795622,0.12527491,0.00057781895,0.000035358644,0.000010654309,1.0493104e-7,0.0000025479665,0.00015369573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998494,0.00005722778,0.00018003766,0.0005395695,0.00037876307,0.00035036745],"domain_scores_gemma":[0.99933165,0.00009980354,0.000061122686,0.00035866754,0.000047755813,0.00010098449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010791491,0.00013602785,0.00012265601,0.00007031233,0.00062284095,0.00030122726,0.0015784098,0.000042369586,0.00001829805],"category_scores_gemma":[0.000022485368,0.000079665835,0.00005137941,0.00052779005,0.0007460256,0.00057293894,0.0007653813,0.000117035204,0.000004038655],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064421674,0.0005622384,0.032168012,0.0000088012275,0.0000066710163,0.000032987176,0.016335817,0.00062834314,0.005177698,0.29199186,0.0020652656,0.6510159],"study_design_scores_gemma":[0.00021978191,0.0004659496,0.0230684,0.000010275214,0.000013036009,0.00009190636,0.00033971097,0.64467114,0.0023012457,0.3279657,0.0003904119,0.00046242718],"about_ca_topic_score_codex":0.00018424183,"about_ca_topic_score_gemma":0.000031857326,"teacher_disagreement_score":0.6505534,"about_ca_system_score_codex":0.000012493277,"about_ca_system_score_gemma":0.00007485728,"threshold_uncertainty_score":0.4790452},"labels":[],"label_agreement":null},{"id":"W2081858636","doi":"10.2178/jsl/1140641175","title":"Computable trees of Scott rank <i>ω</i><sub>1</sub><sup><i>CK</i></sup>, and computable approximation","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Rank (graph theory); Homogeneous; Tuple; Arithmetic function; Combinatorics; Homogeneity (statistics); Discrete mathematics; Statistics","score_opus":0.010974821138814869,"score_gpt":0.2141956998777218,"score_spread":0.20322087873890693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081858636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5894572,0.0016951727,0.40638283,0.0007060083,0.00034776292,0.0003050121,0.000005227221,0.000085534215,0.0010152184],"genre_scores_gemma":[0.9282071,0.00012575359,0.070896804,0.00024258139,0.00047333975,0.0000043069185,0.000003831167,0.000023584296,0.000022679023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958919,0.00033463797,0.0015946783,0.00056053925,0.00097520655,0.0006429893],"domain_scores_gemma":[0.996783,0.0005012436,0.0011561344,0.00062762114,0.0006917486,0.00024024902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017404078,0.00043086696,0.0011355942,0.0005230406,0.00020201576,0.00030512564,0.001263572,0.00020421967,0.000010790118],"category_scores_gemma":[0.00009871602,0.00036202828,0.00030647512,0.0010441131,0.00028801683,0.0011188796,0.0005319702,0.00048500905,0.000014893011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019449972,0.003462888,0.019053096,0.0007374851,0.00036067967,0.00027938688,0.0029062144,0.7271589,0.05466051,0.061535735,0.008305005,0.12134558],"study_design_scores_gemma":[0.0037822442,0.00117177,0.025372827,0.00026035667,0.00011065594,0.0018689992,0.00014235273,0.80520177,0.024282243,0.13602911,0.0009663766,0.00081131374],"about_ca_topic_score_codex":0.00008640101,"about_ca_topic_score_gemma":0.000008462694,"teacher_disagreement_score":0.3387499,"about_ca_system_score_codex":0.00014610711,"about_ca_system_score_gemma":0.00022726177,"threshold_uncertainty_score":0.9998832},"labels":[],"label_agreement":null},{"id":"W2083535322","doi":"10.1007/s00012-010-0063-6","title":"Small clones and the projection property","year":2010,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal; University of Calgary","funders":"","keywords":"Idempotence; Mathematics; clone (Java method); Projection (relational algebra); Combinatorics; Universe; Binary number; Type (biology); Binary operation; Property (philosophy); Discrete mathematics; Constant (computer programming); Algorithm; Arithmetic; Computer science; Physics","score_opus":0.012791531773125206,"score_gpt":0.19217790191060838,"score_spread":0.17938637013748318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083535322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7391292,0.00012558294,0.21821961,0.02246961,0.0025971988,0.0014923763,0.0000038905096,0.0009582103,0.015004357],"genre_scores_gemma":[0.96737754,0.00002446192,0.030797066,0.0004421828,0.00019635708,0.000014605099,0.0000018242912,0.000012094416,0.0011338668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989624,0.00012970157,0.00012923531,0.00040296128,0.00016198172,0.00021374584],"domain_scores_gemma":[0.9989353,0.00019116803,0.00006308277,0.0006286272,0.00011154431,0.00007028208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047474293,0.00013440686,0.00014221974,0.00007439744,0.00023407137,0.00020338247,0.00075862743,0.00007290504,0.000016809166],"category_scores_gemma":[0.00009388272,0.00007223519,0.000057257897,0.0003678349,0.00034014753,0.0004012128,0.00050464115,0.00027008972,0.000015802954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059332055,0.00013568533,0.0027112693,0.000025414618,0.000055519296,0.00002803889,0.0061323,0.000012528474,0.0013067671,0.69869226,0.0011015777,0.28973928],"study_design_scores_gemma":[0.008704341,0.0006135975,0.049184784,0.000037268997,0.00012918086,0.00073738035,0.0010983011,0.5311323,0.0055211266,0.18128683,0.21984583,0.001709092],"about_ca_topic_score_codex":0.0014085722,"about_ca_topic_score_gemma":0.000786169,"teacher_disagreement_score":0.53111976,"about_ca_system_score_codex":0.000021676324,"about_ca_system_score_gemma":0.00007094608,"threshold_uncertainty_score":0.29456654},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04076569988103329,"score_gpt":0.4012698471811063,"score_spread":0.360504147300073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084748398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048042645,0.0016622347,0.9681033,0.0019539522,0.003394137,0.00016259955,0.000001053976,0.00047524503,0.023767032],"genre_scores_gemma":[0.03410214,0.0000027706815,0.96401244,0.0011634927,0.0003521913,0.000008860149,0.0000010812145,0.0000126961095,0.00034434552],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715805,0.0011392048,0.00022921195,0.00063950964,0.00046397294,0.00037005352],"domain_scores_gemma":[0.99730104,0.00079236814,0.00007867986,0.0012692774,0.00029292237,0.00026573378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050292243,0.00020221726,0.0002747294,0.00012064776,0.000068936104,0.00015990157,0.0017659063,0.0003584858,0.00002177173],"category_scores_gemma":[0.001608111,0.00015893682,0.00011544205,0.00082785165,0.000076868695,0.00030900227,0.0008032796,0.0008716018,0.00005753656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006011874,0.00006665873,0.00021972143,0.000006539239,0.000014250762,0.000018625395,0.0006877842,0.00007484578,0.0002345695,0.26982498,0.003923454,0.72492254],"study_design_scores_gemma":[0.00047611666,0.00014615932,0.0018720409,0.000007767757,0.000009534077,0.000087671004,0.000037273203,0.11218116,0.0069303866,0.698139,0.17970815,0.00040470954],"about_ca_topic_score_codex":0.000008949855,"about_ca_topic_score_gemma":0.0000023776233,"teacher_disagreement_score":0.7245178,"about_ca_system_score_codex":0.00010711618,"about_ca_system_score_gemma":0.00015433955,"threshold_uncertainty_score":0.6481255},"labels":[],"label_agreement":null},{"id":"W2084784291","doi":"10.2178/bsl/1294171130","title":"Von Neumann, Gödel and Complexity Theory","year":2010,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Von Neumann architecture; Von Neumann algebra; Algebra over a field; Mathematics; Computer science; Pure mathematics","score_opus":0.02405949454966243,"score_gpt":0.24222700501474487,"score_spread":0.21816751046508243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084784291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76077604,0.00068938854,0.16766322,0.018127376,0.0022337036,0.0009405302,0.000017225197,0.00083360134,0.048718918],"genre_scores_gemma":[0.9170308,0.000018076144,0.08151127,0.00094369834,0.00014302062,0.000012911477,0.0000019749436,0.000012150962,0.0003260808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980921,0.0001928342,0.00039053225,0.00062545144,0.00031054323,0.00038849455],"domain_scores_gemma":[0.9980851,0.00044979833,0.00016679059,0.0009838437,0.00015216354,0.00016234285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011360402,0.00023787847,0.00039304598,0.00010267667,0.0001472172,0.00009747352,0.0012143651,0.00014113296,0.00046926868],"category_scores_gemma":[0.000257401,0.0002017048,0.00009963053,0.00019387674,0.0006256023,0.00005781812,0.0009789896,0.00038129918,0.00012607427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012230514,0.00024139021,0.001439436,0.000050048537,0.000016810995,0.0000121080875,0.0005172023,0.000014578631,0.0017348285,0.95224166,0.0022580791,0.041461613],"study_design_scores_gemma":[0.00073541095,0.00029813143,0.11353432,0.000019883177,0.00001537519,0.00017214398,0.000057059,0.0062659364,0.0009727019,0.83363354,0.043768667,0.00052685966],"about_ca_topic_score_codex":0.00015549091,"about_ca_topic_score_gemma":0.000017209866,"teacher_disagreement_score":0.15625478,"about_ca_system_score_codex":0.000015628531,"about_ca_system_score_gemma":0.000044314394,"threshold_uncertainty_score":0.8225283},"labels":[],"label_agreement":null},{"id":"W2086833994","doi":"10.1007/s00039-012-0161-z","title":"The rate of convergence of the Walk on Spheres Algorithm","year":2012,"lang":"en","type":"article","venue":"Geometric and Functional Analysis","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Rate of convergence; Convergence (economics); SPHERES; Brownian motion; Domain (mathematical analysis); Characterization (materials science); Normal convergence; Algorithm; Compact convergence; Mathematical analysis; Computer science; Statistics; Key (lock)","score_opus":0.014432809787159386,"score_gpt":0.20888537293409407,"score_spread":0.19445256314693468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086833994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104686745,0.0037517457,0.8890726,0.00062721514,0.0012371425,0.000109487984,0.000015444713,0.000027477936,0.0004721398],"genre_scores_gemma":[0.9962359,0.00008280144,0.0029192404,0.00007111389,0.0000982185,0.0000050078556,0.0000013284188,0.000002639868,0.00058375695],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987912,0.000109814304,0.0002779378,0.00022545399,0.00039904058,0.00019652893],"domain_scores_gemma":[0.9982416,0.00091278605,0.00015121345,0.0004536476,0.000178911,0.000061844774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084097765,0.00010331275,0.00020505374,0.00033754256,0.00016844255,0.00003574189,0.00040316946,0.000036331207,0.00009860763],"category_scores_gemma":[0.00017069696,0.000052588697,0.00025220474,0.007394392,0.00016885712,0.00012173212,0.00030721797,0.00010176612,0.000014502636],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029191147,0.0004776401,0.26836583,0.00004484639,0.0025858912,0.000001007672,0.0003069313,0.009661496,0.00010200615,0.06650822,0.0030185303,0.6488984],"study_design_scores_gemma":[0.00011838536,0.00007907238,0.79916364,0.0000041935436,0.00032171633,0.000003636722,0.00008205216,0.1898514,0.0005776918,0.006437796,0.0032392603,0.00012114697],"about_ca_topic_score_codex":0.00015943704,"about_ca_topic_score_gemma":0.000011354847,"teacher_disagreement_score":0.89154917,"about_ca_system_score_codex":0.000023527618,"about_ca_system_score_gemma":0.00003106946,"threshold_uncertainty_score":0.35527602},"labels":[],"label_agreement":null},{"id":"W2087377736","doi":"10.1007/s001530100095","title":"On the distribution of Lachlan nonsplitting bases","year":2002,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Degree (music); Base (topology); Recursively enumerable language; Bounding overwatch; Hierarchy; Combinatorics; Distribution (mathematics); Computer science; Mathematical analysis; Physics; Artificial intelligence","score_opus":0.04930155187970691,"score_gpt":0.2544212250325528,"score_spread":0.2051196731528459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087377736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014601521,0.000015941787,0.97688466,0.0026051009,0.00005775184,0.0004701826,0.00004705855,0.000092322356,0.0052254605],"genre_scores_gemma":[0.8932877,0.0000015126536,0.1062702,0.00026235756,0.00003967633,0.00006434402,0.000008630343,0.000006359477,0.000059225167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874985,0.000119469725,0.00031812637,0.00029367843,0.00024240413,0.00027645016],"domain_scores_gemma":[0.9932628,0.0059277727,0.00010755124,0.00058671733,0.000054020034,0.0000611214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054161676,0.00013457915,0.00021644223,0.000030457439,0.00014858968,0.000045454555,0.00075259106,0.000030309347,0.00009040651],"category_scores_gemma":[0.0015583632,0.00007946198,0.00015973783,0.00017238753,0.00016621593,0.00006648246,0.00025108678,0.000117189746,0.00008758877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030048434,0.00025704058,0.000015620075,0.00005093364,0.000008027445,0.000001273632,0.00024368857,0.00007562017,0.000062203435,0.9933565,0.0007342103,0.0051918374],"study_design_scores_gemma":[0.00008701863,0.00018899306,0.000199169,0.000025283643,0.0000048596344,0.0000058511696,0.000011987148,0.3646623,0.00025432894,0.63436675,0.00012843535,0.000065021006],"about_ca_topic_score_codex":0.0000017197934,"about_ca_topic_score_gemma":5.424713e-7,"teacher_disagreement_score":0.8786862,"about_ca_system_score_codex":0.000021995837,"about_ca_system_score_gemma":0.000007815424,"threshold_uncertainty_score":0.32403654},"labels":[],"label_agreement":null},{"id":"W2089220531","doi":"10.1002/malq.200910001","title":"Degree spectra and immunity properties","year":2010,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Uncountable set; Mathematics; Corollary; Complement (music); Pure mathematics; Spectrum (functional analysis); Combinatorics; Physics; Biology","score_opus":0.037241469415239,"score_gpt":0.240759079117303,"score_spread":0.20351760970206398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089220531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40677872,0.000063647116,0.5782241,0.0021968777,0.0003305822,0.00040279058,0.0000012995717,0.00050409714,0.011497877],"genre_scores_gemma":[0.7926789,7.643268e-7,0.20695135,0.00013910874,0.00007703563,0.00002411229,3.9737685e-7,0.000008992568,0.00011934925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829906,0.00011250209,0.0003762722,0.00046831768,0.00032334847,0.00042052646],"domain_scores_gemma":[0.9983079,0.0002909203,0.00007219855,0.0010543902,0.000085129315,0.00018948289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007125805,0.00023999113,0.00033617197,0.00006971683,0.00017882184,0.00037227717,0.0010240057,0.00012396078,0.00014004625],"category_scores_gemma":[0.00017083526,0.00016694552,0.00008149497,0.00020337277,0.00032529165,0.00034894445,0.00023197939,0.00049587694,0.00029186837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005702874,0.00049166416,0.00013623068,0.00012714665,0.000018169245,0.000031492502,0.0043112575,7.4388316e-7,0.008054606,0.8484054,0.00007832551,0.13833927],"study_design_scores_gemma":[0.0002468614,0.0006224821,0.005157453,0.000018380108,0.000008582922,0.00026023554,0.00015749462,0.04908331,0.0005384941,0.9434279,0.00015637676,0.0003223785],"about_ca_topic_score_codex":0.000017470416,"about_ca_topic_score_gemma":0.000020689076,"teacher_disagreement_score":0.38590017,"about_ca_system_score_codex":0.000018497945,"about_ca_system_score_gemma":0.00003743016,"threshold_uncertainty_score":0.68078405},"labels":[],"label_agreement":null},{"id":"W2091132231","doi":"10.1090/s0002-9947-2010-05013-5","title":"Chain conditions in computable rings","year":2010,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Artinian ring; Ideal (ethics); Ring (chemistry); Principal ideal ring; Commutative ring; Maximal ideal; Simple ring; Prime ideal; Pure mathematics; Noetherian; Noetherian ring; Discrete mathematics; Reduced ring; Noncommutative ring; Radical of a ring; Prime (order theory); Algebra over a field; Combinatorics; Commutative property; Law","score_opus":0.009886989262126361,"score_gpt":0.2544434188728113,"score_spread":0.24455642961068494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091132231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2542241,0.0000030055699,0.7425544,0.002152677,0.00012885341,0.00020888566,0.0000058398705,0.00009889612,0.0006232925],"genre_scores_gemma":[0.7978923,0.0000031381908,0.20177576,0.0001888222,0.000017062774,0.000025487805,2.8481674e-7,0.0000082915485,0.00008890136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866605,0.00007291997,0.0003684927,0.00029040314,0.00030374076,0.0002983856],"domain_scores_gemma":[0.9983363,0.0004932382,0.0001641368,0.00085231435,0.00006754892,0.000086460335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044472184,0.00014643466,0.00034241137,0.000037852653,0.00016955247,0.000043671946,0.0011687208,0.00004791573,0.00013689243],"category_scores_gemma":[0.000042896096,0.000111317044,0.0003596038,0.0010824078,0.00079887273,0.00018069254,0.000095164396,0.0005040612,0.000023930754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035769237,0.012868553,0.011889194,0.00084098283,0.00066955294,0.000013252495,0.039573196,0.057413675,0.0586152,0.6839853,0.0022389044,0.13185646],"study_design_scores_gemma":[0.00039840373,0.00009477617,0.016453477,0.000034933546,0.000025786268,0.000059098056,0.00056326826,0.7586774,0.0018758642,0.22125772,0.00025744402,0.00030181275],"about_ca_topic_score_codex":0.00017000243,"about_ca_topic_score_gemma":0.000027322252,"teacher_disagreement_score":0.7012637,"about_ca_system_score_codex":0.000049303915,"about_ca_system_score_gemma":0.00006291869,"threshold_uncertainty_score":0.45393774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02317474790309713,"score_gpt":0.24671238245622423,"score_spread":0.2235376345531271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091708223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36472973,0.0001736465,0.21109161,0.2929044,0.0005278141,0.0026570489,0.00006293448,0.0012201661,0.12663263],"genre_scores_gemma":[0.92899114,0.0000030877134,0.0689462,0.0015276078,0.00029148973,0.000034873905,0.0000010893041,0.00002500307,0.00017950861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965537,0.00003673371,0.0009044605,0.0008497675,0.0010926038,0.00056273985],"domain_scores_gemma":[0.9977875,0.0004584133,0.0003848681,0.0007017203,0.0004946539,0.00017285308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012893141,0.00037042165,0.0006056857,0.000027305903,0.0002290654,0.00014559845,0.0022995574,0.00028683984,0.000022118435],"category_scores_gemma":[0.0003966073,0.00025105066,0.0009117581,0.00079798675,0.0008048378,0.0005525404,0.0017757379,0.0006319719,0.000036895333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005471505,0.00051957177,0.00075390295,0.00025749364,0.000048222017,4.0983394e-7,0.00040784013,0.0000051911957,0.0008407474,0.98849434,0.008502718,0.00016412493],"study_design_scores_gemma":[0.00030472095,0.00006534439,0.0047798045,0.000055880955,0.00004109956,0.00002204216,0.000017153794,0.052683946,0.0029660768,0.93834925,0.00043393238,0.00028074335],"about_ca_topic_score_codex":0.000033271946,"about_ca_topic_score_gemma":1.2345737e-7,"teacher_disagreement_score":0.5642614,"about_ca_system_score_codex":0.00022265062,"about_ca_system_score_gemma":0.00004936312,"threshold_uncertainty_score":0.99999416},"labels":[],"label_agreement":null},{"id":"W2092092276","doi":"10.13034/cysj-2014-011","title":"Research Analyses of “Parellelization of the Knapsack Problem as an Introductory Experience in Parellel Computing”","year":2014,"lang":"en","type":"article","venue":"Journal of Student Science and Technology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Earl Haig Secondary School","funders":"","keywords":"Knapsack problem; Computer science; Ligne; Mathematics education; Library science; Humanities; Mathematics; Art; Algorithm","score_opus":0.06872013862718698,"score_gpt":0.42107121487438937,"score_spread":0.3523510762472024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092092276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9819541,0.00018861968,0.016076928,0.0012881559,0.00020965045,0.00015773275,1.0657454e-7,0.000012368848,0.00011236447],"genre_scores_gemma":[0.99010587,0.00004711767,0.009777674,0.000022514992,0.000039126357,0.0000015586587,2.4507498e-8,0.0000025573909,0.0000035686844],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99709755,0.00023176702,0.0006755854,0.00033061646,0.0013625358,0.00030195745],"domain_scores_gemma":[0.9968032,0.00018133182,0.0006213293,0.0006336205,0.0016949932,0.00006550976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052371523,0.000096173266,0.00031164463,0.0011780434,0.00019552314,0.00006239386,0.0032400095,0.00007217591,0.000002091362],"category_scores_gemma":[0.00092715933,0.000063813255,0.000033952467,0.0047653057,0.0022003185,0.00045796446,0.0014389331,0.00036300227,5.6889127e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025088017,0.001590673,0.63665056,0.000075969496,0.000028475724,0.000010828098,0.020866735,0.006496875,0.14374965,0.09305248,0.000080746606,0.09737189],"study_design_scores_gemma":[0.0014986101,0.004415727,0.65281856,0.0003202317,0.00001925937,0.0002792193,0.013458782,0.08547035,0.1533432,0.08755363,0.00043772848,0.0003847221],"about_ca_topic_score_codex":0.00004208775,"about_ca_topic_score_gemma":0.00001764259,"teacher_disagreement_score":0.09698717,"about_ca_system_score_codex":0.00008950149,"about_ca_system_score_gemma":0.0003396577,"threshold_uncertainty_score":0.81071657},"labels":[],"label_agreement":null},{"id":"W2092096082","doi":"10.1007/s11512-007-0045-x","title":"On the computational complexity of the Riemann mapping","year":2007,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"DTIME; Time hierarchy theorem; Turing machine; Computational complexity theory; Boundary (topology); Computer science; Mathematics; Domain (mathematical analysis); Riemann hypothesis; Theoretical computer science; Upper and lower bounds; NSPACE; Algorithm; Discrete mathematics; Computation; Pure mathematics; Universal Turing machine; Mathematical analysis","score_opus":0.06487436475940916,"score_gpt":0.27196878163441784,"score_spread":0.20709441687500868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092096082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4080667,0.00030202582,0.54947644,0.017887125,0.0036110107,0.002369525,0.00006367444,0.00023570826,0.017987816],"genre_scores_gemma":[0.9700417,0.0000028425904,0.027850466,0.0016779524,0.00017375508,0.000013505079,0.0000048882807,0.000026509944,0.00020836451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99458164,0.00080099155,0.00143731,0.0007991383,0.0016040457,0.00077687553],"domain_scores_gemma":[0.9925396,0.0038358737,0.0009436093,0.0020542778,0.0004782561,0.00014841718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048683444,0.0004841079,0.0006461476,0.00015678581,0.0007969254,0.00029759522,0.0032468655,0.00015714396,0.00033065878],"category_scores_gemma":[0.00053859106,0.00029355104,0.00040929927,0.0013771117,0.0013082068,0.00024595286,0.0016181559,0.0006055526,0.00034870484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022731456,0.0005123823,0.0013216411,0.00051416387,0.00012760705,0.000014573637,0.0049509644,0.006750842,0.00012949602,0.979823,0.0033140818,0.0025185046],"study_design_scores_gemma":[0.00041810793,0.0001242851,0.17964128,0.0005366127,0.00002721654,0.00005172825,0.0004595229,0.2568162,0.0005354965,0.5604249,0.00055744,0.00040722667],"about_ca_topic_score_codex":0.00013594021,"about_ca_topic_score_gemma":0.000058886708,"teacher_disagreement_score":0.561975,"about_ca_system_score_codex":0.00020281551,"about_ca_system_score_gemma":0.0002001468,"threshold_uncertainty_score":0.99995166},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.049565025204491485,"score_gpt":0.2997099780135482,"score_spread":0.25014495280905674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094663018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024134113,0.000044407483,0.96696043,0.0046545276,0.002020736,0.0004898666,0.000031351057,0.00071273907,0.00095184264],"genre_scores_gemma":[0.7745017,0.0000059551485,0.22431368,0.00094581227,0.000117447606,0.000044502565,0.000040519717,0.000021752665,0.000008650376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996439,0.00015108097,0.00065860304,0.0010826774,0.0011195387,0.0005490998],"domain_scores_gemma":[0.99612164,0.0022628189,0.00022330105,0.00080639275,0.00032588115,0.00025997142],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043381096,0.00044920616,0.00038886064,0.0006368675,0.0005731716,0.00029160813,0.0013001409,0.00018458118,0.0001133533],"category_scores_gemma":[0.0001790376,0.00044707858,0.00030037234,0.0016188537,0.0001637641,0.0005732497,0.000051391988,0.0005714477,0.00085556123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011968677,0.00024949052,0.00000580991,0.000011014028,0.000073399744,0.000034638062,0.00013908213,0.9070118,0.00002659385,0.041013367,0.000048445185,0.051266674],"study_design_scores_gemma":[0.009241427,0.003451559,0.014932252,0.00007291154,0.00007845465,0.00009259531,0.00006943378,0.38366896,0.0019372987,0.5844145,0.0005901174,0.0014505257],"about_ca_topic_score_codex":0.00006434211,"about_ca_topic_score_gemma":0.0000091068705,"teacher_disagreement_score":0.7503676,"about_ca_system_score_codex":0.00051229325,"about_ca_system_score_gemma":0.00030856926,"threshold_uncertainty_score":0.9999224},"labels":[],"label_agreement":null},{"id":"W2100122922","doi":"10.1007/bfb0022469","title":"On the absence of livelocks in parallel programs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Correctness; Extension (predicate logic); Computer science; Reduction (mathematics); Set (abstract data type); Programming language; Theoretical computer science; Algorithm; Mathematics","score_opus":0.023720028309824087,"score_gpt":0.24529131590823458,"score_spread":0.2215712875984105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100122922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092857744,0.0003412278,0.9912631,0.0019426587,0.0009767904,0.0010048419,0.0000023780467,0.00013103214,0.0034093785],"genre_scores_gemma":[0.50679606,0.000056871115,0.49070013,0.0016974857,0.0004113461,0.00004439188,0.0000026098874,0.000042551525,0.0002485776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946772,0.000102193975,0.00089371915,0.0019061401,0.0015447114,0.00087604334],"domain_scores_gemma":[0.99495393,0.0017366525,0.00044529026,0.0024340164,0.00028365522,0.00014647799],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018836921,0.00066145463,0.00073536567,0.0007600762,0.00016757521,0.00034746944,0.0068451874,0.00034871313,0.000033022974],"category_scores_gemma":[0.00022325138,0.00047855088,0.00020191293,0.0012335158,0.0014431118,0.00037068976,0.002236755,0.0013381479,0.000044735327],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007383222,0.00013941989,0.00018491363,0.000026864152,0.0000067445644,0.000060005896,0.0010123989,0.0667784,0.000011892817,0.06967152,0.000010665585,0.8620898],"study_design_scores_gemma":[0.00025739922,0.0004073555,0.0010540764,0.0005314047,0.0000025285742,0.00003994716,4.0000543e-7,0.6749938,0.0001503411,0.32149938,0.00044738076,0.0006159511],"about_ca_topic_score_codex":0.00007323089,"about_ca_topic_score_gemma":0.00031656882,"teacher_disagreement_score":0.86147386,"about_ca_system_score_codex":0.00041616792,"about_ca_system_score_gemma":0.00060056004,"threshold_uncertainty_score":0.9997666},"labels":[],"label_agreement":null},{"id":"W2100206033","doi":"","title":"Communication Can Destroy Common Learning","year":2008,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Common knowledge (logic); Computer science; Common cause and special cause; Artificial intelligence; Engineering; Operations management","score_opus":0.046902112899201175,"score_gpt":0.32064721145351666,"score_spread":0.2737450985543155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100206033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.844741,0.000806641,0.003510751,0.0041106674,0.0012670232,0.002610574,0.000032494117,0.00082994596,0.1420909],"genre_scores_gemma":[0.9462005,0.012013324,0.04057789,0.00008840619,0.00014801219,0.00022865097,0.00008578366,0.0000585518,0.00059886434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471515,0.0015835837,0.00085337315,0.0013812415,0.00046795042,0.0009987042],"domain_scores_gemma":[0.99394524,0.0014972222,0.00031709444,0.0037329735,0.00023607559,0.00027139185],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0030077666,0.00039762704,0.00069364597,0.0006073448,0.0005078831,0.0004707688,0.004959086,0.0004856314,0.000012187637],"category_scores_gemma":[0.0005423255,0.00047081104,0.00021283764,0.00032583575,0.0005393834,0.00021222827,0.010081194,0.004453928,0.000020627102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016283393,0.0002908196,0.019862758,0.000089151,0.00005148561,0.000059887316,0.0020275032,0.16173698,0.000018310831,0.0018382227,0.000062999876,0.8139456],"study_design_scores_gemma":[0.0006415103,0.00021023568,0.030064285,0.00023130015,0.0000048279617,0.00008780392,0.00028660006,0.92996275,0.00012462016,0.019087818,0.018350394,0.00094784546],"about_ca_topic_score_codex":0.0007431493,"about_ca_topic_score_gemma":0.0010127296,"teacher_disagreement_score":0.81299776,"about_ca_system_score_codex":0.0019667868,"about_ca_system_score_gemma":0.0009332382,"threshold_uncertainty_score":0.99977434},"labels":[],"label_agreement":null},{"id":"W2100260968","doi":"10.1007/s10992-007-9071-1","title":"SUPERVALUATION FIXED-POINT LOGICS OF TRUTH","year":2008,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Epistemology; Mathematical economics; Calculus (dental); Philosophy","score_opus":0.07778070247620184,"score_gpt":0.28006082350439854,"score_spread":0.2022801210281967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100260968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33602005,0.00073144963,0.630326,0.028480995,0.0016899229,0.00026947042,0.0000049317396,0.00009292908,0.0023842994],"genre_scores_gemma":[0.91995543,0.00007849529,0.07889695,0.0004584437,0.0005941399,0.0000014487031,8.050841e-7,0.000008213162,0.0000060796638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967697,0.00034500204,0.0011699314,0.0003263488,0.0010876183,0.0003013841],"domain_scores_gemma":[0.9970208,0.0006773942,0.00068282784,0.0005534439,0.0008393498,0.00022619842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015295324,0.00022029174,0.00061903335,0.00024942332,0.00011418495,0.000034816185,0.0013859831,0.00017539634,0.00007159333],"category_scores_gemma":[0.001165133,0.00016188582,0.00038671974,0.0006033314,0.00027106365,0.00055451365,0.0003541269,0.0005500562,0.000021960263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002055673,0.0031094707,0.006864593,0.0001241198,0.00018233669,0.00122711,0.0016196064,0.011225728,0.0048626475,0.9448943,0.0007703368,0.024914173],"study_design_scores_gemma":[0.0008705374,0.0017580789,0.018763434,0.00003074872,0.000023517,0.0015085132,0.000011315943,0.025992757,0.0010466863,0.9496649,0.00010930091,0.00022020795],"about_ca_topic_score_codex":0.0000029411108,"about_ca_topic_score_gemma":3.2607628e-7,"teacher_disagreement_score":0.5839354,"about_ca_system_score_codex":0.00011988516,"about_ca_system_score_gemma":0.00022809263,"threshold_uncertainty_score":0.66015124},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012163553824832106,"score_gpt":0.19261456505035482,"score_spread":0.1804510112255227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101694047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07207876,0.0005309061,0.89040697,0.0036399413,0.0011312541,0.00045601887,0.000013870722,0.00032720418,0.031415068],"genre_scores_gemma":[0.93908614,0.00004493108,0.059283555,0.0001372928,0.000027273603,2.8294386e-7,0.0000016802817,0.000008563316,0.0014102843],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982039,0.0002931675,0.0001644756,0.000486008,0.00046580014,0.00038668796],"domain_scores_gemma":[0.9978374,0.0004810532,0.00016044143,0.0011236991,0.0002542936,0.00014308112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007550979,0.00017038161,0.00025345723,0.00018467836,0.00063392817,0.000099700796,0.002003934,0.000093474875,0.00008219095],"category_scores_gemma":[0.00016844162,0.00016178879,0.00019340876,0.0013073832,0.00026180068,0.0004942205,0.0007547336,0.00022566237,0.000066782035],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007876203,0.0010636318,0.021399014,0.00016548584,0.0003586795,0.00033483206,0.009507383,0.0010630322,0.00034808696,0.3501727,0.018699622,0.59680873],"study_design_scores_gemma":[0.004223789,0.0011152555,0.21396607,0.00007543688,0.00014620594,0.00016387568,0.005955186,0.09131971,0.0014404908,0.08681865,0.59281,0.0019653542],"about_ca_topic_score_codex":0.00016332757,"about_ca_topic_score_gemma":0.0001705286,"teacher_disagreement_score":0.8670074,"about_ca_system_score_codex":0.00012410805,"about_ca_system_score_gemma":0.00013702374,"threshold_uncertainty_score":0.6597556},"labels":[],"label_agreement":null},{"id":"W2103244827","doi":"10.70930/tac/vps3rhtd","title":"More on Geometric Morphisms between Realizability Toposes","year":2014,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realizability; Morphism; Topos theory; Mathematics; Pure mathematics; Algebra over a field; Discrete mathematics; Algorithm","score_opus":0.013136465459556374,"score_gpt":0.2595807248791388,"score_spread":0.24644425941958242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103244827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1228619,0.00012857692,0.87339,0.00050241995,0.00003685564,0.00030385092,0.000011058224,0.00014691972,0.0026183936],"genre_scores_gemma":[0.9920899,0.000013917965,0.0075311456,0.000078352125,0.00011001341,0.000083677434,0.000009131672,0.000006369106,0.00007747546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987314,0.00019421661,0.00028324808,0.0004146675,0.00020098833,0.00017549585],"domain_scores_gemma":[0.99705565,0.0015528798,0.00012215019,0.0010523419,0.00013123665,0.00008573472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013427846,0.00014409173,0.00025484437,0.00017463295,0.00018183207,0.000055638593,0.00074073655,0.000063271924,0.000011118045],"category_scores_gemma":[0.00020191335,0.00012321459,0.000052043044,0.0008292389,0.00044303588,0.00016650853,0.0002720765,0.00010274513,0.000011162073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056078416,0.000062767554,0.0019267863,0.000025383804,0.000007776823,5.610284e-8,0.00021586815,0.000045831574,0.000029706947,0.8046713,0.00001870044,0.1929902],"study_design_scores_gemma":[0.00012384758,0.0001363077,0.03696141,0.00000376533,0.00001377597,0.000002144482,0.00006849262,0.00041412242,0.004949268,0.9530843,0.004090346,0.0001522456],"about_ca_topic_score_codex":0.000032197437,"about_ca_topic_score_gemma":9.080891e-7,"teacher_disagreement_score":0.869228,"about_ca_system_score_codex":0.0000192047,"about_ca_system_score_gemma":0.000026691358,"threshold_uncertainty_score":0.50245446},"labels":[],"label_agreement":null},{"id":"W2104329043","doi":"10.2178/jsl/1318338849","title":"Limits on jump inversion for strong reducibilities","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Jump; Inversion (geology); Set (abstract data type); Mathematics; Algorithm; Computer science; Discrete mathematics; Combinatorics; Physics; Biology","score_opus":0.1159473559644005,"score_gpt":0.28514799890236,"score_spread":0.16920064293795947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104329043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6362824,0.00048857817,0.34569505,0.0022284754,0.004113543,0.0005914958,0.000005440396,0.00014897181,0.01044604],"genre_scores_gemma":[0.921277,0.00002754977,0.07767605,0.00042863123,0.00041385277,0.000004834574,3.5759393e-7,0.000010314094,0.00016139598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981664,0.00012066182,0.00058443256,0.00035292076,0.0004121471,0.00036342847],"domain_scores_gemma":[0.9980864,0.00031461334,0.0004304897,0.00058638817,0.00039755562,0.00018458332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011158593,0.0001932697,0.00038457938,0.0002735649,0.00011887298,0.00007509966,0.0012636563,0.000101029225,0.000037504396],"category_scores_gemma":[0.00033424265,0.00014362633,0.00028029602,0.00025791797,0.00009082137,0.00050949876,0.00017809239,0.000274936,0.000023670962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071298913,0.003855611,0.008322195,0.00034375562,0.00038734268,0.00027543723,0.028852884,0.0017872966,0.0030020317,0.6192811,0.020186512,0.31299284],"study_design_scores_gemma":[0.004146855,0.013464289,0.059812054,0.00033262145,0.000115641844,0.00072959333,0.0018516193,0.044794697,0.020046,0.84749365,0.0059901387,0.0012228471],"about_ca_topic_score_codex":0.00001299332,"about_ca_topic_score_gemma":0.0000020008242,"teacher_disagreement_score":0.31177,"about_ca_system_score_codex":0.00015357122,"about_ca_system_score_gemma":0.00015142624,"threshold_uncertainty_score":0.58569115},"labels":[],"label_agreement":null},{"id":"W2105974344","doi":"10.1109/ainaw.2007.184","title":"Filtering Spam Using Kolmogorov Complexity Estimates","year":2007,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Ottawa","funders":"","keywords":"Kolmogorov complexity; Security token; Filter (signal processing); Computer science; Bag-of-words model; String (physics); Representation (politics); Bayesian probability; Computational complexity theory; Artificial intelligence; Pattern recognition (psychology); Algorithm; Mathematics; Computer vision","score_opus":0.09628748373229344,"score_gpt":0.320777332876426,"score_spread":0.22448984914413256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105974344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11572079,0.00003720111,0.87773496,0.00020041844,0.00058342156,0.00014528888,9.1265326e-7,0.0006168356,0.004960197],"genre_scores_gemma":[0.4032024,4.3508405e-7,0.5965079,0.0001610803,0.00008472328,8.2841234e-7,8.107746e-7,0.000007411906,0.000034412176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810183,0.000032116623,0.00036757952,0.00056780403,0.0003364798,0.0005941943],"domain_scores_gemma":[0.9985451,0.0002911787,0.000080831385,0.00079621095,0.00010750817,0.00017918664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084220094,0.0002123858,0.00024454796,0.00012935109,0.00020774867,0.0002468749,0.0010614072,0.00006303634,0.00011966453],"category_scores_gemma":[0.000078110985,0.00019570068,0.00008897699,0.0004782672,0.00010596439,0.00049826875,0.0010638904,0.00014960892,0.000065010376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004391906,0.001218677,0.07867467,0.00023129,0.00013608443,0.00057378755,0.0027345216,0.016916974,0.04378317,0.38997772,0.0011604396,0.46454877],"study_design_scores_gemma":[0.00018622384,0.000052215575,0.026440745,0.000011978235,0.0000038575345,0.000110472385,0.000020701944,0.9334173,0.010529715,0.028421877,0.0005005591,0.00030432723],"about_ca_topic_score_codex":0.0003903439,"about_ca_topic_score_gemma":0.000095493815,"teacher_disagreement_score":0.91650033,"about_ca_system_score_codex":0.00013497102,"about_ca_system_score_gemma":0.00004339684,"threshold_uncertainty_score":0.7980442},"labels":[],"label_agreement":null},{"id":"W2106316671","doi":"10.1023/a:1006436305188","title":"First Alexandroff Decomposition Theorem for Topological Lattice Group Valued Measures","year":2000,"lang":"en","type":"article","venue":"Order","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Hausdorff space; Commutative property; Combinatorics; Bounded function; Subalgebra; Discrete mathematics; Pure mathematics; Algebra over a field","score_opus":0.023030080373455417,"score_gpt":0.2766309605178506,"score_spread":0.25360088014439514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106316671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053735774,0.00017332553,0.9369405,0.002713631,0.000407065,0.0005046113,0.0000047884537,0.00037100422,0.0051493077],"genre_scores_gemma":[0.62856156,0.00002003061,0.3694272,0.0010404962,0.00026822375,0.00009310713,0.000009685446,0.000017146172,0.00056255877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832696,0.00013739389,0.00025643207,0.00058619713,0.00028971623,0.00040332877],"domain_scores_gemma":[0.9987272,0.00039529847,0.000048683407,0.0005799955,0.00014136401,0.00010747204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057562423,0.00019355539,0.00022436761,0.000048548507,0.00030461996,0.0001750443,0.00079712045,0.00012081192,0.0006569055],"category_scores_gemma":[0.00008901691,0.00015963725,0.00012009541,0.0003340625,0.00010738925,0.00029476944,0.00014081047,0.00012860898,0.00015704345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019218419,0.001274606,0.0015032717,0.0000731782,0.00009653226,0.000032404263,0.0014605841,0.004363213,0.00022719453,0.46883294,0.0031905381,0.51875335],"study_design_scores_gemma":[0.002122974,0.0009215108,0.026927272,0.00003507121,0.000043673444,0.00012606716,0.000027535207,0.5802171,0.00041658353,0.31137186,0.076927654,0.0008626928],"about_ca_topic_score_codex":0.000032267562,"about_ca_topic_score_gemma":0.0000405263,"teacher_disagreement_score":0.5758539,"about_ca_system_score_codex":0.00006217171,"about_ca_system_score_gemma":0.000028639175,"threshold_uncertainty_score":0.7192655},"labels":[],"label_agreement":null},{"id":"W2109854822","doi":"10.1109/jcit.1990.128303","title":"Junior Researcher: a discovery system that can solve the N queens problems (N&amp;lt;or=4) on a constant computational complexity","year":2002,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"","keywords":"Constant (computer programming); Computer science; Theoretical computer science; Computational complexity theory; Discrete mathematics; Mathematics; Algorithm; Programming language","score_opus":0.20272427597498058,"score_gpt":0.301796106911869,"score_spread":0.0990718309368884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109854822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015277382,0.00020163815,0.92915314,0.025776694,0.000840009,0.0023866089,0.00013932271,0.0011346674,0.025090527],"genre_scores_gemma":[0.94880205,0.000010446723,0.047670994,0.0008759249,0.00013541838,0.000102286096,0.00001629265,0.000025941223,0.002360639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525964,0.0006834753,0.0005683388,0.0010546466,0.0015710706,0.0008628447],"domain_scores_gemma":[0.99585086,0.0017986591,0.0002001148,0.0015675517,0.0003089803,0.00027385232],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001486011,0.00040337804,0.00046460982,0.0001869525,0.0006987787,0.0010786561,0.0022186164,0.000109451306,0.0001644331],"category_scores_gemma":[0.00013689858,0.00024023304,0.00020357616,0.0008891932,0.0007739195,0.00050516595,0.0011090235,0.000557234,0.00020948138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048636964,0.00082127814,0.00082664605,0.0001881235,0.00014136155,0.00009004715,0.0042243535,0.012438451,0.000024951143,0.95457935,0.014689592,0.011927187],"study_design_scores_gemma":[0.0009792689,0.00042094366,0.004956081,0.00015347505,0.0000141980945,0.00027115515,0.00048005828,0.9648609,0.000025901078,0.021406908,0.005858441,0.0005726256],"about_ca_topic_score_codex":0.0010096849,"about_ca_topic_score_gemma":0.0030091745,"teacher_disagreement_score":0.9524225,"about_ca_system_score_codex":0.0006062895,"about_ca_system_score_gemma":0.00028745993,"threshold_uncertainty_score":0.99995834},"labels":[],"label_agreement":null},{"id":"W2110009468","doi":"","title":"A new operational interpretation of relative entropy and trace distance between quantum states","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Alice and Bob; Kullback–Leibler divergence; Quantum state; Quantum; Quantum mechanics; Mathematics; Quantum information science; Entropy (arrow of time); Quantum information; Physics; Theoretical physics; Discrete mathematics; Statistics","score_opus":0.03678183701581302,"score_gpt":0.19807151372215862,"score_spread":0.16128967670634559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110009468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17778392,0.00009430775,0.82119554,0.00021058164,0.0002090559,0.00025564496,0.000027778333,0.00008185011,0.00014131938],"genre_scores_gemma":[0.9758626,0.000048933965,0.023712596,0.000019991787,0.00006505921,6.077652e-7,0.000028810944,0.000009969096,0.00025142898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980648,0.00026595773,0.00031836494,0.0009939019,0.00013914712,0.00021780294],"domain_scores_gemma":[0.9980258,0.0005372358,0.00035735586,0.000682265,0.00023578435,0.00016160516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003066662,0.00027317114,0.00043568216,0.00016621745,0.00008841221,0.000108987464,0.0009934786,0.00017358719,0.00001364321],"category_scores_gemma":[0.00008097481,0.00030156763,0.00012594457,0.0003187987,0.00016187265,0.00055358425,0.0012562304,0.00040394548,0.000008891375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057570447,0.00007362223,0.024015615,0.00013601451,0.00016311831,0.000021669772,0.002772039,0.260107,0.000016926044,0.7043071,0.00012734992,0.00820198],"study_design_scores_gemma":[0.00029518307,0.000093232964,0.010202952,0.000069508336,0.000037965063,8.4512254e-7,0.000030638774,0.73719317,0.00004268571,0.2516837,0.00012629222,0.00022380911],"about_ca_topic_score_codex":0.00022119144,"about_ca_topic_score_gemma":0.000032937223,"teacher_disagreement_score":0.79807866,"about_ca_system_score_codex":0.00017240526,"about_ca_system_score_gemma":0.00022791505,"threshold_uncertainty_score":0.9999437},"labels":[],"label_agreement":null},{"id":"W2111620420","doi":"10.1109/icnn.1997.614003","title":"Parallel stochastic grammar induction","year":2002,"lang":"en","type":"article","venue":"Proceedings of International Conference on Neural Networks (ICNN'97)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Connectionism; Computer science; Grammar induction; Grammar; Formal grammar; Artificial intelligence; Algorithm; Theoretical computer science; Rule-based machine translation; Artificial neural network; Linguistics","score_opus":0.06660737094572575,"score_gpt":0.261412414901332,"score_spread":0.19480504395560624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111620420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25428906,0.0007961894,0.6707778,0.024258753,0.01026817,0.0021064205,0.000022496995,0.0015795605,0.035901587],"genre_scores_gemma":[0.98881865,0.000084030005,0.009617765,0.00033685678,0.00035654102,0.000052263695,0.000007232293,0.000021070373,0.00070559874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702626,0.000022421978,0.00065364473,0.0008868628,0.00090135704,0.0005094677],"domain_scores_gemma":[0.9977836,0.00013907792,0.00046746718,0.0002646194,0.001151955,0.00019329529],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031654953,0.0003824534,0.00037711608,0.00029851412,0.00014169562,0.00043463157,0.0020707555,0.0001741759,0.00028284552],"category_scores_gemma":[0.00019913624,0.0003626427,0.00017272231,0.00054005045,0.00017739387,0.0010922801,0.0005377277,0.00060391834,0.00009662408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017016147,0.000940611,0.0015346778,0.00006009872,0.00016306675,0.000016811055,0.0010283274,0.054919194,0.001149259,0.51821077,0.0029201347,0.4188869],"study_design_scores_gemma":[0.00047972324,0.00037443635,0.0013674443,0.00007140377,0.000009728432,0.000050058963,0.000049874525,0.9812362,0.00009929765,0.01566958,0.00024689513,0.00034534873],"about_ca_topic_score_codex":0.000021498523,"about_ca_topic_score_gemma":0.0000037766679,"teacher_disagreement_score":0.92631704,"about_ca_system_score_codex":0.00014708977,"about_ca_system_score_gemma":0.000023733544,"threshold_uncertainty_score":0.9998826},"labels":[],"label_agreement":null},{"id":"W2113648859","doi":"10.1093/logcom/exr050","title":"Functions definable by numerical set-expressions","year":2011,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Engineering and Physical Sciences Research Council","keywords":"Set (abstract data type); Computer science; Mathematics; Algorithm; Programming language","score_opus":0.05025316820857675,"score_gpt":0.2668335121783242,"score_spread":0.21658034396974743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113648859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024259353,0.00040828815,0.9727197,0.00047829116,0.00044840787,0.00006676642,0.0000014592953,0.000045874047,0.0015718153],"genre_scores_gemma":[0.8489799,0.00002154778,0.1506484,0.00019968854,0.000073450974,0.000001919347,0.0000014357042,0.0000042721335,0.000069366564],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988642,0.000121762874,0.00039163066,0.00019659568,0.00024885553,0.00017697578],"domain_scores_gemma":[0.9990373,0.00014737014,0.00030034658,0.0001368152,0.0002345837,0.00014356429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003528962,0.0001153775,0.00020777018,0.00010525283,0.00016770343,0.0000806586,0.0003122711,0.000060743845,0.000028549885],"category_scores_gemma":[0.000052791685,0.00008856498,0.00007913294,0.0002797737,0.00005053339,0.00048691232,0.00015488495,0.00020123199,0.000013462128],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023184347,0.0037033116,0.022129953,0.00011462321,0.00032085768,0.0003421441,0.013341292,0.018614918,0.0033995495,0.08737054,0.10640792,0.744023],"study_design_scores_gemma":[0.0022533454,0.003610577,0.0698737,0.00008539433,0.000100324316,0.0018257613,0.00092726375,0.4074612,0.000570191,0.5038304,0.008662868,0.00079900376],"about_ca_topic_score_codex":0.000018088851,"about_ca_topic_score_gemma":3.5157694e-7,"teacher_disagreement_score":0.82472056,"about_ca_system_score_codex":0.0000388587,"about_ca_system_score_gemma":0.000062812316,"threshold_uncertainty_score":0.3611575},"labels":[],"label_agreement":null},{"id":"W2123225485","doi":"10.1007/978-3-540-73208-2_4","title":"Information Distance and Applications","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Measure (data warehouse); Distance measures; Computer science; Artificial intelligence; Data mining","score_opus":0.014417032696940574,"score_gpt":0.24659524130601762,"score_spread":0.23217820860907704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123225485","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000093930075,0.0004576513,0.9904407,0.00041845583,0.0007100321,0.0006901062,0.0000075345747,0.00023796519,0.007028157],"genre_scores_gemma":[0.03865285,0.000086726075,0.95817316,0.0021930772,0.0006515987,0.000041327352,0.000014711098,0.00002620862,0.00016035841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969293,0.000018691051,0.0006174345,0.00095777534,0.0009045422,0.0005722653],"domain_scores_gemma":[0.9971978,0.0005036334,0.0003004987,0.0014565425,0.00033277666,0.00020876274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010636149,0.00044399797,0.00040199494,0.0007933228,0.00029721012,0.00075044046,0.0025047655,0.00027879432,0.000008762612],"category_scores_gemma":[0.00006372834,0.00042522728,0.00007671168,0.0007950102,0.00085798895,0.0014332313,0.0016510052,0.00066148787,0.00005349645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015355633,0.000012361506,0.00004631092,0.000034834185,0.0000029498972,0.0000063006655,0.00034155307,0.004547281,0.0000024542803,0.090059735,0.0000056946715,0.904939],"study_design_scores_gemma":[0.00022969044,0.000105145285,0.00052302185,0.00011432286,0.000005772556,0.000094407245,3.1905955e-7,0.53397524,0.000113455026,0.43043205,0.033654995,0.0007516007],"about_ca_topic_score_codex":0.000016610273,"about_ca_topic_score_gemma":0.00006376875,"teacher_disagreement_score":0.9041874,"about_ca_system_score_codex":0.0003353861,"about_ca_system_score_gemma":0.00031394392,"threshold_uncertainty_score":0.99981993},"labels":[],"label_agreement":null},{"id":"W2125293664","doi":"10.2178/jsl/1164060462","title":"Computability Results Used in Differential Geometry","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Mathematics; Computability; Modulo; Maxima and minima; Computability theory; Differential geometry; Recursively enumerable language; Function (biology); Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.01754326544855362,"score_gpt":0.2507667551692935,"score_spread":0.23322348972073986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125293664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79638946,0.00018094522,0.19967225,0.0014706741,0.0011535063,0.0001706577,0.0000042506767,0.00006824575,0.0008899761],"genre_scores_gemma":[0.97827244,0.00000801603,0.020973077,0.0001063298,0.0005906969,0.00000177549,0.0000018547928,0.000009653356,0.000036180383],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99624825,0.00036763586,0.0015505564,0.0004882431,0.00081001734,0.0005352821],"domain_scores_gemma":[0.9975722,0.0005688246,0.00068942696,0.0007012847,0.00030349265,0.00016480194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001704792,0.00027613365,0.0007298869,0.00058122823,0.00007972668,0.00020508007,0.0016605582,0.00016160228,0.000025791991],"category_scores_gemma":[0.0002735459,0.00021672604,0.00029678908,0.0011804951,0.00013402382,0.0005071642,0.00047803283,0.00061539945,0.000020261048],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094295485,0.017839583,0.5483577,0.00040995338,0.00030147788,0.0032803307,0.0052899825,0.08452581,0.012733574,0.13700674,0.0079208715,0.18139102],"study_design_scores_gemma":[0.0030920561,0.0004804431,0.838786,0.000045427565,0.000013435512,0.00037044068,0.00003220473,0.037274256,0.0005537444,0.11850781,0.00047298722,0.0003712128],"about_ca_topic_score_codex":0.00017047167,"about_ca_topic_score_gemma":0.0000509301,"teacher_disagreement_score":0.29042828,"about_ca_system_score_codex":0.00030083847,"about_ca_system_score_gemma":0.00017394018,"threshold_uncertainty_score":0.88378316},"labels":[],"label_agreement":null},{"id":"W2127838665","doi":"10.1145/2726935.2726936","title":"Computing at the speed of trading (keynote)","year":2015,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Parallel computing","score_opus":0.06339755363813039,"score_gpt":0.2759336428131005,"score_spread":0.21253608917497013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127838665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28968403,0.00009984145,0.68751925,0.0019420884,0.000649111,0.00018256617,5.2318524e-7,0.00020512793,0.019717472],"genre_scores_gemma":[0.93585557,5.139087e-7,0.06335178,0.0002493313,0.000098683566,4.4270192e-7,4.7074113e-7,0.0000058551145,0.00043735764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847335,0.00012762695,0.00031035222,0.0003458631,0.00046620413,0.00027663182],"domain_scores_gemma":[0.9984689,0.00039648262,0.00011045308,0.0007649251,0.00013865712,0.00012060651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001245918,0.00012655814,0.00019983885,0.000051289975,0.00010307533,0.00008872645,0.0013812926,0.0000399846,0.000037125126],"category_scores_gemma":[0.00012610141,0.00008214654,0.000086286804,0.00044769247,0.00011114597,0.00016808274,0.0011972763,0.00011004993,0.000053734704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006299055,0.0008310198,0.032573305,0.000109800036,0.00016577297,0.00007159956,0.034606896,0.032332122,0.005828644,0.21909909,0.04305179,0.63126695],"study_design_scores_gemma":[0.00034675363,0.00008792429,0.0047237515,0.0000074092654,0.000004074693,0.00004219122,0.00012735838,0.9788483,0.004871686,0.009433326,0.0013566196,0.00015061094],"about_ca_topic_score_codex":0.00013983031,"about_ca_topic_score_gemma":0.000027329159,"teacher_disagreement_score":0.94651616,"about_ca_system_score_codex":0.000111303234,"about_ca_system_score_gemma":0.00007550386,"threshold_uncertainty_score":0.33498386},"labels":[],"label_agreement":null},{"id":"W2129474691","doi":"10.1142/s179304210800133x","title":"BALANCED SETS AND THE VECTOR GAME","year":2008,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Cardinality (data modeling); Prime (order theory); Upper and lower bounds; Context (archaeology); Discrete mathematics; Factorization; Prime factor; Algorithm","score_opus":0.012523262202644094,"score_gpt":0.2620415997820041,"score_spread":0.24951833757935998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129474691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43383682,0.00064695213,0.5387368,0.013274386,0.005396283,0.00019402924,0.000021765296,0.00008092339,0.0078120446],"genre_scores_gemma":[0.98790765,0.00007118277,0.010572256,0.00085325824,0.00038853346,0.0000022164031,6.580303e-7,0.000005744572,0.00019849703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998559,0.0002668411,0.00034178674,0.00014394896,0.00056218513,0.00012621612],"domain_scores_gemma":[0.9979069,0.001120989,0.0002672999,0.00020984707,0.0004234901,0.00007143421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095488306,0.00010120449,0.00017938232,0.000060852308,0.00005905699,0.00009578336,0.0013602403,0.000032313972,0.00026000466],"category_scores_gemma":[0.00035903353,0.000063628126,0.0001254894,0.00009558907,0.00028057763,0.00037657036,0.0003157145,0.00022049602,0.00003703197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009518764,0.00045633942,0.012024361,0.000009662338,0.0007742058,0.0013282418,0.010646153,0.00047230293,0.00022348965,0.79614943,0.012266592,0.16469735],"study_design_scores_gemma":[0.005423599,0.0001193632,0.105061516,0.00007566606,0.000021075966,0.020142695,0.00010036759,0.021406993,0.00028703912,0.8269638,0.020066187,0.00033170125],"about_ca_topic_score_codex":0.000005554413,"about_ca_topic_score_gemma":8.721843e-7,"teacher_disagreement_score":0.55407083,"about_ca_system_score_codex":0.00006161446,"about_ca_system_score_gemma":0.00008444484,"threshold_uncertainty_score":0.28468686},"labels":[],"label_agreement":null},{"id":"W2131174171","doi":"10.1007/s00153-010-0219-2","title":"Relatively computably enumerable reals","year":2010,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Class (philosophy); Simple (philosophy); Real number; Set (abstract data type); Maximal set; Real line; Real analysis","score_opus":0.022615287767946794,"score_gpt":0.27566908412866226,"score_spread":0.25305379636071546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131174171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006724858,0.000015731643,0.96596116,0.001655948,0.0004048992,0.0008178067,0.000024171577,0.00040702856,0.02398838],"genre_scores_gemma":[0.16794515,0.0000014652014,0.83101773,0.00037930827,0.0001384199,0.000107014894,0.00000936275,0.000019831308,0.0003817067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763244,0.00012022562,0.000524507,0.0007299366,0.0003517772,0.0006410809],"domain_scores_gemma":[0.99538565,0.0030927625,0.00015443392,0.00097409793,0.000137019,0.00025606737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094971823,0.00028797006,0.0004755656,0.000114144634,0.00027319457,0.00017846226,0.0014606403,0.000113734575,0.00012113601],"category_scores_gemma":[0.0009938518,0.0002265081,0.00024146192,0.00028096,0.00026222155,0.00030549706,0.0006704709,0.0004812456,0.00040314873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071865616,0.00026673777,0.000046528145,0.000060841034,0.000019240251,0.000007303927,0.00048273386,0.00006968232,0.0019019704,0.98654795,0.0007558795,0.009833935],"study_design_scores_gemma":[0.00030490645,0.00021550409,0.00080781936,0.000013924021,0.0000088034585,0.000053393665,0.000008236555,0.2098953,0.0003333129,0.78512055,0.0030049244,0.0002333412],"about_ca_topic_score_codex":0.000007341763,"about_ca_topic_score_gemma":0.000007440038,"teacher_disagreement_score":0.2098256,"about_ca_system_score_codex":0.000025011299,"about_ca_system_score_gemma":0.00007392084,"threshold_uncertainty_score":0.9236732},"labels":[],"label_agreement":null},{"id":"W2131225295","doi":"10.1142/s0129054107004905","title":"INFORMATION DISTANCE AND ITS APPLICATIONS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Universality (dynamical systems); Computer science; Information theory; Theoretical computer science; Tracing; Range (aeronautics); Triangle inequality; Mathematics; Discrete mathematics; Programming language","score_opus":0.012182284036929059,"score_gpt":0.2975188154901351,"score_spread":0.28533653145320603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131225295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018403223,0.00007981578,0.9784797,0.0011458803,0.0012968283,0.00012832702,0.000003417995,0.000024205554,0.00043863748],"genre_scores_gemma":[0.74497396,0.000020029855,0.2547104,0.00012483603,0.00016203149,0.0000016732823,0.0000010415761,0.0000017180561,0.0000042966076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775726,0.000020675112,0.0007844627,0.00015644023,0.0011008659,0.0001803224],"domain_scores_gemma":[0.9954164,0.00030691107,0.0006944146,0.00027857727,0.003168103,0.00013559179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018506875,0.00009968043,0.00014789304,0.00074133294,0.00014879789,0.0004095431,0.0024959869,0.000028025659,0.00000514923],"category_scores_gemma":[0.00018645244,0.000092671165,0.00006386054,0.0008831727,0.00029111706,0.0047269235,0.0005088689,0.00012974405,0.000008415884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011989971,0.00014002582,0.0008268501,0.000010924343,0.000028492826,0.000004710665,0.00091997173,0.002280711,0.0006844893,0.36672133,0.000049692913,0.6283208],"study_design_scores_gemma":[0.0018615257,0.0005967111,0.10497521,0.00017097045,0.000024439254,0.0013853267,0.00015192133,0.73901546,0.01251598,0.088496275,0.050159227,0.0006469547],"about_ca_topic_score_codex":0.000004340306,"about_ca_topic_score_gemma":0.0000030118688,"teacher_disagreement_score":0.73673475,"about_ca_system_score_codex":0.00014693182,"about_ca_system_score_gemma":0.0003363434,"threshold_uncertainty_score":0.4638206},"labels":[],"label_agreement":null},{"id":"W2132060532","doi":"10.5281/zenodo.7948547","title":"On strings of consecutive economical numbers of arbitrary length","year":2005,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Mathematics; Combinatorics; Humanities; Art","score_opus":0.02490518529203016,"score_gpt":0.23378669341125166,"score_spread":0.20888150811922152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132060532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68614477,0.000067303874,0.097597264,0.0022172825,0.00020919192,0.00077342865,0.00018486305,0.0009829021,0.21182302],"genre_scores_gemma":[0.9925654,0.0000121272815,0.00690886,0.00011538724,0.000051796764,1.6576948e-8,0.000040948347,0.000218855,0.00008659585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843764,0.00024172226,0.00035650472,0.00042238092,0.0002849458,0.00025682614],"domain_scores_gemma":[0.9986613,0.00011957308,0.00016956795,0.0005930842,0.00032980254,0.00012668139],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005644365,0.00012214645,0.00020417826,0.0001913279,0.00031101145,0.00015301464,0.0015721294,0.00005220387,0.0017394847],"category_scores_gemma":[0.00034730104,0.00013012932,0.000073496,0.00038183058,0.00025399175,0.000304853,0.001326768,0.00021904713,0.0010398561],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016633421,0.0012216433,0.000047208894,0.00011987182,0.00013498022,0.000013863567,0.005021789,0.002185203,0.0035047298,0.53112453,0.042254582,0.41420528],"study_design_scores_gemma":[0.0036058521,0.0027730518,0.008994351,0.0001498695,0.000033111835,0.00026147507,0.00055333367,0.101411894,0.040439714,0.019677658,0.8210444,0.0010553178],"about_ca_topic_score_codex":0.000016039752,"about_ca_topic_score_gemma":2.7266822e-7,"teacher_disagreement_score":0.7787898,"about_ca_system_score_codex":0.00013553305,"about_ca_system_score_gemma":0.000010439583,"threshold_uncertainty_score":0.999738},"labels":[],"label_agreement":null},{"id":"W2133087621","doi":"10.1190/1.2000287","title":"The MIT Geophysical Analysis Group (GAG) from inception to 1954","year":2005,"lang":"en","type":"article","venue":"Geophysics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Operations research; Service (business); George (robot); Library science; Engineering; Management; Artificial intelligence","score_opus":0.007843416138880666,"score_gpt":0.22728480668304907,"score_spread":0.2194413905441684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133087621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3618826,0.00007426659,0.6339271,0.002736931,0.00042843545,0.00023522756,0.000013420316,0.00026018752,0.00044183986],"genre_scores_gemma":[0.9377533,0.000007102631,0.05964979,0.0008664212,0.0014007506,0.00004220894,0.000022987793,0.000013850548,0.0002435632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975123,0.00016019282,0.0003507508,0.00080999214,0.0006390905,0.00052767794],"domain_scores_gemma":[0.9974458,0.00047241492,0.000115700816,0.0016260261,0.00014215618,0.00019787483],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029371725,0.00025808183,0.00033688176,0.000089121415,0.0004024392,0.00042050853,0.0017712028,0.00007170909,0.000023708095],"category_scores_gemma":[0.0000417763,0.00020297233,0.0004262084,0.0020645368,0.00009265475,0.00047608424,0.00095834606,0.00025573256,0.0012826457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017093582,0.00046800618,0.0015710974,0.0000033276299,0.0004989828,0.0000057912034,0.0017891183,0.0076974523,0.0011423166,0.039054092,0.0014802099,0.9462725],"study_design_scores_gemma":[0.00037348975,0.00020206305,0.36237165,0.0000070038177,0.00028338924,0.0000011660942,0.0000483616,0.51052815,0.00038349017,0.090548895,0.034560114,0.0006922571],"about_ca_topic_score_codex":0.00067915156,"about_ca_topic_score_gemma":0.0004229018,"teacher_disagreement_score":0.94558024,"about_ca_system_score_codex":0.00015090276,"about_ca_system_score_gemma":0.000042223408,"threshold_uncertainty_score":0.99949497},"labels":[],"label_agreement":null},{"id":"W2133755883","doi":"10.7551/mitpress/7503.003.0023","title":"An Approach to Bounded Rationality","year":2007,"lang":"en","type":"article","venue":"The MIT Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"Israel Science Foundation; National Science Foundation","keywords":"Generalization; Simple (philosophy); Zero-sum game; Bounded rationality; Game theory; Computer science; Combinatorial game theory; Zero (linguistics); Mathematical economics; Nash equilibrium; Property (philosophy); Repeated game; Strategy; Sequential game; Bounded function; Computation; Mathematics; Artificial intelligence; Algorithm","score_opus":0.056561382687470366,"score_gpt":0.2941934844092296,"score_spread":0.23763210172175925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133755883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02277074,0.000032380613,0.87708926,0.00016339209,0.00025189793,0.0004767114,0.0000020458328,0.0002684575,0.09894509],"genre_scores_gemma":[0.84882885,1.4942675e-7,0.14836997,0.0008830882,0.00027495183,0.00004247269,0.0000022927927,0.000011094641,0.0015871462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982207,0.00020195977,0.00026494992,0.0005019288,0.0004381206,0.0003723631],"domain_scores_gemma":[0.99796367,0.00019623397,0.000059980208,0.0014873821,0.00011986697,0.00017286462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018832391,0.00015305927,0.00014614851,0.0000427201,0.00024528985,0.00032372616,0.0020782445,0.000055279044,0.000002472693],"category_scores_gemma":[0.000037885966,0.0001103775,0.00006129562,0.000070778144,0.0001073825,0.00016271744,0.0005360489,0.00016347335,0.000014393781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003247141,0.00032684504,0.00012231398,0.000017299699,0.000034130713,0.000005428059,0.00743245,0.0012419879,0.0014014821,0.8722097,0.0004827628,0.11669311],"study_design_scores_gemma":[0.0014651823,0.000497721,0.072935246,0.000020916905,0.000053951982,0.00013385972,0.00017688714,0.47159126,0.04171458,0.3004052,0.10931628,0.001688931],"about_ca_topic_score_codex":0.00024740567,"about_ca_topic_score_gemma":0.000031719133,"teacher_disagreement_score":0.8260581,"about_ca_system_score_codex":0.000059086375,"about_ca_system_score_gemma":0.000051007864,"threshold_uncertainty_score":0.45010638},"labels":[],"label_agreement":null},{"id":"W2135224290","doi":"","title":"A Representation Theorem for Domains with Discrete and Continuous Variables","year":2001,"lang":"en","type":"article","venue":"Érudit documents and data repository (Érudit Consortium, University of Montreal)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Representation theorem; Mathematics; Representation (politics); Generalization; Axiom; Brouwer fixed-point theorem; Order (exchange); Fundamental theorem; Discrete mathematics; Danskin's theorem; Pure mathematics; Algebra over a field; Fixed-point theorem; Mathematical analysis","score_opus":0.0120707649566475,"score_gpt":0.22999942660698566,"score_spread":0.21792866165033817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135224290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33089384,0.0010100891,0.65769756,0.0016477292,0.0003812392,0.001555848,0.00031525682,0.00024108542,0.0062573375],"genre_scores_gemma":[0.94894737,0.0008676721,0.048172366,0.00005173124,0.00009674405,0.000003949941,0.00014429263,0.00001674525,0.0016991025],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796605,0.00014397466,0.0002833397,0.0009985404,0.00030182998,0.00030626182],"domain_scores_gemma":[0.9974517,0.00048233024,0.00034971067,0.0013522864,0.00018118705,0.0001827365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035542456,0.00023284565,0.0004198974,0.00010456702,0.0004947868,0.00017019587,0.0009425538,0.000083457104,0.0000056058025],"category_scores_gemma":[0.00006497604,0.00021430422,0.0000493412,0.00021569873,0.00040048134,0.001273328,0.0010061741,0.000093662464,4.9157296e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053341333,0.0022161575,0.31374738,0.0008316508,0.0034290927,0.004912561,0.004465156,0.00083090883,0.0037970194,0.16510765,0.037057597,0.45827067],"study_design_scores_gemma":[0.041647553,0.005781907,0.2896776,0.0009797792,0.0027623398,0.005482265,0.0068001105,0.19629183,0.0018580481,0.05792052,0.3856911,0.00510695],"about_ca_topic_score_codex":0.0043052183,"about_ca_topic_score_gemma":0.0021484974,"teacher_disagreement_score":0.61805356,"about_ca_system_score_codex":0.00009126179,"about_ca_system_score_gemma":0.00006270684,"threshold_uncertainty_score":0.87390727},"labels":[],"label_agreement":null},{"id":"W2135603567","doi":"10.15388/informatica.2011.343","title":"D-Optimal Designs: A Mathematical Programming Approach Using Cyclotomic Cosets","year":2011,"lang":"en","type":"article","venue":"Informatica","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Coset; Computer science; Mathematical theory; Order (exchange); Optimal design; Mathematical optimization; Binary number; Mathematics; Algorithm; Discrete mathematics; Arithmetic; Machine learning","score_opus":0.10006373444345172,"score_gpt":0.27112228232394814,"score_spread":0.1710585478804964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135603567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03777476,0.00001729112,0.9471525,0.000019511941,0.0001228825,0.00071740284,0.0000012100742,0.0005110192,0.013683401],"genre_scores_gemma":[0.25701684,5.929629e-7,0.7427953,0.00008599004,0.000029425986,0.00004840211,0.0000014667465,0.000011630692,0.000010348366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976713,0.00009792754,0.0007497497,0.00032411015,0.0004853941,0.000671531],"domain_scores_gemma":[0.99836135,0.00016349606,0.00020007485,0.000933677,0.000111053414,0.0002303456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010145422,0.00028258885,0.00036385655,0.00017544051,0.00018185792,0.00031524408,0.0014260905,0.00012123229,0.000052095573],"category_scores_gemma":[0.00015191204,0.00024082282,0.00013574859,0.00047767977,0.00016876073,0.0013909626,0.00075731863,0.00025072493,0.00027488417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007708069,0.0034213434,0.000999919,0.0017047254,0.00031654318,0.00013272835,0.12371418,0.0051965415,0.0002551531,0.29435322,0.00039917752,0.5694294],"study_design_scores_gemma":[0.00027570355,0.00011087828,0.00022784843,0.000034455687,0.0000158317,0.00035107537,0.0002467842,0.98829436,0.0003055743,0.009557456,0.000244583,0.00033544214],"about_ca_topic_score_codex":0.000015165384,"about_ca_topic_score_gemma":2.8818857e-7,"teacher_disagreement_score":0.98309785,"about_ca_system_score_codex":0.00012064081,"about_ca_system_score_gemma":0.00014057614,"threshold_uncertainty_score":0.98204696},"labels":[],"label_agreement":null},{"id":"W2135833138","doi":"10.70930/tac/eni8t145","title":"Topos theoretic aspects of semigroup actions","year":2010,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Functor; Topos theory; Adjunction; Semigroup; Pure mathematics; Tensor product; Inverse semigroup; Sheaf; Krohn–Rhodes theory; Special classes of semigroups; Product (mathematics); Bicyclic semigroup; Unitary state; Algebra over a field","score_opus":0.008040624050359924,"score_gpt":0.2471267730064971,"score_spread":0.23908614895613717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135833138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10270281,0.00014586253,0.8725823,0.0003095509,0.00011793482,0.00033239106,0.000008648928,0.00010879834,0.023691671],"genre_scores_gemma":[0.990181,0.000019027968,0.009533127,0.000020057207,0.00005738655,0.00007484747,0.0000023987268,0.000005014373,0.00010709517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922657,0.00006922791,0.0002275104,0.00023505632,0.00012005346,0.00012159673],"domain_scores_gemma":[0.99831074,0.00059162086,0.00012609024,0.0007713073,0.00014503651,0.000055204666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005872452,0.00009990003,0.00016749793,0.00008006263,0.0001286044,0.00003088651,0.00058734627,0.000057438046,0.000042323354],"category_scores_gemma":[0.00006834588,0.00008733619,0.00004650444,0.0003573506,0.00065830344,0.00018326414,0.00020342784,0.00012675197,0.0000044240605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050578506,0.00008164873,0.000083337516,0.0000271286,0.000008855835,1.05609665e-7,0.0005420341,0.000007827572,0.0081043085,0.9623294,0.000007959342,0.028802376],"study_design_scores_gemma":[0.00008099258,0.000039902734,0.0009779637,0.0000024610074,0.000012172533,0.000013129309,0.00018448739,0.00034366944,0.045631297,0.9507916,0.0018357633,0.00008657778],"about_ca_topic_score_codex":0.00001187233,"about_ca_topic_score_gemma":0.000011546259,"teacher_disagreement_score":0.88747823,"about_ca_system_score_codex":0.000005241675,"about_ca_system_score_gemma":0.000055656044,"threshold_uncertainty_score":0.35614666},"labels":[],"label_agreement":null},{"id":"W2136273143","doi":"10.2178/jsl.7801130","title":"Random reals, the rainbow Ramsey theorem, and arithmetic conservation","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rainbow; Ramsey's theorem; Mathematics; Ramsey theory; Section (typography); Discrete mathematics; Base (topology); Order (exchange); Combinatorics; Ran; Arithmetic; Computer science","score_opus":0.014036435300935724,"score_gpt":0.22707625445158258,"score_spread":0.21303981915064685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136273143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48856324,0.0023648052,0.43656212,0.06752932,0.0013883708,0.0009678455,0.0000013163746,0.00011396465,0.0025090333],"genre_scores_gemma":[0.9685496,0.00019193285,0.027989646,0.0028476054,0.00030911408,0.000010858093,3.249681e-7,0.000008762628,0.00009216558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792385,0.00044709,0.00064229436,0.00023813189,0.00045455946,0.00029408804],"domain_scores_gemma":[0.99729973,0.0010877369,0.0005044583,0.00048355805,0.0004744121,0.0001501309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002240595,0.00018479921,0.00042132073,0.00013911302,0.00018216035,0.00042236265,0.0010548563,0.0000871256,0.000048034624],"category_scores_gemma":[0.00055373454,0.0001013414,0.00013932004,0.00039535106,0.000244475,0.0005926597,0.0002831381,0.00036951632,0.000025858246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017425008,0.00094493537,0.020863162,0.00014458678,0.00046891192,0.0002046714,0.010956509,0.0014350835,0.004571101,0.38719073,0.022092005,0.55095404],"study_design_scores_gemma":[0.0028625978,0.00047820897,0.14185353,0.000053840628,0.00004494045,0.0017384249,0.00025680024,0.07810865,0.00019671228,0.7716517,0.0024486226,0.00030601033],"about_ca_topic_score_codex":0.00008810585,"about_ca_topic_score_gemma":0.0000032907042,"teacher_disagreement_score":0.55064803,"about_ca_system_score_codex":0.000054631262,"about_ca_system_score_gemma":0.00011546191,"threshold_uncertainty_score":0.41325822},"labels":[],"label_agreement":null},{"id":"W2136323716","doi":"10.37236/358","title":"Yet Another Hat Game","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorial game theory; Publicity; Game theory; Sequential game; Mathematical economics; Mathematics; Simple (philosophy); Argument (complex analysis); Computer science; Epistemology","score_opus":0.00525230628632309,"score_gpt":0.21575739318894596,"score_spread":0.21050508690262287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136323716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3142592,0.0017939534,0.6692267,0.0069418685,0.0054432834,0.00021975658,4.2569607e-7,0.00010675232,0.002008035],"genre_scores_gemma":[0.99838865,0.000097220945,0.000669965,0.00029237595,0.0002066503,0.0000017282317,1.0171609e-7,0.000016786737,0.0003265176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978392,0.00017200463,0.000450521,0.00020117182,0.00064580864,0.0006912674],"domain_scores_gemma":[0.99787307,0.000395164,0.00041188128,0.00085275027,0.00036742742,0.000099727535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00217143,0.00018914577,0.00029344592,0.00012252467,0.00012487125,0.00017445812,0.0028802843,0.0000939992,0.000029639448],"category_scores_gemma":[0.00018846567,0.00012426199,0.00018646411,0.00063988974,0.00010912978,0.00041110849,0.0002884293,0.0016034489,0.000029964413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009875914,0.00019024771,0.00025119618,0.0000035431992,0.000042324456,0.000012679153,0.00040194034,0.000055176126,0.0012936678,0.988001,0.000669672,0.00906871],"study_design_scores_gemma":[0.00065150566,0.0005440653,0.0010982235,0.000006782571,0.000018245177,0.0006749188,0.000014504346,0.005406246,0.002585731,0.9588507,0.029969083,0.00018001742],"about_ca_topic_score_codex":0.0000071688605,"about_ca_topic_score_gemma":0.00001413203,"teacher_disagreement_score":0.6841295,"about_ca_system_score_codex":0.00019876174,"about_ca_system_score_gemma":0.0006368773,"threshold_uncertainty_score":0.6966277},"labels":[],"label_agreement":null},{"id":"W2137042120","doi":"10.1007/s11390-008-9152-9","title":"New Information Distance Measure and Its Application in Question Answering System","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Question answering; Measure (data warehouse); Construct (python library); Ranking (information retrieval); Theory of computation; Information retrieval; Theoretical computer science; Algorithm; Data mining; Programming language","score_opus":0.0076057241386548345,"score_gpt":0.21490953061850027,"score_spread":0.20730380647984542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137042120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18316118,0.00036298868,0.81460875,0.0014375568,0.00023246683,0.00010780364,1.2985966e-7,0.000065971464,0.00002317019],"genre_scores_gemma":[0.89864284,0.00005514123,0.10121772,0.00003478732,0.000045462173,0.0000018054002,5.64264e-8,0.0000014676123,7.2404623e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987609,0.000024813662,0.00040189605,0.00020566488,0.0004144927,0.00019224708],"domain_scores_gemma":[0.99884194,0.000031006915,0.0002759423,0.00021835447,0.00054005295,0.00009273126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010302191,0.000094919444,0.00019449616,0.00078153,0.0001493444,0.000100990415,0.0007327016,0.000076725875,8.489349e-8],"category_scores_gemma":[0.00006609865,0.00008258653,0.000014414081,0.0016462251,0.00016420937,0.0023573658,0.00030074277,0.00020242382,0.0000014567969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066122366,0.000028147317,0.009243601,0.000041652223,0.0000039484794,0.000028285089,0.0007181729,0.0005294476,0.0010976042,0.1517832,0.000032898675,0.8364864],"study_design_scores_gemma":[0.00069673255,0.0003873292,0.049215205,0.00015272181,0.0000035311168,0.0033082846,0.000050251467,0.9344131,0.0017276461,0.008767443,0.0010620031,0.00021580834],"about_ca_topic_score_codex":0.0000099397885,"about_ca_topic_score_gemma":0.000004948796,"teacher_disagreement_score":0.9338836,"about_ca_system_score_codex":0.00014341646,"about_ca_system_score_gemma":0.00026235203,"threshold_uncertainty_score":0.3367781},"labels":[],"label_agreement":null},{"id":"W2138429996","doi":"10.1007/978-3-642-03073-4_3","title":"Structures of Some Strong Reducibilities","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computability; Computer science; Aside; Degree (music); Theoretical computer science; Philosophy; Physics; Linguistics","score_opus":0.02196815810384595,"score_gpt":0.2561865649574795,"score_spread":0.23421840685363354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138429996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058581785,0.0013614875,0.99124837,0.0006589409,0.0024209043,0.00056282344,0.000012910588,0.0002524619,0.00289628],"genre_scores_gemma":[0.2859267,0.000054571894,0.71165556,0.0007871976,0.0010592121,0.0000066022644,0.000006643963,0.000048153834,0.0004554024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936172,0.000083715335,0.0010745698,0.002566527,0.001693209,0.00096478144],"domain_scores_gemma":[0.99464506,0.00080293836,0.0005698475,0.003287572,0.00045810762,0.0002364759],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013302227,0.00082015654,0.0011226091,0.0011772858,0.0002155191,0.00044254062,0.0061099613,0.0004554566,0.000038767375],"category_scores_gemma":[0.00022802125,0.0007432644,0.0003091393,0.0007099926,0.0016947059,0.0010017246,0.0022812556,0.001071956,0.000011674071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057198076,0.00004513654,0.000030010939,0.00006803824,0.000013637372,0.000044362154,0.0006994686,0.040491227,0.00011958302,0.148324,0.000015452257,0.81014335],"study_design_scores_gemma":[0.00022745584,0.00039895385,0.00060535123,0.00021027954,0.000009281314,0.00006505715,4.2253615e-7,0.17314872,0.002638596,0.8216123,0.0003534888,0.00073006685],"about_ca_topic_score_codex":0.00005284736,"about_ca_topic_score_gemma":0.0000376782,"teacher_disagreement_score":0.8094133,"about_ca_system_score_codex":0.0004677497,"about_ca_system_score_gemma":0.000990715,"threshold_uncertainty_score":0.9995018},"labels":[],"label_agreement":null},{"id":"W2138675614","doi":"10.1090/s0002-9939-01-06136-6","title":"Sums of numbers with small partial quotients","year":2001,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.017459139320200438,"score_gpt":0.23441456649287054,"score_spread":0.2169554271726701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138675614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9069762,0.000007598581,0.0888604,0.000991578,0.000043819728,0.00029715538,0.000001365758,0.00009350085,0.002728385],"genre_scores_gemma":[0.75508654,0.0000060303832,0.2446282,0.00015884456,0.000030799372,0.000013784345,9.5126204e-8,0.000012151115,0.000063570966],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821997,0.0000134979955,0.00041892464,0.0003728486,0.0006036231,0.00037115536],"domain_scores_gemma":[0.9984806,0.00017360933,0.0005879645,0.00034488703,0.00029962035,0.0001132811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046421113,0.00019385612,0.0004853313,0.000019115681,0.000086347594,0.000051480532,0.0015524124,0.000037344667,0.000012118661],"category_scores_gemma":[0.00014221382,0.0001196102,0.00031074937,0.0010424127,0.00096930156,0.0001801096,0.0006980125,0.00017725141,0.0000056542717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028413953,0.0050309785,0.46080408,0.0022637062,0.0011096438,0.0000043648133,0.03898983,0.00028338013,0.022116065,0.40163785,0.0040177573,0.06345819],"study_design_scores_gemma":[0.0036077118,0.00366401,0.102248,0.00096611865,0.00042866418,0.00038172118,0.009500661,0.3425072,0.07780357,0.4544278,0.0019961596,0.0024683604],"about_ca_topic_score_codex":0.000064426,"about_ca_topic_score_gemma":0.0000011697413,"teacher_disagreement_score":0.3585561,"about_ca_system_score_codex":0.00005821041,"about_ca_system_score_gemma":0.000046071662,"threshold_uncertainty_score":0.48775625},"labels":[],"label_agreement":null},{"id":"W2139032973","doi":"10.1145/3321699","title":"On the Computability of Conditional Probability","year":2019,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Naval Research Global; Army Research Office; Office of Naval Research; Defense Advanced Research Projects Agency; John Templeton Foundation; National Science Foundation","keywords":"Conditional probability distribution; Inference; Computability; Joint probability distribution; Regular conditional probability; Conditional probability; Probabilistic logic; Computer science; Conditional variance; Probability distribution; Mathematics; Fiducial inference; Bayesian network; Frequentist inference; Theoretical computer science; Artificial intelligence; Bayesian inference; Posterior probability; Bayesian probability; Econometrics; Statistics; Autoregressive conditional heteroskedasticity","score_opus":0.024525860751700435,"score_gpt":0.2397436997901926,"score_spread":0.21521783903849218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139032973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95923847,0.000031493397,0.018841455,0.019852087,0.0012054761,0.0003565767,0.0000051847683,0.0000145004815,0.000454772],"genre_scores_gemma":[0.9833047,7.6589896e-7,0.016072216,0.0004994948,0.00008965466,0.0000013549055,1.4193961e-7,0.000003923995,0.000027778866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773157,0.00049143983,0.00058884046,0.00021292758,0.00079934247,0.00017590425],"domain_scores_gemma":[0.9938651,0.0022330773,0.000641035,0.002733657,0.00046791023,0.000059239064],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002580513,0.00012522539,0.00029452884,0.000044910063,0.00009048981,0.000055180124,0.005999052,0.00004893986,0.000117158124],"category_scores_gemma":[0.0024813712,0.000060020695,0.0003438161,0.0003374401,0.00020841269,0.00021750297,0.001749228,0.00043230967,0.000025916092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003207915,0.0042248596,0.20313498,0.0002915794,0.00043471216,0.000014280624,0.002963485,0.0869167,0.004472645,0.65212876,0.025033766,0.02006346],"study_design_scores_gemma":[0.0003016799,0.00028100732,0.20157726,0.000030835512,0.0000075430744,0.00006335497,0.000013548105,0.011370163,0.0012798936,0.7846275,0.0003729443,0.00007425504],"about_ca_topic_score_codex":0.000005971735,"about_ca_topic_score_gemma":0.000001718934,"teacher_disagreement_score":0.13249879,"about_ca_system_score_codex":0.00013010591,"about_ca_system_score_gemma":0.00021631335,"threshold_uncertainty_score":0.999379},"labels":[],"label_agreement":null},{"id":"W2142521183","doi":"10.1007/978-0-387-49820-1_3","title":"Algorithmic Prefix Complexity","year":2008,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Kolmogorov complexity; Computer science; Theoretical computer science; Algorithmic complexity; Development (topology); Mathematics; Mathematical economics; Algorithm; Philosophy; Linguistics","score_opus":0.05284196442509746,"score_gpt":0.2678541476532553,"score_spread":0.21501218322815785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142521183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020850962,0.0007070806,0.9099904,0.0006249901,0.004266685,0.0010795395,0.000020162368,0.0009436486,0.082159035],"genre_scores_gemma":[0.010370558,0.00025758904,0.96586233,0.0012240366,0.0013288446,0.000039296654,0.000012959663,0.00010568363,0.02079872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910849,0.00010009802,0.0012679747,0.0035555528,0.002489755,0.0015017575],"domain_scores_gemma":[0.9939468,0.0003802357,0.000546655,0.0040364317,0.00055266486,0.0005372281],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017705202,0.0010627727,0.0011996041,0.0014674364,0.0006243341,0.0007184834,0.010695362,0.00043600862,0.000102468955],"category_scores_gemma":[0.000053853808,0.0010747849,0.0003320191,0.0011526298,0.0034341088,0.0014665552,0.0071953135,0.0014010975,0.00064802147],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063010853,0.00024548208,0.00006325681,0.00007013106,0.000024919354,0.0007708041,0.0012434401,0.0018651986,0.000015407826,0.18361284,0.0035529796,0.80852926],"study_design_scores_gemma":[0.00071939797,0.0003984995,0.002618707,0.0003033108,0.000009306546,0.0007888834,8.809038e-7,0.7510956,0.000081315775,0.1980767,0.04393662,0.001970754],"about_ca_topic_score_codex":0.00007353053,"about_ca_topic_score_gemma":0.00005574264,"teacher_disagreement_score":0.8065585,"about_ca_system_score_codex":0.001041466,"about_ca_system_score_gemma":0.0014265366,"threshold_uncertainty_score":0.99927795},"labels":[],"label_agreement":null},{"id":"W2145862486","doi":"10.1017/s0960129506005238","title":"A lambda calculus for quantum computation with classical control","year":2006,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":182,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Dalhousie University","funders":"","keywords":"Church encoding; Dependent type; Typed lambda calculus; Computer science; Simply typed lambda calculus; System F; Lambda calculus; Curry–Howard correspondence; Calculus (dental); Linear logic; Programming language; Type (biology); Operational semantics; Theoretical computer science; Quantum; Lambda; Quantum computer; Semantics (computer science); Algebra over a field; Mathematics; Pure mathematics; Quantum mechanics; Physics","score_opus":0.011175637365528433,"score_gpt":0.2579324113655679,"score_spread":0.24675677400003945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145862486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032838657,0.000025357434,0.964104,0.0012198471,0.00047779636,0.00088097196,0.0000051517163,0.00026285177,0.00018538204],"genre_scores_gemma":[0.57785225,9.228505e-8,0.42175987,0.00019574443,0.00013909211,0.00003801921,0.0000013314163,0.00000955214,0.000004050119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960965,0.00010434221,0.0006579804,0.0011927711,0.0010544528,0.0008939415],"domain_scores_gemma":[0.9975693,0.000992396,0.00017639012,0.0007592079,0.0003030552,0.00019961059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010598715,0.0003567616,0.0005211517,0.000293173,0.00031416563,0.0007333518,0.0020352365,0.00008890084,0.0000067489436],"category_scores_gemma":[0.00011501706,0.00025956618,0.00010890751,0.0013494982,0.0009177262,0.0006327474,0.0005085998,0.00024611477,0.000009828777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029366525,0.00027415509,0.0005778962,0.00007640645,0.000007058761,0.000048597125,0.00021451812,0.05172312,0.00017295762,0.8888628,0.00021119135,0.057801936],"study_design_scores_gemma":[0.0008254644,0.00016507681,0.0069734133,0.000021580865,0.0000041003505,0.00008840351,0.0000026143066,0.6177821,0.0001299806,0.37373206,0.000045203895,0.00023000326],"about_ca_topic_score_codex":0.000030876596,"about_ca_topic_score_gemma":0.000027339225,"teacher_disagreement_score":0.566059,"about_ca_system_score_codex":0.00023729834,"about_ca_system_score_gemma":0.00023891435,"threshold_uncertainty_score":0.99998564},"labels":[],"label_agreement":null},{"id":"W2146051038","doi":"10.1142/s0129054108005954","title":"COMPLEXITY, INFORMATION, ENERGY","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Connection (principal bundle); Computer science; Energy (signal processing); Theoretical computer science; Mathematics","score_opus":0.034401421306920775,"score_gpt":0.28782088795968747,"score_spread":0.2534194666527667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146051038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025071794,0.000025787505,0.96796805,0.002263144,0.0036331224,0.00004835668,0.0000038027206,0.000037117967,0.0009488264],"genre_scores_gemma":[0.63756216,0.0000208345,0.36187008,0.00032199998,0.0002115463,9.1450823e-7,0.0000018430788,0.0000022023553,0.000008405994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965757,0.00005818653,0.0010182535,0.00020718914,0.0019174605,0.00022317094],"domain_scores_gemma":[0.99311596,0.00019966495,0.0008979475,0.0004782437,0.0051512783,0.00015688433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009113247,0.00013897027,0.00024260959,0.0010942385,0.00024964724,0.00035997655,0.0053314934,0.00003327082,0.00002754475],"category_scores_gemma":[0.00020278913,0.00012746899,0.00015787913,0.0011199336,0.001028602,0.0061112996,0.0009948568,0.00014002288,0.00001682721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025336112,0.000573881,0.0032693876,0.000008927384,0.0001234221,0.00006748785,0.0024571843,0.014923657,0.00062907883,0.6672218,0.0024909112,0.30820894],"study_design_scores_gemma":[0.0017744479,0.00071411056,0.10046233,0.00009480503,0.000012742943,0.005080101,0.000034510016,0.72657686,0.0057521155,0.12854324,0.030411828,0.00054287235],"about_ca_topic_score_codex":0.00005169202,"about_ca_topic_score_gemma":0.0000043225987,"teacher_disagreement_score":0.71165323,"about_ca_system_score_codex":0.00019904361,"about_ca_system_score_gemma":0.001093808,"threshold_uncertainty_score":0.990733},"labels":[],"label_agreement":null},{"id":"W2146578043","doi":"10.1007/978-3-642-39310-5_1","title":"Blum Static Complexity and Encoding Spaces","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Axiom; Computer science; Connection (principal bundle); Descriptive complexity theory; Theoretical computer science; Computational complexity theory; Discrete mathematics; Algorithm; Mathematics","score_opus":0.035875674263548485,"score_gpt":0.2571888878426765,"score_spread":0.22131321357912803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146578043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000679847,0.0005648242,0.9892175,0.0024698484,0.0018318987,0.0007570747,0.0000077157665,0.00031456692,0.0041567185],"genre_scores_gemma":[0.102782354,0.0000697367,0.8948738,0.0013817496,0.00044994586,0.000014971103,0.000004626426,0.000043903303,0.00037892527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945178,0.0000880123,0.0007070735,0.0024163737,0.001259452,0.0010112863],"domain_scores_gemma":[0.9960495,0.0010391879,0.00038129155,0.0018203076,0.00034325512,0.00036642887],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00122308,0.0007923264,0.0008784267,0.00083847414,0.0004572586,0.0017266766,0.003773644,0.00031887362,0.00008549601],"category_scores_gemma":[0.00016813872,0.00071748265,0.0001323767,0.0006697763,0.0021753048,0.001053764,0.0039155246,0.001026775,0.00009800614],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035005366,0.00006083057,0.00023150434,0.00014882337,0.000021744445,0.00010399754,0.0018309139,0.007570703,0.00010457749,0.09269823,0.00008521096,0.89713997],"study_design_scores_gemma":[0.00019023493,0.00015937915,0.00048288083,0.00018932552,0.000005639413,0.00009706949,4.2731583e-7,0.5832035,0.00013739413,0.41396233,0.00090378907,0.0006680437],"about_ca_topic_score_codex":0.00012741504,"about_ca_topic_score_gemma":0.00013562934,"teacher_disagreement_score":0.8964719,"about_ca_system_score_codex":0.00036689985,"about_ca_system_score_gemma":0.00044969723,"threshold_uncertainty_score":0.99952763},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03316757706246389,"score_gpt":0.26180800054110664,"score_spread":0.22864042347864275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149852414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22932138,0.0004865176,0.7041487,0.0019347734,0.0020764642,0.0008052591,0.0000125803535,0.00056435773,0.060649984],"genre_scores_gemma":[0.9936107,0.00006307713,0.0053833663,0.0004161059,0.000082967126,0.00004019846,8.74241e-7,0.0000059911663,0.00039674126],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99733305,0.00012222858,0.00023607782,0.00075565296,0.00090045953,0.00065252924],"domain_scores_gemma":[0.9970292,0.0012765158,0.00010861078,0.0005400751,0.0008621998,0.0001834069],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015480592,0.00016849315,0.0001419586,0.00012808248,0.0025064908,0.0004092558,0.0019906352,0.000037284215,0.000019742252],"category_scores_gemma":[0.0014685304,0.00011717814,0.000076400225,0.0020084872,0.0024072034,0.0014459667,0.0006051089,0.00019589067,0.00029556517],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030186593,0.00048060238,0.002965109,0.0000104469045,0.000026683552,0.00016483491,0.0034474912,0.000033712236,0.008504198,0.026743712,0.0008829922,0.95671004],"study_design_scores_gemma":[0.0021440242,0.0009283171,0.50325793,0.0001455052,0.00005675246,0.0014214637,0.0015224869,0.20983048,0.13847388,0.12954767,0.010665941,0.0020055687],"about_ca_topic_score_codex":0.000014817377,"about_ca_topic_score_gemma":0.000007067197,"teacher_disagreement_score":0.95470446,"about_ca_system_score_codex":0.00007619163,"about_ca_system_score_gemma":0.00048539805,"threshold_uncertainty_score":0.9987921},"labels":[],"label_agreement":null},{"id":"W2150433126","doi":"10.1098/rstb.2003.1317","title":"Abstraction and reformulation in artificial intelligence","year":2003,"lang":"en","type":"article","venue":"Philosophical Transactions of the Royal Society B Biological Sciences","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Abstraction; Realm; Computer science; Variety (cybernetics); Context (archaeology); Cognitive science; Artificial intelligence; Epistemology; Psychology; Biology; Political science","score_opus":0.08275081986302295,"score_gpt":0.292634954015071,"score_spread":0.20988413415204804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150433126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23718604,0.00009559191,0.7533322,0.007950331,0.00031958922,0.0002519027,0.0000024731999,0.000062926,0.00079896435],"genre_scores_gemma":[0.97186744,0.000028955255,0.027965365,0.0000953464,0.000027923532,0.000009337194,1.5718172e-7,0.0000016672152,0.0000037815348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839175,0.00019866665,0.00038497208,0.00046093023,0.00030977727,0.00025393543],"domain_scores_gemma":[0.9991882,0.00036802416,0.000098761,0.00023017351,0.000047456128,0.00006739511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012200094,0.00012772747,0.00017594887,0.000032894157,0.00038725013,0.00006192627,0.00064785505,0.00015315137,0.000030388004],"category_scores_gemma":[0.0001456034,0.00007496096,0.00018187873,0.0008846335,0.0009313921,0.00021741545,0.0000565176,0.00030638516,0.0000025670677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017714601,0.00094035355,0.010151666,0.000027738573,0.000023949984,0.0000010184183,0.0007452026,0.070470504,0.001413864,0.7874724,0.0000025748902,0.12873296],"study_design_scores_gemma":[0.00004789691,0.00018370285,0.019893706,0.000009912667,0.0000034806105,0.000005182754,0.00007270786,0.21752746,0.0018281934,0.7602779,0.000021172189,0.00012864519],"about_ca_topic_score_codex":0.000063072366,"about_ca_topic_score_gemma":0.000008950945,"teacher_disagreement_score":0.7346814,"about_ca_system_score_codex":0.000060483893,"about_ca_system_score_gemma":0.000044588487,"threshold_uncertainty_score":0.3431753},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03577935715460232,"score_gpt":0.328755334554809,"score_spread":0.29297597740020664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151152712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04176292,0.0012615831,0.9538164,0.0006744095,0.0001715429,0.00007400856,0.000018118637,0.000017822287,0.0022031716],"genre_scores_gemma":[0.7676089,0.00014445782,0.23189491,0.00023194648,0.0000651236,0.000001836059,9.2876866e-7,0.0000063571674,0.000045549386],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979457,0.0003172724,0.00082559744,0.00033214933,0.00025549246,0.00032375575],"domain_scores_gemma":[0.99815685,0.001090691,0.00015025923,0.00022633914,0.00012736765,0.00024852596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007357316,0.0001401594,0.0006476368,0.00026023365,0.000053124444,0.00013881792,0.0005401931,0.00011093352,0.0007711897],"category_scores_gemma":[0.00070891675,0.0001284013,0.00011403128,0.0006056633,0.00026051333,0.00015123749,0.00014541735,0.00042722782,0.000026260996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001828366,0.0014400958,0.0013011992,0.00009974018,0.0002700989,0.0026043653,0.0014020993,0.000048188966,0.0000113678525,0.3498204,0.0066562644,0.63632786],"study_design_scores_gemma":[0.0008280896,0.0002877227,0.11087715,0.000036324953,0.00007623617,0.0056363456,0.00002454136,0.07742089,0.0000016724323,0.80426526,0.00035407086,0.0001916984],"about_ca_topic_score_codex":0.000005946128,"about_ca_topic_score_gemma":0.000024903406,"teacher_disagreement_score":0.725846,"about_ca_system_score_codex":0.000023666651,"about_ca_system_score_gemma":0.000011996156,"threshold_uncertainty_score":0.8443987},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011784069883553738,"score_gpt":0.24186200937785363,"score_spread":0.2300779394942999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157945276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7492847,0.0054665403,0.13384613,0.08383866,0.0068063703,0.0010289424,0.000005641969,0.00017897681,0.019544035],"genre_scores_gemma":[0.9921049,0.00009428392,0.006612201,0.0007681902,0.00031293862,7.35507e-7,5.4351176e-8,0.000004758726,0.0001019766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976839,0.0003680973,0.00071856217,0.00018924032,0.0007044823,0.00033574147],"domain_scores_gemma":[0.99727386,0.0006267174,0.0007720922,0.0008698993,0.00035309902,0.00010435381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019468638,0.00017331986,0.00034768056,0.00007840814,0.00023800366,0.00015229413,0.0032632449,0.00007580712,0.000012158365],"category_scores_gemma":[0.00045775293,0.000077195065,0.00035427752,0.0006070921,0.00022297098,0.00023370818,0.0003152204,0.00045751987,0.0000049354016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034031076,0.0006082954,0.002129616,0.000013856956,0.00010388821,0.000042885273,0.0026463803,0.0011572387,0.0015463016,0.5166019,0.0027932741,0.4723223],"study_design_scores_gemma":[0.00086877495,0.0008670487,0.13352394,0.00006437074,0.000032769658,0.0005991025,0.00021413734,0.010248995,0.002355637,0.8459928,0.0049897954,0.00024264625],"about_ca_topic_score_codex":0.000004442471,"about_ca_topic_score_gemma":0.0000018035413,"teacher_disagreement_score":0.47207963,"about_ca_system_score_codex":0.00007466425,"about_ca_system_score_gemma":0.00020407973,"threshold_uncertainty_score":0.6063975},"labels":[],"label_agreement":null},{"id":"W2163377026","doi":"10.7202/029890ar","title":"Complexité des systèmes naturels et sous-détermination des théories : une possible limite de la modélisation","year":2009,"lang":"fr","type":"article","venue":"Nouvelles perspectives en sciences sociales","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy; Mathematics","score_opus":0.05459599171587789,"score_gpt":0.3602843762102341,"score_spread":0.30568838449435626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163377026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62788516,0.025234224,0.32053035,0.01106364,0.00093196327,0.0006172068,0.000043214775,0.00048178594,0.013212431],"genre_scores_gemma":[0.8512037,0.0015246464,0.145761,0.00027788532,0.00055914064,0.000016201679,0.000004634962,0.000021663265,0.0006311415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925662,0.0030179864,0.0006419126,0.0014218049,0.0011840165,0.0011680799],"domain_scores_gemma":[0.994927,0.0030753969,0.00044181314,0.00048252824,0.00082171377,0.0002515828],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.005126641,0.00061641017,0.0006356969,0.00045936258,0.0027227052,0.0023736975,0.0018539571,0.00049200683,0.000038883234],"category_scores_gemma":[0.0016652341,0.00061315706,0.0003397588,0.0030057125,0.012896645,0.003083171,0.00044941527,0.0006644442,0.000022313106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013633625,0.0006211049,0.0028395306,0.00007693217,0.00003778436,0.000021123735,0.29186437,0.0064234263,0.00061257335,0.6547015,0.00014057229,0.042647444],"study_design_scores_gemma":[0.00034917644,0.00059284124,0.20043148,0.00023448137,0.000040452294,0.00011746416,0.05811152,0.08947547,0.0005548191,0.6493383,0.00014806347,0.0006059279],"about_ca_topic_score_codex":0.0013134448,"about_ca_topic_score_gemma":0.00073300576,"teacher_disagreement_score":0.23375286,"about_ca_system_score_codex":0.0022891096,"about_ca_system_score_gemma":0.0030409775,"threshold_uncertainty_score":0.999632},"labels":[],"label_agreement":null},{"id":"W2163726877","doi":"10.1017/s0960129509990235","title":"Preface to special issue: Expressiveness in Concurrency 2008","year":2010,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Concurrency; Computer science; Event (particle physics); Programming language; Concurrency control","score_opus":0.012261519406126053,"score_gpt":0.2841829877159594,"score_spread":0.2719214683098333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163726877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19566183,0.000013524557,0.79797447,0.0007324599,0.003756347,0.0006013085,0.000002559596,0.00012709218,0.001130417],"genre_scores_gemma":[0.57044137,5.744183e-7,0.42823136,0.00027343005,0.0010020105,0.00002817477,3.2820284e-7,0.000009429195,0.000013331114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565434,0.00011025386,0.000710791,0.0014163665,0.0011309976,0.0009772358],"domain_scores_gemma":[0.99733067,0.00045315814,0.00011538331,0.0015254989,0.0001699913,0.0004053261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001312456,0.00035936627,0.0004957492,0.0005228919,0.00017732025,0.0006490206,0.0052809604,0.00011637824,0.00029456208],"category_scores_gemma":[0.00050855806,0.00030550995,0.00007243767,0.0024956523,0.000689102,0.00084681355,0.0029274393,0.00065830647,0.000115911316],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146001175,0.0005323839,0.004698109,0.000114994655,0.0000040798463,0.00023406009,0.006938842,0.0091761025,0.004713824,0.2946514,0.0012244041,0.6776972],"study_design_scores_gemma":[0.0005238185,0.00009654631,0.05660953,0.00007341406,0.0000015096756,0.00012731396,0.000012585243,0.5921729,0.0040585925,0.34418762,0.0015130448,0.0006231209],"about_ca_topic_score_codex":0.000026085167,"about_ca_topic_score_gemma":0.000057952948,"teacher_disagreement_score":0.6770741,"about_ca_system_score_codex":0.000142064,"about_ca_system_score_gemma":0.0002571324,"threshold_uncertainty_score":0.9999397},"labels":[],"label_agreement":null},{"id":"W2166403219","doi":"10.1002/malq.200310061","title":"On existence of complete sets for bounded reducibilities","year":2003,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Recursively enumerable language; Oracle; Mathematics; Hierarchy; Set (abstract data type); Bounded function; Combinatorics; Discrete mathematics; Computer science","score_opus":0.06315396646092529,"score_gpt":0.2998707246096498,"score_spread":0.2367167581487245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166403219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048852142,0.00003373249,0.93689144,0.0005767881,0.00029488455,0.00079957524,0.000016665474,0.00019596315,0.012338786],"genre_scores_gemma":[0.5916137,2.5239478e-7,0.4079297,0.00018847671,0.000017612294,0.00007752651,0.000001838405,0.000010998968,0.00015988151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744916,0.00021967881,0.0006906147,0.0007034935,0.00045027098,0.00048677015],"domain_scores_gemma":[0.99602246,0.0021291652,0.00018008282,0.0013413948,0.00018797863,0.0001389292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011443014,0.00026417006,0.00055613613,0.00009143884,0.00012246592,0.0001281546,0.0009387247,0.00009866047,0.000096439115],"category_scores_gemma":[0.0007101974,0.0002092788,0.00022451118,0.00025697178,0.00029091808,0.0001752596,0.00005358829,0.00013586885,0.00009717073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088817105,0.00039813173,0.0000035777712,0.00018669623,0.000012510973,0.000003307271,0.0016427581,0.000011963698,0.00014529985,0.9931144,0.00015674405,0.00431571],"study_design_scores_gemma":[0.0003998046,0.0020586362,0.000064684304,0.00004749935,0.0000081188045,0.00003389421,0.00022824765,0.03280985,0.00034615942,0.9635549,0.00021819261,0.00022996454],"about_ca_topic_score_codex":0.000003219712,"about_ca_topic_score_gemma":0.0000015309846,"teacher_disagreement_score":0.5427616,"about_ca_system_score_codex":0.000068030924,"about_ca_system_score_gemma":0.00007172885,"threshold_uncertainty_score":0.8534142},"labels":[],"label_agreement":null},{"id":"W2166523409","doi":"10.1109/lics.2007.48","title":"The Complexity of Proving the Discrete Jordan Curve Theorem","year":2007,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Disjoint sets; Combinatorics; Bounded function; Discrete mathematics; Mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.03633940887867611,"score_gpt":0.2765516258077696,"score_spread":0.2402122169290935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166523409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022768902,0.00010682679,0.94959706,0.005241018,0.00044772474,0.00043250385,0.0000014507332,0.00015587267,0.021248648],"genre_scores_gemma":[0.9571931,0.000003188544,0.042271808,0.00019062113,0.00009172317,0.000004842158,4.3744816e-7,0.0000066244825,0.00023770331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998111,0.00022515636,0.0004066621,0.00035148158,0.00046738298,0.00043827904],"domain_scores_gemma":[0.9969235,0.0013348138,0.00015799011,0.0013535599,0.00015704888,0.00007310231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037128762,0.00015331544,0.00016830691,0.000033575827,0.00046819623,0.00019765033,0.0025219063,0.000035738532,0.000016179605],"category_scores_gemma":[0.00020355944,0.00006961721,0.00012518604,0.00047116005,0.0010641566,0.00020472577,0.0011678,0.00021123434,0.000012752665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061271,0.000033369677,0.0011572777,0.000005395,0.000011456093,0.0000017706859,0.00067912956,0.000030053074,0.000071336144,0.9353377,0.00012166235,0.06254468],"study_design_scores_gemma":[0.00024249226,0.00016225538,0.08056489,0.000011198463,0.0000071201353,0.000026832768,0.00050249125,0.17845333,0.0043320796,0.73160386,0.0038300354,0.00026341775],"about_ca_topic_score_codex":0.00025426823,"about_ca_topic_score_gemma":0.00068006455,"teacher_disagreement_score":0.93442416,"about_ca_system_score_codex":0.00004629523,"about_ca_system_score_gemma":0.00006342365,"threshold_uncertainty_score":0.46863714},"labels":[],"label_agreement":null},{"id":"W2166718523","doi":"10.1007/978-94-6209-428-4_5","title":"Metastability and Metastasis","year":2013,"lang":"en","type":"book-chapter","venue":"Educational futures","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Leverage (statistics); Metastability; Context (archaeology); Epistemology; Computer science; Philosophy; History; Artificial intelligence; Physics; Quantum mechanics; Archaeology","score_opus":0.01921893486036585,"score_gpt":0.24455507534628074,"score_spread":0.22533614048591488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166718523","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012784605,0.029060945,0.033736918,0.05263508,0.012496131,0.0025252511,0.00028516707,0.0006632278,0.8673188],"genre_scores_gemma":[0.010994652,0.00035915288,0.45523593,0.0019989724,0.005175835,0.00022925073,0.00021605735,0.000112661444,0.5256775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975809,0.00006850631,0.00043780377,0.0010454096,0.0005831343,0.0002842509],"domain_scores_gemma":[0.99738646,0.0006544403,0.0002196956,0.0011386119,0.00036422227,0.00023656174],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041131928,0.00044699808,0.00046865916,0.00019921623,0.00022272077,0.00032320607,0.0010268581,0.00020467957,0.0033700406],"category_scores_gemma":[0.0001224197,0.00039508662,0.00020053372,0.00007345801,0.0002099054,0.00037002304,0.000659641,0.0004076191,0.00042379205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013689959,0.000060505747,0.000035240384,0.000044850796,0.00010151474,0.0000011386478,0.00026073746,0.00000621706,0.00000436654,0.90189725,0.027405428,0.070181385],"study_design_scores_gemma":[0.00008131693,0.000042182528,0.0060409475,0.000016577374,0.00004658617,0.000041617233,0.0000128111715,0.0002782312,0.000018522993,0.6889754,0.30399343,0.00045239014],"about_ca_topic_score_codex":0.000065445056,"about_ca_topic_score_gemma":0.000029374942,"teacher_disagreement_score":0.421499,"about_ca_system_score_codex":0.00013935292,"about_ca_system_score_gemma":0.0004884886,"threshold_uncertainty_score":0.9998501},"labels":[],"label_agreement":null},{"id":"W2167294532","doi":"10.1109/arith.2003.1207659","title":"SRT division algorithms as dynamical systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Division (mathematics); Ergodic theory; Bernoulli's principle; Division algorithm; Computer science; Dynamical systems theory; Entropy (arrow of time); Bernoulli scheme; Mathematics; Algorithm; Theoretical computer science; Arithmetic; Pure mathematics; Engineering","score_opus":0.012549311317189747,"score_gpt":0.25331415631420623,"score_spread":0.24076484499701648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167294532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027702484,0.00013561989,0.95952386,0.0014817055,0.0018393003,0.00036560942,0.0000014280554,0.0009059037,0.008044102],"genre_scores_gemma":[0.8495,0.0000055402916,0.14941595,0.00026611143,0.00016548812,0.000021372694,0.0000036130684,0.000015498677,0.0006064374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732715,0.00009662115,0.0004272773,0.00086958404,0.0007373974,0.0005419822],"domain_scores_gemma":[0.9981859,0.00014951991,0.0000774359,0.001156238,0.000153921,0.00027703814],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005180732,0.00026396097,0.000313882,0.00013465881,0.00016904641,0.0004502795,0.0015927835,0.0001377574,0.00003590925],"category_scores_gemma":[0.00008145823,0.0002146505,0.00013567624,0.00061158545,0.00008737521,0.0005605415,0.0010246268,0.00023473157,0.00091168104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006597376,0.0008997795,0.0008497588,0.000058060632,0.00004897968,0.00025195003,0.0007295545,0.035902068,0.0004944966,0.80199456,0.0004683426,0.15829587],"study_design_scores_gemma":[0.0008796653,0.00040902424,0.0056175655,0.000039432107,0.000005638638,0.00022310573,0.00005351794,0.92752826,0.00048038614,0.062016122,0.0022000289,0.0005472753],"about_ca_topic_score_codex":0.00081603584,"about_ca_topic_score_gemma":0.000017562355,"teacher_disagreement_score":0.8916262,"about_ca_system_score_codex":0.00030258708,"about_ca_system_score_gemma":0.00015440214,"threshold_uncertainty_score":0.99986625},"labels":[],"label_agreement":null},{"id":"W2167990854","doi":"10.1109/wcica.2002.1020788","title":"From modern philosophy to intelligent robot","year":2003,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Embodied cognition; Robot; Computer science; Mobile robot; Artificial intelligence; Artificial life; Interpretation (philosophy); Philosophy of design; Competence (human resources); Action (physics); Human–computer interaction; Epistemology; Philosophy of sport; Philosophy; Psychology","score_opus":0.037430437883573024,"score_gpt":0.2600856880970937,"score_spread":0.22265525021352067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167990854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037125766,0.00008502836,0.9692214,0.00325884,0.00080134283,0.00023521547,0.0000016946419,0.00034690936,0.022336958],"genre_scores_gemma":[0.548292,0.000001644383,0.44992208,0.001364525,0.00012476424,0.000012206099,8.7010613e-7,0.000008344965,0.00027355755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982201,0.000098171506,0.00027023198,0.0007330306,0.00033928858,0.0003391986],"domain_scores_gemma":[0.99836016,0.00014318242,0.000034091358,0.0011169933,0.00009213268,0.00025342865],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023715141,0.00018840632,0.00020232525,0.00009306408,0.000069153844,0.00016747302,0.0011352751,0.000057152098,0.00021811819],"category_scores_gemma":[0.000081973616,0.00016546281,0.000090936046,0.0004264095,0.000038688217,0.00022255984,0.00048782397,0.00011880124,0.00079675653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072394623,0.0006190006,0.00084593997,0.00000967786,0.000051854204,0.000039951414,0.0037111873,0.027792117,0.0008981127,0.6085674,0.0023100397,0.35514745],"study_design_scores_gemma":[0.00014730802,0.00011665367,0.00044360355,0.0000072455487,0.0000033565825,0.0000068720265,0.000025390467,0.2360639,0.008184522,0.7485498,0.0060893428,0.00036197997],"about_ca_topic_score_codex":0.00021606174,"about_ca_topic_score_gemma":0.00003157538,"teacher_disagreement_score":0.5445794,"about_ca_system_score_codex":0.00008875744,"about_ca_system_score_gemma":0.00005420662,"threshold_uncertainty_score":0.9999812},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.08122447488248963,"score_gpt":0.31134140498765334,"score_spread":0.2301169301051637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170052858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042038668,0.000050935112,0.95103216,0.0013022484,0.0003552495,0.0006442316,0.000004654496,0.00036046596,0.004211409],"genre_scores_gemma":[0.83633095,0.000015245022,0.16174592,0.0010030376,0.00017726682,0.00014068985,0.000002087207,0.000018663477,0.0005661395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722916,0.00009696973,0.00054874533,0.000958233,0.00051600445,0.00065090496],"domain_scores_gemma":[0.9982058,0.00015567994,0.000053590877,0.001125386,0.00015851458,0.00030102648],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006331649,0.00026568444,0.00027413177,0.00013349914,0.00034241928,0.00037944972,0.0018128833,0.0001059929,0.0002598397],"category_scores_gemma":[0.000117462856,0.00027589506,0.00013092684,0.0010130671,0.000115568124,0.00048643097,0.00043872406,0.0003181393,0.003788523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009800346,0.0001845135,0.000046560923,0.0000051698553,0.0000042210067,0.000011646859,0.0008210417,0.14134006,0.00053015683,0.0448814,0.000064974534,0.81210047],"study_design_scores_gemma":[0.000011953037,0.00009973093,0.000033417436,0.000011341008,0.0000041861176,0.0000095897085,0.00004350496,0.8015871,0.008968265,0.18615912,0.002769652,0.00030212154],"about_ca_topic_score_codex":0.00038418622,"about_ca_topic_score_gemma":0.00018621545,"teacher_disagreement_score":0.81179833,"about_ca_system_score_codex":0.000093080336,"about_ca_system_score_gemma":0.0000934182,"threshold_uncertainty_score":0.9999693},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03545164968956798,"score_gpt":0.24781330962909723,"score_spread":0.21236165993952924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170528642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4841606,0.000114179944,0.5068468,0.007062575,0.00007737695,0.00025913297,0.0000117140335,0.0001394444,0.0013281682],"genre_scores_gemma":[0.917191,0.00007102293,0.082433484,0.000018606313,0.000019042105,1.4501384e-7,0.0000019276683,0.000004444221,0.00026027314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985682,0.00011775319,0.00008224616,0.00041643225,0.00045163886,0.00036375134],"domain_scores_gemma":[0.9988452,0.00017258502,0.00006240555,0.00053335703,0.00014390778,0.00024249745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039837978,0.00011301752,0.00022542941,0.00018714508,0.0002642065,0.000064036874,0.00093634974,0.00005978902,0.00003839674],"category_scores_gemma":[0.0000796338,0.00012745261,0.00006685607,0.0004128913,0.0006013845,0.0003372271,0.0011197929,0.00019701614,0.000037796257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004313777,0.0015464381,0.029156629,0.0006922817,0.00025831602,0.0018921419,0.021518795,0.0012891854,0.005545826,0.8129468,0.0025288884,0.12219333],"study_design_scores_gemma":[0.008663841,0.0024281421,0.48096183,0.00017621054,0.000043793298,0.00027237477,0.0026165848,0.1736781,0.0008862957,0.3185493,0.010544321,0.0011791935],"about_ca_topic_score_codex":0.0010268233,"about_ca_topic_score_gemma":0.00053058454,"teacher_disagreement_score":0.4943975,"about_ca_system_score_codex":0.00011488446,"about_ca_system_score_gemma":0.00017036719,"threshold_uncertainty_score":0.5197367},"labels":[],"label_agreement":null},{"id":"W2171572930","doi":"10.1145/2071368.2071377","title":"The Complexity of Proving the Discrete Jordan Curve Theorem","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Mathematics; Jordan curve theorem; Disjoint sets; Simple (philosophy); Context (archaeology); Discrete mathematics; Bounded function; Mathematical proof; Polynomial; Grid; Sequence (biology); Combinatorics; Mathematical analysis; Geometry","score_opus":0.05867429881197218,"score_gpt":0.2920372054230701,"score_spread":0.23336290661109793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171572930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055472218,0.0001825103,0.9813738,0.0108176675,0.00077616994,0.0004703518,0.000020974792,0.00015000414,0.00066131545],"genre_scores_gemma":[0.8762235,0.000007338725,0.12323598,0.00034119136,0.00008866405,0.00004400254,0.000005389552,0.000010637136,0.000043295462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975209,0.0005088871,0.00047353303,0.0003655212,0.00066913245,0.00046200052],"domain_scores_gemma":[0.99513745,0.003177255,0.0002113096,0.0011217877,0.00024119993,0.00011099863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012853941,0.00023464278,0.00021884457,0.00008248671,0.0011184138,0.00016255956,0.0021649816,0.00005949609,0.000034107787],"category_scores_gemma":[0.00014964456,0.00013407986,0.0002217539,0.0006246425,0.00091252313,0.00042465294,0.00011648127,0.00038436693,0.000045404555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026336736,0.00038013363,0.0003297271,0.0000156966,0.00007920732,0.0000010033616,0.0011041877,0.11864485,0.000020186058,0.80338144,0.00006952679,0.07594771],"study_design_scores_gemma":[0.000260682,0.0001656046,0.028710693,0.000012016548,0.000019642921,0.000043338296,0.00014449589,0.20485666,0.00019943398,0.76472104,0.00064824556,0.0002181567],"about_ca_topic_score_codex":0.000045599707,"about_ca_topic_score_gemma":0.000028773138,"teacher_disagreement_score":0.8706763,"about_ca_system_score_codex":0.00009375133,"about_ca_system_score_gemma":0.0001081239,"threshold_uncertainty_score":0.86020476},"labels":[],"label_agreement":null},{"id":"W2172714449","doi":"10.22329/p.v1i1.44","title":"Artificial Intelligence and the Phenomenology of Flesh","year":2006,"lang":"en","type":"article","venue":"PhaenEx","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flesh; Phenomenology (philosophy); Point (geometry); Computer science; Artificial intelligence; Turing; Cognitive science; Epistemology; Psychology; Philosophy; Mathematics","score_opus":0.027515019721610683,"score_gpt":0.24544581523074427,"score_spread":0.21793079550913358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172714449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05360793,0.00064349605,0.9381346,0.0025274,0.0003447117,0.00019109533,0.0000014119674,0.000079517464,0.004469854],"genre_scores_gemma":[0.97934556,0.000009368292,0.020387078,0.00009162285,0.0001219496,0.000008612765,4.7991165e-7,0.0000035386295,0.00003177736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989894,0.00010645174,0.00028589263,0.0002814181,0.0001445773,0.00019228284],"domain_scores_gemma":[0.99904394,0.00033769108,0.00008453995,0.0004457817,0.00006180993,0.00002626085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046918224,0.00009327759,0.0001825071,0.000050411254,0.0000719836,0.000047319925,0.00067204906,0.000033954482,0.0000144991445],"category_scores_gemma":[0.00004518994,0.00006504911,0.000042655214,0.00026619225,0.00043792356,0.000101407415,0.00042535702,0.000083563435,0.000014564701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010613332,0.00006955879,0.00028444245,0.0000062911654,0.000005607531,0.0000023556938,0.00037532888,0.00059083855,0.00015193025,0.79166526,0.000028366381,0.20680942],"study_design_scores_gemma":[0.00010352125,0.000055115906,0.0014288925,0.0000023930436,0.0000050380418,0.00001748224,0.00003000604,0.15159337,0.0037497447,0.8424741,0.00044587094,0.000094481366],"about_ca_topic_score_codex":0.00020757057,"about_ca_topic_score_gemma":0.000050969153,"teacher_disagreement_score":0.9257376,"about_ca_system_score_codex":0.000015822847,"about_ca_system_score_gemma":0.00002724286,"threshold_uncertainty_score":0.26526257},"labels":[],"label_agreement":null},{"id":"W2176914256","doi":"10.5539/jmr.v7n4p137","title":"An Embedding into a Substructure of the r.e. Turing Degrees","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Combinatorics; Turing; Substructure; Lattice (music); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.16230239434850371,"score_gpt":0.4290372230338224,"score_spread":0.2667348286853187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176914256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80841833,0.00023580209,0.1898425,0.00067011296,0.0003458029,0.00015195737,4.2522035e-7,0.000014295411,0.00032076918],"genre_scores_gemma":[0.69933736,0.000004730068,0.3004986,0.000006051176,0.0001253323,9.32694e-7,3.104154e-8,0.0000075572607,0.000019400128],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964095,0.0004342377,0.00061294774,0.00015975563,0.0020770263,0.00030655638],"domain_scores_gemma":[0.9963417,0.00060701725,0.00037023833,0.0008806775,0.0015667432,0.00023361096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069660856,0.0001095796,0.00030011742,0.00029034287,0.00012710967,0.00021386243,0.003197514,0.00007246966,0.000007991119],"category_scores_gemma":[0.0014423986,0.00006437371,0.00012722654,0.00072748424,0.00017783663,0.000477499,0.0008486936,0.0006991908,0.0000037617729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015584717,0.005730708,0.026701344,0.0031628811,0.0006242274,0.0005463644,0.3873134,0.13368061,0.07686302,0.16873428,0.007259856,0.18922746],"study_design_scores_gemma":[0.00052378746,0.000472998,0.0030095386,0.00025307434,0.000009686605,0.00055279414,0.003090234,0.569748,0.014140879,0.4078724,0.00017298161,0.00015359753],"about_ca_topic_score_codex":0.000018856788,"about_ca_topic_score_gemma":0.000015741878,"teacher_disagreement_score":0.4360674,"about_ca_system_score_codex":0.00017888269,"about_ca_system_score_gemma":0.0004337346,"threshold_uncertainty_score":0.59418297},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10071733271677694,"score_gpt":0.293439077805599,"score_spread":0.1927217450888221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177980858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04537351,0.00021922817,0.94955754,0.0010745877,0.0010438147,0.0013467465,0.00005332115,0.00053043594,0.0008008387],"genre_scores_gemma":[0.7646334,0.0000022451404,0.23446406,0.00018606462,0.0003105213,0.00017563619,0.00012140251,0.000020712841,0.00008593304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673176,0.000349907,0.000662099,0.0009895241,0.0007439409,0.00052277703],"domain_scores_gemma":[0.99698263,0.0010081459,0.00027785383,0.0007474194,0.00079085486,0.00019308463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008865595,0.00034244134,0.00047520341,0.00017421403,0.00081261696,0.00020421916,0.0011578705,0.00010523796,0.000022477449],"category_scores_gemma":[0.00020931405,0.00033080208,0.00026330602,0.00048420133,0.0004026644,0.0005059256,0.000385578,0.0002203125,0.00006280926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004538076,0.00031795914,0.00059449417,0.000095605144,0.000037349007,0.00001721736,0.00038946755,0.13000712,0.0000180685,0.8651519,0.001986024,0.0013394444],"study_design_scores_gemma":[0.0005615313,0.00022085711,0.015687013,0.000016912296,0.0000051842053,0.0002145811,0.000009552056,0.63143504,0.000015770775,0.3505,0.0010670812,0.0002665002],"about_ca_topic_score_codex":0.000055300763,"about_ca_topic_score_gemma":0.000006459121,"teacher_disagreement_score":0.7192599,"about_ca_system_score_codex":0.00022182731,"about_ca_system_score_gemma":0.00030544016,"threshold_uncertainty_score":0.9999144},"labels":[],"label_agreement":null},{"id":"W2182986991","doi":"10.1007/978-0-387-49820-1_8","title":"Physics, Information, and Computation","year":2008,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Variety (cybernetics); Focus (optics); Kolmogorov complexity; Computation; Management science; Data science; Information theory; Computer science; Statistical physics; Cognitive science; Epistemology; Theoretical physics; Physics; Mathematics; Artificial intelligence; Psychology; Algorithm; Engineering; Philosophy","score_opus":0.022200826877807216,"score_gpt":0.24737780607257004,"score_spread":0.22517697919476282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182986991","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024917052,0.00027131246,0.9751118,0.00031799616,0.0014169809,0.0004972809,0.0000061508495,0.00033712888,0.021792203],"genre_scores_gemma":[0.042388525,0.0004176409,0.95156085,0.0018601416,0.0008192187,0.000021523234,0.000025743318,0.000049456088,0.0028568876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961974,0.00003658455,0.0008103957,0.0011628659,0.0012137651,0.0005789603],"domain_scores_gemma":[0.9975148,0.00024057775,0.000419067,0.0010878706,0.00050184823,0.00023585901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008730979,0.0005097636,0.00053946936,0.000732364,0.00036746662,0.0007390512,0.002471385,0.00019768308,0.000007600553],"category_scores_gemma":[0.000033913948,0.00052390195,0.00009092132,0.0006180372,0.0012114263,0.0032543016,0.0026586817,0.00054426625,0.00016874794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016915666,0.000032234064,0.000069547576,0.00003837837,0.000006164241,0.00003315533,0.001361616,0.0052772234,0.0000012015241,0.074202485,0.0010474436,0.9179289],"study_design_scores_gemma":[0.00042016004,0.00015917026,0.0030523771,0.00013615158,0.0000040512496,0.00018711029,0.0000012186888,0.8597406,0.000016309614,0.122732185,0.012769954,0.0007807225],"about_ca_topic_score_codex":0.000028245426,"about_ca_topic_score_gemma":0.000008096986,"teacher_disagreement_score":0.9171481,"about_ca_system_score_codex":0.00032505157,"about_ca_system_score_gemma":0.00063638936,"threshold_uncertainty_score":0.9997212},"labels":[],"label_agreement":null},{"id":"W2187027130","doi":"","title":"Turing Test: An Approach to Deflning Machine Intelligence","year":2005,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Turing test; Turing; Behaviorism; Computer science; Test (biology); Cognitive science; Philosophy of mind; Artificial intelligence; Focus (optics); Symbolic artificial intelligence; Super-recursive algorithm; Turing machine; Context (archaeology); Epistemology; Artificial intelligence, situated approach; Psychology; Universal Turing machine; Philosophy; Algorithm; Metaphysics","score_opus":0.029997018281618864,"score_gpt":0.2685881159308355,"score_spread":0.23859109764921663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187027130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009297168,0.000062895786,0.965969,0.0007607569,0.00014202548,0.00022886609,7.490499e-7,0.0006633195,0.022875177],"genre_scores_gemma":[0.48692322,9.356014e-7,0.5122399,0.0005176217,0.00012056495,0.000009973715,7.7986283e-7,0.0000071992395,0.00017982115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997996,0.000058020112,0.00031866602,0.00081934367,0.00034083897,0.00046713316],"domain_scores_gemma":[0.99834996,0.00018595478,0.000043016247,0.0010361143,0.00008187783,0.00030308682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005903,0.0002107362,0.00019219678,0.00015115898,0.00014275093,0.000299128,0.001866514,0.00005285619,0.00003803488],"category_scores_gemma":[0.00013274331,0.00018395427,0.00005851978,0.0006529912,0.00003232756,0.0007474136,0.0009978904,0.00019934817,0.00020511718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017881013,0.0004990968,0.0019941425,0.000012599118,0.0000049096006,0.0000040427412,0.0017319587,0.047075044,0.00028821907,0.027489994,0.000070781556,0.92082745],"study_design_scores_gemma":[0.000055831246,0.0001111125,0.003637543,0.0000051207394,0.0000023287607,0.000052490086,0.00003737482,0.987271,0.0047381343,0.0026812006,0.001111367,0.00029648253],"about_ca_topic_score_codex":0.00009503463,"about_ca_topic_score_gemma":0.000045037734,"teacher_disagreement_score":0.940196,"about_ca_system_score_codex":0.00010562402,"about_ca_system_score_gemma":0.00003835488,"threshold_uncertainty_score":0.7501437},"labels":[],"label_agreement":null},{"id":"W2188019447","doi":"","title":"Computational complexity in analysis and geometry","year":2011,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"PSPACE; Complexity class; Theoretical computer science; Computable function; Turing machine; Generality; Computability; Computational complexity theory; Mathematics; DTIME; Descriptive complexity theory; Structural complexity theory; Bounded function; Computational resource; Average-case complexity; Computability theory; Model of computation; Computer science; Worst-case complexity; Discrete mathematics; Computation; Algorithm; Universal Turing machine","score_opus":0.050595018436828745,"score_gpt":0.3370172537598183,"score_spread":0.28642223532298955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188019447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65750945,0.00056703936,0.3325952,0.000202606,0.00059410423,0.00038853043,0.000009891656,0.00024181421,0.007891349],"genre_scores_gemma":[0.7818816,0.000027772052,0.21461892,0.0001116231,0.00007265704,0.000028378665,0.0004797798,0.000026687803,0.0027526238],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978012,0.0001430907,0.0003925604,0.0008877243,0.00044377006,0.0003316811],"domain_scores_gemma":[0.99860203,0.00023139466,0.0002377889,0.0006170828,0.0001818935,0.0001297936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043441585,0.00031954946,0.00062476745,0.0011730483,0.00009319304,0.00015831176,0.00082900934,0.00022429801,0.00014501714],"category_scores_gemma":[0.00006225836,0.00033968413,0.0001631724,0.0024971955,0.000082987,0.00018569041,0.00025382885,0.00039842626,0.00003205089],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024069309,0.002683083,0.30894822,0.0014275346,0.0033400543,0.0003831383,0.100386284,0.02053484,0.00009464685,0.2537546,0.0011259464,0.30708095],"study_design_scores_gemma":[0.00025438983,0.000048177004,0.7752038,0.000021770558,0.000096853626,0.000005366612,0.00028702134,0.17719221,0.000035361023,0.046350345,0.000080336424,0.000424347],"about_ca_topic_score_codex":0.001956749,"about_ca_topic_score_gemma":0.0038048744,"teacher_disagreement_score":0.4662556,"about_ca_system_score_codex":0.000093159535,"about_ca_system_score_gemma":0.00013105477,"threshold_uncertainty_score":0.9999055},"labels":[],"label_agreement":null},{"id":"W2193061249","doi":"10.3233/com-180087","title":"Notions of semicomputability in topological algebras over the reals","year":2018,"lang":"en","type":"article","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Topology (electrical circuits); Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.026022149103863683,"score_gpt":0.29359695994168933,"score_spread":0.26757481083782564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193061249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70508075,0.00007761255,0.2905868,0.0013889882,0.0007945384,0.000637851,0.000009251361,0.000235516,0.0011886994],"genre_scores_gemma":[0.9692721,0.000003237037,0.030095406,0.00033894298,0.00024494276,0.000021328735,0.0000026104533,0.000011875747,0.000009561598],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9949235,0.001149772,0.0012165612,0.0013459424,0.000637882,0.0007263933],"domain_scores_gemma":[0.9940721,0.002067482,0.00028428886,0.0028938379,0.00049839786,0.00018388676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035123257,0.00038459024,0.00071879185,0.00016001517,0.00024848685,0.00011423323,0.0029313988,0.00022663246,0.00020954122],"category_scores_gemma":[0.0008904217,0.0002746245,0.0003021006,0.0017807592,0.0019466147,0.00039477233,0.0022795731,0.0005534767,0.00006031792],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010263772,0.004692575,0.6943557,0.00018678664,0.00007948034,0.000020443535,0.0057978667,0.0034846393,0.0012831708,0.18028271,0.0008012932,0.108912684],"study_design_scores_gemma":[0.00037323288,0.00025040464,0.70564204,0.000014330901,0.000005705327,0.000016221775,0.00002872046,0.13683318,0.0005242745,0.15557341,0.00049023406,0.00024822427],"about_ca_topic_score_codex":0.00048603694,"about_ca_topic_score_gemma":0.00026407177,"teacher_disagreement_score":0.26419136,"about_ca_system_score_codex":0.0002970574,"about_ca_system_score_gemma":0.00023787846,"threshold_uncertainty_score":0.9999706},"labels":[],"label_agreement":null},{"id":"W2202464090","doi":"10.1109/nafips.2001.943799","title":"How to make sure that \"≅100\"+1 is ≅100 in fuzzy arithmetic: solution and its (inevitable) drawbacks","year":2002,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Aeronautics and Space Administration","keywords":"Arithmetic; Kilogram; Fuzzy logic; Property (philosophy); Associative property; Mathematics; Computer science; Discrete mathematics; Algebra over a field; Artificial intelligence; Pure mathematics; Body weight","score_opus":0.03753186461352773,"score_gpt":0.25373899310826337,"score_spread":0.21620712849473564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202464090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1300465,0.0033255983,0.7108165,0.13477886,0.0014659818,0.0018595908,0.000019199535,0.00087371544,0.01681403],"genre_scores_gemma":[0.92163926,0.00008494151,0.06926003,0.0020442023,0.000118743425,0.0000313254,0.0000013128218,0.00001826747,0.006801892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997256,0.00014103812,0.0002998246,0.0010371782,0.0005435573,0.00072244817],"domain_scores_gemma":[0.9984862,0.00018799568,0.00007202205,0.0008194036,0.00015236266,0.00028198792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006014341,0.0003222065,0.00038131766,0.0003304872,0.00013933763,0.0006809515,0.0008893982,0.00015913356,0.00013717162],"category_scores_gemma":[0.00009854648,0.00029095923,0.00007953367,0.0010124181,0.00005238868,0.00075552554,0.00096083665,0.0002531124,0.00016489447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026249269,0.0014084477,0.035151973,0.00031652348,0.00008464499,0.0002464039,0.010138844,0.0007376612,0.0017742206,0.044983156,0.038373448,0.8667584],"study_design_scores_gemma":[0.0013939674,0.00055686256,0.05605001,0.00008542589,0.000017233773,0.00016402667,0.00013777324,0.8902889,0.00374742,0.012265369,0.03397567,0.0013173567],"about_ca_topic_score_codex":0.00015701707,"about_ca_topic_score_gemma":0.00042360046,"teacher_disagreement_score":0.8895512,"about_ca_system_score_codex":0.00013940521,"about_ca_system_score_gemma":0.000029027738,"threshold_uncertainty_score":0.9999543},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07158295952416184,"score_gpt":0.2757495938322175,"score_spread":0.20416663430805565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206772957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04558259,0.000055913155,0.947787,0.0004623057,0.0019809753,0.0002496641,0.0000045075953,0.00023955316,0.0036375],"genre_scores_gemma":[0.71892416,4.642024e-7,0.28081763,0.000101412494,0.00014172797,0.000005202358,8.770476e-7,0.0000048646,0.00000367991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599755,0.00022524403,0.00055647775,0.00079139223,0.0016479904,0.00078136084],"domain_scores_gemma":[0.9969291,0.00022608474,0.00014869969,0.0011814265,0.00091774284,0.00059693673],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003978029,0.00023046388,0.00038355298,0.00023940841,0.0002585742,0.0004051701,0.00394228,0.000065606,0.000015409774],"category_scores_gemma":[0.0001883564,0.00019055505,0.00009702491,0.0014620476,0.0069449325,0.0014423445,0.0028488052,0.00021497809,0.00006376818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011764981,0.000128537,0.00017812163,0.000012791491,0.0000038464736,0.0000074987847,0.0003516662,0.0018512803,0.00010131027,0.9900587,0.0000614951,0.0072329515],"study_design_scores_gemma":[0.00026223852,0.00039862204,0.0018115431,0.000015037435,0.0000025756988,0.00009429081,0.000013755817,0.69932806,0.00044739756,0.29737937,0.00006950574,0.00017761633],"about_ca_topic_score_codex":0.000027014792,"about_ca_topic_score_gemma":8.218895e-7,"teacher_disagreement_score":0.6974768,"about_ca_system_score_codex":0.00017721437,"about_ca_system_score_gemma":0.00045725954,"threshold_uncertainty_score":0.9957576},"labels":[],"label_agreement":null},{"id":"W2210169232","doi":"10.1007/978-3-319-05654-8_4","title":"The Fundamental Theorem of Arithmetic","year":2014,"lang":"en","type":"book-chapter","venue":"Undergraduate texts in mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Arithmetic; Computer science; Mathematics","score_opus":0.01866258922750044,"score_gpt":0.24138628842954155,"score_spread":0.2227236992020411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2210169232","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006229002,0.00072451605,0.54317576,0.0018973998,0.0009582847,0.0010386712,0.000012515996,0.00023436075,0.4518962],"genre_scores_gemma":[0.08611891,0.0009555118,0.39566794,0.00030778532,0.0004090028,0.00006894774,0.000019442796,0.0003061354,0.5161463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654216,0.00010703028,0.0012361679,0.00066080975,0.00095539377,0.0004984442],"domain_scores_gemma":[0.9944819,0.0022314878,0.00081171555,0.0022137822,0.00015748963,0.0001035871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016113796,0.00057328714,0.0008464227,0.00026397416,0.00016458686,0.00023014622,0.0027521837,0.00027980952,0.000026547885],"category_scores_gemma":[0.00017945358,0.0004108136,0.00030973094,0.00015552415,0.00061336067,0.00009033303,0.0012097536,0.0006304705,0.00014046642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020019727,0.000083405095,0.0000058868036,0.00019067901,0.000049825234,0.000010708543,0.00036366767,0.00007042695,0.0000037802436,0.96704215,0.00039267473,0.031784784],"study_design_scores_gemma":[0.00025205163,0.00011615003,0.000012182131,0.000296308,0.000027020908,0.00005390204,0.000018427707,0.056436975,0.00002846216,0.93173015,0.010634147,0.0003942234],"about_ca_topic_score_codex":0.0000063350826,"about_ca_topic_score_gemma":0.00005728038,"teacher_disagreement_score":0.14750783,"about_ca_system_score_codex":0.00023271413,"about_ca_system_score_gemma":0.00014259506,"threshold_uncertainty_score":0.99983436},"labels":[],"label_agreement":null},{"id":"W2212864529","doi":"","title":"Classical-theoretical foundations of computing : a concise textbook","year":2011,"lang":"en","type":"article","venue":"Saint Mary's University Institutional Repository (Saint Mary's University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Epistemology; Calculus (dental); Management science; Mathematical economics; Mathematics education; Cognitive science; Mathematics; Philosophy; Economics; Psychology","score_opus":0.017090163856874185,"score_gpt":0.19560539375908906,"score_spread":0.17851522990221488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212864529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13251375,0.00002636136,0.6970679,0.0005342015,0.0010652354,0.00060920214,0.00003561776,0.0005393303,0.16760837],"genre_scores_gemma":[0.9438521,0.000015494938,0.05316289,0.00009523523,0.00011188355,3.3060647e-7,0.000025502253,0.000015131626,0.002721429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962109,0.00060693786,0.00052895903,0.0011545937,0.00083143456,0.00066721375],"domain_scores_gemma":[0.99659044,0.0005385486,0.00041010848,0.0011354238,0.00080443034,0.00052102376],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0005146758,0.0004679287,0.0005967739,0.00102314,0.0013748674,0.00008445295,0.002476299,0.0002990762,0.00018808946],"category_scores_gemma":[0.00014176016,0.00056154624,0.00049080193,0.001573477,0.0028866073,0.0012440869,0.0023362215,0.00060199003,0.000071561146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018792585,0.0007218857,0.003033591,0.00004902469,0.00015298427,0.0018518566,0.00082057563,0.00078781525,0.00031491433,0.98801076,0.00018476162,0.00388391],"study_design_scores_gemma":[0.01345973,0.003885849,0.14118811,0.00101003,0.0012159206,0.002595427,0.004989254,0.32871908,0.00524915,0.07459247,0.41652325,0.0065717436],"about_ca_topic_score_codex":0.0007842209,"about_ca_topic_score_gemma":0.00004026241,"teacher_disagreement_score":0.9134183,"about_ca_system_score_codex":0.0029322964,"about_ca_system_score_gemma":0.0013863214,"threshold_uncertainty_score":0.9999252},"labels":[],"label_agreement":null},{"id":"W2226273852","doi":"10.1017/s0960129516000098","title":"On computability and disintegration","year":2016,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Computability; Measure (data warehouse); Limit (mathematics); Separable space; Operator (biology); Projection (relational algebra); Uniform limit theorem; Metric space; Basis (linear algebra); Computable number; Pure mathematics; Discrete mathematics; Combinatorics; Computable analysis; Mathematical analysis; Computer science; Algorithm; Geometry","score_opus":0.013049341079782471,"score_gpt":0.2612357940108767,"score_spread":0.24818645293109423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226273852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19930439,0.000012024229,0.7982957,0.0013568548,0.00041903782,0.00023877734,0.0000013983649,0.0001468249,0.0002250321],"genre_scores_gemma":[0.7315593,0.0000010026121,0.26814306,0.00023370277,0.000048273665,0.0000064924884,1.089786e-7,0.000004865965,0.000003242671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969381,0.0001236942,0.00045734146,0.0011461307,0.0007970488,0.00053768186],"domain_scores_gemma":[0.9972471,0.0012399362,0.000089415546,0.0010789604,0.00011620914,0.00022835261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001236833,0.00026339872,0.00031714808,0.00024900236,0.00019519794,0.00042557204,0.0017812995,0.000060508646,0.000030914995],"category_scores_gemma":[0.000458381,0.00015230206,0.000053973286,0.0008388159,0.0010807087,0.0007218213,0.0012642114,0.00016598508,0.000025388807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036868662,0.00007634585,0.0007830067,0.000014219426,0.0000012695066,0.000009283691,0.00022187551,0.00019913462,0.00020615444,0.5722073,0.000020238276,0.4262575],"study_design_scores_gemma":[0.00022263333,0.0000865495,0.030707065,0.000039818893,7.2776726e-7,0.000041742693,0.000001433898,0.34461543,0.00046427207,0.6236473,0.000011994698,0.00016104658],"about_ca_topic_score_codex":0.000006052713,"about_ca_topic_score_gemma":0.0000050410213,"teacher_disagreement_score":0.5322549,"about_ca_system_score_codex":0.00021127638,"about_ca_system_score_gemma":0.000088145716,"threshold_uncertainty_score":0.6210698},"labels":[],"label_agreement":null},{"id":"W2226773755","doi":"10.1145/2815111.2815165","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computer science; Computation; Algebra over a field; Quarter (Canadian coin); Library science; Mathematics; Programming language; Pure mathematics; History","score_opus":0.1060856837289224,"score_gpt":0.34347593216693467,"score_spread":0.23739024843801226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226773755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35067156,0.00068508077,0.6338734,0.010812617,0.0014402294,0.0010485961,0.000011447791,0.00041981996,0.001037223],"genre_scores_gemma":[0.5256049,0.00008153547,0.47385445,0.00027924677,0.00006730011,0.000050977902,0.000038325863,0.000017530225,0.0000057372235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956841,0.0007283877,0.0015719517,0.00081055163,0.0005867186,0.0006183197],"domain_scores_gemma":[0.9898456,0.0015381454,0.0004124194,0.007358988,0.0005637961,0.0002811048],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015415946,0.00040055512,0.00064466393,0.00072966015,0.00013749677,0.0002348749,0.009275128,0.00018775598,0.000019200608],"category_scores_gemma":[0.00030296872,0.00042866665,0.00014071859,0.002429781,0.00031852693,0.0009929716,0.0059153424,0.0007269637,0.00007290065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003676575,0.0049648364,0.06391734,0.000079826204,0.00010717801,0.000055227665,0.016971337,0.045689456,0.000085049265,0.09806295,0.0022005104,0.76782954],"study_design_scores_gemma":[0.0018653205,0.0002951159,0.24999134,0.00013435054,0.00001210267,0.000042322026,0.000095106996,0.6397279,0.00017319819,0.10391464,0.0030399254,0.0007086887],"about_ca_topic_score_codex":0.00066323485,"about_ca_topic_score_gemma":0.0014046843,"teacher_disagreement_score":0.76712084,"about_ca_system_score_codex":0.00036893773,"about_ca_system_score_gemma":0.00041541166,"threshold_uncertainty_score":0.99981654},"labels":[],"label_agreement":null},{"id":"W22370945","doi":"10.4238/2012.february.17.4","title":"Superrecursive Hierarchies of Algorithmic Problems.","year":2005,"lang":"en","type":"article","venue":"FCS","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.011556755728297674,"score_gpt":0.22419334434387098,"score_spread":0.2126365886155733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22370945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108988024,0.0011436467,0.87494534,0.004123545,0.00096404843,0.00071040145,0.000013730963,0.0004835886,0.008627678],"genre_scores_gemma":[0.64508027,0.000034995704,0.35393447,0.00020279374,0.00032501644,0.00002750404,0.000003815221,0.000013808869,0.0003773406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984906,0.000086409294,0.00032445564,0.0004167109,0.00034435082,0.00033749672],"domain_scores_gemma":[0.9988182,0.00015634921,0.000088613044,0.00069776626,0.00014313881,0.00009591901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002929963,0.00016096674,0.00024220449,0.00014105535,0.000071811606,0.000055618424,0.001108451,0.00006180324,0.00004341286],"category_scores_gemma":[0.000044530825,0.00014757448,0.00010070266,0.00046190966,0.0001348632,0.000404806,0.0004683102,0.00016752233,0.00009146474],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074439517,0.00047499329,0.0018984806,0.0000997519,0.000056715373,0.000014908171,0.01339301,0.0067120986,0.0012742986,0.06046577,0.0033173275,0.9122852],"study_design_scores_gemma":[0.0016634066,0.0010169486,0.022011254,0.00011949099,0.000028091132,0.0001626805,0.0002149335,0.7636438,0.026469603,0.06702001,0.116415754,0.0012340352],"about_ca_topic_score_codex":0.00005588158,"about_ca_topic_score_gemma":0.000031169002,"teacher_disagreement_score":0.91105115,"about_ca_system_score_codex":0.000090009395,"about_ca_system_score_gemma":0.00011993441,"threshold_uncertainty_score":0.60179126},"labels":[],"label_agreement":null},{"id":"W2240279767","doi":"10.1215/00294527-3328401","title":"Controlling Effective Packing Dimension of Δ20 Degrees","year":2015,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Chicago","keywords":"Dimension (graph theory); Limit (mathematics); Packing dimension; Mathematics; Packing problems; Argument (complex analysis); Combinatorics; Mathematical optimization; Mathematical analysis; Minkowski–Bouligand dimension","score_opus":0.031185950556399715,"score_gpt":0.2699876248191398,"score_spread":0.23880167426274007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240279767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4458218,0.0008628597,0.5512267,0.00027167625,0.0009361231,0.0002066792,0.000002146006,0.00003852547,0.00063354394],"genre_scores_gemma":[0.92471576,0.000010807724,0.074953854,0.00010436975,0.00019947965,0.0000016463673,5.472798e-7,0.0000072782686,0.0000062559125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763274,0.00024352354,0.0007760475,0.00021877322,0.0007351801,0.00039373958],"domain_scores_gemma":[0.9970622,0.0005257256,0.0008911278,0.00034657356,0.0009379519,0.00023642204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021879382,0.00020973134,0.0006014405,0.00021034572,0.000083095074,0.00008304805,0.00089816505,0.00010480375,0.0000059861773],"category_scores_gemma":[0.00054233323,0.00014843256,0.00026288445,0.00036732483,0.000091305985,0.0012866245,0.00039880318,0.00038503946,0.000009548654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013722223,0.0016492851,0.044997755,0.00022972787,0.0005188797,0.00088252005,0.01176834,0.20635737,0.015197861,0.027812034,0.0009183902,0.6882956],"study_design_scores_gemma":[0.011829888,0.012743477,0.06911286,0.0006085255,0.0002081106,0.002340326,0.00083112967,0.80703455,0.020080509,0.0726865,0.0013657967,0.0011583283],"about_ca_topic_score_codex":0.000019950547,"about_ca_topic_score_gemma":0.000005318868,"teacher_disagreement_score":0.6871373,"about_ca_system_score_codex":0.00014982208,"about_ca_system_score_gemma":0.00014826229,"threshold_uncertainty_score":0.6052904},"labels":[],"label_agreement":null},{"id":"W2243707631","doi":"","title":"Cantor : On Ordinal Notations","year":2006,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Notation; Mathematics; Ordinal data; Statistics; Arithmetic","score_opus":0.015924192434176032,"score_gpt":0.23329862546244554,"score_spread":0.2173744330282695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243707631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025647376,0.00029192076,0.8884653,0.017825602,0.00087823096,0.00061625696,0.00007233685,0.00078589504,0.06541709],"genre_scores_gemma":[0.5368979,0.000058824415,0.4529229,0.0002822938,0.00011101639,0.00016745632,0.00034840018,0.000059431088,0.009151791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917446,0.0044999653,0.00073579984,0.0015866492,0.00084802404,0.00058496767],"domain_scores_gemma":[0.98978937,0.0022965334,0.0005682317,0.00458531,0.0024968183,0.00026374357],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0043198313,0.0005193049,0.0005034264,0.00036701057,0.00053245097,0.0010810511,0.0041225124,0.00033369957,0.000078656274],"category_scores_gemma":[0.0011971968,0.0005570412,0.0003347051,0.0007757402,0.0002534688,0.00023946184,0.0037134446,0.0010138137,0.00014355365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011946053,0.0026533424,0.0031749196,0.00023663671,0.00012741283,0.000044733617,0.00863696,0.0044985055,0.0004993996,0.6248675,0.011184491,0.34406418],"study_design_scores_gemma":[0.0013744696,0.0000037572477,0.05557807,0.002057827,0.00008451678,0.000051465555,0.000051849613,0.7788793,0.015399751,0.09650176,0.047679417,0.0023378474],"about_ca_topic_score_codex":0.0042870417,"about_ca_topic_score_gemma":0.0031704372,"teacher_disagreement_score":0.77438074,"about_ca_system_score_codex":0.00038700787,"about_ca_system_score_gemma":0.0006944506,"threshold_uncertainty_score":0.99995595},"labels":[],"label_agreement":null},{"id":"W2244997347","doi":"10.4230/lipics.csl.2012.9","title":"Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Proof complexity; Propositional variable; Computer science; Well-formed formula; Proof theory; Propositional calculus; Structural proof theory; Theoretical computer science; Calculus (dental); Mathematics; Programming language; Mathematical proof; Description logic; Intermediate logic; Medicine","score_opus":0.026254694933324902,"score_gpt":0.2601708381694452,"score_spread":0.23391614323612028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244997347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14384261,0.00033814125,0.84645516,0.0007194752,0.0024603524,0.0027381282,0.00045362447,0.000548831,0.0024436633],"genre_scores_gemma":[0.89996916,0.000008169112,0.09824147,0.0005933298,0.0005179707,0.00019999559,0.00037912402,0.000043421685,0.00004732919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957172,0.00014666338,0.0014001889,0.0004392939,0.000798588,0.0014980433],"domain_scores_gemma":[0.99685705,0.00043868012,0.0006499356,0.00092377776,0.00064871274,0.0004818331],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019353504,0.00057684595,0.00067194266,0.00027084083,0.0009544007,0.001047096,0.0012057413,0.00027359716,0.000016647009],"category_scores_gemma":[0.00022919744,0.00050213136,0.00020479996,0.0004844997,0.00030479283,0.0056821513,0.0014520463,0.00056201895,0.000029937077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018348482,0.0014622079,0.018130638,0.0026566014,0.00040878973,0.0000074889567,0.017027665,0.00065971445,0.0001071177,0.930012,0.0024799097,0.0268644],"study_design_scores_gemma":[0.0037801862,0.0006665267,0.0057016965,0.0002550941,0.00006617106,0.0013293918,0.0031635803,0.9086684,0.0005882371,0.011867839,0.06248927,0.0014236224],"about_ca_topic_score_codex":0.00006671815,"about_ca_topic_score_gemma":0.000026351876,"teacher_disagreement_score":0.91814417,"about_ca_system_score_codex":0.00029040617,"about_ca_system_score_gemma":0.00009638562,"threshold_uncertainty_score":0.9999899},"labels":[],"label_agreement":null},{"id":"W2248186100","doi":"10.1007/s11856-015-1199-z","title":"Symmetrically complete ordered sets abelian groups and fields","year":2015,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Abelian group; Elementary abelian group; Algebra over a field; Pure mathematics; Rank of an abelian group; Free abelian group; Combinatorics","score_opus":0.06204279023009924,"score_gpt":0.27805946053133945,"score_spread":0.21601667030124022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248186100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11701342,0.00052133587,0.8786842,0.0023032143,0.0005994749,0.00012467637,0.000002284651,0.000047884532,0.00070346403],"genre_scores_gemma":[0.42251882,0.000026049225,0.5769582,0.00033284503,0.00012374476,9.259159e-7,2.5514592e-7,0.000011079415,0.00002808526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980273,0.00009983907,0.0007306848,0.00018939599,0.0006891917,0.00026355687],"domain_scores_gemma":[0.99758995,0.0005703252,0.00047671815,0.00045659614,0.0005592319,0.00034717642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014261568,0.00018382416,0.00046410575,0.00025376363,0.00005998876,0.00023143114,0.0010399696,0.00009277903,0.0000039167026],"category_scores_gemma":[0.0007510815,0.00013872853,0.000105490675,0.0005166266,0.00007126078,0.00029476258,0.00042703355,0.0003058753,0.000013646081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081699014,0.005067248,0.011157687,0.0011269889,0.00077424856,0.0017614842,0.03491739,0.0028432875,0.000540026,0.37733886,0.023029316,0.54136175],"study_design_scores_gemma":[0.0025499116,0.0015579506,0.0030168602,0.00018784495,0.00006768763,0.0040351246,0.0010948594,0.49543712,0.00011521981,0.48682085,0.004533632,0.00058295816],"about_ca_topic_score_codex":0.000009176356,"about_ca_topic_score_gemma":0.000009146025,"teacher_disagreement_score":0.5407788,"about_ca_system_score_codex":0.00006531238,"about_ca_system_score_gemma":0.00012845466,"threshold_uncertainty_score":0.56571853},"labels":[],"label_agreement":null},{"id":"W2253978528","doi":"10.1017/cbo9780511615559.003","title":"The Second Incompleteness Theorem","year":2003,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Gödel's incompleteness theorems; Mathematical economics; Philosophy; Epistemology","score_opus":0.02070909646139017,"score_gpt":0.19069281112621478,"score_spread":0.16998371466482462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253978528","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031006704,0.0002913219,0.06350902,0.000116898205,0.001116668,0.00058528397,0.00009183796,0.0003284717,0.9339295],"genre_scores_gemma":[0.00033269176,0.00004634699,0.0019612422,0.00028396136,0.00014092497,0.0000015827317,0.000008286862,0.00004483629,0.9971801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971932,0.00021194015,0.0003449867,0.0011103183,0.00054404995,0.00059549947],"domain_scores_gemma":[0.9960861,0.00055944413,0.0003565087,0.0023866922,0.0003558184,0.00025542724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005082199,0.0006036457,0.00054222444,0.00015867082,0.000845759,0.0003657235,0.0040130084,0.00038434943,0.000009359251],"category_scores_gemma":[0.000020925208,0.00053954043,0.00038712952,0.00002988752,0.00067139324,0.0002065227,0.0023497245,0.00088293676,0.00003571248],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014167774,0.000009996397,9.5181343e-7,0.000039038656,0.00009251319,0.00018399341,0.000043062813,0.0000045398556,0.0000070060055,0.9732036,0.018382428,0.008018713],"study_design_scores_gemma":[0.00038278877,0.00006082178,0.000020924394,0.000041513515,0.000041295873,0.00006799683,0.000011743768,0.0013651085,0.00014820203,0.002492323,0.9947307,0.00063658017],"about_ca_topic_score_codex":0.000032121075,"about_ca_topic_score_gemma":0.000013354259,"teacher_disagreement_score":0.9763483,"about_ca_system_score_codex":0.00036740873,"about_ca_system_score_gemma":0.0002635509,"threshold_uncertainty_score":0.9997056},"labels":[],"label_agreement":null},{"id":"W2266269208","doi":"10.5948/upo9781614445180.006","title":"Finite Mathematics","year":2000,"lang":"en","type":"book-chapter","venue":"MAA spectrum","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Mathematics education; Pure mathematics; Computer science","score_opus":0.018398220697034527,"score_gpt":0.21432054496792957,"score_spread":0.19592232427089504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266269208","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006377872,0.00031108217,0.23613076,0.0012292966,0.00063399493,0.00032007298,0.00001807208,0.00058976084,0.7607606],"genre_scores_gemma":[0.0016286494,0.00029528805,0.15183781,0.000565304,0.0012332258,0.000019767223,0.00002584827,0.00016662353,0.8442275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726015,0.00002231171,0.0005737466,0.0009612364,0.00064290175,0.00053965603],"domain_scores_gemma":[0.99717563,0.00027962282,0.00023643416,0.0020916206,0.00004438035,0.00017230617],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002501635,0.0005801137,0.0006357753,0.00025779023,0.00014644495,0.00027475273,0.002130408,0.00039306626,0.0035246587],"category_scores_gemma":[0.000022181526,0.0005662911,0.00033068404,0.00010746593,0.00012656822,0.00014603478,0.0008013173,0.00069059234,0.003499275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023564337,0.00006968591,0.0000038344365,0.00006179203,0.000048394275,0.00017611946,0.0002683195,0.00015381404,9.897543e-7,0.92505926,0.0019029143,0.072252534],"study_design_scores_gemma":[0.000121733305,0.00010159957,0.00002321522,0.000064393935,0.000017863871,0.0000638771,0.0000011347852,0.028090853,0.00002130278,0.70067453,0.27029163,0.0005278784],"about_ca_topic_score_codex":0.000021069196,"about_ca_topic_score_gemma":0.000030182104,"teacher_disagreement_score":0.26838872,"about_ca_system_score_codex":0.00019197508,"about_ca_system_score_gemma":0.00011625095,"threshold_uncertainty_score":0.99967885},"labels":[],"label_agreement":null},{"id":"W2268926769","doi":"10.4171/em/291","title":"Would real analysis be complete without the fundamental theorem of calculus?","year":2015,"lang":"en","type":"preprint","venue":"Elemente der Mathematik","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University; University of Waterloo","funders":"","keywords":"Completeness (order theory); Differentiable function; Calculus (dental); Real analysis; Gödel's completeness theorem; Mathematics; Characterization (materials science); Variable (mathematics); Key (lock); Fundamental theorem of calculus; Fundamental theorem; Discrete mathematics; Pure mathematics; Computer science; Fixed-point theorem; Mathematical analysis","score_opus":0.07532331418679879,"score_gpt":0.3217630950585604,"score_spread":0.2464397808717616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268926769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08384443,0.00048117133,0.8958849,0.0036249612,0.0009058391,0.0020515013,0.00035668458,0.0004341057,0.012416419],"genre_scores_gemma":[0.89825916,0.000034919354,0.100291386,0.00047278035,0.00018491725,0.000180345,0.00015349014,0.000050809213,0.00037217655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947565,0.00053351384,0.001270767,0.0012190443,0.0015766815,0.0006434685],"domain_scores_gemma":[0.9943447,0.00032663706,0.0010860676,0.0035536024,0.00048430808,0.00020467555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029179712,0.00064369506,0.0012958818,0.00036724648,0.00018890212,0.00039222036,0.004229354,0.0003162916,0.00021295868],"category_scores_gemma":[0.000088064146,0.0004510738,0.0007677779,0.000989348,0.00035569217,0.000184385,0.0067255558,0.0010696655,0.000036148624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015479163,0.0049896557,0.039095636,0.002523708,0.025352897,0.00012009193,0.08370308,0.020161867,0.0008042173,0.7622,0.025968075,0.034925994],"study_design_scores_gemma":[0.001035927,0.00022561377,0.00569611,0.00014437313,0.0015891135,0.000032220418,0.0010176457,0.7692841,0.00047592336,0.21488012,0.0044103884,0.0012084498],"about_ca_topic_score_codex":0.00052770297,"about_ca_topic_score_gemma":0.00022655968,"teacher_disagreement_score":0.81441474,"about_ca_system_score_codex":0.00033351043,"about_ca_system_score_gemma":0.0002761418,"threshold_uncertainty_score":0.9997941},"labels":[],"label_agreement":null},{"id":"W2269014414","doi":"10.1090/memo/1208","title":"Degree Spectra of Relations on a Cone","year":2018,"lang":"en","type":"article","venue":"Memoirs of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Mathematics; Spectrum (functional analysis); Cone (formal languages); Combinatorics; Omega; Spectral line; Physics; Quantum mechanics","score_opus":0.027520027811125353,"score_gpt":0.26976516287991825,"score_spread":0.2422451350687929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269014414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1967161,0.000028393108,0.7818082,0.008330214,0.00020680454,0.00033480462,0.000007187053,0.000106947205,0.012461354],"genre_scores_gemma":[0.6234348,0.0000028833756,0.37586528,0.0003504676,0.000066754605,0.0000055320656,1.4811016e-7,0.000008830323,0.0002652968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984578,0.00011215017,0.00039927068,0.00028235652,0.0004967031,0.0002517322],"domain_scores_gemma":[0.99750215,0.0007134048,0.00038226397,0.0011723046,0.00015709024,0.000072814226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005747045,0.00013976415,0.00039706833,0.000021859472,0.00011132199,0.00001910647,0.0012753423,0.000038417045,0.000074002404],"category_scores_gemma":[0.00034542877,0.0000939649,0.00038848334,0.0008178544,0.0018967562,0.000083659404,0.0004998236,0.00017232429,0.000058356916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004070206,0.0030325556,0.0022983076,0.0002911111,0.00045329038,0.0000023059642,0.017831294,0.00033701127,0.0067057856,0.8728324,0.026398467,0.06977676],"study_design_scores_gemma":[0.00052095816,0.001169837,0.026254704,0.00015527058,0.00006433892,0.000025645026,0.0006145912,0.18741302,0.016735703,0.7659555,0.00068979285,0.00040063594],"about_ca_topic_score_codex":0.00003504581,"about_ca_topic_score_gemma":0.0000024250464,"teacher_disagreement_score":0.4267187,"about_ca_system_score_codex":0.000071220595,"about_ca_system_score_gemma":0.00006862219,"threshold_uncertainty_score":0.69886774},"labels":[],"label_agreement":null},{"id":"W2277853825","doi":"","title":"The First International Workshop on Opportunistic Discovery of Information","year":2011,"lang":"en","type":"article","venue":"UKnowledge (University of Kentucky)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Data science; Computer science; Political science","score_opus":0.028636700094227488,"score_gpt":0.20233283101678434,"score_spread":0.17369613092255687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277853825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025637604,0.00004155976,0.88012373,0.0014796965,0.001845583,0.0002765924,0.000018997458,0.00009658328,0.09047966],"genre_scores_gemma":[0.9876934,0.000071543094,0.011112527,0.000037105452,0.000031146265,3.935359e-7,0.000007965971,0.0000035035114,0.0010424084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991901,0.000039733583,0.00018677121,0.00017072157,0.0002691369,0.00014354628],"domain_scores_gemma":[0.998679,0.00021278312,0.00024431688,0.0005443509,0.00026805885,0.000051525414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003141769,0.000094598836,0.0001343014,0.0001563566,0.0001866088,0.000039561488,0.0016289701,0.000052491163,0.000042294316],"category_scores_gemma":[0.0001176428,0.00008776686,0.00010467574,0.0003008015,0.00020226548,0.0010934749,0.0006903086,0.000108243876,0.000053294792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026992967,0.000790059,0.0047938693,0.00010344186,0.00017851093,0.000022190077,0.022101643,0.00010852758,0.000035202556,0.6258547,0.009337382,0.33640456],"study_design_scores_gemma":[0.004030653,0.0012349056,0.318131,0.00062990387,0.000118628086,0.000028016164,0.009785388,0.34280118,0.00097397814,0.057624232,0.26330084,0.0013412908],"about_ca_topic_score_codex":0.000060252925,"about_ca_topic_score_gemma":0.00015311858,"teacher_disagreement_score":0.9620558,"about_ca_system_score_codex":0.00008372445,"about_ca_system_score_gemma":0.00008293411,"threshold_uncertainty_score":0.35790285},"labels":[],"label_agreement":null},{"id":"W2279493147","doi":"10.1093/logcom/exn031","title":"The Settling Time Reducibility Ordering and  Formula Sets","year":2008,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Settling; Volume (thermodynamics); Computation; Mathematics; Computer science; Settling time; Algorithm; Engineering; Physics; Thermodynamics","score_opus":0.02898311213798388,"score_gpt":0.270619726652699,"score_spread":0.24163661451471513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279493147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5704387,0.0006068668,0.42749467,0.0011025263,0.0001660054,0.000068448804,2.209746e-7,0.000022368937,0.00010022825],"genre_scores_gemma":[0.9323511,0.00012553115,0.067326844,0.00009367813,0.00008440877,6.3042313e-7,2.94397e-7,0.0000032485684,0.000014245487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888104,0.00011886718,0.00039293626,0.00020047554,0.00024826676,0.00015842514],"domain_scores_gemma":[0.9988203,0.00044501625,0.00027620676,0.00015067666,0.00022434813,0.00008341844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010468374,0.000102685735,0.00018279979,0.000056501187,0.0004134179,0.00013630169,0.00024457974,0.000040980758,0.0000010756771],"category_scores_gemma":[0.00013092393,0.00006695768,0.000049561422,0.00016685137,0.000112804104,0.00038975483,0.00018554543,0.00016541322,0.000001717328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000727346,0.00019414723,0.0066705057,0.00005080648,0.000078707744,0.00013855989,0.0049841255,0.035987828,0.0006502121,0.0049795792,0.0007644805,0.9454283],"study_design_scores_gemma":[0.0004141999,0.00031515805,0.05348057,0.00001812484,0.000008013813,0.0016462255,0.00006106203,0.84811836,0.00005018841,0.09555569,0.00021081166,0.00012157736],"about_ca_topic_score_codex":0.0000045756337,"about_ca_topic_score_gemma":8.4349426e-7,"teacher_disagreement_score":0.9453067,"about_ca_system_score_codex":0.000038086488,"about_ca_system_score_gemma":0.00006410279,"threshold_uncertainty_score":0.3179718},"labels":[],"label_agreement":null},{"id":"W2285720162","doi":"10.1086/683343","title":"Numerical Methods, Complexity, and Epistemic Hierarchies","year":2015,"lang":"en","type":"article","venue":"Philosophy of Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hierarchy; Appeal; Epistemology; Computer science; Computational complexity theory; Mathematics; Algorithm; Philosophy","score_opus":0.13951119199485482,"score_gpt":0.35953522985154696,"score_spread":0.22002403785669214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285720162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029041156,0.000649305,0.9431951,0.012069424,0.0007615329,0.00026382966,0.0000031267236,0.00021098836,0.013805537],"genre_scores_gemma":[0.5536025,0.0000033770225,0.44622216,0.00011032463,0.000050235103,0.0000031359914,1.5286895e-7,0.0000029335094,0.00000517575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974918,0.00019630209,0.00034951916,0.0007466166,0.0008253095,0.00039048467],"domain_scores_gemma":[0.99803126,0.0003032556,0.00014862449,0.0007854992,0.0003238204,0.00040752566],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026317695,0.00017072527,0.00032816094,0.00028437728,0.00021613544,0.00014485721,0.0022722008,0.000034202156,0.0000027583162],"category_scores_gemma":[0.0005179396,0.00014916924,0.00005345262,0.0016002937,0.00487083,0.000889832,0.0014788483,0.00016224611,0.000011390845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009607962,0.00016619799,0.00277953,0.00004976308,0.000006790983,0.000008028759,0.0022400785,0.00016730539,0.002261989,0.92160594,0.000051259693,0.07065348],"study_design_scores_gemma":[0.00019582036,0.00018703865,0.0081993025,0.000014882865,0.000002407006,0.000065280256,0.000023353277,0.10000879,0.0022643039,0.88873076,0.00013074119,0.00017729077],"about_ca_topic_score_codex":0.00007471972,"about_ca_topic_score_gemma":7.0702055e-7,"teacher_disagreement_score":0.52456135,"about_ca_system_score_codex":0.000057944453,"about_ca_system_score_gemma":0.00027627696,"threshold_uncertainty_score":0.99783736},"labels":[],"label_agreement":null},{"id":"W2291070285","doi":"10.1017/etds.2015.24","title":"Poly-time computability of the Feigenbaum Julia set","year":2015,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Julia set; Computability; Set (abstract data type); Computable number; Computable analysis; Mathematics; Time complexity; Polynomial; Algorithm; Discrete mathematics; Computer science; Combinatorics; Programming language; Mathematical analysis","score_opus":0.014761358879614309,"score_gpt":0.2306027538669675,"score_spread":0.2158413949873532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291070285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4770101,0.0020063978,0.51561314,0.0005213579,0.0023790358,0.00065043324,0.0000358721,0.00026757942,0.001516064],"genre_scores_gemma":[0.9981873,0.0000012860793,0.0012446316,0.00007486527,0.000117424395,0.000011205059,0.0000026617122,0.000010142481,0.00035050313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996126,0.0018561236,0.0005503827,0.0005877157,0.0005128565,0.00036694703],"domain_scores_gemma":[0.99735653,0.00084925344,0.00019097213,0.001158737,0.00014661493,0.00029789304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036095039,0.00023815816,0.00047596399,0.00004959957,0.00014754465,0.0001252859,0.0012940196,0.0001520662,0.000010790178],"category_scores_gemma":[0.00036381086,0.00015601133,0.00014229874,0.00041061765,0.0005061498,0.00019604045,0.0010670796,0.00025095927,0.000041224546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019001227,0.00055609783,0.011934595,0.00027175748,0.000113968345,0.000017160712,0.003882115,0.0031286934,0.000400501,0.95217973,0.00082538946,0.026499955],"study_design_scores_gemma":[0.00077627914,0.00025333566,0.015088635,0.000071004455,0.000023278513,0.0001632053,0.00020551919,0.8037837,0.000081752325,0.17790179,0.0012492054,0.0004023046],"about_ca_topic_score_codex":0.00013123304,"about_ca_topic_score_gemma":0.0000057332613,"teacher_disagreement_score":0.800655,"about_ca_system_score_codex":0.00011970872,"about_ca_system_score_gemma":0.00014406713,"threshold_uncertainty_score":0.6361957},"labels":[],"label_agreement":null},{"id":"W2291831758","doi":"10.1162/neco_a_00841","title":"McCulloch-Pitts Brains and Pseudorandom Functions","year":2016,"lang":"en","type":"article","venue":"Neural Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Pseudorandom number generator; Computer science; Neuroscience; Neural system; Artificial intelligence; Dynamical systems theory; Cognitive science; Algorithm; Psychology; Physics","score_opus":0.017299408687498862,"score_gpt":0.24360667452596016,"score_spread":0.2263072658384613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291831758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23137219,0.00006949383,0.762565,0.004430718,0.000691314,0.00021144527,0.0000034112722,0.00036684237,0.0002895957],"genre_scores_gemma":[0.9827656,0.000007278667,0.016529545,0.00035787714,0.00014630024,0.000014253629,0.0000034001557,0.0000103873745,0.00016532966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842656,0.00016128249,0.00027267745,0.00057104323,0.00028834984,0.00028008662],"domain_scores_gemma":[0.9987649,0.0005259537,0.00009608938,0.00032354108,0.00015409684,0.00013547375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023870867,0.0001789024,0.00019416929,0.00013212077,0.00021387418,0.00018437945,0.00032236992,0.00006110812,0.000013056349],"category_scores_gemma":[0.000107435255,0.00012854983,0.00006908323,0.00036225124,0.0000955052,0.00070916134,0.00028182406,0.000097098266,0.00007381125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002491665,0.00009800177,0.002967545,0.000021519534,0.000018943318,0.000016778089,0.0004149795,0.0018847551,0.0026056448,0.0050662616,0.0015599944,0.9853207],"study_design_scores_gemma":[0.0031703715,0.0004774475,0.10902074,0.000032022555,0.000017466491,0.00019975626,0.000022611963,0.8418083,0.00040889092,0.042091984,0.002212562,0.0005378565],"about_ca_topic_score_codex":0.000018815124,"about_ca_topic_score_gemma":0.000012513902,"teacher_disagreement_score":0.9847828,"about_ca_system_score_codex":0.0000581464,"about_ca_system_score_gemma":0.00003524604,"threshold_uncertainty_score":0.524211},"labels":[],"label_agreement":null},{"id":"W2295043651","doi":"10.1017/jsl.2014.72","title":"HOMOGENEITY AND FIX-POINTS: GOING FORTH!","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; London Mathematical Society","keywords":"Automorphism; Homogeneity (statistics); Homogeneous; Countable set; Mathematics; Automorphism group; Computer science; Discrete mathematics; Combinatorics; Statistics","score_opus":0.043289272169363895,"score_gpt":0.27150557796513153,"score_spread":0.22821630579576763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295043651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62351656,0.0023142602,0.36639354,0.003615625,0.0013861089,0.00016226305,0.0000015516385,0.00008611466,0.0025240134],"genre_scores_gemma":[0.903882,0.00006603426,0.09496794,0.00059571414,0.0004234159,0.0000014681682,2.1104061e-7,0.00000841604,0.000054746346],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816436,0.00015375407,0.0005708427,0.00027358718,0.00051002036,0.00032744234],"domain_scores_gemma":[0.99821407,0.0001738969,0.00039242057,0.00041585913,0.00041476323,0.00038901693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017015915,0.00017945796,0.0004135264,0.00018612006,0.00008318955,0.00018906449,0.00092834636,0.000085600055,0.000008937376],"category_scores_gemma":[0.0004065158,0.00013521232,0.00013028354,0.0003680672,0.000092812144,0.0006859243,0.0005194582,0.0003003142,0.000024235507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015986945,0.0018371318,0.19730876,0.00022354044,0.0004413888,0.0019738548,0.013202061,0.0028877454,0.00157999,0.1115684,0.017006123,0.6518111],"study_design_scores_gemma":[0.0044786613,0.0029836472,0.1650875,0.00015895603,0.00009081261,0.009743997,0.0004782371,0.06701407,0.0013292797,0.73253864,0.01496804,0.0011281536],"about_ca_topic_score_codex":0.000014573038,"about_ca_topic_score_gemma":0.0000064913716,"teacher_disagreement_score":0.650683,"about_ca_system_score_codex":0.00012459619,"about_ca_system_score_gemma":0.00021837147,"threshold_uncertainty_score":0.55137986},"labels":[],"label_agreement":null},{"id":"W2297809299","doi":"","title":"David Corfield , Towards a Philosophy of Real Mathematics . Reviewed by","year":2004,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Philosophy; Epistemology; Contemporary philosophy","score_opus":0.03026066711323959,"score_gpt":0.2691692706651382,"score_spread":0.23890860355189858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297809299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007410157,0.00037409397,0.93860656,0.0045616566,0.00031652313,0.00042909753,0.0000065634736,0.0003008408,0.047994494],"genre_scores_gemma":[0.30327678,0.00026100583,0.6953212,0.000711641,0.00010118973,0.000019829424,0.000003866709,0.000015272753,0.00028918538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983525,0.000041288193,0.00052091945,0.0004028916,0.00043134418,0.0002510371],"domain_scores_gemma":[0.9984222,0.00010079306,0.00016123184,0.0010462004,0.00015978281,0.0001097582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004329413,0.00018184098,0.00039662974,0.000057479276,0.000043977558,0.000050774088,0.0011947862,0.00008069856,0.0000609351],"category_scores_gemma":[0.00010731337,0.00014671616,0.00013683924,0.00046369416,0.00008076878,0.00022699176,0.0004978602,0.00012880204,0.00004532255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006113735,0.0014822326,0.00016562735,0.00066306733,0.000056028053,0.000023018882,0.0029085993,0.00016443034,0.0017534947,0.90400195,0.00434013,0.08443529],"study_design_scores_gemma":[0.0014888337,0.00087096635,0.00066258264,0.00028813054,0.000034049746,0.000074295094,0.0000603465,0.02024853,0.017188221,0.95502055,0.0032739588,0.000789533],"about_ca_topic_score_codex":0.0001918842,"about_ca_topic_score_gemma":0.000007388867,"teacher_disagreement_score":0.2958666,"about_ca_system_score_codex":0.00006323104,"about_ca_system_score_gemma":0.000117652904,"threshold_uncertainty_score":0.59829116},"labels":[],"label_agreement":null},{"id":"W2316037488","doi":"10.3390/isis-summit-vienna-2015-t9.2006","title":"What Must the World Be Like to Have Information About It?","year":2015,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.046596440130733385,"score_gpt":0.28638424880026075,"score_spread":0.23978780866952737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316037488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035335456,0.00007890083,0.8635513,0.080549866,0.003895764,0.00068114285,0.0000014562095,0.0004312561,0.047276776],"genre_scores_gemma":[0.5337867,0.000029873217,0.28734422,0.1530684,0.0008248936,0.00017878745,0.000016943388,0.000026606447,0.02472359],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985208,0.00007400426,0.00030743363,0.00025431067,0.0005348195,0.0003086669],"domain_scores_gemma":[0.9982251,0.00016961514,0.00006731194,0.001006891,0.0002989089,0.00023217086],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008783108,0.00014654604,0.00013235926,0.00014602367,0.00011218802,0.0014830423,0.0014192674,0.000038856946,0.000045827546],"category_scores_gemma":[0.0001058824,0.000095337906,0.000055566477,0.00064447446,0.000046446974,0.0036756725,0.0010297828,0.00014008762,0.0005997028],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012669037,0.000112629685,0.0007018559,0.000014958482,0.000020176096,0.000005247614,0.032409754,0.0064792903,0.0000054027037,0.04357671,0.3068028,0.6098585],"study_design_scores_gemma":[0.00029597536,0.00011333146,0.0023714537,0.000020064688,0.0000037063387,0.000013852883,0.0025331692,0.27501357,0.000168818,0.004466005,0.71472216,0.00027790767],"about_ca_topic_score_codex":0.00015296118,"about_ca_topic_score_gemma":0.0010207451,"teacher_disagreement_score":0.6095806,"about_ca_system_score_codex":0.00011688769,"about_ca_system_score_gemma":0.00011099018,"threshold_uncertainty_score":0.9995535},"labels":[],"label_agreement":null},{"id":"W2323356252","doi":"10.7151/dmgaa.1087","title":"Generalized inflations and null extensions","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae - General Algebra and Applications","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Carleton University","funders":"","keywords":"Mathematics; Null (SQL); Pure mathematics; Computer science; Data mining","score_opus":0.012410512523290045,"score_gpt":0.2498347723534058,"score_spread":0.23742425983011575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323356252","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17026572,0.0002733971,0.818545,0.0089893555,0.00007412312,0.00081155746,0.000012036219,0.0003385739,0.0006902486],"genre_scores_gemma":[0.46868622,0.00015403345,0.5289389,0.00066012045,0.00023719815,0.00076933554,0.000021583926,0.000030026424,0.00050257647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982856,0.0000498519,0.00044296126,0.0006517673,0.00025239517,0.00031744406],"domain_scores_gemma":[0.99852586,0.00011203583,0.000120954304,0.000852834,0.00009887909,0.00028945884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018744428,0.00026239397,0.00030409294,0.00012297856,0.00066361716,0.00024512113,0.0004503711,0.000088683344,0.000037247977],"category_scores_gemma":[0.00003956778,0.00018007318,0.00008511229,0.0005091825,0.00019510982,0.0003592882,0.00056165183,0.00013373808,0.00007409845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011922305,0.00021075802,0.00004817907,0.000028502696,0.000013911289,0.000002161028,0.00047157737,0.00019778417,0.0020118135,0.9726651,0.000060052243,0.024289016],"study_design_scores_gemma":[0.00058835547,0.000044863184,0.0057938746,0.000032417043,0.000032858985,0.0001228327,0.00006614466,0.022157468,0.0004244124,0.96763206,0.0027235183,0.0003812085],"about_ca_topic_score_codex":0.000014734417,"about_ca_topic_score_gemma":0.0000099097815,"teacher_disagreement_score":0.2984205,"about_ca_system_score_codex":0.00003007303,"about_ca_system_score_gemma":0.00006041444,"threshold_uncertainty_score":0.7343172},"labels":[],"label_agreement":null},{"id":"W2328636311","doi":"10.1177/154193120504901732","title":"Compressed File Length Predicts Search Time and Errors on Visual Displays","year":2005,"lang":"en","type":"article","venue":"Proceedings of the Human Factors and Ergonomics Society Annual Meeting","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Bitmap; Lossless compression; Visual search; Chart; Range (aeronautics); File size; Overlay; Algorithm; Computer graphics (images); Data compression; Artificial intelligence; Mathematics; Statistics","score_opus":0.014590926255798366,"score_gpt":0.23770379131700428,"score_spread":0.22311286506120592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328636311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99854547,0.00004433007,0.00007493413,0.0002960668,0.000073522264,0.0002493497,0.000084841115,0.00009868091,0.0005327821],"genre_scores_gemma":[0.9940148,0.000014679497,0.0055614114,0.00009739091,0.00015656058,0.0000055727965,0.000005113283,0.000018230101,0.00012623121],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998384,0.000018395942,0.00035202454,0.0005584108,0.00028367387,0.0004034972],"domain_scores_gemma":[0.99903786,0.00028210232,0.00022257063,0.00015695632,0.0001589916,0.00014152822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005594165,0.00026691638,0.0003222517,0.000041298877,0.0006495149,0.00022373842,0.00076473714,0.0001221906,0.000014032998],"category_scores_gemma":[0.00007995189,0.00020288979,0.00015982115,0.00015911445,0.00029420308,0.0005669328,0.0012870649,0.0003461339,0.000002348684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038815875,0.0037980173,0.32786208,0.002247421,0.0012864543,0.0000016774751,0.38724658,0.014623284,0.093045235,0.03926148,0.07607181,0.0541678],"study_design_scores_gemma":[0.0011267858,0.0006856726,0.27283913,0.0003100625,0.000045114855,0.0000093003455,0.0040571205,0.6997666,0.017926699,0.0011551324,0.001210599,0.0008678047],"about_ca_topic_score_codex":0.000056404515,"about_ca_topic_score_gemma":0.0000034976988,"teacher_disagreement_score":0.6851433,"about_ca_system_score_codex":0.00009516799,"about_ca_system_score_gemma":0.000028138667,"threshold_uncertainty_score":0.8273606},"labels":[],"label_agreement":null},{"id":"W2332231452","doi":"10.1162/978-0-262-32621-6-ch133","title":"CodeRouge: a Project to Evolve Life-like Autonomous Programs","year":2014,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Software engineering; Programming language","score_opus":0.02672686718477944,"score_gpt":0.26127662616593417,"score_spread":0.23454975898115474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332231452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01189212,0.000021707949,0.96918213,0.0027029999,0.00086610956,0.0012320923,8.9790086e-7,0.0016520045,0.012449961],"genre_scores_gemma":[0.3795991,7.031599e-7,0.61588115,0.002629055,0.00024322244,0.00019113788,0.0000030441695,0.000021461141,0.0014311397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720645,0.00016992392,0.00039632706,0.0010412894,0.0004903897,0.0006955918],"domain_scores_gemma":[0.9976971,0.00016411158,0.000078996236,0.0014777337,0.0002170398,0.0003650318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080043136,0.00029562306,0.00034705873,0.00016559256,0.00014494362,0.00052206457,0.0018636363,0.000100202335,0.00003729992],"category_scores_gemma":[0.00019086075,0.00024571698,0.00013350688,0.000984451,0.00006637669,0.00037596084,0.0012013799,0.00018786821,0.00051849405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015277175,0.00087221956,0.0027916704,0.00005850245,0.000048140475,0.000014897446,0.0028754228,0.0006917348,0.000100835816,0.072316535,0.0146895815,0.9055252],"study_design_scores_gemma":[0.0005101004,0.0011170198,0.0027107995,0.000016000484,0.000007281401,0.00003442986,0.00004568022,0.8495668,0.00016790793,0.0059416993,0.13924108,0.00064118346],"about_ca_topic_score_codex":0.00031268812,"about_ca_topic_score_gemma":0.00011548952,"teacher_disagreement_score":0.904884,"about_ca_system_score_codex":0.0001231813,"about_ca_system_score_gemma":0.0002917625,"threshold_uncertainty_score":0.9999995},"labels":[],"label_agreement":null},{"id":"W2339298563","doi":"","title":"Traces, feedback, and the geometry of computation","year":2007,"lang":"en","type":"article","venue":"Fundamentals of Computation Theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Concurrency; Computer science; Algebra over a field; Theoretical computer science; Category theory; Quantum computer; Mathematics; Programming language; Pure mathematics; Quantum","score_opus":0.011945572062982277,"score_gpt":0.26763098497318755,"score_spread":0.25568541291020525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339298563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3131004,0.000657683,0.6844191,0.00024797246,0.0003137086,0.00036343205,0.0000051954253,0.000066799344,0.0008257125],"genre_scores_gemma":[0.9376739,0.000014853343,0.06203956,0.0001726567,0.000046458226,0.0000045672004,0.000008710268,0.000011272507,0.000028008257],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974966,0.000454071,0.0008335688,0.0003870628,0.0005612037,0.00026747087],"domain_scores_gemma":[0.9955008,0.0032239903,0.00059261726,0.00033787053,0.00025767504,0.00008703915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045165448,0.00020249939,0.00042548185,0.00029541666,0.00014194685,0.000084025756,0.0005969145,0.00007661474,0.000017425387],"category_scores_gemma":[0.00014044692,0.00015940749,0.00013317815,0.0007222976,0.00074981124,0.00036441532,0.00036128174,0.00015050077,0.0000075316957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003639971,0.00041495336,0.0017424003,0.00017798578,0.0001317105,0.0000043002165,0.0052751545,0.012388805,0.0009999616,0.38636136,0.0001297687,0.5920096],"study_design_scores_gemma":[0.0048740217,0.00047094698,0.08152073,0.00009120032,0.000051431107,0.00006673438,0.001600908,0.1975476,0.0097720325,0.7034356,0.00014586009,0.00042293288],"about_ca_topic_score_codex":0.00003348057,"about_ca_topic_score_gemma":0.0000045465,"teacher_disagreement_score":0.6245735,"about_ca_system_score_codex":0.000056723766,"about_ca_system_score_gemma":0.00005378489,"threshold_uncertainty_score":0.65004486},"labels":[],"label_agreement":null},{"id":"W2397007421","doi":"10.29007/44jw","title":"The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Object Research Systems (Canada)","funders":"","keywords":"Computer science; Turing machine; Oracle; Distributed computing; Virtual machine; Theoretical computer science; Operating system; Programming language; Computation","score_opus":0.006140681895732632,"score_gpt":0.2380729585410363,"score_spread":0.23193227664530366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397007421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32939535,0.0020252045,0.6534512,0.011189792,0.0022639981,0.00075685437,0.0000011430672,0.00038019478,0.0005362538],"genre_scores_gemma":[0.9566902,0.00001086881,0.041228715,0.00045900978,0.0015635035,0.000008959484,0.0000020337702,0.000023923043,0.000012816985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948739,0.0014979223,0.0009246443,0.0009149192,0.0006405427,0.0011480942],"domain_scores_gemma":[0.9895201,0.008377553,0.00040778087,0.0014111948,0.00018111472,0.00010227863],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0066944677,0.0004532666,0.00047965487,0.00007976405,0.004269489,0.00097011233,0.0029471614,0.0000891049,0.0000027402723],"category_scores_gemma":[0.0021778585,0.00023583928,0.00014254323,0.0015297788,0.0021131341,0.00021315752,0.0049760346,0.001238394,0.000003972739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015569385,0.00003413095,0.014745246,0.00004663045,0.00007730083,0.000021480577,0.036550984,0.10090272,0.00001678014,0.035483845,0.00011700526,0.81184816],"study_design_scores_gemma":[0.00084294524,0.00015767243,0.03331548,0.0001295893,0.000011506084,0.00034658765,0.00058428483,0.86665344,0.00007451025,0.09585916,0.0016284424,0.00039635773],"about_ca_topic_score_codex":0.00057803304,"about_ca_topic_score_gemma":0.001145437,"teacher_disagreement_score":0.81145185,"about_ca_system_score_codex":0.00016513876,"about_ca_system_score_gemma":0.00009786579,"threshold_uncertainty_score":0.9970268},"labels":[],"label_agreement":null},{"id":"W2397245036","doi":"","title":"On Removable Series Classes In Critically Connected Binary Matroids.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Series (stratigraphy); Matroid; Binary number; Combinatorics; Arithmetic","score_opus":0.02156686619076014,"score_gpt":0.25736330640285743,"score_spread":0.23579644021209728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397245036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97328764,0.0002237877,0.0027333398,0.0050756205,0.005469928,0.00047105167,0.000003578632,0.00080770295,0.011927323],"genre_scores_gemma":[0.9772157,0.0000064623114,0.02190433,0.00057404686,0.000017239798,0.000029405022,0.000004543104,0.000022826973,0.00022544636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973046,0.00030621106,0.00045987376,0.00073733786,0.0005779606,0.0006140144],"domain_scores_gemma":[0.99752223,0.000554362,0.00007646922,0.0010940767,0.0004622244,0.00029062098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079819665,0.0002851727,0.00041463051,0.00023843897,0.000096552496,0.0002489883,0.0012741768,0.00014767927,0.000019705452],"category_scores_gemma":[0.0012737238,0.00028461593,0.0000761394,0.0010782811,0.00014429446,0.00080095447,0.00065673876,0.0003584923,0.00020464128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042178373,0.0004736451,0.0017760037,0.000018780938,0.000008665798,0.00023041219,0.00031344898,0.00016151692,0.00015428336,0.9915525,0.0043318076,0.0009368025],"study_design_scores_gemma":[0.0013719781,0.0010201472,0.008163411,0.000042983058,0.000003952106,0.00005728361,0.000091800845,0.01858767,0.0006542639,0.96797556,0.0016515556,0.00037941342],"about_ca_topic_score_codex":0.00009932068,"about_ca_topic_score_gemma":0.00002686185,"teacher_disagreement_score":0.023576913,"about_ca_system_score_codex":0.00029734775,"about_ca_system_score_gemma":0.00030819429,"threshold_uncertainty_score":0.9999606},"labels":[],"label_agreement":null},{"id":"W2397285971","doi":"","title":"On The Two-Square Theorem And The Modular Group.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Modular design; Square (algebra); Group (periodic table); Modular group; Pure mathematics; Combinatorics; Discrete mathematics; Geometry; Computer science; Physics","score_opus":0.007432687003532273,"score_gpt":0.21685436308465952,"score_spread":0.20942167608112724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397285971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751031,0.000099140554,0.006176062,0.009935204,0.00450189,0.0006227226,0.0000014783113,0.00022577212,0.003334677],"genre_scores_gemma":[0.9973884,0.0000047705403,0.001440916,0.0010341811,0.000034150537,0.00004601739,7.1195313e-7,0.0000138089335,0.00003704115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981098,0.00037867232,0.00022010828,0.00051538856,0.00043513556,0.0003408943],"domain_scores_gemma":[0.9960832,0.0019082893,0.00009229262,0.0017230761,0.00009861067,0.000094534626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018422218,0.00022116167,0.00021891684,0.00004318534,0.000453549,0.0003644147,0.0019014064,0.000076157325,0.000027421616],"category_scores_gemma":[0.00037139663,0.00011482596,0.00010419756,0.00037023076,0.00051489286,0.00019725185,0.0008167664,0.0006241747,0.00005463392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106173875,0.000077824,0.00024189247,0.0000028814366,0.000012759146,0.0000049829264,0.00055681623,0.000017147648,0.00009337131,0.99274105,0.00021131175,0.0060293367],"study_design_scores_gemma":[0.001160246,0.000086789005,0.0045684366,0.000005859178,0.000006164922,0.000017824786,0.000027206408,0.069152735,0.00014581576,0.9238748,0.0007998841,0.00015421501],"about_ca_topic_score_codex":0.000063483814,"about_ca_topic_score_gemma":0.000018576662,"teacher_disagreement_score":0.06913559,"about_ca_system_score_codex":0.000023492667,"about_ca_system_score_gemma":0.000030252988,"threshold_uncertainty_score":0.4682467},"labels":[],"label_agreement":null},{"id":"W2398024725","doi":"","title":"Quadratic Nonresidues and the Combinatorics of Sign Multiplication.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sign (mathematics); Multiplication (music); Quadratic equation; Combinatorics; Arithmetic; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01067095402399978,"score_gpt":0.2236383027356838,"score_spread":0.21296734871168402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398024725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9354865,0.0014582893,0.047399282,0.007174654,0.002611788,0.002402003,0.0000023763764,0.00040242096,0.0030626783],"genre_scores_gemma":[0.9935512,0.000030612693,0.006066712,0.00013466513,0.0000071948734,0.00011215483,0.0000010883542,0.000011461088,0.00008489371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980964,0.00033141027,0.00045391897,0.00043492505,0.00040028014,0.0002830615],"domain_scores_gemma":[0.99658316,0.0015292027,0.0002234401,0.0011691995,0.00038283403,0.000112136906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008002464,0.00020109606,0.00035767443,0.00007736858,0.00018457854,0.00019959224,0.0012926804,0.000082776176,0.000014968074],"category_scores_gemma":[0.00035062138,0.00014329437,0.00008188617,0.00056037726,0.00039421863,0.0004720605,0.0006429258,0.00018652559,0.00005359881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043656983,0.00016643682,0.0025731358,0.000024371204,0.000020676525,8.148316e-7,0.0009231027,0.000015110955,0.00013145019,0.9900272,0.0006905329,0.0054228017],"study_design_scores_gemma":[0.001602428,0.00010391335,0.031002112,0.000010749183,0.000009974371,0.000006665049,0.00005959169,0.06267682,0.00082435086,0.9034209,0.00011090267,0.00017155844],"about_ca_topic_score_codex":0.0003393747,"about_ca_topic_score_gemma":0.0000037582922,"teacher_disagreement_score":0.086606264,"about_ca_system_score_codex":0.00004413683,"about_ca_system_score_gemma":0.00006528059,"threshold_uncertainty_score":0.5843375},"labels":[],"label_agreement":null},{"id":"W2398319463","doi":"10.1007/978-3-319-22156-4_5","title":"Generalizing Computability Theory to Abstract Algebras","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computability; Computability theory; Mathematics; Computation; Turing; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Algorithm; Programming language","score_opus":0.07265387640874925,"score_gpt":0.28272623635632504,"score_spread":0.21007235994757578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398319463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007944346,0.00044255416,0.5056238,0.00070936914,0.0014217643,0.00069660274,0.000017083952,0.00090064487,0.49010873],"genre_scores_gemma":[0.012312892,0.000022245255,0.558689,0.0037938403,0.0019416412,0.000047833364,0.000052584142,0.00022987353,0.42291012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99472296,0.000120557765,0.0010123963,0.0021331059,0.0012366766,0.0007743102],"domain_scores_gemma":[0.99439394,0.00060358935,0.00029854864,0.0031952073,0.0006903949,0.0008183217],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027733026,0.0009158125,0.0010346086,0.0003574125,0.00017357619,0.0004567836,0.0034947945,0.00054389506,0.001278175],"category_scores_gemma":[0.0001574709,0.0008305921,0.00043484464,0.00016931776,0.00019652405,0.00039941134,0.0031479085,0.0007893081,0.0021870052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000839111,0.000060937047,0.000011449997,0.000035149395,0.0000573399,0.00004671365,0.00023803154,0.0007855389,0.000010979674,0.82171655,0.010296722,0.16673222],"study_design_scores_gemma":[0.00020723495,0.00016431478,0.0003242846,0.000048505663,0.00002064859,0.0000449899,0.000005628654,0.005684488,0.000035376306,0.761863,0.23054296,0.0010585752],"about_ca_topic_score_codex":0.0000844969,"about_ca_topic_score_gemma":0.0000648717,"teacher_disagreement_score":0.22024624,"about_ca_system_score_codex":0.00061646017,"about_ca_system_score_gemma":0.00049202883,"threshold_uncertainty_score":0.9996348},"labels":[],"label_agreement":null},{"id":"W2398628368","doi":"","title":"The Brain Agent.","year":2014,"lang":"en","type":"article","venue":"International Conference on Agents and Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.1041517999723869,"score_gpt":0.33916012325171385,"score_spread":0.23500832327932697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398628368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012780773,0.00001819813,0.92309195,0.039043628,0.002480295,0.00019283906,0.0000043957552,0.00012218383,0.02226572],"genre_scores_gemma":[0.99468595,0.000058839505,0.002471921,0.0018307093,0.00021971643,0.000016824537,0.0000024835986,0.0000064849355,0.0007070587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982303,0.00013483797,0.00036366747,0.0005095058,0.00048477206,0.00027695767],"domain_scores_gemma":[0.9985891,0.0004978678,0.00011417422,0.00045500306,0.00022474153,0.00011912891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071193115,0.00017202146,0.00012339684,0.000075210206,0.000347004,0.0009180644,0.0015368047,0.000049280712,0.00015054831],"category_scores_gemma":[0.0004025248,0.00012395596,0.00006215626,0.00014993822,0.00020069453,0.00022702813,0.0004280152,0.00018899445,0.0002575018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058719156,0.00003664163,0.000045845063,8.4679647e-7,0.0000073982596,0.0000020991738,0.00013320161,0.000073156756,0.00008639338,0.60186327,0.00030438165,0.39744088],"study_design_scores_gemma":[0.00002504395,0.00011292887,0.0009952458,0.000015129998,0.0000014720691,0.000006207898,0.00007499972,0.6039143,0.0010635535,0.36314723,0.030487513,0.00015636106],"about_ca_topic_score_codex":0.00004094308,"about_ca_topic_score_gemma":0.00005878256,"teacher_disagreement_score":0.98190516,"about_ca_system_score_codex":0.000040081428,"about_ca_system_score_gemma":0.000037270896,"threshold_uncertainty_score":0.88529164},"labels":[],"label_agreement":null},{"id":"W2398674600","doi":"10.29007/5dmr","title":"Strong 0-dimensionality in Pointfree Topology","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Curse of dimensionality; Computer science; Topology (electrical circuits); Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.02401188408444463,"score_gpt":0.29466258069680806,"score_spread":0.2706506966123634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398674600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7508739,0.00011249155,0.23887989,0.0023347691,0.002454714,0.00023509444,8.404977e-7,0.00025254424,0.0048557636],"genre_scores_gemma":[0.8564708,0.0000011812966,0.14275675,0.00039793813,0.00032210734,0.0000032594367,0.0000012245204,0.000008484571,0.00003823679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973192,0.00036552956,0.0006130486,0.0007800124,0.00027305784,0.00064910966],"domain_scores_gemma":[0.9982608,0.0005643228,0.00012521156,0.00085968734,0.00011134406,0.00007866681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014603396,0.00021624973,0.00036794273,0.00021593623,0.0001490905,0.00008257169,0.0011660381,0.0001127547,0.00008245775],"category_scores_gemma":[0.0003709184,0.00022628145,0.000058467016,0.0008538972,0.00037381545,0.0003939653,0.001814847,0.00034645657,0.000042061],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005497448,0.0004810169,0.31879014,0.00006613578,0.000026604974,0.00029068236,0.00812696,0.005044269,0.00023974458,0.44660875,0.0005014436,0.2197693],"study_design_scores_gemma":[0.0009477698,0.00040548228,0.42021945,0.00008281604,0.0000021169158,0.00016127533,0.00029106514,0.45037082,0.00087666145,0.124643765,0.001453455,0.0005453023],"about_ca_topic_score_codex":0.00044253826,"about_ca_topic_score_gemma":0.0007810741,"teacher_disagreement_score":0.44532657,"about_ca_system_score_codex":0.0002175771,"about_ca_system_score_gemma":0.000113551265,"threshold_uncertainty_score":0.922749},"labels":[],"label_agreement":null},{"id":"W2399456157","doi":"","title":"Computing Derivatives via Compression: An Exact Scheme.","year":2011,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Scheme (mathematics); Computer science; Compression (physics); Data compression; Computational science; Parallel computing; Algorithm; Mathematics; Materials science","score_opus":0.027987566854524422,"score_gpt":0.25563200876883885,"score_spread":0.22764444191431443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399456157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0961258,0.00017280751,0.8964904,0.00016751056,0.0044675167,0.00058250653,0.0000014744453,0.0005886187,0.001403367],"genre_scores_gemma":[0.8414016,0.00006374065,0.15812986,0.00021306347,0.00011122467,0.000020859643,0.000018496768,0.000023824652,0.00001733024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997371,0.00037194946,0.00048744865,0.00092906633,0.00037747415,0.00046305987],"domain_scores_gemma":[0.99813783,0.00028394372,0.0002978244,0.00072400464,0.00028473136,0.00027166837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050956913,0.00037614728,0.00042656428,0.00025705353,0.0005374802,0.00024359893,0.00089321594,0.00022956703,0.000054700093],"category_scores_gemma":[0.00009553524,0.00035442592,0.00010018572,0.0009471363,0.00021432787,0.0007595091,0.0005935073,0.0003501607,0.000004614467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065896334,0.005223076,0.012877568,0.00007767079,0.00020354093,0.00007833845,0.0070767156,0.060598306,0.00039462972,0.74903923,0.0007044901,0.16306745],"study_design_scores_gemma":[0.001828072,0.0010316615,0.007785321,0.00007982138,0.00001764348,0.000013342622,0.00011838647,0.94200116,0.00033700975,0.046077207,0.00014950479,0.0005608577],"about_ca_topic_score_codex":0.00001774212,"about_ca_topic_score_gemma":0.0000021709825,"teacher_disagreement_score":0.88140285,"about_ca_system_score_codex":0.00005790539,"about_ca_system_score_gemma":0.000049453472,"threshold_uncertainty_score":0.99989074},"labels":[],"label_agreement":null},{"id":"W2399741704","doi":"","title":"On the Ramsey Numbers R(C m , B n ).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics","score_opus":0.010287189247916662,"score_gpt":0.22976315387952034,"score_spread":0.21947596463160368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399741704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538549,0.000015873084,0.0037929933,0.0074286903,0.013587952,0.00039582988,0.0000013564276,0.00049920735,0.020423185],"genre_scores_gemma":[0.995068,0.0000013162899,0.003654422,0.0010088219,0.000027808097,0.000026211574,8.1225295e-7,0.000013990681,0.0001986225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982329,0.00013567248,0.00022756131,0.00052445487,0.0004739076,0.00040549136],"domain_scores_gemma":[0.99698937,0.00093796337,0.00008926824,0.0017281108,0.00011421406,0.00014107767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008138923,0.00020564724,0.00017916756,0.00005649715,0.0002746507,0.00026854352,0.0022727966,0.00011061008,0.00012068687],"category_scores_gemma":[0.0003822989,0.0001461226,0.00011095727,0.00051663606,0.00014314977,0.00023216491,0.0005534941,0.0006683503,0.00058444083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021696005,0.00013045454,0.00057594734,0.0000019445495,0.000009031253,0.00000850071,0.00022856849,0.000008716695,0.00021424128,0.98749167,0.0058036526,0.005525082],"study_design_scores_gemma":[0.0003359254,0.00010461718,0.004520136,0.000004635511,0.0000030803062,0.000014777118,0.000011222124,0.010057138,0.000999103,0.97751874,0.0062151267,0.0002155166],"about_ca_topic_score_codex":0.000058254234,"about_ca_topic_score_gemma":0.000018628547,"teacher_disagreement_score":0.04121308,"about_ca_system_score_codex":0.00004495538,"about_ca_system_score_gemma":0.00008275431,"threshold_uncertainty_score":0.75119996},"labels":[],"label_agreement":null},{"id":"W2399979379","doi":"","title":"On the Ramsey Numbers R(S 2, m , K 2, q ) and R(sK 2 , K s +C n ).","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics","score_opus":0.023987012879056382,"score_gpt":0.24051320584872485,"score_spread":0.21652619296966846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399979379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9573814,0.00024875504,0.0058471523,0.0093294885,0.005997131,0.0005254142,0.000001860557,0.00047812244,0.020190654],"genre_scores_gemma":[0.9964066,0.000005016129,0.0024598206,0.0008957096,0.000017216278,0.000019250903,7.6407207e-7,0.00001235881,0.00018323782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998229,0.00022399015,0.00021196798,0.00050391565,0.00048405986,0.00034705113],"domain_scores_gemma":[0.9978904,0.000612274,0.000081246115,0.0010391886,0.00013676623,0.00024012433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010134606,0.00019843558,0.00019881221,0.000054515927,0.00016588712,0.0002681549,0.0011579099,0.00007845368,0.000012322986],"category_scores_gemma":[0.00039237327,0.00014269777,0.000054791995,0.00043187654,0.00014253723,0.00026805775,0.000654263,0.00026413862,0.00017502568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050977173,0.00009909554,0.0009680275,0.0000027814597,0.000011489775,0.000012028393,0.0007003862,0.000020532249,0.000006220696,0.98118716,0.012457639,0.004529562],"study_design_scores_gemma":[0.00067385886,0.00022507343,0.0023561697,0.00000881157,0.000004305942,0.000021939606,0.00006109511,0.011893265,0.00013728779,0.97977686,0.0046329848,0.0002083484],"about_ca_topic_score_codex":0.000089414505,"about_ca_topic_score_gemma":0.00000675052,"teacher_disagreement_score":0.039025202,"about_ca_system_score_codex":0.000097523414,"about_ca_system_score_gemma":0.0001000356,"threshold_uncertainty_score":0.5819046},"labels":[],"label_agreement":null},{"id":"W2401559809","doi":"","title":"Hyperstructures associated to arithmetic functions.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arithmetic; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.008602605229601873,"score_gpt":0.22702490418019347,"score_spread":0.2184222989505916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401559809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96271497,0.000026141739,0.014107474,0.0021064414,0.01687392,0.00038489196,0.0000055838314,0.00077464746,0.0030059398],"genre_scores_gemma":[0.9818676,5.6527523e-7,0.01724628,0.0004990989,0.000033006338,0.000027656124,0.000004173532,0.000017762639,0.00030382752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796647,0.000103733044,0.00029360145,0.0006719494,0.00047621207,0.0004880539],"domain_scores_gemma":[0.99791634,0.00027480157,0.00008766731,0.001152233,0.00027448466,0.00029445562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051203824,0.00023921645,0.00027232617,0.00018853656,0.00026281443,0.00029082078,0.0014098437,0.00016703445,0.000073676936],"category_scores_gemma":[0.0006956925,0.00023311755,0.000111913134,0.0010794126,0.00007416766,0.00029219154,0.0006290622,0.0005220561,0.00031672433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009038421,0.0005795045,0.0128643075,0.000011197045,0.000081472994,0.000039182465,0.00089121907,0.00018983577,0.0063095777,0.9159876,0.012573983,0.050463043],"study_design_scores_gemma":[0.000916997,0.00032488193,0.13882136,0.000008801054,0.000018928578,0.000042746397,0.000027670958,0.016099822,0.0015239494,0.83161783,0.009972277,0.00062474055],"about_ca_topic_score_codex":0.000086314496,"about_ca_topic_score_gemma":0.00006184227,"teacher_disagreement_score":0.12595706,"about_ca_system_score_codex":0.00010461714,"about_ca_system_score_gemma":0.00011080087,"threshold_uncertainty_score":0.9506258},"labels":[],"label_agreement":null},{"id":"W2402456376","doi":"10.1007/s00037-016-0124-0","title":"The Minimum Oracle Circuit Size Problem","year":2016,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Circuit complexity; Complexity class; Mathematics; Kolmogorov complexity; Bounded function; Discrete mathematics; Variety (cybernetics); Function (biology); Computational complexity theory; Combinatorics; Random oracle; PSPACE; Computer science; Time complexity; Algorithm; Electronic circuit; Statistics","score_opus":0.057049807582766204,"score_gpt":0.27272874210327475,"score_spread":0.21567893452050854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402456376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018271485,0.00013629848,0.96279746,0.013339233,0.0007082861,0.00048222998,0.000020834694,0.0005591777,0.0036850208],"genre_scores_gemma":[0.84702444,0.000003848245,0.15174924,0.0004712429,0.00021246345,0.000042967597,0.000004214178,0.000017676295,0.0004739241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684775,0.00033562796,0.0005694438,0.0008036304,0.0008412541,0.00060231145],"domain_scores_gemma":[0.99376357,0.004317248,0.00022106979,0.00094434916,0.0005440687,0.00020970005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009773539,0.00028372149,0.0002731787,0.00006084559,0.00085764297,0.00040104156,0.002284273,0.00007005476,0.00008922511],"category_scores_gemma":[0.00039704412,0.0001731872,0.0001716687,0.0005745467,0.00060210365,0.0005145274,0.0010097024,0.00017749303,0.00041938928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016561975,0.00020946139,0.001303133,0.000015878884,0.00004671085,0.000012954414,0.00025772915,0.0011818713,0.00017549652,0.78906727,0.0035140864,0.20419885],"study_design_scores_gemma":[0.00053976494,0.00008010831,0.08092336,0.00001661912,0.0000038188828,0.00004575399,0.0000070741603,0.06780775,0.000049543036,0.84128845,0.008955023,0.0002827181],"about_ca_topic_score_codex":0.000021851203,"about_ca_topic_score_gemma":0.000027800206,"teacher_disagreement_score":0.82875293,"about_ca_system_score_codex":0.00021612302,"about_ca_system_score_gemma":0.000286148,"threshold_uncertainty_score":0.70623696},"labels":[],"label_agreement":null},{"id":"W2402567827","doi":"","title":"Learning from Disagreeing Demonstrators.","year":2009,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reputation; Incentive; Mechanism (biology); Task (project management); Computer science; Knowledge management; Incentive compatibility; Microeconomics; Risk analysis (engineering); Cognitive psychology; Business; Psychology; Economics; Management; Political science; Epistemology","score_opus":0.013307225996836836,"score_gpt":0.2241032288304115,"score_spread":0.21079600283357466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402567827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12617733,0.00007043957,0.8588322,0.0012233725,0.0002494909,0.00007855226,2.2845005e-7,0.0007106934,0.0126577355],"genre_scores_gemma":[0.81542575,0.0000023455661,0.183945,0.00035704236,0.00011417533,0.0000010870933,0.0000012304095,0.0000034147863,0.00014995632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986051,0.000085503125,0.00021968348,0.00050618895,0.0002696258,0.00031390326],"domain_scores_gemma":[0.99908906,0.00018230618,0.000052445168,0.0005031259,0.000045561337,0.00012747289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021878882,0.00014720601,0.00016678999,0.00005473513,0.00015067379,0.00025837036,0.0008518568,0.000059297312,0.00007812414],"category_scores_gemma":[0.00007749588,0.00012881175,0.00007634785,0.00034798286,0.000031304742,0.0004493386,0.00022732528,0.00022615353,0.00013576356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018585312,0.00011203755,0.015177423,0.0000014685255,0.000010205707,0.000034494962,0.0007601542,0.0017957253,0.0011926662,0.028356275,0.0002685785,0.9522891],"study_design_scores_gemma":[0.0003200836,0.00029024202,0.13701981,0.000013691331,0.000005681952,0.000014525865,0.00008671785,0.7773461,0.0018420721,0.08052124,0.002077638,0.00046223222],"about_ca_topic_score_codex":0.000092053684,"about_ca_topic_score_gemma":0.00001394479,"teacher_disagreement_score":0.9518269,"about_ca_system_score_codex":0.00004458249,"about_ca_system_score_gemma":0.000039633054,"threshold_uncertainty_score":0.5252791},"labels":[],"label_agreement":null},{"id":"W2402757365","doi":"","title":"The Critical Exponent is Computable for Automatic Sequences","year":2011,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Mathematics; Computer science","score_opus":0.1450905477491213,"score_gpt":0.20712011454291665,"score_spread":0.06202956679379534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402757365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090565816,0.00005749403,0.90615886,0.0005600068,0.00057596585,0.00032249445,0.00000415798,0.0003094159,0.0014458098],"genre_scores_gemma":[0.9636521,0.000012964678,0.03571801,0.00022011617,0.000042667816,0.0000029051394,5.250257e-7,0.000008481423,0.00034227967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836755,0.00012797509,0.0002066437,0.000674546,0.00011041689,0.0005128492],"domain_scores_gemma":[0.99777544,0.0008955272,0.000079041245,0.0008708923,0.00020679488,0.00017231131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047447192,0.00018671335,0.00019747215,0.0000750681,0.0005667341,0.0001469938,0.0018421431,0.00007231278,0.000049779064],"category_scores_gemma":[0.000113273054,0.00015496417,0.00015889763,0.0005224131,0.00034175027,0.0005473035,0.00056333886,0.00012773603,0.0000915187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001971535,0.0002492808,0.0031563528,0.000045400608,0.000052869633,0.00008805582,0.0014020863,0.0020245374,0.000023568948,0.9830596,0.0009765107,0.008902063],"study_design_scores_gemma":[0.0002317486,0.00015286854,0.0018492531,0.000010230599,0.000015764834,0.0000091587945,0.00012360564,0.77481985,0.0002805579,0.22124909,0.0010630925,0.0001947896],"about_ca_topic_score_codex":0.00010326688,"about_ca_topic_score_gemma":0.000017713872,"teacher_disagreement_score":0.8730862,"about_ca_system_score_codex":0.000114538685,"about_ca_system_score_gemma":0.00010627265,"threshold_uncertainty_score":0.6319256},"labels":[],"label_agreement":null},{"id":"W2403413752","doi":"","title":"Fourier Concentration from Shrinkage.","year":2013,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Exponent; Combinatorics; Degree (music); Fourier series; Fourier transform; Mathematics; Connection (principal bundle); Function (biology); Shrinkage; Physics; Mathematical analysis; Statistics; Geometry","score_opus":0.020873283734668135,"score_gpt":0.24878093146319655,"score_spread":0.22790764772852842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403413752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19982992,0.00014494985,0.7876142,0.005914511,0.0007555832,0.001085533,0.000026478117,0.0006765468,0.0039522434],"genre_scores_gemma":[0.908786,0.0000037889617,0.08864657,0.0017965462,0.0003153534,0.000120873956,0.00013896507,0.000024161096,0.00016777434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566764,0.0003813717,0.0006481607,0.0011709519,0.0011357698,0.0009961003],"domain_scores_gemma":[0.99707687,0.000964907,0.00025161635,0.00091641524,0.0005133664,0.000276811],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043034868,0.00043879548,0.00044441255,0.00013154373,0.00047267906,0.00059761823,0.0014929742,0.00012912095,0.0010158708],"category_scores_gemma":[0.00010478435,0.0004528625,0.00020596274,0.00079771754,0.00022152248,0.00082665944,0.00044913136,0.0005725298,0.0011057912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004386664,0.0006788865,0.0011035731,0.000011314809,0.0001374986,0.00001144802,0.00042079279,0.032508958,0.00030887173,0.91721815,0.0087149,0.03884173],"study_design_scores_gemma":[0.00065404776,0.0002728584,0.03907922,0.00000767491,0.000005650531,0.000008831315,0.000007753129,0.5110617,0.00015131103,0.44620585,0.0022214917,0.0003235852],"about_ca_topic_score_codex":0.0005013103,"about_ca_topic_score_gemma":0.000101510945,"teacher_disagreement_score":0.70895606,"about_ca_system_score_codex":0.0007807377,"about_ca_system_score_gemma":0.00068364176,"threshold_uncertainty_score":0.99989736},"labels":[],"label_agreement":null},{"id":"W2403682178","doi":"","title":"Remarks on the complexity of signed k-independece on graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Signed graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.05864324606427127,"score_gpt":0.26354740712568364,"score_spread":0.20490416106141238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403682178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92556083,0.000119152755,0.008270798,0.010826971,0.007947295,0.001265245,0.000011380568,0.0005815112,0.045416802],"genre_scores_gemma":[0.9964404,0.0000017858879,0.0029287757,0.0005274684,0.00001266223,0.000016630951,0.0000021853175,0.000014525632,0.000055555727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709255,0.0005005892,0.00040476728,0.0006101019,0.0009962412,0.000395781],"domain_scores_gemma":[0.9965799,0.0007868128,0.00021775087,0.0018672503,0.00033951292,0.00020877215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016109509,0.00026737186,0.00036479326,0.00013152974,0.00015407846,0.00010150897,0.002224356,0.00011272603,0.000021434533],"category_scores_gemma":[0.00046482062,0.00019399023,0.00015318171,0.0008022958,0.00039017317,0.00018365576,0.0006163628,0.00037241916,0.000099250254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031332118,0.00041837312,0.0004464806,0.0000061321316,0.000020088397,0.00000967505,0.00044469984,0.00007537318,0.000065129054,0.992069,0.003990425,0.0024233048],"study_design_scores_gemma":[0.00083262235,0.0008739386,0.0052902177,0.000023187169,0.000005474271,0.000005923979,0.00004810552,0.010573499,0.0025832872,0.97910506,0.0004338452,0.00022482802],"about_ca_topic_score_codex":0.00009389665,"about_ca_topic_score_gemma":0.000011027154,"teacher_disagreement_score":0.07087957,"about_ca_system_score_codex":0.00013401454,"about_ca_system_score_gemma":0.0001455986,"threshold_uncertainty_score":0.7910692},"labels":[],"label_agreement":null},{"id":"W2403822002","doi":"","title":"A sufficient condition for Set Reconstruction.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Computer science; Programming language","score_opus":0.016800826709802014,"score_gpt":0.2629242137801512,"score_spread":0.24612338707034917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403822002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7357473,0.00012802951,0.24792482,0.0031420244,0.009249356,0.0010337979,0.000017811655,0.00078506605,0.0019718157],"genre_scores_gemma":[0.9701545,0.0000030414387,0.029405763,0.00029608476,0.000026926775,0.00003287497,0.0000109945,0.000006757715,0.00006306274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998499,0.00006814821,0.0003017922,0.00052845717,0.00024938016,0.0003532697],"domain_scores_gemma":[0.99870956,0.00018997859,0.00011670831,0.0006311599,0.00023411593,0.000118449396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042765515,0.00016700166,0.00021008508,0.0001146729,0.00021018297,0.00016762548,0.0006556519,0.00008549492,0.000016448355],"category_scores_gemma":[0.0001130663,0.00017098659,0.000117117364,0.00043350045,0.000055398832,0.00039267435,0.00009915578,0.00012400944,0.000040593957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066023103,0.0001945147,0.00021743902,0.000007441622,0.00000879036,0.0000038033872,0.00029773396,0.00012310939,0.00017682405,0.94750756,0.0028776168,0.048578568],"study_design_scores_gemma":[0.00091908936,0.00054328237,0.005188115,0.000012657457,0.000007082321,0.00006371252,0.000030523464,0.071686186,0.0010830758,0.91798973,0.0022259795,0.0002505767],"about_ca_topic_score_codex":0.0000062417394,"about_ca_topic_score_gemma":0.000001177378,"teacher_disagreement_score":0.2344072,"about_ca_system_score_codex":0.0001448034,"about_ca_system_score_gemma":0.000085221414,"threshold_uncertainty_score":0.69726306},"labels":[],"label_agreement":null},{"id":"W2403953928","doi":"","title":"Complexity, Information, Energy.","year":2007,"lang":"en","type":"article","venue":"publish.UP (University of Potsdam)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science","score_opus":0.017198694118276365,"score_gpt":0.1919672144202798,"score_spread":0.17476852030200343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403953928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010742303,0.000024993898,0.9501998,0.0024215605,0.00070975674,0.00010947821,0.0000132498035,0.0003059692,0.035472885],"genre_scores_gemma":[0.88666403,0.000007380542,0.11179243,0.000427668,0.000083418294,1.8889186e-7,0.000039195635,0.0000066682514,0.000979009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99821866,0.0001018952,0.0002751751,0.00033384957,0.00061161496,0.00045881263],"domain_scores_gemma":[0.9978791,0.00015425126,0.00025920686,0.0008102987,0.00064218265,0.00025496705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014396139,0.00017032429,0.00026483776,0.0005188031,0.0002803206,0.00025277844,0.0024225556,0.00012425038,0.00019985005],"category_scores_gemma":[0.00009186759,0.00021185707,0.00014958535,0.0012648265,0.00028771008,0.0056937863,0.0014499591,0.00016854404,0.000076624456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002121332,0.0002316458,0.0030593541,0.00005388452,0.00006127831,0.000027602116,0.005521285,0.00011446622,0.000060045153,0.59981865,0.031210192,0.35982037],"study_design_scores_gemma":[0.0027289193,0.00030624855,0.433386,0.00002967706,0.00003361855,0.0000785888,0.0037020794,0.0817033,0.00033722539,0.09922955,0.3773632,0.0011015963],"about_ca_topic_score_codex":0.0017454461,"about_ca_topic_score_gemma":0.0007243214,"teacher_disagreement_score":0.8759217,"about_ca_system_score_codex":0.00015159781,"about_ca_system_score_gemma":0.000151037,"threshold_uncertainty_score":0.8639281},"labels":[],"label_agreement":null},{"id":"W2404814723","doi":"10.7282/t31g0pdw","title":"The Minimum Oracle Circuit Size Problem","year":2015,"lang":"en","type":"article","venue":"View","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Circuit complexity; Complexity class; Kolmogorov complexity; Bounded function; Variety (cybernetics); Discrete mathematics; Function (biology); Computer science; Mathematics; Computational complexity theory; Random oracle; Combinatorics; Time complexity; Algorithm; Electronic circuit; Statistics; Physics","score_opus":0.049323548756205156,"score_gpt":0.2639180444509788,"score_spread":0.21459449569477362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404814723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014360143,0.026241947,0.82250845,0.04072619,0.006051706,0.0028465854,0.00000698015,0.0022736704,0.084984295],"genre_scores_gemma":[0.79115164,0.00038139423,0.19821504,0.0033869704,0.00089133217,0.00023831365,0.0000021117617,0.00006353181,0.0056696394],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983804,0.00017400202,0.00027037394,0.00040515003,0.0004024415,0.00036763318],"domain_scores_gemma":[0.9980172,0.00048667498,0.00008368611,0.0010453828,0.00018370977,0.0001833719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012128227,0.00014063666,0.00017876098,0.000019459612,0.00016660398,0.0003115544,0.0016275002,0.00004422045,0.000014842825],"category_scores_gemma":[0.0002936196,0.000092489594,0.000073446514,0.0005192876,0.00008325969,0.00025643088,0.000631468,0.00013483026,0.0005020262],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020198927,0.00011001819,0.00022902191,0.000031761818,0.000014304053,0.000016929744,0.0010049106,0.00004016934,0.000037597085,0.034619458,0.008574115,0.9553197],"study_design_scores_gemma":[0.0005226943,0.00021774897,0.002193348,0.000041842566,0.000010418105,0.00007187567,0.00006118595,0.023409612,0.00017624827,0.2560902,0.7167946,0.0004102272],"about_ca_topic_score_codex":0.000028557379,"about_ca_topic_score_gemma":0.000019923145,"teacher_disagreement_score":0.95490944,"about_ca_system_score_codex":0.00008035525,"about_ca_system_score_gemma":0.0002020189,"threshold_uncertainty_score":0.6452699},"labels":[],"label_agreement":null},{"id":"W2406211933","doi":"","title":"Recurrence Relations Of The Second Order And Infinite Series Identities.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Recurrence relation; Series (stratigraphy); Order (exchange); Pure mathematics; Combinatorics; Geology","score_opus":0.019422118267744495,"score_gpt":0.22019451655729352,"score_spread":0.20077239828954901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406211933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762438,0.00028374276,0.0035329964,0.000307107,0.0039759683,0.0002957307,0.000008024035,0.00010543397,0.015247225],"genre_scores_gemma":[0.99031365,0.0000101115775,0.008663594,0.00005191132,0.0000041214857,0.000010102112,4.7008396e-7,0.000005864181,0.0009401577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898106,0.00010708513,0.00026088997,0.0002731744,0.00020496208,0.00017284739],"domain_scores_gemma":[0.99875206,0.0001362646,0.00013649241,0.0007096858,0.00021288372,0.00005261625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028492144,0.00011632478,0.000151117,0.00005794758,0.00016939524,0.00006015111,0.00079478946,0.00005780987,0.00010481555],"category_scores_gemma":[0.00014835157,0.000094132665,0.00004382207,0.000606452,0.00025092645,0.0006509094,0.00075758534,0.00016412776,0.000013771205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002098661,0.00006549945,0.03126982,0.00001951136,0.000012488801,0.0000016028202,0.00319264,0.0000021254082,0.000022162103,0.963419,0.00048780578,0.0015052382],"study_design_scores_gemma":[0.00020593185,0.00007324318,0.14410104,0.000015769281,0.0000050781427,0.000016217253,0.00004585407,0.0008188696,0.00085654494,0.85280716,0.0009341335,0.00012016803],"about_ca_topic_score_codex":0.000037187885,"about_ca_topic_score_gemma":0.000039688606,"teacher_disagreement_score":0.11283122,"about_ca_system_score_codex":0.000022399054,"about_ca_system_score_gemma":0.0000916355,"threshold_uncertainty_score":0.38386187},"labels":[],"label_agreement":null},{"id":"W2407014563","doi":"","title":"The PI Index of Gated Amalgam.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Amalgam (chemistry); Mathematics; Index (typography); Pi; Statistics; Geometry; Chemistry; Computer science; World Wide Web","score_opus":0.009923892266603762,"score_gpt":0.23517233029302723,"score_spread":0.22524843802642347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407014563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.944861,0.0007209788,0.031511217,0.005808781,0.006202182,0.0007122114,0.0000020529426,0.000692952,0.00948864],"genre_scores_gemma":[0.9977651,0.000014334865,0.0019250866,0.00017346255,0.000010950763,0.000003793796,7.3151693e-7,0.000006467848,0.000100066965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982468,0.00014843485,0.00038038092,0.00037975304,0.00045611343,0.00038855514],"domain_scores_gemma":[0.99795187,0.00035269425,0.00016120887,0.00119183,0.00023661744,0.0001057689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006415302,0.00017195057,0.00023384904,0.00006746817,0.00020169771,0.00013603871,0.0018601199,0.000083121566,0.0000065511754],"category_scores_gemma":[0.0001560786,0.0001291516,0.00010278905,0.00079620036,0.000118513046,0.00023667897,0.00034615162,0.00021646368,0.00002873776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008321619,0.00020352224,0.002594191,0.000003875972,0.000014902945,0.000008515076,0.00027847665,0.000059842157,0.00017817438,0.92617,0.0011681827,0.06931201],"study_design_scores_gemma":[0.0005746477,0.00031025085,0.08499645,0.000010250816,0.0000043526197,0.000006791601,0.000014195693,0.036502983,0.001700769,0.8730565,0.0026389072,0.00018392902],"about_ca_topic_score_codex":0.000032505894,"about_ca_topic_score_gemma":0.00000382039,"teacher_disagreement_score":0.08240226,"about_ca_system_score_codex":0.00006389154,"about_ca_system_score_gemma":0.00009590289,"threshold_uncertainty_score":0.5266649},"labels":[],"label_agreement":null},{"id":"W2415296035","doi":"10.1090/proc/13967","title":"Some new computable structures of high rank","year":2017,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Countable set; Rank (graph theory); Computable number; Mathematics; Computable analysis; Omega; Categorical variable; Aleph; Combinatorics; Computable function; Discrete mathematics; Pure mathematics; Physics; Statistics","score_opus":0.021853250371490524,"score_gpt":0.27095165589895753,"score_spread":0.249098405527467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415296035","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6847553,0.00060601323,0.29755384,0.011028277,0.0013471164,0.002233602,0.000054638185,0.00055700366,0.0018641532],"genre_scores_gemma":[0.48982322,0.000056683108,0.5093749,0.00020156622,0.00034839974,0.00001682526,8.65878e-7,0.000032855096,0.00014468776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640435,0.000026641577,0.0009247425,0.0009322508,0.001163086,0.0005489177],"domain_scores_gemma":[0.99458486,0.0003492863,0.002892249,0.0014399659,0.0005197816,0.00021383027],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008357622,0.0005280435,0.0017344308,0.000050101527,0.00022061063,0.00033458692,0.0075391037,0.00021083468,0.000015490768],"category_scores_gemma":[0.000550029,0.0003679441,0.0011438775,0.0003556872,0.0016153685,0.00031458618,0.010329818,0.00089115574,0.0000050645444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039483515,0.00082916225,0.0013898212,0.0061451686,0.0010695903,9.1035986e-7,0.008173723,0.0017555114,0.002901864,0.9177922,0.023337042,0.036565498],"study_design_scores_gemma":[0.00025192765,0.00009322833,0.003473317,0.00026306335,0.000085325955,0.000010044249,0.00009762899,0.05578881,0.004026395,0.93548375,0.00006296636,0.00036356153],"about_ca_topic_score_codex":0.0004234358,"about_ca_topic_score_gemma":3.4946058e-7,"teacher_disagreement_score":0.21182105,"about_ca_system_score_codex":0.00014321019,"about_ca_system_score_gemma":0.00033064993,"threshold_uncertainty_score":0.9998773},"labels":[],"label_agreement":null},{"id":"W2437994630","doi":"10.1503/cmaj.160158","title":"Modelling the mind: the case of Warren S. McCulloch","year":2016,"lang":"en","type":"article","venue":"Canadian Medical Association Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Cognitive science; Computer science; Cognition; Data science; Artificial intelligence; Management science; Psychology; Neuroscience; Engineering","score_opus":0.014477552854681696,"score_gpt":0.22926889854490473,"score_spread":0.21479134569022304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2437994630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07200222,0.0001924854,0.7615286,0.1642888,0.0013178462,0.0001274882,0.000010602409,0.0000147500095,0.00051721255],"genre_scores_gemma":[0.9943365,0.000031959313,0.002554883,0.0019457617,0.0008915809,0.0000038958333,2.0710827e-7,0.000006191169,0.00022903651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977101,0.00040098312,0.00041668347,0.00017287332,0.00088565197,0.00041371386],"domain_scores_gemma":[0.99722344,0.0011207594,0.00025420863,0.0003317581,0.00042590994,0.00064392807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004047385,0.00009598166,0.00014661827,0.00007814828,0.00042465585,0.00012643108,0.0012276834,0.00015075426,0.0003640672],"category_scores_gemma":[0.0011987939,0.000043539963,0.000115457755,0.00030246805,0.00009145129,0.00017963433,0.00009126667,0.00048745595,0.00004399802],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013910543,0.000026503518,0.0015880218,0.0000025311904,0.00008058645,0.0010559881,0.0019910096,0.0017347826,0.000004681648,0.0059958273,0.018893981,0.9686247],"study_design_scores_gemma":[0.0007777711,0.0000721039,0.0008751868,0.00006812973,0.000025404961,0.0076875035,0.0004482984,0.82829773,0.0000542258,0.015764507,0.14567038,0.000258758],"about_ca_topic_score_codex":0.0050828676,"about_ca_topic_score_gemma":0.01202292,"teacher_disagreement_score":0.96836597,"about_ca_system_score_codex":0.0005575471,"about_ca_system_score_gemma":0.001785126,"threshold_uncertainty_score":0.7683809},"labels":[],"label_agreement":null},{"id":"W2438434303","doi":"10.1080/00029890.2004.11920042","title":"Positive Rational Solutions to <i> x <sup>y</sup> </i> = <i> y <sup>mx</sup> </i> : A Number-Theoretic Excursion","year":2004,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Excursion; Mathematics; Combinatorics; Algebra over a field; Art history; History; Pure mathematics; Political science; Law","score_opus":0.011211190447380805,"score_gpt":0.247225546980742,"score_spread":0.2360143565333612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2438434303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04158966,0.00004001416,0.9185808,0.013386074,0.00010003949,0.001175784,0.0001017426,0.0006532297,0.0243727],"genre_scores_gemma":[0.65918666,0.000003989193,0.33737248,0.002868382,0.00019516195,0.00019199999,0.000023936871,0.00004976227,0.00010760025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947995,0.00035902363,0.0009472208,0.0013629373,0.0012601848,0.0012711355],"domain_scores_gemma":[0.99574727,0.001250646,0.0002468915,0.0015491198,0.00038339963,0.0008226851],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008041733,0.0006251456,0.0008819603,0.00020027401,0.0005265868,0.00038496632,0.0018065526,0.00013130666,0.00017836464],"category_scores_gemma":[0.0007196925,0.00057963387,0.0003740556,0.0018752777,0.0010377669,0.00063233526,0.0011811875,0.00048946985,0.0021419553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004467575,0.0016485326,0.00010102554,0.000055880413,0.00007961439,0.00008723929,0.008650693,0.107074566,0.00010591743,0.8709017,0.0018963447,0.009353801],"study_design_scores_gemma":[0.0007287268,0.00068968703,0.00047482713,0.00015226903,0.00005175037,0.00014297814,0.0007045259,0.33540857,0.00024015571,0.65998805,0.00062626693,0.0007922345],"about_ca_topic_score_codex":0.00018384126,"about_ca_topic_score_gemma":0.00000809241,"teacher_disagreement_score":0.617597,"about_ca_system_score_codex":0.000520715,"about_ca_system_score_gemma":0.00035267568,"threshold_uncertainty_score":0.9996655},"labels":[],"label_agreement":null},{"id":"W2465729262","doi":"10.1017/s0960129516000219","title":"Computations with oracles that measure vanishing quantities","year":2016,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Timeout; Computation; Oracle; Computer science; Measure (data warehouse); Algorithm; Symbolic computation; Discrete mathematics; Theoretical computer science; Mathematics; Mathematical analysis; Data mining","score_opus":0.03399042463299039,"score_gpt":0.2662922667684897,"score_spread":0.23230184213549931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465729262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064792484,0.000042530533,0.93221956,0.0014952307,0.00047313407,0.00029930598,0.0000033056842,0.00034302162,0.00033141382],"genre_scores_gemma":[0.5722521,0.0000011546365,0.42751464,0.00015490087,0.000054499593,0.0000088768065,2.058975e-7,0.000008932293,0.0000046675204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960116,0.0001396586,0.00046509042,0.001112011,0.0014771906,0.00079442584],"domain_scores_gemma":[0.9971325,0.0010400771,0.00016092372,0.0011658685,0.0002528702,0.0002477926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012125409,0.0003465386,0.00041832382,0.00034800937,0.0003954409,0.000993484,0.0033488248,0.00006801966,0.000036462494],"category_scores_gemma":[0.00020120108,0.00019954027,0.00007481525,0.001372592,0.0012993949,0.0017817259,0.0013649493,0.00021525357,0.000029824534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008507073,0.00014026045,0.005283589,0.000061790946,0.00001244693,0.00009028906,0.0016144664,0.003424736,0.00029291055,0.6885644,0.0000734854,0.3004331],"study_design_scores_gemma":[0.0004960667,0.0001200507,0.023431577,0.0002188653,0.00000452676,0.00025148742,0.000031958618,0.37455606,0.0011705322,0.59921247,0.0000485777,0.00045784735],"about_ca_topic_score_codex":0.000018830708,"about_ca_topic_score_gemma":0.000034605084,"teacher_disagreement_score":0.50745964,"about_ca_system_score_codex":0.00021472093,"about_ca_system_score_gemma":0.00024999876,"threshold_uncertainty_score":0.95801896},"labels":[],"label_agreement":null},{"id":"W2478797303","doi":"10.1090/fim/028/05","title":"Representations over finite, local and global fields","year":2011,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Pure mathematics; Computer science; Mathematics","score_opus":0.02419630612439705,"score_gpt":0.2647051139433187,"score_spread":0.24050880781892164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478797303","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026469006,0.00004147784,0.5911947,0.00019777582,0.00007498482,0.00024061918,0.000014764626,0.00019596862,0.40801325],"genre_scores_gemma":[0.058656048,0.00010985751,0.70208985,0.005850022,0.00049140054,0.0001384229,0.000020052768,0.00016152588,0.2324828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974478,0.000042761454,0.00056839,0.0009432005,0.00054766325,0.00045016833],"domain_scores_gemma":[0.9973032,0.0007361961,0.00032029572,0.0012145487,0.00011366921,0.00031211314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024421865,0.0004848409,0.00074404344,0.000028706065,0.00017046659,0.00015926707,0.0009192599,0.0002976675,0.00024907952],"category_scores_gemma":[0.0000632705,0.00044249318,0.0005132322,0.00006857638,0.0017759729,0.00009623644,0.0012868729,0.0005215282,0.00012239986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002611338,0.000045307275,0.000019978332,0.00007460165,0.0001375291,0.000016741687,0.0012707532,0.000004851849,5.9474576e-7,0.8875337,0.0023131333,0.108580165],"study_design_scores_gemma":[0.00017828417,0.00018188923,0.0001464711,0.000063686944,0.00006676132,0.00004661718,0.000069795555,0.027871123,0.000003971887,0.96425474,0.0065736966,0.0005429738],"about_ca_topic_score_codex":0.00011850382,"about_ca_topic_score_gemma":0.000014582636,"teacher_disagreement_score":0.17553045,"about_ca_system_score_codex":0.00014534661,"about_ca_system_score_gemma":0.00013470651,"threshold_uncertainty_score":0.9998027},"labels":[],"label_agreement":null},{"id":"W2479956216","doi":"10.1007/978-1-4471-4069-6","title":"Fundamentals of Discrete Math for Computer Science","year":2012,"lang":"en","type":"book","venue":"Undergraduate topics in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Mathematics education; Computer science; Mathematics","score_opus":0.031752211745043564,"score_gpt":0.2879310124659907,"score_spread":0.2561788007209471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479956216","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004741076,0.00023876491,0.9836011,0.0015403896,0.0071196267,0.0014821292,0.00003227933,0.00023347928,0.0052781138],"genre_scores_gemma":[0.024166485,0.000050839604,0.9641131,0.0005966435,0.0016555558,0.00006307851,0.000017440118,0.000060896047,0.009275944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910921,0.00010904195,0.0014900627,0.002780917,0.0025882022,0.001939691],"domain_scores_gemma":[0.99380827,0.00063364726,0.00089611585,0.0031926369,0.00092163595,0.0005476742],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004481613,0.0008670323,0.0012331824,0.0017092129,0.00061397173,0.0010474946,0.010064369,0.0002919423,0.000006276885],"category_scores_gemma":[0.000087774286,0.0008206646,0.00037277525,0.002417395,0.0041628066,0.0022367286,0.0067201806,0.0006932776,0.000034600413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010960758,0.00038777714,0.00036485057,0.00044713126,0.00003580511,0.000026053594,0.0010931274,0.0041012354,0.00012338236,0.6642452,0.0014649142,0.32769957],"study_design_scores_gemma":[0.0007167488,0.00053122226,0.0008905008,0.00035229823,0.000021720149,0.0000629535,0.0000028634954,0.73559946,0.00068078964,0.24916455,0.010886594,0.0010902876],"about_ca_topic_score_codex":0.000034916935,"about_ca_topic_score_gemma":0.000025287904,"teacher_disagreement_score":0.73149824,"about_ca_system_score_codex":0.0017204402,"about_ca_system_score_gemma":0.0035577698,"threshold_uncertainty_score":0.9999895},"labels":[],"label_agreement":null},{"id":"W2485494195","doi":"10.1017/cbo9781139164900.018","title":"A Taste of Computability Theory","year":2002,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computability; Taste; Computer science; Mathematics; Psychology; Theoretical computer science; Neuroscience","score_opus":0.02516117644733451,"score_gpt":0.19044606809907086,"score_spread":0.16528489165173635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485494195","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009214167,0.00018202477,0.1868599,0.000020328012,0.0004437085,0.00056954473,0.00014694456,0.00033752716,0.8113479],"genre_scores_gemma":[0.005222703,0.00003491239,0.008183283,0.000058900365,0.0001198198,8.5360176e-7,0.000012715753,0.0000447482,0.98632205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968863,0.00024909916,0.0005028243,0.0012624493,0.00063188904,0.00046739922],"domain_scores_gemma":[0.9958458,0.0005173359,0.0005439559,0.0023540342,0.000465113,0.00027377025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053387374,0.0006102088,0.00092594407,0.00030506976,0.00017609158,0.00007515025,0.0030022424,0.0004638043,0.000017149303],"category_scores_gemma":[0.000032893084,0.0007022187,0.0005478191,0.000038036997,0.0007437985,0.00021709797,0.0028828953,0.00069621985,0.00002639042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030434736,0.00005756249,0.0000039061024,0.00015814311,0.0001267271,0.0001538507,0.00013385325,0.000042032912,0.000010888492,0.97981817,0.0037692974,0.015695125],"study_design_scores_gemma":[0.0013353875,0.00036330963,0.00021338224,0.00027839054,0.00024745855,0.00008953826,0.000020760093,0.022049585,0.00034431551,0.0029697514,0.97051334,0.0015747492],"about_ca_topic_score_codex":0.000066185785,"about_ca_topic_score_gemma":0.0000010160137,"teacher_disagreement_score":0.9768484,"about_ca_system_score_codex":0.00032866327,"about_ca_system_score_gemma":0.0001603701,"threshold_uncertainty_score":0.9995429},"labels":[],"label_agreement":null},{"id":"W2489870460","doi":"10.1090/gsm/134/06","title":"The global behavior of arithmetic functions","year":2012,"lang":"en","type":"book-chapter","venue":"Graduate studies in mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Arithmetic; Computer science; Mathematics","score_opus":0.1733927002476052,"score_gpt":0.3402442074772883,"score_spread":0.1668515072296831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489870460","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014716618,0.05892791,0.2802013,0.0031484305,0.019286036,0.006529485,0.00031337014,0.001056599,0.6290652],"genre_scores_gemma":[0.05354783,0.01670955,0.67989963,0.00018578039,0.0017315791,0.00101332,0.000027928547,0.00031873412,0.24656563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972843,0.00005481763,0.0009955188,0.00044518203,0.00075410114,0.0004661037],"domain_scores_gemma":[0.9964558,0.0009963042,0.0005454056,0.001515296,0.00041361843,0.00007360368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010858449,0.00046040837,0.0008229681,0.00010569155,0.00024448766,0.00006206119,0.0013948546,0.00015742399,0.0000078223575],"category_scores_gemma":[0.00028582456,0.00032391367,0.00026978445,0.00021059379,0.00081486744,0.00010913844,0.00178704,0.00041698103,0.00008977596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018210317,0.000257291,0.00015223707,0.00036395213,0.00026192638,0.00002167934,0.0021719947,0.000020627534,4.401499e-7,0.92928135,0.0012420538,0.06622461],"study_design_scores_gemma":[0.00020798373,0.00011279344,0.00045381463,0.00027977003,0.00023001536,0.000080858845,0.00038489138,0.0019998976,0.0000040092928,0.98793024,0.007837705,0.00047803292],"about_ca_topic_score_codex":0.0000055408086,"about_ca_topic_score_gemma":0.000060848928,"teacher_disagreement_score":0.39969838,"about_ca_system_score_codex":0.0003480321,"about_ca_system_score_gemma":0.00007275554,"threshold_uncertainty_score":0.9999213},"labels":[],"label_agreement":null},{"id":"W2490699745","doi":"10.1007/978-3-319-33924-5_4","title":"An Analogue-Digital Model of Computation: Turing Machines with Physical Oracles","year":2016,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Turing machine; Turing; Computation; Turing machine examples; Description number; Theoretical computer science; Universal Turing machine; Algorithm; Programming language","score_opus":0.05591443788604204,"score_gpt":0.2810422483651602,"score_spread":0.22512781047911812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490699745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129301185,0.00011523697,0.9690082,0.00025019175,0.00026924475,0.00044222904,0.00014993823,0.00033945794,0.016495386],"genre_scores_gemma":[0.9004583,0.000021866694,0.09753079,0.000053753116,0.00036082056,0.000011157616,0.00018204094,0.00005981824,0.0013214529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680746,0.00007336346,0.0007217339,0.0012022597,0.000824107,0.00037105015],"domain_scores_gemma":[0.99776846,0.00019713625,0.00061761047,0.00060899823,0.0005701052,0.0002376888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022574143,0.00063913246,0.0008325432,0.00033406747,0.00029283098,0.0002519342,0.00085060793,0.00017751855,0.000020488695],"category_scores_gemma":[0.000010886136,0.00052718446,0.00018400283,0.00020029143,0.0006065165,0.0012055386,0.00046908314,0.00031964266,0.000018537394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007273384,0.00033137604,0.00018119955,0.00022274836,0.00016648123,0.000016484653,0.0012305335,0.15018438,0.00008071577,0.5693271,0.00014335422,0.27804288],"study_design_scores_gemma":[0.00025928687,0.00033321616,0.00046060386,0.00008972832,0.000024464232,0.000019760184,0.000008379527,0.60393035,0.000014378102,0.39437863,0.000057910747,0.000423309],"about_ca_topic_score_codex":0.000024703659,"about_ca_topic_score_gemma":0.000041828556,"teacher_disagreement_score":0.8875282,"about_ca_system_score_codex":0.000057107598,"about_ca_system_score_gemma":0.00016150736,"threshold_uncertainty_score":0.99971795},"labels":[],"label_agreement":null},{"id":"W2491953867","doi":"10.1007/978-3-662-48433-3","title":"Algorithmic Game Theory","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Paderborn; Technische Universität Berlin; University of Waterloo; Tel Aviv University; Universität Wien; University of Glasgow; Universität des Saarlandes; Centre National de la Recherche Scientifique; Aarhus Universitet; University of Oxford; Rensselaer Polytechnic Institute","keywords":"Game theory; Computer science; Mathematical economics; Mathematics","score_opus":0.01742990945924583,"score_gpt":0.25476080015916064,"score_spread":0.2373308906999148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491953867","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003179777,0.0013800226,0.98363906,0.00066937675,0.0059898677,0.00083278335,0.000010809055,0.0006748682,0.006771408],"genre_scores_gemma":[0.014327786,0.00003407206,0.9772429,0.0027347181,0.0028764461,0.000052163658,0.000019360301,0.000106095205,0.0026064594],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99113876,0.00037775986,0.0009609238,0.003384768,0.00253226,0.0016055406],"domain_scores_gemma":[0.99263924,0.0016274789,0.00045695226,0.003875775,0.00082895096,0.0005715738],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005050079,0.001055475,0.0011394848,0.0014108917,0.00025517095,0.0012045272,0.010847946,0.00065041205,0.000028110422],"category_scores_gemma":[0.0005639924,0.0009561024,0.0002861613,0.0026263222,0.0017126297,0.001110804,0.0056980844,0.0018265441,0.00027114432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006185398,0.0000985729,0.000020165138,0.000046890556,0.000015659987,0.0002431006,0.001226849,0.0244755,0.000013598843,0.008250123,0.00055909704,0.96504426],"study_design_scores_gemma":[0.00030854827,0.00021338923,0.0000743164,0.00013442845,0.000007926925,0.00016665133,2.0423896e-7,0.45767012,0.00015485457,0.5363391,0.0041231858,0.0008072572],"about_ca_topic_score_codex":0.000024356246,"about_ca_topic_score_gemma":0.000037662605,"teacher_disagreement_score":0.964237,"about_ca_system_score_codex":0.002029113,"about_ca_system_score_gemma":0.0051002684,"threshold_uncertainty_score":0.99983233},"labels":[],"label_agreement":null},{"id":"W2492133817","doi":"10.1007/978-3-319-08123-6","title":"Unconventional Computation and Natural Computation","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computation; Natural (archaeology); Computer science; Natural computing; Algorithm; Theoretical computer science; History; Archaeology","score_opus":0.011678663683952503,"score_gpt":0.25589421334399687,"score_spread":0.24421554966004436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492133817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052565365,0.0005703656,0.9918771,0.00090386847,0.0044598165,0.00063589524,0.0000048445713,0.0003587245,0.0006637683],"genre_scores_gemma":[0.22650287,0.0000108286595,0.7708256,0.0012751581,0.00094751344,0.000016498418,0.000063711756,0.000042153948,0.00031566242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99407834,0.00023561566,0.00085849804,0.002408101,0.0015833538,0.0008361009],"domain_scores_gemma":[0.9962404,0.0015563853,0.0005027517,0.00085472903,0.0005883395,0.0002574092],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017890786,0.00072661194,0.0007933311,0.0011127245,0.0004255317,0.0011036103,0.0023457103,0.00036921643,0.000005988799],"category_scores_gemma":[0.00017995595,0.00070928776,0.00017319909,0.0013690315,0.0011213992,0.00094083394,0.0021145886,0.0011151107,0.00004112682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055835417,0.00006294801,0.00016850991,0.00011423758,0.000015177982,0.000037980233,0.0004031993,0.14342584,0.000028792767,0.0038205718,0.00019434305,0.85172284],"study_design_scores_gemma":[0.00041347486,0.00016046313,0.0019686138,0.00016317703,0.000007896903,0.00013316632,1.3657431e-7,0.7527174,0.00005066542,0.24345532,0.00034516858,0.0005845493],"about_ca_topic_score_codex":0.000025129782,"about_ca_topic_score_gemma":0.00008120531,"teacher_disagreement_score":0.8511383,"about_ca_system_score_codex":0.0008070819,"about_ca_system_score_gemma":0.0011368209,"threshold_uncertainty_score":0.99993336},"labels":[],"label_agreement":null},{"id":"W2493104602","doi":"10.1007/11780823","title":"Structural Information and Communication Complexity","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.020172738567078106,"score_gpt":0.249519412679978,"score_spread":0.22934667411289988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493104602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008066988,0.00037292478,0.9937556,0.000891008,0.0009137595,0.0005635906,0.000011732206,0.0002795925,0.0024050926],"genre_scores_gemma":[0.09007699,0.000017782899,0.9082697,0.0011093353,0.000282223,0.000014472682,0.00008594141,0.000018202632,0.00012534713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964262,0.00014744258,0.0007701658,0.001005369,0.0010162562,0.00063456857],"domain_scores_gemma":[0.9962909,0.0006267524,0.00045155804,0.0020710577,0.00040397458,0.00015572982],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011701724,0.00051831186,0.00054992276,0.0007596909,0.00049242686,0.0014102365,0.0041730828,0.0003153912,0.00000652677],"category_scores_gemma":[0.00012496019,0.0004874859,0.00008885021,0.0011073342,0.0016386088,0.0024526545,0.003580822,0.00093000237,0.000018734585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003846624,0.000024189252,0.00043316575,0.00009605507,0.0000069274406,0.0000087472545,0.0010784,0.028597064,0.000005393998,0.017783059,0.00037215906,0.951591],"study_design_scores_gemma":[0.00021210723,0.00006577268,0.005326801,0.00007895374,0.0000035215505,0.00006179605,1.3216179e-7,0.6696757,0.00003515752,0.3228209,0.0012991492,0.0004199715],"about_ca_topic_score_codex":0.00023255534,"about_ca_topic_score_gemma":0.0002887732,"teacher_disagreement_score":0.95117104,"about_ca_system_score_codex":0.0007052469,"about_ca_system_score_gemma":0.00079049903,"threshold_uncertainty_score":0.9997577},"labels":[],"label_agreement":null},{"id":"W2496454531","doi":"10.1002/9781118853887.oth1","title":"Pure and Applied Mathematics","year":2015,"lang":"en","type":"other","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Citation; Natural science; The arts; Mathematical sciences; Computer science; Art history; Mathematics education; Library science; Mathematics; Art; Visual arts; Philosophy; Epistemology","score_opus":0.02046021426278869,"score_gpt":0.2365862407227619,"score_spread":0.21612602645997323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496454531","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001630997,0.00023362388,0.31625032,0.00011989667,0.00021990095,0.00024141834,0.0000036215356,0.00062389823,0.6823057],"genre_scores_gemma":[0.000030364568,0.00001051091,0.57716507,0.00012196239,0.00018890157,0.000011803837,0.000003856494,0.00010477069,0.42236277],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987981,0.000012744852,0.0001654386,0.0004951062,0.00031673038,0.0002119073],"domain_scores_gemma":[0.9987505,0.000046887882,0.00009813411,0.0009348545,0.000034277866,0.00013532765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022428954,0.0002445139,0.00033934912,0.00012585329,0.000019839128,0.00013991764,0.00084117876,0.000214788,0.00036883444],"category_scores_gemma":[0.000016862017,0.00019152465,0.00002867872,0.0001930048,0.00006290084,0.000035966714,0.00081947993,0.00014131675,0.00029082785],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.969392e-7,0.000059274036,0.0000018340263,0.00010366203,0.000018678204,0.000005768806,0.00027056932,0.0000016301997,0.000002501211,0.07273176,0.9040427,0.022761397],"study_design_scores_gemma":[0.00030205262,0.00004376829,0.000008006542,0.000040883184,0.000012204303,0.0000531841,0.000044409233,0.011787298,0.000015335767,0.071192265,0.91592777,0.0005728014],"about_ca_topic_score_codex":0.00001479445,"about_ca_topic_score_gemma":0.000046711215,"teacher_disagreement_score":0.26091474,"about_ca_system_score_codex":0.000026427813,"about_ca_system_score_gemma":0.00007004282,"threshold_uncertainty_score":0.7810149},"labels":[],"label_agreement":null},{"id":"W2501449615","doi":"10.1007/978-3-319-41312-9","title":"Unconventional Computation and Natural Computation","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computation; Computer science; Natural computing; Natural (archaeology); Artificial intelligence; Algorithm; History; Archaeology","score_opus":0.01255930020650609,"score_gpt":0.2594622280887126,"score_spread":0.24690292788220652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501449615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039893715,0.0007163439,0.99112993,0.0014314101,0.0046756216,0.00065144437,0.00001017244,0.0003516614,0.00063444575],"genre_scores_gemma":[0.19908553,0.000029488183,0.79789686,0.0011077572,0.0011838231,0.000022248345,0.000045184894,0.00005134994,0.0005777514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99414355,0.00019211831,0.0008312497,0.002403435,0.0015604635,0.0008691734],"domain_scores_gemma":[0.99621373,0.0016157435,0.0004805044,0.00082571566,0.0006090452,0.0002552707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014484407,0.0007129611,0.0007195892,0.0011191955,0.00040171106,0.00093197846,0.0023087128,0.00035457037,0.0000095841115],"category_scores_gemma":[0.00017460097,0.0006065162,0.00017030287,0.0012085045,0.0012394686,0.0012396026,0.002245786,0.0008511504,0.00005182893],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006717711,0.00005784162,0.00016778878,0.0000779942,0.00001639772,0.00005829437,0.00033602587,0.025023887,0.000064962966,0.00372594,0.00016401606,0.97030014],"study_design_scores_gemma":[0.0004925827,0.00013941167,0.0018183308,0.00024832506,0.0000067475876,0.00014140236,1.2965792e-7,0.6753576,0.00009024881,0.3208494,0.00026379252,0.0005920656],"about_ca_topic_score_codex":0.00001737108,"about_ca_topic_score_gemma":0.00004660011,"teacher_disagreement_score":0.9697081,"about_ca_system_score_codex":0.0010169096,"about_ca_system_score_gemma":0.001436226,"threshold_uncertainty_score":0.9996386},"labels":[],"label_agreement":null},{"id":"W2501566787","doi":"10.1017/cbo9780511760860.006","title":"Automatic sequences and a lgebraic series","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Series (stratigraphy); Computer science; Content (measure theory); Information retrieval; Mathematics; Geology","score_opus":0.016253267344454866,"score_gpt":0.18862515111956055,"score_spread":0.17237188377510568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501566787","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015306551,0.00020427222,0.018312614,0.00014075988,0.0007293338,0.00058894407,0.00006525487,0.0008177165,0.97761047],"genre_scores_gemma":[0.002699562,0.00005590153,0.020400831,0.000080754864,0.0001360037,0.0000014527986,0.000008527452,0.00003291127,0.9765841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795556,0.000064235835,0.0002486081,0.0009675534,0.00038985966,0.0003741884],"domain_scores_gemma":[0.99796444,0.00016729633,0.0002566659,0.0011673962,0.00018250503,0.00026171355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020394339,0.00048982876,0.00053876085,0.00023756274,0.0003351593,0.00027796542,0.0016853483,0.0004617028,0.0000073525675],"category_scores_gemma":[0.000022048363,0.0005374747,0.00016753456,0.000020835512,0.0007619216,0.00044934615,0.0020334448,0.0007381851,0.000015482728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005491982,0.000008881456,0.000006122848,0.00012139726,0.0000610407,0.00032670752,0.0001434973,9.873255e-7,0.00006495963,0.9862906,0.00052608957,0.0124442475],"study_design_scores_gemma":[0.0007102264,0.00031541564,0.0003557649,0.00026484928,0.00016801851,0.0005958472,0.000035659752,0.009023365,0.00076043926,0.0035645356,0.9825058,0.001700083],"about_ca_topic_score_codex":0.00011020032,"about_ca_topic_score_gemma":0.000013887796,"teacher_disagreement_score":0.98272604,"about_ca_system_score_codex":0.00012574013,"about_ca_system_score_gemma":0.00023224516,"threshold_uncertainty_score":0.9997077},"labels":[],"label_agreement":null},{"id":"W2503176705","doi":"10.5539/jmr.v8n4p195","title":"On Dynamical Systems for Transport Logistic and Communications","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Irrational number; Unit square; Competition (biology); Probabilistic logic; Combinatorics; Base (topology); Path (computing); Algebraic number; Plan (archaeology); Discrete mathematics; Geometry; Computer science; Mathematical analysis; Statistics","score_opus":0.25587845907945184,"score_gpt":0.43762530995765836,"score_spread":0.18174685087820652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503176705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023610428,0.0002618202,0.9715301,0.0037726893,0.00013713415,0.0003182481,0.000006649555,0.000015585674,0.00034739013],"genre_scores_gemma":[0.84118944,0.00017783503,0.15837982,0.000010521832,0.00005732645,0.00001579663,2.0320769e-7,0.000009399782,0.00015962476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811167,0.00021009822,0.00052407384,0.00014759203,0.0007425089,0.0002640527],"domain_scores_gemma":[0.99147815,0.0066155237,0.00016515014,0.00084634824,0.00074510043,0.00014971287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004915333,0.0000842513,0.00026314807,0.00024788722,0.00014395456,0.000102052625,0.0016645361,0.000059194295,0.0000034753805],"category_scores_gemma":[0.0012164116,0.000048974343,0.00007817948,0.00019451497,0.00026454678,0.00016003767,0.00024532236,0.00027003154,0.000008508697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023643115,0.00091642776,0.00025208166,0.00035207084,0.000057107118,0.000023150104,0.0008563805,0.0001187182,0.00064257317,0.97851664,0.000858776,0.017382428],"study_design_scores_gemma":[0.0009827063,0.0010750756,0.0010690137,0.00049670914,0.000012581174,0.00031265398,0.00014563177,0.49076062,0.000053602005,0.5037541,0.001187474,0.0001498601],"about_ca_topic_score_codex":0.0000047531034,"about_ca_topic_score_gemma":0.000004369143,"teacher_disagreement_score":0.81757903,"about_ca_system_score_codex":0.00013538738,"about_ca_system_score_gemma":0.00013868109,"threshold_uncertainty_score":0.309315},"labels":[],"label_agreement":null},{"id":"W2511027643","doi":"10.1142/s0219061316500070","title":"Tame failures of the unique branch hypothesis and models of ADℝ + Θ is regular","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Transitive relation; Mathematics; Extension (predicate logic); Core model; Core (optical fiber); Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.03277469884826001,"score_gpt":0.23159196586037303,"score_spread":0.19881726701211302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511027643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16715176,0.0002358961,0.8233799,0.008550362,0.00007090997,0.00014613324,0.0000028890356,0.000012356571,0.000449805],"genre_scores_gemma":[0.8459701,0.000035294594,0.15377337,0.00012770997,0.00003196123,0.0000012246412,5.9737286e-9,0.000006080198,0.00005428809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810183,0.00020790577,0.00077612407,0.00017410624,0.0005578692,0.00018218001],"domain_scores_gemma":[0.99710304,0.0012921189,0.00061472564,0.0005880723,0.00030663295,0.000095394345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011549529,0.00014104448,0.0005150879,0.00008889536,0.000034891105,0.000032822252,0.0011153148,0.00008985452,0.000051412662],"category_scores_gemma":[0.00064054184,0.00006339829,0.00023237993,0.00022217073,0.00029990345,0.00035542762,0.00038837313,0.0001336546,0.0000026336397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047620088,0.00090487406,0.00035813297,0.0005399793,0.00017235577,0.00001984619,0.0022693893,0.00034680314,0.024267681,0.8815497,0.00087356404,0.08865005],"study_design_scores_gemma":[0.00029665604,0.00020599434,0.0009496918,0.0002690398,0.000022512642,0.00019506156,0.000020604917,0.0096405735,0.014897336,0.97337353,0.00004323231,0.00008578505],"about_ca_topic_score_codex":0.0000017191414,"about_ca_topic_score_gemma":4.7460986e-7,"teacher_disagreement_score":0.6788183,"about_ca_system_score_codex":0.000030676936,"about_ca_system_score_gemma":0.00007554396,"threshold_uncertainty_score":0.25853074},"labels":[],"label_agreement":null},{"id":"W2523890437","doi":"","title":"Algorithms and Computation, 20th International ymposium, ISAAC","year":2009,"lang":"en","type":"article","venue":"International Symposium on Algorithms and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computation; Algorithm; Theoretical computer science","score_opus":0.015489794918029135,"score_gpt":0.2824291897814106,"score_spread":0.2669393948633814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523890437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025274124,0.00023167649,0.9363315,0.02734268,0.0040302244,0.0005856521,0.000046114536,0.00056821725,0.0055898093],"genre_scores_gemma":[0.8188268,0.0002838336,0.17493391,0.004284352,0.0011166042,0.000042794276,0.0001802592,0.00004166789,0.0002897904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995742,0.00016410608,0.0008792864,0.0014369899,0.0012681154,0.0005094837],"domain_scores_gemma":[0.99780196,0.00036914798,0.0003953298,0.00037382916,0.0007249389,0.00033481413],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006121643,0.0005652059,0.00045176796,0.00046142537,0.00037405925,0.0011884418,0.0010878277,0.00020473778,0.000026237914],"category_scores_gemma":[0.00006449759,0.00057112594,0.00014972218,0.00047046717,0.00016939055,0.0012882235,0.0004668917,0.00040463943,0.00005372999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007788568,0.00077812996,0.0008498837,0.000017308654,0.00018326286,0.00008176636,0.0013317759,0.024639282,0.0008955096,0.033607405,0.0016640315,0.93587375],"study_design_scores_gemma":[0.0017305616,0.0006600822,0.030229477,0.00006138296,0.00002043596,0.0002905759,0.00006163809,0.9301585,0.0003157009,0.0307286,0.005082325,0.0006607502],"about_ca_topic_score_codex":0.0001063309,"about_ca_topic_score_gemma":0.000006250524,"teacher_disagreement_score":0.935213,"about_ca_system_score_codex":0.00028735047,"about_ca_system_score_gemma":0.00007838639,"threshold_uncertainty_score":0.9998484},"labels":[],"label_agreement":null},{"id":"W2531200539","doi":"10.1145/2933575.2935311","title":"Complexity Theory of (Functions on) Compact Metric Spaces","year":2016,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Mathematics; Bounded function; Computability; Discrete mathematics; Metric space; PH; Binary number; Kolmogorov complexity; Structural complexity theory; Generalization; Computational complexity theory; Upper and lower bounds; Theoretical computer science; Complexity class; Quantum complexity theory; Time complexity; Algorithm; Computer science; Quantum information","score_opus":0.06461596154179396,"score_gpt":0.2756515449357339,"score_spread":0.21103558339393996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531200539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030571576,0.000034441953,0.93488747,0.0025612172,0.00050766027,0.00016422769,0.000009991878,0.00030610414,0.030957337],"genre_scores_gemma":[0.9734167,0.0000031234883,0.024747927,0.00016529205,0.00005274106,0.000002613923,5.10996e-7,0.000006073199,0.0016050125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837583,0.00024497588,0.0002836026,0.00043394318,0.00038275652,0.00027889735],"domain_scores_gemma":[0.9969129,0.0016992573,0.00011160219,0.0009985153,0.00015563502,0.00012209993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007560072,0.0001617361,0.00027254358,0.00029896363,0.00009907834,0.000059105485,0.000983274,0.000045010896,0.0005210773],"category_scores_gemma":[0.00026329054,0.00009262381,0.00013733807,0.00096783036,0.00027290452,0.00029380206,0.00028948407,0.00008172364,0.00030516635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014718463,0.00037273872,0.0036472324,0.000008581634,0.00003791266,0.0000021760727,0.00009842506,0.00009124514,0.00038859012,0.8911543,0.0024562306,0.101727866],"study_design_scores_gemma":[0.001300464,0.0011388186,0.35161194,0.000045579753,0.000021458995,0.000027278986,0.000101928475,0.01785501,0.007851508,0.61119926,0.008217566,0.0006291899],"about_ca_topic_score_codex":0.00006989222,"about_ca_topic_score_gemma":0.000020446407,"teacher_disagreement_score":0.9428451,"about_ca_system_score_codex":0.00007868854,"about_ca_system_score_gemma":0.00006350474,"threshold_uncertainty_score":0.5705431},"labels":[],"label_agreement":null},{"id":"W2544689273","doi":"","title":"AI Algorithms and Stochastic Game‐play","year":2015,"lang":"en","type":"article","venue":"URSCA Proceedings","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Computer science; Algorithm; Artificial intelligence","score_opus":0.0262662365523519,"score_gpt":0.25994318456317317,"score_spread":0.23367694801082128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544689273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064508125,0.00063426915,0.91976684,0.008120893,0.001295694,0.0006555971,0.0000041042763,0.0011230082,0.003891494],"genre_scores_gemma":[0.91670614,0.000004492192,0.08127913,0.001117385,0.00042059505,0.000044401153,0.0000014136489,0.000028113895,0.00039830786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976941,0.0000141748,0.00030293837,0.0008454557,0.0005902556,0.0005531046],"domain_scores_gemma":[0.9985207,0.00007658526,0.00011018658,0.0003026126,0.00050095294,0.0004889999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069968286,0.00028757373,0.00030956112,0.000181141,0.000105024854,0.00054741296,0.0009836929,0.00012113639,0.000008185745],"category_scores_gemma":[0.00027366832,0.00026515598,0.00005698092,0.00061605324,0.00016085054,0.0010616069,0.0008701973,0.00029491092,0.00008579158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009812208,0.0011688874,0.008968883,0.00030949837,0.00019697835,0.000110498215,0.05552313,0.00101924,0.0013853613,0.26479784,0.096057616,0.57036394],"study_design_scores_gemma":[0.0016623607,0.00086257514,0.004583134,0.00006381557,0.00003253917,0.0006139346,0.00039271073,0.8557712,0.0005665319,0.11931158,0.015137143,0.0010024663],"about_ca_topic_score_codex":0.00003213241,"about_ca_topic_score_gemma":0.0000016653395,"teacher_disagreement_score":0.85475194,"about_ca_system_score_codex":0.00012123049,"about_ca_system_score_gemma":0.00012336265,"threshold_uncertainty_score":0.9999801},"labels":[],"label_agreement":null},{"id":"W2565150049","doi":"10.4171/rmi/913","title":"On $L^p$-improving measures","year":2016,"lang":"es","type":"article","venue":"Revista Matemática Iberoamericana","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.018805420887086425,"score_gpt":0.2513995398275867,"score_spread":0.2325941189405003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565150049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08550818,0.0036298013,0.8700724,0.019458555,0.002405945,0.0019968546,0.00015508698,0.0016154478,0.015157721],"genre_scores_gemma":[0.9830449,0.00041255835,0.013512045,0.0010726022,0.0004635016,0.00005368813,0.0000022378476,0.000106702515,0.0013317289],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9927701,0.00084751623,0.0011988805,0.002155394,0.0014796319,0.0015485199],"domain_scores_gemma":[0.9932254,0.0016540147,0.0006795539,0.003298119,0.00041574473,0.0007271704],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013623007,0.0009053037,0.0012174362,0.00035983737,0.0003616185,0.0013837536,0.0027254722,0.00021035872,0.00041278577],"category_scores_gemma":[0.001566851,0.0006350982,0.00044714098,0.0013122016,0.00081097044,0.0006304841,0.0011683153,0.0004044519,0.002288825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039683888,0.00031192336,0.00078777986,0.0002819291,0.00009948366,0.000094336705,0.00012355794,0.000017909026,0.0022128366,0.16919348,0.0023787022,0.82445836],"study_design_scores_gemma":[0.007816911,0.009760923,0.11072746,0.010853528,0.0009982712,0.000678833,0.00026332305,0.058071103,0.009109043,0.04177042,0.7364496,0.013500586],"about_ca_topic_score_codex":0.00030131894,"about_ca_topic_score_gemma":0.0000040916384,"teacher_disagreement_score":0.89753675,"about_ca_system_score_codex":0.0007666425,"about_ca_system_score_gemma":0.0004760264,"threshold_uncertainty_score":0.9996529},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04978698707724363,"score_gpt":0.31415341686769754,"score_spread":0.2643664297904539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570115677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025668586,0.00008340479,0.97191733,0.00047622577,0.0007313661,0.00055498123,0.000024589812,0.00030234086,0.00024115111],"genre_scores_gemma":[0.7977042,0.000003049099,0.2016339,0.0004024276,0.00005378082,0.00010054737,0.000014846739,0.00001531637,0.000071919814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725866,0.00087001064,0.0004987015,0.0005584081,0.0003057063,0.00050851254],"domain_scores_gemma":[0.9957654,0.0028495344,0.00011456159,0.000932544,0.00016209263,0.00017590103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027511134,0.0002637852,0.00039131433,0.00080950087,0.00031801895,0.0001256179,0.0010317976,0.000109749504,0.00010744127],"category_scores_gemma":[0.00014706793,0.00025897333,0.0003308725,0.002075788,0.00014994963,0.00073734205,0.000041958327,0.00025750796,0.000052585256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011572111,0.0011779406,0.0009057587,0.000027172468,0.0003839871,0.0000015615066,0.0035836597,0.1988971,0.000035709505,0.42081496,0.00002200159,0.37403443],"study_design_scores_gemma":[0.0009071007,0.0001630205,0.020496199,0.0000104640385,0.00016554446,0.0000071237914,0.00028526678,0.30780575,0.0007248313,0.66876674,0.0002142348,0.00045373588],"about_ca_topic_score_codex":0.00002001781,"about_ca_topic_score_gemma":0.000033696495,"teacher_disagreement_score":0.7720356,"about_ca_system_score_codex":0.00019740482,"about_ca_system_score_gemma":0.000066312605,"threshold_uncertainty_score":0.99998623},"labels":[],"label_agreement":null},{"id":"W2571680230","doi":"","title":"On implicit degree sum condition for long cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music)","score_opus":0.024488136938004713,"score_gpt":0.2721272971649703,"score_spread":0.24763916022696558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571680230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60185343,0.000049997492,0.38718173,0.0026785717,0.005292348,0.00085082924,0.000021383203,0.0005745847,0.0014971149],"genre_scores_gemma":[0.99549294,0.0000037759492,0.0039374,0.00024290147,0.000033214837,0.00009274694,0.0000051155803,0.000021197882,0.00017071882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980585,0.000083303705,0.00031020952,0.00069840706,0.00034235689,0.00050721207],"domain_scores_gemma":[0.99748033,0.0010171258,0.00012900507,0.0010098474,0.00020183918,0.00016187114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045062383,0.00023414334,0.0002628788,0.000119671946,0.00018245493,0.000125025,0.0010932578,0.00011649247,0.000027140648],"category_scores_gemma":[0.00022814747,0.00017814733,0.00014632473,0.0002709298,0.000082912185,0.00044412533,0.00032002787,0.000102884056,0.0001825289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012988606,0.0001712636,0.0017644555,0.00001219975,0.00001661704,0.000008036171,0.000050553106,0.000008150078,0.00043388116,0.9318912,0.0029238453,0.062706806],"study_design_scores_gemma":[0.0016808969,0.00045019982,0.042797413,0.000038109527,0.000007175991,0.000011688771,0.0000025989214,0.0029425826,0.0036107625,0.9473378,0.00081473374,0.00030604505],"about_ca_topic_score_codex":0.000015869009,"about_ca_topic_score_gemma":0.000009496101,"teacher_disagreement_score":0.39363948,"about_ca_system_score_codex":0.00022744719,"about_ca_system_score_gemma":0.000074241485,"threshold_uncertainty_score":0.7264637},"labels":[],"label_agreement":null},{"id":"W2575020491","doi":"","title":"The N-Fixed Point Property In Posets.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Point (geometry); Combinatorics; Pure mathematics; Geometry","score_opus":0.012704410713185989,"score_gpt":0.22548233324146996,"score_spread":0.21277792252828398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575020491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85866374,0.0007983507,0.025998004,0.0751755,0.018985432,0.002303823,0.0000056922513,0.0013679483,0.016701484],"genre_scores_gemma":[0.99676454,0.000024038263,0.0022155924,0.00018836978,0.000013097545,0.00004528973,2.7870564e-7,0.000013001526,0.0007357745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978987,0.00026002812,0.0003653356,0.0005531788,0.0003906066,0.0005321419],"domain_scores_gemma":[0.9977648,0.0006081555,0.000089813606,0.0012899026,0.00013072192,0.00011658641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107361,0.00019304168,0.00020682515,0.00007250198,0.00019173502,0.00018082384,0.0019071017,0.00007514251,0.000011991692],"category_scores_gemma":[0.00034615936,0.00008443655,0.00008083413,0.0005207376,0.00014262063,0.0004471886,0.0008881859,0.0001694198,0.00019554821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011982764,0.00020576759,0.005828045,0.0000050041444,0.000011144347,0.000032191663,0.000338034,0.0000027785684,0.0006843937,0.8230937,0.0026979735,0.16708897],"study_design_scores_gemma":[0.0012322154,0.00019267679,0.028248936,0.0000335301,0.0000020503692,0.000019516596,0.000016077904,0.0041749543,0.0014183145,0.9521857,0.012186794,0.00028926996],"about_ca_topic_score_codex":0.00010020615,"about_ca_topic_score_gemma":0.000050822844,"teacher_disagreement_score":0.16679971,"about_ca_system_score_codex":0.00022059635,"about_ca_system_score_gemma":0.00013114401,"threshold_uncertainty_score":0.3543901},"labels":[],"label_agreement":null},{"id":"W2577580961","doi":"10.1142/s0129054112400023","title":"ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Boolean function; Computer science; And-inverter graph; Boolean circuit; Product term; Transient (computer programming); Boolean expression; Mathematics; Theoretical computer science; Calculus (dental); Algorithm; Two-element Boolean algebra; Algebra over a field; Programming language; Medicine; Pure mathematics","score_opus":0.12915129891804625,"score_gpt":0.3521225510733017,"score_spread":0.22297125215525546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577580961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40402746,0.000038602182,0.58979505,0.002729405,0.002971135,0.00016558699,0.000011930615,0.0000042778233,0.0002565634],"genre_scores_gemma":[0.9595082,0.0000035594494,0.040295552,0.0000707013,0.000112025875,0.0000022441095,7.957451e-7,0.0000032025973,0.0000037460254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953925,0.0002923447,0.0010199016,0.00018202669,0.002937044,0.00017618944],"domain_scores_gemma":[0.99108267,0.0007714585,0.0013716797,0.000719115,0.005978332,0.00007673817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046785716,0.00011784633,0.00024976418,0.0004371788,0.00017293397,0.000054379267,0.0033420206,0.000028549757,0.000046635825],"category_scores_gemma":[0.0007760449,0.00007373867,0.00026810734,0.0010761588,0.0017473862,0.0009112951,0.00047367456,0.0001837517,0.000001914795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005746668,0.002967491,0.004242052,0.00002654748,0.0002775398,7.311705e-7,0.0053347885,0.13354106,0.017242199,0.6977024,0.00072700484,0.13788068],"study_design_scores_gemma":[0.0007971698,0.0004323221,0.42616758,0.00024228217,0.00008325328,0.0001067678,0.00012741872,0.4981849,0.017720226,0.055763464,0.00022475484,0.00014986767],"about_ca_topic_score_codex":0.000031156746,"about_ca_topic_score_gemma":0.00000901519,"teacher_disagreement_score":0.641939,"about_ca_system_score_codex":0.00015289677,"about_ca_system_score_gemma":0.000739845,"threshold_uncertainty_score":0.64383173},"labels":[],"label_agreement":null},{"id":"W2580322694","doi":"10.31165/nk.2016.96.486","title":"Algorithmic love: “Quit playin’ games with my &lt;3”","year":2016,"lang":"en","type":"article","venue":"Networking Knowledge Journal of the MeCCSA Postgraduate Network","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Subject (documents); Mythology; Object (grammar); Sign (mathematics); Meditation; Theme (computing); Ideal (ethics); Computer science; Epistemology; Function (biology); Aesthetics; Sociology; Cognitive science; Psychology; Artificial intelligence; Philosophy; Art; Literature; Mathematics; World Wide Web","score_opus":0.01464837453060616,"score_gpt":0.2277176945632711,"score_spread":0.21306932003266493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580322694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007818237,0.009092693,0.9542401,0.009322149,0.015735907,0.0007881715,0.0000034505624,0.00022117229,0.0027781527],"genre_scores_gemma":[0.86886847,0.00074067136,0.11077453,0.0006269349,0.01610208,0.000013636374,6.7693844e-7,0.00015099386,0.0027220238],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99388653,0.0012444633,0.00137994,0.0008058329,0.001192145,0.0014910892],"domain_scores_gemma":[0.9935037,0.0018035123,0.0015566063,0.0017402725,0.00095925055,0.00043665234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035068942,0.0007223701,0.0010181387,0.00022181477,0.00045127308,0.0004003166,0.004947922,0.00022590323,0.000029955329],"category_scores_gemma":[0.00015227795,0.000365941,0.0005971959,0.002055027,0.00043082758,0.000741739,0.001560349,0.0009091554,0.00014231075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037381618,0.0005076715,0.0074734925,0.00004851477,0.00070496264,0.00024509654,0.0016607853,0.03261445,0.00023331303,0.0034702632,0.09367383,0.85899377],"study_design_scores_gemma":[0.01222234,0.0052051,0.022838356,0.009127229,0.00085106055,0.009075178,0.000086700784,0.30060026,0.0018410886,0.14826256,0.4856342,0.0042559057],"about_ca_topic_score_codex":0.000003825391,"about_ca_topic_score_gemma":0.000029049832,"teacher_disagreement_score":0.8610502,"about_ca_system_score_codex":0.0004848695,"about_ca_system_score_gemma":0.0005827867,"threshold_uncertainty_score":0.99987924},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032831277474955366,"score_gpt":0.28600188400938276,"score_spread":0.2531706065344274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582697902","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007431754,0.00025244255,0.99029744,0.0023478388,0.0015212756,0.001533547,0.000012982897,0.0005210879,0.00277024],"genre_scores_gemma":[0.016087322,0.00008492376,0.9693847,0.0014735048,0.004776554,0.00022725698,0.00002911895,0.000062149455,0.007874517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940065,0.00013021655,0.0007030562,0.0031370078,0.0011858324,0.0008373571],"domain_scores_gemma":[0.9957202,0.00020281838,0.00024382494,0.0027192575,0.0005255096,0.0005883671],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001486596,0.00055108994,0.00063129136,0.0011197451,0.00060773065,0.0006698799,0.0054882583,0.00021111568,0.000011752234],"category_scores_gemma":[0.00005351698,0.0005839806,0.00007409712,0.0020233404,0.0010200695,0.0015129303,0.0031480785,0.0006454461,0.00014038452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058627916,0.0004085978,0.00005115345,0.00008738138,0.0000090639,0.000046190427,0.0016923775,0.0056608976,0.00012568936,0.27504808,0.0064094164,0.7104553],"study_design_scores_gemma":[0.000336623,0.000555545,0.0046940222,0.00006302535,0.000006937182,0.00042355497,0.0000022261308,0.8141808,0.00014556416,0.08789986,0.090376794,0.0013150291],"about_ca_topic_score_codex":0.000019166444,"about_ca_topic_score_gemma":0.000047638565,"teacher_disagreement_score":0.8085199,"about_ca_system_score_codex":0.0007811171,"about_ca_system_score_gemma":0.0011106074,"threshold_uncertainty_score":0.99989253},"labels":[],"label_agreement":null},{"id":"W2583707524","doi":"10.4230/lipics.itcs.2017.27","title":"An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity","year":2016,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Exploratory Research for Advanced Technology; National Institute of Informatics","keywords":"Homomorphism; Mathematics; Quantifier elimination; Rank (graph theory); Discrete mathematics; Upper and lower bounds; Quantifier (linguistics); Isomorphism (crystallography); Combinatorics; Sentence; Proof complexity; Function (biology); Order (exchange); Computer science","score_opus":0.09023575595849773,"score_gpt":0.189697042923352,"score_spread":0.09946128696485426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583707524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4984274,0.0000062312706,0.5001553,0.00016399444,0.00023844742,0.00015760619,0.0000125580345,0.00017527105,0.00066315493],"genre_scores_gemma":[0.9962449,0.000007403149,0.0033082105,0.000118984746,0.00006239386,0.000001046236,0.000007254975,0.000012424857,0.000237396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786896,0.00027711963,0.0002326188,0.0010733237,0.00012032439,0.00042764537],"domain_scores_gemma":[0.9977116,0.00028722352,0.00013497529,0.0015188584,0.00015911215,0.00018823074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042507923,0.00022754984,0.0002620089,0.00018243176,0.00013954395,0.00012336737,0.0019478532,0.00013159205,0.00014153834],"category_scores_gemma":[0.00006381374,0.00020451989,0.00009819917,0.0008202637,0.00028880715,0.002087817,0.0005316415,0.00016434114,0.000072613315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012437275,0.001120263,0.089203596,0.000012335178,0.00005180769,0.00031446325,0.0008791283,0.002337109,0.010752736,0.87860346,0.00010050406,0.01650022],"study_design_scores_gemma":[0.001038532,0.0001635984,0.08855491,0.000016109647,0.000007145311,0.0000017637778,0.00001925959,0.4354401,0.0003051262,0.47399387,0.00016575963,0.00029383381],"about_ca_topic_score_codex":0.00097594666,"about_ca_topic_score_gemma":0.0005413366,"teacher_disagreement_score":0.4978175,"about_ca_system_score_codex":0.00033299002,"about_ca_system_score_gemma":0.00010689777,"threshold_uncertainty_score":0.8340079},"labels":[],"label_agreement":null},{"id":"W2590309738","doi":"10.1090/proc/14063","title":"On optimal Scott sentences of finitely generated algebraic structures","year":2018,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algebraic number; Finitely-generated abelian group; Mathematics; Algebra over a field; Pure mathematics; Linguistics; Computer science; Philosophy; Mathematical analysis","score_opus":0.020978959955839094,"score_gpt":0.2656726368267579,"score_spread":0.2446936768709188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590309738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97878367,0.00008453866,0.01713073,0.001772964,0.00031501797,0.00056842674,0.000022946586,0.000105283274,0.001216411],"genre_scores_gemma":[0.81907576,0.00002515258,0.17994614,0.00057485513,0.000253963,0.000010540889,4.1425432e-7,0.000029554498,0.00008361126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958736,0.000060160673,0.001064483,0.0008955002,0.0013756532,0.00073061953],"domain_scores_gemma":[0.9955855,0.0007316672,0.0016579583,0.00061112613,0.0012028693,0.00021085667],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010189828,0.0005215124,0.0011295492,0.00006722405,0.00032385453,0.00015832866,0.0030677218,0.00014218749,0.0001231917],"category_scores_gemma":[0.0010467701,0.00034736426,0.0008133974,0.0021190778,0.0056593018,0.00026325358,0.0016893777,0.0004954614,0.0000325127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042536776,0.004578505,0.0056939307,0.004307998,0.0020383275,0.0000031899533,0.06304801,0.0006483137,0.0742259,0.7695278,0.032494914,0.043007743],"study_design_scores_gemma":[0.000645283,0.0031640914,0.007940054,0.0006088387,0.00021761222,0.000051582432,0.0036057245,0.45756358,0.08728602,0.4379871,0.00007416411,0.00085596635],"about_ca_topic_score_codex":0.00006135246,"about_ca_topic_score_gemma":5.9997745e-7,"teacher_disagreement_score":0.45691526,"about_ca_system_score_codex":0.000110891546,"about_ca_system_score_gemma":0.0001710622,"threshold_uncertainty_score":0.99989784},"labels":[],"label_agreement":null},{"id":"W2590662233","doi":"10.24251/hicss.2017.542","title":"Addressing the tacit knowledge gap in knowledge systems across agential realism","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ... Annual Hawaii International Conference on System Sciences/Proceedings of the Annual Hawaii International Conference on System Sciences","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Tacit knowledge; Operationalization; Knowledge management; Epistemology; Realism; Explicit knowledge; Cognitive reframing; Computer science; Psychology; Social psychology; Philosophy","score_opus":0.17879403718267248,"score_gpt":0.38506605878685746,"score_spread":0.20627202160418498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590662233","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06418756,0.00012040384,0.00030607215,0.006754848,0.011526872,0.0016651355,0.0004653129,0.00021794776,0.9147558],"genre_scores_gemma":[0.99629843,0.00003288319,0.00045367662,0.00006766185,0.0008078503,0.00021143188,0.0000023005693,0.000036815578,0.0020889398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.98827595,0.00019252428,0.002549273,0.0024575107,0.0051174317,0.0014072907],"domain_scores_gemma":[0.98460555,0.00048884866,0.004766416,0.0010604886,0.008769074,0.00030962212],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.010351262,0.001030105,0.0012745815,0.00083555724,0.0037022135,0.005928956,0.033301175,0.00039695192,0.00002647205],"category_scores_gemma":[0.00044245308,0.0006203548,0.0006767526,0.001910037,0.0048688194,0.0052430616,0.0065902956,0.0010836485,0.00006321502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008673868,0.00029001618,0.0052485894,0.00032630298,0.0000898664,0.0000023571406,0.00772234,0.00018102696,0.00052771054,0.9828359,0.0011389757,0.0015501841],"study_design_scores_gemma":[0.0020914536,0.0010716155,0.020980213,0.01373626,0.00007135394,0.0004590022,0.9099927,0.03771284,0.0017788627,0.008660056,0.0017148374,0.0017308254],"about_ca_topic_score_codex":0.0012559093,"about_ca_topic_score_gemma":0.00013965263,"teacher_disagreement_score":0.9741758,"about_ca_system_score_codex":0.0009865488,"about_ca_system_score_gemma":0.0010890248,"threshold_uncertainty_score":0.9996248},"labels":[],"label_agreement":null},{"id":"W2591932609","doi":"","title":"The Ramsey Numbers R(C ≤n , K m ).","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics","score_opus":0.015981630131488737,"score_gpt":0.26200048235395673,"score_spread":0.246018852222468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591932609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74383503,0.00091158465,0.028098773,0.035683896,0.065323874,0.0015754078,0.0000050285093,0.0017878228,0.12277856],"genre_scores_gemma":[0.9955012,0.000022548793,0.0035840857,0.00015547132,0.000031476902,0.000022085156,4.8960584e-7,0.000012873115,0.00066972914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818164,0.00011788955,0.0002558707,0.0005074292,0.00044202845,0.00049514935],"domain_scores_gemma":[0.99572474,0.00039612604,0.00022171167,0.0033501298,0.00015331515,0.0001539582],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009118937,0.00019085761,0.00019314929,0.000027545186,0.0020182007,0.001542207,0.0051047173,0.00008213621,0.000009379564],"category_scores_gemma":[0.00046737652,0.00014205764,0.00011963631,0.00013194449,0.00029499974,0.0006286499,0.0016510002,0.00026356435,0.00026156515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028087525,0.000059762264,0.00458895,0.0000030116787,0.0000172236,0.00001631069,0.00018379292,0.000004883892,0.000016616263,0.94558316,0.0040156823,0.045507822],"study_design_scores_gemma":[0.0005406092,0.00006937407,0.039621376,0.0000074703066,0.0000045304455,0.000014614452,0.000015815845,0.010640625,0.0002603944,0.9216135,0.026973415,0.0002382481],"about_ca_topic_score_codex":0.0001641318,"about_ca_topic_score_gemma":0.00003410982,"teacher_disagreement_score":0.2516662,"about_ca_system_score_codex":0.00008952293,"about_ca_system_score_gemma":0.000100871606,"threshold_uncertainty_score":0.9994943},"labels":[],"label_agreement":null},{"id":"W2592511555","doi":"","title":"Implicit degree sum condition for hamiltonian cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Hamiltonian (control theory); Pure mathematics; Mathematical optimization; Physics","score_opus":0.035781182272787766,"score_gpt":0.2972854757814991,"score_spread":0.26150429350871135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592511555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8200148,0.00015793764,0.14765458,0.005097326,0.014978711,0.0018152625,0.000049363145,0.00092379824,0.009308234],"genre_scores_gemma":[0.9836187,0.0000047635713,0.015866283,0.00016365662,0.00004845478,0.00009560975,0.000010247652,0.000022374219,0.0001699141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979979,0.000059378996,0.00032842776,0.0007290131,0.00032591363,0.00055938755],"domain_scores_gemma":[0.99670285,0.00025518957,0.00027851146,0.0023108292,0.000260139,0.00019248074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056951324,0.00025392696,0.00032693637,0.000088429966,0.00096325664,0.00074942905,0.002732455,0.00014089604,0.0000122924575],"category_scores_gemma":[0.00028682346,0.0002599862,0.00017538,0.000115572984,0.00016777635,0.0008696988,0.00085517153,0.00017803145,0.00008589916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007702361,0.00016857573,0.0054899147,0.000026069323,0.000027539241,0.000012722678,0.00016625955,0.000012222101,0.0003718919,0.9488534,0.0028821963,0.041981522],"study_design_scores_gemma":[0.0013254582,0.00020182025,0.17686589,0.000016736243,0.000011324095,0.000015121757,0.000007232759,0.020464428,0.0013125889,0.79537135,0.004065998,0.0003420361],"about_ca_topic_score_codex":0.00013669497,"about_ca_topic_score_gemma":0.00004815329,"teacher_disagreement_score":0.17137598,"about_ca_system_score_codex":0.00015151454,"about_ca_system_score_gemma":0.0001110051,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W2592752528","doi":"","title":"Implicit degree sum condition for long cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Statistics","score_opus":0.03692570248741664,"score_gpt":0.3007960487532083,"score_spread":0.26387034626579164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592752528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74365586,0.00013440766,0.23593055,0.002852853,0.010888476,0.0012814339,0.00002200433,0.00062282116,0.004611601],"genre_scores_gemma":[0.990024,0.000004340021,0.009550684,0.00011733993,0.000049874707,0.00008355139,0.000010085599,0.000019962006,0.00014020017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812883,0.000054883672,0.00030842525,0.0006788825,0.00031372107,0.0005152453],"domain_scores_gemma":[0.9969467,0.00027826166,0.00026891349,0.0020791355,0.00025706418,0.00016990925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005606864,0.00023191476,0.00030300123,0.000079461475,0.0008354464,0.0007115566,0.0025235387,0.00012765764,0.000012664333],"category_scores_gemma":[0.00028748967,0.00023704767,0.00016344427,0.00010827009,0.00014346096,0.00091794465,0.0008582232,0.00016531123,0.00007544423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008332673,0.00018247336,0.0160404,0.000033218308,0.000029852537,0.000019044659,0.00013518185,0.000016715541,0.00017325264,0.9301314,0.0024096519,0.050820522],"study_design_scores_gemma":[0.0011760901,0.00016314746,0.25122908,0.000016500391,0.0000109990515,0.000016437827,0.000005117426,0.018808829,0.0013716641,0.72581124,0.0010902355,0.00030066806],"about_ca_topic_score_codex":0.00009404358,"about_ca_topic_score_gemma":0.00003739169,"teacher_disagreement_score":0.24636811,"about_ca_system_score_codex":0.00013489503,"about_ca_system_score_gemma":0.00009152416,"threshold_uncertainty_score":0.9666524},"labels":[],"label_agreement":null},{"id":"W2594146815","doi":"10.1090/stml/080/13","title":"On games and numbers","year":2016,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.012057526415518644,"score_gpt":0.23558892484756938,"score_spread":0.22353139843205075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594146815","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008335699,0.00024744205,0.04049909,0.0022113093,0.00032650674,0.0005040033,0.00001809682,0.0005598489,0.9555504],"genre_scores_gemma":[0.0026049498,0.00015999113,0.060505588,0.00160157,0.0005090764,0.00004381665,0.00000680605,0.0001463661,0.93442184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974809,0.000040978324,0.00050167093,0.00090580026,0.0007138955,0.00035672812],"domain_scores_gemma":[0.99731106,0.0010830975,0.00016124478,0.0011571802,0.000022135353,0.00026528633],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017054428,0.00049696706,0.00063629117,0.00014296656,0.00006404498,0.00037647746,0.0014861092,0.00024838088,0.0010890659],"category_scores_gemma":[0.00003612942,0.0003431305,0.00019589257,0.000042584063,0.00023768655,0.00050526636,0.0023475215,0.00034411732,0.0014292753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034257089,0.000084221334,0.0000138336045,0.000093036535,0.00005294908,0.000060668754,0.00018280797,2.1849964e-7,5.4572894e-7,0.9787793,0.0051669073,0.015562042],"study_design_scores_gemma":[0.00022535285,0.00017184271,0.00007305321,0.00039925936,0.00001695395,0.000030953193,0.0000037515767,0.0002772178,0.0000076905835,0.97787154,0.020484474,0.00043792056],"about_ca_topic_score_codex":1.0667221e-7,"about_ca_topic_score_gemma":8.4613006e-8,"teacher_disagreement_score":0.021128507,"about_ca_system_score_codex":0.000035518955,"about_ca_system_score_gemma":0.000058945276,"threshold_uncertainty_score":0.99990207},"labels":[],"label_agreement":null},{"id":"W2594442541","doi":"","title":"Some Tree-book Ramsey Numbers.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics","score_opus":0.017052469056271932,"score_gpt":0.2581234310388054,"score_spread":0.24107096198253347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594442541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75640315,0.0042080753,0.024267707,0.028229691,0.078083485,0.0026532952,0.000016534494,0.0041341293,0.10200391],"genre_scores_gemma":[0.9895907,0.000041724048,0.007762838,0.00072057307,0.000115174036,0.000031640353,0.0000022540664,0.000027719005,0.0017073447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975443,0.00011755991,0.0003507598,0.000830849,0.0005405136,0.000616058],"domain_scores_gemma":[0.9957549,0.0001870332,0.00027301948,0.0033656803,0.00015461436,0.00026476142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058343244,0.0003009927,0.00038133824,0.00008412336,0.0007715968,0.00092783803,0.0043100556,0.00015275025,0.000042254163],"category_scores_gemma":[0.0002518892,0.0002994055,0.00017930631,0.00014303642,0.00023177541,0.001924899,0.0018470172,0.0003259584,0.0005682308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004784784,0.0002199554,0.0047414512,0.000012422715,0.000028411921,0.000070417154,0.00025813095,0.000005717306,0.00006644153,0.95741636,0.0094162375,0.027759667],"study_design_scores_gemma":[0.0012373499,0.00014709072,0.0385208,0.000018582095,0.000009791999,0.000023110777,0.0000065318586,0.010198379,0.00094486255,0.9310269,0.017403634,0.00046300617],"about_ca_topic_score_codex":0.0001727683,"about_ca_topic_score_gemma":0.000014602914,"teacher_disagreement_score":0.23318756,"about_ca_system_score_codex":0.00014979822,"about_ca_system_score_gemma":0.00013603263,"threshold_uncertainty_score":0.9999458},"labels":[],"label_agreement":null},{"id":"W2600164031","doi":"10.1007/s11786-017-0312-6","title":"Mathematics in Computer Science: After 10 Years","year":2017,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Mathematics education; Computer science; Algebra over a field; Pure mathematics","score_opus":0.030308832647228338,"score_gpt":0.29686560847471255,"score_spread":0.2665567758274842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600164031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23888086,0.000029562827,0.75755477,0.000378518,0.001661323,0.00065668736,0.0000021843948,0.00017413092,0.00066196034],"genre_scores_gemma":[0.41614762,0.0000043175824,0.5834725,0.00013547474,0.00014309744,0.00005077009,2.2086351e-7,0.000017230755,0.000028744262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929304,0.000071018534,0.0011793053,0.0019237428,0.0023266918,0.0015688144],"domain_scores_gemma":[0.9929603,0.00042714018,0.00054511393,0.005246288,0.00043034705,0.00039085027],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.007020567,0.00051764416,0.0007669924,0.0013560181,0.0007477149,0.004007815,0.013013479,0.00014483924,0.000043997552],"category_scores_gemma":[0.0004577514,0.00049271324,0.00014397684,0.0026089891,0.003295037,0.0032927692,0.008846518,0.00053982943,0.0002988116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001576079,0.0045468807,0.012540415,0.0006594206,0.000024334751,0.0013859912,0.032151498,0.016190918,0.00076758943,0.089756094,0.00024915132,0.84171194],"study_design_scores_gemma":[0.0005150924,0.00011838888,0.03945018,0.00025304573,0.0000031484785,0.000089505644,0.00001612519,0.88530487,0.00036041057,0.07327256,0.00006106616,0.0005556261],"about_ca_topic_score_codex":0.00004391722,"about_ca_topic_score_gemma":0.00007041189,"teacher_disagreement_score":0.8691139,"about_ca_system_score_codex":0.00060291664,"about_ca_system_score_gemma":0.0007669123,"threshold_uncertainty_score":0.99975246},"labels":[],"label_agreement":null},{"id":"W2600505170","doi":"10.1016/j.ic.2018.07.003","title":"Non computable Mandelbrot-like sets for a one-parameter complex family","year":2018,"lang":"en","type":"article","venue":"Information and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Universidad Andrés Bello; Natural Sciences and Engineering Research Council of Canada; Universidad de Chile","keywords":"Mandelbrot set; Computable number; Mathematics; Turing; Julia set; Bifurcation; Combinatorics; Discrete mathematics; Pure mathematics; Computable function; Computer science; Computable analysis; Mathematical analysis; Fractal; Nonlinear system; Physics","score_opus":0.0496507009125985,"score_gpt":0.29658564745839183,"score_spread":0.24693494654579334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600505170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06999975,0.000012990294,0.92630625,0.0004799254,0.0005970377,0.0008371134,0.000011116205,0.00029594975,0.0014598891],"genre_scores_gemma":[0.6926795,0.000002973101,0.30484706,0.0022214102,0.0000862763,0.00004637895,0.00009217691,0.0000072043695,0.00001700998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834645,0.00004597262,0.0005900747,0.00031965357,0.0003528611,0.00034500225],"domain_scores_gemma":[0.9985057,0.00020943642,0.00025308836,0.00030562808,0.0005938007,0.00013234897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044967348,0.00021775455,0.0002617266,0.00025123885,0.00036214307,0.0006719335,0.0004023627,0.00009988681,0.0000075712323],"category_scores_gemma":[0.000031596992,0.00022196642,0.00007396209,0.00040065113,0.00011274999,0.0022160744,0.00026918954,0.00010017002,0.00012635531],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006648315,0.00014085535,0.0003043986,0.00016150104,0.000047693717,6.04488e-7,0.0041750744,0.007102861,0.00014286714,0.009000192,0.0075677643,0.9712897],"study_design_scores_gemma":[0.0011383919,0.00041778877,0.02587815,0.00001882153,0.000008410789,0.000016027534,0.00007266635,0.9473068,0.000092311726,0.014177803,0.010604233,0.00026859445],"about_ca_topic_score_codex":0.000044824163,"about_ca_topic_score_gemma":0.000006960984,"teacher_disagreement_score":0.9710211,"about_ca_system_score_codex":0.000074906624,"about_ca_system_score_gemma":0.00007394753,"threshold_uncertainty_score":0.9051528},"labels":[],"label_agreement":null},{"id":"W2601794338","doi":"10.1017/jsl.2016.43","title":"DEGREES OF CATEGORICITY ON A CONE VIA<i>η</i>-SYSTEMS","year":2017,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cone (formal languages); Degree (music); Mathematics; Isomorphism (crystallography); Limit (mathematics); Turing; Discrete mathematics; Combinatorics; Turing machine; Pure mathematics; Computer science; Algorithm; Mathematical analysis; Physics","score_opus":0.04343881680507022,"score_gpt":0.2852791939979936,"score_spread":0.2418403771929234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601794338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.505047,0.0011070494,0.47881567,0.0026450488,0.0050084204,0.00039977347,0.0000050555436,0.000075249955,0.0068967217],"genre_scores_gemma":[0.99043626,0.000046301702,0.008844227,0.00009872065,0.0004917944,0.0000024731846,1.5693932e-7,0.000008721888,0.00007135105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99757314,0.00017935081,0.0008687314,0.00029447835,0.0007452275,0.00033907613],"domain_scores_gemma":[0.9959272,0.00026986154,0.0017743765,0.001235938,0.0006007315,0.00019189397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001399932,0.00022339298,0.0007369297,0.00021661763,0.00023633268,0.00027068,0.0029230653,0.00011939159,0.0000112980415],"category_scores_gemma":[0.00037089034,0.00015916357,0.0002550418,0.00017290363,0.0002018012,0.00055943115,0.0004266836,0.00037483202,0.000023901795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045521097,0.006876443,0.0809702,0.000745092,0.001121362,0.002317253,0.0073263682,0.056090478,0.02173518,0.5656882,0.007066781,0.24960746],"study_design_scores_gemma":[0.00542861,0.00690498,0.6008714,0.00046585497,0.00014719975,0.0038555164,0.00023922796,0.23758017,0.0061537707,0.13303798,0.003896864,0.0014184233],"about_ca_topic_score_codex":0.00023719901,"about_ca_topic_score_gemma":0.000009665654,"teacher_disagreement_score":0.5199012,"about_ca_system_score_codex":0.00011481977,"about_ca_system_score_gemma":0.000155903,"threshold_uncertainty_score":0.6490502},"labels":[],"label_agreement":null},{"id":"W2603536051","doi":"10.7169/facm/1641","title":"An extension theorem for generating new families of non-congruent numbers","year":2017,"lang":"en","type":"article","venue":"Functiones et Approximatio Commentarii Mathematici","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"","keywords":"Congruence (geometry); Modulo; Mathematics; Extension (predicate logic); Combinatorics; Arithmetic; Prime number; Discrete mathematics; Congruence relation; Computer science","score_opus":0.04459629901520137,"score_gpt":0.32104109551157456,"score_spread":0.2764447964963732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603536051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08080841,0.000016999347,0.9137901,0.0021027327,0.0008281014,0.0011107972,0.000009085316,0.00016359078,0.0011701704],"genre_scores_gemma":[0.3094732,0.000003965857,0.6895246,0.000523318,0.00014866855,0.00012526315,0.000031785585,0.000026785603,0.00014246115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776655,0.00010595868,0.0007297472,0.0006054038,0.00044189126,0.00035041533],"domain_scores_gemma":[0.99608624,0.00045184523,0.000766558,0.0022688992,0.00027625952,0.00015020344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012594871,0.00032231217,0.00051728653,0.00012376065,0.000749227,0.0006009384,0.0015108963,0.000090955225,0.00004712038],"category_scores_gemma":[0.00026128822,0.00028049297,0.00018110513,0.0001202465,0.00012948786,0.0014174827,0.0005323899,0.00014203088,0.000014350017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015752541,0.0033413938,0.0026755494,0.0016747158,0.0004480901,0.0000060520856,0.041937467,0.011228368,0.025071666,0.619543,0.017407164,0.27650902],"study_design_scores_gemma":[0.0011274426,0.00033511006,0.0015812633,0.00009904919,0.000043050135,0.000017169938,0.0008400152,0.87986505,0.0064549767,0.108839475,0.00043950183,0.00035787022],"about_ca_topic_score_codex":0.00057496794,"about_ca_topic_score_gemma":0.00017266608,"teacher_disagreement_score":0.8686367,"about_ca_system_score_codex":0.00010253773,"about_ca_system_score_gemma":0.00011916558,"threshold_uncertainty_score":0.9999647},"labels":[],"label_agreement":null},{"id":"W2608395366","doi":"10.1090/crmp/035/01","title":"A local study of embeddings of complexity one","year":2004,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.043787994535590694,"score_gpt":0.2591445576217474,"score_spread":0.2153565630861567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608395366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028132053,0.0010048903,0.7520863,0.0008179995,0.0007561057,0.0033954217,0.000042512624,0.00085116987,0.21291354],"genre_scores_gemma":[0.98767436,0.000010567512,0.011824711,0.000098580036,0.00021634797,0.000017830733,0.000005607428,0.0000716044,0.00008040256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555916,0.000013623275,0.0011510539,0.0014352537,0.0013077344,0.0005331836],"domain_scores_gemma":[0.996205,0.00026189286,0.0011571865,0.0007469546,0.0014381132,0.00019090743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052004884,0.00081317686,0.0016277513,0.00048703488,0.00014098271,0.00013119697,0.0022975067,0.00058541354,0.00013406057],"category_scores_gemma":[0.00024834176,0.0007772992,0.00036215692,0.00037763576,0.0006428586,0.0002867822,0.001348197,0.0010128982,0.000013605123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005666439,0.001011721,0.00026674822,0.00082251633,0.00028555832,0.000012162321,0.007660605,0.0003538736,0.00047980444,0.957709,0.00001560633,0.031325724],"study_design_scores_gemma":[0.0009217242,0.0021226178,0.000801942,0.00050439005,0.0001554647,0.000031968913,0.00006450844,0.0031570352,0.004184939,0.98703134,0.00026628433,0.00075781305],"about_ca_topic_score_codex":0.00019177396,"about_ca_topic_score_gemma":0.00004523128,"teacher_disagreement_score":0.9595423,"about_ca_system_score_codex":0.00030356058,"about_ca_system_score_gemma":0.0002936385,"threshold_uncertainty_score":0.9994678},"labels":[],"label_agreement":null},{"id":"W2608480642","doi":"10.1090/crmp/046/14","title":"On the difference of arithmetic functions at consecutive arguments","year":2008,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Arithmetic; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.024831758301673158,"score_gpt":0.21744738719434084,"score_spread":0.19261562889266767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608480642","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01127754,0.0015878564,0.25636747,0.005495205,0.0019524004,0.00252068,0.00011056835,0.0007729604,0.71991533],"genre_scores_gemma":[0.99391437,0.000114101844,0.0010278469,0.0008933316,0.00025449862,0.00005843722,0.000011143822,0.000062440784,0.0036638037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968979,0.000018420653,0.00054452725,0.0011748929,0.0008867847,0.00047748917],"domain_scores_gemma":[0.99648035,0.0014021111,0.00060189515,0.00067545235,0.00069709384,0.00014312827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022714733,0.0007170181,0.0007139358,0.00028794538,0.00048433518,0.00014846574,0.0016105307,0.0004649336,0.00014818499],"category_scores_gemma":[0.0006197025,0.0004953299,0.00033683766,0.00024639888,0.0005894664,0.000106665124,0.00091344776,0.0009975196,0.00012055251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006998967,0.00022097451,0.0005177482,0.00018512864,0.00035398942,0.000024481078,0.004164071,0.00007861839,0.0009471848,0.96025854,0.0014796191,0.031699635],"study_design_scores_gemma":[0.0003606554,0.0007770598,0.0017237202,0.00041448858,0.000114023096,0.00019115103,0.000009972992,0.0034660774,0.0055608666,0.97967577,0.0067894855,0.0009167574],"about_ca_topic_score_codex":0.000016943513,"about_ca_topic_score_gemma":0.000009512706,"teacher_disagreement_score":0.98263687,"about_ca_system_score_codex":0.00030299934,"about_ca_system_score_gemma":0.00017137289,"threshold_uncertainty_score":0.99974984},"labels":[],"label_agreement":null},{"id":"W2621345918","doi":"","title":"Special issue of Philosophia Scientiae - Alan Turing","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Turing; Cognitive science; Computer science; Psychology; Programming language","score_opus":0.02001034319798478,"score_gpt":0.23620954953280748,"score_spread":0.2161992063348227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621345918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027641969,0.0014121607,0.7338954,0.017261783,0.0058618276,0.0011970815,0.00008778707,0.0007894666,0.21185252],"genre_scores_gemma":[0.5820776,0.00019607453,0.40983877,0.00015490084,0.0022611925,0.000073347626,0.00019334006,0.000083094536,0.0051216963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915809,0.004081131,0.0010082729,0.0014879504,0.0010972692,0.00074450194],"domain_scores_gemma":[0.98982215,0.0012280876,0.00096033583,0.0051590777,0.0024483707,0.00038199063],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.008168526,0.00055287237,0.0007360639,0.0004555137,0.0003832312,0.00066677434,0.0057643396,0.00039340346,0.0003957894],"category_scores_gemma":[0.001078595,0.0005987475,0.00042741525,0.00089831674,0.0005430255,0.0004861223,0.009113301,0.00093956495,0.00013907038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019217114,0.0036474508,0.005154223,0.0009852783,0.0002863449,0.00001826511,0.037811153,0.00070219365,0.0026285409,0.5557928,0.010539707,0.3824148],"study_design_scores_gemma":[0.0028990468,0.0000052189057,0.035952967,0.0049802153,0.00029297426,0.0001324383,0.0001905217,0.22164945,0.22388127,0.28838828,0.21678323,0.004844371],"about_ca_topic_score_codex":0.00052131276,"about_ca_topic_score_gemma":0.00024559774,"teacher_disagreement_score":0.5544356,"about_ca_system_score_codex":0.00021957,"about_ca_system_score_gemma":0.0004431364,"threshold_uncertainty_score":0.99964637},"labels":[],"label_agreement":null},{"id":"W2622434548","doi":"","title":"Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time","year":2002,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Recursion (computer science); Time complexity; Complexity class; μ operator; Primitive recursive function; Polynomial; Characterization (materials science); Mathematics; Discrete mathematics; Computation; Computer science; Recursive functions; Algorithm","score_opus":0.010618440591972802,"score_gpt":0.20727314346553632,"score_spread":0.1966547028735635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622434548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49792507,0.000688567,0.4381864,0.0100484425,0.0008742881,0.00075289555,0.000071884955,0.0011489659,0.05030348],"genre_scores_gemma":[0.7792554,0.00003286963,0.21653555,0.00031436473,0.00006587866,0.000010924011,0.000052596548,0.000031257423,0.0037011444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941544,0.0033505945,0.00048979616,0.0009753681,0.0005320626,0.0004977932],"domain_scores_gemma":[0.9949426,0.0010918594,0.00026120574,0.002748607,0.00062489253,0.0003308407],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019606627,0.0003129228,0.00030973626,0.00018366874,0.00045119858,0.00057900016,0.0024273158,0.00017268305,0.0009294668],"category_scores_gemma":[0.0006311731,0.00032213773,0.0001434979,0.00067251973,0.00023191777,0.00073316065,0.0009040818,0.00037153225,0.00019867369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002313689,0.0020431282,0.0022561052,0.000071235045,0.0000614252,0.000058141588,0.013811435,0.00007711198,0.017343324,0.069688804,0.0069781053,0.887588],"study_design_scores_gemma":[0.0009404166,0.0000054389507,0.013835374,0.00017613862,0.000020286969,0.00010224554,0.000015535385,0.9308647,0.021739172,0.011800445,0.019728255,0.0007720291],"about_ca_topic_score_codex":0.00017880028,"about_ca_topic_score_gemma":0.00018504284,"teacher_disagreement_score":0.93078756,"about_ca_system_score_codex":0.00013070709,"about_ca_system_score_gemma":0.000092610695,"threshold_uncertainty_score":0.99998385},"labels":[],"label_agreement":null},{"id":"W2624980959","doi":"10.3233/com-170077","title":"Analog networks on function data streams","year":2017,"lang":"en","type":"article","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"STREAMS; Computer science; Function (biology); Computer network; Biology","score_opus":0.09265075167930224,"score_gpt":0.318223643316189,"score_spread":0.22557289163688676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624980959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060486153,0.000092536204,0.93021375,0.0012815882,0.0034551504,0.0004542337,0.000021433456,0.0005892612,0.003405921],"genre_scores_gemma":[0.98097014,0.0000058413884,0.018006125,0.00030251127,0.0006074537,0.000010012137,0.000046948597,0.000016253964,0.000034696925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603677,0.00030410514,0.00050949916,0.0019755322,0.000549874,0.00062423415],"domain_scores_gemma":[0.98620194,0.0005196257,0.00033730586,0.012454847,0.00021191793,0.0002743678],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019101244,0.00037072194,0.00046220684,0.00007948974,0.0010674888,0.0010658728,0.007974058,0.00017594104,0.000048566784],"category_scores_gemma":[0.0005809686,0.00033921035,0.00014109671,0.0002411496,0.00037417372,0.0013198255,0.0060490295,0.0005118826,0.00012068418],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043791242,0.0007251599,0.040116325,0.000026838577,0.0000483298,0.00001959861,0.00006439688,0.019365309,0.000007342838,0.009799968,0.0025201465,0.9272628],"study_design_scores_gemma":[0.00030068774,0.00020156428,0.30397412,0.000011268647,0.000009873058,0.0000061714,0.0000029867815,0.67562073,0.000010831091,0.017158788,0.002444567,0.00025838581],"about_ca_topic_score_codex":0.00020639806,"about_ca_topic_score_gemma":0.00012132452,"teacher_disagreement_score":0.9270044,"about_ca_system_score_codex":0.00016665184,"about_ca_system_score_gemma":0.00012237442,"threshold_uncertainty_score":0.9999711},"labels":[],"label_agreement":null},{"id":"W2626119239","doi":"10.1364/cleo_qels.2016.ftu1c.3","title":"Entanglement Verification with Detection-Efficiency Mismatch","year":2016,"lang":"en","type":"article","venue":"Conference on Lasers and Electro-Optics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Computer science; Physics; Quantum mechanics; Quantum","score_opus":0.015201240418884283,"score_gpt":0.22020541605755548,"score_spread":0.20500417563867118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626119239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22317441,0.000024829755,0.77254355,0.0024734938,0.00014167177,0.00022625328,0.0000026825194,0.00013843364,0.0012747082],"genre_scores_gemma":[0.9916232,0.000103655344,0.0078643905,0.00015313398,0.00004515973,0.000026745118,0.0000013200621,0.000008656707,0.00017371666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850935,0.000051187046,0.00019890301,0.0005487859,0.00029804165,0.0003937144],"domain_scores_gemma":[0.9989675,0.00010211588,0.000093390685,0.00052950816,0.0001704585,0.00013702785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002021163,0.00019316646,0.00016253396,0.000084815714,0.00018703884,0.0001646743,0.00041494548,0.000060097886,0.00002015509],"category_scores_gemma":[0.000024309733,0.00012652432,0.00003075563,0.00026692962,0.00011077695,0.00021188609,0.00008020347,0.00011091327,0.00002838725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095660296,0.00048908923,0.00085205823,0.00003378487,0.000046663787,0.000018801878,0.0007407478,0.000082170096,0.07075678,0.21971829,0.0001315907,0.70703435],"study_design_scores_gemma":[0.004001447,0.00985067,0.007740497,0.00022223938,0.00006990953,0.00013876556,0.00034344624,0.5138176,0.40538162,0.05204763,0.0044752955,0.0019108808],"about_ca_topic_score_codex":0.000011810267,"about_ca_topic_score_gemma":0.000023615248,"teacher_disagreement_score":0.7684488,"about_ca_system_score_codex":0.00009979147,"about_ca_system_score_gemma":0.00011594612,"threshold_uncertainty_score":0.5159512},"labels":[],"label_agreement":null},{"id":"W2626768075","doi":"","title":"Toward Artificial Sapience: Principles and Methods for Wise Systems","year":2007,"lang":"en","type":"book","venue":"No Category","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Artificial intelligence; Computational model; Set (abstract data type); Semiotics; Cognitive science; Situated; Artificial life; Management science; Epistemology; Engineering; Psychology","score_opus":0.0845480542039828,"score_gpt":0.34319749825041146,"score_spread":0.25864944404642864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626768075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019270889,0.003920559,0.91056144,0.000105175466,0.004789629,0.0015020651,0.000019197438,0.0003822016,0.07870048],"genre_scores_gemma":[0.00069913646,0.00012756856,0.73178405,0.00031482175,0.0034366595,0.0003275681,0.00006519721,0.00012616543,0.2631188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99615645,0.00022768653,0.00087637955,0.0014842266,0.00052331854,0.00073192647],"domain_scores_gemma":[0.99608326,0.0013539587,0.00043588493,0.0012826188,0.000544706,0.0002995638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034398772,0.00057901244,0.0008851376,0.00034829482,0.0002130385,0.00049074105,0.0016816799,0.000655805,0.0000147622295],"category_scores_gemma":[0.00032043376,0.00054515543,0.00024324542,0.00020340749,0.00034954728,0.00027867974,0.0009916524,0.0005431373,0.000081065744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036189213,0.000112429276,0.00001320992,0.0012575345,0.00009377882,0.00005086971,0.0011916856,0.00026354456,0.00012663854,0.543914,0.007494352,0.44544572],"study_design_scores_gemma":[0.0003103109,0.00037881796,0.000082758896,0.00010450984,0.000065754946,0.00011567928,0.000035973164,0.16824795,0.0001692828,0.15470806,0.6746807,0.001100176],"about_ca_topic_score_codex":0.00004332658,"about_ca_topic_score_gemma":0.000008918816,"teacher_disagreement_score":0.6671864,"about_ca_system_score_codex":0.0004132193,"about_ca_system_score_gemma":0.0009778503,"threshold_uncertainty_score":0.9997},"labels":[],"label_agreement":null},{"id":"W2626850692","doi":"10.1007/3-540-36136-7","title":"Algorithms and Computation","year":2002,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computation; Algorithm","score_opus":0.02102873307846138,"score_gpt":0.2581946897250936,"score_spread":0.2371659566466322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626850692","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009543004,0.0012053318,0.99183613,0.0009420978,0.0027418907,0.0006625832,0.0000063442785,0.00043804522,0.002072144],"genre_scores_gemma":[0.016763847,0.00008193417,0.9801574,0.0012833418,0.0009580935,0.000021023974,0.000011682814,0.000053169682,0.0006695274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936382,0.00015028691,0.00079654116,0.0028287019,0.0015158745,0.0010703644],"domain_scores_gemma":[0.9961878,0.001147303,0.00037130414,0.0015529381,0.000390278,0.00035034408],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013733403,0.00080646836,0.0008633083,0.001194436,0.0003941593,0.0012628633,0.003635037,0.00047571753,0.000015970538],"category_scores_gemma":[0.00016409214,0.00077765464,0.00014854794,0.001870935,0.00122035,0.0009907929,0.003129216,0.0011700107,0.00006451706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014158934,0.000068088535,0.00006064357,0.000059245747,0.000009233151,0.000118909746,0.0007385477,0.02513003,0.000011503146,0.0008303189,0.0002400009,0.97273207],"study_design_scores_gemma":[0.00033008616,0.00021525595,0.00048128483,0.00015110336,0.000007460925,0.0002089411,1.4339639e-7,0.8506514,0.000085994485,0.14616615,0.0009504845,0.0007516972],"about_ca_topic_score_codex":0.00003189087,"about_ca_topic_score_gemma":0.00003383055,"teacher_disagreement_score":0.9719804,"about_ca_system_score_codex":0.000787881,"about_ca_system_score_gemma":0.00076446845,"threshold_uncertainty_score":0.9997739},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06276968317688227,"score_gpt":0.3042134384574336,"score_spread":0.24144375528055134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2640088286","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.3008006e-7,0.007051963,0.15191457,0.0006527185,0.0018862158,0.00070255436,0.00003925355,0.00038181336,0.83737046],"genre_scores_gemma":[0.03289446,0.0049887076,0.3064145,0.02547972,0.011500589,0.00040826615,0.0000446668,0.0005791449,0.61768997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626625,0.00005242618,0.00088293466,0.0013872168,0.00083669886,0.000574467],"domain_scores_gemma":[0.99509776,0.00009268301,0.00062654103,0.003566853,0.00032076958,0.00029540877],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058654347,0.0006888201,0.00096491433,0.00006581604,0.00028282916,0.00048266398,0.0045730155,0.00041151364,0.00007828709],"category_scores_gemma":[0.0001488362,0.00066428166,0.0005152414,0.000024359624,0.0003043517,0.00016339582,0.0020457252,0.0005538729,0.0015770122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016146502,0.000008413931,5.5288984e-7,0.00014557033,0.000021129263,0.000087959364,0.00001092325,0.0000014306662,3.8233517e-7,0.63712955,0.001267487,0.361325],"study_design_scores_gemma":[0.000019059322,0.00009168973,0.0000058312044,0.0014508544,0.000047101432,0.00011661974,3.72879e-7,0.0007356829,0.000023108856,0.9072369,0.08963821,0.0006345903],"about_ca_topic_score_codex":0.00005946986,"about_ca_topic_score_gemma":0.00009083341,"teacher_disagreement_score":0.36069041,"about_ca_system_score_codex":0.0003474342,"about_ca_system_score_gemma":0.00053033384,"threshold_uncertainty_score":0.99958086},"labels":[],"label_agreement":null},{"id":"W2724168156","doi":"","title":"Acquired knowledge as a stochastic process","year":2017,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon Health Network; Saint John Regional Hospital","funders":"","keywords":"Process (computing); Computer science; Programming language","score_opus":0.2858829675630333,"score_gpt":0.5788320245795856,"score_spread":0.29294905701655233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724168156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6771429,0.016095959,0.2683106,0.0013671153,0.005673917,0.0022813866,0.000031807387,0.0004660772,0.028630203],"genre_scores_gemma":[0.9959448,0.00031331656,0.0024433048,0.00018496817,0.00041262445,0.00009292532,0.0000023021294,0.00005378701,0.0005519741],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9953045,0.00034445594,0.0011228075,0.0012329116,0.0011616823,0.0008336167],"domain_scores_gemma":[0.9931323,0.0005989887,0.0016647901,0.002926954,0.0010683216,0.0006086258],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0023641074,0.00057277415,0.0011471258,0.00077150454,0.0012822007,0.0084897205,0.023047604,0.00018309164,0.002033965],"category_scores_gemma":[0.0017699441,0.0005220874,0.0003193154,0.0009808666,0.00045524564,0.008017037,0.008187277,0.000452293,0.00017048715],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044195884,0.004440505,0.19260478,0.00081203756,0.0008753515,0.00051529444,0.006026339,0.0043113884,0.020687023,0.0069940696,0.03171231,0.73057896],"study_design_scores_gemma":[0.0018667317,0.00008478621,0.72712576,0.00088909996,0.00010988812,0.0001831537,0.00008335518,0.04426329,0.0095730955,0.21059501,0.0034588538,0.0017669777],"about_ca_topic_score_codex":0.00049801194,"about_ca_topic_score_gemma":0.000072665505,"teacher_disagreement_score":0.728812,"about_ca_system_score_codex":0.00019309636,"about_ca_system_score_gemma":0.00071599486,"threshold_uncertainty_score":0.9998343},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.031095113395448733,"score_gpt":0.28280853092804703,"score_spread":0.2517134175325983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727177017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016488595,0.000076911296,0.9811095,0.00042548485,0.00077071594,0.00028379593,0.0000030296023,0.00004692246,0.0007950386],"genre_scores_gemma":[0.77365446,0.0000018264151,0.22493052,0.000081026,0.0012846674,0.0000068627346,1.8540752e-7,0.000012677013,0.000027786116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982909,0.00007547524,0.00068443734,0.00019971057,0.0004485634,0.00030088838],"domain_scores_gemma":[0.99752176,0.0007772905,0.00043940314,0.00044293492,0.000643914,0.00017468889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089537905,0.0001654574,0.00048892165,0.00005467454,0.00007211955,0.00017601768,0.00088045135,0.00006281792,0.000012396245],"category_scores_gemma":[0.0002560635,0.00012347486,0.00024673695,0.00020744998,0.000249894,0.00034163293,0.00019121528,0.00018475996,0.000057749538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037496964,0.0015771587,0.000017535283,0.00063546404,0.00018638365,0.00006775573,0.0022135791,0.0009946227,0.0015332634,0.9359667,0.0030079137,0.053762157],"study_design_scores_gemma":[0.0004747961,0.0010962184,0.00003963971,0.00015532927,0.000027965718,0.00043451303,0.00006523518,0.49650007,0.00041545313,0.5000948,0.0005331836,0.00016280221],"about_ca_topic_score_codex":6.477022e-7,"about_ca_topic_score_gemma":6.5561125e-8,"teacher_disagreement_score":0.75716585,"about_ca_system_score_codex":0.00010808163,"about_ca_system_score_gemma":0.0001846226,"threshold_uncertainty_score":0.5035159},"labels":[],"label_agreement":null},{"id":"W2736174437","doi":"10.5539/jmr.v9n4p69","title":"Cone Avoidance of Some Turing Degrees","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cone (formal languages); Turing; Substructure; Property (philosophy); Combinatorics; Algorithm; Computer science","score_opus":0.20086184932586745,"score_gpt":0.4246046638707749,"score_spread":0.22374281454490744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736174437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.716662,0.000772917,0.27659285,0.0025887266,0.00057203026,0.00025241938,0.000001980687,0.000021978842,0.0025350896],"genre_scores_gemma":[0.74335474,0.00008899525,0.25615534,0.0000062434096,0.00020228664,0.0000016724666,2.8687777e-8,0.000009113425,0.0001815986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686074,0.0001782944,0.00072127633,0.00017850829,0.001679391,0.00038176944],"domain_scores_gemma":[0.99534667,0.0011381452,0.0008014577,0.001329816,0.0012211057,0.00016282115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070635956,0.00011169638,0.00043045005,0.00031038886,0.00032958563,0.0004158488,0.0040329425,0.00006539815,0.00001735143],"category_scores_gemma":[0.002652933,0.00008564336,0.00014851414,0.00015190274,0.0003515173,0.0008819363,0.0013766346,0.0006509511,0.000022502356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012102498,0.0072115567,0.0128974635,0.005079979,0.0007504977,0.0015212215,0.025201207,0.003878204,0.07768414,0.636864,0.006198097,0.22259262],"study_design_scores_gemma":[0.0015933887,0.0009628839,0.024298549,0.0010807897,0.000017229599,0.00065403135,0.0005172678,0.26746026,0.048167527,0.65416646,0.0006994722,0.00038214336],"about_ca_topic_score_codex":0.000015049137,"about_ca_topic_score_gemma":0.000004882459,"teacher_disagreement_score":0.26358205,"about_ca_system_score_codex":0.00009263227,"about_ca_system_score_gemma":0.00024574847,"threshold_uncertainty_score":0.74942774},"labels":[],"label_agreement":null},{"id":"W2738199474","doi":"10.4324/9780203998045.ch20","title":"Architectures for Arithmetic","year":2004,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Arithmetic; Computer science; Mathematics","score_opus":0.01603422845797645,"score_gpt":0.25296430502739786,"score_spread":0.23693007656942142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738199474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016442679,0.000047868798,0.9763247,0.003277872,0.00033975244,0.00032308372,0.0000012370306,0.0004000688,0.0028427579],"genre_scores_gemma":[0.4473699,2.7734686e-7,0.5518313,0.00057095726,0.000074531716,0.000025371466,3.9617072e-7,0.0000047618137,0.00012252673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989334,0.000018516332,0.00016115236,0.00041088296,0.000178319,0.00029776554],"domain_scores_gemma":[0.99909407,0.00016911335,0.000028867915,0.00055227976,0.000066231674,0.00008944509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002061217,0.00012022176,0.00013375087,0.00008350115,0.000089627174,0.0001141787,0.0008488753,0.000039159007,0.0000124419785],"category_scores_gemma":[0.00008285205,0.00009553306,0.00009978811,0.00024302445,0.000047474954,0.000048450107,0.00025478375,0.00007672177,0.000035862566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008038611,0.00033581274,0.00024218019,0.00004196831,0.000026659996,0.000013139249,0.00090145785,0.045965873,0.00033706237,0.5493411,0.00037384275,0.4024129],"study_design_scores_gemma":[0.00078646187,0.00027425375,0.0040024617,0.0000060169978,0.0000039431307,0.00004792657,0.000008201726,0.09659759,0.005023027,0.8902403,0.0027462938,0.00026351408],"about_ca_topic_score_codex":0.000050978128,"about_ca_topic_score_gemma":0.00003612298,"teacher_disagreement_score":0.43092722,"about_ca_system_score_codex":0.00005241572,"about_ca_system_score_gemma":0.0000737532,"threshold_uncertainty_score":0.3895725},"labels":[],"label_agreement":null},{"id":"W2739641600","doi":"10.5948/9781614441199.003","title":"Review of Arithmetic","year":2015,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Arithmetic; Computer science; Mathematics","score_opus":0.041005306055505925,"score_gpt":0.283826074273289,"score_spread":0.24282076821778306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739641600","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011964768,0.007167673,0.29802626,0.0006773875,0.00012186115,0.00076060655,0.00001678131,0.0002816092,0.6929466],"genre_scores_gemma":[0.00012403166,0.0028969739,0.81294966,0.006108559,0.00030990908,0.00008378436,0.000013499504,0.0001629636,0.17735064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964071,0.00007266279,0.0011062105,0.0008353339,0.0011180675,0.00046064064],"domain_scores_gemma":[0.9956622,0.0006101407,0.00091343187,0.0019454156,0.000520722,0.0003481062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011974523,0.00058370223,0.0017928954,0.00004901227,0.00006202882,0.00005395409,0.001905591,0.00020154865,0.00018793659],"category_scores_gemma":[0.0001958591,0.0004967454,0.0011121345,0.000102805876,0.0013966381,0.000061039354,0.0012543534,0.00061408494,0.00025643758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011865842,0.000078154364,3.9098856e-7,0.007100046,0.00020190232,0.00000873009,0.00050874567,8.075716e-7,0.000004324795,0.8078408,0.024356743,0.15989816],"study_design_scores_gemma":[0.00015543085,0.00032047697,0.0000012020199,0.0061186235,0.0001623674,0.00005961129,0.000022683593,0.004274058,0.000011978734,0.8495542,0.13860549,0.0007139097],"about_ca_topic_score_codex":0.000011954751,"about_ca_topic_score_gemma":5.392943e-7,"teacher_disagreement_score":0.515596,"about_ca_system_score_codex":0.0002228951,"about_ca_system_score_gemma":0.00038658764,"threshold_uncertainty_score":0.9997484},"labels":[],"label_agreement":null},{"id":"W2740429356","doi":"10.2495/dne-v12-n4-458-469","title":"Real-world open-ended evolution: A league of legends adventure","year":2018,"lang":"en","type":"article","venue":"International Journal of Design & Nature and Ecodynamics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Templeton World Charity Foundation","keywords":"Adventure; League; Engineering; Advertising; Geography; History; Art history; Business; Astronomy; Physics","score_opus":0.018686477636496186,"score_gpt":0.29241744063413244,"score_spread":0.2737309629976363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740429356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022919837,0.000583598,0.966824,0.0024980272,0.0039090654,0.0001799964,0.000015328307,0.000026830927,0.0030433496],"genre_scores_gemma":[0.8692481,0.00010784813,0.12958544,0.0001965904,0.0006443361,0.0000013374699,0.0000026079222,0.000008694618,0.00020501716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813116,0.0001314901,0.00063392665,0.0002827329,0.00062829786,0.00019237901],"domain_scores_gemma":[0.99729484,0.00022330218,0.00063222507,0.00029652397,0.0014353793,0.0001177379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009318657,0.00017234478,0.00031953392,0.00043636138,0.00007734525,0.00021448196,0.0024731304,0.00017016247,0.000023745419],"category_scores_gemma":[0.00011819978,0.00014662997,0.00013061309,0.00043123428,0.00012444686,0.00092538097,0.0006404888,0.00056291197,0.0000031878085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013184128,0.0016113033,0.01430948,0.00007168913,0.0016156747,0.0006199942,0.0027621053,0.00552258,0.007109,0.81430537,0.01379288,0.13696149],"study_design_scores_gemma":[0.00359965,0.0020910134,0.08160776,0.0003670359,0.00009412277,0.0020190028,0.00013090481,0.61714953,0.0025925331,0.28265095,0.0069634174,0.0007341062],"about_ca_topic_score_codex":0.00005168502,"about_ca_topic_score_gemma":0.00019145575,"teacher_disagreement_score":0.84632826,"about_ca_system_score_codex":0.00026558785,"about_ca_system_score_gemma":0.00031102568,"threshold_uncertainty_score":0.59793967},"labels":[],"label_agreement":null},{"id":"W2740891638","doi":"10.1145/3129173.3129175","title":"2017 LICS test-of-time award","year":2017,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Honor; Test (biology); Library science; History; Computer science; Operations research; Engineering; Biology","score_opus":0.039603647257364934,"score_gpt":0.29486232597567014,"score_spread":0.2552586787183052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740891638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35132715,0.00095399504,0.50118077,0.04914661,0.008980114,0.0022368208,0.000061837614,0.0019160269,0.084196694],"genre_scores_gemma":[0.6921117,0.00007373546,0.30383784,0.0006632433,0.0006425879,0.000027029924,0.000004225686,0.000033352015,0.0026062895],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9980762,0.000068763824,0.00037925228,0.0006516755,0.00037898213,0.00044511657],"domain_scores_gemma":[0.99231756,0.0010708593,0.00038457662,0.0058786264,0.00018045034,0.00016794108],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00046519894,0.00023186405,0.00039303172,0.000079538324,0.0003691415,0.0003645729,0.007250283,0.00013581978,0.00003825814],"category_scores_gemma":[0.004727244,0.00021135808,0.00016456084,0.00013659406,0.00023495448,0.00066973764,0.0037515785,0.00020083372,0.00052356505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014419653,0.0007931165,0.16468148,0.00007547732,0.00007832874,0.00016039163,0.0012661088,0.00017464507,0.011952315,0.0069312733,0.07058895,0.7432835],"study_design_scores_gemma":[0.0023031607,0.0013977246,0.55307823,0.00010209298,0.000059451413,0.00016302585,0.000030473664,0.13360229,0.013119214,0.19120152,0.10312485,0.001817965],"about_ca_topic_score_codex":0.00034899224,"about_ca_topic_score_gemma":0.000050719755,"teacher_disagreement_score":0.7414655,"about_ca_system_score_codex":0.000050318424,"about_ca_system_score_gemma":0.00014542826,"threshold_uncertainty_score":0.99812096},"labels":[],"label_agreement":null},{"id":"W2741595739","doi":"10.1016/j.apal.2017.07.001","title":"Corrigendum to “The d.r.e. degrees are not dense” [Ann. Pure Appl. Logic 55 (1991) 125–151]","year":2017,"lang":"en","type":"erratum","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Discrete mathematics; Artificial intelligence; Computer science; Mathematical economics; Calculus (dental); Medicine","score_opus":0.1098005144807524,"score_gpt":0.3076933068725218,"score_spread":0.19789279239176938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741595739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029690585,0.063903436,0.28284264,0.19986002,0.16902268,0.01903981,0.0023546615,0.0033412941,0.2566664],"genre_scores_gemma":[0.48845667,0.01184851,0.062084638,0.09126795,0.0346263,0.0030256247,0.0015841469,0.00080690696,0.30629924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937679,0.00021086316,0.001045516,0.0022622931,0.00130346,0.0014099573],"domain_scores_gemma":[0.99352854,0.0002316259,0.0014059958,0.003687475,0.000601153,0.000545209],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014842632,0.001227045,0.0018386795,0.0003695685,0.00091418694,0.0008374027,0.0063388376,0.0012562335,0.00006834718],"category_scores_gemma":[0.00028007632,0.0008762414,0.0005156161,0.00062644656,0.00053806923,0.00025236473,0.0031584485,0.0017615496,0.00036732006],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035805566,0.00021904834,0.00003828447,0.00025184927,0.00012189018,0.00009124876,0.00044471773,0.00015040147,0.00004731453,0.017732855,0.9337453,0.047121275],"study_design_scores_gemma":[0.00042243727,0.0005006069,0.0046409215,0.00023612515,0.00010984615,0.00010088661,0.00022751816,0.002213362,0.00023813198,0.07796944,0.91160065,0.0017400957],"about_ca_topic_score_codex":0.000080165955,"about_ca_topic_score_gemma":0.00043120643,"teacher_disagreement_score":0.4854876,"about_ca_system_score_codex":0.000049883933,"about_ca_system_score_gemma":0.00028274042,"threshold_uncertainty_score":0.99936885},"labels":[],"label_agreement":null},{"id":"W2748662937","doi":"10.1016/j.pbiomolbio.2017.08.004","title":"East-West paths to unconventional computing","year":2017,"lang":"en","type":"review","venue":"Progress in Biophysics and Molecular Biology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Unconventional computing; Computer science; Computation; Field (mathematics); Quantum computer; Data science; Reservoir computing; Natural computing; Physical computing; Theoretical computer science; Computational science; Artificial intelligence; Distributed computing; Quantum; Algorithm; Mathematics; Artificial neural network; Physics","score_opus":0.062339378698971395,"score_gpt":0.3872768392491704,"score_spread":0.324937460550199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748662937","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007398,0.87695116,0.1210974,0.00015306965,0.0007803817,0.00076509773,0.00002310522,0.0000660181,0.000089818655],"genre_scores_gemma":[0.0043735383,0.88179857,0.11255563,0.00022575585,0.0005112551,0.0002805575,0.00016756887,0.00007174473,0.000015392181],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99720937,0.00030085543,0.0005609454,0.0012256702,0.00016355708,0.0005395966],"domain_scores_gemma":[0.9982013,0.00008766923,0.00039394305,0.0010494512,0.000105413004,0.00016224115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045705127,0.0004844351,0.0013008593,0.00023464998,0.0001517694,0.00025961662,0.0017504684,0.00031966457,0.0000016437335],"category_scores_gemma":[0.00004561239,0.00041922982,0.00030660644,0.00033995672,0.0002991545,0.000069185066,0.0025506583,0.00036319392,0.00002884858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.528874e-7,0.00009202745,0.000106988766,0.0007857293,0.00003954784,0.00005937419,0.000033906308,9.722097e-7,0.0000018619024,0.038357127,0.0000030490899,0.96051866],"study_design_scores_gemma":[0.00051474135,0.00058381795,0.000263517,0.0043951585,0.00011279003,0.00015189665,0.000003996183,0.003703746,0.0000125215165,0.038879424,0.9496865,0.001691874],"about_ca_topic_score_codex":0.000013187509,"about_ca_topic_score_gemma":0.0000030379122,"teacher_disagreement_score":0.9588268,"about_ca_system_score_codex":0.00006791469,"about_ca_system_score_gemma":0.00020642589,"threshold_uncertainty_score":0.99982595},"labels":[],"label_agreement":null},{"id":"W2751726841","doi":"10.11157/anzswj-vol20iss2id352","title":"ICA Chicago style","year":2017,"lang":"en","type":"article","venue":"Aotearoa New Zealand Social Work","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Style (visual arts); Social work; Psychology; Sociology; Management; Media studies; Political science; Art; Law; Visual arts; Economics","score_opus":0.02333773151275807,"score_gpt":0.2716680230655259,"score_spread":0.24833029155276784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751726841","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3576413,0.00027437197,0.08847973,0.446961,0.011881288,0.001903135,0.000020761858,0.0029738513,0.08986457],"genre_scores_gemma":[0.84776515,0.000014718255,0.032443028,0.0007546395,0.0034764935,0.000014695597,0.0000052394316,0.000037676167,0.11548839],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99804735,0.00010958154,0.00025477252,0.0005948955,0.00043448788,0.0005589055],"domain_scores_gemma":[0.9981119,0.00012104535,0.00020056531,0.0012549784,0.000062190535,0.00024929945],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00041005085,0.00021991521,0.0003285909,0.00004722774,0.0015689834,0.0009349801,0.0024320984,0.00018401507,0.00009904326],"category_scores_gemma":[0.00014528782,0.00020549903,0.00017980645,0.00029150618,0.00016059203,0.0003965485,0.0009982416,0.0003570661,0.00038359436],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000339793,0.00021538211,0.018757733,0.00000902109,0.00007847688,0.00005770899,0.011125507,0.000020060144,0.000031375403,0.015722763,0.36230198,0.591646],"study_design_scores_gemma":[0.0010569614,0.00009741687,0.502007,0.000018412926,0.00001522064,0.000007598361,0.000021517095,0.001124397,0.000050261562,0.14931397,0.34572947,0.00055774976],"about_ca_topic_score_codex":0.0005412927,"about_ca_topic_score_gemma":0.000050452032,"teacher_disagreement_score":0.5910883,"about_ca_system_score_codex":0.000063913525,"about_ca_system_score_gemma":0.00015538819,"threshold_uncertainty_score":0.9997308},"labels":[],"label_agreement":null},{"id":"W2752198235","doi":"10.1145/3084288","title":"Encoding Arguments","year":2017,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Lemma (botany); Encoding (memory); Mathematical proof; Computer science; Generalization; Simple (philosophy); Theoretical computer science; Event (particle physics); Object (grammar); Set (abstract data type); Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Programming language","score_opus":0.22125334338740177,"score_gpt":0.4090374100271108,"score_spread":0.18778406663970904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752198235","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032918356,0.7311701,0.2613115,0.000043882275,0.004273477,0.0006864477,0.000011249097,0.00068209844,0.0018179577],"genre_scores_gemma":[0.00015622338,0.91742843,0.080813244,0.000046048724,0.0009686681,0.000023138244,0.00005666672,0.000097439864,0.00041012425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99067444,0.0035799749,0.0014745748,0.0021774818,0.00087627233,0.0012172824],"domain_scores_gemma":[0.9865873,0.003542716,0.0016213944,0.007691293,0.00024565394,0.00031164958],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.010309209,0.0010716589,0.0030703656,0.00044887347,0.00095663004,0.0016324227,0.015388713,0.00050728815,0.000018869918],"category_scores_gemma":[0.0029611273,0.0009704169,0.00100474,0.0007116308,0.00016244805,0.00049571064,0.01181191,0.0011417522,0.00066423055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.0618728e-7,0.0000661699,0.00008727508,0.0019253471,0.0001059657,0.00006982708,0.00007188314,0.000011821867,3.3142925e-8,0.0003988451,0.00035005284,0.99691266],"study_design_scores_gemma":[0.00021431524,0.000071192495,0.0004719944,0.006028411,0.000113594084,0.00017535075,0.0000016032934,0.007038155,5.9747174e-7,0.0021444059,0.982379,0.0013613751],"about_ca_topic_score_codex":0.00013990563,"about_ca_topic_score_gemma":0.0000133896965,"teacher_disagreement_score":0.9955513,"about_ca_system_score_codex":0.00040435392,"about_ca_system_score_gemma":0.0006308626,"threshold_uncertainty_score":0.99940395},"labels":[],"label_agreement":null},{"id":"W2762066253","doi":"10.2495/dne-v12-n3-367-376","title":"The information requirements of complex biological and economic systems with algorithmic information theory","year":2017,"lang":"en","type":"article","venue":"International Journal of Design & Nature and Ecodynamics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Information system; Management science; Computer science; Information theory; Risk analysis (engineering); Engineering; Business; Mathematics","score_opus":0.02133798322156103,"score_gpt":0.2664146124589863,"score_spread":0.24507662923742526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762066253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07102917,0.00024029764,0.92591506,0.0011006114,0.0012452108,0.00019875243,0.000016640133,0.000008699616,0.00024557748],"genre_scores_gemma":[0.98225754,0.00032805654,0.017241709,0.000072696006,0.00008787169,0.0000018853036,0.000004884096,0.0000020885716,0.0000032435391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989117,0.00008647676,0.0005241148,0.00007949584,0.00028751383,0.0001107445],"domain_scores_gemma":[0.9978522,0.00029949727,0.0011129158,0.00021871258,0.00046511882,0.000051574036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013142235,0.000107845066,0.00017178844,0.00013460706,0.00019598633,0.0007745666,0.0010552062,0.00009997204,0.0000014328589],"category_scores_gemma":[0.00015075896,0.000064976164,0.00003860989,0.000026869582,0.00016536654,0.0027627687,0.0002420402,0.00023770388,0.0000016494868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010078263,0.00010765033,0.013441064,0.00005984234,0.00089510327,0.000025807005,0.0025090794,0.015742257,0.00016202485,0.3094369,0.00040413195,0.65620834],"study_design_scores_gemma":[0.0012390739,0.00051615183,0.06257461,0.0000766083,0.00001727853,0.00062300626,0.00025082048,0.90192825,0.000037766804,0.030759988,0.0018063113,0.00017012043],"about_ca_topic_score_codex":0.000009181008,"about_ca_topic_score_gemma":0.0000045264687,"teacher_disagreement_score":0.9112284,"about_ca_system_score_codex":0.000093384384,"about_ca_system_score_gemma":0.00008716654,"threshold_uncertainty_score":0.74691635},"labels":[],"label_agreement":null},{"id":"W2767976260","doi":"10.1016/j.apal.2019.102735","title":"Feasibly constructive proofs of succinct weak circuit lower bounds","year":2019,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; European Commission","keywords":"Mathematical proof; Mathematics; Pigeonhole principle; Upper and lower bounds; Proof complexity; Discrete mathematics; Bounded function; Combinatorics; Constructive; Logarithm; Computer science","score_opus":0.03561292216084491,"score_gpt":0.26679288051277583,"score_spread":0.23117995835193092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767976260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90884286,0.000757718,0.030976307,0.0010073171,0.00041546673,0.0010039998,0.000019131325,0.00011977109,0.056857426],"genre_scores_gemma":[0.99530244,0.000025484593,0.0041693267,0.0003277469,0.000048552574,0.000012640935,0.000002357588,0.0000082978395,0.000103146194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828845,0.000049091108,0.0003986669,0.0005739111,0.00034544338,0.00034443472],"domain_scores_gemma":[0.9985897,0.0001623332,0.0002660384,0.00065131247,0.00022737209,0.00010325575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047163275,0.00022090974,0.0005116873,0.00012387548,0.0000543543,0.000059083188,0.00068170484,0.00013167755,0.00006340755],"category_scores_gemma":[0.000024051868,0.00018391399,0.000117373835,0.0004288022,0.00024306346,0.00018706394,0.00039369776,0.00016865206,0.000024440698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060370938,0.0004190106,0.00835396,0.000217774,0.00010320501,0.0000063424436,0.0006877877,0.00013183606,0.0067533012,0.9001328,0.00063258084,0.08250106],"study_design_scores_gemma":[0.0014144478,0.0014984945,0.065519094,0.000069813854,0.000030347868,0.00006185555,0.0003466641,0.0019574098,0.024428101,0.9014381,0.0024699497,0.00076570356],"about_ca_topic_score_codex":0.000012431393,"about_ca_topic_score_gemma":0.0000045892534,"teacher_disagreement_score":0.086459585,"about_ca_system_score_codex":0.000009774223,"about_ca_system_score_gemma":0.00009300754,"threshold_uncertainty_score":0.7499795},"labels":[],"label_agreement":null},{"id":"W2768321261","doi":"10.3386/w24352","title":"Self-Regulating Artificial General Intelligence","year":2018,"lang":"en","type":"preprint","venue":"National Bureau of Economic Research","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Artificial intelligence; Computer science; Psychology; Cognitive science","score_opus":0.3483555332478298,"score_gpt":0.4949620633037156,"score_spread":0.1466065300558858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768321261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20887932,0.00087461586,0.51101965,0.009746005,0.010929396,0.0049258284,0.00014415041,0.001010591,0.25247046],"genre_scores_gemma":[0.73908544,0.000028145438,0.2578386,0.000034414046,0.0025871817,0.00009414018,0.00005341495,0.000026867956,0.00025181592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99513185,0.00048376742,0.0010304339,0.0013393249,0.0013926408,0.0006219776],"domain_scores_gemma":[0.9951099,0.001301943,0.0003571609,0.0011267987,0.0019358987,0.0001682729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0064619975,0.00028762585,0.00047228392,0.0008188367,0.00023179449,0.000429797,0.0035677445,0.00038838084,0.0001803326],"category_scores_gemma":[0.00066534174,0.00031266472,0.00022867181,0.0003634455,0.00042698687,0.0003045287,0.005458869,0.0010375148,0.00035638356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012409231,0.00016871488,0.00025934752,0.00010880981,0.00008820436,0.000002236568,0.0003808998,0.027475005,0.000085125794,0.94927794,0.0013786855,0.020762611],"study_design_scores_gemma":[0.000036008816,0.0000487424,0.00021889183,0.000019803061,0.00000174965,0.00000423558,0.000005790022,0.4585685,0.001491791,0.53928345,0.00017229485,0.00014868258],"about_ca_topic_score_codex":0.0003517747,"about_ca_topic_score_gemma":0.00006425478,"teacher_disagreement_score":0.5302061,"about_ca_system_score_codex":0.0014218794,"about_ca_system_score_gemma":0.0022758967,"threshold_uncertainty_score":0.9999325},"labels":[],"label_agreement":null},{"id":"W2774401503","doi":"10.7202/1048859ar","title":"La pyramide algorithmique","year":2017,"lang":"fr","type":"article","venue":"Sens public","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Art; Sociology","score_opus":0.07673374419306683,"score_gpt":0.3048538685620542,"score_spread":0.22812012436898738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774401503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025324265,0.0047802744,0.53958046,0.27934772,0.021411339,0.000918934,0.00008122769,0.0010437161,0.12751204],"genre_scores_gemma":[0.86850697,0.00023754449,0.0998266,0.001031636,0.0033524628,0.000027176897,0.000010287098,0.00008051536,0.026926782],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99515426,0.0007513255,0.0005832638,0.0013708209,0.00070662476,0.001433691],"domain_scores_gemma":[0.9931221,0.00056599,0.0004655523,0.0045227204,0.00065523654,0.0006684001],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023915155,0.0005305628,0.00056302303,0.00021820294,0.0012701876,0.00651857,0.0044088843,0.00054601656,0.0002826313],"category_scores_gemma":[0.0018016653,0.0005694843,0.00030876047,0.00037801563,0.0016435318,0.0028276795,0.0034549658,0.0009996436,0.0012328395],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019058674,0.00034783848,0.00190063,0.000063115025,0.00006206476,0.00055369776,0.0007342542,0.000036250458,0.000034748846,0.20440793,0.006569903,0.7852877],"study_design_scores_gemma":[0.00062296697,0.00015311029,0.047607716,0.00007110807,0.00002318063,0.0007853729,0.000056120327,0.26687074,0.00018334293,0.055916388,0.62694275,0.0007671754],"about_ca_topic_score_codex":0.001328337,"about_ca_topic_score_gemma":0.00052331184,"teacher_disagreement_score":0.84318274,"about_ca_system_score_codex":0.00032831987,"about_ca_system_score_gemma":0.00083422835,"threshold_uncertainty_score":0.9996757},"labels":[],"label_agreement":null},{"id":"W2775552709","doi":"10.3390/info8040161","title":"Can Computers Become Conscious, an Essential Condition for the Singularity?","year":2017,"lang":"en","type":"article","venue":"Information","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Consciousness; Active listening; Perception; Psychology; Human intelligence; Computer science; Cognitive science; Cognitive psychology; Artificial intelligence; Communication","score_opus":0.01743265544139592,"score_gpt":0.28302576506874766,"score_spread":0.2655931096273517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775552709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014747148,0.000005685473,0.9758523,0.0063589765,0.0019558598,0.0005800796,0.000023355977,0.00017295437,0.00030360348],"genre_scores_gemma":[0.96062595,0.0000015910504,0.038424026,0.0006283304,0.0001949114,0.000035849673,0.00007411467,0.0000038697926,0.000011365588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901,0.000038081536,0.00030210204,0.00016251052,0.00025973894,0.00022756132],"domain_scores_gemma":[0.9981676,0.00016806515,0.0003241935,0.0010128965,0.00025589394,0.00007139813],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005716963,0.000120511235,0.00012385572,0.000070396716,0.0012260795,0.0017589633,0.0014182831,0.0000661723,0.000004923349],"category_scores_gemma":[0.00014016865,0.00009722368,0.00007029131,0.000059959464,0.00019542397,0.004000219,0.00029833184,0.0001044226,0.000018218157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022785423,0.00011683313,0.00112333,0.00008727901,0.00005925169,0.0000024745996,0.007776921,0.0061577973,0.00007833265,0.37654042,0.0027710756,0.60526353],"study_design_scores_gemma":[0.0006049403,0.00010504372,0.025294527,0.000008768524,0.000010289579,0.000020380563,0.000059135673,0.9377483,0.00024882169,0.027359994,0.008360989,0.00017880918],"about_ca_topic_score_codex":0.000266458,"about_ca_topic_score_gemma":0.00019499773,"teacher_disagreement_score":0.9458788,"about_ca_system_score_codex":0.00007641957,"about_ca_system_score_gemma":0.00009173368,"threshold_uncertainty_score":0.9992773},"labels":[],"label_agreement":null},{"id":"W27769596","doi":"10.1007/978-1-4614-8453-0_1","title":"Computer Arithmetic and Fundamental Concepts of Computation","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Residual; Notation; Computer science; Computation; Arithmetic; Error analysis; Stability (learning theory); Algorithm; Mathematics; Applied mathematics","score_opus":0.02223403558129989,"score_gpt":0.25482500538601693,"score_spread":0.23259096980471705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27769596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034236477,0.0003628195,0.8355566,0.00025844722,0.0008116814,0.00068292406,0.000010066023,0.00023212242,0.16174297],"genre_scores_gemma":[0.052652534,0.00007546496,0.8229972,0.00070011505,0.00041144577,0.000017602191,0.000049351067,0.00007523752,0.12302106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975591,0.00004810163,0.00067728286,0.0008886595,0.00053894543,0.00028793226],"domain_scores_gemma":[0.9982283,0.00034056316,0.00037499767,0.00059586664,0.0002856028,0.00017467052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022315922,0.00046041986,0.0006992376,0.00022650103,0.000075466836,0.00021884734,0.00071181,0.0002750462,0.00033159612],"category_scores_gemma":[0.0000063798757,0.00042474183,0.00016426058,0.00006546103,0.00040140483,0.00031482996,0.0011763651,0.00030132112,0.00016008652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029717357,0.00007645341,0.00006305196,0.0001428458,0.00010221681,0.000015752092,0.00035528885,0.00021630344,0.000021180951,0.59068483,0.00215536,0.40616378],"study_design_scores_gemma":[0.0011463219,0.00095753203,0.0023674304,0.0002170108,0.000057988014,0.0001807923,0.00001351978,0.72609544,0.00009917267,0.24844483,0.019158361,0.0012616023],"about_ca_topic_score_codex":0.00004763249,"about_ca_topic_score_gemma":0.000007167654,"teacher_disagreement_score":0.72587913,"about_ca_system_score_codex":0.00009471645,"about_ca_system_score_gemma":0.000084054554,"threshold_uncertainty_score":0.9998204},"labels":[],"label_agreement":null},{"id":"W2782150885","doi":"10.1145/3177795.3177802","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2018,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Symbolic computation; Computation; Computer science; Quarter (Canadian coin); Algebra over a field; Library science; Mathematics; Algorithm; History; Pure mathematics","score_opus":0.06863021176894922,"score_gpt":0.3376415976700802,"score_spread":0.26901138590113094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782150885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38029027,0.0003018908,0.60809034,0.0077640046,0.0013178012,0.0008788977,0.000010111228,0.0003580103,0.0009886515],"genre_scores_gemma":[0.5400324,0.00008699378,0.45932162,0.00034429808,0.00012238517,0.000042684715,0.000026674648,0.00001736274,0.000005587104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578744,0.0006239081,0.0015675228,0.00087986566,0.00048227693,0.0006589757],"domain_scores_gemma":[0.9893213,0.0016587225,0.00041639444,0.007858619,0.00056703103,0.00017791918],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011647018,0.00040300319,0.00060898793,0.00075227354,0.0002484949,0.0002330848,0.009651615,0.00019079183,0.00006169159],"category_scores_gemma":[0.00020592561,0.0004314844,0.00014807285,0.0025992922,0.00060278404,0.00089143426,0.0059382557,0.0006593973,0.000112244124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027913838,0.003556748,0.041608218,0.000068340094,0.000095576914,0.000025464362,0.011385429,0.0044061295,0.00023022901,0.087392956,0.0011833354,0.85001963],"study_design_scores_gemma":[0.0011773861,0.00036393956,0.41165772,0.00015021936,0.0000109766515,0.000031200194,0.000041819178,0.51192075,0.00046776258,0.07072545,0.0028117776,0.0006410126],"about_ca_topic_score_codex":0.00052581966,"about_ca_topic_score_gemma":0.0021524215,"teacher_disagreement_score":0.84937865,"about_ca_system_score_codex":0.000256843,"about_ca_system_score_gemma":0.0002558219,"threshold_uncertainty_score":0.9998137},"labels":[],"label_agreement":null},{"id":"W2784921327","doi":"10.1016/j.tcs.2019.07.003","title":"Type-two polynomial-time and restricted lookahead","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; CHIST-ERA; Agence Nationale de la Recherche","keywords":"Computability; Oracle; Class (philosophy); Time complexity; Mathematics; Closure (psychology); Polynomial; Discrete mathematics; Simple (philosophy); Subroutine; Computer science; Combinatorics; Programming language","score_opus":0.006589398957977416,"score_gpt":0.23664922752132503,"score_spread":0.2300598285633476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784921327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5177606,0.000060279923,0.47318465,0.0012613048,0.0013962808,0.00042576983,0.0000017476403,0.0004824141,0.0054269694],"genre_scores_gemma":[0.8341861,0.0000032233072,0.165084,0.0004948131,0.00015375561,0.0000022262439,7.844917e-7,0.0000107156675,0.00006440948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643636,0.0001920102,0.0003670792,0.0013508106,0.0008259424,0.0008277721],"domain_scores_gemma":[0.9970931,0.0005785806,0.000084258,0.0015097557,0.00028877557,0.0004455759],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012355865,0.0002874168,0.00037016877,0.0002754314,0.00029151826,0.0007108999,0.0029376992,0.00007623452,0.00013724843],"category_scores_gemma":[0.00013872434,0.00024153404,0.000062814266,0.0020477762,0.0023465848,0.0008079994,0.002987152,0.00029620374,0.0009111642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022211425,0.00011488862,0.0006054151,0.000010922815,0.000007314935,0.000031628966,0.00028726424,0.0003439152,0.006234187,0.9184552,0.00017478957,0.073712304],"study_design_scores_gemma":[0.00051563384,0.0005366187,0.0071511324,0.0000214085,0.000004755877,0.00013201535,0.0000019655567,0.9349513,0.0015876901,0.054456867,0.00024538068,0.0003952337],"about_ca_topic_score_codex":0.000016046759,"about_ca_topic_score_gemma":5.7624095e-7,"teacher_disagreement_score":0.9346074,"about_ca_system_score_codex":0.00009834151,"about_ca_system_score_gemma":0.00024455876,"threshold_uncertainty_score":0.9998667},"labels":[],"label_agreement":null},{"id":"W2785157853","doi":"10.23638/lmcs-15(3:24)2019","title":"Approximability in the GPAC","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computation; Ordinary differential equation; Algebraic number; Computability; Applied mathematics; Discrete mathematics; Differential equation; Algebra over a field; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.1078568643603079,"score_gpt":0.4167622207046719,"score_spread":0.308905356344364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785157853","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015033505,0.00020760715,0.97291815,0.0025895182,0.0053865365,0.001879725,0.0000032489534,0.00025953574,0.001722168],"genre_scores_gemma":[0.15987433,0.0000128137735,0.8382617,0.001453304,0.00024052926,0.00013772438,0.0000013022318,0.000011428911,0.0000068586055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858827,0.0050600152,0.0014107177,0.004256766,0.0018696121,0.0015201963],"domain_scores_gemma":[0.987645,0.0055149207,0.00041092496,0.005908449,0.00028897167,0.00023179245],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.02945703,0.0007544759,0.0012394106,0.00074573804,0.00021684465,0.0015473091,0.019974375,0.00054525613,0.00001465616],"category_scores_gemma":[0.0015786681,0.00050607196,0.0003477771,0.0047568195,0.001707828,0.00068944396,0.021310573,0.003262408,0.000036964168],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100991765,0.0010398566,0.006786965,0.00016837985,0.00000635539,0.00012207437,0.0028123327,0.07975657,0.00007786985,0.045001473,0.000042403266,0.8641756],"study_design_scores_gemma":[0.00020336462,0.0001312009,0.05691426,0.000059502032,0.0000023459456,0.000032079464,0.00001113083,0.6463261,0.00008919065,0.29561433,0.00015980455,0.00045667996],"about_ca_topic_score_codex":0.00015343426,"about_ca_topic_score_gemma":0.000017526938,"teacher_disagreement_score":0.8637189,"about_ca_system_score_codex":0.0006781953,"about_ca_system_score_gemma":0.000851405,"threshold_uncertainty_score":0.9997391},"labels":[],"label_agreement":null},{"id":"W2788756104","doi":"","title":"Programming Languages; 21st Century Milestones","year":2009,"lang":"en","type":"book","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Computer science; Mathematics education; Programming language; Set (abstract data type); Second-generation programming language; Programming language theory; Fifth-generation programming language; Programming paradigm; Linguistics; Psychology; Artificial intelligence; Philosophy","score_opus":0.012769432934174579,"score_gpt":0.2503842921655118,"score_spread":0.2376148592313372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788756104","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074653626,0.0038846717,0.08255502,0.00062935735,0.00092850975,0.00088476745,0.000004973171,0.001969628,0.9091356],"genre_scores_gemma":[0.00012918666,0.00021428733,0.31919375,0.00094958895,0.0011922657,0.00003318418,0.000075480944,0.000059395126,0.67815286],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966818,0.00008401626,0.00051910774,0.0012649322,0.00074463955,0.00070551614],"domain_scores_gemma":[0.9973862,0.00019849764,0.0002277907,0.0017677661,0.00017878364,0.00024095841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037724085,0.0005963223,0.0006248176,0.00026758033,0.00013868319,0.00045410564,0.0025873117,0.00044222752,0.00012113693],"category_scores_gemma":[0.00004330317,0.00052912696,0.00032567597,0.00028600148,0.00011395573,0.0002956588,0.0009910138,0.00062150153,0.00042741757],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010891657,0.00011584182,0.0000067106103,0.000059426457,0.000025547948,0.00012689932,0.00029188526,0.00001115365,0.0000020476436,0.09401878,0.020397937,0.8849427],"study_design_scores_gemma":[0.00020539502,0.00018986088,0.00015673201,0.00009665699,0.000022030548,0.00011187079,0.000043777785,0.0017141437,0.000019275638,0.013712483,0.98285913,0.00086864043],"about_ca_topic_score_codex":0.00004268158,"about_ca_topic_score_gemma":0.000042038235,"teacher_disagreement_score":0.9624612,"about_ca_system_score_codex":0.00035103608,"about_ca_system_score_gemma":0.00048223924,"threshold_uncertainty_score":0.99971604},"labels":[],"label_agreement":null},{"id":"W2792092356","doi":"10.1090/conm/701/14149","title":"Arithmetic twists and Abelian extensions","year":2018,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Abelian group; Arithmetic; Algebra over a field; Pure mathematics","score_opus":0.02809434570266137,"score_gpt":0.2725073181917011,"score_spread":0.24441297248903973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792092356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012376724,0.00094456616,0.727437,0.0010939613,0.00033226504,0.0013577857,0.000043364525,0.0017485748,0.2669187],"genre_scores_gemma":[0.0020449369,0.00015378273,0.89030004,0.0007919881,0.0004261345,0.00012999977,0.000017470593,0.0005928571,0.105542794],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951832,0.00019988959,0.0011724881,0.0015562685,0.0010339053,0.0008542367],"domain_scores_gemma":[0.99423677,0.001073576,0.0011073466,0.0027378912,0.00019064517,0.0006537478],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010408292,0.0010561903,0.0020365193,0.00021151513,0.00016055246,0.0004321898,0.0020227209,0.00044018938,0.00063105207],"category_scores_gemma":[0.00044253824,0.000888955,0.0006271923,0.0009843212,0.0025218849,0.00020964454,0.001846513,0.00057514064,0.0010831624],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029658129,0.0014706857,0.00004788486,0.0024913948,0.00062489766,0.00006885277,0.0061529465,5.132698e-7,0.00003890653,0.09058146,0.8897465,0.008773027],"study_design_scores_gemma":[0.0012278436,0.00081748224,0.00008954104,0.002266917,0.00024410799,0.00034959597,0.0013836363,0.18920363,0.000037093363,0.410164,0.39083213,0.0033840388],"about_ca_topic_score_codex":0.00006426907,"about_ca_topic_score_gemma":0.0000051836255,"teacher_disagreement_score":0.49891433,"about_ca_system_score_codex":0.00012227426,"about_ca_system_score_gemma":0.00030858672,"threshold_uncertainty_score":0.9996946},"labels":[],"label_agreement":null},{"id":"W2792476526","doi":"","title":"Fun with Algorithms","year":2012,"lang":"en","type":"article","venue":"Fun with Algorithms","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.017095631606549432,"score_gpt":0.22910385984721252,"score_spread":0.2120082282406631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792476526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014417811,0.0012466985,0.9705635,0.0012255261,0.0020836052,0.0011293475,0.0000330161,0.0015955889,0.0077049388],"genre_scores_gemma":[0.26212925,0.000029273962,0.73294854,0.00092148065,0.0020022737,0.00024077705,0.000034322602,0.0001433828,0.0015506878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933357,0.00027181985,0.00071430684,0.0016138668,0.0017304858,0.0023337724],"domain_scores_gemma":[0.9949828,0.00039583334,0.0003674829,0.0026126404,0.0005092199,0.0011320378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012074872,0.0009710999,0.00088573893,0.00039263917,0.0005139478,0.00052029104,0.0024877188,0.00027794013,0.00019631725],"category_scores_gemma":[0.000063703366,0.0007031626,0.00019928403,0.002108553,0.0004165085,0.0024045503,0.0009435327,0.0008019061,0.00065432093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002537561,0.0033479414,0.05909545,0.00022914546,0.0007334853,0.0006562478,0.0073603205,0.0017694932,0.00023135701,0.01751394,0.005696439,0.9031124],"study_design_scores_gemma":[0.015438463,0.0107135065,0.20489755,0.0006070578,0.00054512854,0.007982616,0.0017012731,0.49926448,0.009357655,0.006828228,0.23105985,0.011604175],"about_ca_topic_score_codex":0.0001916684,"about_ca_topic_score_gemma":0.00003483406,"teacher_disagreement_score":0.8915082,"about_ca_system_score_codex":0.00029904247,"about_ca_system_score_gemma":0.0003378405,"threshold_uncertainty_score":0.99954194},"labels":[],"label_agreement":null},{"id":"W2799054834","doi":"10.3233/com-180094","title":"The reverse mathematics of Hindman’s Theorem for sums of exactly two elements","year":2018,"lang":"en","type":"preprint","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Reverse mathematics; Combinatorics; Computability; Ramsey's theorem; Discrete mathematics; Diagonal; Function (biology); Axiom","score_opus":0.04319915243120117,"score_gpt":0.3186231787592454,"score_spread":0.27542402632804425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799054834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21624419,0.00020759371,0.77700585,0.0003737373,0.0025423865,0.0028210317,0.00013163305,0.0001833467,0.00049024186],"genre_scores_gemma":[0.6103521,0.000016131888,0.38914958,0.000039865685,0.00024271035,0.000114478,0.00001797419,0.000034466775,0.000032712254],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940574,0.0005736668,0.0022593597,0.0014454129,0.00096980063,0.0006943241],"domain_scores_gemma":[0.9874045,0.0035735127,0.001860576,0.005311267,0.0016811377,0.00016897416],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.006995123,0.00062141824,0.0013203066,0.00013007138,0.00026401228,0.00017821987,0.0057836883,0.00029998965,0.000024786696],"category_scores_gemma":[0.0012606216,0.00046731453,0.00077794655,0.00038821198,0.0011763646,0.00016409757,0.0075654276,0.0005702606,0.00000936446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056612294,0.009825309,0.036307618,0.019769287,0.0022936168,0.000012275228,0.0230359,0.017325602,0.0013961733,0.40625557,0.0105968015,0.47261575],"study_design_scores_gemma":[0.0006533589,0.00027704638,0.0033723712,0.00016066487,0.000060434657,0.000004258114,0.00006258108,0.41216347,0.0025901992,0.579317,0.00091854617,0.00042006455],"about_ca_topic_score_codex":0.00010386873,"about_ca_topic_score_gemma":0.000049878818,"teacher_disagreement_score":0.47219568,"about_ca_system_score_codex":0.00030742105,"about_ca_system_score_gemma":0.00058573956,"threshold_uncertainty_score":0.99977785},"labels":[],"label_agreement":null},{"id":"W2803334365","doi":"10.3233/com-190254","title":"Degrees of categoricity above limit ordinals","year":2019,"lang":"en","type":"preprint","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Mathematics; Omega; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.04016338934134797,"score_gpt":0.2745719021321681,"score_spread":0.23440851279082012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803334365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25814903,0.0008811067,0.73223716,0.00074671936,0.0043711145,0.0015791687,0.000073219024,0.00062448793,0.0013379706],"genre_scores_gemma":[0.8578763,0.00002597795,0.14154644,0.00007884436,0.00028187482,0.000047556703,0.00002845499,0.00004007297,0.000074495045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99183553,0.0009550862,0.001860644,0.0030727675,0.0013006129,0.0009753321],"domain_scores_gemma":[0.9886573,0.0016832441,0.0011703068,0.0067252284,0.0014079738,0.00035597794],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002806336,0.0010214949,0.0022129777,0.0003506809,0.00014270066,0.00034748364,0.006743902,0.0008197298,0.00008859342],"category_scores_gemma":[0.00066374795,0.0009909043,0.0009763372,0.00096546556,0.0005111647,0.00039185508,0.015079562,0.001710511,0.00014041585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008198328,0.003439804,0.1421054,0.0042297808,0.0004399811,0.00004059856,0.0029905865,0.72503275,0.00013391476,0.022256438,0.0022059313,0.097042836],"study_design_scores_gemma":[0.00044997782,0.00026897137,0.20156811,0.00011879544,0.000052607855,0.000019202864,0.000024730638,0.7284974,0.0005135138,0.06684737,0.00058548246,0.0010538155],"about_ca_topic_score_codex":0.0011862672,"about_ca_topic_score_gemma":0.00007140231,"teacher_disagreement_score":0.5997273,"about_ca_system_score_codex":0.0006328699,"about_ca_system_score_gemma":0.0011664366,"threshold_uncertainty_score":0.99925417},"labels":[],"label_agreement":null},{"id":"W2807350215","doi":"10.1145/3313276.3316343","title":"Quantum proof systems for iterated exponential time, and beyond","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; U.S. Air Force; National Research Foundation; National Science Foundation; Asian Office of Aerospace Research and Development; National Research Foundation Singapore; Gordon and Betty Moore Foundation","keywords":"Multipartite; Nondeterministic algorithm; Mathematics; Iterated function; Discrete mathematics; Tensor product; Constant (computer programming); Quantum; Combinatorics; Pure mathematics; Computer science; Quantum entanglement; Quantum mechanics; Physics","score_opus":0.02159461953376887,"score_gpt":0.2513732164445883,"score_spread":0.22977859691081945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807350215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016931219,0.0011627423,0.97054297,0.0004635738,0.0052263397,0.003714018,0.00007736194,0.00051244616,0.0013693579],"genre_scores_gemma":[0.72867703,0.00006680778,0.2540459,0.00047462102,0.0016809267,0.001222382,0.00042234216,0.00015998769,0.01324998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662304,0.00017932944,0.0006504425,0.0016080088,0.00043146693,0.0005077159],"domain_scores_gemma":[0.99717534,0.000340771,0.00029234894,0.0016013542,0.00042574343,0.00016443024],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008350167,0.00048044522,0.00075425685,0.00021137658,0.00010705248,0.0012384976,0.0015601253,0.00040467826,0.000024006404],"category_scores_gemma":[0.00006368864,0.0004179703,0.00017920788,0.00018713654,0.000069688336,0.00028811934,0.0037454346,0.0003770995,0.00007050686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005155554,0.0044218996,0.0020783844,0.01981041,0.0024930367,0.00018738527,0.010851264,0.16695876,0.0071038087,0.512064,0.12339941,0.15011613],"study_design_scores_gemma":[0.00047184087,0.00019413928,0.00017049794,0.00007306877,0.00002051812,0.000026229192,0.000009101183,0.9845702,0.00029707977,0.01155526,0.0020809434,0.00053109956],"about_ca_topic_score_codex":0.00012277956,"about_ca_topic_score_gemma":0.0000039457855,"teacher_disagreement_score":0.81761146,"about_ca_system_score_codex":0.000102671846,"about_ca_system_score_gemma":0.0002638536,"threshold_uncertainty_score":0.9998272},"labels":[],"label_agreement":null},{"id":"W2807716139","doi":"10.1090/tran/7972","title":"Optimal bounds for single-source Kolmogorov extractors","year":2019,"lang":"en","type":"preprint","venue":"Transactions of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Randomness; Sigma; String (physics); Mathematics; Combinatorics; BETA (programming language); Transformation (genetics); Dimension (graph theory); Kolmogorov complexity; Discrete mathematics; Alpha (finance); Upper and lower bounds; Computer science; Physics; Statistics; Mathematical analysis; Mathematical physics","score_opus":0.027254625938875655,"score_gpt":0.27233834631116516,"score_spread":0.2450837203722895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807716139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03628866,0.000050270373,0.959416,0.0016706949,0.00064305845,0.0012416398,0.00006514507,0.00027677568,0.0003477932],"genre_scores_gemma":[0.4584851,0.000010869968,0.5407152,0.00015652129,0.00007540141,0.00011462361,0.0000026946734,0.00004308653,0.00039651402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969019,0.00015409771,0.0008057952,0.0008780232,0.0006996221,0.0005605561],"domain_scores_gemma":[0.994852,0.0014790006,0.0008056246,0.0024737543,0.00024064809,0.00014894227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000694599,0.00048267015,0.0010560213,0.0000503126,0.00026189667,0.0002118383,0.003254251,0.00022434577,0.00004675274],"category_scores_gemma":[0.000102898244,0.0003686373,0.0022441708,0.0005467388,0.0010423994,0.00016583722,0.0005694382,0.00088495796,0.000015403539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001309364,0.010050438,0.00025112217,0.0072966875,0.0031971268,0.0000019464865,0.029783858,0.7318234,0.008501104,0.0124869235,0.003434487,0.19304198],"study_design_scores_gemma":[0.00041075802,0.0004306052,0.0002945514,0.00019157598,0.0002941136,0.000032172848,0.00061242713,0.9483387,0.002565686,0.04488402,0.0011667822,0.0007786045],"about_ca_topic_score_codex":0.000072914074,"about_ca_topic_score_gemma":0.0000016379618,"teacher_disagreement_score":0.42219645,"about_ca_system_score_codex":0.00031343993,"about_ca_system_score_gemma":0.0002735161,"threshold_uncertainty_score":0.99987656},"labels":[],"label_agreement":null},{"id":"W2811274606","doi":"10.4171/owr/2017/37","title":"Proof Complexity and Beyond","year":2018,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Proof complexity; Mathematics; Mathematical proof; Geometry","score_opus":0.030681218929385967,"score_gpt":0.26205914382882317,"score_spread":0.2313779248994372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811274606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37621346,0.0003851295,0.54292595,0.002773623,0.0025754701,0.00088920037,0.000003748075,0.0007939807,0.073439404],"genre_scores_gemma":[0.88344365,0.0000017858802,0.11543511,0.0003500813,0.00024761143,0.00001593081,0.0000030186757,0.000011855447,0.00049097184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764615,0.00008353469,0.0004890589,0.0009203938,0.0004380757,0.00042277685],"domain_scores_gemma":[0.9979081,0.00006803244,0.00022501897,0.0013347578,0.00024572277,0.00021837268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008296321,0.00021631319,0.00027899482,0.00008633868,0.00026542362,0.00023472615,0.00042928572,0.00008598294,0.000072791016],"category_scores_gemma":[0.0001450662,0.00019531033,0.000066055116,0.0003732872,0.00045810142,0.0004262084,0.00091841206,0.00015940762,0.000029749981],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018683473,0.001016098,0.119423464,0.00014638666,0.000118748445,0.002433269,0.004501936,0.000025395382,0.0018148888,0.1024945,0.016113285,0.75189334],"study_design_scores_gemma":[0.00052086083,0.0008550306,0.27824846,0.0000311593,0.000027091879,0.0069568255,0.000040832383,0.06499059,0.01017998,0.55467385,0.08228014,0.0011951831],"about_ca_topic_score_codex":0.00009125365,"about_ca_topic_score_gemma":0.00007690736,"teacher_disagreement_score":0.75069815,"about_ca_system_score_codex":0.00005767858,"about_ca_system_score_gemma":0.000096626994,"threshold_uncertainty_score":0.7964524},"labels":[],"label_agreement":null},{"id":"W28294554","doi":"10.1002/asia.201700160","title":"Invariance and Definability: two faces of logical constants","year":2002,"lang":"en","type":"article","venue":"Chemistry - An Asian Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constant (computer programming); Epistemology; Computer science; Philosophy","score_opus":0.033384610516368166,"score_gpt":0.249772015388893,"score_spread":0.21638740487252484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28294554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86884856,0.0008921264,0.11471136,0.0022942363,0.00024232264,0.0001297887,0.00000903778,0.00010400399,0.012768585],"genre_scores_gemma":[0.9606064,0.000029354143,0.03908983,0.000063901076,0.00012686774,0.0000016559662,4.902283e-7,0.00000613494,0.00007537485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983217,0.00010279871,0.00044665489,0.00045644867,0.00032867253,0.00034373466],"domain_scores_gemma":[0.9986187,0.000071009184,0.00023238397,0.000544639,0.00016118055,0.0003720436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051157025,0.00019342372,0.0003150045,0.000030602157,0.00016285059,0.00024473402,0.0009240256,0.00009245706,0.00036995974],"category_scores_gemma":[0.00019831343,0.00017094874,0.00007798495,0.00024194119,0.0004126891,0.0004519351,0.0002695287,0.00042003675,0.000006270807],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051306597,0.0022216546,0.07488318,0.00042632534,0.00013608533,0.00097309105,0.00710886,0.0002608831,0.056239292,0.006180672,0.0013027836,0.85021585],"study_design_scores_gemma":[0.010518901,0.0018555021,0.09354913,0.00055981847,0.00011851404,0.03996599,0.0034162325,0.40942705,0.10456318,0.32605848,0.0061572394,0.0038099722],"about_ca_topic_score_codex":0.000001589547,"about_ca_topic_score_gemma":9.815918e-7,"teacher_disagreement_score":0.8464059,"about_ca_system_score_codex":0.000060073045,"about_ca_system_score_gemma":0.00007978541,"threshold_uncertainty_score":0.69710875},"labels":[],"label_agreement":null},{"id":"W2884894304","doi":"10.1007/978-3-319-97676-1_23","title":"Transforming Kantian Aesthetic Principles into Qualitative Hermeneutics for Contemplative AGI Agents","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Contemplation; Hermeneutics; Computer science; Aesthetics; Epistemology; Philosophy; Cognitive science; Psychology","score_opus":0.07093446716958052,"score_gpt":0.3358036743644492,"score_spread":0.26486920719486867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884894304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011743524,0.00019646274,0.9913235,0.0011474827,0.0022921478,0.0018911253,0.000019814963,0.00025583257,0.0016993067],"genre_scores_gemma":[0.18361092,0.000022745866,0.8141662,0.0011726085,0.0004841401,0.00007027455,0.000014383426,0.00007892854,0.00037984332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99366504,0.00016700184,0.0011248713,0.0026020093,0.0013073613,0.0011337021],"domain_scores_gemma":[0.99509245,0.0014135417,0.00056358625,0.0016983408,0.0009154334,0.00031664036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026408588,0.0009521879,0.0010357173,0.0008527584,0.0006352051,0.0006738706,0.0046155774,0.00046962357,0.00002468248],"category_scores_gemma":[0.00021606807,0.0008764463,0.00034922612,0.00071700086,0.002141369,0.00086123566,0.0014216835,0.0007615869,0.00004185497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037687372,0.00014859256,0.000020634878,0.00024411848,0.000062437226,0.00008485861,0.12982133,0.010906774,0.0001094662,0.06741933,0.00003469867,0.79111004],"study_design_scores_gemma":[0.000570874,0.00076730986,0.000021320324,0.0004247401,0.000018916446,0.00006512381,0.00001270828,0.45115584,0.0014869092,0.54033905,0.0041516772,0.0009855531],"about_ca_topic_score_codex":0.000047255675,"about_ca_topic_score_gemma":0.00040369545,"teacher_disagreement_score":0.79012454,"about_ca_system_score_codex":0.0007620225,"about_ca_system_score_gemma":0.00094266917,"threshold_uncertainty_score":0.9993686},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.026725196034065073,"score_gpt":0.35995958558393115,"score_spread":0.33323438954986606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887387095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011299173,0.029949777,0.94391805,0.005212347,0.00086009986,0.006435574,0.00003957894,0.0005452255,0.001740158],"genre_scores_gemma":[0.77449435,0.098651946,0.08960277,0.028686307,0.00338428,0.004063782,0.00025929886,0.0003119359,0.0005453519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99382794,0.0005251975,0.0012077348,0.002013557,0.0013264796,0.0010990744],"domain_scores_gemma":[0.9943201,0.0011409624,0.0005533267,0.0027997405,0.00068942964,0.0004964372],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011889801,0.00092641666,0.0025362868,0.000097263655,0.00017525996,0.00020639549,0.0027801243,0.00009066742,0.00003875421],"category_scores_gemma":[0.00051897345,0.00073096866,0.0017395382,0.0014828406,0.00014261401,0.0015250292,0.0009066597,0.00073179073,0.0017989664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010646569,0.0009308862,0.000017827198,0.0060395813,0.00006999227,0.000004674135,0.00013534413,0.00021489884,0.0018714922,0.55706704,0.007465828,0.42617178],"study_design_scores_gemma":[0.0003449896,0.00036360326,0.000085168474,0.003473829,0.00013240847,0.000009879385,0.0000025295521,0.59618664,0.0006483782,0.3806427,0.017399393,0.0007104586],"about_ca_topic_score_codex":0.000018879851,"about_ca_topic_score_gemma":0.000002046992,"teacher_disagreement_score":0.8543153,"about_ca_system_score_codex":0.0002732081,"about_ca_system_score_gemma":0.00021828953,"threshold_uncertainty_score":0.99951416},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.023570271366512578,"score_gpt":0.23768645894926246,"score_spread":0.2141161875827499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894178851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026154324,0.00004075624,0.9692867,0.0022325427,0.00057793723,0.00037715124,0.00004310636,0.0005237511,0.00076376664],"genre_scores_gemma":[0.89244336,0.0000031221061,0.09424074,0.012829121,0.00036785763,0.000029407613,0.000057322817,0.00001860865,0.000010436348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981654,0.00016404327,0.00039346638,0.00045578467,0.0004467632,0.00037453577],"domain_scores_gemma":[0.9985337,0.00022206953,0.00012193732,0.0006920577,0.00016125546,0.00026896643],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029447547,0.0002481294,0.00029415093,0.000025781937,0.00015342374,0.00035697926,0.0011601042,0.00007048573,0.000032606415],"category_scores_gemma":[0.000043489392,0.0002296088,0.00009698346,0.00041682328,0.000087455206,0.0017287803,0.00068336155,0.0002152314,0.00097376615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032896733,0.000086981636,0.00023893637,0.000033126325,0.000041981635,0.000008353483,0.009252918,0.0032964004,0.00031173104,0.908413,0.0006948271,0.07758887],"study_design_scores_gemma":[0.00029823006,0.00018665381,0.00081205496,0.000011100656,0.000008128664,0.0000014881313,0.00007571551,0.6765888,0.0014446012,0.30946353,0.010808273,0.00030142334],"about_ca_topic_score_codex":0.0008668877,"about_ca_topic_score_gemma":0.000038503702,"teacher_disagreement_score":0.87504596,"about_ca_system_score_codex":0.000067869536,"about_ca_system_score_gemma":0.000048995116,"threshold_uncertainty_score":0.9998041},"labels":[],"label_agreement":null},{"id":"W2896666330","doi":"10.4236/ns.2018.1010036","title":"A Hidden Stability in the Random Behaviour of the Consecutive Prime Numbers","year":2018,"lang":"en","type":"article","venue":"Natural Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Conjecture; Mathematics; Interpretation (philosophy); Prime (order theory); Stability (learning theory); Square root; Combinatorics; Mean square; Square (algebra); Statistics; Discrete mathematics; Computer science; Geometry; Philosophy; Linguistics","score_opus":0.016514792099821516,"score_gpt":0.27359443851821147,"score_spread":0.25707964641838993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896666330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916266,0.00006867307,0.0026792097,0.002240496,0.0010723186,0.00064152124,0.0000029745215,0.000041996995,0.001626207],"genre_scores_gemma":[0.9944232,6.775396e-7,0.005195516,0.00030975006,0.000043475782,0.000009873308,1.1273513e-7,0.0000021077458,0.000015303733],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9971777,0.00038287498,0.00030514886,0.000596969,0.0010985698,0.00043871923],"domain_scores_gemma":[0.99764043,0.00056970184,0.00015256928,0.0011772695,0.00039964775,0.000060387647],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035646937,0.00013844979,0.00018587463,0.00006876045,0.00034592513,0.00015300284,0.0049063447,0.000048268124,0.000015883832],"category_scores_gemma":[0.00096463796,0.00006991224,0.000095483316,0.0027106153,0.00330444,0.0005517798,0.001107842,0.00035884953,0.000009434646],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025467522,0.0013939346,0.63012606,0.000040112816,0.000024987196,0.000036832473,0.086884156,0.00002574155,0.04906668,0.08214099,0.0008001717,0.14920567],"study_design_scores_gemma":[0.00078630255,0.00012312131,0.9405621,0.000019811412,0.0000054728216,0.000039913044,0.00046582165,0.02069412,0.027440887,0.009584473,0.00007829512,0.00019966456],"about_ca_topic_score_codex":0.0008065631,"about_ca_topic_score_gemma":0.0005049867,"teacher_disagreement_score":0.31043607,"about_ca_system_score_codex":0.00017793657,"about_ca_system_score_gemma":0.0005924864,"threshold_uncertainty_score":0.999408},"labels":[],"label_agreement":null},{"id":"W2898117887","doi":"10.1017/jsl.2020.46","title":"THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Countable set; Combinatorics; Mathematics; Order (exchange); Rank (graph theory); Hausdorff space; Discrete mathematics; Sentence; Sigma; Physics; Computer science; Artificial intelligence","score_opus":0.08827320045250713,"score_gpt":0.28530182910994717,"score_spread":0.19702862865744003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898117887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6198315,0.0014450816,0.3160963,0.060079858,0.0012952312,0.00037237327,0.00000830802,0.00006035518,0.0008110126],"genre_scores_gemma":[0.9634913,0.00007483314,0.035652813,0.00056685094,0.00020304229,6.1375863e-7,2.0428608e-7,0.0000051661455,0.000005139166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976959,0.00023253252,0.00095941947,0.00020839772,0.000652708,0.0002509958],"domain_scores_gemma":[0.99748504,0.00035068774,0.0010153467,0.00039281085,0.0005989888,0.00015709705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009168134,0.00015288373,0.0005268931,0.00008260004,0.00010024334,0.000052170406,0.0020546787,0.000054570995,0.000018860586],"category_scores_gemma":[0.00038715856,0.000092406226,0.00026254464,0.00065126736,0.0007276214,0.00024159312,0.00042886892,0.00029133205,0.000006520349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010984313,0.0047672614,0.12933132,0.0018676503,0.0022946328,0.00049962156,0.046370707,0.033560548,0.062594935,0.4357649,0.015308575,0.2665414],"study_design_scores_gemma":[0.004468326,0.006549031,0.1684213,0.00038219325,0.00017355828,0.00084541587,0.0033186148,0.4041959,0.02325604,0.38315463,0.0041467273,0.0010882646],"about_ca_topic_score_codex":0.000045260265,"about_ca_topic_score_gemma":0.0000075266325,"teacher_disagreement_score":0.37063536,"about_ca_system_score_codex":0.000028947914,"about_ca_system_score_gemma":0.00019584663,"threshold_uncertainty_score":0.38181382},"labels":[],"label_agreement":null},{"id":"W2898898042","doi":"10.1016/j.aim.2018.10.036","title":"The computability, definability, and proof theory of Artinian rings","year":2018,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Artinian ring; Noetherian; Lemma (botany); Reverse mathematics; Semisimple module; Axiom; Pure mathematics; Algebra over a field; Ring (chemistry); Discrete mathematics; Noncommutative ring","score_opus":0.013538023651224411,"score_gpt":0.2755773544212002,"score_spread":0.26203933076997576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898898042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22621803,0.0018497559,0.76548237,0.00050654216,0.00038728348,0.00070639374,0.0000019895506,0.00011311997,0.0047345394],"genre_scores_gemma":[0.7731634,0.00006012542,0.22664544,0.00003527202,0.000040697527,0.000021686448,1.465281e-7,0.000009225156,0.000024016368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980247,0.00019463463,0.0006585328,0.0004379634,0.00033562537,0.00034852955],"domain_scores_gemma":[0.9959659,0.002409864,0.00025195113,0.0011011589,0.00020870213,0.000062398554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027444966,0.00018589981,0.00032911674,0.00006508342,0.00016951139,0.0000878673,0.0011624179,0.00005514495,0.00000567656],"category_scores_gemma":[0.00095684297,0.00012907444,0.000055942986,0.00047482838,0.0012271237,0.00044378013,0.001085258,0.00016413715,0.0000066561943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106516545,0.0003748833,0.008494041,0.0003352183,0.00000896116,0.0000018725302,0.00543127,0.00011807387,0.000025375739,0.60591185,0.000008031267,0.37927976],"study_design_scores_gemma":[0.00017463641,0.00016673586,0.005181201,0.00005074677,0.0000038542817,0.000016825687,0.00019143766,0.06341117,0.0009262944,0.92872095,0.0010146751,0.00014144741],"about_ca_topic_score_codex":0.000003514058,"about_ca_topic_score_gemma":0.00007153144,"teacher_disagreement_score":0.54694533,"about_ca_system_score_codex":0.00004880418,"about_ca_system_score_gemma":0.000051578987,"threshold_uncertainty_score":0.5263503},"labels":[],"label_agreement":null},{"id":"W2911434043","doi":"10.1080/17445760.2015.1079321","title":"Nonuniversality explained","year":2015,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Counterexample; Computation; Universality (dynamical systems); Turing machine; Computer science; Turing; Theoretical computer science; Calculus (dental); Arithmetic; Algorithm; Mathematics; Discrete mathematics; Programming language; Physics","score_opus":0.043383462682646465,"score_gpt":0.28215263299824206,"score_spread":0.23876917031559558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911434043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04768721,0.0007946907,0.94327366,0.0020629084,0.005617621,0.00010318542,0.00003328525,0.000038462258,0.0003890008],"genre_scores_gemma":[0.9939237,0.00005105925,0.005413344,0.00003731677,0.00046956382,0.000002276215,0.000017950912,0.0000044881413,0.000080286365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798226,0.00015261312,0.000640458,0.00020192668,0.0008465739,0.00017615786],"domain_scores_gemma":[0.99764854,0.00007039875,0.0004401138,0.00020627385,0.0013192113,0.00031546975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087942195,0.0001409571,0.00026079427,0.00013969243,0.000041821746,0.00020519618,0.0010857135,0.000056923524,0.000011939872],"category_scores_gemma":[0.00017953634,0.00011803294,0.00011430847,0.00016712712,0.000042084645,0.0005820188,0.0002885448,0.00013369828,0.0000117385025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012652082,0.0026527615,0.13478786,0.0001310114,0.0029598312,0.0033422185,0.008581507,0.2599443,0.0009477521,0.35714135,0.20742063,0.020825583],"study_design_scores_gemma":[0.008904203,0.00094865315,0.02299505,0.00017290776,0.00007180226,0.0024741092,0.0031090917,0.76729757,0.00009206092,0.016813137,0.1761384,0.000983012],"about_ca_topic_score_codex":0.00010473772,"about_ca_topic_score_gemma":0.0000072352295,"teacher_disagreement_score":0.9462365,"about_ca_system_score_codex":0.00018892321,"about_ca_system_score_gemma":0.00015767213,"threshold_uncertainty_score":0.48132437},"labels":[],"label_agreement":null},{"id":"W2911672681","doi":"","title":"Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing","year":2002,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Flexibility (engineering); Exploit; Data science; Telecommunications; Computer security","score_opus":0.017406343311687732,"score_gpt":0.2595105196462381,"score_spread":0.2421041763345504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911672681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7093918,0.000021804371,0.2775319,0.0035109653,0.0012174108,0.0011101587,0.000006776486,0.000094944626,0.0071142465],"genre_scores_gemma":[0.94733924,0.000005934097,0.05242534,0.00014270913,0.00006649273,0.000010817893,0.0000011910353,0.0000036401266,0.0000046208506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780774,0.000057518657,0.0007659126,0.00035967623,0.0007174338,0.0002916979],"domain_scores_gemma":[0.997938,0.00044133666,0.00047321653,0.00040774213,0.00070013327,0.000039600236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011907029,0.00018030395,0.00030315548,0.00047244175,0.00019220279,0.00025331648,0.0020600075,0.000073338415,0.000034952733],"category_scores_gemma":[0.000057158937,0.00011539884,0.00006114148,0.0019811625,0.0021462266,0.00067201996,0.0012146292,0.0003819757,0.000001411407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005308357,0.00021200458,0.01157329,0.000029614948,0.000012817912,3.1291523e-7,0.0030299772,0.0027092355,0.00009134929,0.85477984,0.00007545696,0.12748079],"study_design_scores_gemma":[0.00039100996,0.00021503272,0.014467531,0.00016564889,0.0000050621575,0.000019314535,0.00023429176,0.9637884,0.0008298805,0.019675955,0.0000866921,0.00012116798],"about_ca_topic_score_codex":0.000022905391,"about_ca_topic_score_gemma":0.000010001055,"teacher_disagreement_score":0.9610792,"about_ca_system_score_codex":0.000059881924,"about_ca_system_score_gemma":0.00006154373,"threshold_uncertainty_score":0.79078615},"labels":[],"label_agreement":null},{"id":"W2912398006","doi":"","title":"Proceedings of the 6th international conference on Unconventional Computation","year":2007,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Queen's University","funders":"","keywords":"Computer science; Computation; Operations research; Programming language","score_opus":0.027073066745049636,"score_gpt":0.2793099906282624,"score_spread":0.2522369238832128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912398006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005162483,0.000033003333,0.9781865,0.0014419265,0.004849677,0.0005706717,0.000009522243,0.000114551935,0.014277928],"genre_scores_gemma":[0.5148772,0.000013667113,0.4805887,0.0019346771,0.0012805597,0.000022168077,0.000017217902,0.000046631554,0.0012191525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471015,0.000039913957,0.0008030385,0.0015148371,0.0023664068,0.00056567043],"domain_scores_gemma":[0.9967056,0.0005225745,0.0007000245,0.00067681447,0.001269563,0.00012542408],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016449168,0.00048706576,0.0004926595,0.0008490024,0.00021203455,0.0004954811,0.0061333096,0.00029890751,0.000024368604],"category_scores_gemma":[0.00018281618,0.0003796418,0.0002319948,0.001583197,0.0012424714,0.00055821677,0.002336993,0.0009834518,0.000017781405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003145144,0.00045266963,0.0012223329,0.00016851646,0.000050533472,0.000025447514,0.0014065981,0.09620532,0.00040719038,0.17797332,0.0007025492,0.72135407],"study_design_scores_gemma":[0.0003148377,0.00017566084,0.0021320418,0.00041856873,0.0000055181677,0.000045792112,5.6444134e-7,0.66418904,0.0012090439,0.33083197,0.00029022436,0.0003867562],"about_ca_topic_score_codex":0.000016238544,"about_ca_topic_score_gemma":0.000027341497,"teacher_disagreement_score":0.72096735,"about_ca_system_score_codex":0.00088408706,"about_ca_system_score_gemma":0.0013626815,"threshold_uncertainty_score":0.99986553},"labels":[],"label_agreement":null},{"id":"W2913399114","doi":"","title":"Proceedings of the 15th International Conference on Unconventional Computation and Natural Computation - Volume 9726","year":2016,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computation; Volume (thermodynamics); Natural (archaeology); Computer science; Mathematical economics; Mathematics; Geography; Algorithm; Archaeology; Physics; Thermodynamics","score_opus":0.021167905221735395,"score_gpt":0.25938729212252515,"score_spread":0.23821938690078975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913399114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36006397,0.0000101790465,0.6228549,0.010805203,0.0014451535,0.00034390175,0.000007706548,0.00014542867,0.004323571],"genre_scores_gemma":[0.97063303,0.000002163604,0.02859331,0.00015379704,0.00006046615,0.0000061316073,0.0000022498916,0.0000047101053,0.0005441139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998591,0.00003089454,0.0002986846,0.00040369434,0.00052495534,0.00015074489],"domain_scores_gemma":[0.9989413,0.00012807564,0.00020060774,0.00010927035,0.000572181,0.000048590435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002763066,0.00013596877,0.00013793282,0.00009444234,0.00008837587,0.00013181225,0.0005975043,0.000045507444,0.00003931588],"category_scores_gemma":[0.000067702334,0.0000789639,0.00006569525,0.00021861885,0.00017701324,0.0005335902,0.00041059664,0.00009542636,0.000015197754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030485337,0.00022345234,0.023276871,0.000031746247,0.000049451006,8.704596e-7,0.00039815131,0.00029852768,0.0058634533,0.80888253,0.0018081734,0.1591363],"study_design_scores_gemma":[0.0007582793,0.00013228001,0.19694115,0.000074621144,0.0000047481276,0.000024965304,0.000034100805,0.7092323,0.0012767593,0.09117961,0.00016613175,0.00017507965],"about_ca_topic_score_codex":0.000018696172,"about_ca_topic_score_gemma":0.0000059574304,"teacher_disagreement_score":0.7177029,"about_ca_system_score_codex":0.000085985164,"about_ca_system_score_gemma":0.00005898793,"threshold_uncertainty_score":0.32200542},"labels":[],"label_agreement":null},{"id":"W2913818402","doi":"","title":"Proceedings of the 9th Latin American conference on Theoretical Informatics","year":2010,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Informatics; Latin Americans; Library science; Political science; Computer science; Law","score_opus":0.011113089476852757,"score_gpt":0.2337965951314295,"score_spread":0.22268350565457676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913818402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7176205,3.8464947e-7,0.12230843,0.0032322027,0.00068902905,0.0003301683,0.0000016964508,0.0001898814,0.15562771],"genre_scores_gemma":[0.88042855,4.045951e-7,0.119046696,0.00035665304,0.000025110387,0.0000044331127,8.868284e-8,0.0000031629595,0.00013488339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989516,0.000011936093,0.0002867564,0.00016326028,0.00038044943,0.00020601288],"domain_scores_gemma":[0.998947,0.00016037909,0.00015760078,0.0004323866,0.00022991252,0.000072719675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033590043,0.00011631505,0.00016439892,0.000040631327,0.00006385257,0.00011996023,0.0014705571,0.000039443254,0.0000733862],"category_scores_gemma":[0.00019242227,0.00006611297,0.000059801343,0.00044100333,0.0007752341,0.00016549247,0.0006095891,0.00031889867,0.000023307004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016479771,0.000049120343,0.0022741046,0.000006740295,0.0000023547998,7.2808234e-8,0.0008416892,0.0000043732007,0.00044594225,0.97621924,0.00014677335,0.020007951],"study_design_scores_gemma":[0.0002687108,0.00044144952,0.037202504,0.000020277932,0.000005990844,0.000015828755,0.00047456578,0.7071366,0.01622268,0.23691677,0.0009884338,0.00030620935],"about_ca_topic_score_codex":0.000015108985,"about_ca_topic_score_gemma":0.000007928589,"teacher_disagreement_score":0.73930246,"about_ca_system_score_codex":0.000011791235,"about_ca_system_score_gemma":0.000069821246,"threshold_uncertainty_score":0.2856382},"labels":[],"label_agreement":null},{"id":"W2913835260","doi":"","title":"Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation","year":2013,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Symbolic computation; Computer science; Symbolic-numeric computation; Algebra over a field; Algebraic number; The Symbolic; Symbolic data analysis; Computation; Gröbner basis; Symbolic trajectory evaluation; Linear algebra; Theoretical computer science; Mathematics; Algorithm; Pure mathematics","score_opus":0.008027117653752509,"score_gpt":0.21407947446596703,"score_spread":0.20605235681221454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913835260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9264703,0.000008921065,0.043143086,0.010386514,0.00062230445,0.00047389418,7.962043e-7,0.00013970265,0.018754486],"genre_scores_gemma":[0.98596364,0.000002320091,0.013273629,0.00046489868,0.00005171947,0.000014570098,3.987944e-7,0.0000044998073,0.00022433428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990235,0.000014176352,0.00020227251,0.0003036588,0.00032266433,0.00013373181],"domain_scores_gemma":[0.9993617,0.0000943984,0.00009671514,0.00014990347,0.00024900958,0.00004827603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015241123,0.00010341663,0.00011012143,0.000054544464,0.000060738184,0.00018563385,0.00071419857,0.000036104542,0.00002411866],"category_scores_gemma":[0.000031214237,0.00006763774,0.00004193377,0.00023993806,0.00007809793,0.0003966839,0.00049440074,0.00008738353,0.000023773533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008247737,0.00057753077,0.045253634,0.00008882454,0.00008347837,7.362884e-7,0.004144219,0.0009140945,0.014605324,0.7467812,0.006565844,0.18097691],"study_design_scores_gemma":[0.00037396752,0.00015615225,0.33226064,0.000029888968,0.0000044871235,0.000024659012,0.00006837403,0.5991577,0.005096467,0.062367734,0.00027161906,0.00018830203],"about_ca_topic_score_codex":0.00006731193,"about_ca_topic_score_gemma":0.0000021451308,"teacher_disagreement_score":0.68441343,"about_ca_system_score_codex":0.00003519411,"about_ca_system_score_gemma":0.00001652117,"threshold_uncertainty_score":0.2758187},"labels":[],"label_agreement":null},{"id":"W2914014471","doi":"10.1080/17445760.2019.1570193","title":"A computational journey in the true north","year":2019,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"History; Computer science","score_opus":0.020364489941600252,"score_gpt":0.27002593709555933,"score_spread":0.24966144715395908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914014471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42864063,0.0006624067,0.5638987,0.0030909206,0.0032322353,0.00023717112,0.000035572666,0.000014245557,0.00018811536],"genre_scores_gemma":[0.99746066,0.00005028734,0.0020265605,0.00012393383,0.00027304326,0.0000049299933,0.000028926042,0.0000042620386,0.000027371063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975674,0.0002279935,0.0008182554,0.00020545135,0.000990737,0.00019012508],"domain_scores_gemma":[0.99845886,0.00023289934,0.0004544996,0.00019557538,0.0005653186,0.00009282164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090559624,0.00014613173,0.00026071316,0.00019421137,0.00004560402,0.0002939952,0.0014490952,0.000045460092,0.000025036286],"category_scores_gemma":[0.000074105665,0.000099911354,0.00012889474,0.00028634048,0.000031419953,0.00043321488,0.00016628283,0.00024497433,0.000020196836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009387325,0.00046506574,0.2583499,0.000030584564,0.00025222191,0.00026896206,0.0018278925,0.6865836,0.000024451712,0.043239724,0.006394536,0.0024692551],"study_design_scores_gemma":[0.0023121932,0.00024363291,0.29837364,0.00008218948,0.000012583831,0.001256497,0.0005958246,0.67668384,0.000001619823,0.0058503803,0.014326092,0.00026147172],"about_ca_topic_score_codex":0.0000633857,"about_ca_topic_score_gemma":0.000024813071,"teacher_disagreement_score":0.56882006,"about_ca_system_score_codex":0.00010258363,"about_ca_system_score_gemma":0.00011525769,"threshold_uncertainty_score":0.40742666},"labels":[],"label_agreement":null},{"id":"W2915542037","doi":"10.1145/2893803.2893804","title":"Jenks prize 2015 award citation","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Library science; Thematic map; Computer science; Geography; Cartography","score_opus":0.053310550003086966,"score_gpt":0.3168423321230978,"score_spread":0.2635317821200108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915542037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012549934,0.000393293,0.9396949,0.045034375,0.0007681679,0.0004568445,0.0000053262906,0.00056843547,0.0005287587],"genre_scores_gemma":[0.40639237,0.000139153,0.5926262,0.0005763038,0.00009667784,0.00008193985,0.0000086281925,0.000017529375,0.00006118628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968735,0.00066968537,0.000749231,0.00075832405,0.00043594794,0.00051332795],"domain_scores_gemma":[0.9871274,0.002614854,0.00021564189,0.009566744,0.00032204232,0.00015331114],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011631504,0.0002977298,0.000348732,0.00043810435,0.00025056856,0.00025083707,0.010796716,0.00015046302,0.000023242663],"category_scores_gemma":[0.00040097767,0.00024650665,0.00013076806,0.0012439038,0.0002907397,0.0011000666,0.007977325,0.00034779776,0.00035689134],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005607338,0.00051465986,0.007921644,0.000014165799,0.000038710474,0.000007670667,0.0016759816,0.00014138498,0.00030065834,0.11579039,0.0048594465,0.86872965],"study_design_scores_gemma":[0.002041211,0.00026161716,0.10902936,0.00020003818,0.000014165253,0.00006787577,0.00001900984,0.27542904,0.00031683085,0.5788967,0.032714047,0.0010101033],"about_ca_topic_score_codex":0.00006102067,"about_ca_topic_score_gemma":0.00010300846,"teacher_disagreement_score":0.8677196,"about_ca_system_score_codex":0.00031556052,"about_ca_system_score_gemma":0.00016778902,"threshold_uncertainty_score":0.9999987},"labels":[],"label_agreement":null},{"id":"W2917055100","doi":"10.4230/dagsemproc.10061.1","title":"10061 Abstracts Collection – Circuits, Logic, and Games","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Informatics; Section (typography); Work (physics); Research center; Center (category theory); Electronic circuit; Mathematics education; Electrical engineering; Engineering; Psychology; Political science","score_opus":0.012914686516707862,"score_gpt":0.2445793892799274,"score_spread":0.23166470276321954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917055100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5216658,0.000082302526,0.4543106,0.0015010871,0.00539169,0.002354779,0.00015030407,0.0009873345,0.013556103],"genre_scores_gemma":[0.91890806,0.000033934506,0.07919537,0.0010132989,0.00028815656,0.00011269018,0.00007844396,0.000035921883,0.00033410662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968186,0.000042263335,0.0011646299,0.0005280855,0.0005754781,0.0008709138],"domain_scores_gemma":[0.99725413,0.00034396208,0.00048783957,0.0011278705,0.00042683457,0.0003593678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001043364,0.0004756079,0.0005092753,0.00034404866,0.0005383118,0.0009881876,0.0013238896,0.00036123468,0.00004272483],"category_scores_gemma":[0.00030259654,0.00043333665,0.00020293593,0.00052138604,0.00024113867,0.0020906876,0.0007392199,0.0007837705,0.00012480047],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015985215,0.0029289473,0.036666635,0.0023228314,0.000595112,0.00006321787,0.040982854,0.00094881275,0.0033196763,0.1464961,0.025089953,0.740426],"study_design_scores_gemma":[0.009341513,0.0017214566,0.108931385,0.00018099077,0.00011385117,0.001565836,0.0014032662,0.5447116,0.0069984784,0.055749655,0.26591355,0.0033684226],"about_ca_topic_score_codex":0.000047889396,"about_ca_topic_score_gemma":0.000116137024,"teacher_disagreement_score":0.73705757,"about_ca_system_score_codex":0.000110030494,"about_ca_system_score_gemma":0.00014978023,"threshold_uncertainty_score":0.9998118},"labels":[],"label_agreement":null},{"id":"W2917875619","doi":"10.3390/info10020073","title":"AI and the Singularity: A Fallacy or a Great Opportunity?","year":2019,"lang":"en","type":"article","venue":"Information","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fallacy; Human intelligence; Trustworthiness; Variety (cybernetics); Singularity; Artificial general intelligence; Epistemology; Wishful thinking; Field (mathematics); Skepticism; Artificial intelligence; Psychology; Sociology; Computer science; Social psychology; Philosophy; Mathematics","score_opus":0.01300203983681564,"score_gpt":0.23407058252422794,"score_spread":0.2210685426874123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917875619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05439659,0.000033771645,0.9152946,0.016018191,0.0006712755,0.0009874671,0.0000033113972,0.00031166317,0.012283123],"genre_scores_gemma":[0.97359765,0.00001229622,0.01698212,0.008994059,0.000052323354,0.000020652013,0.000008963427,0.0000040104906,0.00032795273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.00006601191,0.00024596998,0.00010849169,0.00024706355,0.00014923603],"domain_scores_gemma":[0.9991039,0.00013632537,0.00009762937,0.00047524262,0.00012122883,0.00006565868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063393917,0.000092088565,0.00012642924,0.00007571818,0.00010282399,0.00048545367,0.00042121887,0.000046655336,0.000044998214],"category_scores_gemma":[0.00015932039,0.000054829812,0.000034356286,0.00023815561,0.00007877087,0.0026348825,0.00037267356,0.00012745209,0.00014478753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073733696,0.000025902495,0.0013066123,0.00008028046,0.0000192425,0.0000029679566,0.009576429,0.00017975205,0.0000038976395,0.20047511,0.0010201375,0.7872359],"study_design_scores_gemma":[0.0017468019,0.00010965732,0.00598738,0.000016794798,0.0000066146454,0.00011214314,0.000119875534,0.91404593,0.000024406032,0.036642894,0.041002605,0.00018489714],"about_ca_topic_score_codex":0.00008819332,"about_ca_topic_score_gemma":0.000014001904,"teacher_disagreement_score":0.919201,"about_ca_system_score_codex":0.000037978552,"about_ca_system_score_gemma":0.00011050494,"threshold_uncertainty_score":0.4681241},"labels":[],"label_agreement":null},{"id":"W2923661777","doi":"10.5539/jmr.v11n2p181","title":"Fault Tolerance and 2-Domination in Certain Interconnection Networks","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hypercube; Combinatorics; Domination analysis; Vertex (graph theory); Fault tolerance; Dominating set; Discrete mathematics; Interconnection; Graph; Weight function; Minimum weight; Computer science; Distributed computing; Computer network; Statistics","score_opus":0.0471084786411225,"score_gpt":0.35155708945718994,"score_spread":0.30444861081606744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923661777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6452172,0.00017545768,0.35300517,0.00069387886,0.0002578634,0.00019222806,9.959251e-8,0.000007661414,0.00045044514],"genre_scores_gemma":[0.9504942,0.00006377401,0.04921649,0.000016660291,0.00008418416,0.0000028823422,8.9272795e-8,0.0000062602107,0.000115424155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980873,0.00028333164,0.0005028807,0.00017595798,0.0006891909,0.00026137062],"domain_scores_gemma":[0.99775344,0.0011846351,0.0001836527,0.00029241096,0.0005078123,0.00007802421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057405825,0.00008273556,0.00024925434,0.00045843603,0.0000456713,0.00020012073,0.00062482595,0.00007113937,0.000016898164],"category_scores_gemma":[0.00050691963,0.00006762424,0.00004780422,0.0005661317,0.000047602844,0.00050466246,0.00030704378,0.00061342714,0.000013055348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021676168,0.0039574606,0.03121839,0.0017793849,0.00013954453,0.00035309282,0.03877608,0.16593799,0.0098368535,0.13984838,0.0023294238,0.6056066],"study_design_scores_gemma":[0.0005073474,0.00024984698,0.004254769,0.0001663767,0.0000010846958,0.00014589167,0.00040254742,0.95905083,0.00024794025,0.034794975,0.00010712776,0.00007125233],"about_ca_topic_score_codex":0.000013487499,"about_ca_topic_score_gemma":0.000019720412,"teacher_disagreement_score":0.7931129,"about_ca_system_score_codex":0.00017301444,"about_ca_system_score_gemma":0.000067592795,"threshold_uncertainty_score":0.27576366},"labels":[],"label_agreement":null},{"id":"W2947984620","doi":"10.1145/3338637.3338651","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Symbolic computation; Computer science; Computation; Algebra over a field; Quarter (Canadian coin); Library science; Mathematics; Programming language; History; Pure mathematics","score_opus":0.0520830374533527,"score_gpt":0.3190488895562089,"score_spread":0.2669658521028562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947984620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70159674,0.00040305246,0.28741947,0.006615258,0.0013436512,0.001273451,0.0000100412935,0.00032143036,0.0010169185],"genre_scores_gemma":[0.5812742,0.00011273114,0.4181565,0.00029861982,0.000046733097,0.00004331002,0.00003815236,0.000018927623,0.00001084569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958296,0.00059160515,0.0015460391,0.0008969046,0.00050626555,0.00062959635],"domain_scores_gemma":[0.9887322,0.0020057636,0.00042249108,0.008333081,0.00034927562,0.00015717284],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010891943,0.00040487753,0.00068417663,0.00073471083,0.00013075734,0.00021798974,0.009395408,0.00019278428,0.00007905387],"category_scores_gemma":[0.00012348233,0.0004347095,0.00017071342,0.0022638047,0.00022627319,0.0009571507,0.0056392187,0.00077658385,0.00017812323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029696692,0.0041686343,0.15315624,0.00015188639,0.00011683199,0.000027609172,0.00906752,0.038834475,0.00035134534,0.11713028,0.00062185293,0.6763436],"study_design_scores_gemma":[0.0012356037,0.00020844453,0.45039415,0.00014600491,0.000007848733,0.000021973467,0.00004116118,0.5049652,0.00019073075,0.040571015,0.0016566761,0.0005611862],"about_ca_topic_score_codex":0.00044722535,"about_ca_topic_score_gemma":0.00082596584,"teacher_disagreement_score":0.67578244,"about_ca_system_score_codex":0.00027070753,"about_ca_system_score_gemma":0.00024639178,"threshold_uncertainty_score":0.99981046},"labels":[],"label_agreement":null},{"id":"W2949083013","doi":"10.4230/lipics.ccc.2021.37","title":"A Simple Proof of a New Set Disjointness with Applications to Data Streams","year":2021,"lang":"en","type":"preprint","venue":"Dagstuhl Research Online Publication Server","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Computer science; Communication complexity; Business; Mathematics; Theoretical computer science","score_opus":0.27043653885570473,"score_gpt":0.45761454493714143,"score_spread":0.1871780060814367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949083013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019955702,0.00029200147,0.9372671,0.03456855,0.00010806078,0.004977423,0.0021951785,0.0003095919,0.0003263865],"genre_scores_gemma":[0.32607475,0.000086480664,0.61703646,0.00066092866,0.001099834,0.0028597533,0.049902413,0.00015627521,0.002123076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99129564,0.0007276591,0.0010852497,0.003079252,0.002896801,0.0009154237],"domain_scores_gemma":[0.97849387,0.0005980637,0.00045897602,0.013126824,0.0064863698,0.0008359016],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0037422555,0.00047051875,0.00075676356,0.0008909199,0.00021960697,0.0015034658,0.01203764,0.0002969388,0.00016901057],"category_scores_gemma":[0.0016435771,0.00042297994,0.00012474612,0.005205768,0.0002180848,0.0013106914,0.029398682,0.0014602642,0.000033154723],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011955087,0.008301343,0.008998633,0.0023017805,0.0006732335,0.000026935168,0.004324437,0.0066093532,0.00020935763,0.022361113,0.11324546,0.8328288],"study_design_scores_gemma":[0.001775679,0.00076001714,0.06348181,0.0005318829,0.000083122104,0.000046714616,0.001101208,0.5863728,0.0015421979,0.027216345,0.3150425,0.0020457548],"about_ca_topic_score_codex":0.0025717707,"about_ca_topic_score_gemma":0.0033815259,"teacher_disagreement_score":0.83078307,"about_ca_system_score_codex":0.00036342925,"about_ca_system_score_gemma":0.0059520733,"threshold_uncertainty_score":0.9998222},"labels":[],"label_agreement":null},{"id":"W2949163796","doi":"10.48550/arxiv.1603.01573","title":"McCulloch-Pitts brains and pseudorandom functions","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Pseudorandom number generator; Computer science; Artificial intelligence; Neuroscience; Cognitive science; Psychology; Algorithm","score_opus":0.05976492229839559,"score_gpt":0.17790069428663335,"score_spread":0.11813577198823777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949163796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12694615,0.00014391604,0.8657078,0.0006624112,0.0013531464,0.00043690993,0.00003581788,0.0005475357,0.0041662953],"genre_scores_gemma":[0.9940637,0.00014704374,0.002779025,0.00013661763,0.00020799624,0.0000024118738,0.000007802361,0.000022136914,0.0026333039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691385,0.0002563831,0.0002719853,0.0018915243,0.00014707532,0.000519157],"domain_scores_gemma":[0.99685913,0.000400492,0.00023165521,0.001924545,0.00024691707,0.000337285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004059668,0.0004619286,0.0005194411,0.0003454321,0.0003072816,0.00023652225,0.0018489925,0.00036221856,0.000056473622],"category_scores_gemma":[0.00009099603,0.00044813627,0.00027733235,0.0005553324,0.00031028475,0.0004873995,0.0048419875,0.000564688,0.000164612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029988008,0.0013013127,0.044809364,0.0006587082,0.0011229378,0.0020409138,0.0019790786,0.06579792,0.00032775584,0.8082435,0.008714338,0.064704284],"study_design_scores_gemma":[0.003853295,0.00023551889,0.014135845,0.00023537868,0.00019017867,0.00006584733,0.000084717925,0.5146356,0.00008397191,0.45796254,0.006624618,0.001892493],"about_ca_topic_score_codex":0.000093924806,"about_ca_topic_score_gemma":0.000052741234,"teacher_disagreement_score":0.8671175,"about_ca_system_score_codex":0.00025343514,"about_ca_system_score_gemma":0.00025597727,"threshold_uncertainty_score":0.99979705},"labels":[],"label_agreement":null},{"id":"W2951224964","doi":"10.48550/arxiv.1303.6453","title":"Feasible combinatorial matrix theory","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematical proof; Sigma; Matrix (chemical analysis); Mathematics; Combinatorial principles; Order (exchange); Combinatorial proof; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Combinatorial explosion; Physics; Quantum mechanics","score_opus":0.056200710400065516,"score_gpt":0.196142273062249,"score_spread":0.13994156266218347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951224964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.187575,0.00013824094,0.796287,0.00017026605,0.006382335,0.00081770343,0.000014311535,0.00095929875,0.007655866],"genre_scores_gemma":[0.9896468,0.000053285483,0.0067227725,0.000074186784,0.00035181793,0.000003273378,0.000012273262,0.00003188741,0.0031037012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625623,0.0005793468,0.00033821655,0.0019373022,0.00022077128,0.0006681545],"domain_scores_gemma":[0.9956532,0.00044294473,0.0003419137,0.002849217,0.00037154622,0.00034115787],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007681467,0.0005559969,0.00060694566,0.00035728188,0.00024015647,0.0004137981,0.004790907,0.0005459919,0.00020174481],"category_scores_gemma":[0.00010242734,0.0006253471,0.00041920415,0.0008263345,0.00024198159,0.0006081684,0.007692119,0.0010370848,0.00079123897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002234537,0.00023282222,0.0012207513,0.00007189148,0.000083537874,0.00018368704,0.00015694657,0.030826919,0.000010041056,0.96512246,0.00083208963,0.0012365031],"study_design_scores_gemma":[0.0006149552,0.00007261459,0.0010326935,0.000032570835,0.000042523658,0.0000069033795,0.000026037844,0.2839279,0.000054203258,0.71280944,0.0008094429,0.0005707242],"about_ca_topic_score_codex":0.00025011014,"about_ca_topic_score_gemma":0.000008859108,"teacher_disagreement_score":0.8020718,"about_ca_system_score_codex":0.000484753,"about_ca_system_score_gemma":0.00041669072,"threshold_uncertainty_score":0.99998677},"labels":[],"label_agreement":null},{"id":"W2952003957","doi":"10.48550/arxiv.math/0406416","title":"Non-computable Julia sets","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computable analysis; Computability; Julia set; Quadratic equation; Computable number; Mathematics; Point (geometry); Computable function; Computer science; Mathematical economics; Discrete mathematics; Pure mathematics","score_opus":0.04180646973560214,"score_gpt":0.2764456516924444,"score_spread":0.23463918195684225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952003957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47095194,0.000458407,0.51476604,0.0019487693,0.0061658067,0.0009034143,0.000015412157,0.001114869,0.003675355],"genre_scores_gemma":[0.915971,0.000037493966,0.0817399,0.000845562,0.0006693624,0.000088903136,0.000035771045,0.000066842855,0.0005452103],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99455225,0.00014330556,0.0008816073,0.0024831363,0.000812406,0.0011273116],"domain_scores_gemma":[0.9948297,0.00017609795,0.000434232,0.0038016846,0.0003474961,0.00041076003],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078070763,0.0008600103,0.0010042997,0.00029242362,0.00026475798,0.00052340614,0.0050634574,0.00063291437,0.00008448536],"category_scores_gemma":[0.00009261748,0.0008748935,0.00048200527,0.0007108566,0.00017845939,0.0004576385,0.009746598,0.0016353538,0.0017745445],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004064474,0.0030194833,0.5051024,0.0019330331,0.0007566928,0.0015554074,0.0063051167,0.37376595,0.0005781803,0.00636755,0.013902155,0.086673394],"study_design_scores_gemma":[0.0015681587,0.00031453714,0.52707493,0.0005460129,0.00008275097,0.0001469201,0.000023590042,0.36219445,0.0023429196,0.09385687,0.008885515,0.002963344],"about_ca_topic_score_codex":0.0005966977,"about_ca_topic_score_gemma":0.000030194371,"teacher_disagreement_score":0.445019,"about_ca_system_score_codex":0.0006398557,"about_ca_system_score_gemma":0.0009958283,"threshold_uncertainty_score":0.99937016},"labels":[],"label_agreement":null},{"id":"W2952138982","doi":"10.48550/arxiv.1112.2838","title":"Computability of the Radon-Nikodym derivative","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computable analysis; Computable function; Mathematics; Computability; Operator (biology); Function (biology); Space (punctuation); Pure mathematics; Measure (data warehouse); Discrete mathematics; Measurable function; Locally integrable function; Algebra over a field; Integrable system; Computer science; Mathematical analysis","score_opus":0.1031335605199131,"score_gpt":0.1791648260398663,"score_spread":0.0760312655199532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952138982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3789385,0.00004470291,0.61597914,0.00011654784,0.0012179369,0.0006075377,0.000018627474,0.00021625814,0.002860747],"genre_scores_gemma":[0.99104613,0.000019745698,0.008561846,0.00007958616,0.000063437976,0.0000013794273,0.000003478059,0.000018450415,0.00020591926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964004,0.0006592177,0.00048829726,0.0017434603,0.00022526494,0.0004833361],"domain_scores_gemma":[0.99434066,0.0003931196,0.0006922151,0.0038693517,0.0005242523,0.00018037674],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006860873,0.000501231,0.0006951866,0.00018192337,0.00020955264,0.00007172119,0.006371679,0.00037613892,0.0000520376],"category_scores_gemma":[0.00014826345,0.0004374239,0.000624627,0.0011853122,0.00074956514,0.000321568,0.01182747,0.0009779469,0.000030716088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106569554,0.0016733005,0.09573217,0.0006469307,0.000515192,0.00014396722,0.004711602,0.26451162,0.00011047149,0.62403864,0.00044503305,0.007364494],"study_design_scores_gemma":[0.0005431931,0.0000997353,0.08642753,0.0001036924,0.00007561322,0.000007328088,0.00006977241,0.44453853,0.001112805,0.4661788,0.00016471116,0.00067825936],"about_ca_topic_score_codex":0.0005947984,"about_ca_topic_score_gemma":0.000070745045,"teacher_disagreement_score":0.61210763,"about_ca_system_score_codex":0.00036027562,"about_ca_system_score_gemma":0.0005027436,"threshold_uncertainty_score":0.9998078},"labels":[],"label_agreement":null},{"id":"W2953014553","doi":"","title":"A New Approach to Formal Language Theory by Kolmogorov Complexity","year":2001,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Nondeterministic algorithm; Formal language; Chomsky hierarchy; Kolmogorov complexity; Lemma (botany); Computer science; Hierarchy; Context (archaeology); Context-free language; Regular language; Theory; Theoretical computer science; Mathematics; Algorithm; Programming language; Artificial intelligence; Rule-based machine translation; Automaton","score_opus":0.04129446725237853,"score_gpt":0.281186732629208,"score_spread":0.23989226537682948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953014553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001471617,0.00023112792,0.8492343,0.0007945045,0.0007977025,0.0010326518,0.000031226955,0.0010185937,0.14538828],"genre_scores_gemma":[0.030921428,0.00000789601,0.95331895,0.0017764546,0.00052179454,0.000089151916,0.00010114277,0.000042399937,0.013220797],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532473,0.00035911432,0.000617174,0.001917243,0.00077488326,0.0010068512],"domain_scores_gemma":[0.9956192,0.00022890951,0.00018466728,0.0031792703,0.00012832422,0.00065965625],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015422533,0.00065499893,0.00075432606,0.00022182277,0.0001649829,0.0006871197,0.005323499,0.00037692903,0.00047568412],"category_scores_gemma":[0.000103498285,0.00058462715,0.00033131868,0.00056842127,0.000101335194,0.00039376845,0.01211516,0.0009514883,0.00039357226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003769592,0.00091481436,0.00012956483,0.00018146077,0.00012302003,0.00003361849,0.0072449814,0.0026756776,0.00006152463,0.3499556,0.09492681,0.54371524],"study_design_scores_gemma":[0.0012075001,0.000249805,0.0022388506,0.00006994103,0.000051750554,0.00020555854,0.00055153103,0.46386576,0.0006071874,0.5026034,0.025384834,0.0029639092],"about_ca_topic_score_codex":0.0018293444,"about_ca_topic_score_gemma":0.000070632246,"teacher_disagreement_score":0.54075134,"about_ca_system_score_codex":0.0002756076,"about_ca_system_score_gemma":0.0003690111,"threshold_uncertainty_score":0.9996605},"labels":[],"label_agreement":null},{"id":"W2953086575","doi":"10.4230/lipics.tqc.2014.48","title":"Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Foundation Singapore; National Research Foundation; Ministry of Education, India; European Commission; Leverhulme Trust; British Heart Foundation; National Science Foundation","keywords":"Quantum entanglement; Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Bounded function; Discrete mathematics; Integer (computer science); Quantum; Physics; Quantum mechanics; Computer science","score_opus":0.020022688094083026,"score_gpt":0.251291030914784,"score_spread":0.23126834282070097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953086575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08918936,0.00003120377,0.89743495,0.0017362833,0.0019464857,0.0016809306,0.00010045257,0.00037211282,0.0075082313],"genre_scores_gemma":[0.98960257,0.000014145262,0.007369029,0.0021861123,0.000251339,0.00010575351,0.000059555554,0.000042973446,0.0003685069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963364,0.00017656072,0.0011108732,0.00054140796,0.00085115846,0.0009836032],"domain_scores_gemma":[0.99697423,0.0006308343,0.00050731737,0.0013133007,0.00028957118,0.00028475423],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018390564,0.0005527399,0.00053237635,0.00016482487,0.0008453359,0.0010679992,0.0018445619,0.00019779483,0.00004327035],"category_scores_gemma":[0.0001877377,0.00039916908,0.00024295495,0.00039991408,0.00015255329,0.0011277614,0.0013445598,0.0004971243,0.00025786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060276827,0.005146644,0.016278405,0.0026757603,0.0019782586,0.00003843013,0.114618085,0.0042795134,0.0006286675,0.33220288,0.017319895,0.5042307],"study_design_scores_gemma":[0.002681334,0.0004356423,0.004622504,0.00012998926,0.000050332794,0.00020888232,0.0004525025,0.9497788,0.0005195316,0.006182592,0.03420136,0.0007365142],"about_ca_topic_score_codex":0.000020461726,"about_ca_topic_score_gemma":0.000016373451,"teacher_disagreement_score":0.9454993,"about_ca_system_score_codex":0.00019936451,"about_ca_system_score_gemma":0.0000530455,"threshold_uncertainty_score":0.999969},"labels":[],"label_agreement":null},{"id":"W2953924437","doi":"10.4230/lipics.fscd.2019.27","title":"Hilbert’s Tenth Problem in Coq","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Diophantine equation; Recursively enumerable language; Computability; Constructive; Recursively enumerable set; Diophantine set; Mathematics; Proof assistant; Discrete mathematics; Type (biology); Algebra over a field; Computer science; Calculus (dental); Pure mathematics; Programming language; Mathematical proof","score_opus":0.019399495376912178,"score_gpt":0.25821950570910135,"score_spread":0.23882001033218916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953924437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05033607,0.00029774968,0.9099203,0.002122001,0.0077835685,0.010469559,0.0010457804,0.00118905,0.01683594],"genre_scores_gemma":[0.54316103,0.00016155497,0.44941044,0.0023012229,0.0006493226,0.0013780912,0.0014165079,0.00023278237,0.0012890716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923116,0.00016515447,0.0030216025,0.0013426236,0.0013270058,0.0018319974],"domain_scores_gemma":[0.9932819,0.0004554989,0.0013722994,0.0038312427,0.00065620104,0.0004028351],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.0018755175,0.0012849175,0.0016810762,0.00095451495,0.00022994679,0.0014877411,0.0061465483,0.0010916943,0.000043344287],"category_scores_gemma":[0.00018773857,0.0012117065,0.00077869324,0.0007262045,0.00021023436,0.0018579531,0.009012859,0.0024085979,0.00052078656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007513085,0.012514163,0.14868662,0.041640148,0.00259204,0.0002974615,0.12226203,0.18026176,0.00006619046,0.14456594,0.060075447,0.2862869],"study_design_scores_gemma":[0.004434143,0.00048495719,0.0045741107,0.001069998,0.00005871136,0.000109219196,0.00034309225,0.9118727,0.00014212032,0.021157723,0.053408887,0.0023443354],"about_ca_topic_score_codex":0.00017952507,"about_ca_topic_score_gemma":0.0000873277,"teacher_disagreement_score":0.73161095,"about_ca_system_score_codex":0.00095464673,"about_ca_system_score_gemma":0.00068434194,"threshold_uncertainty_score":0.9999903},"labels":[],"label_agreement":null},{"id":"W2955383720","doi":"10.3233/com-190289","title":"Degrees of bi-embeddable categoricity","year":2020,"lang":"en","type":"article","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Successor cardinal; Spectrum (functional analysis); Limit (mathematics); Turing; Set (abstract data type)","score_opus":0.04294599199195734,"score_gpt":0.2437251270631677,"score_spread":0.20077913507121037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955383720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21565455,0.00021569751,0.7797096,0.0018567422,0.00046449326,0.00039687697,0.000008768324,0.00054877804,0.0011445339],"genre_scores_gemma":[0.8728063,0.000003327687,0.12675865,0.00026297432,0.00013658634,0.000008960362,0.000002936981,0.000012494889,0.00000775402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966495,0.0003313634,0.0007654241,0.0011432274,0.00058917864,0.0005212956],"domain_scores_gemma":[0.997012,0.00053688436,0.00023756309,0.0014160231,0.00040915818,0.00038834705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080651534,0.00032581805,0.00067511917,0.0000746599,0.00013008501,0.00010610079,0.0023367365,0.00012584949,0.00008303337],"category_scores_gemma":[0.00048053593,0.00030408942,0.00026145126,0.0013507984,0.00028374727,0.0004695447,0.0017663023,0.0003297486,0.000085919906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017202678,0.0041112727,0.28253394,0.0017498718,0.0002564613,0.000090486596,0.012352575,0.21414182,0.0041910796,0.10870756,0.005953658,0.36573923],"study_design_scores_gemma":[0.000443394,0.00033176714,0.0794947,0.00000771082,0.000010819827,0.000009875005,0.00003053561,0.90141195,0.0024770761,0.013815968,0.001577662,0.00038852086],"about_ca_topic_score_codex":0.00024241621,"about_ca_topic_score_gemma":0.00001754926,"teacher_disagreement_score":0.68727016,"about_ca_system_score_codex":0.000114985814,"about_ca_system_score_gemma":0.0002317351,"threshold_uncertainty_score":0.9999411},"labels":[],"label_agreement":null},{"id":"W2962847591","doi":"10.23638/lmcs-15(3:24)2019","title":"Approximability in the GPAC","year":2020,"lang":"en","type":"article","venue":"mediaTUM  (Technical University of Munich)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computation; Ordinary differential equation; Algebraic number; Computability; Applied mathematics; Computer science; Differential equation; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.020321736183102488,"score_gpt":0.1902378593473329,"score_spread":0.1699161231642304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962847591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23617715,0.00028835563,0.664336,0.07843077,0.0003604332,0.0013488162,0.000019267522,0.0007532097,0.018285962],"genre_scores_gemma":[0.9576766,0.000023658216,0.04168662,0.00055211637,0.000034951318,4.797214e-7,0.0000026692396,0.0000041175813,0.000018800774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812496,0.00038639986,0.00022818356,0.0004986088,0.00047858612,0.00028327783],"domain_scores_gemma":[0.9980036,0.0005972093,0.00009977476,0.0010834415,0.00007339274,0.00014260839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008514237,0.00014166588,0.00030243595,0.000064086205,0.00009012649,0.00002384794,0.004085197,0.00013665471,0.00004152318],"category_scores_gemma":[0.00042873353,0.00012390235,0.00015378495,0.0010205931,0.0003860558,0.00025062167,0.0015803376,0.0005623753,0.000034924084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007098747,0.00949472,0.060906284,0.0009845749,0.00017533824,0.0016738663,0.08925839,0.0030976336,0.006376031,0.47475955,0.047276005,0.30528775],"study_design_scores_gemma":[0.006567709,0.0023651936,0.34523743,0.00009144688,0.00010507341,0.00007694572,0.005547271,0.44495636,0.0008925177,0.06804908,0.12411959,0.0019913742],"about_ca_topic_score_codex":0.00014934971,"about_ca_topic_score_gemma":0.000110076006,"teacher_disagreement_score":0.72149944,"about_ca_system_score_codex":0.00007913064,"about_ca_system_score_gemma":0.00008242568,"threshold_uncertainty_score":0.75913805},"labels":[],"label_agreement":null},{"id":"W2963019784","doi":"10.4171/jncg/11-2-11","title":"Finiteness and paradoxical decompositions in C*-dynamical systems","year":2017,"lang":"en","type":"article","venue":"Journal of Noncommutative Geometry","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dynamical systems theory; Pure mathematics; Algebra over a field","score_opus":0.023675452974493943,"score_gpt":0.31469620783669217,"score_spread":0.29102075486219825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963019784","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59476465,0.0004900389,0.40206164,0.0013831916,0.00067642285,0.00010360221,0.0000055001306,0.000014052981,0.0005008903],"genre_scores_gemma":[0.9563436,0.000034824086,0.04342866,0.00005223951,0.00011891039,0.00000356164,5.848687e-7,0.0000071297463,0.000010478845],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980365,0.0003442068,0.0006701785,0.00024513563,0.00041683373,0.00028712972],"domain_scores_gemma":[0.9970731,0.0011654659,0.00063530524,0.00062625884,0.00029280572,0.00020706785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001436044,0.00017264952,0.0005203461,0.00048811443,0.0003214969,0.00059900037,0.0016236868,0.000099575125,0.0000047439084],"category_scores_gemma":[0.00052163634,0.00014370056,0.00011656292,0.0003283418,0.0002661075,0.0010163581,0.0007536195,0.0006029808,0.0000060455404],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037490635,0.0047535338,0.5942713,0.00040358747,0.0006377639,0.005482157,0.008952642,0.023611322,0.0017389745,0.078340575,0.00061363267,0.28081957],"study_design_scores_gemma":[0.0016543973,0.00060249184,0.7563,0.00019868831,0.000018115006,0.0014343314,0.00034937466,0.22279617,0.00007480177,0.016074425,0.00019409283,0.00030312018],"about_ca_topic_score_codex":0.00004194681,"about_ca_topic_score_gemma":0.000013719134,"teacher_disagreement_score":0.36157897,"about_ca_system_score_codex":0.00015411217,"about_ca_system_score_gemma":0.00011603193,"threshold_uncertainty_score":0.5859939},"labels":[],"label_agreement":null},{"id":"W2963063319","doi":"10.1090/tran/7075","title":"As easy as ℚ: Hilbert’s Tenth Problem for subrings of the rationals and number fields","year":2016,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; City University of New York; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Rational number; Combinatorics; Recursively enumerable language; Prime (order theory); Discrete mathematics; Turing","score_opus":0.01358339598514024,"score_gpt":0.26193135357203673,"score_spread":0.24834795758689648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963063319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083036594,0.0000069366424,0.9032052,0.012542861,0.00004784384,0.0004767623,0.000009756519,0.000033061675,0.00064095063],"genre_scores_gemma":[0.87140596,0.000011152098,0.12729362,0.00033061978,0.000014870482,0.00005222448,7.6328824e-8,0.000008090406,0.00088340434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889964,0.00006781995,0.0003160741,0.0002305976,0.00030809487,0.00017778193],"domain_scores_gemma":[0.9980123,0.0010123202,0.0002230493,0.00057315367,0.00012620364,0.000052974472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032769993,0.000117154974,0.00026141212,0.0000084169205,0.000156197,0.0000229914,0.0007229321,0.000039334158,0.000071789196],"category_scores_gemma":[0.00010107578,0.000056833243,0.00040471734,0.0002906138,0.0007056746,0.0001320035,0.000089163404,0.00009030152,0.0000060636366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010526036,0.003398849,0.0052891583,0.0013561101,0.0011633766,4.347533e-7,0.018450014,0.0011015065,0.016641779,0.745573,0.0034745801,0.20344597],"study_design_scores_gemma":[0.000791708,0.00030080424,0.00644579,0.00017594857,0.00011745082,0.00005905111,0.00033649267,0.0265379,0.016181156,0.94805264,0.00069085835,0.0003101741],"about_ca_topic_score_codex":0.0000870188,"about_ca_topic_score_gemma":0.0000043661216,"teacher_disagreement_score":0.78836936,"about_ca_system_score_codex":0.00003552149,"about_ca_system_score_gemma":0.000080831815,"threshold_uncertainty_score":0.26000872},"labels":[],"label_agreement":null},{"id":"W2964538196","doi":"10.1109/lics.2019.8785762","title":"Algorithmic barriers to representing conditional independence","year":2019,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Conditional independence; Discrete mathematics; Mathematics; Combinatorics; Binary number; Computable function; Independence (probability theory); Computability; Context (archaeology); Adjacency list","score_opus":0.008679741273605168,"score_gpt":0.2452287321063342,"score_spread":0.23654899083272904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964538196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08166779,0.000013517848,0.8998299,0.0018231196,0.0009653652,0.0004913069,0.0000042328415,0.0004315724,0.014773186],"genre_scores_gemma":[0.8212725,4.63854e-7,0.17515774,0.0014770735,0.000113189955,0.000022388658,0.00000311534,0.000009299882,0.0019442501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750787,0.00008544917,0.00030194558,0.00090008584,0.00074614014,0.0004585246],"domain_scores_gemma":[0.9980048,0.00022907872,0.00006538755,0.0010593373,0.00020202454,0.00043938638],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00066346175,0.00017482594,0.00020341248,0.00016098908,0.00013453372,0.0002466457,0.0015143735,0.00008285499,0.0013214595],"category_scores_gemma":[0.0002846154,0.00016711687,0.00009013844,0.0006218939,0.000039624556,0.00065358327,0.0012094687,0.00022632204,0.0017357975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028218095,0.0003281362,0.18322736,0.000097035976,0.00015840468,0.00021590684,0.004139714,0.03161695,0.010453051,0.6042669,0.017699756,0.1477686],"study_design_scores_gemma":[0.0008417791,0.00025644782,0.058778588,0.000026742397,0.000005581276,0.000165343,0.0002729643,0.8544134,0.0058157397,0.06828397,0.010166316,0.0009731152],"about_ca_topic_score_codex":0.000093953146,"about_ca_topic_score_gemma":0.000009153471,"teacher_disagreement_score":0.82279646,"about_ca_system_score_codex":0.000094663505,"about_ca_system_score_gemma":0.0002208235,"threshold_uncertainty_score":0.99959147},"labels":[],"label_agreement":null},{"id":"W2967486788","doi":"10.20368/1971-8829/1399","title":"A Gentle Introduction to Computational Complexity Through an Examination of Noodle Making","year":2019,"lang":"en","type":"article","venue":"Institutional Research Information System (Università degli Studi di Trento)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computational resource; Computational complexity theory; Computer science; Computational problem; CITES; Complexity science; Worst-case complexity; Asymptotic computational complexity; Algorithmic complexity; Computational model; Computational thinking; Algorithm; Theoretical computer science; Artificial intelligence; Management science; Engineering","score_opus":0.12026516981619725,"score_gpt":0.3463692520809213,"score_spread":0.22610408226472403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967486788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26450154,0.000014727725,0.71610683,0.0007760969,0.0007429392,0.0010257195,0.00005486873,0.00017584734,0.016601449],"genre_scores_gemma":[0.9663564,0.0000012714855,0.033224497,0.0000375597,0.00015851682,0.000021907266,0.00013739677,0.0000050336757,0.000057423968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957122,0.00046342445,0.00058608974,0.00048179214,0.0023220293,0.0004344719],"domain_scores_gemma":[0.99640334,0.00019370766,0.00026174865,0.0006295802,0.002356635,0.00015496646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002092543,0.00019440165,0.00030712134,0.0009978833,0.000691747,0.00024411929,0.0010767155,0.00009206638,0.000067823006],"category_scores_gemma":[0.00014794328,0.00020881189,0.00009460621,0.0022369944,0.00024005694,0.0077040307,0.0008656988,0.00025788555,0.0005385881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055831108,0.0001957575,0.0013276241,0.00023942774,0.000057367375,0.000003986404,0.008361028,0.09425261,0.000051308056,0.87790185,0.00036329497,0.017189935],"study_design_scores_gemma":[0.002045218,0.000777723,0.26818728,0.00017413025,0.000014877774,0.00008654869,0.01051449,0.70012563,0.00013718949,0.0023202419,0.015122607,0.0004940693],"about_ca_topic_score_codex":0.00013590268,"about_ca_topic_score_gemma":0.00002799758,"teacher_disagreement_score":0.87558156,"about_ca_system_score_codex":0.0014860415,"about_ca_system_score_gemma":0.00043684294,"threshold_uncertainty_score":0.85151017},"labels":[],"label_agreement":null},{"id":"W2973231219","doi":"10.1080/00150517.2008.12428182","title":"Ramsey Results Involving the Fibonacci Numbers","year":2008,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Simon Fraser University","funders":"","keywords":"Fibonacci number; Pisano period; Mathematics; Combinatorics; Fibonacci polynomials","score_opus":0.02225092679870829,"score_gpt":0.2287426049568108,"score_spread":0.20649167815810252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973231219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58641154,0.0025987402,0.3204629,0.041286748,0.009452256,0.0041566137,0.00007831794,0.0037573893,0.031795494],"genre_scores_gemma":[0.98707515,0.000021706846,0.008830604,0.0016806851,0.0006713145,0.000079209625,0.000010934879,0.000044256725,0.0015861561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495476,0.0006658401,0.0009629561,0.0012346366,0.0011092557,0.0010725731],"domain_scores_gemma":[0.99421465,0.0015424012,0.00037466147,0.0033325735,0.0002806584,0.00025505282],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016991372,0.0005408012,0.00046937005,0.00013264427,0.001398624,0.00053404894,0.0046822177,0.00018822381,0.000037842994],"category_scores_gemma":[0.00008863373,0.00034503036,0.00037026138,0.0012374906,0.00043850622,0.00081412017,0.00053969974,0.0007725866,0.0006287192],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038854842,0.0014313009,0.0070216055,0.0001001554,0.0004676615,0.000867181,0.15475997,0.0017019056,0.001132888,0.051441494,0.15962246,0.62106484],"study_design_scores_gemma":[0.007393597,0.003817515,0.18755129,0.00016011504,0.00012166016,0.0033039288,0.0050274986,0.4340227,0.00040110204,0.12229642,0.23176017,0.004144005],"about_ca_topic_score_codex":0.00096061226,"about_ca_topic_score_gemma":0.000848153,"teacher_disagreement_score":0.6169208,"about_ca_system_score_codex":0.00019815021,"about_ca_system_score_gemma":0.00028831474,"threshold_uncertainty_score":0.9999014},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05101728491683192,"score_gpt":0.32178800681800457,"score_spread":0.27077072190117263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977793662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032683764,0.00006159325,0.95629364,0.0048340387,0.0013497748,0.00062959647,0.0000027936442,0.0005119909,0.0036328274],"genre_scores_gemma":[0.6094938,4.5230234e-7,0.38880637,0.00071217254,0.00049036084,0.0000055726236,0.0000054277107,0.000010511573,0.0004753369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975849,0.00011914572,0.00048663255,0.00079785974,0.00043002542,0.0005814733],"domain_scores_gemma":[0.99682045,0.0014409883,0.0001626701,0.001158855,0.00031221553,0.00010480655],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022240083,0.00020033689,0.00020467099,0.00013259206,0.0014721681,0.0015441626,0.0018537927,0.000055179386,0.000045256736],"category_scores_gemma":[0.00022115023,0.00014476871,0.00016857829,0.00087864604,0.00023265592,0.00054785766,0.0010095646,0.0001696656,0.00010888363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023634727,0.00023591093,0.0010565002,0.000022609302,0.000033411754,0.0000010577373,0.0027541956,0.019076677,0.00022448863,0.3410859,0.014507483,0.6209994],"study_design_scores_gemma":[0.00027444898,0.000031857762,0.0063632745,0.000009348132,0.000005997005,0.000012677179,0.000050193095,0.9295762,0.0001802829,0.009037895,0.054260194,0.00019760788],"about_ca_topic_score_codex":0.000052127445,"about_ca_topic_score_gemma":0.00013540634,"teacher_disagreement_score":0.9104996,"about_ca_system_score_codex":0.00014158068,"about_ca_system_score_gemma":0.00014999897,"threshold_uncertainty_score":0.9998278},"labels":[],"label_agreement":null},{"id":"W2979890978","doi":"10.1017/cbo9780511615566","title":"Lectures in Logic and Set Theory","year":2003,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Absoluteness; Set theory; Computer science; Consistency (knowledge bases); Recursion (computer science); Proof theory; Presentation (obstetrics); Set (abstract data type); Topos theory; Context (archaeology); Computability theory; Class (philosophy); Foundations of mathematics; Calculus (dental); Mathematical logic; Mathematics; Mathematics education; Programming language; Artificial intelligence; Algorithm; Mathematical proof","score_opus":0.02003683342772577,"score_gpt":0.2036835025260376,"score_spread":0.18364666909831182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979890978","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014197099,0.00060991483,0.08047594,0.00003115518,0.00037068714,0.00051337626,0.00004482194,0.00021437321,0.9175978],"genre_scores_gemma":[0.0005518787,0.00005738623,0.0033889553,0.00028758717,0.00006546267,0.000001335035,0.000014122444,0.000023607989,0.99560964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974891,0.0004621483,0.00022506088,0.0010637662,0.00029981794,0.00046012583],"domain_scores_gemma":[0.99811935,0.00039568433,0.0001689722,0.0010272927,0.00010667529,0.00018203697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046458724,0.00045413215,0.00053824094,0.00035096478,0.00014941809,0.00014201496,0.0015273601,0.00043461862,0.0000021397918],"category_scores_gemma":[0.000044360375,0.00049705105,0.00013923598,0.00005337264,0.00035192035,0.00016862266,0.0014502766,0.0007144375,0.0000058067353],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019724857,0.000020932725,0.000010563513,0.00008473177,0.000036962985,0.00050251704,0.00019181648,0.000030575553,0.000004479952,0.9631815,0.031225584,0.0046906336],"study_design_scores_gemma":[0.0013146095,0.0001853898,0.0003608017,0.00014946671,0.000079867204,0.00015759836,0.000037055917,0.0032034428,0.00012009117,0.012144192,0.9809306,0.0013168852],"about_ca_topic_score_codex":0.00005194177,"about_ca_topic_score_gemma":0.0000058203477,"teacher_disagreement_score":0.9510373,"about_ca_system_score_codex":0.00044331644,"about_ca_system_score_gemma":0.00042232953,"threshold_uncertainty_score":0.9997481},"labels":[],"label_agreement":null},{"id":"W2980681923","doi":"10.1002/malq.201700049","title":"Degrees of categoricity of trees and the isomorphism problem","year":2019,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Mathematics; Isomorphism (crystallography); Rank (graph theory); Degree (music); Mathematical proof; Tree (set theory); Limit (mathematics); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.010032088061797992,"score_gpt":0.21377323759178685,"score_spread":0.20374114952998884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980681923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32272056,0.00018813355,0.66806227,0.0016997025,0.00011891226,0.00097176817,0.0000036883482,0.00010080107,0.006134174],"genre_scores_gemma":[0.91716695,0.0000017721527,0.08266411,0.000037394515,0.000014088692,0.000017076789,3.7713846e-7,0.000005438891,0.00009279791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982527,0.00019621143,0.00058767805,0.00034069785,0.0003828999,0.00023981257],"domain_scores_gemma":[0.9976501,0.0011391484,0.00024157239,0.0007872028,0.00011979345,0.00006216756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009716277,0.00017568016,0.00058442156,0.0000588579,0.000039265346,0.000050960858,0.00090444833,0.00007581761,0.0000653222],"category_scores_gemma":[0.00006444382,0.00009776032,0.00012652694,0.00026247342,0.00046038974,0.00015998853,0.0001852941,0.00013330604,0.00004825451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147724695,0.00023351764,0.00041027946,0.00021117354,0.000022730572,0.0000016795159,0.0037088476,0.000042648033,0.00027573988,0.9848937,0.000030176223,0.010154739],"study_design_scores_gemma":[0.00080139266,0.0007464347,0.0043155532,0.00003144817,0.000015518975,0.00003085103,0.00019722381,0.14344397,0.00014366118,0.85012984,0.000013766902,0.00013036189],"about_ca_topic_score_codex":0.000046561272,"about_ca_topic_score_gemma":0.000010179652,"teacher_disagreement_score":0.59444636,"about_ca_system_score_codex":0.000014514546,"about_ca_system_score_gemma":0.00002958255,"threshold_uncertainty_score":0.39865503},"labels":[],"label_agreement":null},{"id":"W2982404703","doi":"10.5539/jmr.v4n6p12","title":"On a Formula of Mellin and Its Application to the Study of the Riemann Zeta-function","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Riemann zeta function; Analogy; Mellin transform; Function (biology); Series (stratigraphy); Mellin inversion theorem; Pure mathematics; Product (mathematics); Riemann hypothesis; Algebra over a field; Mathematical analysis; Geometry; Laplace transform","score_opus":0.11088607779184644,"score_gpt":0.38627037714135126,"score_spread":0.2753842993495048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982404703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79268277,0.00012545487,0.20532252,0.000831224,0.00011334609,0.0007653964,5.2130457e-7,0.000003452278,0.00015531175],"genre_scores_gemma":[0.99399364,0.000007519398,0.005855406,0.000015333551,0.00007523738,0.000012606917,2.4939695e-8,0.0000052973896,0.00003496358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973839,0.00034911564,0.00052643695,0.00010587601,0.001434018,0.00020068372],"domain_scores_gemma":[0.9970154,0.0011810862,0.00035054836,0.0006055397,0.00076154945,0.00008584288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077086412,0.000075331736,0.00021624666,0.0001774839,0.00012278682,0.000040587704,0.0010951271,0.00003342323,0.0000040050454],"category_scores_gemma":[0.00067548105,0.000037261172,0.00006513677,0.0006398187,0.00004271994,0.00017878621,0.000522509,0.00033260335,0.000007344288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034471223,0.026659984,0.0066334945,0.0014759564,0.00063938263,0.0000050542953,0.18182345,0.013155213,0.02083178,0.592885,0.0033291252,0.1522168],"study_design_scores_gemma":[0.0023710015,0.008585862,0.07004339,0.00042224955,0.00013409166,0.00019540737,0.009410448,0.509873,0.021314727,0.37598732,0.001284499,0.0003780153],"about_ca_topic_score_codex":0.00000816841,"about_ca_topic_score_gemma":0.000008483036,"teacher_disagreement_score":0.49671775,"about_ca_system_score_codex":0.000049706203,"about_ca_system_score_gemma":0.000052824715,"threshold_uncertainty_score":0.26716766},"labels":[],"label_agreement":null},{"id":"W2982643981","doi":"10.3233/isu-190060","title":"A brief historical overview of artificial intelligence research","year":2019,"lang":"en","type":"article","venue":"Information Services & Use","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Data science; Management science; Artificial intelligence; Engineering","score_opus":0.14711826324121918,"score_gpt":0.356054147978887,"score_spread":0.20893588473766783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982643981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49488616,0.00037650415,0.49612105,0.0018310308,0.0020190822,0.0011900668,0.000013940241,0.00039300093,0.0031691554],"genre_scores_gemma":[0.95863175,0.00005791737,0.040279213,0.0008183308,0.00008120453,0.000020961284,0.000013935295,0.000007853089,0.00008880585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975848,0.00015065142,0.00075309636,0.00023240499,0.0009600459,0.00031898989],"domain_scores_gemma":[0.99740744,0.0004211133,0.00023359535,0.0009729534,0.0008648683,0.00010004133],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013060998,0.0001257416,0.00022895497,0.00033266225,0.000081157246,0.0003626814,0.001427166,0.0000929048,0.00008577852],"category_scores_gemma":[0.000074255084,0.000118380405,0.000079195415,0.001326107,0.00003558713,0.005074684,0.0008099327,0.0002427019,0.00095316785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005427208,0.00030196545,0.004527433,0.0012360045,0.000027147216,0.0000032328085,0.021773312,0.0033888489,0.00020740746,0.25377285,0.00050609314,0.71420145],"study_design_scores_gemma":[0.00015946323,0.00032247088,0.011095637,0.0001255308,0.0000049765954,0.000015640195,0.00046760164,0.8323149,0.0014381702,0.027255332,0.12644348,0.000356798],"about_ca_topic_score_codex":0.0012721434,"about_ca_topic_score_gemma":0.000069894944,"teacher_disagreement_score":0.828926,"about_ca_system_score_codex":0.00029211366,"about_ca_system_score_gemma":0.00012054043,"threshold_uncertainty_score":0.9998247},"labels":[],"label_agreement":null},{"id":"W2997454689","doi":"10.1002/malq.202000005","title":"Turing invariant sets and the perfect set property","year":2020,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Countable set; Property (philosophy); Invariant (physics); Turing; Mathematics; Discrete mathematics; Equivalence (formal languages); Set (abstract data type); Computer science","score_opus":0.04685334213629911,"score_gpt":0.2649848492308628,"score_spread":0.2181315070945637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997454689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007071777,0.00024436257,0.95229536,0.030846618,0.00053989916,0.0022286407,0.000016560294,0.00072808453,0.006028705],"genre_scores_gemma":[0.8347824,0.000010589222,0.16290326,0.0014683238,0.0002971208,0.00034260968,0.000009972557,0.00004241223,0.00014326474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956474,0.00082367763,0.0008329397,0.0014256708,0.00069413724,0.0005762006],"domain_scores_gemma":[0.9961956,0.0012795193,0.00027503923,0.0018594409,0.0001089691,0.0002814158],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019065232,0.0006185026,0.0011031532,0.00007280444,0.00023189627,0.0011810753,0.0026071656,0.00032031612,0.00007066296],"category_scores_gemma":[0.00043219578,0.00029715823,0.00031360236,0.00022646094,0.0004988342,0.00018158265,0.0028129693,0.0012973072,0.00026124975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077706296,0.00045319216,0.000024274757,0.0032036928,0.00026317564,0.000350967,0.04303723,0.00019918664,0.00006279702,0.87223566,0.0012987204,0.07879342],"study_design_scores_gemma":[0.00043422042,0.00024253137,0.00012907882,0.00009603121,0.000040774026,0.00012725302,0.00009455116,0.39583483,0.000008697896,0.6026006,0.0000756795,0.00031576437],"about_ca_topic_score_codex":0.000041997133,"about_ca_topic_score_gemma":0.000004350308,"teacher_disagreement_score":0.8277107,"about_ca_system_score_codex":0.00008336406,"about_ca_system_score_gemma":0.00014242018,"threshold_uncertainty_score":0.999948},"labels":[],"label_agreement":null},{"id":"W3005846346","doi":"","title":"ZX-Calculi for Quantum Computing and their Completeness","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Axiom; Toffoli gate; Completeness (order theory); Computer science; Mathematics; Quantum; Quantum computer; Quantum mechanics; Quantum gate","score_opus":0.025748480840910228,"score_gpt":0.24828964193712377,"score_spread":0.22254116109621355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005846346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046506327,0.0011405341,0.93838227,0.008393941,0.0009871628,0.0012675814,0.00007868317,0.0005433879,0.0027001193],"genre_scores_gemma":[0.7334253,0.0000969074,0.2653991,0.00019251036,0.000056098444,0.00006271987,0.00018634742,0.000050438935,0.0005305478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99256873,0.0037253702,0.00080788706,0.0018082767,0.00042409438,0.000665645],"domain_scores_gemma":[0.98698115,0.0053904434,0.0006961947,0.0038662634,0.0028097322,0.00025622436],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007492365,0.0006005818,0.0008357097,0.00024194684,0.00055987074,0.0012325955,0.0037825748,0.00036376272,0.000012837849],"category_scores_gemma":[0.0012083087,0.00058060506,0.00035396285,0.00043285324,0.00033282995,0.0002471651,0.007671109,0.00073390757,0.000021610093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017796667,0.0010064384,0.0030860242,0.001203026,0.00021590832,0.0000051985558,0.020796705,0.0023571441,0.0012916119,0.61241317,0.001041524,0.35656545],"study_design_scores_gemma":[0.0006205485,0.0000014079699,0.003995939,0.00078861834,0.000018230858,0.000021218315,0.00008409677,0.9427213,0.0033893741,0.040639564,0.0070597385,0.0006599546],"about_ca_topic_score_codex":0.0004984848,"about_ca_topic_score_gemma":0.0002235152,"teacher_disagreement_score":0.9403642,"about_ca_system_score_codex":0.00015826344,"about_ca_system_score_gemma":0.0003750559,"threshold_uncertainty_score":0.9998042},"labels":[],"label_agreement":null},{"id":"W3013388953","doi":"10.5281/zenodo.10452432","title":"On Double 3-Term Arithmetic Progressions","year":2014,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Arithmetic; Term (time); Arithmetic progression; Scripting language; Sequence (biology); Discrete mathematics; Bounded function; Combinatorics; Computer science; Programming language","score_opus":0.01814347216636455,"score_gpt":0.2672219342129349,"score_spread":0.24907846204657033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013388953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03605168,0.000016197624,0.9165448,0.0020640653,0.00076669466,0.00031113677,3.4019246e-7,0.00076587935,0.043479204],"genre_scores_gemma":[0.84267986,7.983964e-7,0.15548995,0.0005872548,0.00010806256,0.00003399128,0.0000010233983,0.000009154332,0.0010899163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842477,0.00007982781,0.00020892231,0.00056986394,0.00035776888,0.00035885198],"domain_scores_gemma":[0.9983513,0.00025921408,0.000052195282,0.0010940274,0.000075735865,0.0001675529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003961149,0.00016407964,0.00017549381,0.00010581843,0.00015013787,0.00022739323,0.0011226492,0.000061703424,0.00010457804],"category_scores_gemma":[0.00005689807,0.0001208519,0.00007916949,0.0003628269,0.00006215843,0.00020760059,0.0005390003,0.00015968124,0.00046249435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075089956,0.0004526729,0.001531218,0.000013743473,0.000008884543,0.000008691801,0.00019681739,0.0002631245,0.00009035213,0.7093054,0.0016210626,0.2865005],"study_design_scores_gemma":[0.0021049795,0.0009797862,0.030684432,0.00006243927,0.000009990183,0.000058505753,0.000009807468,0.72752935,0.004002507,0.22404784,0.009693095,0.0008172933],"about_ca_topic_score_codex":0.000015181755,"about_ca_topic_score_gemma":0.000008591078,"teacher_disagreement_score":0.80662817,"about_ca_system_score_codex":0.000041620624,"about_ca_system_score_gemma":0.000037126203,"threshold_uncertainty_score":0.59445834},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1447265649232287,"score_gpt":0.4332301295061516,"score_spread":0.2885035645829229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019480792","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000067979854,0.70521677,0.28901967,0.00080997543,0.000330233,0.0012858254,0.00002204355,0.0005300284,0.0027786575],"genre_scores_gemma":[0.00055945676,0.81875944,0.17976964,0.0004573059,0.000078162455,0.0002720124,0.000030150164,0.0000374901,0.000036340592],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9917719,0.0022701377,0.0020294858,0.002549368,0.0005223866,0.0008567496],"domain_scores_gemma":[0.99038815,0.0021061779,0.0015353417,0.0055577937,0.000107195265,0.00030533844],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018716824,0.0008759073,0.0042570806,0.0005779813,0.0001377835,0.00031776718,0.009096335,0.0002417414,0.00007189804],"category_scores_gemma":[0.0010299155,0.00068116916,0.0010997583,0.016231587,0.0016689186,0.00022593355,0.0027151825,0.0017631743,0.00018594085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005931124,0.00030119644,0.00033586356,0.00055058533,0.00024698273,0.0000764288,0.0004249645,0.00005086104,8.68446e-9,0.0007134336,0.00008944422,0.9972043],"study_design_scores_gemma":[0.00012505532,0.0005282211,0.0005428418,0.0011035753,0.00060494035,0.000105757856,0.00019842669,0.00887955,1.08559526e-7,0.0028656852,0.98344445,0.0016013889],"about_ca_topic_score_codex":0.0015308749,"about_ca_topic_score_gemma":0.0012571623,"teacher_disagreement_score":0.9956029,"about_ca_system_score_codex":0.000622176,"about_ca_system_score_gemma":0.00045387383,"threshold_uncertainty_score":0.99956393},"labels":[],"label_agreement":null},{"id":"W3023528124","doi":"","title":"Counting Problems and Clones of Functions.","year":2012,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.025969671819127935,"score_gpt":0.2262455133316956,"score_spread":0.20027584151256766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023528124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16822466,0.0004460261,0.82418036,0.00035292958,0.0004980863,0.00013490589,5.2308167e-7,0.00015377258,0.0060087335],"genre_scores_gemma":[0.9245765,0.000004443455,0.07504826,0.000056285367,0.000070091504,0.0000048535453,3.1257954e-7,0.0000028412758,0.00023641402],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993051,0.00002717641,0.00016379509,0.00016491536,0.00014507932,0.00019389245],"domain_scores_gemma":[0.9994331,0.000107844906,0.00005282321,0.00027101242,0.000075195596,0.000060031205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004476838,0.00006888147,0.000105521955,0.00004760189,0.000056727727,0.000041560488,0.00020341828,0.000028161083,0.000025780037],"category_scores_gemma":[0.0000319857,0.000055488432,0.000023608965,0.00021458147,0.000050181676,0.00048058707,0.0003003671,0.000049262835,0.000016778858],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031699465,0.0005483198,0.52553284,0.00020217976,0.00004095293,8.4523157e-7,0.0036672044,0.00029900917,0.002567515,0.14046763,0.0014678988,0.3252024],"study_design_scores_gemma":[0.00082836335,0.00031395842,0.62925863,0.000043086795,0.000025767815,0.00014588305,0.00029731507,0.309362,0.004129614,0.020556718,0.0342824,0.00075626257],"about_ca_topic_score_codex":0.00008056971,"about_ca_topic_score_gemma":0.000008415425,"teacher_disagreement_score":0.7563518,"about_ca_system_score_codex":0.000011347531,"about_ca_system_score_gemma":0.000012596288,"threshold_uncertainty_score":0.22627525},"labels":[],"label_agreement":null},{"id":"W3024182785","doi":"10.32408/compositionality-2-3","title":"Infinite products and zero-one laws in categorical probability","year":2020,"lang":"en","type":"article","venue":"Compositionality","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Extension (predicate logic); Categorical variable; Markov chain; Probability measure; Imprecise probability; Markov process; Probability theory; Random variable","score_opus":0.06362629055813082,"score_gpt":0.24943510279892642,"score_spread":0.1858088122407956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024182785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61967075,0.00021984254,0.31354055,0.063984,0.00023142657,0.0009529939,0.000020778873,0.0004163761,0.0009633005],"genre_scores_gemma":[0.93030125,0.000003435655,0.06835534,0.0011661787,0.00011545767,0.000031217303,0.00001756233,0.00000590709,0.0000036800802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9975892,0.00033639517,0.00043464295,0.0009325248,0.00040579174,0.0003014618],"domain_scores_gemma":[0.9986782,0.00026874794,0.000079977566,0.0005457081,0.00020498293,0.0002223628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006361532,0.00019038783,0.00031923366,0.00004732973,0.000107188505,0.00013754728,0.00061202183,0.00007613194,0.000014568277],"category_scores_gemma":[0.00025061218,0.00019599052,0.000048095433,0.00078206614,0.00019554597,0.00041304034,0.0008285152,0.0003040462,0.000019363712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021563956,0.004088836,0.23611288,0.0010628117,0.000083022744,0.00013417998,0.005210838,0.0021712866,0.016309388,0.7059395,0.0016090615,0.027062617],"study_design_scores_gemma":[0.00068853475,0.00019205708,0.62431264,0.000013285144,0.000006489645,0.000033724966,0.000004164571,0.05494055,0.00066049705,0.31703603,0.0017218624,0.000390172],"about_ca_topic_score_codex":0.00007906806,"about_ca_topic_score_gemma":0.000013853016,"teacher_disagreement_score":0.3889034,"about_ca_system_score_codex":0.00012169529,"about_ca_system_score_gemma":0.00013187421,"threshold_uncertainty_score":0.7992261},"labels":[],"label_agreement":null},{"id":"W3034161672","doi":"10.1007/978-3-031-43587-4","title":"Fundamentals of Computation Theory","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sorbonne Université; Université Clermont-Auvergne; Korea Advanced Institute of Science and Technology; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Università di Bologna; Uniwersytet Warszawski; Universidad de Chile; Indian Institute of Technology Madras; Technische Universität Wien; University of Haifa; Georg-August-Universität Göttingen; Université de Bordeaux; Montana State University; Augusta University; University of Regina; Centre National de la Recherche Scientifique; Universidade do Porto; Universität Trier; Université Paris Diderot; University of Ottawa; Uniwersytet Wrocławski; Univerzita Karlova v Praze","keywords":"Computer science; Computation; Theoretical computer science; Algorithm","score_opus":0.022186045636357538,"score_gpt":0.2771379641686573,"score_spread":0.2549519185322998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034161672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002920728,0.00030389294,0.9924814,0.00033365688,0.00398893,0.00068693445,0.000014173015,0.00047732436,0.0014215861],"genre_scores_gemma":[0.11562715,0.000040252045,0.88025653,0.0010664174,0.00092718727,0.000037372836,0.000038703474,0.000107708285,0.001898649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940237,0.00027328735,0.0010315174,0.0020584373,0.0017276556,0.00088545046],"domain_scores_gemma":[0.9940931,0.0029055774,0.00061066734,0.0017486393,0.00044558995,0.0001964257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033168066,0.0006346182,0.00093332987,0.0014686674,0.00022001004,0.00044692153,0.00510573,0.00036838706,0.000015261217],"category_scores_gemma":[0.0003198733,0.00060235173,0.00025314133,0.0029327795,0.0013627232,0.0006347941,0.003523143,0.0008110884,0.000101594254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007489436,0.00010946499,0.00010277681,0.00016009071,0.000024009161,0.00007741697,0.0012650483,0.11902012,0.00012660766,0.009374169,0.00017810438,0.8695547],"study_design_scores_gemma":[0.00023597703,0.00021287387,0.00062593736,0.00025124307,0.000007690979,0.000030353636,4.734748e-7,0.48049572,0.0007614936,0.5167873,0.00011284573,0.0004781058],"about_ca_topic_score_codex":0.000021451564,"about_ca_topic_score_gemma":0.000035243047,"teacher_disagreement_score":0.8690766,"about_ca_system_score_codex":0.00082553114,"about_ca_system_score_gemma":0.0016990378,"threshold_uncertainty_score":0.9996428},"labels":[],"label_agreement":null},{"id":"W3036034674","doi":"10.71781/16977","title":"L'information algorithmique en physique : émergence, sophistication et localité quantique","year":2020,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut für Quantenoptik und Quanteninformation","keywords":"Humanities; Philosophy","score_opus":0.047292433263347707,"score_gpt":0.3348285927357834,"score_spread":0.2875361594724357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036034674","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006871737,0.00024309517,0.9535749,0.010637174,0.0032509475,0.0032976728,0.00014921968,0.000042380358,0.021932859],"genre_scores_gemma":[0.22635405,0.0006487899,0.75486004,0.0019525811,0.0010844426,0.00069913955,0.007469052,0.00013526919,0.0067966403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940621,0.001198224,0.0017381883,0.0013699069,0.0009023619,0.0007292146],"domain_scores_gemma":[0.99519086,0.0006082061,0.0011719534,0.0013944715,0.0011719327,0.000462553],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018723808,0.00091152603,0.00101692,0.0002827719,0.0003922181,0.0022083458,0.0043451823,0.00083660975,0.0010916761],"category_scores_gemma":[0.00081919576,0.0010200393,0.0003184961,0.0017076414,0.00015713625,0.004923025,0.0013706874,0.0012412169,0.005399874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006769098,0.0003473937,0.00007403766,0.00028859693,0.00010478516,0.000029835499,0.053261183,0.002339023,0.0004357356,0.05749969,0.0006041124,0.8849479],"study_design_scores_gemma":[0.00069922936,0.00052438374,0.008502344,0.0003899934,0.00013525011,0.000050981227,0.0024832888,0.78105634,0.0074727586,0.009708043,0.18735217,0.0016252263],"about_ca_topic_score_codex":0.0027062218,"about_ca_topic_score_gemma":0.0014894733,"teacher_disagreement_score":0.8833227,"about_ca_system_score_codex":0.0004761135,"about_ca_system_score_gemma":0.0023969326,"threshold_uncertainty_score":0.9998215},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Aesthetics; Algorithm; Art","score_opus":0.06182993158240879,"score_gpt":0.32456484919382306,"score_spread":0.26273491761141426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036937896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67152804,0.04377895,0.16981043,0.09124815,0.019669661,0.0009892067,0.000020504982,0.00004057317,0.0029144778],"genre_scores_gemma":[0.98465043,0.00024508804,0.014684835,0.00023104005,0.00016396471,9.830028e-7,3.2100698e-7,0.0000047606377,0.000018583409],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99858254,0.0001434663,0.00048044624,0.00017552353,0.0003103461,0.0003076727],"domain_scores_gemma":[0.9979819,0.00029750934,0.000521309,0.00056886784,0.0005188027,0.00011159009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016603465,0.0001323398,0.00035310112,0.0002652126,0.0004899724,0.000581766,0.0020898448,0.000033635024,0.0000025193315],"category_scores_gemma":[0.0007109417,0.00009475252,0.000105540705,0.00019500805,0.00039232543,0.001151731,0.00017923556,0.0002637972,0.0000018019144],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000538146,0.000105236526,0.041991387,0.000119981196,0.00024800256,0.002675171,0.14429183,0.0014358176,0.000053618303,0.008322923,0.004970247,0.7957804],"study_design_scores_gemma":[0.001426889,0.0004668566,0.88183016,0.0008128789,0.00004572836,0.0005962205,0.01774836,0.045722384,0.00026033062,0.043777827,0.006799763,0.000512621],"about_ca_topic_score_codex":0.0018895579,"about_ca_topic_score_gemma":0.016434958,"teacher_disagreement_score":0.83983874,"about_ca_system_score_codex":0.00016036649,"about_ca_system_score_gemma":0.00037041845,"threshold_uncertainty_score":0.9171092},"labels":[],"label_agreement":null},{"id":"W3037782033","doi":"10.1090/s0002-9947-08-04614-x","title":"Random gaps","year":2008,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thornhill Medical (Canada)","funders":"Austrian Science Fund","keywords":"Mathematics; Omega; Lebesgue measure; Real line; Measure (data warehouse); Combinatorics; Lebesgue integration; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.01802854604355006,"score_gpt":0.24677469958359377,"score_spread":0.2287461535400437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037782033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05896025,0.000024565528,0.9379962,0.0017652025,0.00009588618,0.00021686814,0.0000034911177,0.00015161185,0.00078594015],"genre_scores_gemma":[0.6802447,0.00003057357,0.31922612,0.0002420775,0.00002053306,0.000018249179,1.13135705e-7,0.000008694162,0.00020892131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857396,0.000113259746,0.0003479007,0.00027348736,0.0004309955,0.0002603833],"domain_scores_gemma":[0.9981474,0.0005399445,0.00017434846,0.00096754165,0.000081291924,0.00008943447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003064761,0.00014904373,0.00039296327,0.00001857257,0.00030296005,0.000019783089,0.0012162697,0.000032836295,0.00007342874],"category_scores_gemma":[0.000044232012,0.0000995984,0.00070020644,0.000827667,0.0010683102,0.00014476533,0.00007600006,0.00022512933,0.000031878295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044243576,0.025392696,0.0059460406,0.0024333904,0.004617525,0.00005059481,0.16075282,0.06427518,0.034638144,0.1891199,0.028798796,0.48353246],"study_design_scores_gemma":[0.0031659857,0.00058884657,0.015293306,0.000098228455,0.00019416926,0.00060646463,0.0010997783,0.7578766,0.014308663,0.20405531,0.0015854341,0.0011272583],"about_ca_topic_score_codex":0.0000443654,"about_ca_topic_score_gemma":0.000001031052,"teacher_disagreement_score":0.69360137,"about_ca_system_score_codex":0.00005524618,"about_ca_system_score_gemma":0.00007501334,"threshold_uncertainty_score":0.4061505},"labels":[],"label_agreement":null},{"id":"W3038043972","doi":"10.4230/lipics.icalp.2020.87","title":"On the Complexity of Zero Gap MIP*","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decidability; Complexity class; Class (philosophy); Connection (principal bundle); Discrete mathematics; Mathematical proof; Computability; PSPACE; Mathematics; Quantum complexity theory; Set (abstract data type); Core (optical fiber); Complement (music); Computer science; Operator (biology); Hierarchy; Computational complexity theory; Quantum; Time complexity; Quantum computer; Algorithm","score_opus":0.09277187158679966,"score_gpt":0.26941137540116816,"score_spread":0.1766395038143685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038043972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087551154,0.000029250492,0.88959926,0.011385616,0.00094939297,0.0018285586,0.00036567406,0.00039320544,0.007897879],"genre_scores_gemma":[0.94508094,0.000005090207,0.04843164,0.0061828755,0.000118579366,0.000057562236,0.000058709495,0.000027667458,0.000036922727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967081,0.000107757456,0.0012574405,0.00040450244,0.00082435797,0.00069787086],"domain_scores_gemma":[0.9968132,0.00061277574,0.0005390194,0.0013875015,0.00036478552,0.00028271443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007680447,0.0004295144,0.0005954069,0.00012006306,0.00032748157,0.00031711572,0.0030637693,0.00015127825,0.00006950998],"category_scores_gemma":[0.00040607725,0.00030856396,0.000389495,0.00063434464,0.0005273228,0.00083142036,0.0012596521,0.00057248265,0.00021058413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016843507,0.00077007886,0.0018867737,0.0008008429,0.00023214461,0.000007254707,0.023091601,0.0012075315,0.00011103204,0.93105346,0.024255065,0.016415754],"study_design_scores_gemma":[0.0028252848,0.0013909208,0.001991518,0.00012389112,0.000036919388,0.00003494911,0.0006524571,0.8401401,0.0032031457,0.11977242,0.028959526,0.000868876],"about_ca_topic_score_codex":0.000019149038,"about_ca_topic_score_gemma":0.000006525486,"teacher_disagreement_score":0.8575298,"about_ca_system_score_codex":0.00009415443,"about_ca_system_score_gemma":0.00010867319,"threshold_uncertainty_score":0.99993664},"labels":[],"label_agreement":null},{"id":"W3041167053","doi":"10.5539/jmr.v12n4p1","title":"A Proof “P≠NP” for P vs. NP Problem by Multiple-Tape Turing-Machine","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Turing machine; Mathematics; NP; Universal Turing machine; Time complexity; P versus NP problem; Complexity class; PSPACE; Time hierarchy theorem; Computational complexity theory; Homogeneous; Discrete mathematics; Structural complexity theory; Combinatorics; Running time; Algorithm; Computation","score_opus":0.11805717881795165,"score_gpt":0.36727926552027235,"score_spread":0.2492220867023207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041167053","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011400811,0.00058355596,0.9634558,0.022713142,0.00014838164,0.0012658034,0.000019999894,0.000062539155,0.00034997705],"genre_scores_gemma":[0.20051101,0.00004309458,0.79849315,0.00027914045,0.0003785743,0.000049849612,0.0000016828737,0.000041708015,0.00020182063],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957477,0.0002688021,0.0010187412,0.00039696065,0.001900605,0.00066719274],"domain_scores_gemma":[0.994386,0.0027706698,0.00044188256,0.00057157135,0.0013587611,0.00047108496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00535361,0.00021807734,0.0005660518,0.00025601478,0.00021314074,0.00043256363,0.0027467804,0.000101840604,0.00002827842],"category_scores_gemma":[0.0036927636,0.00016534375,0.0002418069,0.00074304,0.00012408459,0.00047668116,0.0010134972,0.0009613266,0.00002643547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011636806,0.017021446,0.0052500237,0.01780767,0.0014092784,0.000788849,0.058902282,0.008438139,0.060383245,0.040024612,0.53432906,0.25448173],"study_design_scores_gemma":[0.001981583,0.002260522,0.00006555435,0.0001746477,0.000015368618,0.0002836934,0.00011632188,0.9003847,0.00894739,0.07033466,0.015128961,0.000306558],"about_ca_topic_score_codex":0.0000078822,"about_ca_topic_score_gemma":0.0000043756336,"teacher_disagreement_score":0.8919466,"about_ca_system_score_codex":0.00015094783,"about_ca_system_score_gemma":0.0003075066,"threshold_uncertainty_score":0.6742523},"labels":[],"label_agreement":null},{"id":"W3041346854","doi":"","title":"NON-COMPACTNESS OF INFORMATION STRUCTURES","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Compact space; Mathematics; Type (biology); Bounded function; Space (punctuation); Zero (linguistics); Pure mathematics; Function space; Universe; Function (biology); Topology (electrical circuits); Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Physics","score_opus":0.011891867118435985,"score_gpt":0.23197655341540574,"score_spread":0.22008468629696976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041346854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06549676,0.00017473487,0.9096736,0.0024421879,0.00078755734,0.00055546133,0.000044313336,0.00031344919,0.020511977],"genre_scores_gemma":[0.69737124,0.000052588006,0.3019852,0.00007538298,0.000038507973,0.000030002106,0.00017001155,0.000018005365,0.00025905026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949199,0.0022031327,0.00093626016,0.00075477595,0.00077348785,0.00041246458],"domain_scores_gemma":[0.9893354,0.00094211265,0.001084349,0.004159439,0.004281358,0.00019734015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048462474,0.00041571303,0.0005692729,0.00038906586,0.0002458129,0.00072224106,0.004548989,0.0003523022,0.00008337108],"category_scores_gemma":[0.0010512713,0.0004212941,0.00026809753,0.0006750322,0.0003965646,0.000729501,0.005053445,0.0006078113,0.00004804593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030317153,0.0012075056,0.0058144736,0.0015589292,0.00029549457,0.000005905997,0.06409371,0.002529447,0.001327133,0.45247546,0.0052350247,0.4654266],"study_design_scores_gemma":[0.0010788505,0.0000028325603,0.059609916,0.0018538242,0.000055869285,0.000029328412,0.00012365315,0.64996433,0.107258536,0.17064422,0.008042988,0.001335622],"about_ca_topic_score_codex":0.001042371,"about_ca_topic_score_gemma":0.00022516272,"teacher_disagreement_score":0.6474349,"about_ca_system_score_codex":0.00015352934,"about_ca_system_score_gemma":0.00052241376,"threshold_uncertainty_score":0.99982387},"labels":[],"label_agreement":null},{"id":"W3045911609","doi":"10.1090/dol/034/06","title":"Visible Structures in Number Theory","year":2009,"lang":"en","type":"other","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Geometry; Computer science","score_opus":0.008694311851830012,"score_gpt":0.25653951902007915,"score_spread":0.24784520716824915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045911609","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032296527,0.00019161863,0.19435571,0.00012007166,0.0004687248,0.00023184367,0.000009937842,0.0006660215,0.8039528],"genre_scores_gemma":[0.00036859326,0.000019445617,0.25348794,0.00080282136,0.00036109413,0.000012118052,0.000012379887,0.00013434385,0.7448013],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980727,0.00017486914,0.00025015394,0.0007799119,0.00033071236,0.00039167952],"domain_scores_gemma":[0.9983996,0.00016619408,0.00010456534,0.0012219137,0.000022969914,0.00008473321],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002814567,0.0003343837,0.00039224076,0.00027161697,0.000022148797,0.00015030536,0.0016875768,0.00030831803,0.030089311],"category_scores_gemma":[0.000043680746,0.0002711323,0.00009996479,0.00049039436,0.000057373898,0.00009864258,0.00046631612,0.00030634293,0.0006746054],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001274354,0.0000589495,0.00009072047,0.000016079099,0.00001147272,0.00003217053,0.00006931518,0.000019038971,7.467179e-7,0.24472524,0.6002657,0.1547093],"study_design_scores_gemma":[0.00021887643,0.00003184685,0.0019391375,0.000044724584,0.0000030344283,0.000024247756,0.000005972223,0.0021155474,0.000014021035,0.46358347,0.5315278,0.00049133465],"about_ca_topic_score_codex":0.00024438777,"about_ca_topic_score_gemma":0.00037629905,"teacher_disagreement_score":0.21885821,"about_ca_system_score_codex":0.00006976243,"about_ca_system_score_gemma":0.00009667981,"threshold_uncertainty_score":0.9999741},"labels":[],"label_agreement":null},{"id":"W3075990811","doi":"10.13001/ela.2020.4929","title":"Relations between classes of potentially stable sign patterns","year":2020,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; St. Olaf College","keywords":"Sign (mathematics); Mathematics; Combinatorics; Order (exchange); Graph; Tree (set theory); Mathematical analysis","score_opus":0.019165488024013043,"score_gpt":0.2461088728421662,"score_spread":0.22694338481815315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3075990811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17251588,0.0006520406,0.82231164,0.0041272524,0.00013213299,0.00010529488,0.0000053668323,0.00004291653,0.000107503576],"genre_scores_gemma":[0.9690533,0.000052326734,0.030150123,0.00016051998,0.00052661996,7.9217745e-7,0.0000022678773,0.00001578182,0.000038267506],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975124,0.00021182958,0.0008761224,0.00026903258,0.0006033572,0.00052723585],"domain_scores_gemma":[0.9981108,0.00031766878,0.00063523324,0.00032160155,0.00041375667,0.0002009876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008344372,0.00017387708,0.00045285258,0.00013828443,0.00008847653,0.0000680466,0.0012712365,0.00008414794,0.0000791233],"category_scores_gemma":[0.00022694614,0.0001567053,0.00024655214,0.00060580485,0.000044248613,0.0005844176,0.00025214735,0.0007345124,0.000023012608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035026766,0.0023082732,0.33598828,0.00055537635,0.003710605,0.000376681,0.0112317195,0.04138415,0.027394239,0.27095646,0.0064307773,0.29931316],"study_design_scores_gemma":[0.010904776,0.025186732,0.24915239,0.00050949573,0.0010552591,0.0008142991,0.00072848273,0.2547109,0.09846841,0.31542647,0.03968075,0.003362028],"about_ca_topic_score_codex":0.000015193907,"about_ca_topic_score_gemma":0.0000075994685,"teacher_disagreement_score":0.7965374,"about_ca_system_score_codex":0.00013783379,"about_ca_system_score_gemma":0.0010122079,"threshold_uncertainty_score":0.6390257},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.04380876233099833,"score_gpt":0.26081456624981286,"score_spread":0.21700580391881452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085332162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44942558,0.0010138783,0.371239,0.17415003,0.001887353,0.0003324081,0.000017177805,0.00030098986,0.0016335737],"genre_scores_gemma":[0.951152,0.00003614496,0.046315383,0.0015248646,0.000869702,3.9798036e-7,5.9685624e-7,0.0000075762946,0.00009329316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981041,0.00006293324,0.0006687034,0.00024571095,0.00061499875,0.00030357853],"domain_scores_gemma":[0.99815303,0.00017415127,0.000439406,0.00025864362,0.0005841444,0.00039063033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028361834,0.00019647538,0.00040226092,0.000076080665,0.00009416886,0.00038505706,0.0013581582,0.00006208047,0.000016812968],"category_scores_gemma":[0.00049863954,0.00013284321,0.0002944052,0.00064755575,0.000053315925,0.0005963298,0.00035431734,0.0004568165,0.000013149454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022742995,0.0028644807,0.09566623,0.00093912863,0.0022192218,0.00859012,0.092291415,0.12510456,0.046734788,0.024309684,0.12296578,0.47808716],"study_design_scores_gemma":[0.0017234907,0.0018553428,0.022707159,0.00015190008,0.00018014234,0.0014919662,0.0014150325,0.9344832,0.0035354171,0.0106726205,0.02080879,0.00097494555],"about_ca_topic_score_codex":0.000010345333,"about_ca_topic_score_gemma":0.0000084713165,"teacher_disagreement_score":0.8093786,"about_ca_system_score_codex":0.00012591909,"about_ca_system_score_gemma":0.0001116695,"threshold_uncertainty_score":0.5417189},"labels":[],"label_agreement":null},{"id":"W3085512952","doi":"10.1007/978-3-030-59234-9_7","title":"Computable Measure Theory and Algorithmic Randomness","year":2021,"lang":"en","type":"book-chapter","venue":"Theory and applications of computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Randomness; Computable analysis; Measure (data warehouse); Computable number; Computable function; Randomness tests; Computer science; Mathematical economics; Theoretical computer science; Mathematics; Calculus (dental); Discrete mathematics; Algorithm; Statistics; Data mining","score_opus":0.011452946808824045,"score_gpt":0.23502867556620738,"score_spread":0.22357572875738332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085512952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006977258,0.008121063,0.95832604,0.00018009038,0.00018658435,0.0017322062,0.00008661173,0.00030468873,0.030365013],"genre_scores_gemma":[0.7381927,0.0018239769,0.20816635,0.0009737643,0.0020582895,0.0009920266,0.0003306836,0.0004048192,0.047057424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953163,0.00097049866,0.00104075,0.0016976484,0.0005509529,0.0004237944],"domain_scores_gemma":[0.9915675,0.0046141734,0.0005295208,0.0023659642,0.00063285494,0.00029001618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0063369195,0.00070344243,0.0014111932,0.00021499213,0.00039634717,0.00020399342,0.0014047323,0.00044773627,0.00011232588],"category_scores_gemma":[0.00015080802,0.00068575406,0.00029315375,0.00025901478,0.0014068513,0.00023623747,0.0018571686,0.0007020507,0.00001375007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007362612,0.00013494695,0.000015413934,0.0002451012,0.000095708005,0.0000025659376,0.000180061,0.000121188685,0.000018432302,0.75592196,0.000019263567,0.24317172],"study_design_scores_gemma":[0.00097415684,0.000085547894,0.00020370625,0.00012986183,0.00012088124,0.000097844626,0.000039056024,0.005255447,0.00013333438,0.97988343,0.012413836,0.00066290295],"about_ca_topic_score_codex":0.000008749968,"about_ca_topic_score_gemma":0.0000034471977,"teacher_disagreement_score":0.7501597,"about_ca_system_score_codex":0.00008572279,"about_ca_system_score_gemma":0.00028051835,"threshold_uncertainty_score":0.99955934},"labels":[],"label_agreement":null},{"id":"W3089160879","doi":"","title":"A Generic Explainability Framework for Function Circuits.","year":2020,"lang":"en","type":"article","venue":"Constellation (Université du Québec à Chicoutimi)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Granularity; Lineage (genetic); Computer science; Theoretical computer science; Function (biology); Computation; Graph; Electronic circuit; Algorithm; Programming language; Engineering","score_opus":0.025567496863060462,"score_gpt":0.2034145125197928,"score_spread":0.17784701565673236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089160879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023616951,0.00019307909,0.9584416,0.011761375,0.0005160767,0.00068820524,0.000008422614,0.00059734273,0.004176938],"genre_scores_gemma":[0.9667761,0.000007987432,0.0313813,0.0014963094,0.0002716323,0.0000059581866,0.000010829912,0.000016780064,0.000033150365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804515,0.00012543231,0.00030708004,0.00087045995,0.00030733796,0.0003445234],"domain_scores_gemma":[0.99787116,0.0007008074,0.00020752245,0.0006405193,0.00029736033,0.00028263382],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028283196,0.00025659415,0.00032382645,0.000115982635,0.0004660858,0.00014176202,0.000800759,0.00017513418,0.001528466],"category_scores_gemma":[0.00027158993,0.0002918007,0.0002257367,0.00083483924,0.00016588239,0.0006112053,0.0003741299,0.00022597976,0.000044369644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020849323,0.00039342468,0.031143723,0.0003325592,0.0002448843,0.000029608673,0.02042491,0.023050623,0.0006110568,0.2196877,0.018163366,0.68570966],"study_design_scores_gemma":[0.0012772115,0.00049812737,0.03313627,0.000021265443,0.00008648004,0.000022389755,0.00076114264,0.9123614,0.00017521186,0.020168241,0.03076072,0.00073157216],"about_ca_topic_score_codex":0.00017379069,"about_ca_topic_score_gemma":0.00009150123,"teacher_disagreement_score":0.9431591,"about_ca_system_score_codex":0.00035553297,"about_ca_system_score_gemma":0.00058205274,"threshold_uncertainty_score":0.9999534},"labels":[],"label_agreement":null},{"id":"W309014358","doi":"","title":"Presentation of Plouffe's Inverter, L'Inverseur de Plouffe","year":2014,"lang":"fr","type":"preprint","venue":"viXra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Presentation (obstetrics); Computer science; Humanities; Philosophy; Medicine","score_opus":0.044509191916813774,"score_gpt":0.2814343508289976,"score_spread":0.23692515891218383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W309014358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18959771,0.0005286891,0.79448044,0.0033782327,0.0066043446,0.0012033177,0.000045253542,0.00036140584,0.0038005924],"genre_scores_gemma":[0.8666298,0.00018412805,0.12807208,0.0009950836,0.0013696067,0.00012531914,0.000056819583,0.000093916264,0.0024732922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99347764,0.0013192991,0.0012837172,0.0017783423,0.001129135,0.0010118345],"domain_scores_gemma":[0.99436283,0.00084249745,0.00093729614,0.0027396362,0.0006463665,0.0004713613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016834703,0.000771456,0.0011384203,0.00034127524,0.00016863205,0.000358723,0.0032770822,0.0007317689,0.0002599785],"category_scores_gemma":[0.0005256737,0.00084727054,0.000578043,0.0006803017,0.0005757874,0.0005062976,0.004199333,0.0010822908,0.00051401684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021554188,0.0041085514,0.06433332,0.006154082,0.001003201,0.00025244203,0.039416347,0.09764948,0.007879627,0.24302386,0.025976112,0.5099874],"study_design_scores_gemma":[0.00088173314,0.00036673184,0.041452527,0.00032705508,0.000107802276,0.00005952221,0.00006795126,0.8670054,0.0032470713,0.07189586,0.013809829,0.00077852013],"about_ca_topic_score_codex":0.0029088026,"about_ca_topic_score_gemma":0.00013080698,"teacher_disagreement_score":0.7693559,"about_ca_system_score_codex":0.0004894474,"about_ca_system_score_gemma":0.00079994986,"threshold_uncertainty_score":0.9993978},"labels":[],"label_agreement":null},{"id":"W3090935379","doi":"10.4230/lipics.fun.2021.10","title":"Computational Fun with Sturdy and Flimsy Numbers","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Base (topology); Mathematics; Natural number; Computer science; Theoretical computer science; Arithmetic; Discrete mathematics; Algorithm","score_opus":0.015259475496861529,"score_gpt":0.2268073120333851,"score_spread":0.2115478365365236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090935379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11246521,0.000046842582,0.8799068,0.0031209872,0.00039840935,0.0011883226,0.00017694318,0.00047974987,0.0022167475],"genre_scores_gemma":[0.7136827,0.000007689769,0.2817438,0.0040947706,0.00017248734,0.00006231632,0.00015618665,0.0000363243,0.000043695873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971152,0.00005124553,0.00087323267,0.00052365864,0.00074289745,0.00069375127],"domain_scores_gemma":[0.99795055,0.00028783438,0.00033480563,0.00058488385,0.00036542604,0.00047647406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038389038,0.00045862916,0.00051678956,0.0001360071,0.00035992602,0.0007148219,0.0012018721,0.00014488293,0.000023041812],"category_scores_gemma":[0.000079059784,0.00038696133,0.00014303497,0.00053892384,0.00022826172,0.001786483,0.0008611431,0.00041637907,0.00009491999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013875135,0.0028028432,0.14681596,0.0055578044,0.0021989367,0.0002024586,0.21979588,0.080947325,0.000082817896,0.20935895,0.03394216,0.29690737],"study_design_scores_gemma":[0.0040499344,0.0009471966,0.00556109,0.00006300425,0.00003644252,0.00018048052,0.0010662545,0.95729095,0.00007945239,0.0034585022,0.02644883,0.0008178853],"about_ca_topic_score_codex":0.000014016607,"about_ca_topic_score_gemma":0.0000102431695,"teacher_disagreement_score":0.8763436,"about_ca_system_score_codex":0.00009481129,"about_ca_system_score_gemma":0.0001390446,"threshold_uncertainty_score":0.9998582},"labels":[],"label_agreement":null},{"id":"W3094312433","doi":"10.1007/s11023-020-09544-5","title":"Imitation Game: Threshold or Watershed?","year":2020,"lang":"en","type":"article","venue":"Minds and Machines","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Turing; Imitation; Computer science; Philosophy of science; Cognitive science; Epistemology; Inference; Meaning (existential); Description number; Artificial intelligence; Turing machine; Psychology; Philosophy; Social psychology","score_opus":0.03603852173832135,"score_gpt":0.25566178119849514,"score_spread":0.2196232594601738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094312433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5394981,0.00034699152,0.4343969,0.023554374,0.00040775572,0.0002609875,0.0000046477776,0.00029640822,0.0012338811],"genre_scores_gemma":[0.97255397,0.000009721612,0.025803195,0.0012910656,0.00016464599,0.000007877962,0.000003992595,0.000006399486,0.000159128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991566,0.000025814514,0.00014732245,0.00036195022,0.00014139063,0.00016691242],"domain_scores_gemma":[0.9995572,0.00005581381,0.00003353181,0.00020118315,0.000036471498,0.00011579132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110320536,0.00012194416,0.00014126972,0.000033310982,0.000065505934,0.00016715466,0.00034064933,0.000036713613,0.00003586087],"category_scores_gemma":[0.000043033597,0.000081725404,0.0000357081,0.00020012482,0.000037617003,0.00023797226,0.00031010012,0.00008002782,0.000018811132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053012147,0.0001043725,0.01141081,0.000104697865,0.000027560522,0.00007315074,0.011227337,0.00031604787,0.0018889029,0.007575274,0.0027054807,0.96451336],"study_design_scores_gemma":[0.000608737,0.0003866953,0.023291975,0.0000066574166,0.00001011999,0.00003373189,0.000054888493,0.95592463,0.00089848484,0.009582653,0.008896325,0.0003051096],"about_ca_topic_score_codex":0.000026611136,"about_ca_topic_score_gemma":0.00001700421,"teacher_disagreement_score":0.96420825,"about_ca_system_score_codex":0.000007635742,"about_ca_system_score_gemma":0.000018164828,"threshold_uncertainty_score":0.33326653},"labels":[],"label_agreement":null},{"id":"W3100307655","doi":"10.1145/1507244.1507252","title":"Differential recursion","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Japan Society for the Promotion of Science","keywords":"Recursion (computer science); Mathematics; Algebra over a field; Computable function; μ operator; Primitive recursive function; Computation; Class (philosophy); Differential (mechanical device); Computability theory; Algebraic number; Discrete mathematics; Computer science; Pure mathematics; Algorithm; Recursive functions","score_opus":0.026435018129861626,"score_gpt":0.27410203973081015,"score_spread":0.24766702160094853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100307655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072647533,0.000025053616,0.98042345,0.0099082505,0.00079668727,0.00024773355,0.000010316319,0.0005559616,0.00076779263],"genre_scores_gemma":[0.73124325,0.0000054705774,0.26735115,0.0011869534,0.00007224116,0.000010344133,0.000012465821,0.000006537388,0.000111546105],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978604,0.00013661772,0.00036271624,0.0006896297,0.0006015893,0.00034905397],"domain_scores_gemma":[0.9982856,0.00049367995,0.00008916634,0.00079622056,0.00018225543,0.00015308197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014522002,0.0002578636,0.00023437873,0.00025313886,0.00038685373,0.00017761538,0.001309804,0.00010973376,0.00023190484],"category_scores_gemma":[0.000041929412,0.0002390206,0.00019613258,0.00063132145,0.00006124974,0.0003799396,0.000029218038,0.00032566435,0.00023136626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003719414,0.0011804872,0.00001678366,0.0000074774266,0.000028796398,0.000022162903,0.00021497613,0.27180853,0.00017312006,0.07405082,0.00027858143,0.652181],"study_design_scores_gemma":[0.0006122263,0.0007167921,0.01356224,0.000014440333,0.00001099173,0.000062473024,0.000008119046,0.3034643,0.0003517563,0.68024445,0.0006079411,0.00034430227],"about_ca_topic_score_codex":0.0000059901486,"about_ca_topic_score_gemma":0.0000019484974,"teacher_disagreement_score":0.7239785,"about_ca_system_score_codex":0.00012949323,"about_ca_system_score_gemma":0.00008061732,"threshold_uncertainty_score":0.97469777},"labels":[],"label_agreement":null},{"id":"W3100943385","doi":"","title":"Perfect Strategies for Non-Local Games","year":2020,"lang":"en","type":"article","venue":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Queen's University; Comunidad de Madrid; Instituto de Ciencias Matemáticas; Queen's University Belfast; John Templeton Foundation","keywords":"Mathematical economics; Computer science; Mathematics","score_opus":0.01915739564337884,"score_gpt":0.21649759846539707,"score_spread":0.19734020282201822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100943385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030858405,0.00016085009,0.9522459,0.004037432,0.00016242807,0.0013395451,0.00010287881,0.0006664479,0.010426114],"genre_scores_gemma":[0.8475587,0.00013953519,0.15160152,0.00018012256,0.000063661864,7.305578e-7,0.000014628665,0.000034293036,0.00040683444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950174,0.00031770742,0.00070716377,0.0018102526,0.0011258704,0.0010215981],"domain_scores_gemma":[0.99478483,0.0013576566,0.0006384784,0.0016533639,0.0007711766,0.000794487],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009302911,0.00069150224,0.0015399683,0.00043185765,0.00051823416,0.000086833796,0.0060183755,0.0008850628,0.0004980778],"category_scores_gemma":[0.0003237223,0.0008566616,0.0011754567,0.0018883005,0.0021923296,0.0012626206,0.0036921191,0.001094815,0.00014021866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012971107,0.012198536,0.0075263907,0.005503549,0.0026640974,0.0045299837,0.008823998,0.010057025,0.14674859,0.3587329,0.18953933,0.24070448],"study_design_scores_gemma":[0.04026361,0.027516734,0.10387058,0.0020257882,0.0029742997,0.00090778316,0.02530884,0.48158857,0.014291023,0.060586724,0.22722782,0.013438231],"about_ca_topic_score_codex":0.00035891822,"about_ca_topic_score_gemma":0.00038110398,"teacher_disagreement_score":0.8167003,"about_ca_system_score_codex":0.0004812993,"about_ca_system_score_gemma":0.0007976607,"threshold_uncertainty_score":0.9993884},"labels":[],"label_agreement":null},{"id":"W3101354164","doi":"","title":"Free Lunch for Optimisation under the Universal Distribution","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Histogram; Upper and lower bounds; Class (philosophy); Function (biology); Computer science; State (computer science); Mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Image (mathematics)","score_opus":0.02967943515760142,"score_gpt":0.259868878964393,"score_spread":0.23018944380679157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101354164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068542536,0.000040656156,0.97412527,0.019845871,0.0018940455,0.0009677197,0.00018901842,0.00037560845,0.0018763718],"genre_scores_gemma":[0.6738971,0.000035703055,0.3190062,0.00083070167,0.0015897213,0.0003417047,0.00044936067,0.000049035483,0.0038004685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980693,0.00013271808,0.00028654037,0.0008117915,0.00036795466,0.00033171385],"domain_scores_gemma":[0.99666315,0.00061632734,0.00018228385,0.0021173235,0.00034519762,0.000075708755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007038661,0.0002623804,0.00022302581,0.000046559628,0.00020765064,0.00031500333,0.0029603897,0.00024811368,0.000037462672],"category_scores_gemma":[0.00011684852,0.00015918132,0.00021874318,0.00014135685,0.000115433824,0.00023017387,0.003948664,0.00025679977,0.000015783144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012388874,0.00009418034,0.000049568036,0.00004794502,0.00006749968,0.0000011665761,0.00020692321,0.009772501,0.000027212589,0.92466134,0.021089952,0.043969348],"study_design_scores_gemma":[0.0004129612,0.000052829284,0.0016195478,0.00002207149,0.000019706515,0.00000368803,0.000033515746,0.38457054,0.00022143075,0.6068205,0.005928536,0.00029465972],"about_ca_topic_score_codex":0.00008536612,"about_ca_topic_score_gemma":0.000032680495,"teacher_disagreement_score":0.6732117,"about_ca_system_score_codex":0.00052762695,"about_ca_system_score_gemma":0.00030461574,"threshold_uncertainty_score":0.6491226},"labels":[],"label_agreement":null},{"id":"W3107922395","doi":"10.1007/978-3-030-62757-7_7","title":"Mathematics in Reality","year":2020,"lang":"en","type":"book-chapter","venue":"Studies in applied philosophy, epistemology and rational ethics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics education; Computer science; Mathematics","score_opus":0.19755030904762924,"score_gpt":0.3601609591563455,"score_spread":0.16261065010871625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107922395","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020449692,0.003933598,0.030855365,0.08005638,0.0013636572,0.0013833328,0.000055894394,0.00019181902,0.8821395],"genre_scores_gemma":[0.57687235,0.012188002,0.3632567,0.024345113,0.004757812,0.00082410104,0.00034262988,0.00029594722,0.017117394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970231,0.00015270205,0.0009850555,0.0010486575,0.0005143731,0.0002761162],"domain_scores_gemma":[0.99562854,0.0031943845,0.00033126888,0.00057914614,0.00018551115,0.00008118222],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017832794,0.0004777601,0.0010302166,0.00021475692,0.00022084962,0.000031250413,0.0006889527,0.0009848656,0.000008771028],"category_scores_gemma":[0.00040219756,0.00046096666,0.000090192436,0.00014836543,0.0014795103,0.00006544002,0.0013583478,0.002490835,0.000035151992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016139104,0.000050516963,0.000018034169,0.00064925326,0.00007891876,0.00008625471,0.0028888336,0.00013033817,0.0000016770432,0.99539846,0.00011901872,0.00056254043],"study_design_scores_gemma":[0.00037572434,0.00007232332,0.00012152208,0.00015680178,0.000014489845,0.00004201129,0.000038220467,0.002156275,0.0000022346965,0.99447244,0.0021551966,0.0003927459],"about_ca_topic_score_codex":0.000006736716,"about_ca_topic_score_gemma":0.0001305946,"teacher_disagreement_score":0.8650221,"about_ca_system_score_codex":0.00023120892,"about_ca_system_score_gemma":0.00032334006,"threshold_uncertainty_score":0.99981046},"labels":[],"label_agreement":null},{"id":"W3111848378","doi":"","title":"L’intelligence artificielle au Québec : un réseau tricoté serré","year":2020,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Political science","score_opus":0.030192172844036448,"score_gpt":0.23364741109366355,"score_spread":0.2034552382496271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111848378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01031796,0.0044345153,0.7098169,0.2446774,0.0008354037,0.0005003346,0.00002933018,0.0004581705,0.028929994],"genre_scores_gemma":[0.834889,0.0004553174,0.14215754,0.0015127388,0.00020496456,0.0000465948,0.000044738834,0.00007660806,0.020612529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98715055,0.0077340896,0.0011731993,0.0018487456,0.0009548644,0.0011385566],"domain_scores_gemma":[0.9884957,0.0038869383,0.00056773337,0.0032122403,0.0028579677,0.0009794071],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006032012,0.0006190772,0.00064678973,0.00017039165,0.0010591883,0.0010543772,0.004202569,0.00031977246,0.00092671247],"category_scores_gemma":[0.00393692,0.0007054337,0.00043428186,0.00267742,0.0008804363,0.00075708696,0.002727582,0.00089079107,0.0011844237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001538558,0.0013730053,0.0020048376,0.00016842743,0.000073970354,0.00004550497,0.050993226,0.0012703422,0.0008058797,0.24988015,0.0018501553,0.69151914],"study_design_scores_gemma":[0.00042388323,0.000005110859,0.0025411688,0.00039362768,0.00005507944,0.000057188452,0.00039634667,0.7820909,0.049253054,0.006517705,0.15743673,0.0008291733],"about_ca_topic_score_codex":0.054191705,"about_ca_topic_score_gemma":0.028540859,"teacher_disagreement_score":0.824571,"about_ca_system_score_codex":0.00064816023,"about_ca_system_score_gemma":0.0024477853,"threshold_uncertainty_score":0.9999866},"labels":[],"label_agreement":null},{"id":"W3113793467","doi":"10.1007/978-3-030-67080-1","title":"Algorithmic and Symbolic Combinatorics","year":2020,"lang":"en","type":"book","venue":"Texts & monographs in symbolic computation/Texts and monographs in symbolic computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; École Normale Supérieure de Lyon; University of Waterloo; Université du Québec à Montréal; University of Pennsylvania","keywords":"Computer science; Algebraic combinatorics; Combinatorics; Mathematics","score_opus":0.014479827583255294,"score_gpt":0.2530183303893774,"score_spread":0.23853850280612207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113793467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16554102,0.07392556,0.6766534,0.004909388,0.010124146,0.019797593,0.00068930496,0.005938818,0.042420756],"genre_scores_gemma":[0.9303705,0.009919428,0.051987685,0.001580229,0.0010528486,0.0008803744,0.0013459198,0.0006339589,0.0022290545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867844,0.0010266962,0.003742405,0.0044503943,0.0018911526,0.0021049825],"domain_scores_gemma":[0.9933387,0.0017443978,0.0015885315,0.0015278407,0.0006772715,0.001123254],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.001858501,0.0025495312,0.0034933574,0.0058897613,0.0006932996,0.001481002,0.0023375936,0.0014704261,0.000017637369],"category_scores_gemma":[0.00015233221,0.0029374084,0.00072853605,0.0056774565,0.0011502159,0.0014052514,0.0023753683,0.0028036903,0.00004434294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011186972,0.0013502097,0.010388021,0.0012531648,0.00051431445,0.0004866181,0.01930186,0.009975708,0.00001593338,0.071148366,0.0073590605,0.87809485],"study_design_scores_gemma":[0.004830957,0.000745851,0.05966503,0.00095325155,0.00018026886,0.00029192065,0.0002868593,0.4154125,0.000008319139,0.50564057,0.008678199,0.0033062934],"about_ca_topic_score_codex":0.00029523848,"about_ca_topic_score_gemma":0.00018878913,"teacher_disagreement_score":0.8747886,"about_ca_system_score_codex":0.00064230914,"about_ca_system_score_gemma":0.0009212064,"threshold_uncertainty_score":0.9998259},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018017177703585796,"score_gpt":0.23691967259686328,"score_spread":0.21890249489327748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124285541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10320494,0.000023320074,0.883635,0.0043611526,0.002942364,0.00036980677,0.000013994586,0.0007400268,0.004709384],"genre_scores_gemma":[0.8782296,0.0000010201092,0.11929044,0.00027418803,0.0005062553,0.000024458921,0.000007737078,0.000017433982,0.0016488538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977341,0.00012735375,0.000390101,0.0007813513,0.0004161032,0.00055093924],"domain_scores_gemma":[0.99742836,0.0005231652,0.0001744165,0.0014086697,0.00019981628,0.00026557795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002549092,0.00029716466,0.0003910494,0.0001624813,0.00032761597,0.00043858742,0.0016743025,0.00014164308,0.0004745293],"category_scores_gemma":[0.0002072692,0.0002637362,0.00018003912,0.0004430549,0.00016684925,0.00041805705,0.00117667,0.0005213202,0.0003492134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008031615,0.00334661,0.024020985,0.00009645556,0.00026619248,0.00022235863,0.0024827474,0.00045652466,0.13247454,0.54518193,0.05582757,0.23554376],"study_design_scores_gemma":[0.0018955502,0.0004046077,0.119714074,0.000020391333,0.000035770514,0.00013871693,0.000108366934,0.82466304,0.0022889061,0.010509337,0.03885742,0.0013638402],"about_ca_topic_score_codex":0.00024701116,"about_ca_topic_score_gemma":0.0004366242,"teacher_disagreement_score":0.8242065,"about_ca_system_score_codex":0.000040783925,"about_ca_system_score_gemma":0.000099495854,"threshold_uncertainty_score":0.99998146},"labels":[],"label_agreement":null},{"id":"W3124618198","doi":"","title":"Complexity and the Amending Formula","year":2015,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Business; Computer science","score_opus":0.037318971425901216,"score_gpt":0.26365439274622576,"score_spread":0.22633542132032455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124618198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057761673,0.0024605526,0.93123317,0.0062779468,0.0004381003,0.00017643924,3.6411444e-7,0.00008950944,0.0015622615],"genre_scores_gemma":[0.9906713,0.00024279262,0.00847566,0.00021405771,0.00024674318,0.0000035692926,2.9523375e-7,0.000007786101,0.00013783736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972785,0.00025057944,0.00025734524,0.00025319424,0.00039250706,0.0015678414],"domain_scores_gemma":[0.99905986,0.00016515225,0.00013617381,0.00035963455,0.00012193889,0.0001572248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005427167,0.00014474195,0.00020972005,0.0000703579,0.0003323421,0.00032820844,0.0010441341,0.00003877278,0.0000026807256],"category_scores_gemma":[0.00014377674,0.00009153547,0.00008462858,0.00025579534,0.00022589373,0.00045205394,0.00044666263,0.0012454026,0.000013703724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002630487,0.00002242099,0.00033945218,0.0000012432467,0.000031281077,0.0000024382368,0.0006023547,0.000050738992,0.00000412199,0.947394,0.000054546006,0.05147107],"study_design_scores_gemma":[0.0014924741,0.00021957656,0.00038410845,0.000003595441,0.000007969103,0.0013913878,0.00039667162,0.0628643,0.000010297354,0.9320775,0.0010324976,0.00011959915],"about_ca_topic_score_codex":0.000081359285,"about_ca_topic_score_gemma":0.00023195056,"teacher_disagreement_score":0.9329096,"about_ca_system_score_codex":0.00066718075,"about_ca_system_score_gemma":0.0010262216,"threshold_uncertainty_score":0.5410724},"labels":[],"label_agreement":null},{"id":"W3125304845","doi":"","title":"Proceedings for \"Computers &amp; Philosophy, an International Conference\", 3-5 May 2006 Laval France","year":2006,"lang":"en","type":"book","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Computer science","score_opus":0.037946488838378284,"score_gpt":0.2756481289696993,"score_spread":0.23770164013132103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125304845","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030007624,0.00003542329,0.5572127,0.0019053639,0.0028863142,0.00094764854,0.00012604226,0.00071907375,0.43613744],"genre_scores_gemma":[0.0005975187,0.0000137254465,0.4231773,0.000860948,0.0038407613,0.00014127047,0.00045237603,0.00007922252,0.5708369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99522513,0.000029179468,0.0008766736,0.0020747914,0.0010694524,0.0007247521],"domain_scores_gemma":[0.99672484,0.00018793638,0.0004874796,0.0010267987,0.0013017942,0.00027116],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005361551,0.0008247496,0.000799086,0.0004282076,0.00019013818,0.0011073212,0.005073957,0.0005555032,0.00013953967],"category_scores_gemma":[0.000040222138,0.00080829987,0.00040791518,0.00020747563,0.00024717834,0.0013885201,0.001092995,0.0005862047,0.00012810413],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001351749,0.00025717242,0.00020257212,0.00014790634,0.00008285881,0.000006778746,0.00017908517,0.00014966943,0.000013332952,0.6557587,0.32300997,0.020178434],"study_design_scores_gemma":[0.0006397976,0.00023244985,0.0002607277,0.00011111509,0.000019005407,0.000037291615,0.0000016373597,0.085343234,0.000022961924,0.28029805,0.6320662,0.0009675278],"about_ca_topic_score_codex":0.00009191881,"about_ca_topic_score_gemma":0.00006390846,"teacher_disagreement_score":0.37546065,"about_ca_system_score_codex":0.00039933238,"about_ca_system_score_gemma":0.00067923404,"threshold_uncertainty_score":0.9999296},"labels":[],"label_agreement":null},{"id":"W3125625384","doi":"","title":"John Percy's Universe: Computing - Then and Now","year":2019,"lang":"en","type":"article","venue":"Journal of the Royal Astronomical Society of Canada","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Universe; Astronomy; Physics","score_opus":0.004071586069431465,"score_gpt":0.1717094169108564,"score_spread":0.16763783084142492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125625384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9801853,0.00008595617,0.0150543805,0.0037131847,0.0006657805,0.000084402935,0.000002519934,0.0000054616326,0.00020306736],"genre_scores_gemma":[0.96235967,0.0000010259514,0.037205942,0.00012938534,0.000121419886,6.111554e-8,7.878262e-8,0.0000049087535,0.00017749841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987833,0.00008162769,0.0003532322,0.0001630497,0.00037484884,0.00024395424],"domain_scores_gemma":[0.9988898,0.00021374294,0.00036700486,0.00027468585,0.00011360595,0.00014116721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046356363,0.00011862049,0.00029810698,0.000012348922,0.00009802945,0.000046138724,0.0010502035,0.000043955268,0.000018251052],"category_scores_gemma":[0.0000158449,0.00008314818,0.00025200113,0.0000879784,0.00009062063,0.00011563738,0.00079600373,0.00033039472,7.190975e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006813741,0.00024823126,0.20434381,0.00013443927,0.0006685378,0.000004842601,0.0028947545,0.63976896,0.0005597423,0.0020376027,0.08464418,0.064626776],"study_design_scores_gemma":[0.00080521934,0.00015197892,0.24241754,0.000051289993,0.000020510875,0.000012311963,0.0005408113,0.74711096,0.00019180747,0.00034593584,0.008171566,0.0001800316],"about_ca_topic_score_codex":0.008533116,"about_ca_topic_score_gemma":0.0022815096,"teacher_disagreement_score":0.10734204,"about_ca_system_score_codex":0.0003836521,"about_ca_system_score_gemma":0.00081468193,"threshold_uncertainty_score":0.99806917},"labels":[],"label_agreement":null},{"id":"W3131127151","doi":"10.1016/j.media.2021.102009","title":"Predicting future cognitive decline with hyperbolic stochastic coding","year":2021,"lang":"en","type":"article","venue":"Medical Image Analysis","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Information and Intelligent Systems; National Institute of Biomedical Imaging and Bioengineering; National Heart, Lung, and Blood Institute; National Institute on Aging; Canadian Institutes of Health Research","keywords":"Cognition; Coding (social sciences); Computer science; Cognitive decline; Artificial intelligence; Mathematics; Psychology; Statistics; Medicine; Dementia","score_opus":0.008760066034389334,"score_gpt":0.26211837901828505,"score_spread":0.2533583129838957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131127151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09764153,0.00031176215,0.8971352,0.0040515815,0.00017195656,0.000089376445,0.000006869307,0.00022458207,0.00036715617],"genre_scores_gemma":[0.94595486,0.000022298545,0.051903646,0.0013180829,0.0006580762,0.000018064604,0.00003831311,0.000014356903,0.00007231708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637336,0.00027294908,0.0004454096,0.000923555,0.0014893836,0.0004953578],"domain_scores_gemma":[0.99721783,0.0008521415,0.0001374396,0.00067448034,0.00064017036,0.00047791476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008221352,0.00025074187,0.0006075234,0.0002519651,0.00022024152,0.00028615014,0.00084797584,0.0001269864,0.0005233709],"category_scores_gemma":[0.0017037075,0.00019762931,0.00027501085,0.004094048,0.00021043424,0.00035760595,0.00097142445,0.00049587403,0.00003916967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009009912,0.0025009967,0.21872,0.00020143275,0.00936394,0.012013847,0.0060707545,0.005194622,0.0006770692,0.0026209743,0.0003332885,0.74221295],"study_design_scores_gemma":[0.00070122874,0.00007719069,0.031441238,0.000057013334,0.0009189283,0.00016365528,0.0004247805,0.96515304,0.00027442374,0.00041000676,0.00007251521,0.00030599613],"about_ca_topic_score_codex":0.00006911539,"about_ca_topic_score_gemma":0.00038800543,"teacher_disagreement_score":0.9599584,"about_ca_system_score_codex":0.000058795806,"about_ca_system_score_gemma":0.00033779268,"threshold_uncertainty_score":0.8059089},"labels":[],"label_agreement":null},{"id":"W3132061720","doi":"10.7202/1076218ar","title":"Giuseppe Primiero, \"On the Foundations of Computing.\"","year":2021,"lang":"en","type":"article","venue":"Philosophy in Review","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Philosophy; Epistemology; Computer science; Cognitive science; Psychology","score_opus":0.08871909158054242,"score_gpt":0.3240668037346974,"score_spread":0.23534771215415495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132061720","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008774986,0.18493894,0.26688835,0.42254615,0.0030134886,0.004142312,0.000022939059,0.00054049026,0.109132364],"genre_scores_gemma":[0.9161051,0.016516287,0.05099199,0.01590124,0.00034071156,0.00006738764,0.00001277653,0.000026106729,0.00003839761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979915,0.00042544183,0.00056367484,0.00044720803,0.00036137484,0.00021080895],"domain_scores_gemma":[0.99740934,0.00078504236,0.00018715317,0.0013530571,0.00021543942,0.000049969465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092484715,0.00015954615,0.00040396952,0.00005788767,0.00008428992,0.00004893859,0.0011206677,0.00003402057,0.00007465916],"category_scores_gemma":[0.00059746864,0.00011625732,0.000174248,0.0012532652,0.000090325106,0.000121319135,0.0005428376,0.00023247984,0.00008766166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.394455e-7,0.00039019162,0.00047607103,0.0010789267,0.000022048976,0.000021438313,0.00021120084,0.00014421175,0.000024102155,0.9205722,0.0009930015,0.07606573],"study_design_scores_gemma":[0.0007272677,0.00030792883,0.017058976,0.011420748,0.000055006643,0.00012142678,0.000014308563,0.034468472,0.0007178668,0.86032873,0.07385662,0.0009226685],"about_ca_topic_score_codex":0.0000050943404,"about_ca_topic_score_gemma":0.0000033648998,"teacher_disagreement_score":0.9073301,"about_ca_system_score_codex":0.00005665369,"about_ca_system_score_gemma":0.00013415124,"threshold_uncertainty_score":0.47408357},"labels":[],"label_agreement":null},{"id":"W3133616068","doi":"10.7202/1076213ar","title":"Hector J. Levesque, \"Common Sense, the Turing Test, and the Quest for Real AI.\"","year":2021,"lang":"en","type":"article","venue":"Philosophy in Review","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Common sense; Philosophy; Turing test; Epistemology","score_opus":0.03205263090399235,"score_gpt":0.30478356147956204,"score_spread":0.2727309305755697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133616068","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024915484,0.478987,0.021675188,0.4676399,0.0012874925,0.005403815,0.000033500655,0.00033887863,0.022142673],"genre_scores_gemma":[0.74523455,0.16739552,0.037873074,0.04597919,0.0021093716,0.0011456168,0.000016701964,0.00007393969,0.00017200662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789816,0.00050893775,0.0004904583,0.0005633933,0.00024853757,0.00029052712],"domain_scores_gemma":[0.99616885,0.002334061,0.00012863893,0.0011759266,0.0001286926,0.000063808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017092875,0.00021577677,0.00051642925,0.000031131338,0.00019059562,0.00017357567,0.0007478935,0.000044208617,0.0000077368595],"category_scores_gemma":[0.00063192175,0.00012250012,0.00017493447,0.0005009922,0.00018727948,0.00019440617,0.0006694243,0.0003022513,0.000012617578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016858507,0.00031199591,0.002144157,0.0042349724,0.000051730574,0.000119364806,0.0006572486,0.00005029442,0.000039193317,0.80103457,0.002341106,0.18899854],"study_design_scores_gemma":[0.0018199976,0.00017044548,0.009169341,0.0033763545,0.000082767874,0.000536906,0.000008664926,0.02863299,0.00016499303,0.8846808,0.07066793,0.00068879954],"about_ca_topic_score_codex":0.000049955765,"about_ca_topic_score_gemma":0.000060025624,"teacher_disagreement_score":0.742743,"about_ca_system_score_codex":0.000055684526,"about_ca_system_score_gemma":0.00007376927,"threshold_uncertainty_score":0.49954098},"labels":[],"label_agreement":null},{"id":"W3138545337","doi":"10.3998/ticker.16481003.0005.204","title":"When the Dean Called for Remote Programming","year":2021,"lang":"en","type":"article","venue":"Ticker The Academic Business Librarianship Review","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Programming language","score_opus":0.06962698354338899,"score_gpt":0.29517740431558454,"score_spread":0.22555042077219556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138545337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000114854665,0.14749621,0.6170032,0.23179778,0.0007516433,0.0021173565,0.0000036417975,0.00034400658,0.00037132078],"genre_scores_gemma":[0.012154152,0.098943025,0.7627173,0.11561681,0.0043184594,0.0012361138,0.0001134646,0.0003049151,0.004595726],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960326,0.00084747176,0.00090488006,0.00090105593,0.00056434947,0.00074963836],"domain_scores_gemma":[0.99488413,0.0017705557,0.00035525265,0.002386235,0.0004530658,0.00015074114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025769046,0.00040393282,0.00066918,0.00004519021,0.00049535715,0.00047340157,0.004752942,0.00021513175,0.000064980384],"category_scores_gemma":[0.0023103282,0.00022625468,0.00030429583,0.0020101154,0.0002303149,0.0009804536,0.0016869407,0.00093529583,0.00008620322],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069933435,0.000040259256,0.000117562304,0.0018336157,0.000064645465,0.000018291854,0.0006278243,0.000016502596,0.000028328632,0.055980768,0.012130639,0.92913455],"study_design_scores_gemma":[0.00044208925,0.000020445246,0.0022148148,0.002299867,0.00016058044,0.0003115119,0.000033169574,0.015589724,0.00009473563,0.1063316,0.8720021,0.00049936125],"about_ca_topic_score_codex":0.000019602247,"about_ca_topic_score_gemma":0.0000035713838,"teacher_disagreement_score":0.9286352,"about_ca_system_score_codex":0.00005749204,"about_ca_system_score_gemma":0.0005881053,"threshold_uncertainty_score":0.92263985},"labels":[],"label_agreement":null},{"id":"W3145429007","doi":"10.1109/ccc.2009.34","title":"Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete","year":2009,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lipschitz continuity; Polynomial; Mathematics; Matrix polynomial; Ordinary differential equation; Differential equation; Space (punctuation); Lipschitz domain; Initial value problem; Function (biology); Differential (mechanical device); Applied mathematics; Monic polynomial; Mathematical analysis; Computer science","score_opus":0.022844328459291026,"score_gpt":0.2431791041547311,"score_spread":0.22033477569544008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145429007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023043599,0.000092992566,0.95954573,0.00911325,0.000895073,0.0003799789,0.0000092795435,0.0008248591,0.0060952646],"genre_scores_gemma":[0.91201645,0.0000028439065,0.08525995,0.0007955473,0.0003435658,0.000010120782,0.000007951132,0.000010822472,0.0015527719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765545,0.00016732015,0.0004119982,0.0007677211,0.00042957475,0.0005679602],"domain_scores_gemma":[0.9979641,0.00032959337,0.00016809115,0.0011420099,0.00016217245,0.00023401958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019701771,0.00030372295,0.00042611867,0.00016921053,0.00029486438,0.00039494285,0.0014209787,0.00010298452,0.00018069151],"category_scores_gemma":[0.00011571355,0.00027324946,0.0001884254,0.0005347906,0.00008287103,0.0004293882,0.00053623784,0.000255894,0.00022697986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010421397,0.003816075,0.005038025,0.000049066868,0.0001793653,0.0002884147,0.0022902156,0.0018353345,0.016887499,0.38907066,0.06996714,0.51047397],"study_design_scores_gemma":[0.0019631519,0.0010418082,0.1677828,0.000038202386,0.000034797868,0.00009853819,0.000109310175,0.79189044,0.00092032045,0.02003563,0.014794294,0.0012906846],"about_ca_topic_score_codex":0.000094768046,"about_ca_topic_score_gemma":0.000044353103,"teacher_disagreement_score":0.8889728,"about_ca_system_score_codex":0.000092377864,"about_ca_system_score_gemma":0.00007656072,"threshold_uncertainty_score":0.999972},"labels":[],"label_agreement":null},{"id":"W3149775200","doi":"10.1007/978-3-319-07956-1","title":"Algorithmic Aspects in Information and Management","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.0074382173001235515,"score_gpt":0.22047447918241148,"score_spread":0.21303626188228791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149775200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011900051,0.0002454629,0.990812,0.00067887566,0.0016908936,0.00087271375,0.0000021647666,0.0001939058,0.00538498],"genre_scores_gemma":[0.027919672,0.00010966752,0.96888983,0.002312287,0.0004769241,0.000053164425,0.000013274156,0.000026914238,0.00019826043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572146,0.00010737109,0.00077519234,0.0014286764,0.0011331246,0.00083417253],"domain_scores_gemma":[0.9974096,0.00045695493,0.00029793702,0.0014890195,0.00016293905,0.00018354885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018429953,0.0005553858,0.0006055321,0.0017986654,0.0001635003,0.00095390104,0.003358573,0.0002938686,0.0000044583185],"category_scores_gemma":[0.00008287572,0.000535257,0.00007733753,0.0017175096,0.0005318994,0.0015509862,0.0033048955,0.0007978152,0.000050699164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020327764,0.000030813408,0.00009082446,0.00015993048,0.000005274405,0.000062462976,0.00062226225,0.017850488,0.000001538107,0.008688515,0.00006806386,0.9724178],"study_design_scores_gemma":[0.00044261897,0.0001343565,0.0029425162,0.00027343634,0.000004083052,0.00006945638,2.5048715e-7,0.804444,0.000043301345,0.1872277,0.0038404625,0.0005778069],"about_ca_topic_score_codex":0.000040360435,"about_ca_topic_score_gemma":0.00015925203,"teacher_disagreement_score":0.97183996,"about_ca_system_score_codex":0.00087930786,"about_ca_system_score_gemma":0.0005215086,"threshold_uncertainty_score":0.9997099},"labels":[],"label_agreement":null},{"id":"W3159858146","doi":"10.2478/jagi-2021-0002","title":"The Synthesis and Decoding of Meaning","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial General Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Meaning (existential); Computer science; Context (archaeology); Cognitive science; Psychology; Epistemology; Philosophy","score_opus":0.04738686286249506,"score_gpt":0.290648478007186,"score_spread":0.24326161514469097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159858146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21007401,0.0013075123,0.78579473,0.0014153348,0.0010111043,0.00004278675,6.2961334e-7,0.0000118238495,0.00034207123],"genre_scores_gemma":[0.8685365,0.00032681855,0.13076252,0.00006135642,0.00027214384,9.0323994e-7,3.649396e-8,0.0000054096045,0.000034352222],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982625,0.00018957205,0.0007537245,0.0001961266,0.00038300132,0.00021505116],"domain_scores_gemma":[0.99759895,0.000995087,0.00039560688,0.00031586323,0.00059692026,0.000097578755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013154392,0.00010754267,0.00024861173,0.00007322063,0.00019288865,0.00022737404,0.000718078,0.00004151437,0.000013359146],"category_scores_gemma":[0.0010944334,0.00007636121,0.00013179575,0.00039548465,0.00013251758,0.00027264806,0.00033375685,0.00019182597,0.000002783485],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019559053,0.000066231856,0.00031469378,0.000011566212,0.000040881896,0.0000667301,0.0009280903,0.0041664997,0.026528506,0.08824913,0.00006397642,0.87954414],"study_design_scores_gemma":[0.00002283048,0.00012321211,0.0005459045,0.000059513142,0.000020057501,0.00036599365,0.00038096297,0.22692202,0.6809021,0.08979833,0.00071369245,0.00014536275],"about_ca_topic_score_codex":0.0000130204235,"about_ca_topic_score_gemma":0.000038783317,"teacher_disagreement_score":0.87939876,"about_ca_system_score_codex":0.000037772923,"about_ca_system_score_gemma":0.00016620323,"threshold_uncertainty_score":0.31139198},"labels":[],"label_agreement":null},{"id":"W3160992390","doi":"10.1145/2090147.2108597","title":"The Hyperdimensional Tar Pit","year":2012,"lang":"en","type":"article","venue":"Queue","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Task (project management); Factor (programming language); Computer science; Quarter (Canadian coin); Rule of thumb; Unit (ring theory); Arithmetic; Operations research; Management; Mathematics; Algorithm; History; Programming language; Economics; Archaeology; Mathematics education","score_opus":0.011475586658985177,"score_gpt":0.22727761830720214,"score_spread":0.21580203164821696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160992390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2865192,0.005256752,0.6495718,0.020223454,0.011246059,0.00076330727,0.0000059699087,0.0011526967,0.025260825],"genre_scores_gemma":[0.95836145,0.000008499009,0.039799858,0.000745868,0.0004882806,0.000014994138,8.5756074e-7,0.000007800691,0.000572407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882096,0.0001019261,0.00015080876,0.00022057266,0.00029437582,0.00041138454],"domain_scores_gemma":[0.9987067,0.0003671055,0.000039923478,0.00069259916,0.00006315933,0.00013052688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006575419,0.000105194726,0.00009590029,0.000023888346,0.00026911322,0.00009740261,0.0008470553,0.00004132846,0.000029969704],"category_scores_gemma":[0.000080651684,0.00006815867,0.00006398848,0.00019892484,0.00007198379,0.0003148249,0.0005489156,0.00013541359,0.00047125254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007990972,0.0003599965,0.010593382,0.000009293505,0.000040980427,0.000013424982,0.0017339092,0.00021552834,0.0009183086,0.66465306,0.023371084,0.29808307],"study_design_scores_gemma":[0.0005159875,0.00016298467,0.14181694,0.000012914522,0.000012205662,0.00022673138,0.00006428843,0.12551841,0.002978841,0.07457552,0.6534117,0.0007034833],"about_ca_topic_score_codex":0.00003889455,"about_ca_topic_score_gemma":0.000008010454,"teacher_disagreement_score":0.6718423,"about_ca_system_score_codex":0.000063958185,"about_ca_system_score_gemma":0.000051043717,"threshold_uncertainty_score":0.6057155},"labels":[],"label_agreement":null},{"id":"W3163052523","doi":"10.32473/flairs.v34i1.128478","title":"One game show, two boys, two aces, three prisoners - what’s an AI to do?","year":2021,"lang":"en","type":"article","venue":"Proceedings of the ... International Florida Artificial Intelligence Research Society Conference","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Counterintuitive; Simple (philosophy); Representation (politics); Pearl; Dice; Mathematical economics; Psychology; Computer science; Epistemology; Mathematics; Statistics; Philosophy; Law","score_opus":0.16881770852735323,"score_gpt":0.4016206498379394,"score_spread":0.23280294131058615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163052523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37742943,0.00036694476,0.5385489,0.07347769,0.004902626,0.0017059781,0.000035552708,0.00032800087,0.003204887],"genre_scores_gemma":[0.9525094,0.00020108809,0.045206755,0.0007361076,0.00085167,0.00012924912,0.0000057789375,0.000030371131,0.00032956194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926272,0.00010646585,0.00096578477,0.0015595268,0.003680316,0.0010607222],"domain_scores_gemma":[0.9889233,0.00052293856,0.00026470944,0.0008863557,0.008942704,0.00045999515],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004065016,0.00037244512,0.0004654596,0.00021199121,0.0004741407,0.0037678606,0.007669947,0.00015391727,0.00023088607],"category_scores_gemma":[0.0017262272,0.00034627024,0.00040262315,0.0023407326,0.00071541866,0.0032212592,0.004807475,0.0013136092,0.00010955089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006778554,0.0006414169,0.001415923,0.00006947954,0.00016633478,0.0000042878632,0.008854099,0.0012396568,0.07595581,0.7024374,0.001361618,0.2077862],"study_design_scores_gemma":[0.00011412468,0.00021469449,0.0006549959,0.00030623554,0.000012010616,0.000016219465,0.0053470396,0.3036405,0.28053105,0.40722102,0.0014877544,0.00045430867],"about_ca_topic_score_codex":0.00042078056,"about_ca_topic_score_gemma":0.00035081865,"teacher_disagreement_score":0.57508,"about_ca_system_score_codex":0.0006094086,"about_ca_system_score_gemma":0.001098748,"threshold_uncertainty_score":0.9998989},"labels":[],"label_agreement":null},{"id":"W3176000023","doi":"","title":"Limit theorems and structural properties for the Cat-and-Mouse Markov chain and its generalisations","year":2021,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua","funders":"","keywords":"Mathematics; Markov chain; Limit (mathematics); Chain (unit); Pure mathematics; Combinatorics; Statistics; Mathematical analysis","score_opus":0.03739610108392609,"score_gpt":0.24175141471663572,"score_spread":0.20435531363270965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176000023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83171135,0.002879613,0.1483427,0.015790753,0.00029208,0.00064688915,0.000010327969,0.00013205051,0.00019425264],"genre_scores_gemma":[0.95161784,0.00010980875,0.046236675,0.0005905208,0.00009967834,0.000046371373,0.0000017896481,0.0000075675707,0.0012897587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908274,0.00008315942,0.00014335659,0.00038320318,0.00011666526,0.00019088264],"domain_scores_gemma":[0.99913067,0.00031423802,0.000030236293,0.00032189995,0.00013554498,0.00006739686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002808853,0.00012358105,0.00012768063,0.000026142663,0.00033146422,0.0003727745,0.0002483533,0.000036804282,0.000009813038],"category_scores_gemma":[0.00013539943,0.00007140926,0.000027722628,0.000117823394,0.00012112225,0.00022790667,0.0005242978,0.00005519243,5.2028145e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025370366,0.00006417103,0.0027048804,0.00016202092,0.00013302724,0.000008423973,0.012580743,0.00053641375,0.018288085,0.673993,0.00062171667,0.29088217],"study_design_scores_gemma":[0.00031987063,0.00006021632,0.0061987857,0.0000047471485,0.000012888259,0.00008804492,0.00027508047,0.9710187,0.0072357617,0.014016721,0.00058059004,0.00018863496],"about_ca_topic_score_codex":0.00004934768,"about_ca_topic_score_gemma":0.00016542501,"teacher_disagreement_score":0.97048223,"about_ca_system_score_codex":0.000014994585,"about_ca_system_score_gemma":0.00005374973,"threshold_uncertainty_score":0.3594673},"labels":[],"label_agreement":null},{"id":"W3176180624","doi":"10.1007/s00153-023-00865-7","title":"Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms","year":2023,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Automorphism; Equivalence (formal languages); Turing; Algebra over a field; Equivalence class (music); Real line; Congruence relation; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.04916702238295074,"score_gpt":0.3255475253210538,"score_spread":0.27638050293810307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176180624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046931475,0.0000057243956,0.94759816,0.0020441166,0.000058531226,0.0009978145,0.00002350289,0.00028326747,0.0020573947],"genre_scores_gemma":[0.5495182,0.00000913686,0.44980636,0.00023416078,0.00003010299,0.00029419267,0.000009414074,0.0000129197315,0.000085477484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985659,0.000048927006,0.00033449006,0.00045485387,0.00023848674,0.00035734332],"domain_scores_gemma":[0.997723,0.0014718488,0.00007401001,0.00051596493,0.00005671832,0.00015849844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004021649,0.00015045868,0.00027584354,0.00012395131,0.00011689691,0.000046070527,0.00062563445,0.000055265882,0.0000154141],"category_scores_gemma":[0.00014471538,0.00012829948,0.00009166517,0.0004357378,0.00015356559,0.00008371609,0.00061086856,0.00010229285,0.000061535255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070705446,0.0001087994,0.000044866414,0.00025646968,0.000021815422,0.0000028048557,0.0011731968,0.0008156768,0.00087768654,0.9863343,0.0003732134,0.0099840965],"study_design_scores_gemma":[0.00018828592,0.00015542473,0.0019793366,0.00002573123,0.000009177448,0.000008303603,0.00006756175,0.10877762,0.00025827778,0.8882879,0.00010087858,0.0001415061],"about_ca_topic_score_codex":0.000015695705,"about_ca_topic_score_gemma":0.0000072743055,"teacher_disagreement_score":0.5025868,"about_ca_system_score_codex":0.00002120861,"about_ca_system_score_gemma":0.000038808605,"threshold_uncertainty_score":0.5231901},"labels":[],"label_agreement":null},{"id":"W3178019705","doi":"10.2139/ssrn.3819348","title":"Safety First in a Hostile Environment:: The Historical Origins of Artificial Intelligence","year":2021,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Psychology; History","score_opus":0.015034208803911965,"score_gpt":0.22663234203939014,"score_spread":0.2115981332354782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178019705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021023715,0.002923439,0.96995026,0.0053157634,0.00047251713,0.00012034346,0.0000011639753,0.000023897981,0.00016891399],"genre_scores_gemma":[0.9917271,0.002087689,0.005753453,0.00006338805,0.0002150645,0.0000053195054,7.6633836e-7,0.000010458383,0.00013674753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969087,0.0002369784,0.0006191559,0.00038456806,0.00047848088,0.0013720817],"domain_scores_gemma":[0.9987635,0.0003292166,0.00018928404,0.00057087693,0.00007050648,0.000076603035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002016194,0.00016285235,0.0002619952,0.00009674525,0.00020260233,0.000067645895,0.0012038788,0.00007041244,0.000049143113],"category_scores_gemma":[0.00017264292,0.00012693675,0.0001557661,0.0006170039,0.00008398902,0.00020731681,0.0003646639,0.0015471797,0.000025787247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022295904,0.00040179942,0.00092661014,0.0000056202816,0.000035572204,0.000037890015,0.00071565906,0.0042101243,0.0001479893,0.7623544,0.000019417452,0.23112263],"study_design_scores_gemma":[0.0002242334,0.00043782173,0.0020384446,0.000024091292,0.000017337341,0.0009293662,0.00049674796,0.06472316,0.0010631946,0.91106313,0.018663304,0.00031918002],"about_ca_topic_score_codex":0.00017216214,"about_ca_topic_score_gemma":0.0012400041,"teacher_disagreement_score":0.9707034,"about_ca_system_score_codex":0.006806625,"about_ca_system_score_gemma":0.0018398835,"threshold_uncertainty_score":0.99700606},"labels":[],"label_agreement":null},{"id":"W3181489860","doi":"","title":"THE MONTREAL EXPERIENCE : PART I- BASICS AND TREATMENT ALGORITHM","year":2021,"lang":"en","type":"article","venue":"Investigative Ophthalmology & Visual Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Environmental science","score_opus":0.04589693550888014,"score_gpt":0.3242928598934981,"score_spread":0.27839592438461797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181489860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99097323,0.0005470137,0.002958522,0.002196781,0.0010571036,0.0003052602,0.00000613795,0.00012102909,0.0018349357],"genre_scores_gemma":[0.94611794,0.00006816303,0.052749388,0.00030275516,0.00014522171,0.00012770157,0.0000020241744,0.0000113357055,0.0004754818],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99602544,0.00045197274,0.000410028,0.0015239291,0.0006714212,0.00091721915],"domain_scores_gemma":[0.99697065,0.00090245996,0.00016982912,0.00095201394,0.0004692351,0.000535823],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0009493818,0.0003506238,0.0003378436,0.00008386533,0.0016198659,0.00059336564,0.0015533929,0.000096153606,0.00001987819],"category_scores_gemma":[0.0007183592,0.000246782,0.00007819914,0.0017569358,0.007498295,0.00085031986,0.0015518189,0.00022124988,0.000026822356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018133633,0.0011111052,0.045329865,0.000011638589,0.0001021343,0.004265093,0.0226107,0.00013872537,0.06085098,0.022959435,0.00012147375,0.8424807],"study_design_scores_gemma":[0.001156455,0.0025852367,0.36008778,0.00004776771,0.000028829043,0.0048314487,0.002293004,0.20252989,0.29033425,0.1303172,0.004479105,0.0013090195],"about_ca_topic_score_codex":0.00023046546,"about_ca_topic_score_gemma":0.000041455798,"teacher_disagreement_score":0.8411717,"about_ca_system_score_codex":0.0002792695,"about_ca_system_score_gemma":0.0010556392,"threshold_uncertainty_score":0.99999845},"labels":[],"label_agreement":null},{"id":"W3186439195","doi":"10.1007/978-3-030-88708-7_1","title":"Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Type-2 fuzzy sets and systems; Fuzzy number; Fuzzy set operations; Discrete mathematics; Fuzzy classification; Membership function; Fuzzy logic; Fuzzy set; Fuzzy mathematics; Hierarchy; Theoretical computer science; Artificial intelligence; Computer science","score_opus":0.0174014376128767,"score_gpt":0.26071349960057194,"score_spread":0.24331206198769523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186439195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03506347,0.0016264094,0.95447963,0.004414821,0.002785481,0.0011372466,0.000003410429,0.00037950286,0.00011002563],"genre_scores_gemma":[0.455642,0.000029465265,0.54321784,0.0008115394,0.0002150763,0.000061193634,0.0000042254233,0.000018018382,6.2848386e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99189466,0.0008155624,0.0010022572,0.003398889,0.0015667821,0.0013218608],"domain_scores_gemma":[0.9931137,0.0021152277,0.00055107253,0.0034805203,0.0004501998,0.00028930538],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0061735893,0.00082025427,0.001112088,0.0005587236,0.00074822863,0.0042335065,0.0069235046,0.00038126588,0.000003984115],"category_scores_gemma":[0.0013893244,0.0006064064,0.00025099446,0.002892835,0.0025076682,0.00079515553,0.020433614,0.0023663298,0.0000031784587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014450699,0.00012183708,0.00083330064,0.00027485788,0.000030090836,0.00012662083,0.012616386,0.17303737,0.00006075326,0.005083202,0.0000052644464,0.8077959],"study_design_scores_gemma":[0.00061200163,0.00004207686,0.0011235083,0.000316194,0.000010572587,0.0002032434,0.0000066125845,0.8499961,0.0005654479,0.14652045,0.0000075758,0.0005962405],"about_ca_topic_score_codex":0.00021522284,"about_ca_topic_score_gemma":0.00007044036,"teacher_disagreement_score":0.80719966,"about_ca_system_score_codex":0.00035843,"about_ca_system_score_gemma":0.001030018,"threshold_uncertainty_score":0.99993527},"labels":[],"label_agreement":null},{"id":"W3191391565","doi":"10.1109/iwcmc51323.2021.9498947","title":"Opportunistic Coded Distributed Computing: An Evolutionary Game Approach","year":2021,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Research (Canada)","funders":"National Research Foundation of Korea; National Research Foundation Singapore","keywords":"Computer science; Distributed computing","score_opus":0.04247152886853666,"score_gpt":0.266882186184864,"score_spread":0.2244106573163273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191391565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049393903,0.000088079774,0.98673177,0.00085014425,0.00048734606,0.00019825956,0.000034107456,0.0008832236,0.00578769],"genre_scores_gemma":[0.5844112,0.0000024838948,0.4144034,0.0003535279,0.00012690182,0.0000063162447,0.0003401922,0.0000115792045,0.00034440434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970273,0.00032263892,0.0004578332,0.0011055223,0.0005382904,0.0005484652],"domain_scores_gemma":[0.99733406,0.00022109164,0.00010408029,0.001507035,0.00044278178,0.0003909574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043755688,0.00026595447,0.00034781644,0.00007568473,0.00020602853,0.00029705887,0.001303979,0.000113021175,0.00011454611],"category_scores_gemma":[0.00016183582,0.00025893582,0.00012598197,0.00093073165,0.00013415591,0.00044510383,0.0012338801,0.00024668954,0.000051492392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019428897,0.0051532364,0.0050782985,0.00013958894,0.00013707647,0.0008238828,0.0011765424,0.021330725,0.0012250573,0.8626794,0.01024244,0.091994286],"study_design_scores_gemma":[0.00035056387,0.00008466399,0.01605934,0.0000055928713,0.00000889171,0.00032387656,0.00009086601,0.9668266,0.00012227127,0.013105899,0.0026632685,0.00035815028],"about_ca_topic_score_codex":0.000032706248,"about_ca_topic_score_gemma":0.0000045164024,"teacher_disagreement_score":0.9454959,"about_ca_system_score_codex":0.000165419,"about_ca_system_score_gemma":0.00045617938,"threshold_uncertainty_score":0.9999863},"labels":[],"label_agreement":null},{"id":"W3192943071","doi":"10.9734/bpi/ctmcs/v7/3406f","title":"The Set of Real Functions are Countable in Applied Mathematics, Algebra of the Functions and Their Classification","year":2021,"lang":"en","type":"book-chapter","venue":"Book Publisher International (a part of SCIENCEDOMAIN International)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Countable set; Mathematics; Set (abstract data type); Computable function; Computable number; Mathematics Subject Classification; Algebra over a field; Discrete mathematics; Element (criminal law); Infinite set; Real number; Computable analysis; Pure mathematics; Computer science","score_opus":0.03161725515864617,"score_gpt":0.23797196363574113,"score_spread":0.20635470847709497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192943071","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020282099,0.0005089416,0.03476535,0.0114234,0.008225719,0.0011679401,0.0005505922,0.000080210615,0.9412496],"genre_scores_gemma":[0.40764195,0.001789287,0.016062977,0.00066957314,0.0012958052,0.00048809542,0.0004611231,0.00014759762,0.57144356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958379,0.000057576173,0.0013841286,0.0007887097,0.0016704586,0.00026119626],"domain_scores_gemma":[0.9945174,0.0009779735,0.0016923253,0.0011549391,0.0015785196,0.00007887891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016953195,0.00034370486,0.00048076312,0.0004547397,0.00021927219,0.0004214538,0.0035449474,0.00018659857,0.00018581397],"category_scores_gemma":[0.0004276129,0.00023903829,0.00026249856,0.00037790753,0.0012666512,0.0010262113,0.0013993753,0.00041625294,0.000006572663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014104973,0.00015265952,0.0009293454,0.00003476922,0.00017540107,9.549681e-7,0.00050996523,0.00029637432,0.00034864518,0.9832783,0.009439166,0.004820311],"study_design_scores_gemma":[0.0016783627,0.00014727864,0.027099887,0.001186835,0.00008100417,0.00010516014,0.003938625,0.06404788,0.0010241298,0.3594574,0.54014,0.001093489],"about_ca_topic_score_codex":0.00009818054,"about_ca_topic_score_gemma":0.00037133877,"teacher_disagreement_score":0.6238209,"about_ca_system_score_codex":0.0003736466,"about_ca_system_score_gemma":0.00054446346,"threshold_uncertainty_score":0.9747699},"labels":[],"label_agreement":null},{"id":"W3197043301","doi":"10.26634/jmat.11.2.19190","title":"On Kolmogorov Complexity of Unitary Transformations in Quantum Computing","year":2022,"lang":"en","type":"article","venue":"i-manager’s Journal on Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Kolmogorov complexity; Unitary state; Hilbert space; Unitary transformation; Transformation (genetics); Mathematics; Context (archaeology); Quantum computer; Quantum information; Qubit; Quantum; Algebra over a field; Computer science; Discrete mathematics; Algorithm; Pure mathematics; Quantum mechanics; Physics","score_opus":0.05591416659177609,"score_gpt":0.28327607591838383,"score_spread":0.22736190932660774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197043301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30191827,0.0000654056,0.69066423,0.0022070622,0.0007328079,0.00042320963,0.000017400771,0.00011986944,0.0038517562],"genre_scores_gemma":[0.91506535,0.000011707695,0.08442417,0.00039376115,0.000046616537,0.000006242582,0.000003617434,0.000020166186,0.000028366943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965724,0.00043926743,0.0011675376,0.0002999446,0.0010842696,0.00043662195],"domain_scores_gemma":[0.997485,0.0009962162,0.000540733,0.0007134355,0.0001265481,0.00013807617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022648938,0.00026183872,0.00053215865,0.0006986607,0.000524299,0.0001370242,0.0017553645,0.00004643148,0.00010203026],"category_scores_gemma":[0.00015062994,0.00024821144,0.00022132733,0.0011298413,0.000120557816,0.00033773543,0.00047853167,0.0010658988,0.000023135788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019289544,0.0019446316,0.00010350032,0.0001902379,0.00004995445,0.00017408261,0.008079254,0.21202266,0.000032525117,0.7640781,0.0007107934,0.012594985],"study_design_scores_gemma":[0.00047056662,0.00042770902,0.0011568422,0.000085137384,0.000008675409,0.00020989055,0.0005985688,0.64424175,0.000032251333,0.35237852,0.00019753727,0.00019259258],"about_ca_topic_score_codex":0.000015997537,"about_ca_topic_score_gemma":0.00000994209,"teacher_disagreement_score":0.6131471,"about_ca_system_score_codex":0.00032631724,"about_ca_system_score_gemma":0.0001028204,"threshold_uncertainty_score":0.999997},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Mathematics education; Computer science","score_opus":0.03441838138543281,"score_gpt":0.2910074292922361,"score_spread":0.2565890479068033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199228775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006982173,0.00022504387,0.97344357,0.000485676,0.009530502,0.0020406267,0.000012634299,0.00030858602,0.0069711762],"genre_scores_gemma":[0.012125875,0.00006726071,0.98537713,0.00047443135,0.00069895166,0.00016432673,0.000006302144,0.00008709084,0.0009986565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98523164,0.0002081461,0.0028781577,0.00420108,0.004417045,0.0030639227],"domain_scores_gemma":[0.9894605,0.001390539,0.0011971946,0.006091062,0.0011364956,0.0007241699],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.008409411,0.0014738282,0.002181857,0.0043038055,0.0006586992,0.0043904926,0.02095711,0.00054259045,0.00023481382],"category_scores_gemma":[0.0003459264,0.001363713,0.00030546615,0.011856737,0.0039768866,0.0032484345,0.013276129,0.001865921,0.00564809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009131142,0.011802384,0.00034034014,0.00640508,0.00009672592,0.0008008551,0.045986943,0.19624472,0.0014833695,0.12340024,0.035501227,0.57792896],"study_design_scores_gemma":[0.00054189574,0.00021170874,0.00030030872,0.0011321949,0.0000071095874,0.00019307106,0.000023583976,0.952616,0.00058368244,0.042382017,0.0005501348,0.0014583416],"about_ca_topic_score_codex":0.00012961651,"about_ca_topic_score_gemma":0.00004911232,"teacher_disagreement_score":0.7563712,"about_ca_system_score_codex":0.0019942506,"about_ca_system_score_gemma":0.0029469691,"threshold_uncertainty_score":0.9998011},"labels":[],"label_agreement":null},{"id":"W3199627032","doi":"10.53733/129","title":"Towards understanding the theoretical challenges of numerical modeling of dynamical systems","year":2021,"lang":"en","type":"article","venue":"New Zealand journal of mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computability; Principal (computer security); Dynamical systems theory; Computer science; Theoretical computer science; Management science; Data science; Mathematical economics; Epistemology; Mathematics; Engineering; Physics; Philosophy; Computer security","score_opus":0.058621353159899664,"score_gpt":0.27721652427533805,"score_spread":0.21859517111543839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199627032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117104,0.0011422873,0.9828244,0.0032192844,0.00035124755,0.00007300551,0.0000012426904,0.000011740584,0.0006663821],"genre_scores_gemma":[0.91186833,0.00018148054,0.087795526,0.000011231607,0.000121656216,3.7530666e-7,1.2187712e-7,0.0000088572515,0.000012428135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977636,0.00019601652,0.00092935935,0.00014797112,0.00076300855,0.00020008684],"domain_scores_gemma":[0.9978182,0.0007882122,0.00048303735,0.00044562467,0.00033882688,0.00012610982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013779551,0.00013495947,0.0005778462,0.000072443865,0.0000392868,0.00006266653,0.00078841666,0.000083728344,0.0000108867725],"category_scores_gemma":[0.00036703702,0.00008153115,0.00020776916,0.00023141257,0.00011359053,0.0001152195,0.00026026735,0.00028348272,7.031679e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067254177,0.00034265494,0.000039175327,0.00020245493,0.00008836306,0.000024166544,0.004397674,0.022813002,0.00006514843,0.9697332,0.0000526072,0.0022348526],"study_design_scores_gemma":[0.00025181196,0.00014191838,0.000016780947,0.00017105715,0.000027222904,0.00046385333,0.0013777673,0.6655129,0.0000572327,0.33191478,0.000007661463,0.000057004734],"about_ca_topic_score_codex":0.0000054968214,"about_ca_topic_score_gemma":9.913005e-7,"teacher_disagreement_score":0.9001579,"about_ca_system_score_codex":0.00008495372,"about_ca_system_score_gemma":0.0003180224,"threshold_uncertainty_score":0.3324744},"labels":[],"label_agreement":null},{"id":"W3200178902","doi":"","title":"Hereditarily indecomposable weakly chainable continua","year":2018,"lang":"it","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Indecomposable module; Mathematics; Combinatorics; Pure mathematics","score_opus":0.017416054465933188,"score_gpt":0.25205288401899156,"score_spread":0.23463682955305837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200178902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033433653,0.0007106105,0.64552414,0.010000547,0.015360384,0.0015256479,0.000024072988,0.0014339917,0.29198694],"genre_scores_gemma":[0.8087575,0.000027682172,0.11897933,0.002239518,0.004736789,0.00003492341,0.000008232795,0.00007769723,0.06513834],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931548,0.00040112287,0.0011230696,0.0021536632,0.0011286847,0.0020386649],"domain_scores_gemma":[0.9943747,0.00047901075,0.00035593339,0.0027994667,0.0013064593,0.00068442407],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019591772,0.00080036337,0.0009561838,0.00031291644,0.00080933643,0.0014085198,0.00365247,0.00046745472,0.0047358545],"category_scores_gemma":[0.0002614821,0.00076749985,0.00034138217,0.0017639166,0.0009296078,0.0013954607,0.0030920876,0.0006763472,0.0069228755],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002139827,0.004279985,0.016312402,0.00036145461,0.000651405,0.0005477962,0.010630892,0.0005723173,0.0018193121,0.3208615,0.41061085,0.2331381],"study_design_scores_gemma":[0.0017908872,0.0028898371,0.011780318,0.00012417954,0.000059132984,0.0002065145,0.00048311643,0.6225826,0.00460633,0.04431033,0.3092729,0.0018938365],"about_ca_topic_score_codex":0.0018636327,"about_ca_topic_score_gemma":0.0004270545,"teacher_disagreement_score":0.7753238,"about_ca_system_score_codex":0.00040681747,"about_ca_system_score_gemma":0.0007494733,"threshold_uncertainty_score":0.9996281},"labels":[],"label_agreement":null},{"id":"W3201090294","doi":"10.2200/s01117ed1v01y202107mas044","title":"Mathematical Problem Factories: Almost Endless Problem Generation","year":2021,"lang":"en","type":"article","venue":"Synthesis lectures on mathematics and statistics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; York University","funders":"","keywords":"Factory (object-oriented programming); Mathematical problem; Type (biology); Computer science; Engineering; Operations research; Industrial engineering; Mathematics; Mathematics education; Programming language; Geology","score_opus":0.02694133074276731,"score_gpt":0.25478217794558045,"score_spread":0.22784084720281314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201090294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017559918,0.00014103645,0.9939233,0.00059280003,0.00015066024,0.00037976267,0.00011113917,0.00015351156,0.0027917728],"genre_scores_gemma":[0.050044924,0.00005784829,0.94931215,0.00016304068,0.000112539296,0.0000749999,0.000017128947,0.000034365123,0.00018298771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740756,0.00015616108,0.00064016855,0.00069695164,0.00065476634,0.0004444168],"domain_scores_gemma":[0.996251,0.0022095782,0.00020900431,0.00082708505,0.00031567106,0.00018765836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042435917,0.00038355702,0.0005492096,0.00009590991,0.00030055796,0.0006763778,0.0004922503,0.00014922894,0.00013012945],"category_scores_gemma":[0.0010443577,0.00031505688,0.000076928925,0.00030313316,0.0001148594,0.00014132936,0.00029202312,0.00024982935,0.00004151632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028675497,0.00054741086,0.00001741332,0.00061425916,0.000076083954,0.000069823385,0.0027482277,0.0003705897,0.0016981396,0.9233082,0.0014637016,0.06908331],"study_design_scores_gemma":[0.00016957472,0.00012816353,0.00007295298,0.00012477303,0.000051404844,0.00012989424,0.00011648474,0.33966473,0.011640928,0.6463657,0.0010409564,0.0004944357],"about_ca_topic_score_codex":0.0000043475375,"about_ca_topic_score_gemma":0.000023032648,"teacher_disagreement_score":0.33929414,"about_ca_system_score_codex":0.00008128481,"about_ca_system_score_gemma":0.00017036297,"threshold_uncertainty_score":0.99993014},"labels":[],"label_agreement":null},{"id":"W3206224988","doi":"","title":"Quantum Kolmogorov complexity and duality of unitary transformations and quantum states.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Unitary transformation; Quantum state; Unitary state; Quantum operation; Duality (order theory); Mathematics; Quantum mechanics; Quantum; Open quantum system; Physics; Pure mathematics; Law; Political science","score_opus":0.10838100294867717,"score_gpt":0.20851491782285228,"score_spread":0.10013391487417511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206224988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55432004,0.00021940791,0.44441113,0.0002257267,0.00021813395,0.00024991386,0.000083794665,0.0001124062,0.00015944394],"genre_scores_gemma":[0.9936715,0.0006666045,0.00547173,0.000059347498,0.00001957718,9.1650634e-7,0.000072665985,0.0000121783305,0.00002550703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973786,0.00045586843,0.0004631885,0.0011648979,0.00016657347,0.00037090422],"domain_scores_gemma":[0.9974806,0.0003532036,0.00028173465,0.0012432251,0.00038307256,0.00025821067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006153913,0.00038664005,0.0006626871,0.0002555418,0.00022787857,0.00016172996,0.0010371308,0.00024445323,0.00002174632],"category_scores_gemma":[0.000045290744,0.0004504365,0.00017189224,0.00066716206,0.0006654868,0.00066791207,0.0025657536,0.0006169575,0.000002324748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059917755,0.00080902124,0.01671653,0.0016703163,0.00035689984,0.00034765352,0.0074046375,0.050656818,0.00006427041,0.9181056,0.00011466525,0.0036936654],"study_design_scores_gemma":[0.00043162322,0.00007975387,0.028794564,0.00006916415,0.000060789152,0.000017534281,0.00058431237,0.7521783,0.000052235144,0.2172826,0.00005604664,0.0003930656],"about_ca_topic_score_codex":0.0015660945,"about_ca_topic_score_gemma":0.00037525434,"teacher_disagreement_score":0.7015215,"about_ca_system_score_codex":0.00012408916,"about_ca_system_score_gemma":0.000284683,"threshold_uncertainty_score":0.9997947},"labels":[],"label_agreement":null},{"id":"W3208227432","doi":"10.1017/jsl.2021.58","title":"SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Randomness; Prefix; Omega; Combinatorics; Halting problem; BETA (programming language); Alpha (finance); Mathematics; Discrete mathematics; Computer science; Algorithm; Physics; Turing machine; Statistics; Philosophy; Quantum mechanics","score_opus":0.01715385774161524,"score_gpt":0.26727219337782365,"score_spread":0.2501183356362084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208227432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60207975,0.0052590114,0.38360953,0.0050865677,0.0026224577,0.00031344045,0.000006733135,0.00007052461,0.00095196883],"genre_scores_gemma":[0.94278675,0.0002992224,0.056293733,0.00020168544,0.00036054332,0.000003125907,6.5105434e-7,0.0000073239025,0.000046960107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760187,0.00034305893,0.0009936102,0.0002537518,0.0005014768,0.00030625632],"domain_scores_gemma":[0.9979257,0.0003563147,0.00051109615,0.0005039487,0.00056321075,0.00013972411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014143998,0.00016722547,0.0006622431,0.00033492935,0.00005294903,0.00006704769,0.0010052581,0.00010669062,0.000022779508],"category_scores_gemma":[0.0004350726,0.0001362037,0.00024952655,0.0010035897,0.000100668454,0.00061040645,0.00034789977,0.00042755812,0.000007344142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020932105,0.006601051,0.0416618,0.00049625203,0.00039843153,0.004734527,0.006484231,0.025227295,0.012390277,0.6763215,0.0007073881,0.2247679],"study_design_scores_gemma":[0.007387999,0.0005918985,0.18407781,0.00031597822,0.000056473564,0.0037542714,0.0003074831,0.04466342,0.0069785677,0.750479,0.0007913655,0.00059576536],"about_ca_topic_score_codex":0.000037300288,"about_ca_topic_score_gemma":0.000017607454,"teacher_disagreement_score":0.340707,"about_ca_system_score_codex":0.00015506777,"about_ca_system_score_gemma":0.0005611218,"threshold_uncertainty_score":0.55542254},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0759074459117106,"score_gpt":0.3100415070347768,"score_spread":0.23413406112306617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209192400","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028721169,0.0083028795,0.05387597,0.8613802,0.0012094354,0.0005098831,0.000015485775,0.00039569594,0.045589272],"genre_scores_gemma":[0.3706132,0.00008052305,0.6286834,0.00034676635,0.000012848226,0.0000090553485,0.000002044987,0.0000038671164,0.00024829013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990374,0.00029849532,0.00021066237,0.0001781082,0.00016277922,0.00011258273],"domain_scores_gemma":[0.93414617,0.0005605358,0.0000940312,0.06492816,0.0002416127,0.000029490371],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00030506647,0.000065841894,0.00011291563,0.00002573149,0.00021785722,0.00005139341,0.053894877,0.00003336225,0.000016093927],"category_scores_gemma":[0.0063309693,0.000052288626,0.00010720297,0.00064620783,0.00017736027,0.00013048507,0.080488265,0.0001683356,0.000026096848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043427667,0.0020413517,0.017096633,0.00008599986,0.00017069123,0.0000049955406,0.0068754875,0.00089957844,0.009753204,0.6618161,0.1391343,0.16211729],"study_design_scores_gemma":[0.0002233001,0.00002070187,0.0336779,0.00004416344,0.000015252899,0.000026918899,0.00014822336,0.025514318,0.009734943,0.87280345,0.057606887,0.00018394022],"about_ca_topic_score_codex":0.000023822806,"about_ca_topic_score_gemma":0.00006832545,"teacher_disagreement_score":0.86103344,"about_ca_system_score_codex":0.000033216307,"about_ca_system_score_gemma":0.00012884843,"threshold_uncertainty_score":0.951224},"labels":[],"label_agreement":null},{"id":"W3213658977","doi":"10.3390/e23111524","title":"On the Problem of Small Objects","year":2021,"lang":"en","type":"article","venue":"Entropy","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics","score_opus":0.017917978214020018,"score_gpt":0.21698025127202122,"score_spread":0.1990622730580012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213658977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.142266,0.00027414103,0.8346129,0.00807154,0.00062907446,0.0003864234,0.0000030031474,0.0002000337,0.013556892],"genre_scores_gemma":[0.8122756,0.0000062968347,0.18632182,0.0007210106,0.000090038884,0.000013944975,0.0000010157287,0.0000074163854,0.0005628855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989488,0.00014999993,0.00016597493,0.000300668,0.00023595746,0.00019861684],"domain_scores_gemma":[0.998671,0.00040253918,0.00006404672,0.0007089637,0.00011003563,0.000043428805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002414181,0.000091535476,0.00012771494,0.000025744343,0.00005905908,0.000064912056,0.0006893517,0.000029034745,0.00008042647],"category_scores_gemma":[0.000090398455,0.00006168068,0.00007892127,0.0003411323,0.000042785203,0.000050693652,0.00038645286,0.00012273701,0.00006612073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034119178,0.00021706671,0.0003638265,0.000016618078,0.000018256938,0.000034432873,0.00090949755,0.000600676,0.0027950516,0.97561604,0.0010209226,0.018404182],"study_design_scores_gemma":[0.0010257465,0.0006318713,0.01235822,0.0000936085,0.000017426859,0.00006964104,0.00015686124,0.2164334,0.14099069,0.6185604,0.009130306,0.00053186645],"about_ca_topic_score_codex":0.00001269741,"about_ca_topic_score_gemma":0.000009958867,"teacher_disagreement_score":0.67000955,"about_ca_system_score_codex":0.00003272093,"about_ca_system_score_gemma":0.00010170893,"threshold_uncertainty_score":0.25152653},"labels":[],"label_agreement":null},{"id":"W3217129437","doi":"","title":"On Regrouping Convergent Series into Absolutely Convergent Series","year":2021,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Series (stratigraphy); Convergent series; Alternating series; Mathematics; Counterexample; Subsequence; Absolute convergence; Conditional convergence; Monotone polygon; Convergent evolution; Convergence (economics); Discrete mathematics; Bounded function; Mathematical analysis; Power series","score_opus":0.019182391696088513,"score_gpt":0.24327156120217328,"score_spread":0.22408916950608476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217129437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08501707,0.00075775484,0.86477524,0.02317476,0.008875917,0.00056669896,0.0000064617693,0.0016055392,0.01522058],"genre_scores_gemma":[0.6722189,0.0002507423,0.30764592,0.004213694,0.00038788765,0.000074810145,0.000022485921,0.00005210827,0.015133414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970861,0.00018936367,0.00051521225,0.0010466604,0.000604194,0.0005584419],"domain_scores_gemma":[0.99768347,0.00018760342,0.000111846784,0.0014046391,0.00035670438,0.00025572377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040023893,0.00034473106,0.0003993006,0.000099040866,0.00029513147,0.0003635544,0.0009987422,0.000112993956,0.0008677695],"category_scores_gemma":[0.00018547426,0.00031933264,0.00018811936,0.000665681,0.0001517567,0.00092267554,0.0013642954,0.0002354338,0.00043715665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048067206,0.00044157146,0.0011729893,0.00014656091,0.00012242352,0.00039293454,0.003037215,0.0009262011,0.0018877945,0.95783025,0.010924023,0.023069976],"study_design_scores_gemma":[0.00246302,0.0021836273,0.021792902,0.00023115189,0.00005492859,0.0009205646,0.0019408966,0.14024135,0.22208723,0.42645463,0.17807412,0.0035555775],"about_ca_topic_score_codex":0.00011954656,"about_ca_topic_score_gemma":0.00023852228,"teacher_disagreement_score":0.58720183,"about_ca_system_score_codex":0.00021737361,"about_ca_system_score_gemma":0.0002778821,"threshold_uncertainty_score":0.99992585},"labels":[],"label_agreement":null},{"id":"W34543125","doi":"","title":"On Some Conjectures by Rabinowitz.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.005757502094319035,"score_gpt":0.21253766055134513,"score_spread":0.2067801584570261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34543125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9622906,0.0009256473,0.012304047,0.002791155,0.008752038,0.0006243298,0.0000123342015,0.0012761538,0.011023681],"genre_scores_gemma":[0.9967645,0.0000035847127,0.0019200897,0.0007472159,0.00003025386,0.000022823187,0.000009858357,0.000020136467,0.00048158455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977302,0.0001453309,0.0003339158,0.00073505635,0.0005354936,0.0005200012],"domain_scores_gemma":[0.9981954,0.000406863,0.00011108685,0.0010602478,0.000100726145,0.00012565262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003267299,0.0002925376,0.00030371457,0.00010980061,0.00018847422,0.00024237995,0.0013670898,0.00012950125,0.000031159165],"category_scores_gemma":[0.00007589287,0.00027074828,0.00012145561,0.0004230886,0.00010235224,0.0003751008,0.00037492212,0.00027417968,0.00022998145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046626383,0.0003243244,0.00042279818,0.000005967394,0.000008937754,0.000017053017,0.00004824552,0.00014316814,0.0003972133,0.94025713,0.05589093,0.0024795877],"study_design_scores_gemma":[0.0008624609,0.00026261594,0.0031055743,0.000008345197,0.0000043499635,0.00000926875,0.000002593949,0.005686763,0.0045633377,0.979902,0.0052519366,0.0003406996],"about_ca_topic_score_codex":0.00017659676,"about_ca_topic_score_gemma":0.0000046216446,"teacher_disagreement_score":0.050638992,"about_ca_system_score_codex":0.00014733373,"about_ca_system_score_gemma":0.00006796926,"threshold_uncertainty_score":0.9999745},"labels":[],"label_agreement":null},{"id":"W34927876","doi":"10.46298/dmtcs.618","title":"Surjective cellular automata far from the Garden of Eden","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"European Regional Development Fund; Academy of Finland","keywords":"Mathematics; Surjective function; Cellular automaton; Garden of Eden; Automaton; Von Neumann architecture; Measure (data warehouse); Discrete mathematics; Dimension (graph theory); Pure mathematics; Algorithm; Theoretical computer science; Computer science","score_opus":0.011880386457423038,"score_gpt":0.23743855476493883,"score_spread":0.2255581683075158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34927876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027915046,0.000058252037,0.96120423,0.0021695553,0.0006127911,0.0007732942,0.00001339584,0.00027552235,0.0069778846],"genre_scores_gemma":[0.6158844,0.0000029246514,0.3837527,0.00019906077,0.000111862035,0.000023183655,0.00000190689,0.000014208063,0.000009741989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531466,0.00029176543,0.0008043814,0.0011148266,0.0016548486,0.0008195264],"domain_scores_gemma":[0.9936586,0.0021963427,0.00030958996,0.0029343085,0.00058871426,0.00031245386],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021504879,0.0004107993,0.0005831873,0.00013267001,0.00046581766,0.0009930064,0.007722107,0.000102162754,0.0002917812],"category_scores_gemma":[0.00043507834,0.00025955614,0.00023589635,0.0012949145,0.004284853,0.0008022512,0.004431124,0.00035295382,0.0002628382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020324783,0.00018480507,0.000050374867,0.000024365478,0.000028697477,0.000006606136,0.0051149162,0.00015741168,0.0015728686,0.9823087,0.000162548,0.010386662],"study_design_scores_gemma":[0.00015044502,0.0001131031,0.00064563873,0.00004166449,0.000013313041,0.000009265443,0.00020894683,0.628412,0.0029856462,0.3671543,0.000026233613,0.00023945996],"about_ca_topic_score_codex":0.000048965696,"about_ca_topic_score_gemma":0.0000020807822,"teacher_disagreement_score":0.6282546,"about_ca_system_score_codex":0.00008041257,"about_ca_system_score_gemma":0.00018440117,"threshold_uncertainty_score":0.9999857},"labels":[],"label_agreement":null},{"id":"W35760216","doi":"10.1007/978-3-0348-7889-0_6","title":"The First Decimal of Some Irrational Numbers","year":2004,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Generality; Irrational number; Exploit; Decimal; Computer science; Section (typography); Arithmetic; Theoretical computer science; Mathematics; Psychology; Computer security; Geometry","score_opus":0.018295440130930502,"score_gpt":0.21674743818729472,"score_spread":0.1984519980563642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35760216","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026000096,0.0012682833,0.092798136,0.003158042,0.0041833874,0.0020158687,0.00014632805,0.000870402,0.89529955],"genre_scores_gemma":[0.078745514,0.00023104151,0.12843879,0.005334564,0.0043415627,0.0003510539,0.00009683729,0.00062161224,0.781839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964505,0.00004397118,0.0008869307,0.0009647421,0.0011279534,0.0005259279],"domain_scores_gemma":[0.9963522,0.0006987822,0.00051248,0.0018952108,0.00035827607,0.00018304985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065058924,0.0005963949,0.00055987685,0.00018877005,0.00046675248,0.00025530555,0.002598893,0.00038451335,0.00010939788],"category_scores_gemma":[0.00005920982,0.00047382442,0.00046647518,0.00004994005,0.0005741005,0.00021484128,0.0010525285,0.0005562932,0.0002016118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016163985,0.000034679608,0.00002644325,0.000048611415,0.00008790809,0.00003157144,0.00032319143,0.00012944546,0.0000068676404,0.9829712,0.0016211863,0.014702712],"study_design_scores_gemma":[0.00070396264,0.0001887135,0.0005086025,0.000184238,0.000045610348,0.0000501482,0.0000073933684,0.0033351572,0.00017838152,0.7231302,0.27084863,0.00081889826],"about_ca_topic_score_codex":0.00008393753,"about_ca_topic_score_gemma":0.00025312084,"teacher_disagreement_score":0.26922745,"about_ca_system_score_codex":0.00031257607,"about_ca_system_score_gemma":0.00095502875,"threshold_uncertainty_score":0.99977136},"labels":[],"label_agreement":null},{"id":"W388274778","doi":"","title":"Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation : ISSAC 2001, July 22-25, 2001, University of Western Ontario, London, Ontario, Canada","year":2001,"lang":"en","type":"book","venue":"ACM Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Algebraic number; Computation; History; Mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.018789880751041082,"score_gpt":0.20693256336067245,"score_spread":0.18814268260963138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W388274778","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07428864,0.00018986047,0.0032540734,0.0012232811,0.0036002519,0.0030103098,0.00021801796,0.00023848494,0.9139771],"genre_scores_gemma":[0.016407058,0.000047621415,0.0045080795,0.0004209923,0.00023520025,0.000010783704,0.000049524377,0.000064109336,0.97825664],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99656284,0.00006293323,0.0006402166,0.0010135985,0.0011607093,0.0005596991],"domain_scores_gemma":[0.9969145,0.00027941374,0.0009194206,0.0009191302,0.0007405345,0.0002269972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035519284,0.00054844236,0.000739635,0.0001528659,0.00017979524,0.000125384,0.0036892872,0.00032226453,0.00006226167],"category_scores_gemma":[0.000041940813,0.0005273443,0.00017896967,0.00007216913,0.0003130956,0.00024652766,0.0023905525,0.00079688063,0.0000023962766],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036532214,0.00077214336,0.034751926,0.0009482548,0.0015306271,0.00021614652,0.017868776,0.0019261607,0.00030701308,0.0122073265,0.9010279,0.02807838],"study_design_scores_gemma":[0.0026255052,0.0005508159,0.050085135,0.0011445456,0.00032542707,0.00019091724,0.000041565632,0.005687826,0.0005293321,0.013443969,0.9237873,0.0015876435],"about_ca_topic_score_codex":0.9129152,"about_ca_topic_score_gemma":0.9686527,"teacher_disagreement_score":0.06427955,"about_ca_system_score_codex":0.0022326398,"about_ca_system_score_gemma":0.0033378121,"threshold_uncertainty_score":0.99971783},"labels":[],"label_agreement":null},{"id":"W397664799","doi":"","title":"Unconventional computation and natural computation : 13th international conference, UCNC 2014, London, ON, Canada, July 14-18, 2014 : proceedings","year":2014,"lang":"en","type":"book","venue":"Springer eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Theoretical computer science; Cellular automaton; Quantum cellular automaton; Artificial neural network; Algorithm; Artificial intelligence","score_opus":0.015132685175558474,"score_gpt":0.23607742655262628,"score_spread":0.22094474137706782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W397664799","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001998073,0.00038904636,0.31158254,0.0020509933,0.013813942,0.0022707407,0.00013261294,0.0008936377,0.6668684],"genre_scores_gemma":[0.3321458,0.00003629405,0.06954028,0.0030261932,0.003906412,0.00019310313,0.0008531961,0.00027921284,0.5900195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99508613,0.000088489025,0.00093512295,0.0016307,0.0016623987,0.00059717864],"domain_scores_gemma":[0.99662244,0.00030326121,0.0008211992,0.00041001273,0.0015388778,0.0003041858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006883985,0.00078749325,0.0007394786,0.0004984142,0.00029754112,0.0007508414,0.0013926435,0.0003517594,0.00005883618],"category_scores_gemma":[0.0000578872,0.0008179413,0.0001914304,0.00008067474,0.00026755722,0.00030996278,0.00090561784,0.0010538761,0.00012292182],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087564695,0.00013183702,0.00052863196,0.00045087756,0.00042309758,0.0000655912,0.00055535854,0.001106293,0.00004530545,0.17482616,0.6923298,0.12944944],"study_design_scores_gemma":[0.002696283,0.00046605486,0.010935953,0.0007039513,0.00011045258,0.00019295269,0.000016022927,0.38278013,0.00012186115,0.1530761,0.44637775,0.0025224697],"about_ca_topic_score_codex":0.002841634,"about_ca_topic_score_gemma":0.010190859,"teacher_disagreement_score":0.38167384,"about_ca_system_score_codex":0.0010828557,"about_ca_system_score_gemma":0.0020881926,"threshold_uncertainty_score":0.99942714},"labels":[],"label_agreement":null},{"id":"W40109343","doi":"10.1007/978-0-387-09526-4_10","title":"Summary and Extensions","year":2008,"lang":"en","type":"book-chapter","venue":"Studies of organized crime","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"History; Computer science","score_opus":0.053323910088611134,"score_gpt":0.27642465326689075,"score_spread":0.2231007431782796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40109343","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012648564,0.26012215,0.012171141,0.0051306984,0.005345347,0.002279453,0.00012201674,0.0017065303,0.7118578],"genre_scores_gemma":[0.028373268,0.109597154,0.3064637,0.0020882722,0.0018712718,0.000040641928,0.0000404971,0.000511071,0.5510141],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976756,0.000038004328,0.0005949348,0.00088478933,0.000480704,0.00032594244],"domain_scores_gemma":[0.9971194,0.00053296064,0.00030144816,0.0011700543,0.00075351534,0.0001225982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002271463,0.00049701973,0.0011500577,0.00019912975,0.00026833144,0.000029704803,0.00088556216,0.00021128722,0.000045276727],"category_scores_gemma":[0.00027933306,0.00044176192,0.00017167907,0.00011508334,0.00073062023,0.00014935645,0.003043929,0.00035441274,0.000059195732],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080227874,0.00042500964,0.0001858779,0.0011448098,0.0038757925,0.0012287312,0.014485412,0.000007679101,0.0015630979,0.43017948,0.4308959,0.11592799],"study_design_scores_gemma":[0.004923394,0.002102451,0.005748055,0.001555289,0.00092025753,0.001307865,0.00055637985,0.00060403004,0.0024758242,0.4367944,0.537575,0.0054370556],"about_ca_topic_score_codex":0.000013690896,"about_ca_topic_score_gemma":0.0000063384286,"teacher_disagreement_score":0.29429254,"about_ca_system_score_codex":0.00008992161,"about_ca_system_score_gemma":0.0001508328,"threshold_uncertainty_score":0.9998034},"labels":[],"label_agreement":null},{"id":"W4200120603","doi":"10.1017/s0140525x21001199","title":"Representation of pure magnitudes in ANS","year":2021,"lang":"en","type":"article","venue":"Behavioral and Brain Sciences","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Representation (politics); Set (abstract data type); Magnitude (astronomy); Algebra over a field","score_opus":0.07965320060252366,"score_gpt":0.35549565861347804,"score_spread":0.27584245801095436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200120603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.991193,0.00021124723,0.005761994,0.0022610154,0.00014046014,0.00007638632,0.000001905946,0.000026917127,0.00032707598],"genre_scores_gemma":[0.969052,0.000009765999,0.03075344,0.0000904544,0.0000147824085,0.0000045224824,9.170596e-7,0.0000012053993,0.00007288453],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988191,0.00010232483,0.0001959318,0.00042029473,0.00029784138,0.00016447804],"domain_scores_gemma":[0.99950033,0.00012697023,0.0000517079,0.00020278207,0.00007418919,0.000043999593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004487795,0.00007032254,0.00014220318,0.00009012478,0.000079168785,0.00013072233,0.0004041214,0.00003133884,0.00001800396],"category_scores_gemma":[0.00007129436,0.000058218207,0.00003318323,0.0012743087,0.00026634778,0.00047298367,0.00032210254,0.000057394405,0.0000012327871],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025610318,0.00047303844,0.6151963,0.00002165546,0.0000016053971,0.00008357205,0.0031896739,0.00013033564,0.018748539,0.012334034,0.00013375327,0.34968495],"study_design_scores_gemma":[0.00034970653,0.00030621054,0.9454453,0.0000340688,0.000004645203,0.00006399924,0.0013274454,0.011384702,0.015732106,0.024994314,0.00012996847,0.00022751061],"about_ca_topic_score_codex":0.00018121747,"about_ca_topic_score_gemma":0.00040963985,"teacher_disagreement_score":0.34945744,"about_ca_system_score_codex":0.0000103056755,"about_ca_system_score_gemma":0.00008886337,"threshold_uncertainty_score":0.23740695},"labels":[],"label_agreement":null},{"id":"W4200619242","doi":"10.3390/e23121654","title":"Computational Creativity and Aesthetics with Algorithmic Information Theory","year":2021,"lang":"en","type":"article","venue":"Entropy","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Creativity; Information theory; Computer science; Aesthetics; Computational creativity; Cognitive science; Theoretical computer science; Epistemology; Artificial intelligence; Mathematics; Psychology; Art; Philosophy; Social psychology","score_opus":0.006430327249681775,"score_gpt":0.21441661805620973,"score_spread":0.20798629080652797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200619242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04297933,0.00009243478,0.9546801,0.0012740963,0.00012218858,0.000120424345,0.000005106208,0.00012819773,0.00059811206],"genre_scores_gemma":[0.5743784,0.000009489404,0.42505133,0.00043093463,0.000046116085,0.000009423855,0.0000189675,0.000005403263,0.00004997903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892205,0.00015936463,0.00017544688,0.00024313011,0.0003129814,0.00018701422],"domain_scores_gemma":[0.9990861,0.00022471107,0.00007446279,0.00031450498,0.00021497585,0.00008525588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027190312,0.00012531936,0.00014111088,0.000056137284,0.00010947545,0.00025512045,0.0002220737,0.000038122227,0.000027415306],"category_scores_gemma":[0.00005747222,0.00010616195,0.000029785117,0.00027454578,0.00009766149,0.00072434236,0.00023903883,0.000120283694,0.000032477445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020656595,0.00017854405,0.0047704643,0.000029469202,0.000039195635,0.000055919358,0.0031217586,0.009511609,0.000031547537,0.7183108,0.00019508749,0.26373497],"study_design_scores_gemma":[0.0010889833,0.00021755596,0.035227623,0.000019717792,0.000013572457,0.00041331656,0.00016385525,0.74151874,0.00055052224,0.21639031,0.0040699434,0.0003258621],"about_ca_topic_score_codex":0.000005600447,"about_ca_topic_score_gemma":0.0000016733604,"teacher_disagreement_score":0.73200715,"about_ca_system_score_codex":0.000049500464,"about_ca_system_score_gemma":0.00014158405,"threshold_uncertainty_score":0.43291587},"labels":[],"label_agreement":null},{"id":"W4205197728","doi":"10.1017/s0960129599002996","title":"Introduction","year":2000,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Honour; Wish; Philosophy of mathematics; Publication; Computer science; Classics; Library science; Art history; Philosophy; Epistemology; History; Sociology; Law; Political science; Anthropology","score_opus":0.009863122991491707,"score_gpt":0.24837482871686095,"score_spread":0.23851170572536926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205197728","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06643367,0.000026959218,0.9285145,0.0022158998,0.00084239,0.00023339827,4.972702e-7,0.00027502252,0.0014576946],"genre_scores_gemma":[0.4455479,0.0000020478906,0.5535614,0.00032204934,0.000508252,0.000008736505,3.6814683e-7,0.0000065976747,0.00004267105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967767,0.000086381064,0.00047875845,0.0011090653,0.0008853116,0.0006637631],"domain_scores_gemma":[0.9981365,0.00017239225,0.000059517002,0.0013404073,0.000092884104,0.00019825126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010645947,0.00023792608,0.00029072838,0.00025063544,0.00022344809,0.00058849924,0.003003078,0.000057512338,0.0007854313],"category_scores_gemma":[0.00010477742,0.00019371764,0.00006870648,0.0019132005,0.0006488321,0.000960745,0.0007469085,0.00026443193,0.00022184668],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027802832,0.00009594218,0.00011592534,0.000017109052,0.000001858878,0.00002377031,0.0004672216,0.006821682,0.00009445456,0.19541524,0.000312511,0.7966315],"study_design_scores_gemma":[0.00013132815,0.000039235012,0.005786009,0.000007328328,9.286775e-7,0.00014691395,0.0000015687867,0.5813419,0.00037620272,0.41120923,0.0007767548,0.00018256721],"about_ca_topic_score_codex":0.0000082557335,"about_ca_topic_score_gemma":0.000002120572,"teacher_disagreement_score":0.79644895,"about_ca_system_score_codex":0.00017106597,"about_ca_system_score_gemma":0.00010052057,"threshold_uncertainty_score":0.8599922},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; History","score_opus":0.014250909123641896,"score_gpt":0.24679334845723508,"score_spread":0.23254243933359317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206167679","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002562715,0.0001305818,0.6061915,0.00024280784,0.00012940618,0.00018070098,0.000044067343,0.00015704738,0.39289823],"genre_scores_gemma":[0.002125169,0.000034953628,0.25695348,0.00054362405,0.00013989302,0.000028017243,0.0002084001,0.00002747953,0.739939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975651,0.00019611888,0.00046693644,0.0009616493,0.00049650716,0.00031369028],"domain_scores_gemma":[0.9972627,0.0015850484,0.000142226,0.00073642464,0.00012631356,0.00014729888],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00050391525,0.00033554703,0.00059953635,0.0006254144,0.00008891807,0.00019150134,0.0008985074,0.00025375542,0.00573521],"category_scores_gemma":[0.000054560605,0.00031018,0.00023731081,0.0009454166,0.00017044191,0.00021594421,0.00083116617,0.00041050286,0.0002920193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004155173,0.00032887774,0.00276828,0.000051674375,0.0006685326,0.00012602739,0.00088983343,0.009629378,9.730202e-8,0.76732,0.09883338,0.119379774],"study_design_scores_gemma":[0.00019089413,0.000021079939,0.007715664,0.000022740014,0.00009591037,0.00002636271,0.0000055137757,0.39631686,1.6755156e-7,0.5790078,0.016165249,0.0004317868],"about_ca_topic_score_codex":0.000026758333,"about_ca_topic_score_gemma":0.00008884935,"teacher_disagreement_score":0.38668746,"about_ca_system_score_codex":0.00020940983,"about_ca_system_score_gemma":0.00017964699,"threshold_uncertainty_score":0.99993503},"labels":[],"label_agreement":null},{"id":"W4206782122","doi":"10.1017/9781108912181","title":"The Discrete Mathematical Charms of Paul Erdős","year":2021,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Ramsey theory; De Bruijn sequence; Mathematics; Ramsey's theorem; Combinatorics; Friendship; Discrete mathematics; Mathematical economics; Sociology","score_opus":0.018028499819879546,"score_gpt":0.20749744283131755,"score_spread":0.189468943011438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206782122","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004546307,0.00033054076,0.18352753,0.00013248429,0.00051839906,0.00049752946,0.000101546655,0.00018175632,0.8146647],"genre_scores_gemma":[0.00029992333,0.00006659157,0.0042685303,0.00003782291,0.00015129232,0.0000019231427,0.000022709632,0.000028485267,0.99512273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973028,0.0002534673,0.00040804117,0.0008467602,0.00069894834,0.00049002806],"domain_scores_gemma":[0.9960862,0.0007530625,0.00038938847,0.0021782997,0.0003793155,0.00021372484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004227863,0.00043030447,0.0006765701,0.00010389693,0.00035203504,0.00019137318,0.0034608776,0.00031624353,0.0000031314464],"category_scores_gemma":[0.00006713285,0.0003661645,0.00045753832,0.00005658659,0.0006445649,0.00014775715,0.0036602549,0.00064735406,0.000013141626],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013103956,0.000031822125,9.4133964e-7,0.0002015316,0.00014248493,0.00028505933,0.000163701,0.000006995181,0.000016409354,0.9512571,0.042757493,0.0051233387],"study_design_scores_gemma":[0.00058947457,0.00011849609,0.000040925283,0.00031478226,0.00016430052,0.00008970986,0.00007767264,0.0144636845,0.00074104045,0.00170237,0.9809256,0.0007719142],"about_ca_topic_score_codex":0.000021370717,"about_ca_topic_score_gemma":0.0000016791066,"teacher_disagreement_score":0.94955474,"about_ca_system_score_codex":0.00031847224,"about_ca_system_score_gemma":0.00064841023,"threshold_uncertainty_score":0.999879},"labels":[],"label_agreement":null},{"id":"W4210692990","doi":"10.1016/j.jpaa.2009.12.028","title":"Categorical simulations","year":2010,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Base (topology); Categorical variable; Fibration; Mathematics; Monad (category theory); Computability; Realizability; Algebra over a field; Functor; Discrete mathematics; Pure mathematics; Algorithm","score_opus":0.011854285730811265,"score_gpt":0.24276377244015318,"score_spread":0.23090948670934192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210692990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5937865,0.00008395073,0.40165406,0.002251395,0.00077605475,0.000104095816,9.46691e-7,0.000042134423,0.0013008843],"genre_scores_gemma":[0.9577047,0.0000037630923,0.041603066,0.00019913692,0.00046402583,8.2855354e-7,3.1974312e-7,0.0000049656146,0.00001916348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905425,0.000017503076,0.00032178784,0.00016998911,0.00026648538,0.00016997813],"domain_scores_gemma":[0.99912333,0.00017388481,0.00017384687,0.00024688686,0.000113781294,0.00016828754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003075092,0.000106921456,0.00020232161,0.00010091826,0.000102381295,0.00015306455,0.0004991422,0.00008010644,0.00003367119],"category_scores_gemma":[0.000038663813,0.00008128004,0.00006485415,0.00024228996,0.000052523148,0.00022786386,0.00016979406,0.0004723571,0.000008944624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012644415,0.00029029985,0.0011187115,0.000014216445,0.000044680626,0.000045026398,0.0008855612,0.00072006014,0.021481816,0.8054425,0.0015293215,0.16841517],"study_design_scores_gemma":[0.001302167,0.00027317964,0.023983553,0.000006388854,0.000041694355,0.0008533814,0.00007029685,0.035995785,0.0040981816,0.91552967,0.017394302,0.00045140387],"about_ca_topic_score_codex":0.0000011435043,"about_ca_topic_score_gemma":0.0000066820417,"teacher_disagreement_score":0.36391827,"about_ca_system_score_codex":0.000012196583,"about_ca_system_score_gemma":0.00007017571,"threshold_uncertainty_score":0.3314504},"labels":[],"label_agreement":null},{"id":"W4210852355","doi":"10.5948/upo9781614445180","title":"Mathematical Fallacies, Flaws, and Flimflam","year":2000,"lang":"en","type":"book","venue":"MAA spectrum","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Epistemology; Philosophy; Mathematical economics; Mathematics","score_opus":0.00913653424467434,"score_gpt":0.2040316027830562,"score_spread":0.19489506853838187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210852355","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013256766,0.001343589,0.11901152,0.002614956,0.0006436209,0.0006734564,0.00002062339,0.00086991413,0.87468976],"genre_scores_gemma":[0.0009245797,0.0002635969,0.057534613,0.0003954271,0.0011512922,0.000033677865,0.000028970759,0.00010295409,0.9395649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967149,0.000084937376,0.0005547095,0.0012533173,0.00068645645,0.0007057113],"domain_scores_gemma":[0.9976161,0.00027811437,0.00015121962,0.0016518477,0.000035631983,0.0002670445],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003685528,0.0006089961,0.00078417204,0.00021913277,0.00020527386,0.0004916131,0.0017486339,0.00046551033,0.0011326444],"category_scores_gemma":[0.000031289605,0.0005722996,0.00020918778,0.00018976834,0.0002979929,0.0001858874,0.0011611754,0.0007602161,0.0009981787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012738972,0.00020599207,0.000034957706,0.00038935864,0.00011975653,0.000426619,0.000664303,0.000024007084,0.000004812317,0.7618272,0.06251716,0.17377315],"study_design_scores_gemma":[0.00022496632,0.00016021829,0.0002005811,0.00007986133,0.00002463261,0.00027657824,0.0000024280346,0.0127229,0.000019992583,0.63055277,0.35509586,0.0006392223],"about_ca_topic_score_codex":0.00001618364,"about_ca_topic_score_gemma":0.000022835016,"teacher_disagreement_score":0.2925787,"about_ca_system_score_codex":0.0003315889,"about_ca_system_score_gemma":0.00033122775,"threshold_uncertainty_score":0.9997805},"labels":[],"label_agreement":null},{"id":"W4211253285","doi":"10.1017/9781108164085.015","title":"Ontologies and Knowledge-Based Systems","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Appeal; Artificial intelligence; Comprehension; Graduate students; Space (punctuation); Data science; Psychology; Pedagogy","score_opus":0.03935271268286718,"score_gpt":0.2216746414403259,"score_spread":0.18232192875745873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211253285","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033742555,0.0011820272,0.0755599,0.000036323123,0.0011155831,0.0005804954,0.00007095176,0.00051846844,0.9209025],"genre_scores_gemma":[0.004792882,0.000050737828,0.0021064256,0.000020930976,0.00015675709,0.000001771405,0.000009445427,0.000030222323,0.9928308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978054,0.00010417359,0.00024353663,0.0011311773,0.0003049821,0.00041069515],"domain_scores_gemma":[0.9966072,0.00029064468,0.00039499946,0.0021285557,0.00033223728,0.00024638057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027085643,0.00053739024,0.00070467003,0.00025581502,0.0005124425,0.00048120122,0.0026749729,0.00049201987,6.800604e-7],"category_scores_gemma":[0.00003498643,0.000591749,0.00020878106,0.000006880428,0.0006332135,0.00024319334,0.0023581465,0.0005096988,0.000017012862],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018185498,0.000018609726,0.000008196817,0.00023448573,0.00008159289,0.00036785158,0.00006938916,0.00001642124,0.0000056176414,0.9807322,0.0061519328,0.012295516],"study_design_scores_gemma":[0.000725427,0.00013015041,0.00011900666,0.0002750288,0.00009739865,0.000048102273,0.000011152851,0.02096449,0.000060734466,0.00010048309,0.97665805,0.00080998294],"about_ca_topic_score_codex":0.0003236222,"about_ca_topic_score_gemma":0.000014003717,"teacher_disagreement_score":0.9806317,"about_ca_system_score_codex":0.00028935604,"about_ca_system_score_gemma":0.00038264127,"threshold_uncertainty_score":0.9996534},"labels":[],"label_agreement":null},{"id":"W4214554261","doi":"10.1007/978-0-387-49820-1_2","title":"Algorithmic Complexity","year":2008,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Object (grammar); Relation (database); Computer science; Set (abstract data type); Natural (archaeology); Theoretical computer science; Artificial intelligence; Data mining; Programming language; Geography","score_opus":0.05226382313319368,"score_gpt":0.2685506780166978,"score_spread":0.21628685488350413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214554261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015405707,0.0006353733,0.9075012,0.00063903834,0.004165111,0.00089698733,0.000015890375,0.0008482638,0.08514408],"genre_scores_gemma":[0.009791229,0.0002537738,0.9679504,0.0012918771,0.0013200918,0.00003010798,0.00001117338,0.00009738029,0.019253936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99157447,0.000087762906,0.001194464,0.0033405577,0.0023741452,0.0014286044],"domain_scores_gemma":[0.9942835,0.00036829087,0.00049943896,0.0038096497,0.00052519137,0.000513907],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017166731,0.0009990546,0.0011432257,0.0014807038,0.0006041459,0.00067362195,0.010349408,0.00040444033,0.00010593162],"category_scores_gemma":[0.000049622933,0.0010181575,0.00031920263,0.0011373528,0.0034574526,0.0013460948,0.0067250174,0.0013418065,0.0007005659],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045795086,0.00019172547,0.00004830925,0.00005058085,0.000019464,0.0008658989,0.0010051061,0.0014177193,0.0000121969,0.20862103,0.0031692996,0.7845941],"study_design_scores_gemma":[0.0006433961,0.00033135654,0.0021439032,0.00025180873,0.0000075467474,0.00079376827,8.352683e-7,0.7419393,0.00006543618,0.21081574,0.04119344,0.001813443],"about_ca_topic_score_codex":0.00007030862,"about_ca_topic_score_gemma":0.00005208934,"teacher_disagreement_score":0.78278065,"about_ca_system_score_codex":0.0009934587,"about_ca_system_score_gemma":0.0013695611,"threshold_uncertainty_score":0.9992546},"labels":[],"label_agreement":null},{"id":"W4220973990","doi":"10.24251/hicss.2022.628","title":"Introduction to the Minitrack on Design and Appropriation of Knowledge and AI Systems","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ... Annual Hawaii International Conference on System Sciences/Proceedings of the Annual Hawaii International Conference on System Sciences","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Appropriation; Computer science; Knowledge management; Epistemology","score_opus":0.043091751378657964,"score_gpt":0.285396409401819,"score_spread":0.24230465802316103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220973990","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1479792,0.00018744136,0.0048529753,0.058640502,0.0154866045,0.005489775,0.00071952544,0.0003425833,0.7663014],"genre_scores_gemma":[0.9970639,0.00001709159,0.0013258668,0.00014021523,0.0005230449,0.00024801484,0.0000016755819,0.000020414753,0.000659783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99147946,0.00021111393,0.0015782963,0.0017615573,0.0043592374,0.00061036495],"domain_scores_gemma":[0.99112433,0.0004510999,0.0023008983,0.00043498687,0.0054891054,0.00019957779],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.008042189,0.0006040137,0.00078565726,0.0009422925,0.0015574683,0.0010835114,0.009493773,0.00014786422,0.000022239594],"category_scores_gemma":[0.00022688591,0.0003736503,0.0002453578,0.002277535,0.0015811538,0.00185555,0.003034647,0.0006467881,0.000012539768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015987118,0.00020517451,0.0011856827,0.00020080246,0.000068666064,3.4159766e-7,0.0046986835,0.0022975623,0.0008267534,0.9868052,0.0022821557,0.0012690973],"study_design_scores_gemma":[0.00136153,0.0049746693,0.006487636,0.0030803615,0.000089884394,0.0005277879,0.8834863,0.08522932,0.0031044253,0.007586801,0.0028176282,0.0012536639],"about_ca_topic_score_codex":0.00021002593,"about_ca_topic_score_gemma":0.0000058103433,"teacher_disagreement_score":0.9792184,"about_ca_system_score_codex":0.00054788636,"about_ca_system_score_gemma":0.0005251898,"threshold_uncertainty_score":0.99995345},"labels":[],"label_agreement":null},{"id":"W4229581165","doi":"10.1007/978-3-030-11298-1_6","title":"The Incompressibility Method","year":2019,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Argument (complex analysis); Pigeonhole principle; Property (philosophy); Probabilistic logic; Mathematics; Object (grammar); Calculus (dental); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Philosophy; Epistemology; Statistics; Chemistry","score_opus":0.025624309488967687,"score_gpt":0.297116307488622,"score_spread":0.2714919979996543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229581165","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056873025,0.00060198235,0.9112429,0.0008378771,0.005260014,0.000994839,0.000005439354,0.000369508,0.080630556],"genre_scores_gemma":[0.006690082,0.00008284596,0.94634056,0.0009931212,0.00075474795,0.000028656963,0.0000026947055,0.000070565875,0.04503674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922224,0.00023389109,0.0011452676,0.0030814554,0.0021060498,0.001210879],"domain_scores_gemma":[0.9904304,0.0023064527,0.00055137835,0.0059038317,0.000514223,0.0002937131],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.007223103,0.0007658625,0.00085456163,0.00057333795,0.0007076173,0.0015043071,0.013887141,0.00033248734,0.000035061294],"category_scores_gemma":[0.00012927181,0.00056577026,0.0002885485,0.0008309851,0.0016127662,0.0010505671,0.009956268,0.0013487231,0.00043705342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040025834,0.000044682194,0.000058744175,0.000027043447,0.000009830647,0.00003532768,0.0002527863,0.002231828,0.0000087097815,0.3136184,0.00039967214,0.68330896],"study_design_scores_gemma":[0.00026311819,0.00014766835,0.001866321,0.00012957968,0.000005467698,0.00006321367,9.4547255e-7,0.6445587,0.000054740212,0.3186133,0.033566065,0.00073083944],"about_ca_topic_score_codex":0.00004398737,"about_ca_topic_score_gemma":0.00007750284,"teacher_disagreement_score":0.68257815,"about_ca_system_score_codex":0.0007343382,"about_ca_system_score_gemma":0.001669327,"threshold_uncertainty_score":0.9996794},"labels":[],"label_agreement":null},{"id":"W4230219052","doi":"10.1007/978-3-642-38986-3","title":"Reversible Computation","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of New Brunswick","funders":"","keywords":"Computer science","score_opus":0.016879001587677477,"score_gpt":0.24909641908318278,"score_spread":0.2322174174955053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230219052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000105003644,0.00041545954,0.9876189,0.0011409308,0.0043809125,0.0009343869,0.000004317383,0.00053395174,0.0048661153],"genre_scores_gemma":[0.015399339,0.000023490606,0.9798587,0.0018482754,0.0010224376,0.00003267382,0.000020153462,0.00005392408,0.0017410193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932087,0.0001694639,0.0008641498,0.0027681284,0.0017649729,0.0012245497],"domain_scores_gemma":[0.9951977,0.0011482143,0.0004629398,0.0021808273,0.00066653185,0.00034380276],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015116087,0.00080789445,0.00087465026,0.0013523014,0.00038554883,0.0013854562,0.006323547,0.0005136184,0.000045521716],"category_scores_gemma":[0.0002126769,0.00077465625,0.00023179388,0.0025411292,0.00094297447,0.0015102623,0.0036583038,0.001278049,0.00043244672],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002321566,0.00009670705,0.00007289996,0.00009252551,0.000013297952,0.00009041246,0.00065368594,0.10194183,0.00004728225,0.0024013198,0.0020726554,0.89251506],"study_design_scores_gemma":[0.00026880018,0.0001791578,0.0003268043,0.00018129864,0.000006241538,0.00007654505,1.4088499e-7,0.7510139,0.00024751434,0.2452601,0.0016869352,0.0007525716],"about_ca_topic_score_codex":0.0000819652,"about_ca_topic_score_gemma":0.000046236957,"teacher_disagreement_score":0.8917625,"about_ca_system_score_codex":0.0014574364,"about_ca_system_score_gemma":0.002227916,"threshold_uncertainty_score":0.9996512},"labels":[],"label_agreement":null},{"id":"W4230322898","doi":"10.1007/978-3-319-74451-3_9","title":"Frames","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Process (computing); Topology (electrical circuits); Computer science; Combinatorics; Programming language","score_opus":0.02262512651767817,"score_gpt":0.2526835291389985,"score_spread":0.23005840262132032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230322898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002920094,0.0004894798,0.8951279,0.00048858946,0.0007310965,0.00041614013,0.000006734491,0.00030474446,0.10240613],"genre_scores_gemma":[0.0019112477,0.000047156318,0.9820099,0.0006092996,0.00075668195,0.00001605126,0.0000084613785,0.000102266415,0.014538953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745363,0.000030080202,0.00066227606,0.00080345036,0.0006138441,0.0004367331],"domain_scores_gemma":[0.9962006,0.0012532724,0.00033219063,0.0019461146,0.0001706121,0.00009719165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045691192,0.0005846871,0.00076564576,0.0002842976,0.00007062901,0.00021554384,0.001995581,0.0007290108,0.0006001251],"category_scores_gemma":[0.00050048035,0.0005063576,0.0002213796,0.00014763224,0.00021032426,0.000116698044,0.0009313367,0.0008463343,0.0006047554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005581902,0.00034820777,0.00003530808,0.0012030625,0.0001712737,0.00023828361,0.012850165,0.0010692887,0.000032170403,0.8334953,0.0027440211,0.14780731],"study_design_scores_gemma":[0.000109297005,0.00009136897,0.0000052355886,0.0002784645,0.00001628384,0.00004795077,0.0000013140551,0.05315902,0.00013786915,0.9344333,0.011212188,0.0005077166],"about_ca_topic_score_codex":0.0000039602314,"about_ca_topic_score_gemma":0.00004654017,"teacher_disagreement_score":0.1472996,"about_ca_system_score_codex":0.000177823,"about_ca_system_score_gemma":0.00012059175,"threshold_uncertainty_score":0.9997388},"labels":[],"label_agreement":null},{"id":"W4230512696","doi":"10.36227/techrxiv.12902687","title":"Robot Consciousness: Physics and Metaphysics Here and Abroad","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CTS Forex (Canada)","funders":"","keywords":"Metaphysics; Consciousness; Robot; Epistemology; Cognitive science; Theoretical physics; Physics; Artificial intelligence; Philosophy; Computer science; Psychology","score_opus":0.032661669129739626,"score_gpt":0.2756112679494894,"score_spread":0.2429495988197498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230512696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008008827,0.0011982779,0.9827924,0.0038638369,0.00078328035,0.00059841864,0.000016859496,0.00066167384,0.0020764212],"genre_scores_gemma":[0.6371757,0.00021742289,0.3610713,0.00089460606,0.000385826,0.000049351565,0.000014078678,0.00003966749,0.00015210862],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699914,0.000154055,0.00039132225,0.0016618746,0.00041801156,0.00037562035],"domain_scores_gemma":[0.99783444,0.0002482204,0.00020183,0.001251117,0.00017762603,0.0002867526],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00024496973,0.00053719134,0.0008074048,0.000050348102,0.00013495666,0.00079740456,0.0012560003,0.00022909476,0.000010203145],"category_scores_gemma":[0.000045328336,0.0004912975,0.00015509191,0.0003049738,0.00036035996,0.0003078517,0.008448772,0.000743843,0.000020327714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013945184,0.0004428353,0.004567801,0.0014511409,0.00057025853,0.00011917544,0.004633536,0.0046040695,0.0004912408,0.33518,0.0022484015,0.64567757],"study_design_scores_gemma":[0.00034271213,0.000084206134,0.0040617217,0.00004754525,0.000059601374,0.000021595726,0.00005839787,0.4407746,0.00043056108,0.5527463,0.0005952306,0.00077755464],"about_ca_topic_score_codex":0.0001917268,"about_ca_topic_score_gemma":0.00003071686,"teacher_disagreement_score":0.6449,"about_ca_system_score_codex":0.00004693269,"about_ca_system_score_gemma":0.00019643977,"threshold_uncertainty_score":0.9997539},"labels":[],"label_agreement":null},{"id":"W4230775177","doi":"10.1090/ulect/070/10","title":"Strong orbit equivalence","year":2018,"lang":"en","type":"book-chapter","venue":"University lecture series","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orbit (dynamics); Equivalence (formal languages); Astronomy; Geodesy; Astrobiology; Physics; Mathematics; Geology; Pure mathematics; Aerospace engineering; Engineering","score_opus":0.014301011338042968,"score_gpt":0.1904465949886565,"score_spread":0.17614558365061353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230775177","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006561655,0.00029689042,0.48215237,0.0009803608,0.0011302794,0.00030703616,0.00004434999,0.0006825701,0.5143405],"genre_scores_gemma":[0.0047196727,0.0002539835,0.08700617,0.00029899844,0.00092832773,4.216036e-7,0.0000409901,0.0000663559,0.90668505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786335,0.00004759154,0.00018149908,0.0009992179,0.00047237126,0.00043597296],"domain_scores_gemma":[0.9979194,0.00009898512,0.00019320665,0.0012880577,0.00033007425,0.00017027384],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013632725,0.00048994843,0.00045012165,0.0002636155,0.00036474277,0.00016034061,0.0023451862,0.00043418596,0.0012270985],"category_scores_gemma":[0.000026413518,0.00052449806,0.00023329546,0.00014747145,0.0005474628,0.00069703005,0.0018339043,0.00055911945,0.00035252553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053613876,0.000032308573,0.000023118711,0.00009678326,0.0001696348,0.00053487555,0.0020783439,0.00013513949,0.000027366228,0.96850175,0.009823641,0.018523445],"study_design_scores_gemma":[0.00020237341,0.00037823425,0.000052628104,0.00008972884,0.000040502906,0.000091991955,0.000036306283,0.0007868913,0.00011598266,0.11604646,0.88136035,0.0007985801],"about_ca_topic_score_codex":0.000027922062,"about_ca_topic_score_gemma":0.00022346622,"teacher_disagreement_score":0.8715367,"about_ca_system_score_codex":0.00035376867,"about_ca_system_score_gemma":0.00029648424,"threshold_uncertainty_score":0.99972063},"labels":[],"label_agreement":null},{"id":"W4231253503","doi":"10.1093/phimat/nks003","title":"GIOVANNI SOMMARUGA, ed., Foundational Theories of Classical and Constructive Mathematics","year":2012,"lang":"en","type":"article","venue":"Philosophia Mathematica","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Constructive; Series (stratigraphy); Mathematics education; Calculus (dental); Mathematics; Epistemology; Philosophy; Computer science; Programming language; Medicine; Process (computing)","score_opus":0.024334557663057917,"score_gpt":0.26458406017448544,"score_spread":0.24024950251142752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231253503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04212622,0.0005957352,0.92457354,0.006037169,0.0006337302,0.00074593496,0.000025622181,0.00030077779,0.02496129],"genre_scores_gemma":[0.6379178,0.000008119982,0.36173475,0.000060387545,0.00021784788,0.000024093468,0.0000019603435,0.000013962385,0.000021040716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979412,0.000104514926,0.0006170017,0.0003545817,0.0005756721,0.00040705744],"domain_scores_gemma":[0.9971791,0.0013312126,0.00029557635,0.0007835909,0.00020698323,0.000203563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087848,0.00027667158,0.0005285371,0.00012555359,0.00014146327,0.00010032843,0.0006804492,0.0000980754,0.000092445276],"category_scores_gemma":[0.00047183072,0.00022997132,0.000120453304,0.00026996218,0.0007433183,0.00077865244,0.0007048078,0.0001812696,0.00007706036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003798275,0.00043271223,0.00028238818,0.00019258278,0.000052888932,0.0000012452796,0.0024136803,0.000001685984,0.00009866551,0.99390364,0.00007275171,0.002543975],"study_design_scores_gemma":[0.00027917654,0.0000662527,0.0006916053,0.000051388863,0.000031447475,0.00016417776,0.00012287406,0.015115062,0.00047903883,0.982603,0.00015430225,0.00024163853],"about_ca_topic_score_codex":0.0000013207765,"about_ca_topic_score_gemma":2.2825796e-7,"teacher_disagreement_score":0.59579164,"about_ca_system_score_codex":0.000048398848,"about_ca_system_score_gemma":0.00007524982,"threshold_uncertainty_score":0.9377958},"labels":[],"label_agreement":null},{"id":"W4232341497","doi":"10.1007/978-1-4471-5102-9_154-1","title":"Information and Communication Complexity of Networked Control Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Systems and Control","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Control (management); Computer science; Distributed computing; Artificial intelligence","score_opus":0.012552799351905489,"score_gpt":0.20309302073552513,"score_spread":0.19054022138361965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232341497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004393058,0.020091413,0.8383401,0.000281289,0.0014910139,0.002939278,0.00017985736,0.00014615143,0.13609158],"genre_scores_gemma":[0.99335164,0.0014558536,0.0010001634,0.000057170637,0.00027664495,0.00006994593,0.00003191073,0.000022406737,0.0037342703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972126,0.00025360181,0.0014824271,0.00031576454,0.00048973976,0.0002458619],"domain_scores_gemma":[0.99581933,0.0006802998,0.0016734992,0.0011334085,0.00054938946,0.00014409657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013318261,0.0003896743,0.0013697683,0.00019559056,0.00011645838,0.00015950386,0.000753206,0.00034165021,0.000003893224],"category_scores_gemma":[0.00005822703,0.00034912972,0.000120180106,0.00005680912,0.0003995223,0.000402792,0.00025439647,0.00028413467,0.0000055647038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048830992,0.000025423562,0.0004628489,0.0013062763,0.00022564743,0.0000010211709,0.0006575041,0.0018040874,0.000004879195,0.9639839,0.00054496113,0.030934649],"study_design_scores_gemma":[0.0044539375,0.0005022992,0.0018871818,0.0011523386,0.00021020259,0.00006049729,0.000092891874,0.80070627,5.681366e-7,0.013448008,0.17671303,0.000772795],"about_ca_topic_score_codex":0.00064982777,"about_ca_topic_score_gemma":0.000021399852,"teacher_disagreement_score":0.99291235,"about_ca_system_score_codex":0.000047440182,"about_ca_system_score_gemma":0.00009004778,"threshold_uncertainty_score":0.99989605},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Factorization; Algorithm","score_opus":0.023363374793448032,"score_gpt":0.23605306605213502,"score_spread":0.212689691258687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232449914","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023780924,0.000048755737,0.55042416,0.00016539743,0.0011957838,0.00014530146,0.0000043434916,0.0004051236,0.4476088],"genre_scores_gemma":[0.0010192784,0.000020779116,0.10774735,0.00037441138,0.0012288471,0.000005074552,0.000033120334,0.000047062425,0.88952404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981653,0.000018961535,0.00033687675,0.0007958699,0.00044833918,0.00023462676],"domain_scores_gemma":[0.99819046,0.00010089798,0.00016263562,0.0011787368,0.0002578085,0.00010943159],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016965673,0.00036589833,0.00032215076,0.0001654795,0.00009168504,0.00022338908,0.0013615186,0.00028540642,0.002630364],"category_scores_gemma":[0.00002739398,0.0003070199,0.00015539068,0.00006236887,0.00008888709,0.00026696085,0.00087113614,0.00021289436,0.0014072206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012419652,0.000019937586,0.000033712262,0.000022764325,0.00003154094,0.000009612084,0.00017425448,0.000008529754,0.000007978373,0.8685056,0.007316001,0.12386883],"study_design_scores_gemma":[0.000113774426,0.0001408129,0.00014257181,0.00002245072,0.000011501618,0.000018581793,6.132674e-7,0.04775127,0.000043954213,0.63820815,0.3129553,0.0005910123],"about_ca_topic_score_codex":0.000019561343,"about_ca_topic_score_gemma":0.000029031362,"teacher_disagreement_score":0.44267678,"about_ca_system_score_codex":0.00009840725,"about_ca_system_score_gemma":0.000073627685,"threshold_uncertainty_score":0.9999382},"labels":[],"label_agreement":null},{"id":"W4232679453","doi":"10.1017/cbo9781107477971.002","title":"On Negativity","year":2014,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Psyche; Negativity effect; Mass media; Political science; Psychology; Psychoanalysis; Media studies; Law; Sociology; Social psychology","score_opus":0.020885190631016848,"score_gpt":0.19299152942027065,"score_spread":0.1721063387892538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232679453","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004555543,0.000019102761,0.24158545,0.00005145105,0.0005902381,0.00035931668,0.000042258253,0.00045690482,0.7568497],"genre_scores_gemma":[0.002831211,0.000009396673,0.0030120944,0.00024080918,0.00019519583,7.5763296e-7,0.000010851269,0.00003893254,0.99366075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973393,0.00013171099,0.0002423621,0.0012618273,0.0005780963,0.00044670302],"domain_scores_gemma":[0.99666613,0.00045498545,0.00029824217,0.002064044,0.00022335703,0.00029324865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027117803,0.0005782685,0.0006162222,0.00026811953,0.00026572295,0.00015691307,0.0025152783,0.00043862037,0.0000052267687],"category_scores_gemma":[0.000035447032,0.00066242734,0.00035932267,0.000019715344,0.00029339103,0.00013761925,0.0019246219,0.0007820029,0.00010989692],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018447301,0.000017002269,6.556313e-7,0.00003886968,0.000050881343,0.00017830248,0.00002889961,0.000029476681,0.000004720598,0.96385974,0.017936723,0.017836278],"study_design_scores_gemma":[0.0005821281,0.0002433402,0.00004415781,0.000116986725,0.0000564661,0.00002285593,0.0000016022103,0.008866443,0.00017056613,0.0013830077,0.98763543,0.0008770038],"about_ca_topic_score_codex":0.00008940591,"about_ca_topic_score_gemma":0.0000028499944,"teacher_disagreement_score":0.9696987,"about_ca_system_score_codex":0.00037829933,"about_ca_system_score_gemma":0.00014422435,"threshold_uncertainty_score":0.9995827},"labels":[],"label_agreement":null},{"id":"W4233097777","doi":"10.1017/9781316759745.002","title":"Ontic Pancomputationalism","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Ontic; Sociology; Philosophy; Epistemology","score_opus":0.025005741948742055,"score_gpt":0.2030907150289784,"score_spread":0.17808497308023635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233097777","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000537667,0.00008024795,0.22895502,0.00005353197,0.0009843326,0.00039229382,0.000064550746,0.00049929705,0.76891696],"genre_scores_gemma":[0.0005650925,0.000014429051,0.01619022,0.00017883365,0.0004608879,8.6686345e-7,0.000032054173,0.000042667427,0.982515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997285,0.000083242776,0.00032189814,0.0012249327,0.0006323541,0.00045254876],"domain_scores_gemma":[0.99717003,0.00021527994,0.0003300469,0.0014690012,0.00053640344,0.00027924927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022200085,0.0005441088,0.000552299,0.00029966838,0.00028561516,0.00020035905,0.0025100592,0.0004150442,0.000016886408],"category_scores_gemma":[0.000017202092,0.00065319793,0.00034882585,0.000027441567,0.00042263741,0.00026537033,0.002140182,0.00050763064,0.00016685402],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010779889,0.000017781515,0.0000011732704,0.00004620722,0.00009852973,0.00028646173,0.00012281457,0.000019767389,0.0000035374512,0.9561397,0.03779691,0.0054563396],"study_design_scores_gemma":[0.00052309845,0.000119282224,0.000071662944,0.00010450291,0.000084557745,0.00006384681,0.0000061510586,0.0114979,0.000053137617,0.0018123087,0.9848442,0.00081934256],"about_ca_topic_score_codex":0.00008346608,"about_ca_topic_score_gemma":0.000003460565,"teacher_disagreement_score":0.9543274,"about_ca_system_score_codex":0.00041605675,"about_ca_system_score_gemma":0.0002961974,"threshold_uncertainty_score":0.99959195},"labels":[],"label_agreement":null},{"id":"W4233241064","doi":"10.1090/s0002-9939-2010-10513-0","title":"Difference randomness","year":2010,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Randomness tests; Mathematics; Martingale (probability theory); Discrete mathematics; Hierarchy; Turing; Combinatorics; Computer science; Applied mathematics; Statistics","score_opus":0.009326609458625727,"score_gpt":0.23760269701758113,"score_spread":0.2282760875589554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233241064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88138974,0.000005854311,0.11271957,0.0025428676,0.00017106565,0.00031430312,0.0000012747935,0.00018600523,0.002669319],"genre_scores_gemma":[0.7789888,0.0000023439595,0.22056237,0.0002776482,0.000060834984,0.000016516822,4.6130985e-8,0.000009518705,0.00008192242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834234,0.000010673881,0.00035611,0.00039224248,0.0005511724,0.00034745104],"domain_scores_gemma":[0.9984025,0.0003819005,0.0003980309,0.00043493483,0.0002638228,0.00011884312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006737007,0.00019279703,0.0004623822,0.00001695583,0.00015192159,0.00012950801,0.0025282442,0.000049847236,0.000017862663],"category_scores_gemma":[0.00051340857,0.00011798891,0.000408117,0.0007640084,0.0010007343,0.00017937757,0.0011989272,0.00042886785,0.000012938063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025560725,0.0010059611,0.012045305,0.0005012524,0.00012814252,3.7380485e-7,0.0069773896,0.000003710344,0.17950842,0.7367262,0.001635233,0.061442416],"study_design_scores_gemma":[0.0007643472,0.00013432455,0.036370385,0.00005108252,0.000040716182,0.000050960636,0.00047001473,0.13612866,0.0266709,0.79859644,0.00023412562,0.00048804397],"about_ca_topic_score_codex":0.000011380355,"about_ca_topic_score_gemma":3.955886e-7,"teacher_disagreement_score":0.15283751,"about_ca_system_score_codex":0.000026064294,"about_ca_system_score_gemma":0.000033850192,"threshold_uncertainty_score":0.48114482},"labels":[],"label_agreement":null},{"id":"W4234113909","doi":"10.1017/9781108781718","title":"Algorithmic Randomness","year":2020,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Computer science; Randomness; Information retrieval; World Wide Web; Mathematics; Statistics","score_opus":0.019200214006304568,"score_gpt":0.19149939395676874,"score_spread":0.17229917995046418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234113909","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004850861,0.0001587473,0.29542527,0.00011196834,0.0009663694,0.00077114924,0.00010615568,0.0008275555,0.70162797],"genre_scores_gemma":[0.00008551181,0.00003844042,0.009985874,0.00024783716,0.00063390215,0.0000033399353,0.00005479535,0.000057442587,0.98889285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962504,0.0002885157,0.00039867166,0.0016641585,0.00074165437,0.00065661257],"domain_scores_gemma":[0.9966876,0.0003335478,0.0003717055,0.0018034243,0.0002965736,0.0005071749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002674322,0.0007363953,0.0010171486,0.00027796847,0.0003086964,0.00028320905,0.00458727,0.0005422766,0.0000030530186],"category_scores_gemma":[0.000040655643,0.0008705995,0.0005496284,0.00008630541,0.00033160902,0.0002837178,0.0036508928,0.0010654612,0.00008731219],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008266371,0.000045568177,0.000001033976,0.00023322544,0.00021603562,0.0016980361,0.00020373458,0.000029785748,0.000016985701,0.7010758,0.27550682,0.02089032],"study_design_scores_gemma":[0.0020561095,0.000105311236,0.000011214388,0.00008586889,0.00011956932,0.000060709568,0.000009619148,0.020476485,0.00014670502,0.00010377747,0.9758873,0.0009373129],"about_ca_topic_score_codex":0.00007684948,"about_ca_topic_score_gemma":0.000001073886,"teacher_disagreement_score":0.700972,"about_ca_system_score_codex":0.00073299836,"about_ca_system_score_gemma":0.00097135245,"threshold_uncertainty_score":0.99937445},"labels":[],"label_agreement":null},{"id":"W4234157679","doi":"10.1145/2768577.2791243","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computation; Computer science; Algebra over a field; Library science; Quarter (Canadian coin); Mathematics; Algorithm; History; Pure mathematics","score_opus":0.1060856837289224,"score_gpt":0.34347593216693467,"score_spread":0.23739024843801226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234157679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35067156,0.00068508077,0.6338734,0.010812617,0.0014402294,0.0010485961,0.000011447791,0.00041981996,0.001037223],"genre_scores_gemma":[0.5256049,0.00008153547,0.47385445,0.00027924677,0.00006730011,0.000050977902,0.000038325863,0.000017530225,0.0000057372235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956841,0.0007283877,0.0015719517,0.00081055163,0.0005867186,0.0006183197],"domain_scores_gemma":[0.9898456,0.0015381454,0.0004124194,0.007358988,0.0005637961,0.0002811048],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015415946,0.00040055512,0.00064466393,0.00072966015,0.00013749677,0.0002348749,0.009275128,0.00018775598,0.000019200608],"category_scores_gemma":[0.00030296872,0.00042866665,0.00014071859,0.002429781,0.00031852693,0.0009929716,0.0059153424,0.0007269637,0.00007290065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003676575,0.0049648364,0.06391734,0.000079826204,0.00010717801,0.000055227665,0.016971337,0.045689456,0.000085049265,0.09806295,0.0022005104,0.76782954],"study_design_scores_gemma":[0.0018653205,0.0002951159,0.24999134,0.00013435054,0.00001210267,0.000042322026,0.000095106996,0.6397279,0.00017319819,0.10391464,0.0030399254,0.0007086887],"about_ca_topic_score_codex":0.00066323485,"about_ca_topic_score_gemma":0.0014046843,"teacher_disagreement_score":0.76712084,"about_ca_system_score_codex":0.00036893773,"about_ca_system_score_gemma":0.00041541166,"threshold_uncertainty_score":0.99981654},"labels":[],"label_agreement":null},{"id":"W4234201384","doi":"10.1017/cbo9781107298019.002","title":"Introduction","year":2014,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Process (computing); Task (project management); Artificial intelligence; Quality (philosophy); Learning to learn; Subject (documents); Machine learning; Mathematics education; Programming language; World Wide Web; Engineering; Psychology","score_opus":0.01578780715600994,"score_gpt":0.182573126807951,"score_spread":0.16678531965194104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234201384","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007864279,0.00004107542,0.3116607,0.00017738844,0.0011268302,0.0002681541,0.000017203398,0.0004472313,0.68625355],"genre_scores_gemma":[0.0002431621,0.000019926923,0.005697712,0.00009066991,0.0012696603,5.855179e-7,0.000020009848,0.00003278178,0.9926255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99765503,0.00008557181,0.00024866386,0.0012021695,0.00043639162,0.0003721624],"domain_scores_gemma":[0.9972894,0.00010163482,0.0002725121,0.0018265762,0.0002935515,0.0002162765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002562501,0.00045459013,0.00049186056,0.00026291536,0.00022200192,0.00014725856,0.0019787904,0.0003852996,0.000008140811],"category_scores_gemma":[0.000020532494,0.0005457029,0.0002757641,0.000019310355,0.00024000157,0.0001752877,0.0016778511,0.00059209886,0.000102573096],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009722622,0.000007757834,3.958512e-7,0.000038337443,0.000047418165,0.000068154644,0.000025226544,0.000019909648,0.000012336424,0.9066955,0.07366434,0.019410942],"study_design_scores_gemma":[0.00029008978,0.00008635219,0.000014024295,0.00002860145,0.000056356712,0.00004626239,0.0000022270385,0.0044668354,0.00013978395,0.00020489354,0.99411714,0.0005474528],"about_ca_topic_score_codex":0.000056064044,"about_ca_topic_score_gemma":0.0000014074875,"teacher_disagreement_score":0.9204528,"about_ca_system_score_codex":0.00036064655,"about_ca_system_score_gemma":0.00011882579,"threshold_uncertainty_score":0.9996995},"labels":[],"label_agreement":null},{"id":"W4234876263","doi":"10.1007/978-0-387-49820-1_6","title":"The Incompressibility Method","year":2008,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Object (grammar); Class (philosophy); Argument (complex analysis); Simple (philosophy); Probabilistic logic; Property (philosophy); Mathematics; Computer science; Calculus (dental); Artificial intelligence; Statistics; Epistemology; Philosophy","score_opus":0.031563060612862744,"score_gpt":0.2958512681151518,"score_spread":0.26428820750228904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234876263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065395696,0.0010792004,0.9341613,0.00079983316,0.003689771,0.0007976556,0.0000049230184,0.00046944592,0.058932465],"genre_scores_gemma":[0.0051857526,0.00031451831,0.9743663,0.0007916302,0.0008020992,0.000038739785,0.0000021624876,0.000060177754,0.018438622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99206483,0.00023853799,0.0012180747,0.0030046515,0.0022276647,0.0012462406],"domain_scores_gemma":[0.99137616,0.0019798048,0.00053490966,0.0052026333,0.0005435964,0.00036292002],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.005275751,0.0007902069,0.0008339779,0.0006061287,0.0012359339,0.0010364712,0.013229724,0.00032796655,0.000022914868],"category_scores_gemma":[0.00014597957,0.00059220335,0.0002990344,0.0009508983,0.0026453317,0.0010130939,0.008772226,0.0013735736,0.00019173237],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004644024,0.000068536305,0.0000422586,0.000018322302,0.000011337227,0.00014073172,0.00058413413,0.0019264714,0.0000060718253,0.09806682,0.0013806436,0.89775],"study_design_scores_gemma":[0.00032807194,0.00017495574,0.0024536604,0.00012889468,0.0000056965305,0.00028653548,9.763854e-7,0.6938639,0.00007783301,0.23149224,0.07020443,0.0009827573],"about_ca_topic_score_codex":0.000054516364,"about_ca_topic_score_gemma":0.00007678445,"teacher_disagreement_score":0.89676726,"about_ca_system_score_codex":0.00074290583,"about_ca_system_score_gemma":0.0013389253,"threshold_uncertainty_score":0.9996529},"labels":[],"label_agreement":null},{"id":"W4236277765","doi":"10.1007/0-306-47015-2_8","title":"Toward a Model of Models: Part II","year":2005,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Turing; Context (archaeology); Turing machine; Theoretical computer science; Cognitive science; Artificial intelligence; Algorithm; Programming language; Psychology; Computation","score_opus":0.09083279792188718,"score_gpt":0.24853556430102866,"score_spread":0.1577027663791415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236277765","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003544455,0.0009918828,0.2085669,0.0013846055,0.0011302914,0.00078216544,0.00006298151,0.00070452265,0.7863412],"genre_scores_gemma":[0.008991119,0.000105511375,0.070197366,0.0023750626,0.0015185064,0.00012301575,0.000043968164,0.00025466777,0.9163908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930347,0.0000741849,0.0018327055,0.002099474,0.0018423621,0.0011165391],"domain_scores_gemma":[0.9950431,0.00019535178,0.0010183866,0.0025460154,0.0006208874,0.00057623076],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.001411553,0.0011181788,0.0014526007,0.00076252397,0.00019874187,0.0003970196,0.0066044647,0.0022311106,0.00012134141],"category_scores_gemma":[0.00009558321,0.0011304464,0.00073470426,0.00011079187,0.000535527,0.0026802497,0.004345938,0.0034741398,0.000041234245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019899806,0.00004932944,0.0000016601521,0.000120506484,0.00019727522,0.000014107988,0.0028901962,0.012613739,0.000024738809,0.76582843,0.084405325,0.13383476],"study_design_scores_gemma":[0.0003645785,0.00007747033,3.588543e-7,0.00013599164,0.000052959545,0.00002669433,0.000007901923,0.3874867,0.00003966873,0.45577985,0.15525134,0.00077648886],"about_ca_topic_score_codex":0.00002473445,"about_ca_topic_score_gemma":0.0000059767813,"teacher_disagreement_score":0.37487295,"about_ca_system_score_codex":0.0005237133,"about_ca_system_score_gemma":0.0011659017,"threshold_uncertainty_score":0.9991146},"labels":[],"label_agreement":null},{"id":"W4238988706","doi":"10.1090/ulect/070/14","title":"The classification of ℤ-actions","year":2018,"lang":"en","type":"book-chapter","venue":"University lecture series","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science","score_opus":0.023847877460342545,"score_gpt":0.2053172391310824,"score_spread":0.18146936167073985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238988706","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007705827,0.00019557143,0.47851676,0.0031110616,0.001071353,0.0003001788,0.00003005611,0.00025606615,0.5164419],"genre_scores_gemma":[0.011749883,0.00056150643,0.05489534,0.0001060817,0.0005875491,8.346325e-7,0.000040894018,0.000044173372,0.93201375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990731,0.000038859755,0.00013959597,0.0003606554,0.00023809235,0.00014970156],"domain_scores_gemma":[0.9983247,0.00015499619,0.00021799633,0.0008978971,0.00035600163,0.000048440892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011547413,0.00018756442,0.00019347976,0.00011504892,0.0004605369,0.00006424561,0.0011456027,0.0002103362,0.00011004623],"category_scores_gemma":[0.000026005386,0.000156376,0.00013910183,0.00011189969,0.00055859267,0.0002499039,0.00041364896,0.00025383924,0.000045134588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021391268,0.000012117999,0.000005493201,0.00001713229,0.00007181301,0.000006487268,0.0007133754,0.000019243795,0.00007490886,0.96964973,0.0038180137,0.025590321],"study_design_scores_gemma":[0.000056739784,0.00010697961,0.00028915395,0.000014685383,0.000023429215,0.000013133365,0.000043750126,0.00038637803,0.000087496606,0.08392813,0.9148874,0.00016266613],"about_ca_topic_score_codex":0.000015598316,"about_ca_topic_score_gemma":0.00038712515,"teacher_disagreement_score":0.91106945,"about_ca_system_score_codex":0.00015551536,"about_ca_system_score_gemma":0.00017816482,"threshold_uncertainty_score":0.63768286},"labels":[],"label_agreement":null},{"id":"W4239945522","doi":"10.1145/3151131.3151135","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computation; Algebra over a field; Computer science; Quarter (Canadian coin); Library science; Mathematics education; Mathematics; Algorithm; Pure mathematics; History","score_opus":0.08591355631602832,"score_gpt":0.3517769376764778,"score_spread":0.26586338136044946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239945522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48006207,0.00042185033,0.4973086,0.017429648,0.0017296129,0.0011804265,0.000015967085,0.00034487364,0.0015069596],"genre_scores_gemma":[0.5724329,0.00015533093,0.42705077,0.00019134054,0.000072031995,0.000049694965,0.000023658386,0.00001705761,0.0000072074536],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9960965,0.00047737887,0.0014579367,0.00086508406,0.00047654498,0.00062658254],"domain_scores_gemma":[0.98360384,0.0014319615,0.0007144847,0.013690114,0.00038125832,0.00017837131],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012226242,0.00040489563,0.00066034665,0.0005597999,0.00054490205,0.00059392134,0.016525712,0.0001930545,0.000031205072],"category_scores_gemma":[0.00036719898,0.00043544624,0.00017212942,0.0008397318,0.0005245473,0.0014022487,0.009255273,0.00076476554,0.000057089645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017504186,0.0026496677,0.084024064,0.00006924058,0.00007990058,0.000039958304,0.005143024,0.0072917286,0.00011295908,0.077129744,0.0005192198,0.822923],"study_design_scores_gemma":[0.0009565863,0.00011638903,0.6291799,0.0001236832,0.000008102372,0.000018094364,0.00001959545,0.3139577,0.00015828948,0.053865284,0.0011496192,0.0004467551],"about_ca_topic_score_codex":0.0009452729,"about_ca_topic_score_gemma":0.0024066113,"teacher_disagreement_score":0.8224762,"about_ca_system_score_codex":0.00023088689,"about_ca_system_score_gemma":0.00024182585,"threshold_uncertainty_score":0.99980974},"labels":[],"label_agreement":null},{"id":"W4240182992","doi":"10.31234/osf.io/q7jrb","title":"Robot Consciousness","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CTS Forex (Canada)","funders":"","keywords":"Consciousness; Robot; Artificial intelligence; Computer science; Psychology; Computer vision; Neuroscience","score_opus":0.04547743058767163,"score_gpt":0.2735501854172743,"score_spread":0.2280727548296027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240182992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005004035,0.00015469488,0.9683259,0.012888541,0.003370068,0.00051116373,0.000006694433,0.0016713573,0.012571158],"genre_scores_gemma":[0.3956666,0.000016465357,0.60112745,0.0020252408,0.00050876907,0.00006311718,0.000013892604,0.000028436685,0.00055001676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675053,0.00016541067,0.00047808274,0.0016328227,0.0005419982,0.00043115404],"domain_scores_gemma":[0.99697006,0.0002285431,0.00017353355,0.002134673,0.00020916172,0.00028403092],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00035095648,0.0004282264,0.00059929636,0.0001096769,0.000089848625,0.00062293094,0.004289355,0.00029883423,0.00013956855],"category_scores_gemma":[0.00012394869,0.00039485446,0.0002639056,0.00036316563,0.000112173926,0.00015689446,0.013055043,0.0008655795,0.00046540055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017210341,0.0008244529,0.0024979406,0.0010195288,0.00037676079,0.00069072534,0.004001548,0.04025444,0.00057920103,0.4786757,0.037499182,0.43356332],"study_design_scores_gemma":[0.00025414568,0.00007164182,0.003574513,0.000036804726,0.00001589696,0.000030198438,0.000016090327,0.7036383,0.00067657867,0.28555098,0.005249057,0.0008858049],"about_ca_topic_score_codex":0.00018252949,"about_ca_topic_score_gemma":0.0000358659,"teacher_disagreement_score":0.66338384,"about_ca_system_score_codex":0.00012573977,"about_ca_system_score_gemma":0.00046360205,"threshold_uncertainty_score":0.99985033},"labels":[],"label_agreement":null},{"id":"W4240783467","doi":"10.32920/ryerson.14647659","title":"Generalized Max-Cut and the Approximation Ratio","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Rounding; Mathematics; Maximum cut; Quadratic equation; Combinatorics; Semidefinite programming; Positive-definite matrix; Randomness; Algorithm; Graph; Discrete mathematics; Mathematical optimization; Computer science; Eigenvalues and eigenvectors","score_opus":0.023968141958017282,"score_gpt":0.24914408339880037,"score_spread":0.2251759414407831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240783467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015915176,0.00063405104,0.9712468,0.0068870885,0.0011221538,0.00080023735,0.0000015648457,0.0002845066,0.0031084365],"genre_scores_gemma":[0.20673443,0.00019273465,0.78956693,0.0014900116,0.0003648812,0.00025653563,0.00004489055,0.0000202001,0.0013293644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975134,0.0005073136,0.0004189602,0.0009199705,0.0004099622,0.00023035325],"domain_scores_gemma":[0.9976643,0.00027090128,0.00017707463,0.0015968793,0.00021845906,0.00007239758],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010796919,0.0002761585,0.00043543393,0.000068368456,0.00015239492,0.0014263307,0.0012753864,0.00018285567,0.00006383613],"category_scores_gemma":[0.00012650018,0.00018094666,0.0001603408,0.00021849967,0.00016549323,0.00022788924,0.0050029405,0.0004174794,0.0000098927085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023002496,0.0001674348,0.00016187599,0.00026536037,0.00016158108,0.000023020657,0.0062267343,0.0098383995,0.00012588069,0.8422202,0.0013303214,0.13945617],"study_design_scores_gemma":[0.0006719849,0.000009314206,0.0005627576,0.000014754052,0.000014800455,0.00002540181,0.000037143658,0.91041976,0.00043124348,0.087239645,0.00033295367,0.00024026759],"about_ca_topic_score_codex":0.00028711453,"about_ca_topic_score_gemma":0.00007402847,"teacher_disagreement_score":0.90058136,"about_ca_system_score_codex":0.00006646034,"about_ca_system_score_gemma":0.00019663629,"threshold_uncertainty_score":0.9996103},"labels":[],"label_agreement":null},{"id":"W4242679017","doi":"10.1007/978-3-030-11298-1_3","title":"Algorithmic Prefix Complexity","year":2019,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Kolmogorov complexity; Computer science; Theoretical computer science; Algorithmic complexity; Mathematical economics; Mathematics; Arithmetic; Algorithm; Philosophy; Linguistics","score_opus":0.043384522185897376,"score_gpt":0.26890995715396326,"score_spread":0.22552543496806587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242679017","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017608161,0.00038445767,0.8821524,0.0006366291,0.005897599,0.0013077864,0.000021629383,0.00072295155,0.10870048],"genre_scores_gemma":[0.01340386,0.000068548,0.9326847,0.0015444143,0.0012561725,0.000029221217,0.000016220833,0.00012449076,0.050872337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99123836,0.00009823786,0.0011941879,0.0036505307,0.0023574987,0.0014611771],"domain_scores_gemma":[0.99345815,0.0004428152,0.0005633324,0.00457787,0.00052269106,0.00043516076],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0024224957,0.0010303479,0.0012291755,0.0013892226,0.00035810162,0.0010415716,0.0112191485,0.00044194772,0.00015673896],"category_scores_gemma":[0.000047664875,0.0010274302,0.00032051952,0.0010095687,0.0020974008,0.0015198289,0.008151974,0.0013760992,0.0014696682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004668459,0.0001378775,0.00007548407,0.00008881034,0.000018570445,0.00016768283,0.0004628732,0.0018681602,0.000018926286,0.49365893,0.00088560913,0.5026124],"study_design_scores_gemma":[0.00056514126,0.0003293047,0.0019514133,0.0002984171,0.000008741261,0.0001715334,8.3471014e-7,0.6957895,0.000056014418,0.27897948,0.020413723,0.0014358509],"about_ca_topic_score_codex":0.00005930456,"about_ca_topic_score_gemma":0.000056336372,"teacher_disagreement_score":0.6939214,"about_ca_system_score_codex":0.001030644,"about_ca_system_score_gemma":0.0017787828,"threshold_uncertainty_score":0.99999547},"labels":[],"label_agreement":null},{"id":"W4242752220","doi":"10.1007/978-1-4614-6170-8_100743","title":"Human Computation","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.03037969362622842,"score_gpt":0.2597710955193387,"score_spread":0.22939140189311027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242752220","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030939275,0.000028900078,0.5238671,0.0002281455,0.00043589875,0.00016625162,0.0000011135576,0.00045669384,0.47481287],"genre_scores_gemma":[0.008577517,0.000003982221,0.14836212,0.00089032826,0.0006899546,0.000008308161,0.00003496535,0.00006269835,0.8413701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976908,0.000038172748,0.00049037364,0.0009425604,0.0005453378,0.00029276413],"domain_scores_gemma":[0.9981948,0.000130002,0.00024554072,0.0010668213,0.00021877069,0.00014403084],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003705586,0.00041592287,0.0004755757,0.00021929594,0.00016172048,0.00026201064,0.0013905123,0.00030902296,0.00033024547],"category_scores_gemma":[0.00001136112,0.00039416086,0.00021853395,0.00005146767,0.00010094751,0.00013470018,0.00088156335,0.00036744546,0.0010656769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.542949e-7,0.000011151861,0.0000024227932,0.000019785399,0.000016977525,0.000008501081,0.000036545163,0.00017227927,0.000004043917,0.8956545,0.006195611,0.097877935],"study_design_scores_gemma":[0.00024562972,0.00020470965,0.00017808827,0.000044388697,0.000015928843,0.000030135503,7.3781325e-7,0.08902279,0.0000138109435,0.73953986,0.1699509,0.00075303286],"about_ca_topic_score_codex":0.000023832525,"about_ca_topic_score_gemma":0.000025875452,"teacher_disagreement_score":0.37550494,"about_ca_system_score_codex":0.0001283738,"about_ca_system_score_gemma":0.00006352043,"threshold_uncertainty_score":0.99985105},"labels":[],"label_agreement":null},{"id":"W4243214450","doi":"10.1017/9781316459423.002","title":"The Puzzling Asymmetry","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Asymmetry; Physics; Particle physics","score_opus":0.0221481111558239,"score_gpt":0.19973383940684764,"score_spread":0.17758572825102373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243214450","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000243588,0.0002565151,0.10039366,0.00008852,0.0013239445,0.0004160083,0.000032046457,0.00043850866,0.8970264],"genre_scores_gemma":[0.00037455373,0.00006867561,0.00418819,0.00010476892,0.00047394502,7.6709586e-7,0.000006241049,0.00003872135,0.9947441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99740964,0.00010087527,0.00029882378,0.0010517251,0.0005829722,0.00055598724],"domain_scores_gemma":[0.9963558,0.00045987364,0.00032575658,0.0022031795,0.0004143381,0.0002410528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046502866,0.00050031074,0.0004251128,0.00017892932,0.0008369238,0.00038812007,0.0040577385,0.0003966087,0.000004768958],"category_scores_gemma":[0.000037803922,0.0004599182,0.00035433055,0.000029411649,0.000634457,0.00020769214,0.0034229672,0.00071684644,0.00009477789],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013477677,0.000007950752,8.509227e-7,0.000022578002,0.000093630806,0.00014696327,0.000065074426,0.000002478643,0.000004008636,0.9419242,0.040103916,0.017614879],"study_design_scores_gemma":[0.00026313754,0.00007662749,0.000015837297,0.000062816696,0.0000568585,0.00003532804,0.000014853335,0.006913249,0.00012395323,0.0006282871,0.99126655,0.00054250733],"about_ca_topic_score_codex":0.000058090594,"about_ca_topic_score_gemma":0.0000050272292,"teacher_disagreement_score":0.95116264,"about_ca_system_score_codex":0.0003559355,"about_ca_system_score_gemma":0.0002244807,"threshold_uncertainty_score":0.99978524},"labels":[],"label_agreement":null},{"id":"W4243469825","doi":"10.1093/logcom/exaa081","title":"Tracking computability of GPAC-generable functions","year":2020,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Alexander von Humboldt-Stiftung","keywords":"Computability; Computation; Computable analysis; Computable function; Mathematics; Model of computation; Computer science; Theoretical computer science; Algorithm","score_opus":0.059345048696840964,"score_gpt":0.27733557765461564,"score_spread":0.21799052895777468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243469825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16357926,0.0003579403,0.8328636,0.0025233962,0.00033274197,0.000090569105,0.0000014613494,0.000036275633,0.00021472128],"genre_scores_gemma":[0.89193934,0.000014262178,0.10753452,0.00031045097,0.00019186494,5.6896994e-7,0.0000010176173,0.000004231654,0.000003722728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983603,0.00018500503,0.00069360697,0.00024817954,0.00035625047,0.00015668024],"domain_scores_gemma":[0.99833167,0.00029085277,0.0005463899,0.00013219644,0.0005374369,0.00016144905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006283446,0.00013362848,0.00037587524,0.00009693519,0.000104022314,0.000093726056,0.00035430863,0.000059956703,0.000009844498],"category_scores_gemma":[0.00014796389,0.00011184904,0.000134276,0.00046334637,0.000083214785,0.00048631494,0.00015933227,0.00022729661,0.000002873559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010298859,0.000645521,0.014747111,0.00023107285,0.00013593335,0.00004956047,0.0045693833,0.37925354,0.0032039967,0.012912186,0.0013146395,0.58283406],"study_design_scores_gemma":[0.00092747353,0.0013567895,0.03971503,0.000031009404,0.00003649705,0.00017482581,0.00025118398,0.9060181,0.0005211163,0.05033354,0.0004235379,0.00021090981],"about_ca_topic_score_codex":0.000007401978,"about_ca_topic_score_gemma":9.533002e-7,"teacher_disagreement_score":0.7283601,"about_ca_system_score_codex":0.000039348073,"about_ca_system_score_gemma":0.00010358991,"threshold_uncertainty_score":0.45610714},"labels":[],"label_agreement":null},{"id":"W4243640818","doi":"10.1007/978-1-4939-7131-2_100460","title":"Hayashi’s Quantification Theory Type III","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Type (biology); Geology; Paleontology","score_opus":0.04315681363314647,"score_gpt":0.25950842813637626,"score_spread":0.2163516145032298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243640818","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000092068985,0.00017063464,0.47764438,0.0002455494,0.0016250456,0.00025954604,0.0000023046293,0.00048118917,0.5195621],"genre_scores_gemma":[0.0027034841,0.00004722663,0.049195662,0.00049731345,0.00068706874,0.000007740689,0.000027575938,0.00005081041,0.9467831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975242,0.00006594465,0.00048080215,0.0011160476,0.0004962641,0.00031673943],"domain_scores_gemma":[0.996518,0.00028853858,0.0002541417,0.0022981488,0.0005071177,0.00013404297],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000928128,0.00040919258,0.0004066527,0.00020272005,0.00013990584,0.00025433872,0.0020232282,0.00038864627,0.0033076538],"category_scores_gemma":[0.00006186611,0.00035620798,0.00017262202,0.000109763125,0.0002407416,0.00025572302,0.00087244285,0.0003293371,0.0051825107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061039354,0.000021005533,0.0000018544259,0.0000120817585,0.000028751436,0.0000051569036,0.00016246922,0.0000033407912,0.0000134000975,0.94190437,0.008438014,0.049403455],"study_design_scores_gemma":[0.00013629196,0.00015070532,0.0000491447,0.000032268876,0.000018768756,0.000019079143,0.0000047158132,0.008327657,0.00009011098,0.7600426,0.23061605,0.00051259866],"about_ca_topic_score_codex":0.0000124634125,"about_ca_topic_score_gemma":0.000025142976,"teacher_disagreement_score":0.42844874,"about_ca_system_score_codex":0.00012743086,"about_ca_system_score_gemma":0.00020102045,"threshold_uncertainty_score":0.999889},"labels":[],"label_agreement":null},{"id":"W4244978924","doi":"10.1007/978-3-030-19311-9","title":"Unconventional Computation and Natural Computation","year":2019,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Natural computing; Computation; Computer science; Cover (algebra); Natural (archaeology); Theoretical computer science; Artificial intelligence; Algorithm; History","score_opus":0.012514188077470801,"score_gpt":0.25819537448685725,"score_spread":0.24568118640938647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244978924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078223017,0.0007782922,0.98998535,0.00075751945,0.0058437106,0.0008597352,0.0000076256338,0.00030992602,0.0006755996],"genre_scores_gemma":[0.23370521,0.000019090037,0.76355064,0.0011995529,0.0007594096,0.000015510153,0.00008208806,0.000048679394,0.00061984727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940484,0.0001841549,0.00082511076,0.0024770712,0.0016303419,0.00083493243],"domain_scores_gemma":[0.9963558,0.0014529516,0.00048772097,0.00090506667,0.0005845444,0.00021392936],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014296122,0.0007219183,0.00079285796,0.0011438715,0.0003288843,0.0011225371,0.0023661868,0.00037585013,0.000007657451],"category_scores_gemma":[0.00013975537,0.0007056053,0.00017837995,0.0014704048,0.0008938844,0.001184949,0.0023436786,0.0011639926,0.0000725817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007710848,0.00008080148,0.00031932845,0.00015698154,0.000020472355,0.000052658514,0.0005517244,0.20781574,0.000044356933,0.0033477978,0.00019177215,0.7874107],"study_design_scores_gemma":[0.00049414,0.00017710573,0.0026606836,0.00019431165,0.000008344407,0.00013845244,2.456534e-7,0.8185423,0.000056626297,0.1768543,0.0002278698,0.0006456203],"about_ca_topic_score_codex":0.00002717129,"about_ca_topic_score_gemma":0.000048016187,"teacher_disagreement_score":0.78676504,"about_ca_system_score_codex":0.00095114374,"about_ca_system_score_gemma":0.0016426183,"threshold_uncertainty_score":0.9999144},"labels":[],"label_agreement":null},{"id":"W4246754678","doi":"10.1090/fim/020/10","title":"Global 𝐿-functions","year":2009,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"","keywords":"Computer science","score_opus":0.01678262371625753,"score_gpt":0.24768783073655973,"score_spread":0.2309052070203022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246754678","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000075482503,0.00003837955,0.44419736,0.0005712031,0.00013529786,0.000312666,0.000018808822,0.00058339955,0.5541353],"genre_scores_gemma":[0.0014229408,0.00001806626,0.49268872,0.0037168227,0.00058848097,0.0000478403,0.0000143381285,0.0000838188,0.501419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642485,0.00004364829,0.00073625526,0.0011638646,0.0009403139,0.00069105066],"domain_scores_gemma":[0.9968066,0.0003683156,0.00044980913,0.0017807427,0.00018756506,0.00040695965],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035374876,0.000711766,0.001068633,0.000039270257,0.00026413327,0.00026789925,0.0017230965,0.00031510176,0.0001861369],"category_scores_gemma":[0.000049257796,0.0006520352,0.0012348854,0.0001243618,0.0011038607,0.000095514275,0.00087131717,0.0005973735,0.00082556787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013579397,0.000060893737,0.0000020392126,0.00003520766,0.00011810878,0.000012361546,0.00024168758,0.0000069307716,0.0000012460188,0.70208234,0.006827823,0.29061],"study_design_scores_gemma":[0.00015470611,0.0002942607,0.000038693935,0.00007513066,0.00008212224,0.000086132146,0.000037829297,0.009676157,0.0000018854981,0.9000658,0.08873363,0.0007536602],"about_ca_topic_score_codex":0.000019572502,"about_ca_topic_score_gemma":0.000005316639,"teacher_disagreement_score":0.2898563,"about_ca_system_score_codex":0.00053292915,"about_ca_system_score_gemma":0.00026605008,"threshold_uncertainty_score":0.9999524},"labels":[],"label_agreement":null},{"id":"W4246822229","doi":"10.1109/cwit.2011.5872102","title":"Foreword","year":2011,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Kelowna General Hospital","funders":"","keywords":"Library science; Political science; Computer science","score_opus":0.059350179376699404,"score_gpt":0.21314955957309797,"score_spread":0.15379938019639858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246822229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00689615,0.00001731414,0.89889616,0.00020877746,0.0003940634,0.00008089473,2.986799e-7,0.00042209355,0.093084276],"genre_scores_gemma":[0.5178772,7.106418e-7,0.48072958,0.00035156045,0.00003658978,0.000005237508,1.3354821e-7,0.0000032923951,0.000995664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999183,0.000025390078,0.00012914778,0.00030045505,0.0001424477,0.00021954348],"domain_scores_gemma":[0.9991449,0.00003997037,0.000023946415,0.00065888336,0.000050394156,0.00008189491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018047908,0.00008328454,0.000088394496,0.000046129462,0.00004414891,0.000030753243,0.00097391085,0.000033258922,0.00032953735],"category_scores_gemma":[0.000020080592,0.000066276,0.000051396055,0.00023588167,0.00003293124,0.000284495,0.00047578468,0.000064053485,0.00036721828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019357267,0.00014884444,0.0041874084,0.0000046435284,0.000008264368,0.00001826473,0.0011688641,0.0000039308115,0.000030435354,0.6984168,0.0023215995,0.29368898],"study_design_scores_gemma":[0.000431884,0.00035006553,0.12875174,0.00000569594,0.0000048745305,0.0000664686,0.000045047,0.320857,0.0059326026,0.53128654,0.011681455,0.00058663555],"about_ca_topic_score_codex":0.0000829676,"about_ca_topic_score_gemma":0.000021524933,"teacher_disagreement_score":0.5109811,"about_ca_system_score_codex":0.000018295827,"about_ca_system_score_gemma":0.000024996161,"threshold_uncertainty_score":0.47199705},"labels":[],"label_agreement":null},{"id":"W4246839454","doi":"10.4018/9781605660608.ch179","title":"On System Algebra","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Algebra over a field; Computer science; Mathematics; Pure mathematics","score_opus":0.02332726395300174,"score_gpt":0.22379085098810264,"score_spread":0.2004635870351009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246839454","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021874233,0.00018340806,0.07104455,0.000040365107,0.0025717297,0.00056126964,0.000049728624,0.0011660309,0.92436105],"genre_scores_gemma":[0.6628895,0.0000056200374,0.0477216,0.0029547769,0.0025586374,0.00013688701,0.000010884645,0.00031210738,0.28340998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640936,0.000059688697,0.00063015573,0.0014473171,0.0008325119,0.0006209618],"domain_scores_gemma":[0.9965264,0.00011150573,0.0003540218,0.002461163,0.0002072491,0.00033966257],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028913034,0.000773481,0.00078130607,0.00012926265,0.00015012674,0.00025241222,0.0027426248,0.0006010652,0.00004117874],"category_scores_gemma":[0.000017405939,0.00072668394,0.00043764873,0.000041391497,0.00014176787,0.000092428825,0.0012680034,0.0005019567,0.002224097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009503675,0.000017506569,0.0000017226415,0.000061001094,0.000058550682,0.0002181828,0.000055406606,0.000004467424,4.8876365e-7,0.96204376,0.0015847314,0.03594465],"study_design_scores_gemma":[0.00027383675,0.00033727053,0.000038949132,0.000308181,0.00003539119,0.00020335635,0.0000026440205,0.0006610152,0.000018320756,0.98216236,0.015152641,0.0008060563],"about_ca_topic_score_codex":0.00008756406,"about_ca_topic_score_gemma":0.00002601736,"teacher_disagreement_score":0.6628676,"about_ca_system_score_codex":0.00082339015,"about_ca_system_score_gemma":0.00029000238,"threshold_uncertainty_score":0.9995184},"labels":[],"label_agreement":null},{"id":"W4246860016","doi":"10.1002/9780470932025.ch1","title":"Introduction","year":2011,"lang":"en","type":"other","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Parallel computing; Multiprocessing; Parallel algorithm; Parallel programming model; Analysis of parallel algorithms; Parallel processing; Embarrassingly parallel; Parallel architecture; Symmetric multiprocessor system; Architecture; Programming paradigm; Programming language","score_opus":0.014880861031942385,"score_gpt":0.21442872095405294,"score_spread":0.19954785992211055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246860016","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.13423006e-7,0.0001016008,0.46054563,0.0004362354,0.0020303694,0.000104051855,5.752832e-7,0.0009229202,0.5358585],"genre_scores_gemma":[0.000008684586,0.000015067986,0.21534853,0.00009989422,0.0023210542,0.000007703164,0.0000027137405,0.0000881958,0.7821082],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872535,0.000047260903,0.00014305302,0.00067880674,0.0001926848,0.0002128484],"domain_scores_gemma":[0.99850655,0.000013910886,0.00009251562,0.0012885773,0.000032481745,0.000065995555],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014497426,0.00019965938,0.00021051375,0.0002036716,0.000021243019,0.00006602451,0.0010898204,0.00017831365,0.014301959],"category_scores_gemma":[0.00001875931,0.00016847666,0.000070517905,0.00023766744,0.000044096694,0.00008552954,0.0004700582,0.00014954525,0.0034602403],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.092218e-7,0.000034820467,0.0000050959825,0.0000096435615,0.000010596274,0.0000022388176,0.000026390488,4.991299e-7,0.0000014879785,0.046545904,0.8981443,0.055218827],"study_design_scores_gemma":[0.00005334501,0.000033868462,0.000050569823,0.0000050680032,0.0000034083923,0.000013365911,0.0000011290323,0.0010868956,0.000036621266,0.00567272,0.992826,0.0002170407],"about_ca_topic_score_codex":0.00029433082,"about_ca_topic_score_gemma":0.0000768569,"teacher_disagreement_score":0.24624966,"about_ca_system_score_codex":0.000036274905,"about_ca_system_score_gemma":0.00004074265,"threshold_uncertainty_score":0.9973157},"labels":[],"label_agreement":null},{"id":"W4247121797","doi":"10.1007/978-1-4939-7131-2_100983","title":"Relevance Functions","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Relevance (law); Computer science; Political science","score_opus":0.025822107592725862,"score_gpt":0.23040430197950915,"score_spread":0.2045821943867833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247121797","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012339968,0.00013941125,0.46168366,0.00040599136,0.0015180934,0.00014901985,0.0000049169803,0.0005180762,0.5355796],"genre_scores_gemma":[0.00008681905,0.000034261382,0.10060576,0.00047035547,0.00077871606,0.0000087676635,0.000006949275,0.000031383162,0.897977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977325,0.000018012119,0.0003824096,0.0010659492,0.00046747076,0.00033363458],"domain_scores_gemma":[0.9971088,0.00023779577,0.00015821947,0.0020223747,0.0003198859,0.00015288527],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023850676,0.00038472912,0.00035916787,0.00016079069,0.00015767876,0.00018118828,0.0015715848,0.00029859354,0.0035308558],"category_scores_gemma":[0.00005116681,0.0003476508,0.0002216108,0.000086234395,0.00019400797,0.00026825888,0.0010898943,0.0003821341,0.008217621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002120014,0.000029325187,0.000003298011,0.000018822566,0.000042457013,0.000021132164,0.00008460496,0.000014120526,0.0000035558587,0.77770054,0.1168721,0.10520794],"study_design_scores_gemma":[0.00007388226,0.00011733125,0.000019983565,0.000023546729,0.000009285841,0.000030908308,0.0000010878601,0.0060106153,0.000008999951,0.26626503,0.72707903,0.0003603022],"about_ca_topic_score_codex":0.000011381249,"about_ca_topic_score_gemma":0.00004901939,"teacher_disagreement_score":0.6102069,"about_ca_system_score_codex":0.0001451539,"about_ca_system_score_gemma":0.00015251954,"threshold_uncertainty_score":0.99989754},"labels":[],"label_agreement":null},{"id":"W4247129482","doi":"10.4324/9781135000356-rem1720-1","title":"Turing, Alan Mathison (1912–1954)","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Turing; Super-recursive algorithm; Computable number; Turing machine; Computer science; German; Turing machine examples; Nazism; Universal Turing machine; Computable function; Philosophy; Algorithm; Programming language; Computation; Computable analysis; Linguistics","score_opus":0.022841704484976726,"score_gpt":0.2274349676782559,"score_spread":0.2045932631932792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247129482","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003670086,0.00025965305,0.2300673,0.0005272239,0.002117164,0.0003814087,0.00000746067,0.0010682916,0.7655348],"genre_scores_gemma":[0.0005535281,0.000033397082,0.10572017,0.0006577887,0.0013032276,0.00001153026,0.000013026537,0.00007831,0.89162904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99645734,0.00003485067,0.00060003105,0.0015201139,0.00079326774,0.0005943811],"domain_scores_gemma":[0.996515,0.00014852967,0.00027606435,0.0025306258,0.0002615391,0.00026825911],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046543352,0.0006726942,0.0006445165,0.0002778428,0.0001508232,0.0003818803,0.0029571312,0.00054994615,0.0037563415],"category_scores_gemma":[0.000028594723,0.00059904717,0.000333514,0.00007797765,0.00017686273,0.00029832232,0.0022174013,0.0005762382,0.0054556024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051966613,0.00008156896,0.000029860234,0.00011074502,0.00010205258,0.00013421582,0.0006447389,0.000009674028,0.000011930645,0.8388249,0.06911413,0.09093093],"study_design_scores_gemma":[0.00021460574,0.0002871888,0.00013712142,0.0000881007,0.000027954182,0.00011068378,0.0000025829215,0.011040339,0.000120854704,0.28981435,0.6971538,0.0010024293],"about_ca_topic_score_codex":0.000049003662,"about_ca_topic_score_gemma":0.00007729463,"teacher_disagreement_score":0.62803966,"about_ca_system_score_codex":0.00021894806,"about_ca_system_score_gemma":0.00016491259,"threshold_uncertainty_score":0.99964607},"labels":[],"label_agreement":null},{"id":"W4247707287","doi":"10.32920/ryerson.14647659.v1","title":"Generalized Max-Cut and the Approximation Ratio","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Rounding; Mathematics; Maximum cut; Quadratic equation; Combinatorics; Semidefinite programming; Positive-definite matrix; Randomness; Algorithm; Graph; Discrete mathematics; Mathematical optimization; Computer science; Eigenvalues and eigenvectors","score_opus":0.023968141958017282,"score_gpt":0.24914408339880037,"score_spread":0.2251759414407831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247707287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015915176,0.00063405104,0.9712468,0.0068870885,0.0011221538,0.00080023735,0.0000015648457,0.0002845066,0.0031084365],"genre_scores_gemma":[0.20673443,0.00019273465,0.78956693,0.0014900116,0.0003648812,0.00025653563,0.00004489055,0.0000202001,0.0013293644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975134,0.0005073136,0.0004189602,0.0009199705,0.0004099622,0.00023035325],"domain_scores_gemma":[0.9976643,0.00027090128,0.00017707463,0.0015968793,0.00021845906,0.00007239758],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010796919,0.0002761585,0.00043543393,0.000068368456,0.00015239492,0.0014263307,0.0012753864,0.00018285567,0.00006383613],"category_scores_gemma":[0.00012650018,0.00018094666,0.0001603408,0.00021849967,0.00016549323,0.00022788924,0.0050029405,0.0004174794,0.0000098927085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023002496,0.0001674348,0.00016187599,0.00026536037,0.00016158108,0.000023020657,0.0062267343,0.0098383995,0.00012588069,0.8422202,0.0013303214,0.13945617],"study_design_scores_gemma":[0.0006719849,0.000009314206,0.0005627576,0.000014754052,0.000014800455,0.00002540181,0.000037143658,0.91041976,0.00043124348,0.087239645,0.00033295367,0.00024026759],"about_ca_topic_score_codex":0.00028711453,"about_ca_topic_score_gemma":0.00007402847,"teacher_disagreement_score":0.90058136,"about_ca_system_score_codex":0.00006646034,"about_ca_system_score_gemma":0.00019663629,"threshold_uncertainty_score":0.9996103},"labels":[],"label_agreement":null},{"id":"W4248445960","doi":"10.31234/osf.io/9w5dy","title":"Deep analogical inference as the origin of hypotheses","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Inference; Novelty; Computer science; Set (abstract data type); Artificial intelligence; Conjecture; Computational model; Cognitive science; Machine learning; Theoretical computer science; Mathematics; Psychology; Social psychology","score_opus":0.07115035840149134,"score_gpt":0.3188084665104126,"score_spread":0.24765810810892128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248445960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03874725,0.00017761702,0.9321005,0.0012663883,0.0011776034,0.0004950872,0.000003548165,0.00031877824,0.025713231],"genre_scores_gemma":[0.8476098,0.000045141547,0.15120268,0.00051038957,0.00029270863,0.00004107038,0.0000026277376,0.000011542403,0.00028400126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968743,0.0003414234,0.00059758,0.0010554448,0.0007203441,0.00041091497],"domain_scores_gemma":[0.9949163,0.0014368651,0.00031787006,0.002734098,0.00046675786,0.00012806771],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009467582,0.0003840842,0.00055163796,0.00012570224,0.00011185852,0.00031679776,0.0055755256,0.00029481,0.00050344976],"category_scores_gemma":[0.0007588405,0.00022317344,0.00026652592,0.00044689028,0.00058090617,0.00013863138,0.007852127,0.00062202243,0.00022840942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028386235,0.0010410672,0.015294471,0.0002726074,0.00029263351,0.00005806712,0.0034551353,0.010425927,0.000094302435,0.69504637,0.0020197383,0.2719713],"study_design_scores_gemma":[0.00012055149,0.0002698961,0.021510292,0.000047757334,0.000019182322,0.000021417654,0.000027940912,0.38023525,0.0005425606,0.59400624,0.00273291,0.00046597398],"about_ca_topic_score_codex":0.00056872057,"about_ca_topic_score_gemma":0.00011281218,"teacher_disagreement_score":0.80886257,"about_ca_system_score_codex":0.00007971257,"about_ca_system_score_gemma":0.00042175374,"threshold_uncertainty_score":0.9998048},"labels":[],"label_agreement":null},{"id":"W4249069313","doi":"10.4018/978-1-60566-616-7.ch019","title":"Adaptive Computation Paradigm in Knowledge Representation","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Representation (politics); Paradigm shift; Data science; Computational intelligence; Software; Computation; Evolutionary computation; Complex adaptive system; Human–computer interaction; Theoretical computer science","score_opus":0.041101800247623874,"score_gpt":0.2938068737590588,"score_spread":0.2527050735114349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249069313","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051033716,0.000424755,0.20322093,0.00014223906,0.00071769924,0.0007350325,0.000017516306,0.00035382272,0.794337],"genre_scores_gemma":[0.8236886,0.000021173078,0.12071183,0.0010348012,0.0014325739,0.00010009648,0.000047858983,0.00013204601,0.052830987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967412,0.00012681857,0.0007690011,0.0013260667,0.00055719545,0.00047975575],"domain_scores_gemma":[0.9981422,0.00018273007,0.00037142262,0.00091960374,0.00020016772,0.00018388266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030408948,0.00057183736,0.0006848414,0.00024231272,0.0000963674,0.000226342,0.0011017723,0.00044481363,0.000006661437],"category_scores_gemma":[0.00002782435,0.0006303617,0.00025407196,0.00013949085,0.00011950094,0.00023316042,0.0005089284,0.00046407172,0.00025151344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001396687,0.00003948285,0.000016223194,0.000009894332,0.000019908086,0.0000818586,0.00025650408,0.00060112553,8.312321e-7,0.7552367,0.0004062181,0.2433173],"study_design_scores_gemma":[0.0005246718,0.00024277436,0.0013666975,0.00013637563,0.000017970382,0.000060170205,0.0000059095532,0.057592694,0.000009898567,0.93719375,0.00226531,0.00058376236],"about_ca_topic_score_codex":0.00013440786,"about_ca_topic_score_gemma":0.00034652007,"teacher_disagreement_score":0.8236376,"about_ca_system_score_codex":0.00097548333,"about_ca_system_score_gemma":0.0003759806,"threshold_uncertainty_score":0.9996148},"labels":[],"label_agreement":null},{"id":"W4249298492","doi":"10.4018/978-1-60566-060-8.ch188","title":"Adaptive Computation Paradigm in Knowledge Representation","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Paradigm shift; Representation (politics); Data science; Computational intelligence; Software; Computation; Complex adaptive system; Human–computer interaction; Theoretical computer science","score_opus":0.041101800247623874,"score_gpt":0.2938068737590588,"score_spread":0.2527050735114349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249298492","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051033716,0.000424755,0.20322093,0.00014223906,0.00071769924,0.0007350325,0.000017516306,0.00035382272,0.794337],"genre_scores_gemma":[0.8236886,0.000021173078,0.12071183,0.0010348012,0.0014325739,0.00010009648,0.000047858983,0.00013204601,0.052830987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967412,0.00012681857,0.0007690011,0.0013260667,0.00055719545,0.00047975575],"domain_scores_gemma":[0.9981422,0.00018273007,0.00037142262,0.00091960374,0.00020016772,0.00018388266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030408948,0.00057183736,0.0006848414,0.00024231272,0.0000963674,0.000226342,0.0011017723,0.00044481363,0.000006661437],"category_scores_gemma":[0.00002782435,0.0006303617,0.00025407196,0.00013949085,0.00011950094,0.00023316042,0.0005089284,0.00046407172,0.00025151344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001396687,0.00003948285,0.000016223194,0.000009894332,0.000019908086,0.0000818586,0.00025650408,0.00060112553,8.312321e-7,0.7552367,0.0004062181,0.2433173],"study_design_scores_gemma":[0.0005246718,0.00024277436,0.0013666975,0.00013637563,0.000017970382,0.000060170205,0.0000059095532,0.057592694,0.000009898567,0.93719375,0.00226531,0.00058376236],"about_ca_topic_score_codex":0.00013440786,"about_ca_topic_score_gemma":0.00034652007,"teacher_disagreement_score":0.8236376,"about_ca_system_score_codex":0.00097548333,"about_ca_system_score_gemma":0.0003759806,"threshold_uncertainty_score":0.9996148},"labels":[],"label_agreement":null},{"id":"W4249831619","doi":"10.1007/978-0-387-49820-1_1","title":"Preliminaries","year":2008,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Object (grammar); Computer science; Measure (data warehouse); Simple (philosophy); String (physics); Theoretical computer science; Mathematics; Artificial intelligence; Data mining; Philosophy; Epistemology","score_opus":0.02731756757857245,"score_gpt":0.2461013080099837,"score_spread":0.21878374043141124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249831619","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001843501,0.0010792442,0.87680477,0.0007379174,0.0040430855,0.00071859197,0.0000060662674,0.00074244424,0.11568353],"genre_scores_gemma":[0.02379366,0.0004895295,0.91415066,0.0015371437,0.0013162653,0.000040140174,0.0000066348075,0.000107551656,0.058558445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99348676,0.00005113977,0.000891628,0.0026291532,0.0018574643,0.001083835],"domain_scores_gemma":[0.9953447,0.00040095317,0.00036864533,0.0031307323,0.0004115717,0.0003434103],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012356425,0.0007609289,0.0008128298,0.0011731461,0.0004791665,0.0006923669,0.008324753,0.0003383852,0.000054734806],"category_scores_gemma":[0.000064374995,0.0007504177,0.0002176124,0.0008155972,0.0023193166,0.0013372633,0.006006219,0.00092219026,0.00043493803],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005972137,0.00013353297,0.000059767455,0.000051186686,0.000013399523,0.000745138,0.0018978735,0.0025241002,0.0000072350304,0.2048932,0.004574859,0.7850937],"study_design_scores_gemma":[0.0007253097,0.00081465824,0.0034032667,0.00050605735,0.000012489223,0.0010460218,0.0000018118094,0.66913265,0.00015164602,0.20593774,0.11566884,0.002599529],"about_ca_topic_score_codex":0.000027723316,"about_ca_topic_score_gemma":0.00002432653,"teacher_disagreement_score":0.7824942,"about_ca_system_score_codex":0.0005720291,"about_ca_system_score_gemma":0.0012309586,"threshold_uncertainty_score":0.9994947},"labels":[],"label_agreement":null},{"id":"W4250536377","doi":"10.1007/978-0-387-49820-1_4","title":"Algorithmic Probability","year":2008,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.03259234014428898,"score_gpt":0.24973805628072568,"score_spread":0.21714571613643668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250536377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034414371,0.0006375851,0.9246253,0.00062392146,0.0040674075,0.0014593437,0.00001129319,0.0009338202,0.06729723],"genre_scores_gemma":[0.009353584,0.0001929925,0.97148234,0.000822112,0.0010979888,0.000055702843,0.0000064878686,0.00008712017,0.0169017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911483,0.00009799187,0.0012616375,0.003779192,0.0023218573,0.0013910155],"domain_scores_gemma":[0.993688,0.00041375114,0.00047686714,0.004336528,0.0005993942,0.00048548938],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023617237,0.0009762004,0.0010774571,0.0012134856,0.00049258897,0.0006196511,0.009699144,0.00044388688,0.00007250455],"category_scores_gemma":[0.00008811539,0.000963809,0.0003195621,0.0011669921,0.002568622,0.001446086,0.006258129,0.0013099763,0.0004868056],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000446365,0.00022549547,0.0000822483,0.00007079359,0.000014782108,0.0005121242,0.0009796047,0.0022754916,0.000009600312,0.08901544,0.0015217622,0.9052882],"study_design_scores_gemma":[0.0006613935,0.00044402527,0.0025432147,0.0002973562,0.000008785239,0.0006794084,6.293414e-7,0.637928,0.000085503445,0.31983063,0.035474908,0.0020461627],"about_ca_topic_score_codex":0.000045412788,"about_ca_topic_score_gemma":0.00003684617,"teacher_disagreement_score":0.90324205,"about_ca_system_score_codex":0.0012297386,"about_ca_system_score_gemma":0.0018167713,"threshold_uncertainty_score":0.9992812},"labels":[],"label_agreement":null},{"id":"W4250550708","doi":"10.1090/fic/038/02","title":"Crepant resolutions of ℂⁿ/𝔸₁(𝕟) and flops of 𝕟-folders for 𝕟=4,5","year":2003,"lang":"en","type":"other","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Queen's University","funders":"","keywords":"FLOPS; Computer science; Parallel computing","score_opus":0.018324754556484094,"score_gpt":0.24937857546602002,"score_spread":0.2310538209095359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250550708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015695756,0.00091400667,0.74097824,0.0001778626,0.0003968399,0.00057790475,0.000041303065,0.00013010955,0.25676805],"genre_scores_gemma":[0.0006086225,0.000113325266,0.74797016,0.0000937301,0.0000825081,0.000036831058,0.0000053393255,0.00010583765,0.25098363],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852145,0.000062061044,0.0003756631,0.00054171984,0.00024125344,0.0002578837],"domain_scores_gemma":[0.9984341,0.00020245693,0.0002526241,0.00090556714,0.00012462711,0.000080622995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003164572,0.00021892914,0.0004885601,0.00026396106,0.000032887252,0.00002206321,0.0006281471,0.00020574464,0.00020693205],"category_scores_gemma":[0.00010761988,0.00018976504,0.00014068098,0.0003018901,0.00019281096,0.000053190288,0.00028434774,0.000075137716,0.0000026917073],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082678025,0.00037697077,0.00024584134,0.0007297439,0.00019437463,0.000002990687,0.0003667177,0.0000666312,0.0001384916,0.16459362,0.8036615,0.029614817],"study_design_scores_gemma":[0.001325314,0.0005876841,0.0005251513,0.00025788145,0.00008914079,0.000030131916,0.00007692893,0.04529538,0.00094681425,0.023945471,0.9260637,0.00085638586],"about_ca_topic_score_codex":0.00034565956,"about_ca_topic_score_gemma":0.00026097952,"teacher_disagreement_score":0.14064814,"about_ca_system_score_codex":0.000027094391,"about_ca_system_score_gemma":0.00014841055,"threshold_uncertainty_score":0.77383935},"labels":[],"label_agreement":null},{"id":"W4252931563","doi":"10.32920/ryerson.14647932.v1","title":"The CC-Game: A Variant Of The Game Of Cops And Robbers","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Set (abstract data type); Computer science; Variation (astronomy); Mathematics; Graph; Theoretical computer science; Mathematical economics; Discrete mathematics; Physics","score_opus":0.011137602613961938,"score_gpt":0.219937970501045,"score_spread":0.20880036788708306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252931563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09132172,0.0019968054,0.8900153,0.006957252,0.0032596749,0.0011565535,0.000015275875,0.00013165557,0.0051457337],"genre_scores_gemma":[0.95119894,0.00015441634,0.047943294,0.00016370548,0.00005770033,0.00002243364,0.0000012816711,0.000011804356,0.00044640584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975104,0.00037379892,0.0005808423,0.0007140444,0.00055026595,0.00027069094],"domain_scores_gemma":[0.9958866,0.00075698446,0.00039843988,0.0025582432,0.00032924314,0.00007043617],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010308165,0.00025264925,0.00047465714,0.00004648827,0.00007523043,0.00024697973,0.0028192294,0.0001708834,0.000016478269],"category_scores_gemma":[0.00024185126,0.00013807272,0.00024900108,0.00037026903,0.00042644606,0.00007840388,0.009703288,0.0005022622,0.0000010828181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052515854,0.004423046,0.0040259855,0.0019014976,0.0013686246,0.00010739136,0.031660635,0.021917867,0.0010024706,0.44448042,0.0027175243,0.486342],"study_design_scores_gemma":[0.0016099975,0.00016500779,0.036792316,0.00036423962,0.000094539915,0.00015497216,0.0005435346,0.834907,0.0034155708,0.11884038,0.0023679445,0.0007444736],"about_ca_topic_score_codex":0.0005858658,"about_ca_topic_score_gemma":0.0001834152,"teacher_disagreement_score":0.8598772,"about_ca_system_score_codex":0.000055487333,"about_ca_system_score_gemma":0.0004956627,"threshold_uncertainty_score":0.99830604},"labels":[],"label_agreement":null},{"id":"W4253058318","doi":"10.1007/978-3-662-53120-4_300553","title":"Programming","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science","score_opus":0.02302250612180193,"score_gpt":0.22952612414552848,"score_spread":0.20650361802372655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253058318","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.647626e-7,0.00016587572,0.3661313,0.00030766337,0.0009322061,0.00041101564,0.0000012264734,0.000554499,0.63149536],"genre_scores_gemma":[0.00015559881,0.00001089782,0.2210024,0.00027758005,0.00023112152,0.0000059534323,0.0000055581,0.0000337026,0.77827716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774015,0.000014736987,0.00035930547,0.0009867965,0.00051927625,0.00037975903],"domain_scores_gemma":[0.99771845,0.00014340083,0.00015687384,0.0017033122,0.00015309454,0.0001248806],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027540894,0.0003953725,0.00043603915,0.00015669045,0.000059331134,0.00029854607,0.0018663477,0.00030607748,0.00045304387],"category_scores_gemma":[0.000014822755,0.00034570188,0.0002486194,0.00005666914,0.00006669209,0.0002196067,0.0014173598,0.00041118063,0.0026654082],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.1234006e-7,0.000011595639,0.0000062852664,0.000022917578,0.000016638262,0.000015128693,0.000031912317,0.0000070901665,6.6853266e-7,0.6408277,0.0010481816,0.35801145],"study_design_scores_gemma":[0.00012408488,0.00013220769,0.000026726364,0.000042574247,0.000009847355,0.000035985344,0.0000012238038,0.01030708,0.00001023027,0.10214187,0.8866004,0.00056778634],"about_ca_topic_score_codex":0.000014472726,"about_ca_topic_score_gemma":0.00001374438,"teacher_disagreement_score":0.8855522,"about_ca_system_score_codex":0.00011787351,"about_ca_system_score_gemma":0.00021875062,"threshold_uncertainty_score":0.9998995},"labels":[],"label_agreement":null},{"id":"W4253648496","doi":"10.1007/978-94-015-9496-7_1","title":"Introduction","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Cybernetics; Computer science; Control (management); Artificial intelligence; Term (time); Cognitive science; Management science; Epistemology; Engineering; Philosophy; Psychology","score_opus":0.013281670387161904,"score_gpt":0.20624121468760925,"score_spread":0.19295954430044734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253648496","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011319377,0.00014065583,0.2109936,0.0031252499,0.0013809591,0.00018206854,0.0000017847826,0.0005869493,0.7835876],"genre_scores_gemma":[0.00008080337,0.00008725514,0.06337194,0.00035766093,0.0030057977,0.0000049302944,0.000012020433,0.000028421502,0.93305117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800986,0.000017648745,0.0003339441,0.000984813,0.00040233368,0.00025140107],"domain_scores_gemma":[0.9981546,0.000052795935,0.00009587222,0.0014959996,0.00009908656,0.00010164147],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019420068,0.00032592748,0.00032355066,0.00017726269,0.0000740204,0.00016817417,0.0011289015,0.00025597413,0.0063614203],"category_scores_gemma":[0.000009536507,0.00029932632,0.0001706205,0.000060499722,0.00007466822,0.00024580205,0.0004207014,0.00036386124,0.00341104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011746988,0.000012365949,3.2178534e-7,0.000005259375,0.000013066018,0.000009027293,0.000023570798,0.000043825396,0.0000014672221,0.6656459,0.024685053,0.309559],"study_design_scores_gemma":[0.000052499312,0.000052646465,0.0000113086435,0.000005351173,0.0000057042766,0.000045132605,2.450878e-7,0.0039107455,0.000016518134,0.3071897,0.6884423,0.00026784994],"about_ca_topic_score_codex":0.000014214109,"about_ca_topic_score_gemma":0.000009349354,"teacher_disagreement_score":0.66375726,"about_ca_system_score_codex":0.00012760551,"about_ca_system_score_gemma":0.00008277871,"threshold_uncertainty_score":0.9999459},"labels":[],"label_agreement":null},{"id":"W4253665943","doi":"10.1090/stml/088/05","title":"Computability and provability","year":2019,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Queen's University","funders":"","keywords":"Computability; Mathematics; Computer science; Discrete mathematics","score_opus":0.014742999941506392,"score_gpt":0.23464398035270087,"score_spread":0.2199009804111945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253665943","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012518247,0.0010901975,0.060234446,0.0023337717,0.0007064696,0.0029977271,0.00004824262,0.0013646337,0.9299727],"genre_scores_gemma":[0.028143993,0.00015623648,0.43850076,0.0023747839,0.0009117762,0.00013640385,0.000075524054,0.0004314758,0.52926904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955307,0.0001171009,0.0010392787,0.0017395663,0.0010448493,0.00052845484],"domain_scores_gemma":[0.9955506,0.0012104433,0.00028813543,0.002518322,0.00007726869,0.00035525172],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00054771046,0.00075566553,0.0012597804,0.00014341941,0.00008737619,0.0005363412,0.0023281453,0.0004439658,0.0007681408],"category_scores_gemma":[0.00006698727,0.00063274585,0.00034584737,0.00011066765,0.00046235128,0.00090097403,0.006186087,0.0008118319,0.00086819736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058636115,0.00031953523,0.00037071502,0.000734655,0.00007790664,0.000025317593,0.00039487352,0.0000050966178,8.4070297e-7,0.9753746,0.0010569852,0.02163364],"study_design_scores_gemma":[0.00032764414,0.0002478143,0.0029916712,0.0001942399,0.000037822745,0.000034832345,0.000011131084,0.009499569,0.0000074505874,0.96833456,0.017526412,0.0007868621],"about_ca_topic_score_codex":6.28809e-7,"about_ca_topic_score_gemma":4.046306e-7,"teacher_disagreement_score":0.40070364,"about_ca_system_score_codex":0.00008183656,"about_ca_system_score_gemma":0.00024553083,"threshold_uncertainty_score":0.99990976},"labels":[],"label_agreement":null},{"id":"W4253787154","doi":"10.4006/1.3254505","title":"Complexity Theory Gives Hints for Final Answers to Fundamental Physical Questions","year":2007,"lang":"en","type":"article","venue":"Physics Essays","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Theoretical physics; Statistical physics","score_opus":0.07490741098516902,"score_gpt":0.33845365793134263,"score_spread":0.2635462469461736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253787154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055397205,0.000012617213,0.9378433,0.000596906,0.0005675197,0.0005113631,0.000044620727,0.00027594026,0.0047505307],"genre_scores_gemma":[0.8743489,4.1318899e-7,0.124552615,0.00036896757,0.000583315,0.00003919913,0.000011940759,0.000016302696,0.00007837684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807906,0.00009566202,0.00023935962,0.000647939,0.0003693559,0.0005686513],"domain_scores_gemma":[0.9981301,0.00071107876,0.00008205923,0.0006739311,0.00016684513,0.00023600206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007076176,0.00024641393,0.00028491928,0.00006541372,0.00031536806,0.00015286387,0.0009894124,0.000040980303,0.000007508407],"category_scores_gemma":[0.000078101424,0.00024303125,0.0001986699,0.00045308113,0.0002311038,0.00039948156,0.00050892244,0.0001799495,0.000075301294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028794524,0.00058322534,0.00026559786,0.000016508822,0.00002130747,0.00000320198,0.001854798,0.00046478317,0.0007319662,0.9053411,0.00031172152,0.09037698],"study_design_scores_gemma":[0.00036907138,0.00023875419,0.0048374822,0.000013130342,0.0000115529665,0.0000043295254,0.00008612171,0.055291604,0.0015315696,0.9367889,0.00050743506,0.0003200089],"about_ca_topic_score_codex":0.000032294167,"about_ca_topic_score_gemma":0.000017282775,"teacher_disagreement_score":0.81895167,"about_ca_system_score_codex":0.0001744276,"about_ca_system_score_gemma":0.00006919912,"threshold_uncertainty_score":0.9910527},"labels":[],"label_agreement":null},{"id":"W4253859377","doi":"10.1002/asi.20664","title":"Description and search labor for information retrieval","year":2007,"lang":"en","type":"article","venue":"Journal of the American Society for Information Science and Technology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University","keywords":"Labor relations; Computer science; Selection (genetic algorithm); Labor history; Information retrieval; Labour economics; Economics; Artificial intelligence","score_opus":0.016056975671447597,"score_gpt":0.28399925812844123,"score_spread":0.26794228245699364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253859377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40256795,0.000022555816,0.59094256,0.0059314566,0.00020388712,0.00026866587,0.000004387353,0.000029888832,0.000028661603],"genre_scores_gemma":[0.81354976,0.0000586753,0.18490042,0.0014422906,0.000038733317,0.0000035158082,5.0916077e-7,0.000001808345,0.0000043065265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862677,0.000008386701,0.00048067933,0.00008846657,0.0005179511,0.0002777374],"domain_scores_gemma":[0.9968067,0.000167258,0.0006866404,0.00021747056,0.0020521,0.000069857415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004491743,0.00008004773,0.00016384719,0.0004040464,0.0004680511,0.00029463132,0.00083385047,0.000055594894,1.481424e-7],"category_scores_gemma":[0.00083508925,0.0000554509,0.00009460829,0.0027655496,0.0012395077,0.005662857,0.0003165178,0.00017570012,5.704369e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078026475,0.000029660301,0.0024539256,0.000057872967,0.000026768432,9.387112e-8,0.005044335,0.00006738014,0.003920163,0.05656837,0.0011167015,0.9306367],"study_design_scores_gemma":[0.0054597426,0.0065979413,0.114464074,0.000101094665,0.000093688315,0.0012366814,0.04216433,0.47572201,0.047370024,0.06917971,0.23662367,0.0009870139],"about_ca_topic_score_codex":0.000004650904,"about_ca_topic_score_gemma":7.112824e-7,"teacher_disagreement_score":0.9296497,"about_ca_system_score_codex":0.00016066457,"about_ca_system_score_gemma":0.00030752295,"threshold_uncertainty_score":0.4567018},"labels":[],"label_agreement":null},{"id":"W4254365644","doi":"10.1007/978-3-319-70151-6_11","title":"Turing Machines","year":2018,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Ingenuity; Turing; Computer science; Creativity; Description number; Universal Turing machine; Turing machine; Theoretical computer science; Cognitive science; Artificial intelligence; Programming language; Epistemology; Psychology; Philosophy","score_opus":0.02651627759676215,"score_gpt":0.25796109282492985,"score_spread":0.2314448152281677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254365644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022310772,0.00020710904,0.89279187,0.0036408058,0.0067077195,0.00048057994,0.0000040017885,0.00051153055,0.0954333],"genre_scores_gemma":[0.010333924,0.00017788197,0.8836958,0.0016048341,0.0042549265,0.000020482117,0.000008559185,0.00010458055,0.09979901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940199,0.000060110044,0.00088632706,0.0024898131,0.00151386,0.0010299705],"domain_scores_gemma":[0.9958546,0.00022874288,0.00036839998,0.0028012109,0.00042915964,0.00031789488],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013838813,0.00075342384,0.000720411,0.0010926571,0.00040381902,0.0010589849,0.0067717843,0.00029897012,0.000058489637],"category_scores_gemma":[0.000057092573,0.0007318676,0.00022462293,0.0006960429,0.0012880608,0.0009901831,0.005307856,0.00087137875,0.00030396087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027700207,0.000073410185,0.00011089366,0.00007847815,0.000019635487,0.00022609172,0.00047700424,0.0010151478,0.000008995031,0.6252299,0.0011031398,0.37165454],"study_design_scores_gemma":[0.00021920245,0.00014934939,0.0002434031,0.00015445791,0.0000067757387,0.00008261608,4.7258328e-7,0.36895424,0.00007373872,0.61103064,0.0183646,0.000720513],"about_ca_topic_score_codex":0.0000418261,"about_ca_topic_score_gemma":0.00012156246,"teacher_disagreement_score":0.37093404,"about_ca_system_score_codex":0.00063781935,"about_ca_system_score_gemma":0.0006456161,"threshold_uncertainty_score":0.999978},"labels":[],"label_agreement":null},{"id":"W4255317507","doi":"10.1145/3388974.3388977","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computation; Algebra over a field; Computer science; Quarter (Canadian coin); Library science; Mathematics education; Mathematics; Algorithm; Pure mathematics; History","score_opus":0.08633072774261363,"score_gpt":0.32632190049880827,"score_spread":0.23999117275619464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255317507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23982562,0.00049271947,0.722667,0.034342002,0.00069167255,0.001012756,0.00001430449,0.00044419747,0.0005097302],"genre_scores_gemma":[0.5470708,0.00012611164,0.4516803,0.00094512134,0.00007990531,0.000041593637,0.000036365844,0.000018050921,0.0000017810631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585116,0.0006093512,0.0015829998,0.0008983923,0.0004822344,0.00057586544],"domain_scores_gemma":[0.99188423,0.0016508894,0.00039793013,0.0054855687,0.00032313075,0.00025825071],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00073050515,0.0004008654,0.0006666695,0.00044156978,0.00016514157,0.00022166297,0.0095692035,0.00016980372,0.000044004977],"category_scores_gemma":[0.0002628239,0.00043823963,0.00016758016,0.0026853401,0.0002778432,0.0008440142,0.0060924757,0.00081742555,0.000074961674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003820621,0.0032322223,0.04606142,0.00015703186,0.000121121884,0.000059627502,0.02008949,0.04023484,0.00031999664,0.080174066,0.0014528771,0.8080591],"study_design_scores_gemma":[0.0011633087,0.000252636,0.22403124,0.00009488404,0.000010574934,0.000015753229,0.000051747957,0.7443071,0.0002449029,0.027003046,0.002253098,0.0005717043],"about_ca_topic_score_codex":0.00028718417,"about_ca_topic_score_gemma":0.00053306465,"teacher_disagreement_score":0.80748737,"about_ca_system_score_codex":0.00018537184,"about_ca_system_score_gemma":0.00024168036,"threshold_uncertainty_score":0.99980694},"labels":[],"label_agreement":null},{"id":"W4255439410","doi":"10.1007/978-1-4939-7131-2_100472","title":"Human Computation","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.038740741309610416,"score_gpt":0.2743630431792605,"score_spread":0.2356223018696501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255439410","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012102811,0.00003461714,0.4677476,0.00016882173,0.0006066474,0.00019941527,0.0000021613857,0.0005074392,0.5307212],"genre_scores_gemma":[0.002528363,0.000004019128,0.17584991,0.00060373713,0.0009796064,0.0000069491693,0.00003080869,0.000056710207,0.8199399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976606,0.000028325056,0.00047422948,0.0009856365,0.00054819114,0.00030302137],"domain_scores_gemma":[0.9981468,0.00008448523,0.00023196834,0.0010690098,0.0003283237,0.00013941195],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031250092,0.00041058162,0.000413069,0.00022345585,0.00018468636,0.0002798948,0.001440333,0.0003151062,0.0014545695],"category_scores_gemma":[0.000009801485,0.00038778133,0.00020012922,0.00006385849,0.00017831757,0.00023910921,0.0010689541,0.00030407181,0.0021955397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.4691494e-7,0.000031413765,0.0000033436147,0.000025093097,0.000037476653,0.000022792117,0.00017972256,0.000041768708,0.000008189243,0.91620535,0.03012479,0.053319413],"study_design_scores_gemma":[0.00019960642,0.000273539,0.00013189598,0.00004234666,0.000014453456,0.000031640215,0.0000018168028,0.03432922,0.000024439143,0.8502088,0.11407708,0.00066517113],"about_ca_topic_score_codex":0.000019854073,"about_ca_topic_score_gemma":0.000034190147,"teacher_disagreement_score":0.29189768,"about_ca_system_score_codex":0.00015010816,"about_ca_system_score_gemma":0.000088018045,"threshold_uncertainty_score":0.9998574},"labels":[],"label_agreement":null},{"id":"W4255733729","doi":"10.1007/978-3-030-11298-1_2","title":"Algorithmic Complexity","year":2019,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Object (grammar); Relation (database); Set (abstract data type); Computer science; Natural (archaeology); Theoretical computer science; Mathematics; Artificial intelligence; Data mining; Programming language; Geography","score_opus":0.04288801086283786,"score_gpt":0.2696354316213806,"score_spread":0.22674742075854273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255733729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012950371,0.0003410914,0.8775517,0.0006531308,0.0058093155,0.0010947506,0.000017096057,0.00064706523,0.11375634],"genre_scores_gemma":[0.012727052,0.00006534743,0.9357897,0.0016464356,0.0012468279,0.000022220784,0.00001409545,0.00011541149,0.048372895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99172187,0.0000860637,0.0011238164,0.0034330967,0.0022457014,0.0013894503],"domain_scores_gemma":[0.9938141,0.00043039856,0.00051472516,0.0043315357,0.0004954443,0.0004137986],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023657333,0.0009680368,0.0011722802,0.0014009583,0.00034147417,0.0009862728,0.01086019,0.00041003167,0.00016417814],"category_scores_gemma":[0.000043717584,0.0009727174,0.00030799973,0.0009952213,0.0020832892,0.0013953266,0.0076278923,0.0013175941,0.0016200051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032702656,0.00010320438,0.00005629521,0.00006262315,0.0000139783815,0.00017664548,0.00035312556,0.0013927859,0.000014592704,0.5274622,0.00073690113,0.46962437],"study_design_scores_gemma":[0.00050148263,0.00027194008,0.001582857,0.00024727313,0.0000070630485,0.00016583255,7.888309e-7,0.681719,0.0000445325,0.29546186,0.018689219,0.001308147],"about_ca_topic_score_codex":0.000056286015,"about_ca_topic_score_gemma":0.00005275934,"teacher_disagreement_score":0.6803262,"about_ca_system_score_codex":0.0009844411,"about_ca_system_score_gemma":0.0017201377,"threshold_uncertainty_score":0.99927235},"labels":[],"label_agreement":null},{"id":"W4256174452","doi":"10.32920/ryerson.14647932","title":"The CC-Game: A Variant Of The Game Of Cops And Robbers","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Set (abstract data type); Computer science; Combinatorics; Variation (astronomy); Graph; Mathematics; Theoretical computer science; Mathematical economics; Physics","score_opus":0.011137602613961938,"score_gpt":0.219937970501045,"score_spread":0.20880036788708306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256174452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09132172,0.0019968054,0.8900153,0.006957252,0.0032596749,0.0011565535,0.000015275875,0.00013165557,0.0051457337],"genre_scores_gemma":[0.95119894,0.00015441634,0.047943294,0.00016370548,0.00005770033,0.00002243364,0.0000012816711,0.000011804356,0.00044640584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975104,0.00037379892,0.0005808423,0.0007140444,0.00055026595,0.00027069094],"domain_scores_gemma":[0.9958866,0.00075698446,0.00039843988,0.0025582432,0.00032924314,0.00007043617],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010308165,0.00025264925,0.00047465714,0.00004648827,0.00007523043,0.00024697973,0.0028192294,0.0001708834,0.000016478269],"category_scores_gemma":[0.00024185126,0.00013807272,0.00024900108,0.00037026903,0.00042644606,0.00007840388,0.009703288,0.0005022622,0.0000010828181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052515854,0.004423046,0.0040259855,0.0019014976,0.0013686246,0.00010739136,0.031660635,0.021917867,0.0010024706,0.44448042,0.0027175243,0.486342],"study_design_scores_gemma":[0.0016099975,0.00016500779,0.036792316,0.00036423962,0.000094539915,0.00015497216,0.0005435346,0.834907,0.0034155708,0.11884038,0.0023679445,0.0007444736],"about_ca_topic_score_codex":0.0005858658,"about_ca_topic_score_gemma":0.0001834152,"teacher_disagreement_score":0.8598772,"about_ca_system_score_codex":0.000055487333,"about_ca_system_score_gemma":0.0004956627,"threshold_uncertainty_score":0.99830604},"labels":[],"label_agreement":null},{"id":"W4280490155","doi":"","title":"Central Submonads and Notions of Computation","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Computation; Computer science; History; Programming language","score_opus":0.016542499540476124,"score_gpt":0.23586676823505992,"score_spread":0.2193242686945838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280490155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076653086,0.000723619,0.9065523,0.0067231297,0.00055632816,0.0005327574,0.000070070855,0.00031441933,0.007874257],"genre_scores_gemma":[0.7480526,0.00016535909,0.25080997,0.00005276474,0.000018348126,0.000054774384,0.0002161571,0.00002451872,0.0006055057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924333,0.004656795,0.0007136154,0.0010995273,0.0006733762,0.0004233777],"domain_scores_gemma":[0.9937608,0.0017464171,0.0006403032,0.00215271,0.0014817236,0.00021804297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0040927134,0.0003428414,0.00047722613,0.00029478027,0.0004063486,0.0003960564,0.002192929,0.00019139137,0.00009262268],"category_scores_gemma":[0.0007169146,0.00039822905,0.00021741752,0.00066028564,0.00031294735,0.00023599851,0.0060973107,0.00073611806,0.0000040591394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015015311,0.0024127862,0.015818508,0.0006906984,0.00020579573,0.000020122003,0.03407769,0.013363878,0.0010587666,0.6098249,0.0011348068,0.321377],"study_design_scores_gemma":[0.0007314282,0.000002322846,0.08481881,0.00044696222,0.000052281433,0.000031605417,0.00013739424,0.8404255,0.0045613013,0.06411106,0.0038805867,0.00080074056],"about_ca_topic_score_codex":0.0012232631,"about_ca_topic_score_gemma":0.00047252222,"teacher_disagreement_score":0.8270616,"about_ca_system_score_codex":0.00020364576,"about_ca_system_score_gemma":0.00042982431,"threshold_uncertainty_score":0.99984694},"labels":[],"label_agreement":null},{"id":"W4281708143","doi":"10.37236/10764","title":"Shattering and More: Extending the Complete Object","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Mathematics; Multiset; TRACE (psycholinguistics); Philosophy","score_opus":0.011696916278997643,"score_gpt":0.2291250644863417,"score_spread":0.21742814820734407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281708143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4556177,0.016148452,0.5030247,0.021769052,0.0026133049,0.00041477723,0.000001946172,0.000093355506,0.00031673064],"genre_scores_gemma":[0.99906415,0.0002103933,0.00016881376,0.00039641053,0.000095008625,0.0000067486653,1.7036595e-7,0.0000123263335,0.000045977617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976194,0.00045642798,0.0003994427,0.00020077034,0.000738269,0.00058569893],"domain_scores_gemma":[0.9982684,0.00062409346,0.00037888277,0.00055266416,0.00011089561,0.00006504058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003283352,0.00016048802,0.00025182567,0.00010494297,0.00089817605,0.00018996336,0.0024845684,0.000019325546,0.000011878572],"category_scores_gemma":[0.000068187284,0.0000991855,0.00012107302,0.00071787543,0.00010511393,0.00024158048,0.0013665106,0.001240764,0.0000013254022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023441064,0.0001321556,0.0005450954,0.000010390746,0.00010326561,0.000041421146,0.0025194276,0.002506268,0.00043945556,0.977755,0.00039961675,0.015524476],"study_design_scores_gemma":[0.00085630105,0.0011141928,0.004700226,0.000010349154,0.00004170861,0.0038234233,0.0004942999,0.064890556,0.00014160245,0.90633094,0.01733387,0.00026251381],"about_ca_topic_score_codex":0.000011047019,"about_ca_topic_score_gemma":0.0000014903325,"teacher_disagreement_score":0.5434465,"about_ca_system_score_codex":0.0005095475,"about_ca_system_score_gemma":0.00028309468,"threshold_uncertainty_score":0.6908135},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"Wellcome Trust","keywords":"Psychology; Cognitive psychology; Cognitive science","score_opus":0.17089247048061854,"score_gpt":0.410785035889401,"score_spread":0.23989256540878248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281750406","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066714238,0.9414508,0.011118091,0.000064903405,0.0011839657,0.0004523088,0.00010756331,0.00011050247,0.0455052],"genre_scores_gemma":[0.00030500608,0.99697655,0.0021463695,0.000032245127,0.000036907582,0.00017774318,0.000061747975,0.000007950457,0.00025547252],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99564147,0.0013762817,0.0010109466,0.00060422445,0.00091089366,0.00045616642],"domain_scores_gemma":[0.99243015,0.006066703,0.0007812448,0.00050720386,0.00015460061,0.000060083792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047399485,0.0003684448,0.00083646877,0.0011000583,0.0005019888,0.0003548362,0.0035619743,0.00010494436,0.00028620797],"category_scores_gemma":[0.0011527108,0.00021921139,0.00030983763,0.0066636107,0.0011846609,0.000977517,0.0013029524,0.0006353392,0.000017462846],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020611067,0.00004435056,0.000004906972,0.00012667634,0.000018033927,0.0000013241279,0.00038673615,0.0000035539792,4.321184e-9,0.020175101,0.000056216435,0.97918105],"study_design_scores_gemma":[0.00019002754,0.00034772942,0.00006837307,0.0012668391,0.000063865315,0.00002355763,0.0013533139,0.0037516803,0.0000019799554,0.010414043,0.98208797,0.00043062493],"about_ca_topic_score_codex":0.00005323376,"about_ca_topic_score_gemma":0.00005902394,"teacher_disagreement_score":0.98203176,"about_ca_system_score_codex":0.0001667926,"about_ca_system_score_gemma":0.0006146322,"threshold_uncertainty_score":0.89391816},"labels":[],"label_agreement":null},{"id":"W428178841","doi":"","title":"Futures of Hypercomplexity","year":2013,"lang":"en","type":"article","venue":"Research Online (University of Wollongong)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Futures contract; Business; Finance","score_opus":0.08295262658683387,"score_gpt":0.30962547422949344,"score_spread":0.22667284764265955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W428178841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94049895,0.0001478847,0.051579177,0.0051942947,0.00011058224,0.00047320288,0.00003047202,0.00010880475,0.0018566344],"genre_scores_gemma":[0.80816334,0.00005410851,0.19100003,0.000018723393,0.00007006836,4.978166e-7,0.000008989498,0.0000074745117,0.0006767711],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99737513,0.00040059813,0.00020863737,0.00050012476,0.0010060928,0.00050943077],"domain_scores_gemma":[0.99691015,0.00044993893,0.000110821224,0.0010862264,0.0012049092,0.00023792367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009835265,0.00013610994,0.00036337358,0.0004898863,0.00027089228,0.000040943218,0.0027001924,0.000109186636,0.0003911015],"category_scores_gemma":[0.00018805925,0.00014734188,0.00017494622,0.0014142124,0.0006827298,0.00069753174,0.002054315,0.00043029073,0.000082441315],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013706264,0.005905747,0.027251782,0.00073708803,0.0003794278,0.00017043031,0.012203692,0.0007933184,0.028423088,0.10574028,0.029265592,0.78899246],"study_design_scores_gemma":[0.0013990086,0.00087024237,0.725497,0.00007687783,0.000012914118,0.000023565064,0.005503127,0.21929713,0.0009498211,0.040760055,0.0051406026,0.00046964412],"about_ca_topic_score_codex":0.006088339,"about_ca_topic_score_gemma":0.0007596256,"teacher_disagreement_score":0.78852284,"about_ca_system_score_codex":0.00009907213,"about_ca_system_score_gemma":0.00024294134,"threshold_uncertainty_score":0.92037874},"labels":[],"label_agreement":null},{"id":"W4281860734","doi":"10.3390/e24070985","title":"An Algorithmic Approach to Emergence","year":2022,"lang":"en","type":"article","venue":"Entropy","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Center of Competence in Research Quantum Science and Technology; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Granularity; String (physics); Basis (linear algebra); Theoretical computer science; Computer science; Function (biology); Boundary (topology); Statistical physics; Theoretical physics; Mathematics; Physics; Mathematical analysis","score_opus":0.0150655340344998,"score_gpt":0.24955908431415125,"score_spread":0.23449355027965144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281860734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019230701,0.00007295193,0.9763197,0.00075712637,0.0012976096,0.0004003374,0.000008519937,0.00041827463,0.0014947952],"genre_scores_gemma":[0.59175926,0.0000014128539,0.40691432,0.0006992073,0.00023028628,0.0001782748,0.0000074944196,0.000014645303,0.00019510087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975552,0.00026430434,0.0002450684,0.0008287998,0.00063850224,0.0004681142],"domain_scores_gemma":[0.9983601,0.00003665132,0.000056457822,0.0012364527,0.000055388406,0.0002549447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005129246,0.00017189415,0.00018213374,0.00013764523,0.00038184336,0.000121693316,0.0025334165,0.00002366831,0.00025505645],"category_scores_gemma":[0.00002531725,0.00017964549,0.000079695055,0.00096374634,0.000027270462,0.0002914533,0.0013515322,0.00024412456,0.00011661536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003782545,0.003989991,0.0031747485,0.000032255903,0.0000666191,0.000112680755,0.013260312,0.1670121,0.009369174,0.47864762,0.026558114,0.29773855],"study_design_scores_gemma":[0.00026852867,0.0004899212,0.003382861,8.956213e-7,0.00000401511,0.00005763907,0.00021133485,0.95893925,0.00043206225,0.009025632,0.026788838,0.0003990223],"about_ca_topic_score_codex":0.00006458316,"about_ca_topic_score_gemma":0.0000011675727,"teacher_disagreement_score":0.79192716,"about_ca_system_score_codex":0.00014111548,"about_ca_system_score_gemma":0.00007562688,"threshold_uncertainty_score":0.7325731},"labels":[],"label_agreement":null},{"id":"W4283015706","doi":"10.1142/s0219061322500222","title":"Every Δ20 degree is a strong degree of categoricity","year":2022,"lang":"en","type":"article","venue":"Journal of Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Mathematics; Isomorphism (crystallography); Categorical variable; Combinatorics; Discrete mathematics; Statistics","score_opus":0.0987494393646112,"score_gpt":0.28817270318153587,"score_spread":0.18942326381692468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283015706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07428008,0.00033295638,0.91903967,0.0019322081,0.00047122873,0.00020527493,0.000006637717,0.000045292258,0.003686626],"genre_scores_gemma":[0.82938784,0.0000057285592,0.17011446,0.00027476597,0.00010107591,0.0000061569776,2.5706817e-7,0.000010676261,0.00009902273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996581,0.00031568285,0.0011343203,0.0002876601,0.0013079351,0.00037336664],"domain_scores_gemma":[0.9971905,0.00082720985,0.0008219841,0.0006468762,0.00032032037,0.00019313529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002156532,0.00021148309,0.0006917345,0.0002211834,0.00015263545,0.000066411834,0.0021032905,0.00006463486,0.000662645],"category_scores_gemma":[0.00044480755,0.00016062136,0.00039456924,0.0006221688,0.00011313849,0.00032873623,0.0012601576,0.00063891633,0.00002435972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020045726,0.0077434652,0.003028455,0.00085227535,0.00053687516,0.0011327252,0.007434234,0.0068221833,0.0017305915,0.83385265,0.01138421,0.12528186],"study_design_scores_gemma":[0.00078812015,0.0016044497,0.0046278215,0.000037955484,0.00006267662,0.0016948791,0.00032182893,0.08725965,0.00070450426,0.9021146,0.000456003,0.00032746178],"about_ca_topic_score_codex":0.0000066174525,"about_ca_topic_score_gemma":8.5421505e-7,"teacher_disagreement_score":0.75510776,"about_ca_system_score_codex":0.00022767378,"about_ca_system_score_gemma":0.00022537162,"threshold_uncertainty_score":0.72554976},"labels":[],"label_agreement":null},{"id":"W4283810345","doi":"10.3390/philosophies7040076","title":"The Accidental Philosopher and One of the Hardest Problems in the World","year":2022,"lang":"en","type":"article","venue":"Philosophies","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Conversation; Turing; Generality; Imitation; Computer science; Cognitive science; Turing test; Epistemology; Artificial intelligence; Psychology; Communication; Social psychology; Philosophy","score_opus":0.03246777835667378,"score_gpt":0.23792381109683441,"score_spread":0.20545603274016064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283810345","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36220157,0.006595257,0.0011289313,0.6024574,0.0024821393,0.0034952366,0.000032295844,0.00024865454,0.021358524],"genre_scores_gemma":[0.9982212,0.000027170918,0.000588147,0.0007588917,0.0001748876,0.00013911627,6.379059e-7,0.000009227633,0.00008071613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978611,0.00048010357,0.0003406243,0.0003614323,0.0006922491,0.00026451025],"domain_scores_gemma":[0.9981136,0.0006316169,0.000159233,0.0010237126,0.000042785832,0.000029060351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012053252,0.000157813,0.00018312344,0.000094795345,0.0007336938,0.00016990314,0.0026817392,0.000018703504,0.000022789158],"category_scores_gemma":[0.000055783745,0.00008446005,0.00009155225,0.001144309,0.0004035302,0.00019955351,0.0024758808,0.00041792452,0.0000036228828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023693457,0.00070783246,0.03140724,0.00005414173,0.00006193207,0.000010560783,0.0080154445,0.0020267293,0.0003580907,0.94498086,0.0009839685,0.011369509],"study_design_scores_gemma":[0.00034528182,0.0001130882,0.0811098,0.000016667987,0.0000101366395,0.000043337423,0.00020136748,0.00273409,0.00017018507,0.9114987,0.0035876816,0.00016961915],"about_ca_topic_score_codex":0.00006604518,"about_ca_topic_score_gemma":0.00036156637,"teacher_disagreement_score":0.63601965,"about_ca_system_score_codex":0.00005557176,"about_ca_system_score_gemma":0.000051032315,"threshold_uncertainty_score":0.56430537},"labels":[],"label_agreement":null},{"id":"W4285369719","doi":"10.1145/3511528.3511540","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2021,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computation; Algebra over a field; Computer science; Quarter (Canadian coin); Library science; Mathematics education; Mathematics; Algorithm; History; Pure mathematics","score_opus":0.06720036151748661,"score_gpt":0.33045710510841414,"score_spread":0.26325674359092754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285369719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3470636,0.0010752693,0.63424677,0.014302283,0.0013157306,0.00074308,0.00001512169,0.0003469768,0.00089114415],"genre_scores_gemma":[0.49682266,0.00024047878,0.50234747,0.00039464264,0.00006056645,0.00004470388,0.00006288527,0.000017566439,0.000009010246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955769,0.0008068082,0.0015857101,0.0009256315,0.0004955483,0.0006093873],"domain_scores_gemma":[0.98874825,0.0020974916,0.0003633161,0.008030857,0.00058542576,0.00017465913],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009340315,0.00038600608,0.0006593835,0.0005469395,0.00019111703,0.00026990206,0.007332255,0.00018739293,0.00006320542],"category_scores_gemma":[0.00027615143,0.00043582104,0.00018311256,0.0029175265,0.00026813595,0.0008083946,0.0065906527,0.00077761814,0.000052364216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001565541,0.00497894,0.043521866,0.00011361111,0.0001224611,0.00013545854,0.008084709,0.022837404,0.00039613436,0.11040148,0.0008069145,0.80858535],"study_design_scores_gemma":[0.001420053,0.00014608278,0.43997106,0.00019711086,0.000014945731,0.000079117985,0.00007738488,0.47430676,0.00088239985,0.07931797,0.0028549412,0.00073217734],"about_ca_topic_score_codex":0.00030797176,"about_ca_topic_score_gemma":0.0018348191,"teacher_disagreement_score":0.80785316,"about_ca_system_score_codex":0.00026546212,"about_ca_system_score_gemma":0.00044323152,"threshold_uncertainty_score":0.9998094},"labels":[],"label_agreement":null},{"id":"W4285732790","doi":"10.3390/e24070985","title":"An Algorithmic Approach to Emergence","year":2022,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Center of Competence in Research Quantum Science and Technology; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Theoretical computer science; Statistical physics; Physics","score_opus":0.06405267392638761,"score_gpt":0.18309857362372867,"score_spread":0.11904589969734106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285732790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14667417,0.000013668685,0.8489428,0.00010179557,0.0004749001,0.00029773606,0.000008183302,0.0003825187,0.0031042176],"genre_scores_gemma":[0.9640094,0.0000029772218,0.035033077,0.00028843933,0.00006217508,0.000004703326,0.000005433562,0.000012964474,0.00058082445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758345,0.00030064717,0.00016994464,0.001268112,0.00020009416,0.00047776036],"domain_scores_gemma":[0.9979754,0.000052286538,0.00007440452,0.0014668468,0.00009641909,0.00033461722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004823261,0.00020784013,0.0002021524,0.00026405771,0.0005430437,0.00007516633,0.0033094457,0.000041079424,0.00013458917],"category_scores_gemma":[0.00001659131,0.00025796774,0.0001106338,0.002412412,0.000058453053,0.0006174745,0.0018545479,0.00028177703,0.000093136325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017795513,0.00076345046,0.0024755113,0.000008958903,0.000023409691,0.00015388496,0.0010893109,0.76977754,0.00022476102,0.21665013,0.0007994144,0.008015812],"study_design_scores_gemma":[0.00025747906,0.00028850982,0.0024818708,0.0000010204732,0.000008568654,0.000023305489,0.00036348565,0.9817181,0.000055107615,0.011907162,0.0025250493,0.00037031644],"about_ca_topic_score_codex":0.0001413502,"about_ca_topic_score_gemma":0.000008351412,"teacher_disagreement_score":0.81733525,"about_ca_system_score_codex":0.0002331645,"about_ca_system_score_gemma":0.00010709497,"threshold_uncertainty_score":0.99998724},"labels":[],"label_agreement":null},{"id":"W4287812805","doi":"","title":"Polynomial time over the reals with parsimony","year":2020,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Polynomial; Time complexity; Mathematics; Computer science; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.014079785774311274,"score_gpt":0.21792361964767173,"score_spread":0.20384383387336047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287812805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03647216,0.000706312,0.8359937,0.074972585,0.0005673352,0.0013907063,0.000074139316,0.001135858,0.048687186],"genre_scores_gemma":[0.6901501,0.00018816021,0.3006824,0.0013158746,0.00021798113,0.00015905446,0.00024376568,0.00011328634,0.006929385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903697,0.00598414,0.0006339913,0.0015778892,0.0008760606,0.0005582236],"domain_scores_gemma":[0.9899068,0.0024953098,0.0006458834,0.0052417093,0.0014049453,0.00030537898],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0049726693,0.00053309195,0.0005779828,0.00013467492,0.00045415794,0.0013409756,0.0060721,0.00028580936,0.00013424264],"category_scores_gemma":[0.000930445,0.00041421043,0.00028721025,0.0007794625,0.00044433607,0.0002692355,0.007126584,0.0011370042,0.0002027585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018717669,0.0043336577,0.0113429725,0.0008002283,0.0013824567,0.00022488821,0.082007825,0.003731378,0.005153687,0.21855144,0.17881408,0.49347022],"study_design_scores_gemma":[0.0016781456,0.000005452527,0.03571227,0.0014570171,0.00014502255,0.000072633484,0.00007747927,0.82541615,0.0135119185,0.021114713,0.098691456,0.0021177286],"about_ca_topic_score_codex":0.0011479463,"about_ca_topic_score_gemma":0.0006213633,"teacher_disagreement_score":0.8216848,"about_ca_system_score_codex":0.00019245651,"about_ca_system_score_gemma":0.00065704045,"threshold_uncertainty_score":0.99983096},"labels":[],"label_agreement":null},{"id":"W4288065989","doi":"10.1145/3551872.3551873","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2021,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Algebra over a field; Computation; Computer science; Quarter (Canadian coin); Library science; Mathematics education; Mathematics; Algorithm; Pure mathematics; History","score_opus":0.06720036151748661,"score_gpt":0.33045710510841414,"score_spread":0.26325674359092754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288065989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3470636,0.0010752693,0.63424677,0.014302283,0.0013157306,0.00074308,0.00001512169,0.0003469768,0.00089114415],"genre_scores_gemma":[0.49682266,0.00024047878,0.50234747,0.00039464264,0.00006056645,0.00004470388,0.00006288527,0.000017566439,0.000009010246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955769,0.0008068082,0.0015857101,0.0009256315,0.0004955483,0.0006093873],"domain_scores_gemma":[0.98874825,0.0020974916,0.0003633161,0.008030857,0.00058542576,0.00017465913],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009340315,0.00038600608,0.0006593835,0.0005469395,0.00019111703,0.00026990206,0.007332255,0.00018739293,0.00006320542],"category_scores_gemma":[0.00027615143,0.00043582104,0.00018311256,0.0029175265,0.00026813595,0.0008083946,0.0065906527,0.00077761814,0.000052364216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001565541,0.00497894,0.043521866,0.00011361111,0.0001224611,0.00013545854,0.008084709,0.022837404,0.00039613436,0.11040148,0.0008069145,0.80858535],"study_design_scores_gemma":[0.001420053,0.00014608278,0.43997106,0.00019711086,0.000014945731,0.000079117985,0.00007738488,0.47430676,0.00088239985,0.07931797,0.0028549412,0.00073217734],"about_ca_topic_score_codex":0.00030797176,"about_ca_topic_score_gemma":0.0018348191,"teacher_disagreement_score":0.80785316,"about_ca_system_score_codex":0.00026546212,"about_ca_system_score_gemma":0.00044323152,"threshold_uncertainty_score":0.9998094},"labels":[],"label_agreement":null},{"id":"W4290017147","doi":"10.1007/978-3-031-13502-6_7","title":"PSPACE-Completeness of Reversible Deterministic Systems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PSPACE; Gadget; Mathematical proof; Completeness (order theory); Computer science; Mathematics; Discrete mathematics; Algorithm; Computational complexity theory","score_opus":0.026799192136958166,"score_gpt":0.24710742989923476,"score_spread":0.2203082377622766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290017147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015776593,0.00083435205,0.98813456,0.0003166333,0.0057270727,0.00079673086,0.000027799302,0.00022816782,0.0037769077],"genre_scores_gemma":[0.45811167,0.00008598688,0.53908193,0.00068488985,0.00087565184,0.00006587745,0.000016555055,0.00012155646,0.00095589895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99340135,0.00015286497,0.0011046341,0.0023633733,0.0020467294,0.00093107735],"domain_scores_gemma":[0.9940993,0.001393615,0.00077150244,0.0030389326,0.00045049938,0.0002461136],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018952595,0.0007531234,0.0012490586,0.0013194984,0.00040063995,0.0004552385,0.007299326,0.00029708102,0.0000924192],"category_scores_gemma":[0.00018942682,0.00074787484,0.00028277756,0.0013660749,0.0010792089,0.00060445844,0.005211458,0.0010608876,0.000027678472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002501192,0.00023040135,0.0003281326,0.0007714867,0.00006492509,0.00077567156,0.0014818213,0.44913876,0.0003350116,0.11146864,0.00009097606,0.43528917],"study_design_scores_gemma":[0.00038405368,0.0005538695,0.00021638493,0.0003545113,0.00002130837,0.00031770227,7.713688e-7,0.9091641,0.00024299102,0.082595125,0.0050790613,0.0010701607],"about_ca_topic_score_codex":0.00014464298,"about_ca_topic_score_gemma":0.00004279013,"teacher_disagreement_score":0.4600253,"about_ca_system_score_codex":0.000779482,"about_ca_system_score_gemma":0.0011314929,"threshold_uncertainty_score":0.99949723},"labels":[],"label_agreement":null},{"id":"W4292637968","doi":"10.48550/arxiv.1509.01099","title":"Open determinacy for class games","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; York University","keywords":"Determinacy; Transfinite number; Mathematics; Class (philosophy); Iterated function; Mathematical economics; Open set; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.18022562038124357,"score_gpt":0.24060598275456802,"score_spread":0.06038036237332445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292637968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06673057,0.00007258205,0.92281216,0.00034290354,0.0016758954,0.001683303,0.000047291505,0.00040356742,0.006231753],"genre_scores_gemma":[0.9555984,0.000027049842,0.04061051,0.00020187513,0.00020106198,0.000011679931,0.00002433167,0.000033764416,0.00329131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656856,0.00022281756,0.00032003998,0.0021492345,0.00014211191,0.0005972288],"domain_scores_gemma":[0.9955662,0.0003434641,0.0003636863,0.002764535,0.00059671764,0.00036542627],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00089203956,0.000478607,0.0006620815,0.00025575812,0.00018499375,0.0007008315,0.009857741,0.00038922805,0.000020365398],"category_scores_gemma":[0.0001664858,0.0005441021,0.00033009384,0.0005429475,0.0001672436,0.00083675963,0.019002272,0.00052084494,0.00008836627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029726388,0.0012884128,0.0061354088,0.0006922366,0.00048745156,0.0011404858,0.0021977634,0.28913617,0.000033482567,0.603989,0.024301626,0.070300706],"study_design_scores_gemma":[0.0008030154,0.00014763378,0.00045329973,0.00004567791,0.00004941344,0.000008198312,0.000048832164,0.6759521,0.000047503552,0.3133553,0.008498055,0.0005910249],"about_ca_topic_score_codex":0.00025409163,"about_ca_topic_score_gemma":0.000117357384,"teacher_disagreement_score":0.88886786,"about_ca_system_score_codex":0.0005891133,"about_ca_system_score_gemma":0.0008379708,"threshold_uncertainty_score":0.999701},"labels":[],"label_agreement":null},{"id":"W4293072841","doi":"10.16995/dscn.8105","title":"The Computational Fallacy: A New Model for Understanding the Role of Computers in Humanities","year":2022,"lang":"en","type":"article","venue":"Digital Studies / Le champ numérique","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fallacy; Humanities; Computation; Computer science; Philosophy; Epistemology; Algorithm","score_opus":0.07075931940913625,"score_gpt":0.2652812942628782,"score_spread":0.19452197485374195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293072841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01718538,0.0017040892,0.975106,0.0038049736,0.0003072024,0.00066665583,0.00003616044,0.00008851978,0.0011010022],"genre_scores_gemma":[0.997786,0.000018304761,0.0016412262,0.00021119132,0.000055628003,0.00013493357,0.0000076078186,0.0000137909965,0.00013133096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983495,0.00009592925,0.00041524324,0.00037590787,0.00041241918,0.00035100948],"domain_scores_gemma":[0.9974405,0.0018795133,0.00017246585,0.00034973893,0.00012196127,0.00003578551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005841367,0.00019318466,0.00028367768,0.00008048321,0.0011698722,0.0003521318,0.0011921858,0.000022242524,5.493178e-7],"category_scores_gemma":[0.000097081116,0.00013973426,0.00014938136,0.00035311104,0.0003250136,0.00033647165,0.0017389543,0.00018860542,5.309771e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027746979,0.00012412317,0.00029288707,0.000020418638,0.00011031779,0.0000021990509,0.26193142,0.510765,0.0000026504215,0.21651994,0.00081386295,0.009389449],"study_design_scores_gemma":[0.00022017965,0.00006180911,0.00003467984,0.000005246615,7.8027256e-8,0.0000042165557,0.10047743,0.44582373,0.0000023068794,0.45252192,0.0007629549,0.00008544322],"about_ca_topic_score_codex":0.000060435275,"about_ca_topic_score_gemma":0.0002727412,"teacher_disagreement_score":0.9806006,"about_ca_system_score_codex":0.00040496356,"about_ca_system_score_gemma":0.00030308613,"threshold_uncertainty_score":0.89978296},"labels":[],"label_agreement":null},{"id":"W4297310709","doi":"10.48550/arxiv.2109.04859","title":"Synchronous games with $*$-isomorphic game algebras","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isomorphism (crystallography); Mathematics; Combinatorial game theory; Algebra over a field; Zero (linguistics); Sequential game; Game theory; Discrete mathematics; Mathematical economics; Pure mathematics","score_opus":0.04349044863607647,"score_gpt":0.16965772848778543,"score_spread":0.12616727985170895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297310709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4023593,0.00024047834,0.5947534,0.00022026489,0.00062612875,0.0003684606,0.000014182026,0.00053612754,0.00088165706],"genre_scores_gemma":[0.9868661,0.00014138393,0.012091671,0.0001758375,0.00012673231,0.0000033055073,0.000042316133,0.00003305631,0.00051957456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955097,0.0003600855,0.00034400867,0.0027418344,0.00027706774,0.00076733466],"domain_scores_gemma":[0.9952264,0.0002599236,0.0003739194,0.0032836858,0.00047959245,0.0003764967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003382284,0.00070135685,0.0008109251,0.0003480662,0.00017638458,0.0005376357,0.0035930197,0.00043554514,0.00015247888],"category_scores_gemma":[0.00005500284,0.0007458873,0.00036163963,0.0012851693,0.00036982348,0.0006030827,0.005580188,0.0011424527,0.00014999176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014899945,0.0022002824,0.047674865,0.0009766128,0.0014795113,0.020564277,0.0035652465,0.7597642,0.00009846519,0.14447287,0.0012338713,0.017820787],"study_design_scores_gemma":[0.0014780684,0.00043307742,0.015929157,0.0003635591,0.000245793,0.00022416207,0.0003082537,0.936673,0.00032711375,0.040687438,0.0010569845,0.002273436],"about_ca_topic_score_codex":0.00030537456,"about_ca_topic_score_gemma":0.00020203859,"teacher_disagreement_score":0.5845068,"about_ca_system_score_codex":0.00054716517,"about_ca_system_score_gemma":0.0009566586,"threshold_uncertainty_score":0.9994992},"labels":[],"label_agreement":null},{"id":"W4297662389","doi":"10.1017/9781108775267.005","title":"Number representations and numeration systems","year":2022,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Computer science; Mathematics","score_opus":0.024887515455244993,"score_gpt":0.21693547826895884,"score_spread":0.19204796281371384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297662389","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006153013,0.00013088067,0.066928186,0.00005687375,0.0008237585,0.0006161078,0.00010857453,0.00032445375,0.9309496],"genre_scores_gemma":[0.0018339702,0.00006158497,0.0021805775,0.000039668186,0.00013037752,0.000004232885,0.00004899592,0.000027601387,0.995673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979941,0.00013275955,0.00024909203,0.0009282115,0.00044904999,0.00024675456],"domain_scores_gemma":[0.99815464,0.00017682524,0.00024370039,0.0010707953,0.0001858888,0.00016812145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019381821,0.00031901154,0.00036071846,0.0001553393,0.0004802592,0.0002622614,0.0009499652,0.00018660729,0.000014293922],"category_scores_gemma":[0.000012472543,0.0004056423,0.00013374943,0.000024476743,0.0001536152,0.00035780843,0.0018854358,0.00046342085,0.000015621168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068262543,0.0000107267715,0.000011636254,0.00004652918,0.000060470862,0.00016522371,0.00011787838,0.00010512674,0.000004790135,0.98872674,0.009132407,0.0016116682],"study_design_scores_gemma":[0.00037987818,0.00004564014,0.000073864045,0.000032699474,0.000075241805,0.00014306999,0.000037166225,0.018886534,0.000012863467,0.0001486967,0.97965574,0.00050860265],"about_ca_topic_score_codex":0.0005357828,"about_ca_topic_score_gemma":0.00000248923,"teacher_disagreement_score":0.988578,"about_ca_system_score_codex":0.00030601458,"about_ca_system_score_gemma":0.0001300121,"threshold_uncertainty_score":0.99983954},"labels":[],"label_agreement":null},{"id":"W4297687078","doi":"","title":"(Legitimate peripheral) computational thinking in mathematics","year":2017,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Concordia University","funders":"","keywords":"Computational thinking; Computer science; Mathematics education; Mathematics; Artificial intelligence","score_opus":0.021677551540993937,"score_gpt":0.2535104587220444,"score_spread":0.23183290718105048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297687078","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017212993,0.00048603027,0.93240464,0.0118252225,0.00056254887,0.0006912578,0.000027188906,0.00052713836,0.03626296],"genre_scores_gemma":[0.29867688,0.00008181698,0.69933003,0.000103310274,0.00003496905,0.0000860971,0.00013404632,0.000042881795,0.0015099546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930814,0.003069872,0.0009218549,0.0013837313,0.00095881254,0.0005843271],"domain_scores_gemma":[0.99040127,0.0019814377,0.00096412475,0.004519694,0.001932315,0.00020116054],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00843223,0.0005239448,0.00068076357,0.00032417712,0.00071950647,0.0024319498,0.0062836274,0.0003627654,0.00006313183],"category_scores_gemma":[0.0015375814,0.0005758805,0.00028832225,0.00034906407,0.000330927,0.00050914206,0.0072315363,0.0010862856,0.000051164065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048195916,0.0016386905,0.0028375434,0.00058966933,0.00009683677,0.000064482185,0.04719262,0.019591043,0.00008814332,0.84307486,0.00054165523,0.08427961],"study_design_scores_gemma":[0.00035345682,3.1052286e-7,0.004256354,0.0011592503,0.000009277699,0.000022815635,0.000035752917,0.6452312,0.0003826243,0.3473396,0.0007638142,0.00044555022],"about_ca_topic_score_codex":0.0008094237,"about_ca_topic_score_gemma":0.0010084631,"teacher_disagreement_score":0.62564015,"about_ca_system_score_codex":0.00037320834,"about_ca_system_score_gemma":0.0006173243,"threshold_uncertainty_score":0.99966925},"labels":[],"label_agreement":null},{"id":"W4297698516","doi":"","title":"Parallel Repetition of Prover-Verifier Quantum Interactions","year":2012,"lang":"en","type":"preprint","venue":"UWSpace (University of Waterloo)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Gas meter prover; Repetition (rhetorical device); Conjecture; Value (mathematics); Computer science; Discrete mathematics; Mathematics; Approx; Core (optical fiber); Combinatorics; Mathematical proof; Statistics","score_opus":0.02370833899913907,"score_gpt":0.22425361544207098,"score_spread":0.2005452764429319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297698516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7213551,0.00012752383,0.27036613,0.0037478392,0.0024510599,0.00079797185,0.00007165803,0.0002904618,0.00079224963],"genre_scores_gemma":[0.71997637,0.00010741917,0.24780981,0.000033841065,0.00018270231,0.0000030590513,0.00007494117,0.000029404397,0.031782456],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979672,0.00020107941,0.00028528337,0.0007289817,0.00044255634,0.00037489177],"domain_scores_gemma":[0.9972162,0.00010348543,0.0006163132,0.0015206875,0.0003894254,0.00015386399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040061233,0.00029938377,0.0005765697,0.00032012365,0.00013388373,0.000046187877,0.0016819331,0.0002667343,0.00016651516],"category_scores_gemma":[0.00003072883,0.0003494192,0.00036765574,0.00026387052,0.00024181623,0.0007096195,0.0031114598,0.0005579541,0.000056642602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074221933,0.0076020095,0.016840622,0.006555163,0.0021203307,0.00030138541,0.64734375,0.029253164,0.01853326,0.15712842,0.018488454,0.09509123],"study_design_scores_gemma":[0.005347834,0.0015311035,0.12981448,0.0023624934,0.0009901698,0.00017280357,0.044827867,0.67204255,0.008294767,0.11057178,0.018643675,0.0054004914],"about_ca_topic_score_codex":0.0204379,"about_ca_topic_score_gemma":0.002684442,"teacher_disagreement_score":0.64278936,"about_ca_system_score_codex":0.0001950017,"about_ca_system_score_gemma":0.00016573009,"threshold_uncertainty_score":0.99989575},"labels":[],"label_agreement":null},{"id":"W4298022693","doi":"10.1007/978-3-031-02010-0_2","title":"Indistinguishability","year":2014,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Impossibility; Mathematical proof; Computer science; Process (computing); Point (geometry); State (computer science); Theoretical computer science; Value (mathematics); Mathematics; Algorithm; Machine learning; Programming language","score_opus":0.013266508646607765,"score_gpt":0.22601985886413065,"score_spread":0.21275335021752287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298022693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014999564,0.00036789477,0.8265127,0.0005243455,0.0015568684,0.0007160698,0.00026023795,0.0020494035,0.1678625],"genre_scores_gemma":[0.95330524,0.000018957255,0.027823977,0.0019856591,0.0028572364,0.0000582487,0.0003385505,0.0004002714,0.013211868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99243665,0.0010370035,0.0013013134,0.0027600178,0.0012648492,0.0012001941],"domain_scores_gemma":[0.9816549,0.012315599,0.0010603386,0.004090849,0.0004572833,0.00042104968],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0039014465,0.0014999761,0.0016861609,0.00045767383,0.00070198637,0.00058756425,0.0049261325,0.0010307374,0.00035208656],"category_scores_gemma":[0.0056518884,0.001396512,0.00092916127,0.00027644413,0.00057648844,0.00007931807,0.0019959074,0.0018633556,0.0004455213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004915262,0.000096816926,0.00001631326,0.00012107142,0.00020599566,0.000048791655,0.00011755685,0.0016611518,0.00000553758,0.71564615,0.0025165137,0.27951497],"study_design_scores_gemma":[0.00030473393,0.0003040412,0.00060943543,0.0006861089,0.00014286139,0.00007286325,0.00000485766,0.01971968,0.0005125071,0.90376914,0.07180594,0.0020678614],"about_ca_topic_score_codex":0.0000105466515,"about_ca_topic_score_gemma":0.0000061652595,"teacher_disagreement_score":0.9531552,"about_ca_system_score_codex":0.00075277995,"about_ca_system_score_gemma":0.00030903379,"threshold_uncertainty_score":0.99977493},"labels":[],"label_agreement":null},{"id":"W4298051903","doi":"","title":"Ten Problems in Experimental Mathematics","year":2004,"lang":"en","type":"article","venue":"University of North Texas Digital Library (University of North Texas)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy; National Science Foundation","keywords":"Mathematics education; Mathematics","score_opus":0.012894646903041854,"score_gpt":0.1758959715302999,"score_spread":0.16300132462725805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298051903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96105015,0.00006697648,0.03295062,0.00034395576,0.0000813829,0.0004765434,0.00015966747,0.00028065723,0.0045900545],"genre_scores_gemma":[0.9577653,0.000030362318,0.041132737,0.000028496192,0.000014930717,3.3898424e-8,0.00008032848,0.000017756705,0.0009300658],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979161,0.000049882918,0.00031246137,0.00071366143,0.0005361587,0.00047175438],"domain_scores_gemma":[0.9983423,0.00011388235,0.00036374413,0.0008276127,0.00009221737,0.00026024395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007947899,0.0003328638,0.0005772154,0.0005297797,0.00016519337,0.0000841591,0.0028063008,0.00011069345,0.00010417268],"category_scores_gemma":[0.000013401816,0.0004379429,0.00029186555,0.0013698527,0.000538282,0.0053007463,0.0023379587,0.0002732879,0.00012471767],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003250313,0.0014094706,0.98624915,0.000110921035,0.000056097404,0.00022907706,0.00076258567,0.0036784625,5.7013165e-7,0.0018274208,0.00017683576,0.005466905],"study_design_scores_gemma":[0.0018364843,0.00041974604,0.9898575,0.00009995569,0.00001744391,0.00002149052,0.00018176583,0.0027501537,0.000057190162,0.0016997036,0.0025580458,0.0005005254],"about_ca_topic_score_codex":0.00039510612,"about_ca_topic_score_gemma":0.000796902,"teacher_disagreement_score":0.008182116,"about_ca_system_score_codex":0.0001686719,"about_ca_system_score_gemma":0.0002976891,"threshold_uncertainty_score":0.99980724},"labels":[],"label_agreement":null},{"id":"W4298844022","doi":"","title":"McCulloch-Pitts brains and pseudorandom functions","year":2016,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Pseudorandom number generator; Computer science; Neuroscience; Artificial intelligence; Cognitive science; Algorithm; Psychology","score_opus":0.06928220604899071,"score_gpt":0.18002415544905415,"score_spread":0.11074194940006343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298844022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19044475,0.0003365627,0.7970898,0.0010231617,0.0034117019,0.0011275479,0.000103324404,0.00051043375,0.0059527247],"genre_scores_gemma":[0.9883336,0.00089370704,0.001966217,0.00022021186,0.0005584647,0.0000045215456,0.000013934791,0.00006137838,0.007948005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99159193,0.0009189166,0.00082304387,0.004869109,0.00035907223,0.0014379305],"domain_scores_gemma":[0.992275,0.0012503618,0.00072569307,0.0038729024,0.000797666,0.0010783495],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00118728,0.0012889378,0.0013719341,0.00078186125,0.001148043,0.00064400246,0.0035695275,0.0009104569,0.00041420307],"category_scores_gemma":[0.00026466697,0.0013322547,0.0007957342,0.0017097329,0.0014216539,0.0013042296,0.009218701,0.0013581602,0.00076375884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015239853,0.0039335755,0.073042944,0.0014930584,0.0030026913,0.004407352,0.0052062846,0.13868359,0.00064891216,0.6115638,0.0053104437,0.15118334],"study_design_scores_gemma":[0.0074597695,0.0006275213,0.017485164,0.0005431744,0.00056880835,0.0001641891,0.00027331867,0.7509099,0.000088147215,0.20922059,0.009480301,0.0031791027],"about_ca_topic_score_codex":0.00024799883,"about_ca_topic_score_gemma":0.00012917999,"teacher_disagreement_score":0.7978888,"about_ca_system_score_codex":0.0007427661,"about_ca_system_score_gemma":0.0007953009,"threshold_uncertainty_score":0.99998623},"labels":[],"label_agreement":null},{"id":"W4298858096","doi":"10.48550/arxiv.1205.5819","title":"Measurability Aspects of the Compactness Theorem for Sample Compression Schemes","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ottawa","keywords":"Compact space; Mathematics; Compression (physics); Linear subspace; Sample (material); Separable space; Scheme (mathematics); Sample space; Discrete mathematics; Subspace topology; Pure mathematics; Mathematical analysis; Statistics; Physics","score_opus":0.12282020444507546,"score_gpt":0.2169972327893324,"score_spread":0.09417702834425692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298858096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2681674,0.000100022684,0.72815436,0.00014242718,0.001246882,0.0009724098,0.000075964024,0.00017623474,0.00096430175],"genre_scores_gemma":[0.99015445,0.000009056537,0.009626791,0.00003323994,0.00010587457,0.0000032914384,0.000010936788,0.000019083025,0.000037308066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970931,0.0005324204,0.00038533544,0.0012077048,0.00024865477,0.0005328223],"domain_scores_gemma":[0.9941668,0.0013466305,0.0005893046,0.0031204862,0.0005800733,0.00019669272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010666525,0.00043367484,0.0006605963,0.00012516924,0.00029199378,0.000085198655,0.004356772,0.00031332969,0.00002822962],"category_scores_gemma":[0.00038425563,0.00035221528,0.00059774285,0.00061706937,0.00048343692,0.00035099863,0.0051836576,0.00058652676,0.0000055829214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007768724,0.0007040648,0.032661498,0.00045707394,0.00014163573,0.000003643258,0.00053995714,0.052955434,0.00035845625,0.9089328,0.00008454906,0.0030831886],"study_design_scores_gemma":[0.0006144649,0.000047918395,0.036424126,0.00013870225,0.000089023364,0.000002680451,0.00004402903,0.44687074,0.0037101628,0.5110633,0.0004884873,0.0005063588],"about_ca_topic_score_codex":0.00025422405,"about_ca_topic_score_gemma":0.000053829837,"teacher_disagreement_score":0.721987,"about_ca_system_score_codex":0.0003367131,"about_ca_system_score_gemma":0.00034370815,"threshold_uncertainty_score":0.999893},"labels":[],"label_agreement":null},{"id":"W4299394071","doi":"10.1007/978-3-319-05654-8","title":"A Readable Introduction to Real Mathematics","year":2014,"lang":"en","type":"book","venue":"Undergraduate texts in mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mathematics education; Mathematics","score_opus":0.016610063762750756,"score_gpt":0.2511616981463948,"score_spread":0.23455163438364401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299394071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003929384,0.000057928428,0.7068314,0.0069441344,0.0013043759,0.0014513818,0.000009674741,0.00074799143,0.28261378],"genre_scores_gemma":[0.00008569408,0.00007231739,0.5563221,0.0001446264,0.0010848399,0.00007543643,0.000028867913,0.00012731575,0.4420588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941723,0.00016285862,0.0017551134,0.0015774532,0.001361245,0.00097108295],"domain_scores_gemma":[0.9938207,0.0009588852,0.00079783745,0.0037775107,0.00032327324,0.00032179125],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021492061,0.0009637376,0.0015436751,0.00091318355,0.00015821097,0.0004540531,0.0029287757,0.0005776196,0.000050280538],"category_scores_gemma":[0.00047235235,0.00093342457,0.00028014,0.0006991036,0.00015282944,0.00032479415,0.0015558455,0.00095501,0.0014333714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034909312,0.0005989044,0.0000032055266,0.0013230531,0.000064081105,0.000040885956,0.0023618524,0.001210748,0.000021998492,0.8089263,0.17682387,0.008621622],"study_design_scores_gemma":[0.00026197606,0.00018376508,0.000004051057,0.00040347077,0.000041044823,0.0001274235,0.000026286676,0.09341052,0.00003308707,0.84821177,0.056437578,0.0008590503],"about_ca_topic_score_codex":0.000027537493,"about_ca_topic_score_gemma":0.00020614022,"teacher_disagreement_score":0.159445,"about_ca_system_score_codex":0.0013249738,"about_ca_system_score_gemma":0.0005275769,"threshold_uncertainty_score":0.9993441},"labels":[],"label_agreement":null},{"id":"W4299855045","doi":"10.61091/um120-08","title":"The Irredundance-related Ramsey Numbers \\(s(3,8)=21\\) and \\(w(3,8)=21\\)","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.012034791693647398,"score_gpt":0.2532623746589746,"score_spread":0.2412275829653272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299855045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0845988,0.032957178,0.68344855,0.039854523,0.008522773,0.003730648,0.000047605303,0.006828856,0.14001109],"genre_scores_gemma":[0.9255791,0.00017875533,0.06917726,0.00020745613,0.00014743494,0.00011736935,0.0000038171997,0.00006602816,0.0045228032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969666,0.00018990718,0.00069229974,0.0009023529,0.00056992116,0.00067893264],"domain_scores_gemma":[0.99596095,0.0021562944,0.00009080162,0.0014700837,0.00009303879,0.00022884537],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001593686,0.0003681653,0.0003847065,0.0001117515,0.0004464515,0.0011116188,0.001411808,0.00014097463,0.00012105013],"category_scores_gemma":[0.00038709497,0.00024942856,0.00019359759,0.0008197943,0.0005152988,0.0005026827,0.00088668417,0.0004334619,0.00071008917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006020021,0.00013603183,0.00005346414,0.0003549024,0.00016187676,0.00006783074,0.006065312,0.000014745603,0.000057703703,0.820039,0.009497765,0.16354537],"study_design_scores_gemma":[0.00020106787,0.000087133216,0.00067831227,0.00016444658,0.00003461484,0.00024363362,0.00028233058,0.34648508,0.00007760052,0.6212481,0.030135233,0.00036240608],"about_ca_topic_score_codex":0.00002359224,"about_ca_topic_score_gemma":0.000009706795,"teacher_disagreement_score":0.8409803,"about_ca_system_score_codex":0.0001096788,"about_ca_system_score_gemma":0.00013857381,"threshold_uncertainty_score":0.99999577},"labels":[],"label_agreement":null},{"id":"W4300051771","doi":"10.1007/978-3-319-46379-7","title":"Algorithmic Learning Theory","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Artificial intelligence; Theoretical computer science","score_opus":0.010626130519115914,"score_gpt":0.239478027910941,"score_spread":0.2288518973918251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300051771","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003276387,0.0006756138,0.98555905,0.0008073235,0.0043960055,0.0006162367,0.0000047656886,0.00073956215,0.007168687],"genre_scores_gemma":[0.01525614,0.00010401474,0.9693225,0.0019130297,0.003522324,0.000056890975,0.00001002447,0.00013022308,0.009684838],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920824,0.0004503676,0.00086098886,0.0032274334,0.0017942005,0.0015845996],"domain_scores_gemma":[0.9930605,0.0029648223,0.00047614498,0.0026891425,0.00044869326,0.0003606589],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0038332972,0.0009517165,0.00096015265,0.001319519,0.0005263172,0.0009366425,0.008527652,0.0005732017,0.000062544656],"category_scores_gemma":[0.00061207195,0.00075800635,0.00030041026,0.0017670987,0.0015203096,0.0010606922,0.0049679973,0.0018832313,0.00030121038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004305356,0.000045645425,0.00005493216,0.000037214773,0.000013398865,0.00014714868,0.0005820006,0.010871713,0.00005624638,0.008012282,0.00009306179,0.98008204],"study_design_scores_gemma":[0.00039356778,0.000283377,0.00018706235,0.0003753929,0.000008533445,0.00016365063,1.9903909e-7,0.41997847,0.00041651112,0.5693615,0.007720907,0.0011108248],"about_ca_topic_score_codex":0.000011280464,"about_ca_topic_score_gemma":0.000015446607,"teacher_disagreement_score":0.97897124,"about_ca_system_score_codex":0.0015400199,"about_ca_system_score_gemma":0.0024642174,"threshold_uncertainty_score":0.9994871},"labels":[],"label_agreement":null},{"id":"W4301265035","doi":"10.1007/978-3-031-01545-8_4","title":"Games With Sequential Actions: The Perfect-Information Extensive Form","year":2008,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on artificial intelligence and machine learning","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Representation (politics); Extensive-form game; Mathematical economics; Computer science; Game theory; Repeated game; Nash equilibrium; Mathematics","score_opus":0.049895550001574356,"score_gpt":0.2606962291599081,"score_spread":0.21080067915833373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301265035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005115104,0.0015276194,0.9112393,0.003980818,0.0007705553,0.0012336373,0.00001925647,0.0006567984,0.08006046],"genre_scores_gemma":[0.96979284,0.006143116,0.008755031,0.0025341571,0.0012260361,0.00018903038,0.00005591813,0.0001524656,0.011151407],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977111,0.0001334595,0.00051704206,0.0006381106,0.0006004322,0.00039982225],"domain_scores_gemma":[0.9974164,0.001189667,0.00040781937,0.0006250764,0.0002536486,0.00010740766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041912502,0.00053939223,0.0004592007,0.00033119827,0.0010446163,0.0005123944,0.00069925777,0.00025040525,0.00019410989],"category_scores_gemma":[0.00046798863,0.000349889,0.00019475698,0.0001415024,0.0003539534,0.0005073806,0.00026472364,0.0012950537,0.00022011767],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080756174,0.00002276798,0.0000043723435,0.000027389395,0.00008810906,0.00002171064,0.0022578149,0.008835205,0.000016200422,0.05267123,0.00016535752,0.9358091],"study_design_scores_gemma":[0.00012062392,0.0023976027,0.00019661436,0.0007317957,0.00032263322,0.0011317481,0.0005648859,0.4022987,0.015545253,0.14316891,0.43069795,0.002823317],"about_ca_topic_score_codex":0.00016373413,"about_ca_topic_score_gemma":0.00020518524,"teacher_disagreement_score":0.9692813,"about_ca_system_score_codex":0.00011654801,"about_ca_system_score_gemma":0.00013865551,"threshold_uncertainty_score":0.99989533},"labels":[],"label_agreement":null},{"id":"W4304207945","doi":"10.3233/com-220430","title":"Strong computable type","year":2023,"lang":"en","type":"preprint","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Type (biology); Computable general equilibrium; Economics; Mathematics; Mathematical economics; Geology; Microeconomics","score_opus":0.11515124556131903,"score_gpt":0.3219876803719497,"score_spread":0.20683643481063066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304207945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04882957,0.0005726046,0.9240305,0.0019169842,0.015708722,0.0017169977,0.000063322586,0.00565723,0.0015040826],"genre_scores_gemma":[0.77468354,0.000033128497,0.2231352,0.00025578256,0.0011024999,0.00009649379,0.00015092701,0.00013806325,0.00040434813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910068,0.00085204194,0.0015017169,0.0038499255,0.0013114933,0.0014780145],"domain_scores_gemma":[0.9902623,0.0012894392,0.00056255545,0.006272368,0.0010422316,0.0005710691],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0027588117,0.001134132,0.0016426927,0.00041180887,0.00038424422,0.0011289169,0.006914496,0.0008098005,0.00008585218],"category_scores_gemma":[0.0005756549,0.0011887209,0.00065970654,0.0016778655,0.00041398095,0.00043062947,0.023086753,0.002357081,0.0011131502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005821725,0.0021281068,0.028342336,0.002091215,0.00049767847,0.00024679225,0.0018026329,0.7719208,0.000045389694,0.031681444,0.020777822,0.14040753],"study_design_scores_gemma":[0.00033777524,0.00015596424,0.028578289,0.000100315265,0.000029467456,0.000018822235,0.000014861027,0.7980303,0.00005278827,0.1684329,0.0031703229,0.0010781526],"about_ca_topic_score_codex":0.0004907516,"about_ca_topic_score_gemma":0.000062133,"teacher_disagreement_score":0.725854,"about_ca_system_score_codex":0.0008785472,"about_ca_system_score_gemma":0.0011823627,"threshold_uncertainty_score":0.9999445},"labels":[],"label_agreement":null},{"id":"W4306835658","doi":"","title":"Concurrent secrets with quantified suspicion","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science","score_opus":0.020479390353961256,"score_gpt":0.2406293113121055,"score_spread":0.22014992095814423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306835658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05727606,0.000629605,0.9135732,0.009209337,0.001143641,0.0008728366,0.000032205768,0.0008861232,0.016376995],"genre_scores_gemma":[0.79736173,0.00013486884,0.19975638,0.00016741647,0.00009211873,0.0001132248,0.0002524836,0.000061961786,0.0020598352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9897382,0.0056906906,0.00080322055,0.0020477062,0.0010104723,0.00070967],"domain_scores_gemma":[0.9874372,0.0016262155,0.00082581176,0.0054684146,0.004272907,0.0003694406],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0065830653,0.0006578071,0.0006865471,0.00030388456,0.00048732746,0.0012686958,0.00480509,0.00041195532,0.000120393364],"category_scores_gemma":[0.0009290684,0.0006187898,0.00027594497,0.0007655842,0.00060116505,0.00033875645,0.005901974,0.0010342896,0.00013541478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003374706,0.0030834868,0.0057505616,0.00083847315,0.00040024024,0.00007615633,0.026395459,0.0005745789,0.0013464087,0.51638436,0.0060836794,0.43903282],"study_design_scores_gemma":[0.0025856937,0.000011909452,0.018333573,0.0049780337,0.00014253121,0.00013298972,0.00014029823,0.8251656,0.062013246,0.039860092,0.043386195,0.0032497852],"about_ca_topic_score_codex":0.00064638763,"about_ca_topic_score_gemma":0.0011858371,"teacher_disagreement_score":0.8245911,"about_ca_system_score_codex":0.00027005773,"about_ca_system_score_gemma":0.000731715,"threshold_uncertainty_score":0.9997681},"labels":[],"label_agreement":null},{"id":"W4308426226","doi":"10.1145/3500868.3559399","title":"Solidarity and Disruption Collective Organizing In Computing II","year":2022,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Solidarity; Computer science; Political science","score_opus":0.017110254369552026,"score_gpt":0.24635106394187034,"score_spread":0.22924080957231832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308426226","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6226331,0.0000459292,0.37347546,0.0010150269,0.00028950558,0.00022843946,0.0000010885998,0.0001985794,0.002112866],"genre_scores_gemma":[0.9626276,8.643392e-7,0.0369303,0.00025980614,0.000028692804,0.000007658605,9.588427e-7,0.000005541454,0.00013858775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856496,0.00019872324,0.00021518389,0.0005016314,0.0002550029,0.00026450958],"domain_scores_gemma":[0.9993875,0.0001827957,0.000056177978,0.00026897277,0.000048108344,0.000056448767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073731417,0.000110399065,0.00016670019,0.0001474246,0.00075304735,0.00011498393,0.00044623288,0.00002442175,0.000047119727],"category_scores_gemma":[0.00006348836,0.00011676638,0.000024634526,0.0011153624,0.000037895883,0.00022977557,0.0034478616,0.00026642918,0.0000022497577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005816177,0.0027371768,0.22152768,0.00009983273,0.00007384496,0.00026016467,0.11467377,0.029950388,0.00557754,0.21143349,0.001868204,0.41173977],"study_design_scores_gemma":[0.00044602237,0.00021062628,0.09290263,0.000003363622,0.0000014044762,0.000072520685,0.0004772164,0.8846913,0.00016289942,0.020492153,0.00032582,0.00021404108],"about_ca_topic_score_codex":0.0001882018,"about_ca_topic_score_gemma":0.00010310899,"teacher_disagreement_score":0.8547409,"about_ca_system_score_codex":0.00040404976,"about_ca_system_score_gemma":0.000117220705,"threshold_uncertainty_score":0.57919073},"labels":[],"label_agreement":null},{"id":"W4310524267","doi":"10.1111/tops.12629","title":"A Computational Complexity Perspective on Segmentation as a Cognitive Subcomputation","year":2022,"lang":"en","type":"article","venue":"Topics in Cognitive Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational model; Computer science; Parsing; Artificial intelligence; Cognition; Intuition; Computational complexity theory; Cognitive science; Segmentation; Machine learning; Cognitive psychology; Perspective (graphical); Psychology; Algorithm","score_opus":0.06816922221192007,"score_gpt":0.367945885197096,"score_spread":0.2997766629851759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310524267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51784146,0.000037617123,0.4616469,0.0028381,0.00078522164,0.0011159697,0.00005009406,0.00019623086,0.015488388],"genre_scores_gemma":[0.9740314,0.0000012854487,0.024189858,0.001449239,0.00007090525,0.0001535624,0.000024317333,0.000008734287,0.0000706994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957393,0.00043088972,0.00038007568,0.0012754458,0.0016559757,0.0005183456],"domain_scores_gemma":[0.99735886,0.0009970891,0.00019969816,0.00033271662,0.0009704933,0.00014114437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015593102,0.00024204688,0.0002435158,0.00069368543,0.0010527774,0.00027321398,0.0014560494,0.00003346112,0.00016038188],"category_scores_gemma":[0.0010866451,0.00027470972,0.00007659867,0.0030796512,0.0009120428,0.0008077911,0.0016317012,0.000525513,0.0000629051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019253846,0.0018212546,0.0056789466,0.000016489472,0.000032760843,0.00022478553,0.02654295,0.041448165,0.00013221356,0.8182713,0.00006262225,0.105575986],"study_design_scores_gemma":[0.0015293753,0.0009520828,0.067970194,0.00003452917,0.0000076039596,0.00007168411,0.0074999235,0.3767519,0.00070628617,0.54404354,0.000019054309,0.00041379765],"about_ca_topic_score_codex":0.00025438837,"about_ca_topic_score_gemma":0.000035482914,"teacher_disagreement_score":0.45618993,"about_ca_system_score_codex":0.0014698544,"about_ca_system_score_gemma":0.00080263976,"threshold_uncertainty_score":0.9999705},"labels":[],"label_agreement":null},{"id":"W4312815163","doi":"10.1007/978-3-031-15951-0_8","title":"Matter, Energy, Information, and Intelligence","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Artificial intelligence; Computer science; Energy (signal processing); Cognitive science; Psychology; Data science; Physics","score_opus":0.013073534776564562,"score_gpt":0.20401622337402545,"score_spread":0.19094268859746089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312815163","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.102729e-7,0.00021778532,0.5179203,0.0006368032,0.00041946574,0.00009169452,0.00000700811,0.00016240534,0.48054403],"genre_scores_gemma":[0.0017823497,0.0012361321,0.162735,0.011409501,0.00030696188,0.0000813316,0.00011504133,0.00006868107,0.822265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831784,0.000021545604,0.000507796,0.00047045262,0.00045440297,0.0002279555],"domain_scores_gemma":[0.9985036,0.00014085976,0.00019414729,0.0009205435,0.000120319426,0.00012051356],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024410378,0.00031043278,0.0002872586,0.00025815718,0.00015006324,0.0003200535,0.0013190995,0.00013114254,0.0042459583],"category_scores_gemma":[0.000011148977,0.00029836834,0.000088975656,0.00008085269,0.00009918899,0.00095272553,0.0027062027,0.00029145172,0.00038319142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.1941355e-7,0.0000053783533,0.00000920504,0.000016070016,0.000010538655,0.0000040420264,0.00011439173,0.000038195136,7.580137e-8,0.7897285,0.0040656305,0.20600724],"study_design_scores_gemma":[0.00003465932,0.000055021264,0.000031600157,0.000008412545,0.000004659254,0.000067334135,0.0000053983813,0.012109048,0.0000075553903,0.2592754,0.72807205,0.00032885897],"about_ca_topic_score_codex":0.00013852862,"about_ca_topic_score_gemma":0.000018781651,"teacher_disagreement_score":0.7240064,"about_ca_system_score_codex":0.00010750892,"about_ca_system_score_gemma":0.000103608385,"threshold_uncertainty_score":0.99994683},"labels":[],"label_agreement":null},{"id":"W4312865364","doi":"10.5486/pmd.2002.2685","title":"On the frequency of $k$-deficient numbers","year":2002,"lang":"en","type":"article","venue":"Publicationes Mathematicae Debrecen","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Arithmetic; Statistics","score_opus":0.03684323531522012,"score_gpt":0.23194962907632144,"score_spread":0.1951063937611013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312865364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044051703,0.00024487465,0.7372994,0.07335627,0.000439386,0.0013435123,0.000011435855,0.0006654693,0.14258796],"genre_scores_gemma":[0.93606263,0.000010461918,0.06255457,0.0007252599,0.0000364715,0.00017125909,0.0000026453683,0.000016862672,0.0004198229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980833,0.00012926383,0.0004975589,0.00041373054,0.00058107235,0.0002950894],"domain_scores_gemma":[0.9964567,0.0011166037,0.00026307564,0.0017705747,0.0003018461,0.00009123007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007291502,0.00017497645,0.00022834688,0.00012933687,0.00015184404,0.00017758414,0.001966312,0.000056605168,0.00078411924],"category_scores_gemma":[0.00093345856,0.0001159901,0.000109955676,0.0010233038,0.00013134387,0.00032120396,0.00026643166,0.00013395427,0.00071448367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1866406e-7,0.00043786175,0.00013231667,0.00002618352,0.000015105852,3.1175608e-7,0.0013061418,0.000019995614,0.00006302507,0.9833435,0.0049579996,0.009697239],"study_design_scores_gemma":[0.0002217479,0.00007756646,0.0031592813,0.00003832925,0.0000128296515,0.00003474163,0.00009544135,0.26504484,0.00074484583,0.7281581,0.0020915759,0.00032067383],"about_ca_topic_score_codex":0.000013026519,"about_ca_topic_score_gemma":0.0000027848196,"teacher_disagreement_score":0.8920109,"about_ca_system_score_codex":0.00006400024,"about_ca_system_score_gemma":0.00002609845,"threshold_uncertainty_score":0.9183481},"labels":[],"label_agreement":null},{"id":"W4313050632","doi":"10.1007/978-3-031-15951-0_7","title":"Intelligence in Machines","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Imitation; Artificial intelligence; Cognitive science; Robot; Human intelligence; Computer science; Term (time); Mythology; Human–computer interaction; Psychology; Art; Literature; Social psychology; Physics","score_opus":0.02661352421252326,"score_gpt":0.2522257584903366,"score_spread":0.22561223427781338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313050632","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002313674,0.00036444046,0.33133855,0.0005759991,0.00087749155,0.00025116783,0.000004571235,0.00026890318,0.66631657],"genre_scores_gemma":[0.002225803,0.00024015138,0.17918912,0.0012813027,0.00031318876,0.000058234564,0.000022547127,0.000081284044,0.8165884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757934,0.00004458468,0.0005140464,0.0010031969,0.0005429402,0.00031590616],"domain_scores_gemma":[0.99815375,0.0002704771,0.00012995307,0.0012971896,0.00005741127,0.000091213755],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046393796,0.0003756523,0.00042658087,0.0003824751,0.000075229436,0.000117778334,0.0026289334,0.00015257497,0.0054975115],"category_scores_gemma":[0.00003172846,0.0003558651,0.0001692529,0.00016495907,0.00007503911,0.00023218428,0.0029522644,0.00073118496,0.00030327935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010634484,0.000021644362,0.000021878519,0.000011430611,0.000005951854,0.00007461823,0.000098080374,0.0002811418,3.8757247e-7,0.71441334,0.00023160584,0.28483886],"study_design_scores_gemma":[0.000059463247,0.00011032956,0.00009531235,0.00001834464,0.0000037673599,0.00005101648,0.0000033595645,0.1460503,0.0000071395853,0.62596154,0.22705325,0.0005861903],"about_ca_topic_score_codex":0.00020210992,"about_ca_topic_score_gemma":0.00023528124,"teacher_disagreement_score":0.28425267,"about_ca_system_score_codex":0.00024808166,"about_ca_system_score_gemma":0.00011412696,"threshold_uncertainty_score":0.9998893},"labels":[],"label_agreement":null},{"id":"W4313348914","doi":"10.1007/978-3-031-20350-3","title":"Theory and Applications of Models of Computation","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Computation; Theoretical computer science; Algorithm","score_opus":0.015039210410154064,"score_gpt":0.25596311016592743,"score_spread":0.24092389975577336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313348914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001234712,0.00087847514,0.99634105,0.000096254545,0.00044472874,0.0007396062,0.000017516924,0.00008546172,0.0012734409],"genre_scores_gemma":[0.20149116,0.00004894121,0.7977115,0.00029368425,0.0001980553,0.000071836,0.000017501005,0.000031413987,0.00013588158],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963177,0.00023602262,0.0007393661,0.0012752638,0.0010566746,0.0003749992],"domain_scores_gemma":[0.99566466,0.0020885414,0.0005634277,0.001216848,0.0003633449,0.00010315696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024125008,0.0003447271,0.0006462003,0.00091248413,0.00017873941,0.000107601016,0.0029302589,0.00016511489,0.000011496254],"category_scores_gemma":[0.000083056504,0.00034255537,0.000113112204,0.0017058154,0.0011797879,0.00045114613,0.0029944319,0.00054859923,0.0000010704846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004858039,0.00007802033,0.00002215482,0.000120451296,0.000008830725,0.0000034891111,0.00097150775,0.3360485,0.000036253805,0.06297307,0.0000105652425,0.59972227],"study_design_scores_gemma":[0.000110596906,0.000109298766,0.00006656916,0.000039275477,0.000005591288,0.000016972335,5.26116e-7,0.49605188,0.00017544061,0.50316036,0.00008458819,0.00017891092],"about_ca_topic_score_codex":0.000023405253,"about_ca_topic_score_gemma":0.000010581159,"teacher_disagreement_score":0.5995434,"about_ca_system_score_codex":0.0002825626,"about_ca_system_score_gemma":0.0010738332,"threshold_uncertainty_score":0.99990267},"labels":[],"label_agreement":null},{"id":"W4313368482","doi":"10.1007/978-3-031-21112-6_12","title":"Real Number Mathematics","year":2023,"lang":"en","type":"book-chapter","venue":"Computer science foundations and applied logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Real number; Number theory; Mathematics; Computer science; Mathematics education; Discrete mathematics","score_opus":0.0466215877733367,"score_gpt":0.2802711558322856,"score_spread":0.23364956805894893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313368482","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092382754,0.000009565419,0.6678941,0.00035439213,0.0011163679,0.00048115375,0.000007915198,0.0007449367,0.32929915],"genre_scores_gemma":[0.005220712,0.00019389404,0.9453271,0.00041114076,0.00076079485,0.000068815054,0.000036207304,0.000078044635,0.047903303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598217,0.000013801881,0.0006559322,0.0017201424,0.00096980773,0.0006581608],"domain_scores_gemma":[0.9970211,0.0003528236,0.00034626073,0.0016724986,0.0002986099,0.00030871434],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010375619,0.0005580639,0.00059298665,0.00042408175,0.0009527534,0.0015981148,0.0027084716,0.0002412912,0.00009011234],"category_scores_gemma":[0.00001974416,0.00050581415,0.0001356617,0.00068506773,0.0013148539,0.00048796332,0.0033169012,0.00044574708,0.0015027936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.556741e-7,0.000036026704,0.0000030074157,0.000030039828,0.000012289429,0.000009071277,0.0002461179,0.00016688292,0.000017156906,0.9265352,0.0003748178,0.07256895],"study_design_scores_gemma":[0.00017908559,0.00006889815,0.00025739748,0.00004912436,0.000019993722,0.000075341995,0.000008107018,0.13313897,0.000010831838,0.8579256,0.007566701,0.00069994346],"about_ca_topic_score_codex":0.000008315116,"about_ca_topic_score_gemma":0.0000075626654,"teacher_disagreement_score":0.28139585,"about_ca_system_score_codex":0.00019112769,"about_ca_system_score_gemma":0.0004541611,"threshold_uncertainty_score":0.99973935},"labels":[],"label_agreement":null},{"id":"W4313827815","doi":"10.21494/iste.op.2023.0907","title":"L’Intelligence Artificielle et les Technologies Quantiques au regard de la Cybersécurité - Introduction","year":2023,"lang":"fr","type":"article","venue":"Technologie et innovation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Artificial Intelligence in Medicine (Canada); Université du Québec à Chicoutimi","funders":"","keywords":"Philosophy; Humanities; Political science","score_opus":0.07760188668680035,"score_gpt":0.35683732641278887,"score_spread":0.2792354397259885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313827815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12017353,0.00084190356,0.63137794,0.2288462,0.002188245,0.0005808154,0.000014765793,0.014169454,0.0018071629],"genre_scores_gemma":[0.88280314,0.0021788955,0.110635705,0.00029711975,0.00037273238,0.00019898279,0.000069140064,0.00006590603,0.0033783654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953809,0.00058102934,0.0010472569,0.0013660982,0.0005728122,0.0010519365],"domain_scores_gemma":[0.99580336,0.001032345,0.0005088245,0.0018265542,0.0007941098,0.00003482281],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0072460645,0.0005125706,0.00046184106,0.001900277,0.00041915665,0.00055480766,0.0019453141,0.0015004867,0.000030618703],"category_scores_gemma":[0.00745603,0.00054936326,0.00011234622,0.013444934,0.001742369,0.0011307867,0.0019653626,0.0019886452,0.0002678741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006615472,0.00016830655,0.00090852863,0.00007031398,0.000020643925,0.00003369999,0.0004809433,0.0032323282,0.004969793,0.5930876,0.006583002,0.39043817],"study_design_scores_gemma":[0.00012885987,0.00037709984,0.0024945473,0.00014810897,0.00001700795,0.00014333939,0.002189612,0.12090845,0.15774119,0.6162251,0.09898481,0.0006418642],"about_ca_topic_score_codex":0.0006295398,"about_ca_topic_score_gemma":0.00011133722,"teacher_disagreement_score":0.7626296,"about_ca_system_score_codex":0.0006053322,"about_ca_system_score_gemma":0.00054878806,"threshold_uncertainty_score":0.9997958},"labels":[],"label_agreement":null},{"id":"W4318023037","doi":"10.1007/978-3-031-25211-2","title":"Algorithms and Discrete Applied Mathematics","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Paris; Malaviya National Institute of Technology, Jaipur; Università degli Studi di Perugia; Universidade Federal Fluminense; Università di Pisa; Indian Institute of Technology Delhi; Birla Institute of Technology and Science, Pilani; Indian Institute of Technology Palakkad; Indian Institute of Technology Madras; Lunds Universitet; Ahmedabad University; Indian Institute of Technology Gandhinagar; University of Twente; Indian Institute of Technology Bhilai; Institute of Mathematical Sciences; Université Cheikh Anta Diop de Dakar; National Institute of Technology Srinagar; University of Lethbridge; Indian Institute of Science","keywords":"Computer science; Graph theory; Computational complexity theory; Theoretical computer science; Game theory; Computational geometry; Algorithm; Mathematical economics; Mathematics; Combinatorics","score_opus":0.018483627893683272,"score_gpt":0.2547746788875921,"score_spread":0.23629105099390882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318023037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053430627,0.0002509285,0.99294657,0.0006841913,0.0023642497,0.0008161622,0.000010934357,0.0007519035,0.0021216508],"genre_scores_gemma":[0.0026160378,0.000049270187,0.9947566,0.00061484374,0.0007935279,0.00004530604,0.0000109875045,0.00007879687,0.0010346349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936191,0.000051673233,0.0008346641,0.0027033803,0.0016030939,0.0011880934],"domain_scores_gemma":[0.9950109,0.0016576297,0.00036439416,0.0024172186,0.00021001189,0.00033984103],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018253176,0.00084121735,0.0009998106,0.0010435974,0.00036760405,0.0012356477,0.005099504,0.00045468507,0.000006813077],"category_scores_gemma":[0.00019974308,0.000749447,0.00014940629,0.002257267,0.0013187295,0.00050103746,0.005817109,0.0011458166,0.00011197347],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022971185,0.00007322475,0.00001984583,0.00024132071,0.000022379274,0.0001636668,0.002211919,0.013319365,0.0000791052,0.012305647,0.00017620708,0.971385],"study_design_scores_gemma":[0.00021261288,0.000095013886,0.00015888679,0.0001630681,0.000008453132,0.00007349569,5.099445e-7,0.6557604,0.00016431588,0.34236646,0.00032191325,0.0006748921],"about_ca_topic_score_codex":0.000015278349,"about_ca_topic_score_gemma":0.00004551195,"teacher_disagreement_score":0.97071016,"about_ca_system_score_codex":0.00054750056,"about_ca_system_score_gemma":0.0010347331,"threshold_uncertainty_score":0.99980116},"labels":[],"label_agreement":null},{"id":"W4318061765","doi":"10.1163/9789004525474_005","title":"A Material Defense of Inductive Inference","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Inference; Inductive reasoning; Computer science; Artificial intelligence","score_opus":0.032601199165175336,"score_gpt":0.24559791388425947,"score_spread":0.21299671471908413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318061765","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034618026,0.000052348783,0.09537414,0.00018696074,0.0023445094,0.0005279672,0.000087236986,0.00032738736,0.90075326],"genre_scores_gemma":[0.1342677,0.00016065646,0.38040552,0.00089814817,0.0013597802,0.00017034842,0.00013198682,0.00023431548,0.48237154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764174,0.000062230145,0.0005398664,0.0008443511,0.0006428245,0.00026900848],"domain_scores_gemma":[0.9977991,0.00023663351,0.0003493826,0.0012989645,0.00022016677,0.000095735464],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030119927,0.00037474296,0.00058613706,0.0002452162,0.00007934812,0.000084083156,0.0017815704,0.00021631629,0.0052334173],"category_scores_gemma":[0.00004915542,0.00035484368,0.0001991372,0.00010007566,0.00016803067,0.00025908006,0.0032033953,0.00043189034,0.00007074368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009583147,0.000038091275,0.00000995015,0.00002767984,0.000040494622,0.00002928763,0.0002961916,0.000024876104,0.00003388036,0.97786325,0.00025589278,0.021370828],"study_design_scores_gemma":[0.00038011617,0.00076223613,0.00016352485,0.000051640625,0.000039997565,0.00006605186,0.000017250866,0.00286901,0.0005139218,0.8720552,0.121983014,0.0010980893],"about_ca_topic_score_codex":0.00018123497,"about_ca_topic_score_gemma":0.000022524133,"teacher_disagreement_score":0.41838172,"about_ca_system_score_codex":0.00016703502,"about_ca_system_score_gemma":0.00031550523,"threshold_uncertainty_score":0.9998903},"labels":[],"label_agreement":null},{"id":"W4318696321","doi":"10.1109/tetci.2023.3237949","title":"IEEE Transactions on Emerging Topics in Computational Intelligence Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computational Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Zhejiang University of Technology; Nanjing University; Universität Bielefeld; Xidian University; South China University of Technology; Massey University; University of Hong Kong; Zhejiang University; East China University of Science and Technology; Yunnan University; Beihang University; China University of Petroleum, Beijing; Dalian University of Technology; Huazhong University of Science and Technology; Queen's University; Northwestern Polytechnical University; University of Electronic Science and Technology of China; Queen's University Belfast; Swinburne University of Technology; Universidad Veracruzana; Deakin University; Jordan University of Science and Technology; Imperial College London; Hong Kong Baptist University; Victoria University of Wellington; Shenzhen University; University of Pretoria; La Trobe University; Northumbria University; City University of Hong Kong; Victoria University; Singapore Management University; University of Manchester; Northwestern University","keywords":"Computer science; Data science; World Wide Web; Information retrieval","score_opus":0.049049657082752975,"score_gpt":0.3195281613872151,"score_spread":0.27047850430446213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318696321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046110987,0.00001775881,0.98217237,0.008678525,0.0028339021,0.00069489534,0.000038941555,0.0005911605,0.0003613323],"genre_scores_gemma":[0.9305187,0.00008200364,0.06785994,0.00088656275,0.00011593597,0.00021541811,0.000050925737,0.000030191408,0.00024031724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507415,0.0002810164,0.001641123,0.0009833251,0.0012746932,0.0007456713],"domain_scores_gemma":[0.99698585,0.001171662,0.0003039395,0.0007077815,0.0006375279,0.00019323795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010953979,0.00050128426,0.000435915,0.0023106586,0.00048932445,0.00038825168,0.0013738435,0.00024894843,0.00013623343],"category_scores_gemma":[0.00007553826,0.00059138593,0.00023568714,0.0047365953,0.00017790878,0.0019526439,0.000014535679,0.0011087403,0.00045250042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016259271,0.0002594109,0.000034879926,0.00003594958,0.00001847929,0.00000808143,0.0019292682,0.7036066,0.0000026683852,0.011826467,0.000051613664,0.28221035],"study_design_scores_gemma":[0.00022458335,0.00015205941,0.0012131277,0.00011706337,0.000008177077,0.000017171393,0.00028714872,0.9353584,0.0012115694,0.06020939,0.00068396295,0.0005173673],"about_ca_topic_score_codex":0.00017958274,"about_ca_topic_score_gemma":0.0001945401,"teacher_disagreement_score":0.9259076,"about_ca_system_score_codex":0.00072043744,"about_ca_system_score_gemma":0.0003415224,"threshold_uncertainty_score":0.99965376},"labels":[],"label_agreement":null},{"id":"W4318710934","doi":"10.1109/isec54952.2022.10025146","title":"A Quantum Optimization Algorithm for Single Machine Total Weighted Tardiness Minimization","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Integrated STEM Education Conference (ISEC)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum sort; Quantum algorithm; Quantum computer; Computer science; Computational complexity theory; Search algorithm; Algorithm; Quantum phase estimation algorithm; Combinatorial search; Computational problem; Quantum complexity theory; Quantum; Theoretical computer science; Mathematics; Beam search; Quantum network","score_opus":0.027072227529073296,"score_gpt":0.25495994855597115,"score_spread":0.22788772102689786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318710934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008837282,0.00017716223,0.9786558,0.0014975163,0.008029026,0.0015703341,0.00028078855,0.00050526106,0.00044681862],"genre_scores_gemma":[0.6760666,0.00002042166,0.31447846,0.0005301091,0.0004765557,0.002831425,0.0021157311,0.00009618412,0.0033845347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605876,0.0005975347,0.0008547162,0.0012019804,0.00074379565,0.00054323144],"domain_scores_gemma":[0.99654394,0.0003228992,0.00051036954,0.0009301384,0.0014761263,0.00021654794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069550757,0.00046371072,0.0004937609,0.0005447766,0.00075867627,0.000536752,0.0013945327,0.00013662578,0.00076117367],"category_scores_gemma":[0.00009230105,0.000480781,0.00019200741,0.002089692,0.00007922738,0.00079260446,0.00032838338,0.00044935418,0.000017302056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013726324,0.0040142923,0.0002605733,0.00011909652,0.00016881795,0.000011035864,0.0045267143,0.106483445,0.002595468,0.022531541,0.010939772,0.848212],"study_design_scores_gemma":[0.0006519238,0.0005135019,0.00007288616,0.000028115031,0.00003376323,0.000095729905,0.0015167573,0.98935074,0.0010211722,0.0019630783,0.004197879,0.0005544531],"about_ca_topic_score_codex":0.0002301,"about_ca_topic_score_gemma":0.0000238107,"teacher_disagreement_score":0.8828673,"about_ca_system_score_codex":0.0008812348,"about_ca_system_score_gemma":0.001896723,"threshold_uncertainty_score":0.9997644},"labels":[],"label_agreement":null},{"id":"W4318819946","doi":"10.18192/cjcs.vi10.6615","title":"From Automatism to Autonomy","year":2023,"lang":"en","type":"article","venue":"Conversations The Journal of Cavellian Studies","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automatism (medicine); Action (physics); Unconscious mind; Feeling; Natural (archaeology); Process (computing); Task (project management); Computer science; Autonomy; Control (management); Cognitive science; Psychology; Aesthetics; Artificial intelligence; Social psychology; Philosophy; Psychoanalysis; Law; Engineering","score_opus":0.05522877449582155,"score_gpt":0.32426099556275584,"score_spread":0.2690322210669343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318819946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14227904,0.0014958221,0.7889377,0.061534487,0.0045334864,0.00040253138,0.0000133608555,0.0003206078,0.00048297414],"genre_scores_gemma":[0.93132955,0.0002873587,0.06595762,0.00092501455,0.000624267,0.000011245618,0.0000010670851,0.000014458794,0.00084940146],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99856234,0.00017820748,0.00048315205,0.00016250984,0.00038988073,0.00022392046],"domain_scores_gemma":[0.9973329,0.0013118206,0.00025773534,0.00050071336,0.000494218,0.00010262201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010639689,0.00013618435,0.00028544894,0.00023383735,0.00028583797,0.00009162904,0.001170276,0.00002930493,0.00001735423],"category_scores_gemma":[0.0003721448,0.00009220443,0.00011128446,0.0009997211,0.000112293936,0.0003316146,0.00056662323,0.00016721935,0.00035003628],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031501542,0.00024516493,0.0038623444,0.00005792157,0.002209053,0.00019981041,0.48752743,0.020689562,0.0007166452,0.014937176,0.22562128,0.2439021],"study_design_scores_gemma":[0.0024462126,0.0011156063,0.27273864,0.00036357,0.00043095803,0.00024200993,0.051404025,0.25702655,0.0026919658,0.23626594,0.17400025,0.0012742656],"about_ca_topic_score_codex":0.000024248995,"about_ca_topic_score_gemma":0.000007684829,"teacher_disagreement_score":0.7890505,"about_ca_system_score_codex":0.00019358617,"about_ca_system_score_gemma":0.0002145178,"threshold_uncertainty_score":0.4499125},"labels":[],"label_agreement":null},{"id":"W4319323813","doi":"10.48550/arxiv.2302.01885","title":"Software for \"How to Bake a Quantum Pi\"","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Complementarity (molecular biology); Computation; Quantum; Recipe; Categorical variable; Quantum computer; Computer science; Quantum algorithm; Theoretical computer science; Mathematics; Theoretical physics; Algorithm; Quantum mechanics; Physics","score_opus":0.1421193273496558,"score_gpt":0.21350604850338603,"score_spread":0.07138672115373024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319323813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036029056,0.000023012184,0.9567094,0.0015204737,0.0026770623,0.001272362,0.00009936778,0.0015856195,0.00008368896],"genre_scores_gemma":[0.8943701,0.000027964083,0.099046424,0.00035293627,0.00036351907,0.000022263459,0.000047703797,0.000080612816,0.005688482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608815,0.00015195538,0.00027056053,0.0025117057,0.00019213301,0.0007855095],"domain_scores_gemma":[0.995468,0.0007256848,0.00022862767,0.0025687222,0.00059268076,0.0004162602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059317244,0.0005274301,0.0006095815,0.0005152666,0.00025807958,0.0003771223,0.004317919,0.00039155118,0.000012919629],"category_scores_gemma":[0.00058394717,0.0006279606,0.00044792265,0.0015678447,0.00009601801,0.00032968048,0.007247396,0.00055610586,0.00026373446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118419404,0.00050808734,0.0066377358,0.00084652926,0.0003886682,0.00096118235,0.0015228348,0.6218641,0.00003978267,0.33067328,0.021485232,0.014954194],"study_design_scores_gemma":[0.00047964192,0.00020355874,0.0033085584,0.00009083321,0.00005286987,0.0000043169784,0.00006413402,0.752514,0.00003873236,0.23715988,0.005221516,0.0008619758],"about_ca_topic_score_codex":0.00015499337,"about_ca_topic_score_gemma":0.00017400182,"teacher_disagreement_score":0.85834104,"about_ca_system_score_codex":0.00043980466,"about_ca_system_score_gemma":0.00043053212,"threshold_uncertainty_score":0.99961716},"labels":[],"label_agreement":null},{"id":"W4321333045","doi":"10.2139/ssrn.4360725","title":"Adverse Selection with Heterogeneously Informed Agents","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Adverse selection; Selection (genetic algorithm); Psychology; Medicine; Business; Computer science; Artificial intelligence; Actuarial science","score_opus":0.013249367402206669,"score_gpt":0.2499786841109469,"score_spread":0.23672931670874023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321333045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5399931,0.00010715937,0.45716435,0.00080909155,0.0004963513,0.0002515389,6.9142436e-7,0.00060728216,0.0005704115],"genre_scores_gemma":[0.9938652,0.00041720213,0.0042706016,0.00016514269,0.00026621952,0.000013728956,0.0000032427308,0.000024336692,0.0009743162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960413,0.00010243574,0.00032364365,0.00037909864,0.0005872675,0.0025662594],"domain_scores_gemma":[0.99907774,0.00007934438,0.00017536043,0.00034042454,0.00016864855,0.00015848222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012331093,0.00022081328,0.00019838195,0.0003176467,0.00035911126,0.00015166402,0.0009414719,0.000074963515,0.000014203136],"category_scores_gemma":[0.00005865538,0.00017993546,0.00012309932,0.0014319943,0.00004380459,0.000683513,0.00021245916,0.0011642361,0.00023602397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027902942,0.0005734176,0.037739933,0.00006813324,0.0012564149,0.0003531667,0.0037232947,0.058529917,0.0007603465,0.16358809,0.0021693453,0.7309589],"study_design_scores_gemma":[0.005279435,0.0060953456,0.036901172,0.00008603239,0.00009033587,0.018001555,0.0012835261,0.5284781,0.001169094,0.38556978,0.015189909,0.0018557296],"about_ca_topic_score_codex":0.00004000188,"about_ca_topic_score_gemma":0.0010084874,"teacher_disagreement_score":0.72910315,"about_ca_system_score_codex":0.0013346669,"about_ca_system_score_gemma":0.0027618487,"threshold_uncertainty_score":0.7337555},"labels":[],"label_agreement":null},{"id":"W4323828432","doi":"10.4171/owr/2022/2","title":"Set Theory","year":2023,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Set (abstract data type); Set theory; Field theory (psychology); Field (mathematics); Unit (ring theory); Mathematics; Universal set; Theoretical physics; Mathematical economics; Computer science; Physics; Pure mathematics; Mathematical physics; Mathematics education","score_opus":0.029018753174465495,"score_gpt":0.268769384990624,"score_spread":0.23975063181615852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323828432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3579026,0.000330009,0.5723961,0.0029237422,0.0069730487,0.0008988507,0.0000075552825,0.006581741,0.051986374],"genre_scores_gemma":[0.9807041,0.000009829468,0.012909913,0.00030683348,0.00020943901,0.000048589685,0.000018601117,0.00002581344,0.00576684],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973237,0.00017228973,0.00051527785,0.0008723342,0.0005685428,0.0005478683],"domain_scores_gemma":[0.99740547,0.00028174339,0.00019065374,0.0018275125,0.00011321505,0.00018139834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002253394,0.00021245932,0.0002534084,0.00018610565,0.00017727815,0.0001984867,0.0007091016,0.00009658222,0.000098718425],"category_scores_gemma":[0.00035108154,0.00019224678,0.0001501363,0.0012196276,0.00007552766,0.00036559245,0.0009648587,0.0001989837,0.00054358953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129053715,0.0003232486,0.050923385,0.00013325339,0.00016683526,0.021740576,0.0069931233,0.0033761077,0.0013536621,0.17128216,0.0859281,0.65776664],"study_design_scores_gemma":[0.00027488734,0.00015375348,0.112059504,0.00002950902,0.000019169642,0.0028777325,0.00014268991,0.05252468,0.0021386007,0.7092384,0.11957411,0.0009669365],"about_ca_topic_score_codex":0.00003358753,"about_ca_topic_score_gemma":0.000006810913,"teacher_disagreement_score":0.65679973,"about_ca_system_score_codex":0.00007018795,"about_ca_system_score_gemma":0.00012244996,"threshold_uncertainty_score":0.7839596},"labels":[],"label_agreement":null},{"id":"W4324123058","doi":"10.2139/ssrn.4382480","title":"Knowledge as Output and as Input: Artificial Intelligence and Quantum Computing","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Quantum computer; Computer science; Artificial intelligence; Quantum; Physics; Quantum mechanics","score_opus":0.038788621243984106,"score_gpt":0.29935416750086424,"score_spread":0.2605655462568801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324123058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45528242,0.0026380979,0.53818655,0.002223397,0.00075853034,0.00017390632,5.3088996e-7,0.0002830821,0.00045350436],"genre_scores_gemma":[0.9963812,0.0011483587,0.0016807336,0.00009630701,0.0004210309,0.0000022849279,8.8392954e-7,0.000020038104,0.0002491173],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960625,0.00021080134,0.0005083619,0.00063760026,0.00036191175,0.0022187799],"domain_scores_gemma":[0.9987201,0.00036981195,0.00016892739,0.0003486578,0.00015831739,0.00023415536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034926513,0.000268711,0.00031263535,0.00033629898,0.0005597046,0.0005095186,0.00085128786,0.00010666101,0.0000050764147],"category_scores_gemma":[0.00029820023,0.00025080956,0.00008602647,0.0009506138,0.00016355081,0.00039477958,0.00093669095,0.0016042102,0.00022580696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073893048,0.00004672995,0.00026179143,0.000008620054,0.000030129979,0.000020207397,0.001231525,0.00014891414,0.00004908909,0.47859588,0.000023972601,0.5195758],"study_design_scores_gemma":[0.00010191519,0.00049167225,0.0008508077,0.00002177245,0.000008712515,0.001412994,0.000718734,0.2689761,0.000112959904,0.72660786,0.0004590718,0.00023739638],"about_ca_topic_score_codex":0.000073505944,"about_ca_topic_score_gemma":0.0001819921,"teacher_disagreement_score":0.54109883,"about_ca_system_score_codex":0.00034846403,"about_ca_system_score_gemma":0.0015587482,"threshold_uncertainty_score":0.9999944},"labels":[],"label_agreement":null},{"id":"W4327815339","doi":"10.55092/aias20230001","title":"Frontiers in Artificial Intelligence and Autonomous Systems","year":2023,"lang":"en","type":"article","venue":"Artificial Intelligence and Autonomous Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Cognitive science; Psychology","score_opus":0.061334639903896294,"score_gpt":0.2772219073231605,"score_spread":0.2158872674192642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327815339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09925667,0.0028961853,0.885889,0.0010855263,0.0076809693,0.0016145135,0.000023634564,0.0010762747,0.00047722884],"genre_scores_gemma":[0.99569726,0.00024111828,0.0030816046,0.00006647387,0.00045445858,0.00019218809,0.000010258649,0.000043968757,0.00021268912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941901,0.000417585,0.0018502215,0.0017221068,0.0005726822,0.0012473073],"domain_scores_gemma":[0.9974586,0.0005313358,0.0003549377,0.0010617153,0.00019787082,0.00039553508],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002419524,0.0006038909,0.0009749131,0.0009136992,0.00046802044,0.0015679712,0.001299458,0.0003302093,0.0000072661896],"category_scores_gemma":[0.00020742136,0.000602222,0.00012988836,0.0021485977,0.00044777317,0.0008493873,0.00081206806,0.00050127716,0.00031415132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034127388,0.00027582634,0.0021517058,0.0003067533,0.00006672821,0.0002956017,0.006468206,0.075188234,0.0003971747,0.3288977,0.00029085422,0.5856271],"study_design_scores_gemma":[0.000031265357,0.00024640127,0.00046905314,0.00012951587,0.000013869187,0.00010611084,0.0047189076,0.9397408,0.0011045863,0.051459473,0.0012801912,0.00069984875],"about_ca_topic_score_codex":0.0022659695,"about_ca_topic_score_gemma":0.00023457552,"teacher_disagreement_score":0.89644057,"about_ca_system_score_codex":0.00028989767,"about_ca_system_score_gemma":0.0002670747,"threshold_uncertainty_score":0.9996429},"labels":[],"label_agreement":null},{"id":"W4360106635","doi":"10.5281/zenodo.7764303","title":"Families of Modular Arithmetic Progressions with an Interval of Distance Multiplicities","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arithmetic; Interval (graph theory); Modular design; Interval arithmetic; Modular arithmetic; Mathematics; Computer science; Combinatorics; Programming language; Mathematical analysis","score_opus":0.03682057269624774,"score_gpt":0.25849630220083286,"score_spread":0.2216757295045851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360106635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43065208,0.00007563476,0.56109077,0.00046141478,0.00011954443,0.00069607235,0.00015342797,0.0017978281,0.004953216],"genre_scores_gemma":[0.98471606,0.000023281016,0.014702576,0.000012170412,0.000026787884,1.0853924e-7,0.00012258209,0.00028089967,0.00011555563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982255,0.00028404922,0.00029497853,0.00042671754,0.00048324856,0.00028549298],"domain_scores_gemma":[0.99822885,0.000052447333,0.00014250311,0.0008003905,0.0006640399,0.00011175989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755781,0.00012838808,0.00020748665,0.00029001437,0.00052865845,0.00023557706,0.0017793904,0.000036022193,0.00017324324],"category_scores_gemma":[0.00027498687,0.00011244248,0.000045811226,0.0013307988,0.00041180162,0.00040233604,0.0018253367,0.0001450132,0.00016395013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015895838,0.001266309,0.00043380403,0.0006727006,0.00014039148,0.000059506594,0.02101761,0.0059522265,0.010353258,0.0680655,0.0041259117,0.88775384],"study_design_scores_gemma":[0.0022086457,0.004322118,0.03701816,0.0005374548,0.000037608002,0.00016295529,0.005083572,0.7581407,0.010623938,0.008216472,0.17269492,0.0009534432],"about_ca_topic_score_codex":0.000021221458,"about_ca_topic_score_gemma":0.0000010210997,"teacher_disagreement_score":0.88680035,"about_ca_system_score_codex":0.000047664482,"about_ca_system_score_gemma":0.0000070358346,"threshold_uncertainty_score":0.45852712},"labels":[],"label_agreement":null},{"id":"W4360593171","doi":"10.3389/978-2-8325-1651-5","title":"Current Thoughts on the Brain-Computer Analogy - All Metaphors Are Wrong, But Some Are Useful","year":2023,"lang":"en","type":"book","venue":"Frontiers research topics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agència de Gestió d'Ajuts Universitaris i de Recerca; National Institutes of Health; Ministerio de Economía y Competitividad; Santa Fe Institute; Austrian Science Fund; Agence Nationale de la Recherche; Templeton World Charity Foundation; Fondation Pour l'Audition; Canadian Institute for Advanced Research","keywords":"Analogy; Current (fluid); Cognitive science; Computer science; Psychology; Philosophy; Epistemology; Engineering; Electrical engineering","score_opus":0.13266145250856462,"score_gpt":0.3495442699375451,"score_spread":0.2168828174289805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360593171","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010934601,0.023272939,0.5580468,0.3041623,0.07926758,0.010558662,0.00083273125,0.00312857,0.019636923],"genre_scores_gemma":[0.000039399965,0.0012582166,0.011902292,0.0017582816,0.013180899,0.00031010387,0.00014316906,0.00021271913,0.9711949],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9892811,0.0020187283,0.0008735424,0.0024388372,0.003354585,0.0020331778],"domain_scores_gemma":[0.9931175,0.0009735355,0.0004760238,0.0040724007,0.0008104822,0.00055003393],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0038189704,0.0008825112,0.0012726984,0.0012935431,0.0007175386,0.0009843651,0.0075045233,0.00069801527,0.000030477175],"category_scores_gemma":[0.0007300403,0.0006589876,0.00069806335,0.0010306261,0.00078387867,0.00040392854,0.004581789,0.0043797665,0.0006694283],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011699141,0.00013062246,0.00018673063,0.00014099771,0.00024876656,0.00029176718,0.00046379684,0.00016920024,3.1526096e-7,0.012507839,0.9435449,0.042303327],"study_design_scores_gemma":[0.00024301419,0.00028219694,0.0029731619,0.00020386734,0.000022704147,0.0000062885993,0.000052336618,0.028345041,0.000011014867,0.13340032,0.83384496,0.0006150827],"about_ca_topic_score_codex":0.000028940227,"about_ca_topic_score_gemma":0.000106020365,"teacher_disagreement_score":0.951558,"about_ca_system_score_codex":0.0015739107,"about_ca_system_score_gemma":0.0011142052,"threshold_uncertainty_score":0.99958616},"labels":[],"label_agreement":null},{"id":"W4361272622","doi":"10.1017/s0960129523000099","title":"Behavioural equivalences for continuous-time Markov processes","year":2023,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bisimulation; Equivalence (formal languages); Morphism; Mathematical proof; Theoretical computer science; Computer science; Equivalence relation; Mathematics; Discrete time and continuous time; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.03218182029196753,"score_gpt":0.2961706072596858,"score_spread":0.26398878696771827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361272622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11729612,0.000038724964,0.8794071,0.00084607664,0.00079813757,0.0007566201,0.000008641992,0.0006505851,0.00019799818],"genre_scores_gemma":[0.5243134,0.0000021677351,0.47523808,0.0001673119,0.00013258254,0.000078218975,0.000002389328,0.00001343737,0.000052388357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959107,0.000072744,0.00063402904,0.001234951,0.0010590955,0.0010885011],"domain_scores_gemma":[0.997002,0.0013237501,0.00015026929,0.0009551449,0.00033398,0.00023484143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001873815,0.0003314717,0.0004917963,0.0004521745,0.00035783745,0.0008868741,0.004345412,0.00008208921,0.000042890504],"category_scores_gemma":[0.0007575746,0.00026361275,0.0001102248,0.0031365089,0.00084753596,0.00091500406,0.0020309344,0.00019156722,0.00008053922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003538668,0.00057331595,0.012417919,0.0012967347,0.000027779184,0.00023536006,0.005178647,0.005596862,0.0012388969,0.21635039,0.002366084,0.7546826],"study_design_scores_gemma":[0.00025475278,0.000111447625,0.010740914,0.00005063749,0.0000033980116,0.00005493834,0.000011044646,0.6334641,0.0006840502,0.3542832,0.000044092976,0.0002974425],"about_ca_topic_score_codex":0.000008720293,"about_ca_topic_score_gemma":0.0000043570462,"teacher_disagreement_score":0.7543852,"about_ca_system_score_codex":0.00011930631,"about_ca_system_score_gemma":0.0003060522,"threshold_uncertainty_score":0.9999816},"labels":[],"label_agreement":null},{"id":"W4365459994","doi":"10.4171/owr/2022/17","title":"Toric Geometry","year":2023,"lang":"de","type":"article","venue":"Oberwolfach Reports","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algebraic geometry; Geometry; Toric variety; Field (mathematics); Tropical geometry; Mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.02813555345504844,"score_gpt":0.2631310036553821,"score_spread":0.23499545020033366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365459994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60042554,0.022751424,0.1589192,0.009969772,0.16102555,0.003937426,0.00007122458,0.010413675,0.032486208],"genre_scores_gemma":[0.9557408,0.0005641314,0.015018414,0.00053850736,0.0047445814,0.00011714296,0.00012773687,0.00016056605,0.022988126],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9916842,0.00031190482,0.0017836315,0.0025579366,0.0019012281,0.0017610738],"domain_scores_gemma":[0.9935179,0.00050998054,0.00081452494,0.0040286714,0.00044461765,0.0006843498],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033706548,0.00073345,0.00089947553,0.0008331168,0.00052531745,0.00082383846,0.0014565774,0.0004463042,0.00045368713],"category_scores_gemma":[0.0010539172,0.0007576299,0.00054158235,0.0066887364,0.00021725045,0.00067995104,0.0028225821,0.0007733742,0.0055957055],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019083627,0.0013545081,0.113195576,0.00063618436,0.00062832964,0.053434316,0.0035154477,0.0051356326,0.00050530024,0.005423169,0.21341544,0.602737],"study_design_scores_gemma":[0.00051874126,0.0004907262,0.20669024,0.00015902305,0.00018725682,0.0020909866,0.00010122024,0.10854315,0.0008271974,0.032867547,0.64527273,0.0022512127],"about_ca_topic_score_codex":0.00034471738,"about_ca_topic_score_gemma":0.000016286516,"teacher_disagreement_score":0.6004858,"about_ca_system_score_codex":0.00046900337,"about_ca_system_score_gemma":0.00057228043,"threshold_uncertainty_score":0.99948746},"labels":[],"label_agreement":null},{"id":"W4366777573","doi":"10.1017/jsl.2023.26","title":"ON THE C.E. DEGREES REALIZABLE IN $\\Pi ^0_1$ CLASSES","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Marsden Fund; Ministry of Education, India","keywords":"Class (philosophy); Mathematics; Degree (music); Pi; Set (abstract data type); Bounded function; Combinatorics; Discrete mathematics; Representation (politics); Computer science; Mathematical analysis; Artificial intelligence; Physics","score_opus":0.049413102059981936,"score_gpt":0.2843571914520112,"score_spread":0.23494408939202927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366777573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89924765,0.00065149897,0.047629844,0.03638529,0.002697221,0.00047774304,0.0000031597235,0.00031066663,0.01259695],"genre_scores_gemma":[0.99398875,0.00018481897,0.004319564,0.001012412,0.00026249525,0.0000067557457,3.8332976e-7,0.00001151994,0.00021329694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774826,0.0003042045,0.0006110331,0.00026954882,0.00063065445,0.00043629998],"domain_scores_gemma":[0.9975529,0.001258688,0.00031976224,0.0005869127,0.0001728405,0.00010891508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021577575,0.00018066462,0.00036861526,0.0004139261,0.00011697113,0.00018816328,0.0018214643,0.00008691352,0.00004387266],"category_scores_gemma":[0.000627227,0.0001052809,0.00016817906,0.001649704,0.00008465511,0.00032112794,0.0003823165,0.00047075917,0.00014581326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007048846,0.0010059057,0.020078681,0.00007911167,0.00012847122,0.0018179961,0.0041273446,0.060078647,0.00090798765,0.79332596,0.061922863,0.05645652],"study_design_scores_gemma":[0.00087838457,0.0009518054,0.13704462,0.00016498551,0.000013805394,0.00036040595,0.00046657427,0.10293119,0.00037651346,0.7513278,0.00509012,0.0003937877],"about_ca_topic_score_codex":0.000040023162,"about_ca_topic_score_gemma":0.00003383345,"teacher_disagreement_score":0.116965935,"about_ca_system_score_codex":0.00013869982,"about_ca_system_score_gemma":0.00017089606,"threshold_uncertainty_score":0.42932305},"labels":[],"label_agreement":null},{"id":"W4367337916","doi":"10.15215/aupress/9781897425787.01","title":"From Bricks to Brains: The Embodied Cognitive Science of LEGO Robots","year":2010,"lang":"en","type":"book","venue":"Athabasca University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Embodied cognition; Cognitive science; Robot; Cognition; Cognitive robotics; Psychology; Computer science; Artificial intelligence; Neuroscience","score_opus":0.02003628078258854,"score_gpt":0.22705953533925727,"score_spread":0.20702325455666873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367337916","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018938755,0.0000685529,0.14285176,0.00017774949,0.0012580452,0.001378029,0.0003062266,0.00029258913,0.8517732],"genre_scores_gemma":[0.054974865,0.000016648593,0.031724077,0.0006426029,0.00080011156,0.000009649559,0.0000417627,0.00008649945,0.91170377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99593353,0.0001929209,0.00036806587,0.0016056381,0.0012471206,0.0006527451],"domain_scores_gemma":[0.9949594,0.0011420016,0.00046717594,0.0021595468,0.0009050449,0.0003667922],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007094399,0.0005280326,0.000677168,0.00041973297,0.00057376485,0.0002814955,0.0075847055,0.00038820234,0.000017141601],"category_scores_gemma":[0.00020163906,0.00049054733,0.00032619495,0.0002058264,0.001687104,0.00048453384,0.0068285065,0.0010687852,0.000026917854],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029461106,0.00060652907,0.00009405583,0.0002457737,0.00093124114,0.00077239145,0.04365785,0.00042805044,0.0014155054,0.7315527,0.030869022,0.18913226],"study_design_scores_gemma":[0.004868668,0.001490367,0.006294036,0.0017944735,0.0009730634,0.00009881369,0.0012365824,0.024332728,0.013240812,0.047947273,0.8920538,0.005669416],"about_ca_topic_score_codex":0.0026955616,"about_ca_topic_score_gemma":0.00027871088,"teacher_disagreement_score":0.8611847,"about_ca_system_score_codex":0.00036219516,"about_ca_system_score_gemma":0.0016356069,"threshold_uncertainty_score":0.9997546},"labels":[],"label_agreement":null},{"id":"W4375957433","doi":"10.48550/arxiv.2305.03887","title":"Ring wormholes and time machines","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts; Grantová Agentura České Republiky","keywords":"Wormhole; Ring (chemistry); Computer science; Physics; Chemistry; Theoretical physics","score_opus":0.07746721931481082,"score_gpt":0.18815062696983972,"score_spread":0.1106834076550289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375957433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.305919,0.00015434434,0.6881653,0.00036946443,0.0010345111,0.0005308817,0.00001734643,0.0015149902,0.0022941423],"genre_scores_gemma":[0.9869084,0.00013877102,0.008661218,0.000059831727,0.00015450867,0.0000016155462,0.0000100476345,0.00003206646,0.0040335744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753654,0.00014795076,0.00021094787,0.0015391939,0.00011560674,0.00044974493],"domain_scores_gemma":[0.9978751,0.000277798,0.0001666052,0.001360416,0.000107367094,0.00021271066],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00044225767,0.00037248764,0.0004073953,0.00034129366,0.00018370347,0.00026406153,0.0019504781,0.00023917321,0.000022144732],"category_scores_gemma":[0.0000636704,0.00041626848,0.00016715318,0.00065077393,0.00015870798,0.00033342984,0.008113253,0.00056238053,0.00030316194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006065731,0.00040173146,0.055701435,0.0006818899,0.00048836006,0.0028452491,0.0015264158,0.56663877,0.00016098903,0.31715736,0.00126874,0.05306843],"study_design_scores_gemma":[0.00022572704,0.000027214486,0.013132189,0.000059333892,0.00002652659,0.000008086824,0.000009413655,0.8322506,0.000017084076,0.15365127,0.00017860586,0.00041396337],"about_ca_topic_score_codex":0.00021222241,"about_ca_topic_score_gemma":0.000045843917,"teacher_disagreement_score":0.6809894,"about_ca_system_score_codex":0.00015482015,"about_ca_system_score_gemma":0.000110297464,"threshold_uncertainty_score":0.9999089},"labels":[],"label_agreement":null},{"id":"W4378879075","doi":"10.1007/978-3-031-34034-5","title":"Unconventional Computation and Natural Computation","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Paderborn; Academia Româna; Università degli Studi di Milano-Bicocca; Università degli Studi di Verona; National Taiwan University; University of Waterloo; Yonsei University; Universiteit Leiden; Université d'Orléans; Università degli Studi di Milano; Aalto-Yliopisto; Indian Institute of Technology Madras; University of South Florida; Universiteit Utrecht; Manchester Metropolitan University; Massachusetts Institute of Technology; Turun Yliopisto; Norges Teknisk-Naturvitenskapelige Universitet; Harvard University; University of North Florida","keywords":"Computer science; Computation; Natural computing; Natural (archaeology); Computational model; Computational resource; Computational complexity theory; Artificial intelligence; Algorithm; Geology","score_opus":0.01729666621388524,"score_gpt":0.2713882029666521,"score_spread":0.25409153675276686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378879075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000538018,0.000462362,0.99015445,0.0010501827,0.0061189365,0.00068438635,0.0000092876435,0.00067534635,0.0003070446],"genre_scores_gemma":[0.13786449,0.00003502793,0.8584163,0.0011039117,0.0012281426,0.000033311237,0.00012872842,0.00008509211,0.0011049804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939643,0.00018108133,0.0008485998,0.0024398318,0.001683247,0.0008828964],"domain_scores_gemma":[0.99617475,0.0018053808,0.00043397254,0.00079133693,0.0005538193,0.0002407434],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001694988,0.00069726026,0.00073171663,0.0014147366,0.00044124504,0.0011466397,0.0022972547,0.00035618877,0.0000044914555],"category_scores_gemma":[0.00022507351,0.000692787,0.00017443683,0.002325844,0.001028431,0.0009971765,0.0026430266,0.0011225869,0.00008415493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005673446,0.000061283055,0.00016893973,0.00012620918,0.000020736712,0.00011312635,0.00059081253,0.18391243,0.000030701958,0.002769912,0.00026817142,0.811932],"study_design_scores_gemma":[0.00033918075,0.000119122284,0.0029064347,0.00017078064,0.00000700253,0.00009473446,2.8073654e-7,0.7078289,0.000035606958,0.28787816,0.00009322244,0.0005265639],"about_ca_topic_score_codex":0.000032491254,"about_ca_topic_score_gemma":0.00010659436,"teacher_disagreement_score":0.8114055,"about_ca_system_score_codex":0.00088987034,"about_ca_system_score_gemma":0.0013825028,"threshold_uncertainty_score":0.99989027},"labels":[],"label_agreement":null},{"id":"W4379796905","doi":"10.3390/e25060903","title":"Free Agency and Determinism: Is There a Sensible Definition of Computational Sourcehood?","year":2023,"lang":"en","type":"article","venue":"Entropy","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; European Research Council; Government of Canada; Foundational Questions Institute","keywords":"Computer science; Determinism; Theoretical computer science; Irreducibility; Agency (philosophy); Turing machine; Computational model; Conjecture; Computational complexity theory; Artificial intelligence; Epistemology; Algorithm; Mathematics; Discrete mathematics","score_opus":0.03024651536871166,"score_gpt":0.24941976622387824,"score_spread":0.2191732508551666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379796905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66248006,0.00011773569,0.33423272,0.001438956,0.0002532954,0.00017358229,0.000032756154,0.00028414864,0.0009867642],"genre_scores_gemma":[0.8838336,0.000016659435,0.11584536,0.00017600656,0.000056591216,0.0000063950647,0.0000072238777,0.000009149286,0.00004902749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876994,0.000084219326,0.00024313851,0.00035441667,0.00032362714,0.0002246691],"domain_scores_gemma":[0.9990373,0.00025574095,0.00009612096,0.00044456575,0.000093397226,0.00007287271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022983458,0.000121826924,0.00017299515,0.0001236633,0.0000909073,0.00006423555,0.00040273307,0.0000515605,0.00004172246],"category_scores_gemma":[0.000064677064,0.00011700963,0.000066902096,0.00045129293,0.00007523497,0.00014616046,0.0004918112,0.00008560676,0.00006792534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004955875,0.0007633337,0.044419266,0.0004352007,0.00024533228,0.00043061722,0.029762784,0.0063727656,0.005186615,0.64505804,0.019873781,0.2474027],"study_design_scores_gemma":[0.00056319876,0.00012744447,0.09831697,0.00001829146,0.000007762879,0.00003653931,0.000049933704,0.3125707,0.00085598644,0.5870164,0.00026727974,0.00016946565],"about_ca_topic_score_codex":0.000025616915,"about_ca_topic_score_gemma":0.00000276205,"teacher_disagreement_score":0.30619794,"about_ca_system_score_codex":0.000019432411,"about_ca_system_score_gemma":0.00005228891,"threshold_uncertainty_score":0.4771514},"labels":[],"label_agreement":null},{"id":"W4380083100","doi":"10.1016/j.techum.2023.05.004","title":"Re-creating the world - On necessary features for the creation of AGI","year":2023,"lang":"en","type":"article","venue":"New Techno Humanities","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Consciousness; Reflexivity; Anthropocentrism; Epistemology; Relevance (law); Cognitive science; Realization (probability); Computer science; Relation (database); Artificial general intelligence; Artificial intelligence; Psychology; Sociology; Philosophy; Environmental ethics; Mathematics; Political science; Social science","score_opus":0.04689459887227994,"score_gpt":0.29275016347082045,"score_spread":0.24585556459854052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380083100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059321683,0.004077057,0.44332013,0.088417344,0.0053973366,0.009092536,0.00009361285,0.011809648,0.37847066],"genre_scores_gemma":[0.95444953,0.000038037317,0.014675932,0.0010496088,0.000788947,0.00023328245,0.000011938218,0.000036373967,0.028716343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881274,0.000042851454,0.00023791501,0.00029043507,0.00036860167,0.00024746027],"domain_scores_gemma":[0.99675524,0.0020903526,0.00014283691,0.0008922321,0.000100915895,0.00001841908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000554755,0.00015373436,0.00016229702,0.00020963873,0.00059308665,0.00024683235,0.0015014675,0.000049690716,0.000022744758],"category_scores_gemma":[0.00020797363,0.00009136077,0.00010322753,0.0007302133,0.00019891362,0.0001808694,0.00039861057,0.00020136207,0.000010667672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015891288,0.000044412103,0.00022708817,0.00005899784,0.00004197904,0.0000021380533,0.00593548,0.0020941622,0.00013155682,0.71345943,0.06687017,0.2111187],"study_design_scores_gemma":[0.0009832677,0.0008547057,0.035180226,0.000316189,0.00008122556,0.000008820971,0.009852379,0.15513316,0.018495144,0.64964354,0.12870108,0.00075029704],"about_ca_topic_score_codex":0.00034306428,"about_ca_topic_score_gemma":0.0011089984,"teacher_disagreement_score":0.89512783,"about_ca_system_score_codex":0.000046398534,"about_ca_system_score_gemma":0.000054784006,"threshold_uncertainty_score":0.45616028},"labels":[],"label_agreement":null},{"id":"W4381198296","doi":"10.2139/ssrn.4484236","title":"Trapped Before Clicking Enter Digital Inequality and Search Engine Autocomplete Algorithmic Bias","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Inequality; Computer science; Search engine; Mathematics; World Wide Web; Mathematical analysis","score_opus":0.0609937723079217,"score_gpt":0.29723430033883946,"score_spread":0.23624052803091777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381198296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22503081,0.0008345347,0.7688506,0.0026410527,0.0011583831,0.0007996347,0.00004561943,0.0005906075,0.000048759004],"genre_scores_gemma":[0.98772615,0.0007188912,0.00945122,0.00008723558,0.0013797419,0.000053924246,0.00005409308,0.00010533903,0.00042341405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991157,0.00050356315,0.0012487749,0.001549667,0.0012390495,0.004301935],"domain_scores_gemma":[0.99711955,0.00037926235,0.0004985524,0.0012864873,0.00033626947,0.00037986957],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0066968505,0.00076678174,0.0009420879,0.00067318557,0.00041745842,0.0019222718,0.0029421076,0.00040835526,0.000009251856],"category_scores_gemma":[0.00023361,0.0007065281,0.0005381358,0.00066609203,0.00018704963,0.0007406853,0.004698338,0.008467913,0.00005084468],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003501916,0.0003055744,0.0118924435,0.00023250219,0.00081834866,0.00013566212,0.0033395588,0.0025350126,0.0000277911,0.025806015,0.00005807856,0.954814],"study_design_scores_gemma":[0.0011386082,0.0007461366,0.013617153,0.00018777631,0.00004360453,0.0013967389,0.00031472105,0.31980762,0.00002280456,0.66122013,0.0005485787,0.00095615385],"about_ca_topic_score_codex":0.0002152636,"about_ca_topic_score_gemma":0.00035482366,"teacher_disagreement_score":0.95385784,"about_ca_system_score_codex":0.001923695,"about_ca_system_score_gemma":0.0030880775,"threshold_uncertainty_score":0.9995386},"labels":[],"label_agreement":null},{"id":"W4383347209","doi":"10.4000/books.pupo.30858","title":"The Probability of Sense in the Hypermnesiac Machine","year":2017,"lang":"en","type":"book-chapter","venue":"Presses universitaires de Paris Nanterre eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Sense (electronics); Computer science; Engineering; Electrical engineering","score_opus":0.019470316999685867,"score_gpt":0.22443014331805192,"score_spread":0.20495982631836604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383347209","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012658383,0.004461311,0.029350135,0.004585963,0.00090660923,0.0024222212,0.0001308987,0.00026692127,0.9566101],"genre_scores_gemma":[0.9611932,0.00033747542,0.0022890607,0.000096489035,0.00014614093,0.00001729424,0.00001286902,0.000050490646,0.035857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997382,0.0002597752,0.00051276316,0.00076451834,0.0005883374,0.00049262174],"domain_scores_gemma":[0.9947588,0.0012792283,0.00062750763,0.0030407493,0.00020236263,0.000091379974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000975893,0.00047622505,0.0005647215,0.00015806891,0.0005585413,0.00040443748,0.004415254,0.0002950973,0.0000115420635],"category_scores_gemma":[0.00013951371,0.00031005937,0.00035142267,0.000031808464,0.0007881697,0.00024650557,0.0020655906,0.0007643513,0.000011347169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002917528,0.0002682974,0.0028612455,0.0005035519,0.00042491435,0.0011764982,0.0072743245,0.00019634515,0.000048374837,0.5311025,0.0035618562,0.45229033],"study_design_scores_gemma":[0.001228475,0.00043573134,0.002847405,0.000624519,0.00021339425,0.00036195683,0.00019642954,0.022099907,0.00019286595,0.6864463,0.28409705,0.001255951],"about_ca_topic_score_codex":0.000338685,"about_ca_topic_score_gemma":0.0005824771,"teacher_disagreement_score":0.9599273,"about_ca_system_score_codex":0.00018621125,"about_ca_system_score_gemma":0.00031303996,"threshold_uncertainty_score":0.99993515},"labels":[],"label_agreement":null},{"id":"W4383875884","doi":"10.1142/s0219061324500028","title":"Degrees of categoricity and treeable degrees","year":2023,"lang":"en","type":"article","venue":"Journal of Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Mathematics; Corollary; Combinatorics; Pure mathematics; Physics","score_opus":0.04522237817459328,"score_gpt":0.2756657799506974,"score_spread":0.23044340177610412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383875884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34600616,0.0003925429,0.64930546,0.0017026064,0.00027856504,0.0001630673,0.0000017803516,0.00010543498,0.0020444111],"genre_scores_gemma":[0.78412724,0.000054946075,0.21556766,0.000036570793,0.0000851096,0.000002004224,1.8482837e-7,0.000008012352,0.000118269236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814516,0.00011833339,0.00072407967,0.00019324009,0.0005428899,0.00027631343],"domain_scores_gemma":[0.9978274,0.0010542222,0.00037946433,0.00033750432,0.00024225455,0.00015911579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016235483,0.00014899422,0.00052834034,0.0002156755,0.00005844715,0.00007532259,0.0008134798,0.000078700294,0.00004160429],"category_scores_gemma":[0.00075556803,0.000099135796,0.0001510239,0.0006172329,0.00013970991,0.00029782695,0.0004327234,0.00021286105,0.000037365447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054295026,0.0015912539,0.0055942093,0.0010505453,0.00022420786,0.00058986875,0.0033293418,0.008264795,0.0030762076,0.89552844,0.003555211,0.07714161],"study_design_scores_gemma":[0.00041570023,0.00058400555,0.01813137,0.000068225825,0.000028062565,0.000503054,0.00012176115,0.2818123,0.00046771637,0.6976049,0.00009254696,0.00017036374],"about_ca_topic_score_codex":0.000004853928,"about_ca_topic_score_gemma":0.0000024328274,"teacher_disagreement_score":0.43812108,"about_ca_system_score_codex":0.000034733315,"about_ca_system_score_gemma":0.00006526725,"threshold_uncertainty_score":0.40426406},"labels":[],"label_agreement":null},{"id":"W4385224119","doi":"10.1002/malq.202200059","title":"Avoiding Medvedev reductions inside a linear order","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Mathematics; Lift (data mining); Order (exchange); Interval (graph theory); Construct (python library); Discrete mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.04155128374394942,"score_gpt":0.290644978695253,"score_spread":0.2490936949513036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385224119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03067426,0.0000275447,0.9532799,0.0061265165,0.000625744,0.0003990486,0.0000031468637,0.0020307994,0.006833015],"genre_scores_gemma":[0.60512066,0.000004571812,0.39259076,0.00043476612,0.0003843064,0.0001425024,0.000008342062,0.000037447247,0.0012766477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971189,0.00031171707,0.0006083733,0.0007329657,0.00055504334,0.0006730389],"domain_scores_gemma":[0.99736804,0.0010706715,0.00010458045,0.0010400148,0.00018345304,0.00023323281],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014543897,0.0002846818,0.00041742634,0.0002442108,0.0004243123,0.00024152221,0.0010999901,0.00014017666,0.00017845708],"category_scores_gemma":[0.00078715157,0.00023291555,0.00016050621,0.0019103466,0.00015618629,0.00038630504,0.000277637,0.0004915294,0.004098755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049410337,0.00055620365,0.000019960915,0.00015865926,0.000058993035,0.00021398466,0.010977549,0.0004927929,0.0009808941,0.91149217,0.0030206582,0.07202319],"study_design_scores_gemma":[0.00018105374,0.00027326183,0.00018909521,0.00003192452,0.000009561374,0.00015187463,0.00058007636,0.30776188,0.0000990122,0.6897785,0.0006710491,0.00027270502],"about_ca_topic_score_codex":0.000008761089,"about_ca_topic_score_gemma":0.0000034237428,"teacher_disagreement_score":0.5744464,"about_ca_system_score_codex":0.00007459452,"about_ca_system_score_gemma":0.000081703714,"threshold_uncertainty_score":0.9966767},"labels":[],"label_agreement":null},{"id":"W4385444120","doi":"10.1007/978-3-031-24117-8_30","title":"Structure in Machine Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing","score_opus":0.025862112458300404,"score_gpt":0.27976023040982906,"score_spread":0.25389811795152867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385444120","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063417734,0.0009357635,0.9011403,0.007537748,0.0027640571,0.001630582,0.0013708452,0.0021668796,0.082390435],"genre_scores_gemma":[0.36325777,0.00040275126,0.04113862,0.0014640287,0.0016066324,0.00014970888,0.0011460057,0.00035618694,0.5904783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965464,0.00011827934,0.00068673794,0.0012323739,0.0006046541,0.0008115457],"domain_scores_gemma":[0.9975851,0.0005880875,0.0002528468,0.000977725,0.00033254098,0.0002636996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086304115,0.00059131207,0.00083203265,0.0009455767,0.00036064157,0.00034808487,0.0014203452,0.00053429184,0.00020481402],"category_scores_gemma":[0.00088618015,0.00056905346,0.00024893295,0.00062224735,0.00008449114,0.00018784555,0.0013712437,0.0014632967,0.0005082139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008612454,0.000018244738,0.00024633412,0.000023161663,0.000042980442,0.00023415507,0.00020588435,0.004990309,0.000050930557,0.98761225,0.0006157707,0.0059513934],"study_design_scores_gemma":[0.0008771774,0.0003354938,0.0007048777,0.0003198971,0.00004335489,0.00007150984,0.000012229716,0.05034834,0.000035191897,0.8486156,0.097309396,0.0013269435],"about_ca_topic_score_codex":0.00004896473,"about_ca_topic_score_gemma":0.00034848516,"teacher_disagreement_score":0.8600016,"about_ca_system_score_codex":0.0014484205,"about_ca_system_score_gemma":0.00020449364,"threshold_uncertainty_score":0.9996761},"labels":[],"label_agreement":null},{"id":"W4386093834","doi":"10.1007/978-3-031-41724-5","title":"Computer Algebra in Scientific Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Universität Kassel; Gebze Teknik Üniversitesi; China Aerospace Science and Technology Corporation; Universidad de Buenos Aires; Universidad de La Habana; Isfahan University of Technology; King Abdullah University of Science and Technology; Jiangsu University; Université de Lille; University of Stirling; Wilfrid Laurier University","keywords":"Symbolic computation; Computer science; Algebra over a field; Focus (optics); Computation; Theoretical computer science; Programming language; Mathematics; Pure mathematics","score_opus":0.021234845241806508,"score_gpt":0.2602723338933104,"score_spread":0.23903748865150387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093834","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00147327,0.0003433387,0.97905445,0.0009470118,0.015164546,0.0011830528,0.000010920255,0.001157871,0.0006655481],"genre_scores_gemma":[0.06390085,0.000019288573,0.92917186,0.0018635921,0.0029181277,0.000037606766,0.000056644745,0.00018848448,0.001843522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9865605,0.00037216346,0.0018020148,0.005658597,0.0029592442,0.0026474567],"domain_scores_gemma":[0.99142396,0.0027406313,0.00063639786,0.004094894,0.00061868713,0.0004854227],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.0060901847,0.001331425,0.0016024183,0.004461628,0.0007782317,0.003673761,0.01178862,0.0007490047,0.00001790478],"category_scores_gemma":[0.00035195192,0.0013384438,0.00038658173,0.009527972,0.002433345,0.0013315784,0.010306208,0.0025611368,0.00045025928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000490003,0.00019009707,0.0006212873,0.00016253103,0.000016351414,0.0007094705,0.0022677872,0.21949196,0.00004107358,0.0032060116,0.0007288097,0.7725597],"study_design_scores_gemma":[0.000528825,0.00018655726,0.0025398307,0.00067031244,0.0000060998245,0.000102077014,4.4898513e-7,0.8581975,0.00014350102,0.13550328,0.0008591017,0.001262454],"about_ca_topic_score_codex":0.000084656065,"about_ca_topic_score_gemma":0.00055016926,"teacher_disagreement_score":0.7712973,"about_ca_system_score_codex":0.0021967278,"about_ca_system_score_gemma":0.0035853272,"threshold_uncertainty_score":0.9999437},"labels":[],"label_agreement":null},{"id":"W4386245491","doi":"10.5802/alco.292","title":"Arkhipov’s theorem, graph minors, and linear system nonlocal games","year":2023,"lang":"en","type":"article","venue":"Algebraic Combinatorics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Robertson–Seymour theorem; Undecidable problem; Graph minor; Discrete mathematics; Combinatorics; Cubic graph; Graph; Voltage graph; Line graph; 1-planar graph","score_opus":0.011329482414401394,"score_gpt":0.223211001051276,"score_spread":0.2118815186368746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386245491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66753656,0.0018726137,0.30726692,0.0030441831,0.00842512,0.0012760713,0.000019158531,0.0059184027,0.0046409788],"genre_scores_gemma":[0.9958117,0.000065740336,0.0034204847,0.00013856514,0.00013803618,0.000040897925,0.000009768305,0.000035108143,0.00033969356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685264,0.00024100006,0.0004959926,0.0009894057,0.00068637903,0.0007345989],"domain_scores_gemma":[0.99728835,0.0007684791,0.00014547534,0.0012809037,0.0001969348,0.00031985677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011180452,0.0003837906,0.00047747028,0.00039025187,0.00029957702,0.00024803684,0.0014332505,0.00018689668,0.0000071373684],"category_scores_gemma":[0.0001791383,0.0003594866,0.00015733739,0.0026218512,0.00021338458,0.00035580964,0.001422894,0.00035445535,0.00020808166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048809434,0.0001221961,0.0027221956,0.00014758414,0.000042296306,0.0001379251,0.0006654571,0.00004195912,0.000027095928,0.9617598,0.0017246722,0.032603923],"study_design_scores_gemma":[0.0014378222,0.00046660207,0.017673183,0.000095504736,0.000041965897,0.00023583253,0.0003905111,0.4913319,0.00066233403,0.48113155,0.0054844995,0.0010482598],"about_ca_topic_score_codex":0.000053690987,"about_ca_topic_score_gemma":0.0000061570786,"teacher_disagreement_score":0.49128997,"about_ca_system_score_codex":0.00013572186,"about_ca_system_score_gemma":0.000113546295,"threshold_uncertainty_score":0.99988574},"labels":[],"label_agreement":null},{"id":"W4386879920","doi":"10.1007/978-3-031-43587-4_21","title":"Cordial Forests","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.025610925871880984,"score_gpt":0.2579276593432336,"score_spread":0.2323167334713526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386879920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009854211,0.00015915564,0.985028,0.0011538219,0.0078005185,0.00063948974,0.000009572189,0.0009136025,0.0041972813],"genre_scores_gemma":[0.12420021,0.00007222639,0.8662532,0.0025546143,0.0035688414,0.000051949097,0.000021419759,0.00020730819,0.0030702457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99317455,0.00006232595,0.0008082506,0.0028510555,0.0018434555,0.0012603574],"domain_scores_gemma":[0.9948088,0.0013125505,0.00033930384,0.0028010786,0.00038878145,0.00034950476],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015731573,0.0008372424,0.0008645357,0.0013176682,0.00035682516,0.00094691163,0.0071122493,0.0005145246,0.000032624903],"category_scores_gemma":[0.00028613946,0.0007917943,0.00029770585,0.0015211245,0.0011264622,0.00070238125,0.0051743644,0.0012710466,0.00047445635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053293234,0.00003994272,0.00022894247,0.000043472643,0.000014955137,0.00041836835,0.00040562617,0.03404765,0.000019447958,0.040457707,0.000109870154,0.9242087],"study_design_scores_gemma":[0.00023718597,0.00021018503,0.0012470451,0.00015738029,0.0000061132105,0.000082248895,5.8043415e-8,0.5246454,0.0001352974,0.47137514,0.0011204052,0.00078352285],"about_ca_topic_score_codex":0.00005991755,"about_ca_topic_score_gemma":0.00057492784,"teacher_disagreement_score":0.92342514,"about_ca_system_score_codex":0.0005342109,"about_ca_system_score_gemma":0.0009787775,"threshold_uncertainty_score":0.9994533},"labels":[],"label_agreement":null},{"id":"W4387435566","doi":"10.1142/13663","title":"A Tale of Discrete Mathematics","year":2023,"lang":"en","type":"book","venue":"WORLD SCIENTIFIC eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Mathematics education; Computer science","score_opus":0.029866013535389885,"score_gpt":0.25610888023438233,"score_spread":0.22624286669899243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387435566","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055519922,0.00012179429,0.082095206,0.00012530596,0.006195878,0.00088350393,0.000095049414,0.00082035735,0.9096074],"genre_scores_gemma":[0.00026627668,3.1779388e-7,0.043571576,0.000026631378,0.00017361675,0.000034540146,0.000029877965,0.0000625295,0.9558346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952646,0.00008298232,0.0010001118,0.001465262,0.0015315434,0.00065553846],"domain_scores_gemma":[0.9949445,0.0005261576,0.0006445673,0.003324686,0.00033932945,0.00022074247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018567833,0.0004982495,0.00085255696,0.0010981187,0.00030943356,0.00068305706,0.0037564053,0.00018447568,0.00006324254],"category_scores_gemma":[0.000060452065,0.00046364844,0.00046760865,0.00069049036,0.0009999837,0.00013859455,0.0024912234,0.00051692437,0.00067524775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044700487,0.00017834619,0.000010578267,0.0013460248,0.00017054852,0.00015317556,0.006006794,0.00012257503,0.0005182422,0.57807034,0.3849674,0.028451525],"study_design_scores_gemma":[0.0002752084,0.000071478826,0.000022249735,0.00069619354,0.00005895216,0.000019828087,0.000023283006,0.03322676,0.00077612925,0.53593874,0.4279699,0.00092125835],"about_ca_topic_score_codex":0.000004081258,"about_ca_topic_score_gemma":0.00060756196,"teacher_disagreement_score":0.046227247,"about_ca_system_score_codex":0.00022999872,"about_ca_system_score_gemma":0.0008832304,"threshold_uncertainty_score":0.99978155},"labels":[],"label_agreement":null},{"id":"W4387501283","doi":"10.1017/jsl.2023.71","title":"UNDEFINABILITY OF MULTIPLICATION IN PRESBURGER ARITHMETIC WITH SETS OF POWERS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Presburger arithmetic; Arithmetic; Multiplication (music); Mathematics; Computer science; Algebra over a field; Discrete mathematics; Pure mathematics; Combinatorics; Decidability","score_opus":0.02421695461103939,"score_gpt":0.27699702313529884,"score_spread":0.25278006852425944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387501283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95159787,0.00017100413,0.046157815,0.0012925966,0.00020364461,0.00026085394,0.0000023854673,0.00003693891,0.00027690153],"genre_scores_gemma":[0.978495,0.00003283697,0.02138794,0.000037993555,0.000022808528,0.00000445035,5.6104454e-7,0.0000067747214,0.000011621288],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99781364,0.00019430618,0.0008902521,0.00026928473,0.0005734319,0.00025908777],"domain_scores_gemma":[0.99763554,0.00048199116,0.00073095626,0.00058577093,0.00047645433,0.00008929462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017193031,0.00014642016,0.00052092306,0.00048701357,0.00002367951,0.000022167877,0.00087045296,0.000082490835,0.00000860375],"category_scores_gemma":[0.0003632526,0.000105755134,0.0001373906,0.0016275735,0.00016750608,0.00029526203,0.00022612042,0.00024406951,0.0000043032705],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038904653,0.004234944,0.71124107,0.0010106647,0.00033613702,0.00029607746,0.013078968,0.08991531,0.011812454,0.03690401,0.0007353684,0.13004592],"study_design_scores_gemma":[0.00091211643,0.0006808971,0.90136415,0.00009831485,0.000018593877,0.00010756473,0.00015255416,0.03467555,0.0015461921,0.0602226,0.000059584443,0.00016187089],"about_ca_topic_score_codex":0.00005485197,"about_ca_topic_score_gemma":0.000010344475,"teacher_disagreement_score":0.19012308,"about_ca_system_score_codex":0.00012032722,"about_ca_system_score_gemma":0.0002343293,"threshold_uncertainty_score":0.43125692},"labels":[],"label_agreement":null},{"id":"W4387884816","doi":"10.7169/facm/2108","title":"Additive properties of the evil and odious numbers and similar sequences","year":2023,"lang":"en","type":"article","venue":"Functiones et Approximatio Commentarii Mathematici","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","score_opus":0.03569670698700751,"score_gpt":0.23925305521993462,"score_spread":0.20355634823292712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387884816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8107791,0.00040507418,0.14853545,0.03329235,0.00096975017,0.00241361,0.000044303164,0.00078059855,0.0027797655],"genre_scores_gemma":[0.9640468,0.00005956039,0.03436659,0.0009970379,0.000040203813,0.00019981619,0.0000088654315,0.00001996333,0.0002611612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984308,0.00019733518,0.00039171704,0.00035963685,0.00039676504,0.00022378295],"domain_scores_gemma":[0.9986786,0.00041124222,0.00021928128,0.0005290937,0.00010523863,0.000056502246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072133244,0.00020585212,0.0002969461,0.00009578629,0.00027465457,0.00016354104,0.00046467863,0.000051428284,0.000020055484],"category_scores_gemma":[0.00016217564,0.00013565457,0.000062622705,0.0005512914,0.00029237577,0.00048712187,0.00081702217,0.00014314857,0.00001274991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011793701,0.0019684026,0.013753786,0.0068250983,0.0012312821,0.000022789889,0.2392541,0.0023873718,0.008257627,0.57462347,0.04293118,0.10862698],"study_design_scores_gemma":[0.0016700607,0.00043020066,0.012821757,0.00078534236,0.00015002082,0.00023719225,0.010289686,0.610872,0.012645669,0.34553713,0.0035426165,0.0010183208],"about_ca_topic_score_codex":0.000121392055,"about_ca_topic_score_gemma":0.00006823653,"teacher_disagreement_score":0.6084846,"about_ca_system_score_codex":0.000048997197,"about_ca_system_score_gemma":0.000050486695,"threshold_uncertainty_score":0.5531833},"labels":[],"label_agreement":null},{"id":"W4387975997","doi":"10.3233/com-210349","title":"Enumerations of families closed under finite differences","year":2023,"lang":"en","type":"article","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Enumeration; Degree (music); Set (abstract data type); Finite set; Discrete mathematics; Family of sets; Combinatorics; Computer science","score_opus":0.04640201935667268,"score_gpt":0.272476377633765,"score_spread":0.2260743582770923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387975997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48512697,0.000048477545,0.51179034,0.0008788481,0.00068206125,0.00027873807,0.000016013937,0.00065853435,0.0005200337],"genre_scores_gemma":[0.97889096,0.000013746369,0.020824974,0.00009524534,0.00007686325,0.000024884988,0.000012029425,0.000010220689,0.00005105046],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9972005,0.00035491234,0.00064832915,0.00081656454,0.0005281402,0.00045154977],"domain_scores_gemma":[0.99597895,0.0020082581,0.000158533,0.0014119846,0.00030313813,0.00013916042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087836006,0.00026057745,0.0004817844,0.00024261721,0.00022472454,0.00013127658,0.0014369509,0.000108192085,0.0000443077],"category_scores_gemma":[0.0003669817,0.00023695565,0.00020538928,0.0019031567,0.00036282185,0.00034165755,0.0010865143,0.00021958552,0.00012651984],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039249244,0.0023229832,0.30037037,0.0005581164,0.00023132522,0.00002734705,0.010216273,0.1313109,0.0021284819,0.18128286,0.0017891787,0.36972293],"study_design_scores_gemma":[0.00022153674,0.0000963146,0.4622932,0.000010180881,0.0000057211228,0.0000018825264,0.00008477146,0.4456547,0.00036896463,0.09084627,0.00020794786,0.00020853415],"about_ca_topic_score_codex":0.000101481295,"about_ca_topic_score_gemma":0.000050803486,"teacher_disagreement_score":0.493764,"about_ca_system_score_codex":0.00007292904,"about_ca_system_score_gemma":0.00018559449,"threshold_uncertainty_score":0.96627706},"labels":[],"label_agreement":null},{"id":"W4388304630","doi":"10.5206/mt.v3i3.15953","title":"How Many Dice Rolls Would It Take to Hit Your Favorite Kind of Number?","year":2023,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dice; Prime (order theory); Computation; Power (physics); Mathematical economics; Computer science; Mathematics; Arithmetic; Calculus (dental); Algorithm; Statistics; Combinatorics","score_opus":0.044232033769320174,"score_gpt":0.28332058024064016,"score_spread":0.23908854647132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388304630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021841705,0.000017272047,0.9469836,0.027529087,0.0010875146,0.00042619536,0.00008833568,0.0005885885,0.0014377518],"genre_scores_gemma":[0.95059675,0.000015237639,0.040458925,0.00040047077,0.00012479466,0.00007762747,0.0000068780296,0.000028414957,0.008290879],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977382,0.00009402899,0.0003715583,0.00067122414,0.0005769119,0.00054806675],"domain_scores_gemma":[0.998268,0.00020632379,0.0000869608,0.0010249526,0.00016340119,0.00025036524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003950937,0.00024362837,0.00035219442,0.00027219212,0.00023487737,0.0002383435,0.0011558699,0.00017764751,0.00019295525],"category_scores_gemma":[0.000036638954,0.0002562513,0.00023556394,0.0023138928,0.000065366396,0.00045434412,0.00009514649,0.00042670334,0.00045073612],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000723161,0.001666072,0.003063597,0.00042485725,0.0004574429,0.00020431863,0.023061622,0.049033087,0.01165298,0.010520625,0.016875714,0.88296735],"study_design_scores_gemma":[0.003397514,0.0009009855,0.10474007,0.00017827019,0.00022486153,0.00020713905,0.0029809843,0.3751848,0.020737283,0.021983163,0.46666607,0.002798847],"about_ca_topic_score_codex":0.00026905065,"about_ca_topic_score_gemma":0.0002604845,"teacher_disagreement_score":0.92875504,"about_ca_system_score_codex":0.00009592112,"about_ca_system_score_gemma":0.00008510458,"threshold_uncertainty_score":0.999989},"labels":[],"label_agreement":null},{"id":"W4388325824","doi":"10.1093/oso/9780198507352.003.0003","title":"On the shoulders of computers","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dream; Statue; Mythology; Exaggeration; Legend; Computer science; Hebrew; Cheating; Art; Art history; Literature; Visual arts; Psychology; Psychoanalysis","score_opus":0.03426928173965792,"score_gpt":0.2298799974842963,"score_spread":0.1956107157446384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388325824","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073451547,0.000067236746,0.41661328,0.0025036142,0.00093421293,0.00034146698,0.0000034479237,0.00013625469,0.57939315],"genre_scores_gemma":[0.010227928,0.00012616006,0.22860914,0.026870025,0.0004424459,0.000033260974,0.000014611477,0.00020386296,0.7334726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977076,0.000068460526,0.00047762465,0.00075111847,0.00069696933,0.0002981947],"domain_scores_gemma":[0.9965244,0.0010446266,0.00025665257,0.0019194074,0.0001583894,0.00009653524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047898726,0.00042829584,0.0004896524,0.00016690641,0.00009036345,0.000097771255,0.002318937,0.00024342326,0.00043579374],"category_scores_gemma":[0.000039545706,0.00028067408,0.00033289587,0.000095229145,0.00025754332,0.00008357222,0.0006082447,0.00047925327,0.00014033697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014762198,0.000027224434,0.0000012294547,0.000013071887,0.0000439002,0.000007801642,0.000071925315,0.0002646228,0.0000012879924,0.95653474,0.025878197,0.017154507],"study_design_scores_gemma":[0.00028232852,0.00042006598,0.000028877037,0.00012068069,0.000026182572,0.000029628178,0.000007765974,0.036115404,0.00014996754,0.8054212,0.15662657,0.0007713363],"about_ca_topic_score_codex":0.000013308728,"about_ca_topic_score_gemma":0.0000067382302,"teacher_disagreement_score":0.18800414,"about_ca_system_score_codex":0.00009414642,"about_ca_system_score_gemma":0.000093463415,"threshold_uncertainty_score":0.99996454},"labels":[],"label_agreement":null},{"id":"W4388470572","doi":"10.1145/3632245.3632247","title":"ACM Turing Award Lecture at SC22","year":2022,"lang":"en","type":"article","venue":"ACM SIGHPC Connect","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Turing; Presentation (obstetrics); Computer science; Quarter (Canadian coin); Multimedia; World Wide Web; Visual arts; Art; History; Programming language","score_opus":0.02470121424730209,"score_gpt":0.24800976243317543,"score_spread":0.22330854818587334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388470572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80420655,0.0024028802,0.13793445,0.036797892,0.00843755,0.0017246786,0.00018099342,0.0035864664,0.0047285226],"genre_scores_gemma":[0.9597597,0.0000060751318,0.037425257,0.0017169395,0.00030718005,0.00014610683,0.000028289165,0.00003546716,0.0005749831],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966644,0.00037297208,0.00036176003,0.0011385588,0.00075837097,0.0007039293],"domain_scores_gemma":[0.9937097,0.0020635892,0.00014853745,0.0038010972,0.00008922931,0.0001878523],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006893805,0.00033097944,0.00037662114,0.00018418221,0.0008995697,0.00019573567,0.0062887343,0.000077196826,0.0028639063],"category_scores_gemma":[0.0018965253,0.00032852453,0.00022802253,0.00092024397,0.00007104428,0.00028070758,0.016539646,0.0005450806,0.00023187493],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020750299,0.0012407403,0.021676883,0.00022702203,0.0005121861,0.0018590653,0.014610646,0.04607479,0.0176371,0.02306655,0.22953266,0.64335483],"study_design_scores_gemma":[0.0025856753,0.0015646343,0.030465,0.000034928697,0.000057087465,0.0011529684,0.00017993154,0.108948655,0.014592477,0.1651611,0.672484,0.0027735329],"about_ca_topic_score_codex":0.00009106887,"about_ca_topic_score_gemma":0.000058984424,"teacher_disagreement_score":0.6405813,"about_ca_system_score_codex":0.00055932364,"about_ca_system_score_gemma":0.0001601877,"threshold_uncertainty_score":0.9999167},"labels":[],"label_agreement":null},{"id":"W4388779834","doi":"10.1515/9781552384039-019","title":"Coding Theory","year":2006,"lang":"en","type":"book-chapter","venue":"University of Calgary Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University; University of Alberta","funders":"","keywords":"Computer science","score_opus":0.02048717094852226,"score_gpt":0.1839095386237982,"score_spread":0.16342236767527593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388779834","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000040170994,0.00014873987,0.38817692,0.0000061760065,0.00018312619,0.00019496304,0.000009580855,0.000168275,0.6111082],"genre_scores_gemma":[0.0004280508,0.000024577601,0.026716199,0.000044701497,0.00007935321,1.9272285e-7,0.0000120422055,0.000026952448,0.97266793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982311,0.00008633456,0.00025068712,0.0006857635,0.00046161018,0.00028446876],"domain_scores_gemma":[0.9980394,0.0002574551,0.000308885,0.001087619,0.00018513898,0.00012147541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030205035,0.0003434739,0.0005039256,0.00019070054,0.00016305654,0.000045736462,0.0019597972,0.00034570057,0.000062060055],"category_scores_gemma":[0.000007729167,0.00041430493,0.00031397218,0.000011576058,0.00040796452,0.0001388257,0.001602672,0.0004240544,0.000017390234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001826602,0.000016482443,0.0000015474677,0.000060602706,0.000059118363,0.00014412889,0.0002410204,0.000032286724,0.000012889672,0.94292456,0.0009839522,0.05550513],"study_design_scores_gemma":[0.00069264666,0.00014331534,0.00006058989,0.000208422,0.00012848321,0.000030445308,0.00000780396,0.014536946,0.00022683645,0.17327456,0.8098375,0.0008524385],"about_ca_topic_score_codex":0.00037198912,"about_ca_topic_score_gemma":0.00005015769,"teacher_disagreement_score":0.80885357,"about_ca_system_score_codex":0.00012086167,"about_ca_system_score_gemma":0.00012711235,"threshold_uncertainty_score":0.9998309},"labels":[],"label_agreement":null},{"id":"W4388824487","doi":"10.1038/s41562-023-01710-w","title":"The Turing test is not a good benchmark for thought in LLMs","year":2023,"lang":"en","type":"letter","venue":"Nature Human Behaviour","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"","keywords":"Test (biology); Turing test; Benchmark (surveying); Psychology; Computer science; Artificial intelligence; Biology; Geography; Ecology","score_opus":0.02567321357612041,"score_gpt":0.29978147186970583,"score_spread":0.2741082582935854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388824487","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007204644,0.0016927165,0.0032276958,0.96530366,0.013286323,0.005285988,0.00061776617,0.0018820179,0.0014992177],"genre_scores_gemma":[0.08991196,0.00009032877,0.04252754,0.7714416,0.031760592,0.0029867743,0.0010783563,0.00084643625,0.05935642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947163,0.00015232949,0.00081565435,0.0018302622,0.0011818128,0.001303675],"domain_scores_gemma":[0.99469405,0.0020674765,0.00038969476,0.0024574916,0.00029224463,0.00009905664],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0012458604,0.00076935085,0.0007153061,0.00043249186,0.0007365234,0.0009609442,0.0051881904,0.002441983,0.000020310066],"category_scores_gemma":[0.00027775185,0.00060158223,0.0005364433,0.0009425288,0.00014526055,0.00026612045,0.0015256946,0.0076314323,0.00005016143],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035800422,0.00012153802,0.0037585928,0.00011329051,0.000027720165,0.00047225715,0.00052702404,0.000005640124,0.000029818786,0.0014516755,0.9884936,0.0049952636],"study_design_scores_gemma":[0.0012517164,0.0003933498,0.0866088,0.00031563264,0.000103068574,0.00008398651,0.000027625982,0.0022619765,0.00048194677,0.01565862,0.8909265,0.0018868194],"about_ca_topic_score_codex":0.000095064766,"about_ca_topic_score_gemma":0.00043837458,"teacher_disagreement_score":0.19386204,"about_ca_system_score_codex":0.00042641858,"about_ca_system_score_gemma":0.00017679992,"threshold_uncertainty_score":0.99964356},"labels":[],"label_agreement":null},{"id":"W4389790696","doi":"10.2140/pjm.2023.326.17","title":"Some arithmetical properties of convergents to algebraic numbers","year":2023,"lang":"en","type":"article","venue":"Pacific Journal of Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Arithmetic function; Mathematics; Algebraic number; Arithmetic; Algebra over a field; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.0397527253650985,"score_gpt":0.2580389829528948,"score_spread":0.2182862575877963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389790696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6107197,0.00029763838,0.38303524,0.0028292337,0.00203926,0.00038789684,0.0000044387607,0.00014735838,0.00053923356],"genre_scores_gemma":[0.8645644,0.00004107396,0.13499379,0.00004796072,0.00014573388,0.000003633404,2.0420468e-7,0.000016672417,0.00018650417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976045,0.00008888475,0.00092554657,0.0001930634,0.00085840654,0.00032961371],"domain_scores_gemma":[0.9982636,0.00024832747,0.00037831557,0.00050809025,0.0003750698,0.00022662886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015014939,0.00016811011,0.0004960943,0.0003196404,0.00005196256,0.000083167506,0.001120942,0.000061964936,0.000019093213],"category_scores_gemma":[0.00059048174,0.0001267649,0.00018939533,0.0007829451,0.00010281601,0.0003011278,0.00039948232,0.00020217145,0.00018476171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016789044,0.0092435,0.00828424,0.006420083,0.0019201001,0.001107755,0.18447328,0.010575811,0.06666077,0.58927834,0.042730812,0.07913742],"study_design_scores_gemma":[0.002002883,0.0015906804,0.0023632615,0.0012640351,0.00013769238,0.0012832184,0.009117035,0.3485654,0.05299387,0.5775743,0.0019279026,0.0011796871],"about_ca_topic_score_codex":0.0000020896027,"about_ca_topic_score_gemma":4.0522264e-7,"teacher_disagreement_score":0.3379896,"about_ca_system_score_codex":0.000060349783,"about_ca_system_score_gemma":0.00012854252,"threshold_uncertainty_score":0.5169323},"labels":[],"label_agreement":null},{"id":"W4389986571","doi":"10.1137/1.9781611977806.ch23","title":"Chapter 23: Lipschitz Continuity and Smoothness","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Smoothness; Lipschitz continuity; Mathematics; Calculus (dental); Applied mathematics; Computer science; Pure mathematics; Mathematical analysis; Medicine; Orthodontics","score_opus":0.07451822648134829,"score_gpt":0.245163545459863,"score_spread":0.1706453189785147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389986571","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017794943,0.00027159447,0.265511,0.00093275274,0.0028082812,0.009811721,0.0005591619,0.002105059,0.7162209],"genre_scores_gemma":[0.006119082,0.00018095247,0.3531283,0.0008532853,0.0047939303,0.00082069467,0.00011395015,0.0005972034,0.6333926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973721,0.0000059494278,0.0007055252,0.0009818,0.00044982388,0.00048482855],"domain_scores_gemma":[0.99781984,0.00067829626,0.0004544896,0.0007120459,0.000110198984,0.00022510737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009104394,0.0006428204,0.0009820054,0.00006938686,0.00036902365,0.000376979,0.0006698966,0.0009684913,0.0000074129175],"category_scores_gemma":[0.000032236498,0.0005834664,0.00049713976,0.00003407785,0.00043217375,0.00005833375,0.0012067641,0.0007331098,0.00001796173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007738519,0.00001857817,3.890057e-7,0.0002345909,0.00015672977,0.0000013930063,0.0014706864,8.1907143e-7,0.00003549875,0.9240389,0.00068115816,0.073353544],"study_design_scores_gemma":[0.0016784853,0.00012724323,0.000001589543,0.0001937075,0.00016814462,0.000014932919,0.00012540375,0.0030078336,0.00018807016,0.95435184,0.03926675,0.0008759722],"about_ca_topic_score_codex":0.0000033523972,"about_ca_topic_score_gemma":0.0000054439106,"teacher_disagreement_score":0.08761733,"about_ca_system_score_codex":0.000049784117,"about_ca_system_score_gemma":0.00010121322,"threshold_uncertainty_score":0.9996617},"labels":[],"label_agreement":null},{"id":"W4390538544","doi":"10.1007/978-3-031-30488-0_5","title":"Induction","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematical induction; Axiom; Mathematics; Inductive method; Axiomatic system; Inductive reasoning; Set theory; Algebra over a field; Order (exchange); Computation; Set (abstract data type); Discrete mathematics; Calculus (dental); Algorithm; Computer science; Pure mathematics","score_opus":0.02300940942308594,"score_gpt":0.24280338523433986,"score_spread":0.21979397581125393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390538544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000054664197,0.00066809746,0.8318342,0.00039298943,0.0007357493,0.000316855,0.00025054024,0.00025083867,0.16554528],"genre_scores_gemma":[0.00087635126,0.00045403064,0.9065763,0.00019008032,0.0003974615,0.000033741515,0.000017062523,0.00013550423,0.091319494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794114,0.000018701076,0.000487195,0.0007234201,0.0005590713,0.00027045442],"domain_scores_gemma":[0.9970873,0.0016233483,0.00021520058,0.000834401,0.00011354274,0.00012623402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031865333,0.0005083148,0.00058539683,0.000273116,0.00013836274,0.00046472176,0.0005475568,0.0003242587,0.00013346803],"category_scores_gemma":[0.00029656052,0.00041614426,0.000109451474,0.000059833357,0.00013300226,0.000051339593,0.00031808845,0.0005507024,0.00022748283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001367972,0.00002858046,7.2138626e-8,0.00038013744,0.00007617628,0.000042241572,0.00025941592,0.000025519414,0.000005982893,0.87244487,0.0029306663,0.123804994],"study_design_scores_gemma":[0.000033038305,0.00010607795,0.0000035846724,0.00030088675,0.000098123666,0.000056553854,0.00000508455,0.046885543,0.00007498316,0.92720354,0.02480711,0.00042545164],"about_ca_topic_score_codex":0.0000033933898,"about_ca_topic_score_gemma":0.000010279127,"teacher_disagreement_score":0.12337954,"about_ca_system_score_codex":0.00010005573,"about_ca_system_score_gemma":0.00007720061,"threshold_uncertainty_score":0.99982905},"labels":[],"label_agreement":null},{"id":"W4390545116","doi":"10.1007/978-3-031-49226-6_4","title":"Shaw and Artificial Intelligence","year":2024,"lang":"en","type":"book-chapter","venue":"Bernard Shaw and his contemporaries","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Turing; Artificial intelligence; Computer science; Oracle; Cognitive science; Psychology; Programming language","score_opus":0.04757467885291719,"score_gpt":0.24561582566646928,"score_spread":0.1980411468135521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390545116","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020382236,0.06155857,0.12291257,0.011761304,0.0041061766,0.0012959536,0.00023757861,0.0012310026,0.796693],"genre_scores_gemma":[0.13034718,0.004187211,0.03318756,0.0013979496,0.0025946691,0.000094861505,0.00009042699,0.00024240301,0.82785773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699503,0.00003060035,0.0007320401,0.0013839108,0.0004831174,0.00037529584],"domain_scores_gemma":[0.99822235,0.0003179558,0.0002222253,0.0008192411,0.00016582091,0.00025238097],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043819792,0.00063006673,0.00078323967,0.0002665482,0.00027750953,0.0013732598,0.0008202928,0.00040070977,0.00010264987],"category_scores_gemma":[0.000048159072,0.0005829826,0.00018442751,0.0000853736,0.0007854014,0.0004428133,0.0015567293,0.0006177844,0.00015333726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001332044,0.0000148542185,0.000035011275,0.00012590564,0.0000736886,0.00017922847,0.0009711131,0.0000013143077,0.0000034923748,0.8906206,0.001549615,0.10641187],"study_design_scores_gemma":[0.00004604594,0.00015022828,0.000021713977,0.0002030419,0.00003508518,0.00007391886,0.00003689127,0.004121011,0.000029151635,0.61693627,0.37782326,0.00052335963],"about_ca_topic_score_codex":0.0001782572,"about_ca_topic_score_gemma":0.00025102845,"teacher_disagreement_score":0.37627366,"about_ca_system_score_codex":0.00006910376,"about_ca_system_score_gemma":0.0002146746,"threshold_uncertainty_score":0.9996634},"labels":[],"label_agreement":null},{"id":"W4390545134","doi":"10.1007/978-3-031-30488-0_1","title":"Some Elementary Informal Set Theory","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Sophistication; Set theory; Set (abstract data type); Elementary theory; Cantor set; Mathematics; Universal set; Section (typography); Elementary mathematics; Calculus (dental); Pure mathematics; Mathematical economics; Computer science; Mathematics education; Sociology; Social science","score_opus":0.017867632848739424,"score_gpt":0.2451820137967482,"score_spread":0.22731438094800877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390545134","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016377599,0.0019745391,0.88691413,0.00034723192,0.00087421853,0.0006542683,0.001670682,0.00035691567,0.107191615],"genre_scores_gemma":[0.00067136216,0.0011336084,0.9167481,0.0011637643,0.00072425196,0.000064775355,0.00009579009,0.00020121415,0.07919713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974423,0.000033615306,0.0007156019,0.00067768514,0.00070878357,0.0004219794],"domain_scores_gemma":[0.9953042,0.0031677266,0.00027803984,0.0009857,0.00009187012,0.00017245676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000687598,0.0006666091,0.00072520075,0.0003097943,0.0001809415,0.0005052858,0.000875521,0.00028650873,0.000244786],"category_scores_gemma":[0.00024617804,0.0005347686,0.00015420145,0.000052079828,0.00019505853,0.0001225719,0.00066112104,0.00061911327,0.00022859813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005236901,0.00002992926,2.1706873e-7,0.0006099245,0.00017332072,0.00007373666,0.0006102791,0.000033491975,0.0000021062601,0.9098364,0.0033112736,0.085314095],"study_design_scores_gemma":[0.00006554205,0.00016046727,0.0000040668374,0.0002988243,0.0001483569,0.00004587827,0.000017667182,0.038297344,0.000070501635,0.9382533,0.022079132,0.0005589359],"about_ca_topic_score_codex":0.000002890717,"about_ca_topic_score_gemma":0.000009290985,"teacher_disagreement_score":0.08475516,"about_ca_system_score_codex":0.000088241184,"about_ca_system_score_gemma":0.00011559939,"threshold_uncertainty_score":0.9997104},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05603875960920384,"score_gpt":0.2778152361688712,"score_spread":0.22177647655966737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390563271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053224247,0.003441111,0.9841722,0.00021008065,0.00196264,0.0006086731,0.000023981718,0.00049382116,0.0037650168],"genre_scores_gemma":[0.8807488,0.000112265465,0.118356586,0.000028942753,0.00016548773,0.000084921645,0.00000244576,0.000025505045,0.00047501436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966437,0.00021860047,0.0008572451,0.00123501,0.00055994594,0.00048547942],"domain_scores_gemma":[0.9952043,0.0030256636,0.0001740752,0.0010133407,0.00042200217,0.00016059774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083999394,0.0003589389,0.00048335243,0.00038914836,0.00022487913,0.0004207605,0.0022470024,0.00014146912,0.00015148382],"category_scores_gemma":[0.0006259433,0.00033641054,0.00022123703,0.0026433438,0.00022459652,0.0005813292,0.0008981656,0.0003697947,0.00023559999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011559353,0.000992388,0.0072889645,0.0012384382,0.0008355861,0.0005520983,0.05421046,0.13484949,0.006230005,0.32288918,0.0018742612,0.46892354],"study_design_scores_gemma":[0.000023792138,0.00022070826,0.0003401504,0.00042231233,0.00001400401,0.000023569688,0.00025188396,0.75955474,0.15813056,0.078083195,0.0025812872,0.00035382126],"about_ca_topic_score_codex":0.0005254548,"about_ca_topic_score_gemma":0.00037192722,"teacher_disagreement_score":0.8754264,"about_ca_system_score_codex":0.00056490256,"about_ca_system_score_gemma":0.00061971194,"threshold_uncertainty_score":0.9999088},"labels":[],"label_agreement":null},{"id":"W4390854746","doi":"","title":"An Extended Prudnikov Finite Sum","year":2023,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.026962206167585035,"score_gpt":0.25833586790642055,"score_spread":0.2313736617388355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390854746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012197929,0.00039335413,0.9598985,0.013322832,0.001337194,0.0008025067,0.00007060585,0.0024444407,0.009532659],"genre_scores_gemma":[0.49794582,0.0003013813,0.49199793,0.00024988735,0.00011857704,0.00022902439,0.00055677624,0.0001224937,0.0084780995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9868621,0.00810911,0.0009254636,0.002305186,0.000992212,0.0008058963],"domain_scores_gemma":[0.9844433,0.003294493,0.0006669511,0.00825169,0.0028733332,0.0004702442],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.009919248,0.00063722965,0.0006682488,0.00046660868,0.0005210717,0.0017321856,0.007522948,0.0004947253,0.00008171106],"category_scores_gemma":[0.0023858915,0.00069842394,0.00038412173,0.0011448651,0.00033040033,0.0005282907,0.0076766904,0.0012357759,0.0002861752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001892527,0.0039573144,0.004199375,0.0005842024,0.00026765428,0.00012417503,0.029162005,0.0044179917,0.0016693522,0.44398826,0.003936156,0.5076746],"study_design_scores_gemma":[0.0005705312,0.0000019875226,0.02110334,0.00084764813,0.000036248166,0.000018598805,0.00007055018,0.8520108,0.0075775175,0.108969435,0.007614229,0.0011791404],"about_ca_topic_score_codex":0.0016122647,"about_ca_topic_score_gemma":0.001782817,"teacher_disagreement_score":0.8475928,"about_ca_system_score_codex":0.0002573637,"about_ca_system_score_gemma":0.000660979,"threshold_uncertainty_score":0.9995467},"labels":[],"label_agreement":null},{"id":"W4391031268","doi":"10.1007/979-8-8688-0083-2_5","title":"Complexity, Simplicity, and True Minimalism","year":2024,"lang":"en","type":"book-chapter","venue":"Design Thinking","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Manitoba Beekeepers' Association","funders":"","keywords":"Minimalism (technical communication); Simplicity; Computer science; Philosophy; Art; Epistemology; Human–computer interaction","score_opus":0.07817039274496672,"score_gpt":0.26320050314306154,"score_spread":0.1850301103980948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391031268","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020099644,0.0024436994,0.788821,0.0015956904,0.0014469115,0.0007558097,0.000022164306,0.0011961008,0.20369855],"genre_scores_gemma":[0.011801254,0.00026803257,0.80565476,0.002818448,0.0019506813,0.00005296979,0.000043370736,0.00035951985,0.17705095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962837,0.00008908564,0.0006297139,0.0015841798,0.0008618818,0.0005514305],"domain_scores_gemma":[0.99736553,0.00073536613,0.00024402457,0.0012956258,0.00014086402,0.00021857076],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001177351,0.00072953035,0.00079536525,0.0004103337,0.00031283023,0.0012517611,0.0021479314,0.0004942653,0.00007954277],"category_scores_gemma":[0.000038125712,0.00071302394,0.00024637647,0.00014184203,0.00031900115,0.00032444583,0.0033871545,0.0009818394,0.0002677487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039167876,0.000015290309,0.0000030781905,0.00012882098,0.00008078452,0.00024805928,0.0012523945,0.000038444126,0.000025446825,0.97383803,0.0014358931,0.022929858],"study_design_scores_gemma":[0.00014504841,0.00014271105,0.00003146382,0.00025455427,0.000056422698,0.00026067602,0.0000039822166,0.053014338,0.000041304338,0.9192167,0.02612763,0.0007051544],"about_ca_topic_score_codex":0.000043301792,"about_ca_topic_score_gemma":0.000016798058,"teacher_disagreement_score":0.0546213,"about_ca_system_score_codex":0.00019443668,"about_ca_system_score_gemma":0.00014104598,"threshold_uncertainty_score":0.999785},"labels":[],"label_agreement":null},{"id":"W4391117032","doi":"10.1609/aaaiss.v2i1.27709","title":"Bridging Generative Networks with the Common Model of Cognition","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Symposium Series","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generative grammar; Bridging (networking); Computer science; Cognition; Shadow (psychology); Generative model; Artificial intelligence; Cognitive science; Field (mathematics); Cognitive model; Artificial neural network; Psychology; Mathematics","score_opus":0.01135116480114124,"score_gpt":0.21104834398200312,"score_spread":0.19969717918086188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391117032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4853184,0.000931189,0.46879292,0.034388416,0.00077165395,0.0012132142,0.000019139678,0.00052811846,0.008036965],"genre_scores_gemma":[0.9878828,0.000033134384,0.01155618,0.0001452849,0.00011485965,0.000034703397,7.761069e-7,0.000016115499,0.00021614366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987458,0.00001923142,0.00027267708,0.00035143932,0.00037717033,0.00023368598],"domain_scores_gemma":[0.9990663,0.00009000032,0.00018440638,0.00025235035,0.00037247027,0.000034469373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043619695,0.00019047364,0.00024068094,0.000057958776,0.00020753415,0.00029023172,0.0011573638,0.00005250396,0.0000014195556],"category_scores_gemma":[0.000015612564,0.000103692175,0.00010338096,0.00064297824,0.00035660862,0.0008992241,0.00071754924,0.00022984622,9.3808677e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022389558,0.00029706905,0.0024288092,0.0012572107,0.00048801207,0.0000035451856,0.0331261,0.26939735,0.2264736,0.44563022,0.005369267,0.015304915],"study_design_scores_gemma":[0.00008772005,0.00014914195,0.00017362983,0.0001585214,0.00004820155,0.000035628567,0.00012653758,0.91538525,0.073920265,0.009720548,0.000055626853,0.00013896202],"about_ca_topic_score_codex":0.00001718865,"about_ca_topic_score_gemma":0.0000081772205,"teacher_disagreement_score":0.64598787,"about_ca_system_score_codex":0.000037100497,"about_ca_system_score_gemma":0.00006451914,"threshold_uncertainty_score":0.4228444},"labels":[],"label_agreement":null},{"id":"W4391183286","doi":"10.1090/mawrld/031/05","title":"Real and complex numbers","year":2023,"lang":"en","type":"book-chapter","venue":"Mathematical world","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.06214211923049934,"score_gpt":0.27584507806562636,"score_spread":0.21370295883512702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391183286","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012109267,0.000023961633,0.06625572,0.0015597747,0.0004023413,0.00041776075,0.00001103543,0.0009048487,0.9304125],"genre_scores_gemma":[0.0004338357,0.00002529763,0.13506342,0.00022018337,0.00024975854,0.000020273408,0.000012531875,0.00008900125,0.8638857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747074,0.000032422522,0.0005822863,0.00085950363,0.0006273064,0.00042777142],"domain_scores_gemma":[0.9973294,0.0010102824,0.000159953,0.001158061,0.00007598237,0.00026629103],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000463762,0.0004504683,0.0007449959,0.00023894833,0.00012015598,0.00026952135,0.0010484832,0.00017756713,0.0007041471],"category_scores_gemma":[0.00006469144,0.00040361038,0.00018937889,0.00017071796,0.00028316214,0.00010852809,0.001556409,0.00046398694,0.0024555093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013359924,0.000025373902,0.000004569312,0.0001631922,0.000034256776,0.000067056906,0.00013858858,0.0000020804825,0.0000017683536,0.98206514,0.0072317184,0.01026493],"study_design_scores_gemma":[0.00013664099,0.000036677826,0.00016569857,0.00014992186,0.000024136689,0.000038684568,0.0000028495697,0.026509268,0.0000014854736,0.94563484,0.026861336,0.00043847997],"about_ca_topic_score_codex":0.000010786676,"about_ca_topic_score_gemma":0.00006001359,"teacher_disagreement_score":0.0688077,"about_ca_system_score_codex":0.00009265095,"about_ca_system_score_gemma":0.000049400725,"threshold_uncertainty_score":0.9998416},"labels":[],"label_agreement":null},{"id":"W4391183291","doi":"10.1090/mawrld/031/02","title":"Modular arithmetic","year":2023,"lang":"en","type":"book-chapter","venue":"Mathematical world","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Modular design; Modular arithmetic; Computer science; Mathematics; Programming language","score_opus":0.041383754938146375,"score_gpt":0.2469465134099438,"score_spread":0.20556275847179745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391183291","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023898015,0.00008349539,0.42179626,0.001369998,0.000593419,0.00043228111,0.000008555208,0.0010757957,0.5746378],"genre_scores_gemma":[0.0002976217,0.000007632823,0.13899973,0.0002642517,0.00031239,0.000037530604,0.0000077678205,0.00011242504,0.8599607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641675,0.000040898223,0.00079749204,0.0011163426,0.0010372887,0.00059120345],"domain_scores_gemma":[0.99618447,0.000970389,0.00020358532,0.0022160332,0.00013544176,0.00029010768],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00069424295,0.00060116535,0.0009302572,0.00048582928,0.00011991874,0.00032899555,0.0021830136,0.00026377648,0.00093839597],"category_scores_gemma":[0.00017771103,0.00053610106,0.0004336285,0.00032463492,0.00020181524,0.00013985619,0.0018104161,0.00076010113,0.012855757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.928988e-7,0.000053464657,6.131284e-7,0.00018262235,0.000048933885,0.0001472811,0.00006522115,0.000036081736,0.00000243605,0.98218745,0.001961691,0.015313401],"study_design_scores_gemma":[0.00010970626,0.00004146713,0.000021899334,0.00022998443,0.00003305092,0.00003042794,8.86276e-7,0.08400792,0.00000977346,0.8836177,0.031378135,0.0005190822],"about_ca_topic_score_codex":0.000002028422,"about_ca_topic_score_gemma":0.000011592227,"teacher_disagreement_score":0.28532284,"about_ca_system_score_codex":0.00015065556,"about_ca_system_score_gemma":0.00008281853,"threshold_uncertainty_score":0.9999749},"labels":[],"label_agreement":null},{"id":"W4391262456","doi":"10.1017/psa.2023.177","title":"Pride and Probability","year":2024,"lang":"en","type":"article","venue":"Philosophy of Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Peking University; University of Toronto","keywords":"Pride; Philosophy; Theology","score_opus":0.03408660758400776,"score_gpt":0.2676855290961864,"score_spread":0.23359892151217868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391262456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.577151,0.0025375946,0.36991414,0.020286528,0.0023865055,0.00089233636,0.000009127667,0.0009840198,0.02583872],"genre_scores_gemma":[0.9166888,0.0000076154606,0.08314453,0.00006730042,0.00007089369,0.0000066453085,8.376317e-8,0.000003200661,0.000010951856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979789,0.000031515367,0.0002495536,0.0008431017,0.00061250624,0.00028440316],"domain_scores_gemma":[0.99880475,0.00017621332,0.000042448402,0.0006787944,0.00015183196,0.00014595722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452673,0.00012299785,0.0001601301,0.00021384296,0.00015372295,0.00024900655,0.0014137744,0.000027460816,0.000005455336],"category_scores_gemma":[0.00019923624,0.000102093254,0.00004922575,0.0016558471,0.0023774402,0.0011832757,0.00093819725,0.00012614751,0.000014874728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018643728,0.00008334386,0.0009383447,0.00019718429,0.0000043596824,0.000011461784,0.0009115895,0.000056966517,0.0049934234,0.91200924,0.000021577525,0.080770634],"study_design_scores_gemma":[0.000050263567,0.00010436173,0.009559182,0.000044453052,0.0000024625572,0.000028408826,0.0000038056448,0.103943594,0.0039805863,0.88191175,0.00023733544,0.00013382189],"about_ca_topic_score_codex":0.000015816715,"about_ca_topic_score_gemma":8.917024e-7,"teacher_disagreement_score":0.33953777,"about_ca_system_score_codex":0.00006346318,"about_ca_system_score_gemma":0.0002689516,"threshold_uncertainty_score":0.8759778},"labels":[],"label_agreement":null},{"id":"W4391405830","doi":"10.3934/jmd.2024001","title":"Entropy-efficient finitary codings","year":2024,"lang":"fr","type":"article","venue":"Journal of Modern Dynamics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Mathematics; Finitary; Entropy (arrow of time); Pure mathematics; Discrete mathematics; Combinatorics","score_opus":0.023355114968441407,"score_gpt":0.25881370396520137,"score_spread":0.23545858899675998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391405830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054308813,0.036472846,0.87097204,0.020543518,0.016784495,0.00016284731,0.000045550587,0.000089526686,0.00062038936],"genre_scores_gemma":[0.8928323,0.0010833383,0.09944059,0.0004648708,0.0020850955,0.0000015866394,0.0000045687116,0.00006893267,0.004018739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960581,0.000260195,0.0012438245,0.00056213804,0.001159865,0.000715844],"domain_scores_gemma":[0.9972392,0.0007048614,0.00041598605,0.000588596,0.00065316865,0.00039821785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017776387,0.00040348593,0.0006075416,0.00041522278,0.00013587823,0.0009826757,0.0015853022,0.0002513741,0.00009886221],"category_scores_gemma":[0.0002063295,0.00037705625,0.00064042903,0.00075033784,0.00026851945,0.00077862665,0.00073562947,0.0013670491,0.00013384465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031327618,0.000682174,0.00027225076,0.0003806632,0.00024523406,0.002732738,0.003055313,0.29443204,0.000073697985,0.18849556,0.0026945875,0.5069044],"study_design_scores_gemma":[0.0003025454,0.0004319034,0.0004922443,0.0005257417,0.00011017166,0.00270281,0.0000346526,0.88172626,0.00001712086,0.10569673,0.0076417173,0.00031811403],"about_ca_topic_score_codex":0.00003772388,"about_ca_topic_score_gemma":0.000026442083,"teacher_disagreement_score":0.83852345,"about_ca_system_score_codex":0.0013677441,"about_ca_system_score_gemma":0.0009508258,"threshold_uncertainty_score":0.99986815},"labels":[],"label_agreement":null},{"id":"W4392336706","doi":"10.1515/9781782045977","title":"Formal Functions in Perspective","year":2015,"lang":"en","type":"book","venue":"Boydell and Brewer eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Perspective (graphical); Computer science; Artificial intelligence","score_opus":0.02193150308436163,"score_gpt":0.23434027250136907,"score_spread":0.21240876941700745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392336706","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008627218,0.0007579114,0.07846299,0.00018023023,0.00090772985,0.0004633618,0.000019404928,0.00020752486,0.91891456],"genre_scores_gemma":[0.005545885,0.0000069537996,0.007819584,0.00045772735,0.0007385824,0.000035014356,0.000015351869,0.00004466472,0.98533624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976487,0.00005549931,0.0004030518,0.0008899126,0.0004622126,0.00054061913],"domain_scores_gemma":[0.998369,0.0001189814,0.00013564543,0.0007348805,0.0004052816,0.0002362089],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007308606,0.00040016696,0.00045848847,0.0003714673,0.00011753742,0.00018564795,0.0007066077,0.0003648118,0.000013669501],"category_scores_gemma":[0.000028417848,0.00036958285,0.00013099,0.0000905337,0.00016991638,0.00026032975,0.0010743338,0.00065994845,0.00009029413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007943987,0.00025590506,0.0001176692,0.00014700618,0.00013926288,0.00038824196,0.009563398,0.00005631665,0.0000096996,0.6182632,0.09125216,0.2797277],"study_design_scores_gemma":[0.0013129138,0.000508364,0.0006398198,0.000120973215,0.000042180527,0.00024716443,0.00039212982,0.01093797,0.0000124429,0.5221884,0.46238068,0.0012169406],"about_ca_topic_score_codex":0.00015306586,"about_ca_topic_score_gemma":0.0003460396,"teacher_disagreement_score":0.3711285,"about_ca_system_score_codex":0.0005672199,"about_ca_system_score_gemma":0.00081149687,"threshold_uncertainty_score":0.9998756},"labels":[],"label_agreement":null},{"id":"W4392736895","doi":"10.1109/lcsys.2024.3416238","title":"Extending Identifiability Results From Continuous to Discrete-Space Systems","year":2024,"lang":"en","type":"preprint","venue":"IEEE Control Systems Letters","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Identifiability; Space (punctuation); Computer science; Discrete space; Mathematics; Topology (electrical circuits); Mathematical analysis; Combinatorics","score_opus":0.0162319233767295,"score_gpt":0.2522985446725959,"score_spread":0.2360666212958664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392736895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10612557,0.0032535074,0.78884983,0.012892414,0.078225456,0.0061212126,0.0019984918,0.0021881624,0.0003453328],"genre_scores_gemma":[0.99045664,0.0000075583007,0.002461652,0.0007322051,0.0045069125,0.0011262719,0.00006709362,0.0001398742,0.0005018106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858111,0.002212236,0.0030373032,0.0052497457,0.0020542622,0.0016353641],"domain_scores_gemma":[0.98851174,0.0025757016,0.0012006366,0.006410181,0.0005003245,0.000801443],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0049459552,0.0015035287,0.0028360765,0.0006966343,0.00029058338,0.0064658835,0.005521979,0.0007523028,0.000003415077],"category_scores_gemma":[0.0007969476,0.0014164675,0.000912421,0.0007945611,0.00019828079,0.00041868852,0.0038082895,0.002144385,0.0007164981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002811323,0.00023163506,0.00041722128,0.0025550374,0.0019416622,0.0016509945,0.005282656,0.8913395,0.030501192,0.003286803,0.0593624,0.0031497667],"study_design_scores_gemma":[0.002447556,0.00013794155,0.00089801505,0.0032731898,0.0003555526,0.000081199956,0.00020191408,0.97982734,0.00015843008,0.002047138,0.008014303,0.0025574076],"about_ca_topic_score_codex":0.016224824,"about_ca_topic_score_gemma":0.00012095706,"teacher_disagreement_score":0.88433105,"about_ca_system_score_codex":0.0017877119,"about_ca_system_score_gemma":0.00031781988,"threshold_uncertainty_score":0.9998586},"labels":[],"label_agreement":null},{"id":"W4392757246","doi":"10.1017/9781009283403","title":"Essays on Coding Theory","year":2024,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Coding (social sciences); Sociology; Social science","score_opus":0.0215193809376122,"score_gpt":0.2079234643917501,"score_spread":0.1864040834541379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392757246","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010748184,0.00018807546,0.12612608,0.000048547772,0.0017056719,0.0004531352,0.00011264799,0.0009894881,0.8703656],"genre_scores_gemma":[0.0003324035,0.000026356234,0.0014960141,0.00018074503,0.00036660288,0.0000026566236,0.000021116597,0.00005268689,0.9975214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968191,0.0002841355,0.0002673806,0.0014679001,0.00061129266,0.0005502058],"domain_scores_gemma":[0.9969687,0.00062077626,0.00018543465,0.001791834,0.00017322294,0.00026001842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005407146,0.0006020296,0.00057636655,0.00044324595,0.00027399947,0.0003519927,0.0031103601,0.0004613875,0.00000432245],"category_scores_gemma":[0.000034106273,0.00066141493,0.0004135211,0.000063062784,0.0002932027,0.0001940354,0.0029714103,0.0011682977,0.00017608293],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019829537,0.00002164759,1.9744493e-7,0.0001505381,0.00009659278,0.00082566275,0.00011500909,0.000020002326,0.000004453933,0.8414199,0.14859188,0.008734346],"study_design_scores_gemma":[0.0003535363,0.00014631989,0.000005914956,0.00039032602,0.000129486,0.00004299556,0.000016703474,0.0077743847,0.00016029543,0.0036140303,0.986534,0.00083198096],"about_ca_topic_score_codex":0.000023161367,"about_ca_topic_score_gemma":7.214528e-7,"teacher_disagreement_score":0.8379422,"about_ca_system_score_codex":0.00099041,"about_ca_system_score_gemma":0.00056257966,"threshold_uncertainty_score":0.9995837},"labels":[],"label_agreement":null},{"id":"W4393153764","doi":"10.1080/13869795.2024.2332171","title":"Wide computationalism revisited: distributed mechanisms, parsimony and testability","year":2024,"lang":"en","type":"article","venue":"Philosophical Explorations","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Occam's razor; Testability; Computer science; Epistemology; Artificial intelligence; Theoretical computer science; Psychology; Philosophy","score_opus":0.03669420877413334,"score_gpt":0.274417491285155,"score_spread":0.23772328251102168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393153764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015162344,0.0005640838,0.89188176,0.10401594,0.00036761767,0.0003758894,0.00013338473,0.0009551595,0.00018990893],"genre_scores_gemma":[0.91215044,0.000030850504,0.08654071,0.00076036964,0.00022368431,0.00008876428,0.00018163718,0.000016976026,0.0000065843597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747247,0.00022539338,0.0005107734,0.00096655026,0.00050194905,0.00032289716],"domain_scores_gemma":[0.99731356,0.001415217,0.000056798996,0.0006903652,0.00024994338,0.00027413815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059306907,0.00026556075,0.00029254032,0.0001549007,0.0002690319,0.0006849088,0.0005591315,0.00011867666,0.00003403262],"category_scores_gemma":[0.00059547374,0.0002478921,0.000111693626,0.0011628431,0.0001949523,0.0011292767,0.0005434753,0.0003792704,0.00010827189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002209663,0.0001252611,0.00007362737,0.00005211392,0.000023151119,0.000031157626,0.00032894348,0.00066170894,0.0000755916,0.9941406,0.00041797265,0.0040676403],"study_design_scores_gemma":[0.0000937622,0.000057822166,0.0010394776,0.000027995184,0.000013594843,0.000020146688,0.0000090653375,0.31931654,0.000033688502,0.6774404,0.0017580965,0.00018942328],"about_ca_topic_score_codex":0.000008953209,"about_ca_topic_score_gemma":0.0000042242687,"teacher_disagreement_score":0.9106342,"about_ca_system_score_codex":0.00011566358,"about_ca_system_score_gemma":0.00014452342,"threshold_uncertainty_score":0.9999973},"labels":[],"label_agreement":null},{"id":"W4393161644","doi":"10.1609/aaai.v38i21.30437","title":"A SAT + Computer Algebra System Verification of the Ramsey Problem R(3, 8) (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Waterloo","funders":"","keywords":"Computer science; Algebra over a field; Symbolic computation; Programming language; Calculus (dental); Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.04920799804165031,"score_gpt":0.2839430372953485,"score_spread":0.23473503925369815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6736377,0.00031909562,0.2868593,0.012251848,0.006834319,0.0040666847,0.00003024725,0.001024503,0.014976322],"genre_scores_gemma":[0.9928177,0.000011734052,0.0068176365,0.00006954847,0.00014588892,0.000046402627,4.8246557e-7,0.000016793678,0.00007380078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968417,0.00004265185,0.0009897085,0.0007960658,0.00095508713,0.00037475923],"domain_scores_gemma":[0.9977249,0.00020125916,0.0004957141,0.0007068176,0.0007870129,0.00008432965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010865481,0.00030795828,0.00036863322,0.00014035958,0.00019925152,0.0005656182,0.0039020833,0.00012721562,0.000023587381],"category_scores_gemma":[0.000091270806,0.00019321372,0.00027253773,0.0011629772,0.00038971062,0.00043230227,0.0010760257,0.00045616517,0.000102358536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015608934,0.00020242852,0.00025448608,0.00042634268,0.00003614084,7.565435e-7,0.0029932929,0.000303345,0.014463588,0.88148415,0.00015591242,0.09966396],"study_design_scores_gemma":[0.000050147515,0.00032622405,0.007219065,0.0019738828,0.000050567156,0.00003116174,0.000889777,0.5423726,0.32516402,0.12112636,0.00031147804,0.00048471216],"about_ca_topic_score_codex":0.00006606516,"about_ca_topic_score_gemma":0.000008832913,"teacher_disagreement_score":0.7603578,"about_ca_system_score_codex":0.0001736137,"about_ca_system_score_gemma":0.0002152515,"threshold_uncertainty_score":0.7879027},"labels":[],"label_agreement":null},{"id":"W4393161746","doi":"10.1609/aaai.v38i21.30472","title":"A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Solver; Boolean satisfiability problem; Algebra over a field; Computer science; Mathematics; Theoretical computer science; Programming language; Pure mathematics","score_opus":0.09548648366521736,"score_gpt":0.31365248732505113,"score_spread":0.21816600365983377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.889788,0.00028485927,0.047490887,0.041556038,0.0026350461,0.002479874,0.000015270705,0.0006414959,0.015108539],"genre_scores_gemma":[0.9939158,0.000046468318,0.004769322,0.00072098157,0.00025828893,0.000053488704,4.793127e-7,0.000023305105,0.00021187644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669427,0.00003475147,0.000737319,0.0010834952,0.0009081501,0.00054200477],"domain_scores_gemma":[0.998019,0.00055409776,0.00024438402,0.0005713911,0.00047171774,0.00013940907],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011081124,0.0004290594,0.00036715786,0.00015529619,0.00029787066,0.001414737,0.0027256713,0.00013477978,0.00011697611],"category_scores_gemma":[0.000112520895,0.00025695964,0.00019953336,0.0007301062,0.00056472543,0.00045860288,0.0013350949,0.00069090875,0.00031801173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028977745,0.00027126883,0.00017779999,0.000106510175,0.00005097258,0.000004041843,0.004359644,0.00007567617,0.0035151395,0.8894089,0.0018164415,0.10018461],"study_design_scores_gemma":[0.00007536284,0.0008996647,0.0047276067,0.0011859755,0.00004665678,0.00004276308,0.00078403373,0.47463378,0.09031141,0.4243259,0.0020811248,0.0008856859],"about_ca_topic_score_codex":0.000023275754,"about_ca_topic_score_gemma":0.000011770159,"teacher_disagreement_score":0.47455812,"about_ca_system_score_codex":0.00009894989,"about_ca_system_score_gemma":0.00012667682,"threshold_uncertainty_score":0.99998826},"labels":[],"label_agreement":null},{"id":"W4393179185","doi":"10.1017/9781009283403.018","title":"Other Types of Coding","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Coding (social sciences); Computer science; Content (measure theory); Information retrieval; Mathematics; Statistics","score_opus":0.026705439957777292,"score_gpt":0.2065396052110638,"score_spread":0.1798341652532865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393179185","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020179003,0.00028372588,0.05837438,0.000028030809,0.000665516,0.00026055335,0.00010145974,0.00031826986,0.9399479],"genre_scores_gemma":[0.0018800242,0.000017531209,0.0025511722,0.000037252306,0.000121036974,2.9581017e-7,0.0000046820765,0.000035010093,0.995353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842805,0.000029238112,0.00022989343,0.0007219355,0.00033939982,0.0002515153],"domain_scores_gemma":[0.9984118,0.00011367044,0.0001845623,0.0009927613,0.0001805993,0.000116626994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015320175,0.0003345109,0.00045121735,0.00029326815,0.00007650735,0.000078997306,0.0015146894,0.00027130125,0.000007751369],"category_scores_gemma":[0.000006169523,0.00037000395,0.00028958207,0.00002509223,0.00022787956,0.00011621644,0.0016534855,0.00040631,0.000043653512],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075374173,0.000008173511,8.9644567e-7,0.00012856993,0.00011170626,0.00014610897,0.000082696795,0.000014066798,0.00003489685,0.99037325,0.0050278986,0.004064181],"study_design_scores_gemma":[0.00022883865,0.00007950142,0.0000086464825,0.00026016083,0.00013046303,0.000023350647,0.000007933656,0.007570312,0.00056977075,0.001424268,0.9891731,0.000523641],"about_ca_topic_score_codex":0.000112368,"about_ca_topic_score_gemma":0.0000022671197,"teacher_disagreement_score":0.988949,"about_ca_system_score_codex":0.00017389773,"about_ca_system_score_gemma":0.00010228959,"threshold_uncertainty_score":0.9998752},"labels":[],"label_agreement":null},{"id":"W4393185920","doi":"10.1145/3654780.3654788","title":"Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes","year":2024,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Communication complexity; Constant (computer programming); Column (typography); Computer science; Structural complexity theory; Theoretical computer science; Mathematics; Computational complexity theory; Complexity class; Algorithm; Telecommunications; Programming language","score_opus":0.0740858890672719,"score_gpt":0.3144465188398266,"score_spread":0.2403606297725547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393185920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.882044,0.006511191,0.06494175,0.030554479,0.0035685566,0.0030204405,0.00033734145,0.00198879,0.007033442],"genre_scores_gemma":[0.9316935,0.00012296677,0.067456834,0.000494014,0.00012340209,0.000018689614,0.00004665321,0.000017169488,0.000026775511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975074,0.00041334654,0.0005053835,0.000789264,0.0003444255,0.0004401972],"domain_scores_gemma":[0.99631757,0.0012057349,0.000101861864,0.0021023375,0.00010394913,0.00016856893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048076635,0.00029927894,0.00042586273,0.00018818222,0.00022183341,0.0008191856,0.0020902306,0.00014625984,0.000070182745],"category_scores_gemma":[0.00031758565,0.00029049037,0.000072322626,0.00087152544,0.0006657591,0.00077728915,0.0019782777,0.0006045798,0.00003192954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064020714,0.00063475495,0.096450604,0.00056945626,0.00014368548,0.0002516914,0.0079866545,0.0001893465,0.0032004246,0.59349465,0.021425854,0.27558887],"study_design_scores_gemma":[0.001072264,0.00021473205,0.18376817,0.00023156266,0.000024350253,0.00023300255,0.000379505,0.16575475,0.0006706516,0.59098196,0.05568748,0.0009815654],"about_ca_topic_score_codex":0.0015344747,"about_ca_topic_score_gemma":0.00940636,"teacher_disagreement_score":0.2746073,"about_ca_system_score_codex":0.00021287445,"about_ca_system_score_gemma":0.00018665688,"threshold_uncertainty_score":0.9999547},"labels":[],"label_agreement":null},{"id":"W4394935694","doi":"10.1016/j.jet.2024.105841","title":"On comparisons of information structures with infinite states","year":2024,"lang":"en","type":"article","venue":"Journal of Economic Theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Mathematical economics; Mathematics; Computer science","score_opus":0.008982906901710242,"score_gpt":0.23669493954678003,"score_spread":0.22771203264506978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394935694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4323296,0.00023481541,0.5644738,0.00035879575,0.00096287084,0.00007567565,0.000010709093,0.00003400742,0.0015197026],"genre_scores_gemma":[0.98224956,0.000013852785,0.017541023,0.00010464153,0.00007300623,5.289476e-7,9.223772e-7,0.000004361146,0.000012110511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909705,0.00008033837,0.00051209104,0.00008987347,0.00010845003,0.000112215486],"domain_scores_gemma":[0.99860215,0.0007054112,0.00034284138,0.0002252711,0.0000668727,0.000057438152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080348685,0.000099845165,0.00022938484,0.00028627669,0.000027459726,0.00016989582,0.00050185854,0.000030848532,0.000054631677],"category_scores_gemma":[0.000032059117,0.00006944019,0.000083015446,0.00009003449,0.000071269424,0.0009823852,0.000082126266,0.00020333861,0.00002400726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007575146,0.000023512794,0.0002813862,0.000041566127,0.00010143079,0.000006924478,0.0017982092,0.10081876,0.000012356121,0.853131,0.0012659804,0.042443097],"study_design_scores_gemma":[0.00045931418,0.00079917477,0.005049604,0.00010514826,0.000020401456,0.00018429817,0.000270462,0.13322185,0.00071679876,0.8547275,0.004281119,0.00016432525],"about_ca_topic_score_codex":0.0000049769446,"about_ca_topic_score_gemma":0.0000029844273,"teacher_disagreement_score":0.54991996,"about_ca_system_score_codex":0.00010369818,"about_ca_system_score_gemma":0.00019496169,"threshold_uncertainty_score":0.28316888},"labels":[],"label_agreement":null},{"id":"W4396683686","doi":"10.1016/j.jctb.2024.04.001","title":"The inducibility of oriented stars","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Stars; Astrophysics; Astronomy; Physics","score_opus":0.009695795141661441,"score_gpt":0.25018538364967846,"score_spread":0.24048958850801702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396683686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67752284,0.0058203596,0.20525731,0.004876056,0.10229088,0.0005851544,0.000012611667,0.00027183004,0.0033629818],"genre_scores_gemma":[0.9959663,0.000069367605,0.0032321876,0.000022956321,0.0005781871,0.0000021608464,2.5221394e-7,0.000011755266,0.00011680427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971579,0.0006955629,0.00089568313,0.00026663672,0.000714308,0.0002699481],"domain_scores_gemma":[0.9962078,0.0018010184,0.00037680977,0.000809647,0.00068438274,0.00012034174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006106789,0.00017674954,0.00037536476,0.00012679987,0.00017386921,0.0002690666,0.0015687326,0.00008886754,0.000024435087],"category_scores_gemma":[0.0010758926,0.000110971254,0.0002749986,0.00078029337,0.00038700073,0.0009835439,0.00046329925,0.000510629,0.0000042807383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021487013,0.000115737486,0.000083045896,0.000031045656,0.000090881476,0.000035283483,0.0009915398,0.00002937685,0.00038973734,0.9734655,0.00044201838,0.024110967],"study_design_scores_gemma":[0.00038473852,0.0009084611,0.0005925664,0.000057683505,0.000020930216,0.00011314509,0.00021981962,0.0005982023,0.0043328987,0.95485735,0.03778904,0.00012518279],"about_ca_topic_score_codex":0.0000041050766,"about_ca_topic_score_gemma":0.000001330365,"teacher_disagreement_score":0.3184435,"about_ca_system_score_codex":0.00013799209,"about_ca_system_score_gemma":0.0004979083,"threshold_uncertainty_score":0.45252764},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028671423870876848,"score_gpt":0.30799056012233234,"score_spread":0.2793191362514555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397047033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03244747,0.0014400635,0.9592936,0.0027006015,0.0010777148,0.00010585576,0.0000027550802,0.00026688018,0.0026650669],"genre_scores_gemma":[0.9528086,0.000014810819,0.046607435,0.00011504666,0.00024496042,0.000010489645,0.0000010205887,0.0000065354857,0.00019111043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907476,0.00003656937,0.00015201884,0.0004354734,0.00012755026,0.00017362105],"domain_scores_gemma":[0.99951243,0.0001419846,0.000014826194,0.00023381396,0.000034479755,0.00006248923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024113276,0.00011810783,0.00011347068,0.00009777679,0.00009118307,0.00035895716,0.00030773072,0.000039697738,0.000024917583],"category_scores_gemma":[0.000035797257,0.0000910379,0.0000446407,0.00036910453,0.00006299797,0.0002086515,0.0003071735,0.0001269677,0.00004100666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001762663,0.000021780079,0.000062478706,0.000016060925,0.0000073966025,0.000023893963,0.0010041782,0.000022123644,0.00023705522,0.11110666,0.00009061032,0.887406],"study_design_scores_gemma":[0.00001263317,0.000099033015,0.0009180988,0.000013293881,0.0000047959247,0.000048664027,0.000023460938,0.5910489,0.00128535,0.4038885,0.0025095183,0.00014772978],"about_ca_topic_score_codex":0.00005895099,"about_ca_topic_score_gemma":0.00004488717,"teacher_disagreement_score":0.9203611,"about_ca_system_score_codex":0.000020090298,"about_ca_system_score_gemma":0.000033225948,"threshold_uncertainty_score":0.3712418},"labels":[],"label_agreement":null},{"id":"W4398172566","doi":"10.1007/978-3-031-59835-7_31","title":"Fast Combinatorial Algorithms for Efficient Sortation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm","score_opus":0.018851492111999157,"score_gpt":0.2653402375234525,"score_spread":0.24648874541145332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398172566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006337807,0.0005616339,0.97491336,0.0009426027,0.019552033,0.0014379033,0.00003126654,0.0005512503,0.0019465798],"genre_scores_gemma":[0.059526846,0.000019836638,0.9349631,0.00074063183,0.0035626083,0.00012438963,0.000038135542,0.00014037023,0.0008841039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99326634,0.00003871109,0.00093434576,0.0030387766,0.0016407327,0.0010810685],"domain_scores_gemma":[0.9957734,0.0011501951,0.0003337472,0.0018166316,0.0006439131,0.0002821542],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016965072,0.0008696805,0.0008380027,0.001180753,0.00038545538,0.001353072,0.004215552,0.00051618996,0.000014950376],"category_scores_gemma":[0.00016127448,0.00081215694,0.00038377606,0.001080391,0.00077867904,0.00039755716,0.0020494282,0.0010213138,0.00010673554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094269135,0.000094380914,0.000004919442,0.00014090969,0.000024376312,0.000078521385,0.00088316336,0.13254976,0.00004586945,0.22716935,0.00004167552,0.6389576],"study_design_scores_gemma":[0.0003218348,0.0002533647,0.000017870982,0.00016394728,0.000013757653,0.000031952848,2.052402e-7,0.6000017,0.00034393556,0.39701906,0.001268707,0.00056366],"about_ca_topic_score_codex":0.000024329469,"about_ca_topic_score_gemma":0.000031048556,"teacher_disagreement_score":0.638394,"about_ca_system_score_codex":0.0008356599,"about_ca_system_score_gemma":0.00087395904,"threshold_uncertainty_score":0.9996836},"labels":[],"label_agreement":null},{"id":"W4398269241","doi":"10.7910/dvn/dnw5rw/k9fs4h","title":"manifest.xml","year":2019,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"XML; Computer science; Information retrieval; Programming language; World Wide Web","score_opus":0.023780830118095102,"score_gpt":0.24974317785688763,"score_spread":0.22596234773879253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398269241","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004295472,0.0000030010597,0.023311822,0.000027615435,0.0049007963,0.0005940675,0.9704279,0.0002673055,0.00046322498],"genre_scores_gemma":[0.0000051463235,0.00010725517,0.014607846,0.00079226,0.00053021254,0.000026788899,0.9833023,0.000027238628,0.00060093903],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956057,0.00023591143,0.00060861395,0.0017897361,0.00096917147,0.0007908514],"domain_scores_gemma":[0.99133086,0.00030149103,0.00035806972,0.007561368,0.00016064687,0.000287566],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007017152,0.0006688634,0.00073194865,0.00033961222,0.0001487855,0.00062249193,0.0071804435,0.00047212467,0.008554128],"category_scores_gemma":[0.00023910466,0.0006582764,0.00026641745,0.0005031467,0.000121954916,0.000997989,0.006011276,0.0008533531,0.4282399],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055458718,0.00015052976,0.0000064864794,0.0001447798,0.000048174195,0.00030513157,0.000017883689,0.000039817085,0.000002384188,0.00037727438,0.99719185,0.0017101533],"study_design_scores_gemma":[0.0003921993,0.000115229486,0.00008883012,0.000056047575,0.00004899899,0.00013315243,0.000006423653,0.0037704178,0.000008820158,0.00037675948,0.9942576,0.00074547745],"about_ca_topic_score_codex":0.0003463725,"about_ca_topic_score_gemma":0.00007436918,"teacher_disagreement_score":0.4196858,"about_ca_system_score_codex":0.00023221872,"about_ca_system_score_gemma":0.00038747655,"threshold_uncertainty_score":0.9995868},"labels":[],"label_agreement":null},{"id":"W4398684812","doi":"10.7910/dvn/mma4xl","title":"Replication data for: Unrevaling Ambiguity Aversion","year":2023,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Replication (statistics); Ambiguity; Ambiguity aversion; Computer science; Psychology; Biology; Programming language; Virology","score_opus":0.08861274987281159,"score_gpt":0.32657705926841424,"score_spread":0.23796430939560265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398684812","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025579807,0.0000019865677,0.15195973,0.00006750453,0.0026422348,0.00091312523,0.8438584,0.00053745956,0.00001696111],"genre_scores_gemma":[0.0000014215827,0.00022005255,0.031735968,0.0002954855,0.0005914239,0.00006763286,0.9668821,0.000034682576,0.00017120485],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99429095,0.00022916164,0.000731774,0.0032373883,0.00085191143,0.0006588095],"domain_scores_gemma":[0.9734268,0.0007040405,0.00051456713,0.024850918,0.00027185213,0.00023178995],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0032332593,0.000508681,0.0005977378,0.00033187465,0.00037668188,0.0005419926,0.0125974305,0.00041153427,0.0002707275],"category_scores_gemma":[0.002928413,0.0005371612,0.00017702514,0.0007749181,0.00010521227,0.0014156472,0.01396733,0.00052027876,0.07444524],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012385043,0.00009576394,0.0000019620256,0.00024532722,0.00004596584,0.000026364827,0.0000127909325,0.000040432875,0.000009408716,0.00014733584,0.992621,0.006741236],"study_design_scores_gemma":[0.0004019384,0.000077514895,0.000042287786,0.000083575585,0.00009319453,0.000015078669,0.000010403754,0.0664512,0.000017198123,0.00093368953,0.9313475,0.0005264265],"about_ca_topic_score_codex":0.0010209035,"about_ca_topic_score_gemma":0.00027525958,"teacher_disagreement_score":0.123023696,"about_ca_system_score_codex":0.00029951287,"about_ca_system_score_gemma":0.00035414004,"threshold_uncertainty_score":0.999708},"labels":[],"label_agreement":null},{"id":"W4398767262","doi":"10.1090/bull/1839","title":"Machine Learning and Information Theory Concepts towards an AI Mathematician","year":2024,"lang":"en","type":"article","venue":"Bulletin of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Canadian Institute for Advanced Research","keywords":"Computer science; Artificial intelligence; Cognitive science; Epistemology; Mathematics education; Philosophy; Psychology","score_opus":0.008002583503308961,"score_gpt":0.27116284012694625,"score_spread":0.2631602566236373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398767262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018864052,0.0003149877,0.9600698,0.014367698,0.00015880726,0.00044915077,0.000009770822,0.00048818812,0.0052775787],"genre_scores_gemma":[0.6717257,0.0000738328,0.32446685,0.0031804736,0.00008801771,0.00003611725,0.000003024431,0.000028910039,0.00039705588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817175,0.00031321953,0.00046186204,0.00029295313,0.00047956748,0.0002806357],"domain_scores_gemma":[0.9983075,0.00075145025,0.0002152187,0.0005264735,0.00008668587,0.00011266727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001553198,0.00020932705,0.00039551713,0.00003116411,0.00016541188,0.00027640985,0.00084025937,0.000051052786,0.0001725163],"category_scores_gemma":[0.0003925857,0.00013526539,0.0002625585,0.00041150427,0.00076131884,0.0002690334,0.0007942441,0.0003765213,0.00007416275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008534817,0.00017455705,0.000091268776,0.00073016214,0.00011160095,0.0000017413464,0.013140605,0.00010808502,0.000096386415,0.77405965,0.0017275736,0.20974985],"study_design_scores_gemma":[0.00019282667,0.00028192348,0.0006745448,0.00018422413,0.000048441027,0.00006882621,0.001248061,0.5690868,0.0002485081,0.3932523,0.03437632,0.00033723368],"about_ca_topic_score_codex":0.000039285038,"about_ca_topic_score_gemma":2.7864775e-7,"teacher_disagreement_score":0.65286165,"about_ca_system_score_codex":0.000056489185,"about_ca_system_score_gemma":0.00006172835,"threshold_uncertainty_score":0.5515963},"labels":[],"label_agreement":null},{"id":"W4399348269","doi":"10.1145/3626183.3659966","title":"When Is Parallelism Fearless and Zero-Cost with Rust?","year":2024,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Universitas Brawijaya","keywords":"Parallelism (grammar); Zero (linguistics); Computer science; Rust (programming language); Parallel computing; Programming language; Linguistics; Philosophy","score_opus":0.01656579683442372,"score_gpt":0.24076014139546104,"score_spread":0.22419434456103732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399348269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02176588,0.0006795998,0.96349263,0.008214892,0.0003961884,0.00031980925,0.0000033191468,0.0006382253,0.0044894824],"genre_scores_gemma":[0.4909066,0.0000479549,0.5021995,0.0017886593,0.00015611864,0.00004332938,0.0000019101162,0.000025291654,0.0048306724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849135,0.000039007424,0.00016116485,0.00069288403,0.00029797765,0.00031762334],"domain_scores_gemma":[0.99907064,0.00012921529,0.000019368801,0.0005813208,0.000059481823,0.00013996275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025815307,0.00017977472,0.00017488822,0.000087596614,0.00009469376,0.0007762121,0.0005893832,0.000058681533,0.000107570406],"category_scores_gemma":[0.000008116429,0.0001249541,0.000040399358,0.0003011564,0.00008937324,0.00049333385,0.00052110746,0.00016743048,0.0001279237],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008681982,0.00008783064,0.001479514,0.000101780766,0.00006518789,0.00018579261,0.0069503686,0.00007425549,0.000051344414,0.1184249,0.023607124,0.8489632],"study_design_scores_gemma":[0.0007490736,0.00035776795,0.010464859,0.00010489776,0.000028368306,0.00036985122,0.00010941099,0.5882747,0.0007156628,0.21717823,0.18068862,0.00095856405],"about_ca_topic_score_codex":0.00015900868,"about_ca_topic_score_gemma":0.000027562048,"teacher_disagreement_score":0.84800464,"about_ca_system_score_codex":0.000037562048,"about_ca_system_score_gemma":0.00007588939,"threshold_uncertainty_score":0.7485031},"labels":[],"label_agreement":null},{"id":"W4399521457","doi":"10.1145/3618260.3649682","title":"Packing Even Directed Circuits Quarter-Integrally","year":2024,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Institute for Basic Science","keywords":"Integrally closed; Digraph; Combinatorics; Vertex (graph theory); Mathematics; Statement (logic); Directed graph; Integer (computer science); Computable function; Discrete mathematics; Function (biology); Quarter (Canadian coin); Set (abstract data type); Computer science; Graph","score_opus":0.016102558433483537,"score_gpt":0.25004265449146834,"score_spread":0.2339400960579848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399521457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006349452,0.00041302035,0.95366937,0.0026958438,0.0020934057,0.00021862828,0.0000022968309,0.0044073714,0.030150637],"genre_scores_gemma":[0.95707816,0.000009813474,0.041276373,0.00028482408,0.00022443627,0.00001743134,0.000002615182,0.000017440221,0.0010889068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979857,0.00011089082,0.00030167314,0.0007816434,0.0003883062,0.0004317911],"domain_scores_gemma":[0.998623,0.00033734224,0.000028586503,0.0007622646,0.0001117714,0.00013701672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043132587,0.00021502895,0.00021379442,0.00030861172,0.00009529829,0.00076447794,0.0011037528,0.000077603065,0.00015698046],"category_scores_gemma":[0.00006875514,0.00017256396,0.00014780699,0.0015418755,0.00003978593,0.00058761245,0.00035795607,0.00024788402,0.000486692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010430537,0.00012014678,0.00076934654,0.00007392037,0.00006561284,0.00021054775,0.002225049,0.00006310977,0.0012596811,0.10227194,0.019175436,0.87376416],"study_design_scores_gemma":[0.0001697521,0.00017089899,0.010522293,0.00009568769,0.000010726335,0.00012179789,0.00006308794,0.9148201,0.001044251,0.054329395,0.018118652,0.00053336076],"about_ca_topic_score_codex":0.00012465985,"about_ca_topic_score_gemma":0.000060939194,"teacher_disagreement_score":0.9507287,"about_ca_system_score_codex":0.00008939435,"about_ca_system_score_gemma":0.00011852148,"threshold_uncertainty_score":0.73718786},"labels":[],"label_agreement":null},{"id":"W4399740412","doi":"10.22331/q-2024-06-17-1373","title":"Sample-optimal classical shadows for pure states","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Sample (material); Mathematics; Statistical physics; Physics; Thermodynamics","score_opus":0.027816831954755712,"score_gpt":0.28916758940685106,"score_spread":0.26135075745209535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399740412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015699334,0.0005492982,0.97296673,0.0074368855,0.0019351775,0.00037686698,0.00006666215,0.00084750884,0.00012155127],"genre_scores_gemma":[0.67179173,0.000024323528,0.3260038,0.0005755446,0.000901707,0.00017621525,0.000049084618,0.000049488735,0.00042812715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805456,0.00005840781,0.00029708,0.00076833926,0.00030701573,0.00051456713],"domain_scores_gemma":[0.99788266,0.0012483946,0.000033309312,0.0005948287,0.00009045578,0.00015033352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004382534,0.00021075213,0.00023671787,0.00010990989,0.00012085409,0.00057027035,0.00093802705,0.0000949986,0.00005050377],"category_scores_gemma":[0.00016313863,0.00017686804,0.00019496355,0.00041376732,0.00008790475,0.0003791786,0.00039429817,0.00022533278,0.00013894499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013572399,0.000123472,0.00009381953,0.00012530417,0.000036451722,0.00003826372,0.0008632692,0.00085857406,0.00010958622,0.86246413,0.021803524,0.11347003],"study_design_scores_gemma":[0.00011161943,0.00023702,0.0002162735,0.000016889722,0.0000067716146,0.00001586561,0.00002255526,0.73846287,0.00010300028,0.17348307,0.087142184,0.0001818968],"about_ca_topic_score_codex":0.000020170539,"about_ca_topic_score_gemma":0.000009383981,"teacher_disagreement_score":0.73760426,"about_ca_system_score_codex":0.0000883074,"about_ca_system_score_gemma":0.00014535978,"threshold_uncertainty_score":0.72124696},"labels":[],"label_agreement":null},{"id":"W4399756687","doi":"10.31219/osf.io/d8xz5","title":"How to Think Clearly about the Central Limit Theorem","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; York University","funders":"","keywords":"Limit (mathematics); Central limit theorem; Mathematical economics; Economics; Mathematics; Mathematical analysis; Statistics","score_opus":0.02596359166885027,"score_gpt":0.2520032296680267,"score_spread":0.22603963799917642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399756687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009457827,0.0010684633,0.8239165,0.12619103,0.010394166,0.0017268095,0.000023753106,0.0022026936,0.025018772],"genre_scores_gemma":[0.7876047,0.000061340965,0.19147167,0.0052508833,0.0021894786,0.00012821268,0.000008024142,0.00008766421,0.013198024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559605,0.0003073891,0.0004244759,0.0018401522,0.00089835236,0.00093360065],"domain_scores_gemma":[0.99526787,0.00044490132,0.00011636016,0.0036164531,0.00021391113,0.00034050667],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010905955,0.0005888147,0.00049218023,0.00017170084,0.00019156869,0.0052337484,0.0067408714,0.0003435382,0.0000713633],"category_scores_gemma":[0.00020046043,0.000359437,0.00048996886,0.0006049497,0.00015428591,0.00018508258,0.019967023,0.0017070759,0.0005347339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007301003,0.00010069049,0.000075763164,0.000130442,0.00012527217,0.00006831216,0.009642665,0.0019850205,0.000018228819,0.7163283,0.018949011,0.25256896],"study_design_scores_gemma":[0.00011958923,0.0001593601,0.0069609475,0.00013822211,0.000044039665,0.000040850795,0.00024559005,0.23471723,0.0002497799,0.72340405,0.032986537,0.00093377475],"about_ca_topic_score_codex":0.0002958114,"about_ca_topic_score_gemma":0.00013754264,"teacher_disagreement_score":0.77814686,"about_ca_system_score_codex":0.0002692406,"about_ca_system_score_gemma":0.00039248227,"threshold_uncertainty_score":0.99988574},"labels":[],"label_agreement":null},{"id":"W4399828161","doi":"10.1007/978-3-031-54071-4_8","title":"Continuity, Existence and Topological Properties of Optimization on the Space of Information Structures","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Space (punctuation); Topology (electrical circuits); Topological space; Mathematics; Pure mathematics; Computer science; Combinatorics","score_opus":0.019028399527663654,"score_gpt":0.20545057706411887,"score_spread":0.1864221775364552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022837487,0.011627418,0.7498029,0.0034010063,0.0052266507,0.0071655046,0.00016742999,0.00048106234,0.21984427],"genre_scores_gemma":[0.99364537,0.000032858632,0.0012926323,0.000058632537,0.0001144791,0.000030557785,0.0000025493407,0.000010878371,0.0048120306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982784,0.00009335187,0.0006680697,0.00030479545,0.0005008638,0.00015452142],"domain_scores_gemma":[0.9981761,0.0002618765,0.00055020885,0.00060598634,0.00036346304,0.00004237075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755698,0.00026696178,0.0005884995,0.00014002572,0.000057932157,0.00020286067,0.00063896243,0.00022291724,0.000008557884],"category_scores_gemma":[0.0001254993,0.00015393208,0.00011071191,0.000059699385,0.0002853361,0.0002249937,0.00028687227,0.0002520252,0.0000065841914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019374802,0.000005815701,0.000008438111,0.0003797607,0.00005730386,0.0000015028053,0.0005388382,0.0055565666,0.00003489944,0.9919287,0.00004571935,0.0014230888],"study_design_scores_gemma":[0.0010294582,0.0009906903,0.00022214027,0.0018584687,0.00014662916,0.00009064549,0.0002682765,0.8557621,0.0003202528,0.13189554,0.0067006387,0.00071515393],"about_ca_topic_score_codex":0.00008836596,"about_ca_topic_score_gemma":0.000005363322,"teacher_disagreement_score":0.9913616,"about_ca_system_score_codex":0.000053650307,"about_ca_system_score_gemma":0.00007496476,"threshold_uncertainty_score":0.6277168},"labels":[],"label_agreement":null},{"id":"W4399977710","doi":"10.1007/978-3-031-61113-1_11","title":"Sensible Set Theory","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Engineers Without Borders Canada","funders":"","keywords":"Computer science; Set (abstract data type); Programming language","score_opus":0.02681342783861498,"score_gpt":0.244581369571017,"score_spread":0.21776794173240202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399977710","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.63728e-7,0.00072914426,0.23878527,0.0007481039,0.0018884157,0.0002254039,0.000014248507,0.0010818127,0.75652665],"genre_scores_gemma":[0.00027891126,0.000038805963,0.03388569,0.0006698723,0.00045332176,0.0000047754174,0.000010494598,0.000055520326,0.9646026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974776,0.000033796452,0.00039449724,0.001206136,0.0005177283,0.00037025966],"domain_scores_gemma":[0.99747384,0.00037879776,0.00008609205,0.0017669586,0.00013765086,0.00015664863],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00066080963,0.0004860588,0.00045606733,0.0002665328,0.00007190518,0.00038674579,0.0014373447,0.0003504834,0.0011268393],"category_scores_gemma":[0.000019204861,0.0003999786,0.0003209802,0.00010017305,0.00012751346,0.0001710286,0.0020607344,0.00062478293,0.0062235487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010949392,0.0000066381763,3.40156e-7,0.000043946493,0.000051062878,0.00015835266,0.00010256037,0.000017257142,0.0000021493356,0.9522377,0.010244997,0.03713389],"study_design_scores_gemma":[0.00004007887,0.000044308807,0.0000018491999,0.000042028496,0.00001723664,0.00008020468,0.0000026561622,0.011239712,0.000022809765,0.6721366,0.31602454,0.00034795157],"about_ca_topic_score_codex":0.000012361068,"about_ca_topic_score_gemma":0.000017521725,"teacher_disagreement_score":0.30577955,"about_ca_system_score_codex":0.00013208081,"about_ca_system_score_gemma":0.00017546926,"threshold_uncertainty_score":0.9998452},"labels":[],"label_agreement":null},{"id":"W4399983709","doi":"10.1111/mila.12521","title":"How computation explains","year":2024,"lang":"en","type":"article","venue":"Mind & Language","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Universidade Federal de Santa Catarina","keywords":"Computer science; Psychology","score_opus":0.015011368275219908,"score_gpt":0.2647625777110229,"score_spread":0.249751209435803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399983709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120436214,0.0015440282,0.8712473,0.0028766221,0.0010602325,0.00016523438,0.0000076062865,0.00044748958,0.0022152762],"genre_scores_gemma":[0.9292883,0.0000017714844,0.06898941,0.00013217323,0.00028228475,0.000011283296,0.000012357483,0.0000124137205,0.0012699665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871653,0.00006797373,0.00014051753,0.00051341247,0.00028466497,0.00027689585],"domain_scores_gemma":[0.9992994,0.00014343327,0.000026849595,0.00040646447,0.000036573427,0.00008724599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025162322,0.000151439,0.00013955744,0.00014046697,0.000070081085,0.0008409827,0.0005206793,0.000057899022,0.000042523836],"category_scores_gemma":[0.00003947845,0.0001326102,0.0000894066,0.00049516716,0.00003802291,0.00048074764,0.00025935055,0.0001578113,0.00022302494],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012271634,0.00005678311,0.000052862586,0.00004785063,0.000019724166,0.0005172319,0.012950515,0.00016577315,0.0017868693,0.0060119405,0.0017096418,0.97667956],"study_design_scores_gemma":[0.00030051882,0.0001596083,0.0016120601,0.00006478922,0.000015949729,0.00017741723,0.0011940636,0.95299846,0.0055023828,0.0047414606,0.03269333,0.00053994637],"about_ca_topic_score_codex":0.00002475432,"about_ca_topic_score_gemma":0.000028829834,"teacher_disagreement_score":0.9761396,"about_ca_system_score_codex":0.000073496034,"about_ca_system_score_gemma":0.000053372256,"threshold_uncertainty_score":0.81096154},"labels":[],"label_agreement":null},{"id":"W4400372506","doi":"10.48550/arxiv.2407.12840","title":"Categorical Foundations of Formalized Condensed Mathematics","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd; Danmarks Grundforskningsfond; Agence Nationale de la Recherche","keywords":"Mathematics; Sheaf; Topological space; Hausdorff space; Generalization; Categorical variable; Pure mathematics; Category of topological spaces; Topology (electrical circuits); Space (punctuation); Simple (philosophy); Category theory; Compact-open topology; Algebra over a field; Discrete mathematics; Topological tensor product; Computer science; Mathematical analysis; Combinatorics; Functional analysis","score_opus":0.10298559458991036,"score_gpt":0.2171287319455116,"score_spread":0.11414313735560125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400372506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09992488,0.00006658871,0.892732,0.00015381927,0.0010437047,0.00043042575,0.000021405453,0.00041882598,0.00520834],"genre_scores_gemma":[0.97220576,0.000032656375,0.026444502,0.000030154286,0.00005298259,0.0000018800249,0.000016337457,0.000019158255,0.0011965813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793154,0.0001151772,0.00044088953,0.0009907694,0.00017686165,0.00034477309],"domain_scores_gemma":[0.99709785,0.00042896456,0.00030519874,0.0016788152,0.00033142095,0.00015773639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041367506,0.000338173,0.00054636976,0.0003598838,0.00009918755,0.0001613494,0.0021410617,0.00029671576,0.00008461626],"category_scores_gemma":[0.00009976054,0.00036376252,0.00038968236,0.00096107717,0.00020255701,0.00020253801,0.0053517446,0.00066010054,0.00014377541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074864297,0.00027464677,0.00013625466,0.0004228851,0.00015628367,0.00020399071,0.0008587473,0.034745842,0.000060475853,0.96217155,0.00048438623,0.00047744066],"study_design_scores_gemma":[0.00020282567,0.000032370473,0.000081090606,0.000029067356,0.00007085631,0.000012553298,0.0000443772,0.5238536,0.00012825,0.47518855,0.00013198916,0.00022446981],"about_ca_topic_score_codex":0.00011983219,"about_ca_topic_score_gemma":0.000028422714,"teacher_disagreement_score":0.8722809,"about_ca_system_score_codex":0.00029324286,"about_ca_system_score_gemma":0.00046262683,"threshold_uncertainty_score":0.99988145},"labels":[],"label_agreement":null},{"id":"W4400450434","doi":"10.1090/tran/9186","title":"One-ended spanning trees and definable combinatorics","year":2024,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Spanning tree","score_opus":0.02549517909300188,"score_gpt":0.2649860845156832,"score_spread":0.23949090542268128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400450434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045768894,0.0011446263,0.9455266,0.005365546,0.00048628924,0.00043059402,0.000026992957,0.00026714912,0.000983323],"genre_scores_gemma":[0.8845041,0.00028767038,0.11428927,0.00013143405,0.000047913523,0.00002423221,4.4388665e-7,0.000034211957,0.00068074383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718666,0.00021063264,0.000648676,0.00069306296,0.0007051435,0.0005557964],"domain_scores_gemma":[0.99710464,0.0013105584,0.000220384,0.0010501877,0.00012456415,0.00018963641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077268766,0.0003488424,0.00075878075,0.000058724607,0.00045893752,0.0003679079,0.0010871637,0.000109102875,0.00006292474],"category_scores_gemma":[0.000066992674,0.00028224287,0.0008166127,0.0019548067,0.0018457503,0.0003366744,0.00023307472,0.0007225758,0.00003346435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004320566,0.005236905,0.00041203812,0.0070331097,0.0026282384,0.000015527465,0.053719014,0.0046479446,0.0028057222,0.5882727,0.002287441,0.33289814],"study_design_scores_gemma":[0.00025385057,0.00035333695,0.0022205592,0.0004322021,0.00039619394,0.000050690385,0.0015396221,0.67833984,0.00068463956,0.3149052,0.00040466108,0.00041923064],"about_ca_topic_score_codex":0.00017046927,"about_ca_topic_score_gemma":0.000004733084,"teacher_disagreement_score":0.83873516,"about_ca_system_score_codex":0.0002047669,"about_ca_system_score_gemma":0.00022121033,"threshold_uncertainty_score":0.999963},"labels":[],"label_agreement":null},{"id":"W4400804889","doi":"10.4309/yhjt7003","title":"Non-mathematical dimensions of randomness: Implications for problem gambling","year":2024,"lang":"en","type":"article","venue":"Journal of Gambling Issues","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Randomness; Humanities; Mathematical economics; Psychology; Mathematics; Statistics; Philosophy","score_opus":0.09604393605751715,"score_gpt":0.3864205326316297,"score_spread":0.2903765965741125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400804889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025460025,0.0027782593,0.9647487,0.0057989242,0.0005865666,0.0003826345,0.000004054961,0.00008703285,0.0001538222],"genre_scores_gemma":[0.51272684,0.0001203835,0.48668528,0.000029047345,0.00032801717,0.000015644544,6.273987e-7,0.000016507187,0.00007761895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979815,0.000052160987,0.0010431897,0.0002785601,0.00037158656,0.0002730156],"domain_scores_gemma":[0.9969206,0.0013906199,0.00033767405,0.00043025796,0.00078962184,0.00013126807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019192415,0.00016976421,0.0005484722,0.00040154968,0.00011066814,0.00025722393,0.0008220853,0.00007700353,0.000008241973],"category_scores_gemma":[0.0004511382,0.000115558,0.0003699323,0.00065808714,0.000070288275,0.00054859626,0.00020153115,0.00024136568,0.000007612911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003691532,0.0035299072,0.0019904722,0.0059165135,0.0016265137,0.00014688815,0.033462115,0.032503072,0.09489665,0.45757446,0.015326684,0.35265756],"study_design_scores_gemma":[0.0016772979,0.00076389377,0.0005565451,0.0017059337,0.00017280833,0.00048794667,0.0002003,0.42515123,0.008064454,0.5516321,0.009198418,0.00038906396],"about_ca_topic_score_codex":0.0000036974839,"about_ca_topic_score_gemma":0.0000010025726,"teacher_disagreement_score":0.48726684,"about_ca_system_score_codex":0.000056672678,"about_ca_system_score_gemma":0.00020908086,"threshold_uncertainty_score":0.47123185},"labels":[],"label_agreement":null},{"id":"W4400805020","doi":"10.4309/zwuh8188","title":"Non-mathematical dimensions of randomness: Implications for problem gambling","year":2024,"lang":"en","type":"article","venue":"Journal of Gambling Issues","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Randomness; Psychology; Humanities; Mathematics; Statistics; Philosophy","score_opus":0.09604393605751715,"score_gpt":0.3864205326316297,"score_spread":0.2903765965741125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400805020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025460025,0.0027782593,0.9647487,0.0057989242,0.0005865666,0.0003826345,0.000004054961,0.00008703285,0.0001538222],"genre_scores_gemma":[0.51272684,0.0001203835,0.48668528,0.000029047345,0.00032801717,0.000015644544,6.273987e-7,0.000016507187,0.00007761895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979815,0.000052160987,0.0010431897,0.0002785601,0.00037158656,0.0002730156],"domain_scores_gemma":[0.9969206,0.0013906199,0.00033767405,0.00043025796,0.00078962184,0.00013126807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019192415,0.00016976421,0.0005484722,0.00040154968,0.00011066814,0.00025722393,0.0008220853,0.00007700353,0.000008241973],"category_scores_gemma":[0.0004511382,0.000115558,0.0003699323,0.00065808714,0.000070288275,0.00054859626,0.00020153115,0.00024136568,0.000007612911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003691532,0.0035299072,0.0019904722,0.0059165135,0.0016265137,0.00014688815,0.033462115,0.032503072,0.09489665,0.45757446,0.015326684,0.35265756],"study_design_scores_gemma":[0.0016772979,0.00076389377,0.0005565451,0.0017059337,0.00017280833,0.00048794667,0.0002003,0.42515123,0.008064454,0.5516321,0.009198418,0.00038906396],"about_ca_topic_score_codex":0.0000036974839,"about_ca_topic_score_gemma":0.0000010025726,"teacher_disagreement_score":0.48726684,"about_ca_system_score_codex":0.000056672678,"about_ca_system_score_gemma":0.00020908086,"threshold_uncertainty_score":0.47123185},"labels":[],"label_agreement":null},{"id":"W4401444364","doi":"10.1007/s10967-024-09621-4","title":"11 ICI: some related papers","year":2024,"lang":"en","type":"article","venue":"Journal of Radioanalytical and Nuclear Chemistry","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nuclear Laboratories; University of Saskatchewan","funders":"","keywords":"Chemistry","score_opus":0.005930276298703681,"score_gpt":0.21095804742074292,"score_spread":0.20502777112203924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401444364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91649216,0.011502753,0.0060427175,0.0348179,0.0019177711,0.00014149872,0.0000058958135,0.00050736667,0.028571915],"genre_scores_gemma":[0.9925683,0.00020991132,0.0057652327,0.00020703947,0.00039937272,1.9342703e-7,2.642038e-7,0.000017069204,0.0008326106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986386,0.000027974625,0.00045108015,0.0002852325,0.00036414666,0.00023298543],"domain_scores_gemma":[0.99912643,0.00017523528,0.0000865838,0.0002485188,0.00006529628,0.0002979596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004269048,0.00014949069,0.00029900114,0.000059319882,0.00006136482,0.0002745991,0.0005317063,0.000119467564,0.00021655054],"category_scores_gemma":[0.000109116394,0.00011355246,0.00022866286,0.00029770262,0.00015321228,0.00035749344,0.0001927652,0.00049247843,0.000019462737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017795363,0.0014818263,0.0015291834,0.0023904883,0.002654846,0.014051867,0.0046589826,0.0006435046,0.14944832,0.3296183,0.040708102,0.4526366],"study_design_scores_gemma":[0.00136002,0.00043526123,0.0020097825,0.00045836798,0.00032687894,0.014005002,0.00023155827,0.67325354,0.0029916165,0.057763085,0.24622382,0.00094104384],"about_ca_topic_score_codex":0.0000017998731,"about_ca_topic_score_gemma":8.724662e-8,"teacher_disagreement_score":0.67261004,"about_ca_system_score_codex":0.000086801316,"about_ca_system_score_gemma":0.00007952819,"threshold_uncertainty_score":0.4630535},"labels":[],"label_agreement":null},{"id":"W4401974444","doi":"10.20944/preprints202408.1184.v1","title":"Evaluating Kolmogorov–Arnold Networks for Scientific Discovery: A Simple Yet Effective Approach","year":2024,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Scientific discovery; Computer science; Data science; Psychology; Cognitive science; Epistemology; Philosophy","score_opus":0.17303312977927823,"score_gpt":0.39443974270249493,"score_spread":0.2214066129232167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401974444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30065876,0.0006663236,0.68198556,0.00029322586,0.0073614614,0.006023818,0.00008429079,0.001167678,0.0017588908],"genre_scores_gemma":[0.94591856,0.000008355147,0.048088834,0.000090222,0.0008005039,0.0035823896,0.00019242971,0.00011669543,0.0012020057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896375,0.0008094574,0.0011640334,0.005730368,0.0012887071,0.0013699578],"domain_scores_gemma":[0.9915634,0.0014734631,0.00060440646,0.0053884406,0.00064753316,0.0003227834],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.008219894,0.0010279156,0.0011936446,0.00050953246,0.0006156044,0.0019600105,0.0050930623,0.000660895,0.0000373246],"category_scores_gemma":[0.0015153359,0.0010052797,0.0009637301,0.0012464641,0.00041232383,0.0005763284,0.029012049,0.0022960093,0.00034032916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013986856,0.0015570179,0.03212546,0.0039230743,0.0010840143,0.000041959476,0.007235939,0.7939853,0.0021171307,0.030493833,0.0012683052,0.12602809],"study_design_scores_gemma":[0.0004327727,0.000095605836,0.0126004275,0.00022545285,0.00013132495,0.000016587592,0.000039460036,0.82832044,0.0014164471,0.15504874,0.0007603839,0.0009123393],"about_ca_topic_score_codex":0.00016420765,"about_ca_topic_score_gemma":0.000023144074,"teacher_disagreement_score":0.6452598,"about_ca_system_score_codex":0.00084392016,"about_ca_system_score_gemma":0.0008167494,"threshold_uncertainty_score":0.99923974},"labels":[],"label_agreement":null},{"id":"W4401981831","doi":"10.1007/s11098-024-02149-z","title":"A Lewisian regularity theory","year":2024,"lang":"en","type":"article","venue":"Philosophical Studies","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Ludwig-Maximilians-Universität München; Universität Hamburg","keywords":"Philosophy of language; Philosophy of mind; Metaphysics; Philosophy; Epistemology; Linguistics","score_opus":0.07454196178682637,"score_gpt":0.3380501252335055,"score_spread":0.26350816344667916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401981831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006843878,0.06194261,0.5860763,0.3206061,0.004523169,0.0006337641,0.00001179504,0.0036864895,0.015675846],"genre_scores_gemma":[0.9838033,0.00016514387,0.014093174,0.0008197508,0.0009161779,0.00004361119,8.120636e-7,0.0000150752385,0.00014298283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775916,0.00023330467,0.00031063252,0.00084618357,0.00045131842,0.00039937336],"domain_scores_gemma":[0.99806225,0.0009228479,0.000029121808,0.0007316956,0.00012589626,0.0001282053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010434923,0.00025134697,0.00036063508,0.00010788349,0.00023935233,0.0002487558,0.00094535656,0.00008710049,0.000019076027],"category_scores_gemma":[0.0004254785,0.00018910276,0.00018858768,0.00068530557,0.0003716419,0.00034444974,0.0015087028,0.0003921966,0.00022643278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038649337,0.00006734956,0.000051655337,0.00007387636,0.00013411614,0.00011425124,0.00073328207,0.00001014056,0.000019140902,0.94456095,0.00046324605,0.05376813],"study_design_scores_gemma":[0.00008808854,0.00009668475,0.0007612922,0.000048590082,0.000018307579,0.000038077324,0.000025910977,0.010672764,0.000065496635,0.98338777,0.0045660282,0.00023099709],"about_ca_topic_score_codex":0.000004712521,"about_ca_topic_score_gemma":0.0000031991574,"teacher_disagreement_score":0.9769594,"about_ca_system_score_codex":0.00012862305,"about_ca_system_score_gemma":0.000049479975,"threshold_uncertainty_score":0.77113867},"labels":[],"label_agreement":null},{"id":"W4402028594","doi":"","title":"Unified Mathematical Framework: Integrating Classical Set Theory with Surreal Mathematics","year":2024,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Set (abstract data type); Set theory; Mathematics; Computer science; Mathematical economics; Calculus (dental)","score_opus":0.020850656500844424,"score_gpt":0.25560615740166076,"score_spread":0.23475550090081634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402028594","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011857844,0.00039280133,0.9352226,0.011068817,0.00043234942,0.0007390832,0.0000442945,0.0012017254,0.03904045],"genre_scores_gemma":[0.25067487,0.000038524708,0.74611425,0.00009262014,0.0000622229,0.00011742488,0.000086381224,0.000082910214,0.0027308178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895353,0.005776734,0.00107821,0.0017494041,0.0011196743,0.0007406827],"domain_scores_gemma":[0.98243093,0.009691896,0.00058752415,0.0050361156,0.0018806219,0.00037292877],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.011551924,0.000760352,0.00089889707,0.00032213185,0.00035588362,0.0020401226,0.004415097,0.00064882805,0.00012751736],"category_scores_gemma":[0.0037146094,0.0006262551,0.00037814598,0.0009823511,0.00062305847,0.0002026664,0.008556354,0.0029199685,0.00019127682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054912703,0.00057865604,0.000054980268,0.00054635457,0.000108227294,0.000031043288,0.01727969,0.00007677167,0.00004395801,0.9459134,0.00025320917,0.035108257],"study_design_scores_gemma":[0.00015719049,0.0000013734721,0.000085519685,0.003369356,0.000058115827,0.00006460261,0.0002694847,0.34645593,0.0013282944,0.64726794,0.0004201488,0.00052202755],"about_ca_topic_score_codex":0.00009290824,"about_ca_topic_score_gemma":0.00022212397,"teacher_disagreement_score":0.34637916,"about_ca_system_score_codex":0.00029363873,"about_ca_system_score_gemma":0.0007871408,"threshold_uncertainty_score":0.9996189},"labels":[],"label_agreement":null},{"id":"W4402205374","doi":"10.1007/978-3-031-71112-1_3","title":"Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor","funders":"","keywords":"Golden ratio; Computer science; Representation (politics); Quadratic equation; Automaton; Base (topology); Finite-state machine; Algorithm; Discrete mathematics; Combinatorics; Theoretical computer science; Mathematics; Geometry; Mathematical analysis","score_opus":0.05898430741353069,"score_gpt":0.3065921163709754,"score_spread":0.2476078089574447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402205374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006034956,0.00028109268,0.9912436,0.00410697,0.0020001624,0.0009973117,0.00001598823,0.00010825349,0.0006431276],"genre_scores_gemma":[0.29234362,0.000010464198,0.70069164,0.005423661,0.00085359905,0.000028149148,0.0000035884539,0.00006968081,0.0005756035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960678,0.00014426035,0.0007334072,0.0014174598,0.0012388212,0.00039823365],"domain_scores_gemma":[0.9954983,0.0017319772,0.00034009287,0.0020340378,0.00028743304,0.00010818924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013397768,0.0004422032,0.00048569505,0.00044736697,0.00035048657,0.000890957,0.003255725,0.00016883535,0.00001258943],"category_scores_gemma":[0.00023554977,0.00028168692,0.00015266538,0.0013862336,0.000828362,0.00039634563,0.0032210848,0.00054337666,0.000015929128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061131004,0.000045648525,0.00031568468,0.00012345811,0.000043757555,0.000021568745,0.0044684885,0.7548324,0.0006417547,0.106285095,0.00007237959,0.13314365],"study_design_scores_gemma":[0.000099515164,0.00006209307,0.0005224397,0.0003075198,0.000015563668,0.000050101724,6.7132913e-7,0.8380084,0.0006734443,0.15971194,0.0002754076,0.00027287882],"about_ca_topic_score_codex":0.0001117742,"about_ca_topic_score_gemma":0.0002028433,"teacher_disagreement_score":0.29174012,"about_ca_system_score_codex":0.0002104482,"about_ca_system_score_gemma":0.00051897747,"threshold_uncertainty_score":0.9999635},"labels":[],"label_agreement":null},{"id":"W4402322000","doi":"10.56827/jrsmms.2024.1102.1","title":"AN OVERVIEW OF RECENT DEVELOPMENTS IN FUNCTIONS OF MATRIX ARGUMENT","year":2022,"lang":"en","type":"article","venue":"JOURNAL OF RAMANUJAN SOCIETY OF MATHEMATICS AND MATHEMATICAL SCIENCES","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Argument (complex analysis); Matrix (chemical analysis); Computer science; Epistemology; Philosophy; Chemistry","score_opus":0.08644679064857061,"score_gpt":0.3463811356665314,"score_spread":0.25993434501796076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402322000","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7229854,0.0012425017,0.2735057,0.0011606665,0.00021759626,0.00038794876,0.0000088405595,0.000013240074,0.00047812716],"genre_scores_gemma":[0.26058993,0.0004744144,0.73886126,0.000036371082,0.000011759578,0.0000053129197,2.5414747e-7,0.0000049099126,0.000015759957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687356,0.00010493196,0.001366924,0.00020399211,0.001231194,0.00021939684],"domain_scores_gemma":[0.99775964,0.0004863985,0.0011462157,0.00027457767,0.00022460333,0.00010859079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048813247,0.00013872478,0.0006399395,0.00013808071,0.00013657297,0.000041643423,0.0010646965,0.000039929226,0.00010859507],"category_scores_gemma":[0.0001174756,0.00010466611,0.00020373323,0.00084297033,0.00035899333,0.00030294346,0.00052530435,0.00018725618,4.7397577e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003641219,0.019560518,0.0057043275,0.007615521,0.00044486654,0.000015564488,0.08417742,0.007826093,0.011806368,0.759672,0.0014001423,0.101740755],"study_design_scores_gemma":[0.0014992148,0.0028610202,0.0034743377,0.0006596117,0.00008561652,0.00031289973,0.021044165,0.24404399,0.003253662,0.72147256,0.00083349843,0.00045941395],"about_ca_topic_score_codex":0.0000052794326,"about_ca_topic_score_gemma":0.0000011116832,"teacher_disagreement_score":0.46535558,"about_ca_system_score_codex":0.00007644111,"about_ca_system_score_gemma":0.0002422906,"threshold_uncertainty_score":0.42681602},"labels":[],"label_agreement":null},{"id":"W4402366533","doi":"10.22331/q-2024-09-09-1464","title":"A Theory of Inaccessible Information","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Generalitat de Catalunya","keywords":"Computer science","score_opus":0.018079751096037374,"score_gpt":0.2603253442539799,"score_spread":0.24224559315794253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402366533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030398495,0.00041507976,0.9620761,0.0004373783,0.0009990319,0.00010473767,0.0000027952851,0.00033014413,0.005236194],"genre_scores_gemma":[0.9891582,0.00000786359,0.010634692,0.00008978659,0.00003947684,0.0000076098772,0.0000018570984,0.0000032138782,0.000057297002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991991,0.00005936626,0.00024276617,0.00014953598,0.000207669,0.00014157356],"domain_scores_gemma":[0.9992776,0.0001918447,0.00004461312,0.00038280926,0.00006711678,0.00003603708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005842399,0.00007563749,0.00010496641,0.00015826129,0.00003145959,0.00018881103,0.0005887113,0.000037738137,0.000034828296],"category_scores_gemma":[0.000064845095,0.00006186491,0.000056029843,0.0005674609,0.000041401683,0.0013976224,0.00027448568,0.0000941518,0.00016481908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001859165,0.00001739617,0.000073343705,0.000085260566,0.0000063312546,0.0000028170143,0.00096248573,0.000053410982,0.000052872594,0.8238116,0.00050043827,0.1744322],"study_design_scores_gemma":[0.0000655457,0.000082247345,0.0021842688,0.000038322047,0.0000032982678,0.000010401021,0.000049857357,0.5666386,0.00093868945,0.4215045,0.008388324,0.000095953204],"about_ca_topic_score_codex":0.000018541443,"about_ca_topic_score_gemma":9.218884e-7,"teacher_disagreement_score":0.9587597,"about_ca_system_score_codex":0.00003133762,"about_ca_system_score_gemma":0.00009672847,"threshold_uncertainty_score":0.2522778},"labels":[],"label_agreement":null},{"id":"W4402683716","doi":"10.1007/s00283-024-10378-7","title":"Abelian Groups Are Easier","year":2024,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Abelian group; Mathematics; Pure mathematics; Algebra over a field","score_opus":0.03752561324580689,"score_gpt":0.29226418845347035,"score_spread":0.25473857520766346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402683716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003331125,0.0008987368,0.97746825,0.0064649275,0.0007157856,0.00033864798,0.0000018587839,0.0006863855,0.010094287],"genre_scores_gemma":[0.9474414,0.000039912276,0.046467215,0.0008724731,0.0004744459,0.000103896775,7.615283e-7,0.00003928804,0.0045606266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978948,0.00012044101,0.0004194142,0.00054832624,0.00051541254,0.0005015782],"domain_scores_gemma":[0.99752516,0.0010279592,0.000047343543,0.0011653614,0.00009158501,0.00014256817],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010678006,0.00023804644,0.00025638117,0.000096763266,0.0001552521,0.0007140022,0.001996499,0.000086264554,0.0008292178],"category_scores_gemma":[0.00023265352,0.00013537878,0.00019382322,0.0008630366,0.00025513637,0.0003243887,0.0008655362,0.0003776735,0.0048927893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016353474,0.00009220866,0.000010336876,0.000137551,0.000032772354,0.00005838248,0.0025811498,0.000045283716,0.000028125807,0.94830513,0.002271056,0.046436366],"study_design_scores_gemma":[0.000015143292,0.000039472252,0.00007163569,0.00009200331,0.000012452364,0.00007509915,0.00016375883,0.29729223,0.0007134832,0.6961275,0.005225359,0.00017186516],"about_ca_topic_score_codex":0.000009536118,"about_ca_topic_score_gemma":0.000002875644,"teacher_disagreement_score":0.9441103,"about_ca_system_score_codex":0.0000815463,"about_ca_system_score_gemma":0.000049393682,"threshold_uncertainty_score":0.99588203},"labels":[],"label_agreement":null},{"id":"W4402704582","doi":"10.1109/cvpr52733.2024.00572","title":"Permutation Equivariance of Transformers and its Applications","year":2024,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science and Technology Major Project","keywords":"Permutation (music); Transformer; Computer science; Mathematics; Engineering; Electrical engineering; Physics","score_opus":0.014507082861334477,"score_gpt":0.26819064870091375,"score_spread":0.2536835658395793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402704582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033243592,0.00064454635,0.9886302,0.0013396346,0.00009696135,0.00023639831,0.0000020455786,0.00018206159,0.0055438047],"genre_scores_gemma":[0.96184736,0.00003466837,0.03781522,0.00004346463,0.000024798424,0.000034481327,0.0000011692367,0.0000034497286,0.00019540986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933773,0.000016933493,0.0001487046,0.00026917874,0.00012551495,0.000101964215],"domain_scores_gemma":[0.99961454,0.00013658873,0.000014142871,0.00014217128,0.000051775296,0.000040774772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017379857,0.00006225202,0.00007681175,0.00006312975,0.000034506877,0.00007115902,0.00021231255,0.000026493206,0.00002787615],"category_scores_gemma":[0.0000086318505,0.000054015654,0.000029847977,0.0003976476,0.00002871686,0.00033762638,0.00005697491,0.00004997501,0.000026680846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.533637e-7,0.000022472026,0.000013488185,0.000099661425,0.000008007265,0.0000013432262,0.0006104924,0.000107526605,0.0022566812,0.57737106,0.000022624989,0.41948608],"study_design_scores_gemma":[0.000084301246,0.00005296103,0.0007814584,0.000013875208,0.0000065840327,0.000024841907,0.00003101597,0.9467201,0.0041360944,0.044482317,0.0035553551,0.00011104544],"about_ca_topic_score_codex":0.000009171158,"about_ca_topic_score_gemma":0.0000035427315,"teacher_disagreement_score":0.958523,"about_ca_system_score_codex":0.000018036519,"about_ca_system_score_gemma":0.000048854854,"threshold_uncertainty_score":0.22026946},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.021873410669854893,"score_gpt":0.3505455981938253,"score_spread":0.3286721875239704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402901095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104103446,0.00011254253,0.8859581,0.0067622755,0.0011407307,0.00096461613,0.000038911512,0.0005477767,0.00037164585],"genre_scores_gemma":[0.8539098,5.0602637e-7,0.14341927,0.0020007151,0.0002010962,0.0003087019,0.000027244763,0.000022816928,0.00010985727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674743,0.00010127807,0.00042884515,0.001232571,0.0009167614,0.00057310454],"domain_scores_gemma":[0.99499416,0.0036603827,0.00005521404,0.00035515885,0.0007356123,0.00019944516],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015198888,0.00026744572,0.00023923028,0.000368287,0.0005546501,0.0011943142,0.0011513288,0.00008777003,0.000098313736],"category_scores_gemma":[0.0010711824,0.0002576248,0.00019335616,0.0012785532,0.0010568646,0.0009591837,0.00061931903,0.000293309,0.00017705487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001032168,0.00015038492,0.0001626832,0.000020722537,0.000010096532,0.000059188078,0.0006175062,0.0006154603,0.00030035214,0.7700093,0.00046061454,0.2275834],"study_design_scores_gemma":[0.00039667162,0.00028898127,0.008206874,0.00009280976,0.00003359085,0.00020826668,0.000035634454,0.6272821,0.00055592856,0.36168656,0.0008143471,0.00039825236],"about_ca_topic_score_codex":0.000004336356,"about_ca_topic_score_gemma":5.651843e-7,"teacher_disagreement_score":0.74980634,"about_ca_system_score_codex":0.00023179421,"about_ca_system_score_gemma":0.0011581101,"threshold_uncertainty_score":0.9999876},"labels":[],"label_agreement":null},{"id":"W4403062981","doi":"10.1007/s10710-024-09495-1","title":"Leonardo Vanneschi and Sara Silva: lectures on intelligent systems","year":2024,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.010466178199304059,"score_gpt":0.23879963516277397,"score_spread":0.2283334569634699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403062981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21591279,0.10879396,0.66790473,0.0016376933,0.0030544994,0.0009638996,0.0000054384655,0.0012668996,0.00046011165],"genre_scores_gemma":[0.9485453,0.0002514295,0.050472923,0.00007152222,0.00030559648,0.00007236469,0.0000031274012,0.000025132767,0.0002526204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997898,0.000111011075,0.00031363752,0.00089183974,0.0003068249,0.00047868097],"domain_scores_gemma":[0.9989881,0.00024302719,0.00004296588,0.0004839745,0.00005858345,0.00018333395],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042954265,0.00032410317,0.00030038113,0.00019318116,0.0002437679,0.0013508112,0.00042068338,0.00009427086,0.0000048447314],"category_scores_gemma":[0.000049250466,0.0002484457,0.000069055175,0.00040617617,0.00011423725,0.00012823862,0.00039952178,0.00023779135,0.000021465756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066159673,0.00006157471,0.0019207479,0.0003374157,0.000045146786,0.000049690905,0.0007111489,0.0036528562,0.00007124648,0.0038689903,0.00022394938,0.9890506],"study_design_scores_gemma":[0.00015831168,0.00055183086,0.00339725,0.00016293912,0.000029430543,0.00029658084,0.000067697234,0.95688516,0.00013946119,0.007457917,0.030411365,0.00044206428],"about_ca_topic_score_codex":0.0003278368,"about_ca_topic_score_gemma":0.000022910972,"teacher_disagreement_score":0.98860854,"about_ca_system_score_codex":0.00003973307,"about_ca_system_score_gemma":0.00004527395,"threshold_uncertainty_score":0.9999968},"labels":[],"label_agreement":null},{"id":"W4403113917","doi":"10.4171/qt/222","title":"Persistence $K$-theory","year":2024,"lang":"en","type":"article","venue":"Quantum Topology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Persistence (discontinuity); Mathematics; Pure mathematics; Algebra over a field; Geology","score_opus":0.029788029592242637,"score_gpt":0.2728770514980518,"score_spread":0.24308902190580917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403113917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019047664,0.0028933228,0.9581961,0.0071849436,0.004794567,0.00013548622,0.0000026415353,0.0010309698,0.0067143263],"genre_scores_gemma":[0.9810703,0.000026038837,0.0169834,0.00062442344,0.00023888961,0.000015930109,0.0000013614305,0.000012747606,0.0010269092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981855,0.00024780372,0.00023333836,0.0007136109,0.00018025344,0.00043949627],"domain_scores_gemma":[0.99844706,0.00061906874,0.000027960023,0.00074940646,0.00005214441,0.00010434505],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006731045,0.0001663974,0.00020735404,0.00016299375,0.00011102523,0.00015620576,0.0011532964,0.00011282868,0.000257249],"category_scores_gemma":[0.00011582731,0.00014737881,0.00013450687,0.00047636122,0.0002902909,0.00027464135,0.0004993333,0.00025335362,0.0008369403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026166904,0.000032502787,0.00007742579,0.000023846922,0.000016730553,0.0001456755,0.00077827467,0.000028132452,0.00015774077,0.9459266,0.0009802498,0.051830184],"study_design_scores_gemma":[0.00008352181,0.00023311067,0.0007847008,0.000013928881,0.00000927894,0.00035282067,0.00011428215,0.3275907,0.00024288092,0.6394346,0.030897262,0.00024294094],"about_ca_topic_score_codex":0.000027417353,"about_ca_topic_score_gemma":0.000007860733,"teacher_disagreement_score":0.96202266,"about_ca_system_score_codex":0.00008213926,"about_ca_system_score_gemma":0.0001301941,"threshold_uncertainty_score":0.99994105},"labels":[],"label_agreement":null},{"id":"W4403305266","doi":"10.1017/9781009302180.043","title":"Asymptotic Growth","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Environmental science","score_opus":0.01830562135891189,"score_gpt":0.18989382926885331,"score_spread":0.17158820790994142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305266","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012399616,0.0003272101,0.054923106,0.00010626419,0.0014362461,0.0004589159,0.00008554522,0.001044477,0.9416058],"genre_scores_gemma":[0.00076432625,0.0000473192,0.0029517617,0.00010173762,0.0002743066,9.115386e-7,0.000014656799,0.000058977534,0.995786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971481,0.000048910344,0.00029628156,0.0014291581,0.0005732269,0.00050430297],"domain_scores_gemma":[0.9975149,0.00017692776,0.00017713544,0.0015255515,0.0002950535,0.0003104195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019669252,0.0006231439,0.0005809127,0.00040497395,0.0001958077,0.0003088852,0.002786765,0.0004601917,0.0000056360627],"category_scores_gemma":[0.000014309712,0.0007138509,0.0004574073,0.000036711383,0.00029035922,0.00024421833,0.0033666396,0.00088224106,0.00024652996],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006844785,0.000012183874,8.441475e-7,0.00015109629,0.00012798034,0.001015946,0.000056577468,0.000005641747,0.000005492042,0.97930205,0.016532604,0.0027827222],"study_design_scores_gemma":[0.00034702354,0.00012019481,0.00001861746,0.00022062262,0.00019138957,0.000109299486,0.0000060252755,0.00747087,0.00012454309,0.0034217522,0.9869621,0.0010076062],"about_ca_topic_score_codex":0.00010262795,"about_ca_topic_score_gemma":0.0000018983108,"teacher_disagreement_score":0.9758803,"about_ca_system_score_codex":0.0004996016,"about_ca_system_score_gemma":0.0002336555,"threshold_uncertainty_score":0.99953127},"labels":[],"label_agreement":null},{"id":"W4403305666","doi":"10.1017/9781009302180.041","title":"Time Complexity","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science","score_opus":0.03530276201629187,"score_gpt":0.20724205297323908,"score_spread":0.1719392909569472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305666","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017382223,0.00022385943,0.02613538,0.00011640117,0.0008851869,0.0005062244,0.00022682738,0.0012283892,0.9706603],"genre_scores_gemma":[0.00012096531,0.00001692865,0.0047977497,0.00009378283,0.00024182408,6.7861333e-7,0.000032858094,0.000051636594,0.99464357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99719036,0.00005838484,0.00030164854,0.0014005093,0.00055904,0.00049003697],"domain_scores_gemma":[0.99732256,0.0001528719,0.00018838914,0.0017877017,0.00023885282,0.0003096531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021973149,0.0006168276,0.0006531731,0.00032009085,0.00022947742,0.000264757,0.0028369,0.00043343427,0.00001932669],"category_scores_gemma":[0.000008539553,0.0007169002,0.00046282925,0.000031541254,0.0006560064,0.00021562658,0.003992073,0.0008705798,0.0007134699],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009350729,0.000014027887,1.4892467e-7,0.00009197418,0.00011759439,0.0007226859,0.000057667276,0.000008022897,0.000010128108,0.9609089,0.0347408,0.0033187023],"study_design_scores_gemma":[0.0002591367,0.00008121198,0.000008005046,0.00013040965,0.000111946814,0.000072069735,0.0000036140477,0.022856096,0.00006111351,0.0025444017,0.97308856,0.00078345486],"about_ca_topic_score_codex":0.000087281005,"about_ca_topic_score_gemma":0.0000020842308,"teacher_disagreement_score":0.9583645,"about_ca_system_score_codex":0.0004894782,"about_ca_system_score_gemma":0.00020717489,"threshold_uncertainty_score":0.9995282},"labels":[],"label_agreement":null},{"id":"W4403324132","doi":"10.48550/arxiv.2410.05240","title":"Vizing's Theorem in Near-Linear Time","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; Simons Institute for the Theory of Computing, University of California Berkeley; United States-Israel Binational Science Foundation; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Economics","score_opus":0.05011162665424287,"score_gpt":0.1885628265528209,"score_spread":0.13845119989857801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403324132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5773588,0.0003147932,0.40058717,0.0007145925,0.0023380124,0.00084740284,0.00003054952,0.0015037693,0.016304944],"genre_scores_gemma":[0.98677886,0.000035012625,0.0106286025,0.00011105719,0.00015501863,0.0000014881728,0.000010558109,0.000035907324,0.0022435093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653107,0.00029377715,0.00034356685,0.002069778,0.00017291999,0.0005888874],"domain_scores_gemma":[0.9971904,0.0002678446,0.00015612363,0.0020436407,0.00013892353,0.0002030358],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00074015604,0.0004880493,0.0005433428,0.0004232003,0.00011320213,0.00034501994,0.0032788492,0.0004197546,0.000104887295],"category_scores_gemma":[0.00006689716,0.00054369145,0.0003438589,0.0014629685,0.00024760267,0.00025109746,0.009961132,0.0014308686,0.0016364226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003972127,0.00039764668,0.0019591309,0.00030455305,0.00014930268,0.0035249097,0.001375834,0.569892,0.000046666504,0.41137594,0.00067454,0.010259753],"study_design_scores_gemma":[0.00019548212,0.00003805791,0.0006018277,0.00009128732,0.000022548835,0.0000076976685,0.000012850799,0.70687175,0.000035117333,0.2911484,0.00056586723,0.0004090864],"about_ca_topic_score_codex":0.000250996,"about_ca_topic_score_gemma":0.00005278824,"teacher_disagreement_score":0.40942007,"about_ca_system_score_codex":0.00051963935,"about_ca_system_score_gemma":0.00048363008,"threshold_uncertainty_score":0.99970144},"labels":[],"label_agreement":null},{"id":"W4403712557","doi":"10.1142/s021819672450053x","title":"LEF-groups and computability of reversible endomorphisms of symbolic varieties","year":2024,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Endomorphism; Mathematics; Computability; Pure mathematics; Discrete mathematics; Algebra over a field","score_opus":0.012361142524401288,"score_gpt":0.2646042031679031,"score_spread":0.2522430606435018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403712557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47633037,0.0010641611,0.52077824,0.0007659302,0.0008884694,0.00006407229,0.0000048123925,0.00001960719,0.00008436451],"genre_scores_gemma":[0.9706508,0.00010768228,0.029058482,0.00004273536,0.00012338115,7.333883e-7,0.0000024646665,0.0000058801165,0.000007847085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823505,0.000114426446,0.0007117004,0.00023578889,0.00059440616,0.00010863546],"domain_scores_gemma":[0.99807245,0.0006132083,0.0003636888,0.00011559359,0.00076067337,0.00007440062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007248784,0.00013174351,0.00032129095,0.00036081747,0.00003344036,0.00015369075,0.0004684129,0.00005587043,0.000009335984],"category_scores_gemma":[0.00008294779,0.0001175031,0.000114984854,0.00025143632,0.00019534556,0.0006419313,0.0002880841,0.00017150945,9.44819e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020028975,0.0006242142,0.012838465,0.00056638406,0.0008561281,0.00015212261,0.01081815,0.010230539,0.005441778,0.4544774,0.00046747617,0.5033271],"study_design_scores_gemma":[0.001185872,0.0007896062,0.055500053,0.0003187788,0.0000615831,0.0010607853,0.00022267237,0.46515507,0.003789158,0.47136423,0.00030675385,0.00024543735],"about_ca_topic_score_codex":0.000028288876,"about_ca_topic_score_gemma":0.0000022344527,"teacher_disagreement_score":0.5030816,"about_ca_system_score_codex":0.000054431894,"about_ca_system_score_gemma":0.0001347534,"threshold_uncertainty_score":0.47916374},"labels":[],"label_agreement":null},{"id":"W4403939243","doi":"10.37236/12575","title":"On an Induced Version of Menger's Theorem","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Eidgenössische Technische Hochschule Zürich","keywords":"Mathematics; Calculus (dental); Medicine","score_opus":0.009243470468888243,"score_gpt":0.25249730179503244,"score_spread":0.2432538313261442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403939243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81977206,0.0030980052,0.1708047,0.0019465804,0.0025382529,0.00016510545,7.071029e-7,0.000086943386,0.0015876429],"genre_scores_gemma":[0.9995624,0.00012510833,0.000115185016,0.000053505977,0.00009519234,8.3787074e-7,2.4244858e-7,0.000012640404,0.000034889796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997906,0.0003474167,0.00042126738,0.00020239029,0.0007089395,0.00041395775],"domain_scores_gemma":[0.99820685,0.0006262658,0.00023256765,0.0005943706,0.00025267492,0.00008724925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026417803,0.00015931767,0.00026628803,0.00020387293,0.00009168574,0.00010794189,0.0017819654,0.00007069515,0.000008366633],"category_scores_gemma":[0.00009962407,0.00010129789,0.00016437421,0.0008268884,0.00005353346,0.00041215224,0.00017468452,0.0008982173,0.000010820774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002716006,0.0001895009,0.00000783916,0.000011776441,0.000053012853,0.000013609218,0.0005624604,0.00020511713,0.00076953357,0.9865064,0.00021271149,0.0114408685],"study_design_scores_gemma":[0.00037590074,0.0032880146,0.00014237428,0.000047842263,0.000026187365,0.0001353189,0.000042849068,0.02157668,0.006010992,0.9673491,0.0008874371,0.00011730036],"about_ca_topic_score_codex":0.0000046291057,"about_ca_topic_score_gemma":8.947701e-7,"teacher_disagreement_score":0.17979033,"about_ca_system_score_codex":0.0004175597,"about_ca_system_score_gemma":0.0006429133,"threshold_uncertainty_score":0.4130808},"labels":[],"label_agreement":null},{"id":"W4404340738","doi":"10.48550/arxiv.2410.21362","title":"Holographic Complexity in String and M Theory","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Holography; String theory; String (physics); Theoretical physics; Physics; Computer science; Quantum mechanics","score_opus":0.12683812749069967,"score_gpt":0.2056718110569486,"score_spread":0.07883368356624892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404340738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70306826,0.00040264693,0.29312328,0.00014596665,0.0006598967,0.0003105928,0.000011758054,0.00040550955,0.0018720791],"genre_scores_gemma":[0.9959717,0.00011943769,0.0036404724,0.000052888565,0.000048583643,0.0000010655613,0.00000393129,0.0000147832225,0.00014713807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971922,0.000373098,0.00024014043,0.0016857154,0.000094989766,0.0004138282],"domain_scores_gemma":[0.99813306,0.00030180096,0.00011277536,0.0012308654,0.00006968021,0.00015183842],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008568991,0.0003529679,0.00042056586,0.00068456534,0.00009302674,0.0002142821,0.0017068555,0.00028572732,0.000014154416],"category_scores_gemma":[0.000042792308,0.00039923168,0.0001749442,0.0011639945,0.00040403174,0.00018668077,0.009155317,0.0011981922,0.000029203382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013678942,0.00009453499,0.013910295,0.00017570943,0.000051663807,0.00077961583,0.0003672443,0.017457904,0.0000063519733,0.96305275,0.000018596567,0.0040716347],"study_design_scores_gemma":[0.00018647329,0.000028631684,0.021327995,0.00007300248,0.000019922472,0.000008982003,0.000041535455,0.29991916,0.000007650739,0.678072,0.000026119993,0.00028857362],"about_ca_topic_score_codex":0.00021706958,"about_ca_topic_score_gemma":0.00021782836,"teacher_disagreement_score":0.29290342,"about_ca_system_score_codex":0.00018704173,"about_ca_system_score_gemma":0.00013410834,"threshold_uncertainty_score":0.999846},"labels":[],"label_agreement":null},{"id":"W4404345240","doi":"10.48550/arxiv.2411.00588","title":"$α$-TCVAE: On the relationship between Disentanglement and Diversity","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Compute Canada","keywords":"Diversity (politics); Alpha (finance); Political science; Mathematics; Statistics","score_opus":0.19378765368751655,"score_gpt":0.21744586284002734,"score_spread":0.023658209152510795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404345240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84744406,0.0001414202,0.14548986,0.002411162,0.0010028569,0.0006643866,0.00006403229,0.00039781217,0.002384426],"genre_scores_gemma":[0.99850035,0.000027351096,0.0003738781,0.00008995039,0.00013311306,0.0000013606564,0.0000108226395,0.0000126801615,0.00085050514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759275,0.00031198404,0.00019513832,0.0013524604,0.00021208332,0.00033555768],"domain_scores_gemma":[0.99666923,0.0014717065,0.00013973452,0.0014547457,0.00008257455,0.00018201],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005983092,0.00034052294,0.00028388377,0.00022781976,0.0006148719,0.00033556338,0.002015079,0.00021009834,0.000016149583],"category_scores_gemma":[0.00010817484,0.00029652863,0.00018364174,0.00062636717,0.00021874126,0.00015387204,0.01934137,0.0010954039,0.00013692379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067498977,0.000055925717,0.28006887,0.00006977853,0.00008747253,0.00013734537,0.0004708176,0.0120302895,2.0636519e-7,0.7057363,0.00076296105,0.00057327957],"study_design_scores_gemma":[0.00020804028,0.00007464295,0.24734846,0.00009207978,0.00013740403,0.00000224308,0.000104459315,0.15993808,0.0000052746664,0.5913632,0.00028960162,0.00043651214],"about_ca_topic_score_codex":0.00018784482,"about_ca_topic_score_gemma":0.000022787874,"teacher_disagreement_score":0.1510563,"about_ca_system_score_codex":0.00038695216,"about_ca_system_score_gemma":0.00010589499,"threshold_uncertainty_score":0.9999487},"labels":[],"label_agreement":null},{"id":"W4404391371","doi":"10.48550/arxiv.2411.06693","title":"The structure of interval orders with no infinite antichain","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Defence Academy","keywords":"Antichain; Interval (graph theory); Mathematics; Combinatorics; Partially ordered set","score_opus":0.030086002938043106,"score_gpt":0.1770988504315671,"score_spread":0.14701284749352397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404391371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5898712,0.00013014473,0.40544716,0.0003334419,0.0018829671,0.0005032573,0.000041213436,0.00032898926,0.0014616369],"genre_scores_gemma":[0.99473304,0.0000384886,0.004566331,0.00004686824,0.00008147472,2.7682108e-7,0.0000049791524,0.000020960812,0.00050756615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978103,0.00019902886,0.0002788779,0.0011441086,0.00018443455,0.00038325015],"domain_scores_gemma":[0.9970799,0.0003417246,0.00026760704,0.001793788,0.00040081816,0.00011612997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028472222,0.00038674162,0.00040622227,0.0002232903,0.0001467074,0.0002324313,0.0030373756,0.00022836914,0.000019118754],"category_scores_gemma":[0.000065065375,0.0002883778,0.00021908502,0.0009666253,0.0004217155,0.0001451638,0.0060660103,0.0010301339,0.000039406972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023503289,0.00020244018,0.006605063,0.0009556883,0.00096208334,0.0008527611,0.00200757,0.4357728,0.000211958,0.54290956,0.00081141473,0.008473588],"study_design_scores_gemma":[0.0003390948,0.00020102561,0.0012688164,0.00020397789,0.00009193481,0.00001416452,0.00010136265,0.8093378,0.0001924748,0.18684314,0.00091106776,0.00049512566],"about_ca_topic_score_codex":0.0002221284,"about_ca_topic_score_gemma":0.00026966436,"teacher_disagreement_score":0.40486184,"about_ca_system_score_codex":0.0001528634,"about_ca_system_score_gemma":0.00038245646,"threshold_uncertainty_score":0.99995685},"labels":[],"label_agreement":null},{"id":"W4404492401","doi":"10.1002/jcd.21961","title":"Tic‐Tac‐Toe on Designs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; Toronto Metropolitan University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Mount Allison University","keywords":"Mathematics; Combinatorics","score_opus":0.047379995541963406,"score_gpt":0.29280148961952435,"score_spread":0.24542149407756095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404492401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015465597,0.0008819342,0.9363408,0.0025331874,0.041120175,0.0003353811,0.0000026800167,0.0003172521,0.003002998],"genre_scores_gemma":[0.97090137,0.000038230944,0.026351374,0.00021994291,0.0023060376,0.000005172412,4.4322417e-7,0.000034103763,0.00014331506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965272,0.00046249505,0.00087636756,0.00045488388,0.001188937,0.0004901097],"domain_scores_gemma":[0.9969177,0.0013628614,0.00027954488,0.00065377593,0.00044453077,0.00034156183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002225943,0.00032288965,0.0005346067,0.00049638574,0.0001464196,0.0008137757,0.001852685,0.00017370934,0.0000828303],"category_scores_gemma":[0.00040736407,0.00026254475,0.00041156277,0.0009719251,0.00010722091,0.00088702183,0.00024674117,0.0007916643,0.00018833588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087728346,0.00058181386,0.000052879543,0.000058550075,0.00015089093,0.0010772124,0.00068509585,0.0007074067,0.0024812573,0.93580544,0.017587401,0.040724296],"study_design_scores_gemma":[0.0017632564,0.005177435,0.00060006056,0.00033967156,0.0000882155,0.0006844071,0.00002439287,0.048309393,0.00866502,0.8959272,0.037752822,0.0006681423],"about_ca_topic_score_codex":0.0000047629646,"about_ca_topic_score_gemma":3.4691416e-7,"teacher_disagreement_score":0.9554358,"about_ca_system_score_codex":0.00037188374,"about_ca_system_score_gemma":0.0006677375,"threshold_uncertainty_score":0.99998266},"labels":[],"label_agreement":null},{"id":"W4404492996","doi":"10.1111/mila.12532","title":"Implementing artificial consciousness","year":2024,"lang":"en","type":"article","venue":"Mind & Language","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Killam Trusts","keywords":"Consciousness; Cognitive science; Psychology; Cognitive psychology; Computer science; Neuroscience","score_opus":0.015959883151146503,"score_gpt":0.2904943572199974,"score_spread":0.2745344740688509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404492996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52909404,0.0014983831,0.45967054,0.0013238511,0.0018099445,0.00025743048,0.000018613015,0.00059249176,0.0057347068],"genre_scores_gemma":[0.9768779,7.139599e-7,0.0220739,0.0001244795,0.00043837496,0.000012825195,0.0000069736434,0.000012702996,0.00045213208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983574,0.00006350208,0.00025900578,0.00054115936,0.00026684324,0.00051208877],"domain_scores_gemma":[0.9991883,0.0001488622,0.00003139027,0.0005153057,0.00003433077,0.00008181272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006637867,0.00014859841,0.00015159317,0.00012492057,0.00013364702,0.00055750867,0.0006352988,0.000048084636,0.00038083817],"category_scores_gemma":[0.000043904784,0.0001328297,0.000095263604,0.00048253426,0.000048560873,0.0002523529,0.0005933421,0.00016200851,0.0004443687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012795327,0.000048453636,0.00017486654,0.00003849294,0.000021445385,0.0005236768,0.010054036,0.000016189499,0.0058930027,0.019346157,0.0006231904,0.9632592],"study_design_scores_gemma":[0.0005909458,0.0002845526,0.0027579358,0.0001739487,0.00007266933,0.00047504625,0.00503713,0.70732224,0.07348247,0.028297275,0.17966859,0.0018372245],"about_ca_topic_score_codex":0.000088794644,"about_ca_topic_score_gemma":0.00020862208,"teacher_disagreement_score":0.96142197,"about_ca_system_score_codex":0.000053840107,"about_ca_system_score_gemma":0.000085115134,"threshold_uncertainty_score":0.5711609},"labels":[],"label_agreement":null},{"id":"W4404849704","doi":"10.1109/focs61266.2024.00033","title":"On Pigeonhole Principles and Ramsey in TFNP","year":2024,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Pigeonhole principle; Computer science; Ramsey theory; Mathematical economics; Mathematics; Combinatorics","score_opus":0.021316773023762937,"score_gpt":0.25305029608232604,"score_spread":0.2317335230585631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404849704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3457549,0.0010301468,0.60925096,0.004998495,0.0011664433,0.0003957205,0.0000014917623,0.0010373758,0.036364492],"genre_scores_gemma":[0.97080517,0.000009551662,0.027820418,0.00030602832,0.00004224916,0.000009983406,4.0197523e-7,0.000006157476,0.0010000296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888384,0.00004554671,0.00016556914,0.0005109667,0.00017929041,0.00021480085],"domain_scores_gemma":[0.9992236,0.0002890303,0.00001079834,0.000388975,0.000020806097,0.00006679825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003801407,0.00011039378,0.00011588668,0.00014211875,0.00003153193,0.00030541353,0.00039740003,0.00004441469,0.0000323889],"category_scores_gemma":[0.00005587513,0.00008708863,0.000025835623,0.0005088049,0.000038574486,0.00023012879,0.00046257587,0.0001522106,0.00010878399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030873903,0.00010035615,0.0014008001,0.00005483615,0.0000066508483,0.000101329395,0.0007843449,0.0012419317,0.000048017722,0.7956225,0.00043747286,0.20019862],"study_design_scores_gemma":[0.00016949567,0.00017181879,0.025788141,0.000056814755,0.0000013337415,0.000023118806,0.000016752598,0.8825083,0.0002352428,0.08045698,0.01036564,0.00020635419],"about_ca_topic_score_codex":0.000070853064,"about_ca_topic_score_gemma":0.00008744412,"teacher_disagreement_score":0.88126636,"about_ca_system_score_codex":0.00005219751,"about_ca_system_score_gemma":0.000055443918,"threshold_uncertainty_score":0.3551371},"labels":[],"label_agreement":null},{"id":"W4405031674","doi":"10.48550/arxiv.2411.19890","title":"Reverse-type Data Processing Inequality","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canada First Research Excellence Fund; National Natural Science Foundation of China","keywords":"Inequality; Type (biology); Computer science; Mathematics; Geology; Mathematical analysis; Paleontology","score_opus":0.23175667891021748,"score_gpt":0.24814307659945156,"score_spread":0.016386397689234083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405031674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08609505,0.0007503867,0.9015446,0.0007951279,0.0038957202,0.0006603563,0.00010938468,0.0017910016,0.0043584127],"genre_scores_gemma":[0.9825713,0.000083981875,0.015595251,0.00017355068,0.0002759353,5.903079e-7,0.00009062563,0.000033183976,0.0011755999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953026,0.00031236873,0.00039800836,0.0032064281,0.00023397338,0.00054659485],"domain_scores_gemma":[0.9934545,0.00016892888,0.00028566274,0.0054838443,0.0003599824,0.00024705735],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011584047,0.00050831545,0.0005463913,0.0003166713,0.00019202652,0.0005513251,0.0077414927,0.00040487136,0.000040447587],"category_scores_gemma":[0.00018710949,0.0005652084,0.00017362132,0.0017283197,0.00019068866,0.0007369174,0.033928547,0.0014248765,0.00035799533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019565335,0.001813424,0.013203863,0.008102139,0.0010296762,0.00856589,0.0039629363,0.30535978,0.00015362004,0.48795158,0.028960614,0.14070083],"study_design_scores_gemma":[0.0001580707,0.000036192985,0.00050078833,0.00017319362,0.00008616856,0.000010450194,0.00003810558,0.81019956,0.000016637276,0.18539676,0.002810046,0.00057400914],"about_ca_topic_score_codex":0.00034417232,"about_ca_topic_score_gemma":0.00007490794,"teacher_disagreement_score":0.8964762,"about_ca_system_score_codex":0.0004151319,"about_ca_system_score_gemma":0.0009931246,"threshold_uncertainty_score":0.9996799},"labels":[],"label_agreement":null},{"id":"W4405944658","doi":"10.1007/979-8-8688-1061-9_20","title":"Inconclusive Intelligence","year":2024,"lang":"en","type":"book-chapter","venue":"Design Thinking","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Psychology","score_opus":0.04415609709160654,"score_gpt":0.25851239053557856,"score_spread":0.21435629344397203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405944658","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.616187e-7,0.0021837323,0.7266427,0.00048501798,0.00212409,0.00045233095,0.0000041600706,0.000873958,0.26723373],"genre_scores_gemma":[0.0024364532,0.00024726175,0.64663583,0.0014844927,0.0014938791,0.000043862514,0.000014858933,0.00021369263,0.34742966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637765,0.000071561924,0.0006504883,0.0014663822,0.0009382699,0.000495638],"domain_scores_gemma":[0.9970036,0.0008334536,0.00026673675,0.0015056463,0.000230953,0.00015958252],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012496574,0.00065154623,0.0006006721,0.0004190928,0.00025402804,0.00079659035,0.0034961973,0.00048669497,0.00015849288],"category_scores_gemma":[0.000070005444,0.0006235719,0.0003151454,0.0001934621,0.00016249072,0.0003573423,0.0033098608,0.0011944378,0.0019546922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022880959,0.0000093212775,3.450046e-7,0.00006013893,0.00006854101,0.00043810706,0.0019498197,0.0006687335,0.000007673385,0.89995754,0.00071828306,0.0961192],"study_design_scores_gemma":[0.000031615145,0.00010787738,6.8894894e-7,0.00036743266,0.000035058176,0.00010600813,0.0000072664197,0.08013392,0.00019447101,0.8821459,0.036264308,0.00060549384],"about_ca_topic_score_codex":0.0000162673,"about_ca_topic_score_gemma":0.0000054630177,"teacher_disagreement_score":0.09551371,"about_ca_system_score_codex":0.00043055654,"about_ca_system_score_gemma":0.00032563152,"threshold_uncertainty_score":0.99962157},"labels":[],"label_agreement":null},{"id":"W4406089983","doi":"10.1109/jsait.2024.3499012","title":"Editorial Data, Physics, and Life Through the Lens of Information Theory","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lens (geology); Through-the-lens metering; Data science; Physics; Computer science; Optics","score_opus":0.016638114248038748,"score_gpt":0.256696536806175,"score_spread":0.24005842255813625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406089983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006447155,0.00019796856,0.95731795,0.0006262286,0.032574803,0.0003450066,0.000049907896,0.0001745018,0.0022664831],"genre_scores_gemma":[0.97447526,0.00024639253,0.005770225,0.0015504747,0.017837055,0.000017820468,0.000071874136,0.000016938884,0.0000139686745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737686,0.00053810957,0.0009161343,0.00015525722,0.0007441381,0.00026951928],"domain_scores_gemma":[0.99685377,0.001505476,0.00040759105,0.00065099075,0.00050844334,0.00007370192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003504303,0.00020269178,0.00023175307,0.0002701576,0.00020100456,0.0008923708,0.0012712207,0.00012183249,0.000016263446],"category_scores_gemma":[0.0011697373,0.00013777688,0.000059780996,0.0010286369,0.00014540902,0.012825872,0.00025743726,0.0008472146,0.000056725137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018342178,0.00006946255,0.000035994985,0.000102047205,0.00009704525,0.0000014623903,0.017561758,0.00610397,0.000020820034,0.7864941,0.030541474,0.15878847],"study_design_scores_gemma":[0.0013388816,0.00043792574,0.0015422106,0.00033584918,0.000045185952,0.00015524372,0.0011244802,0.18621306,0.0005056204,0.69535655,0.112426735,0.0005182389],"about_ca_topic_score_codex":0.000008790115,"about_ca_topic_score_gemma":0.000001420976,"teacher_disagreement_score":0.96802807,"about_ca_system_score_codex":0.00011931969,"about_ca_system_score_gemma":0.0004940587,"threshold_uncertainty_score":0.9298448},"labels":[],"label_agreement":null},{"id":"W4406659460","doi":"10.1016/b978-0-340-67769-8.50012-4","title":"10.1016/b978-0-340-67769-8.50012-4","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.01147003812144016,"score_gpt":0.179862483935156,"score_spread":0.16839244581371585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406659460","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.866996e-7,0.0003600267,0.0013917267,0.00050982996,0.000038729824,0.0007600342,0.000054435113,0.0009995739,0.9958854],"genre_scores_gemma":[9.466934e-7,8.010231e-7,0.008168631,0.00015112643,0.00069533125,0.00003110335,0.000038378224,0.00011240696,0.9908013],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956404,0.00007204933,0.0007659068,0.0017234569,0.00096549426,0.00083268614],"domain_scores_gemma":[0.9960151,0.00028160794,0.00023325226,0.0027043624,0.00024368512,0.00052200886],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00045813018,0.00090026663,0.00094116887,0.00048170137,0.00018885516,0.00039044555,0.0034673081,0.0005472749,0.9821519],"category_scores_gemma":[0.000046225057,0.0009343674,0.00043798776,0.00023162342,0.00015195385,0.00032526645,0.0015798775,0.00075507985,0.9936544],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017108488,0.000054283617,9.00239e-9,0.00001849302,0.000055340246,0.00007442538,0.000030174024,0.00011552376,0.0000015290789,0.0012049754,0.08551091,0.91291726],"study_design_scores_gemma":[0.00022729488,0.00032913583,0.0000030193337,0.00008720243,0.000036407288,0.00007572685,9.747726e-8,0.0038225863,0.00000909011,0.008633408,0.98573226,0.001043771],"about_ca_topic_score_codex":0.000027789367,"about_ca_topic_score_gemma":7.835691e-7,"teacher_disagreement_score":0.91187346,"about_ca_system_score_codex":0.00030120218,"about_ca_system_score_gemma":0.000249166,"threshold_uncertainty_score":0.9993107},"labels":[],"label_agreement":null},{"id":"W4406662063","doi":"10.3390/math13030339","title":"A Note on Mutation Equivalence","year":2025,"lang":"en","type":"article","venue":"Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Equivalence (formal languages); Mutation; Mathematics; Genetics; Biology; Pure mathematics","score_opus":0.022171409127691187,"score_gpt":0.2991991155434156,"score_spread":0.27702770641572444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406662063","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008681503,0.000021544365,0.9742164,0.001318195,0.0004117098,0.00020515066,9.491343e-7,0.00026769858,0.01487686],"genre_scores_gemma":[0.37038502,0.0000027320316,0.627963,0.00060362497,0.00003830442,0.000023245995,8.2276927e-7,0.0000071500235,0.00097608427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998952,0.000036487316,0.00025159604,0.00029227344,0.00027026216,0.0001974217],"domain_scores_gemma":[0.9985701,0.000482797,0.00007279556,0.00075647625,0.00007967795,0.000038143302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035509386,0.00012134963,0.0001566587,0.00011428144,0.00008299541,0.0001309643,0.0007778176,0.000048960148,0.000012589534],"category_scores_gemma":[0.0002833614,0.00010763774,0.000057334382,0.00048598615,0.00003672167,0.00013439747,0.00031324942,0.000108551656,0.00017848556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022135835,0.00043330263,0.00003900322,0.00025293685,0.000013691985,0.0000246447,0.0027618336,0.0013051194,0.0002664407,0.85492384,0.00092854525,0.13904841],"study_design_scores_gemma":[0.00014565056,0.0000611922,0.0003774673,0.00007931639,0.0000053110252,0.000007892234,0.000022386876,0.59833074,0.0017224577,0.3986122,0.00052024756,0.000115130206],"about_ca_topic_score_codex":0.0000032440348,"about_ca_topic_score_gemma":0.000002108531,"teacher_disagreement_score":0.59702563,"about_ca_system_score_codex":0.00008231385,"about_ca_system_score_gemma":0.00006177998,"threshold_uncertainty_score":0.43893394},"labels":[],"label_agreement":null},{"id":"W4406669635","doi":"10.1016/b978-0-08-093827-1.50007-7","title":"10.1016/b978-0-08-093827-1.50007-7","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Programming language","score_opus":0.011712481186350087,"score_gpt":0.18234901777784457,"score_spread":0.17063653659149447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406669635","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.9030346e-7,0.00037326742,0.0014940837,0.00053006987,0.00003819817,0.0007871697,0.000055348562,0.0010188296,0.99570274],"genre_scores_gemma":[8.868644e-7,8.7148163e-7,0.008417193,0.0001415623,0.000706485,0.000032443048,0.00003723804,0.00011361619,0.9905497],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955366,0.00007500995,0.00078834913,0.0017595533,0.0010014427,0.00083901285],"domain_scores_gemma":[0.9959171,0.00029450416,0.00024480076,0.002751655,0.00025165157,0.0005403085],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00048335255,0.0009132747,0.0009698821,0.0004962741,0.00019242513,0.00040647207,0.0035493989,0.00055744,0.98439467],"category_scores_gemma":[0.000048471025,0.00094799104,0.00045286762,0.00023206239,0.00015582665,0.00032744813,0.0016268619,0.0007676434,0.9951122],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018190127,0.00005383009,8.528658e-9,0.00002018388,0.000056484016,0.00007848927,0.000031870193,0.00013274362,0.000001248417,0.001200457,0.0905262,0.9078803],"study_design_scores_gemma":[0.0002444021,0.00035060963,0.0000031002578,0.0000934912,0.000037229176,0.000076098906,1.0684401e-7,0.003997332,0.0000076014926,0.008043525,0.9860907,0.0010557767],"about_ca_topic_score_codex":0.000025314013,"about_ca_topic_score_gemma":8.092073e-7,"teacher_disagreement_score":0.9068245,"about_ca_system_score_codex":0.0003083382,"about_ca_system_score_gemma":0.00026202446,"threshold_uncertainty_score":0.9992971},"labels":[],"label_agreement":null},{"id":"W4406672982","doi":"10.1016/b978-0-08-051638-7.50019-0","title":"10.1016/b978-0-08-051638-7.50019-0","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Cognitive science; Psychology","score_opus":0.01145670205823579,"score_gpt":0.18113934950161184,"score_spread":0.16968264744337605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406672982","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.5728852e-7,0.00035510713,0.0015179602,0.0005679462,0.000037085938,0.0007683131,0.0000580372,0.0010056667,0.99568963],"genre_scores_gemma":[8.8474934e-7,8.692257e-7,0.008800262,0.00014426089,0.00066690735,0.000029355682,0.00004060935,0.000112288246,0.9902046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99559057,0.000073707,0.0007729642,0.0017518708,0.00097418437,0.00083671394],"domain_scores_gemma":[0.9959733,0.00027563897,0.0002415453,0.0027371256,0.00025001602,0.00052237156],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004625736,0.0009069999,0.0009551765,0.0004834757,0.00018875477,0.00039794782,0.003498848,0.00055052195,0.98271686],"category_scores_gemma":[0.000046815447,0.0009333905,0.00044242988,0.00022963916,0.00015356779,0.0003190356,0.0016284393,0.0007592104,0.99499774],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018096509,0.000054238193,8.006968e-9,0.000019717554,0.000056940364,0.000075467615,0.000029217286,0.00013240913,0.0000014686389,0.001307193,0.084032364,0.9142729],"study_design_scores_gemma":[0.00024613942,0.00035513449,0.0000028558657,0.00009037261,0.000035951005,0.00007971974,1.0294932e-7,0.0040859426,0.000007946704,0.008634124,0.98541754,0.0010441442],"about_ca_topic_score_codex":0.000024543056,"about_ca_topic_score_gemma":7.734793e-7,"teacher_disagreement_score":0.91322875,"about_ca_system_score_codex":0.00029806996,"about_ca_system_score_gemma":0.00025927517,"threshold_uncertainty_score":0.9993117},"labels":[],"label_agreement":null},{"id":"W4407091303","doi":"10.48550/arxiv.2501.19116","title":"A Theoretical Justification for Asymmetric Actor-Critic Algorithms","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute; Group for Research in Decision Analysis; HEC Montréal","funders":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture","keywords":"Algorithm; Computer science; Mathematical economics; Economics","score_opus":0.05607602837467341,"score_gpt":0.3211562526190507,"score_spread":0.26508022424437727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407091303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018701166,0.0006137415,0.96637684,0.004052841,0.0053330786,0.001789938,0.00009942069,0.00079127675,0.0022416944],"genre_scores_gemma":[0.8329238,0.00005779498,0.16453722,0.000556726,0.0007704224,0.0006174707,0.000094222574,0.00003583448,0.0004064857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951993,0.00030925882,0.00088365085,0.0021727988,0.00060922926,0.0008257147],"domain_scores_gemma":[0.9938404,0.0019451026,0.00027903914,0.0029106727,0.0007651713,0.0002596222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013398769,0.00062724506,0.00077987026,0.0006592641,0.00026389165,0.00042138662,0.0037446965,0.00063741725,0.000044356755],"category_scores_gemma":[0.0018285328,0.00061951485,0.0005155093,0.0013086451,0.0003506394,0.00025215096,0.0036849699,0.0010249134,0.00010634596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026943586,0.0008463612,0.008940126,0.0011256982,0.00019929564,0.000021879712,0.0006943344,0.00061682484,0.00009499624,0.69134367,0.001420932,0.29466894],"study_design_scores_gemma":[0.00079064106,0.00022817655,0.05330735,0.00023481307,0.00019808939,0.000016322518,0.000041634292,0.62826985,0.0018057331,0.31039864,0.0034449955,0.0012637724],"about_ca_topic_score_codex":0.00004288653,"about_ca_topic_score_gemma":0.000003834915,"teacher_disagreement_score":0.81422263,"about_ca_system_score_codex":0.0004287408,"about_ca_system_score_gemma":0.0006518628,"threshold_uncertainty_score":0.9996256},"labels":[],"label_agreement":null},{"id":"W4407232431","doi":"10.21428/e2759450.cd81bff2","title":"Computational Complexity","year":2025,"lang":"en","type":"book-chapter","venue":"MIT Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.06806911598643357,"score_gpt":0.2699204521507874,"score_spread":0.20185133616435386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407232431","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013081816,0.00035105704,0.34735408,0.00013043755,0.0007614811,0.00045196695,0.00006913147,0.00046765496,0.65041286],"genre_scores_gemma":[0.0004435747,0.0000057074694,0.1354416,0.0006722929,0.00031488217,0.000039221944,0.00006254426,0.000043006767,0.86297715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967278,0.00008017054,0.0006706699,0.0012750443,0.0007937245,0.00045256235],"domain_scores_gemma":[0.9971588,0.00042942024,0.0002888724,0.0015601513,0.00038087062,0.00018187222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029270118,0.00061225443,0.00070417294,0.00022254567,0.00022783376,0.00037160376,0.0025340843,0.0003907647,0.00007824973],"category_scores_gemma":[0.000026681399,0.00064441346,0.00035763386,0.000020385693,0.00037632085,0.000118718344,0.0023934278,0.0007049782,0.00008106263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004938243,0.000025909243,0.0000015988879,0.000090374044,0.00010585187,0.000039472056,0.00012571354,0.0004106065,7.7608286e-7,0.91945297,0.008083658,0.071658134],"study_design_scores_gemma":[0.0002732825,0.000048382637,0.000043532746,0.000108192246,0.000035284134,0.000019942998,3.775748e-7,0.06605916,0.00002210828,0.49374104,0.43912855,0.0005201795],"about_ca_topic_score_codex":0.00010254361,"about_ca_topic_score_gemma":0.000026228245,"teacher_disagreement_score":0.43104488,"about_ca_system_score_codex":0.00018678042,"about_ca_system_score_gemma":0.0003176784,"threshold_uncertainty_score":0.9996007},"labels":[],"label_agreement":null},{"id":"W4407477361","doi":"10.1090/proc/17239","title":"Borel complexity of the isomorphism relation of Archimedean orders in finitely generated groups","year":2025,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada","keywords":"Isomorphism (crystallography); Mathematics; Finitely-generated abelian group; Relation (database); Pure mathematics; Combinatorics; Computer science","score_opus":0.03629321683115332,"score_gpt":0.26855942363108415,"score_spread":0.23226620679993082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407477361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93035567,0.000046027366,0.061735,0.004558191,0.00020594004,0.0012870331,0.00004766705,0.000085624604,0.0016788639],"genre_scores_gemma":[0.8008234,0.000017955943,0.19888124,0.00017456162,0.00002416877,0.000032900633,0.0000017028702,0.000013292471,0.00003076902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968938,0.000095493975,0.0011959343,0.0006220454,0.00085274596,0.00033994354],"domain_scores_gemma":[0.99600434,0.00056079525,0.0020180412,0.00080728094,0.00054879795,0.000060764996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012720397,0.0003481238,0.0010930548,0.00007909382,0.0000986303,0.00004576008,0.0036363516,0.00016190969,0.00000667156],"category_scores_gemma":[0.0008355197,0.00022894502,0.00077996816,0.0017960416,0.0025925694,0.000098867786,0.0054660104,0.00093869935,6.8867166e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007768773,0.002904359,0.035116695,0.008560603,0.0006963763,3.6415753e-7,0.03305835,0.004259436,0.0105041545,0.8951023,0.0020911864,0.0076284506],"study_design_scores_gemma":[0.00022865027,0.00006269461,0.056806006,0.00056108146,0.000053535434,0.0000022151014,0.00034344883,0.33712548,0.0031243186,0.60146797,0.000007698006,0.00021692272],"about_ca_topic_score_codex":0.00031493267,"about_ca_topic_score_gemma":0.0000052229902,"teacher_disagreement_score":0.33286604,"about_ca_system_score_codex":0.00017571007,"about_ca_system_score_gemma":0.00025658717,"threshold_uncertainty_score":0.95524305},"labels":[],"label_agreement":null},{"id":"W4407733229","doi":"10.1007/978-981-96-1093-8","title":"Computing and Combinatorics","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Chicago; University of Illinois at Urbana-Champaign; Université Clermont-Auvergne; National Cheng Kung University; Indian Institute of Technology Madras; Nanjing University; Bangladesh University of Engineering and Technology; National Tsing Hua University; Università degli Studi di Palermo; Università degli Studi di Salerno; University of Tokyo; Université de Bordeaux; Aalborg Universitet; Universiteit Utrecht; Simon Fraser University; Nankai University; Dalian University of Technology; Centre National de la Recherche Scientifique; University of Engineering and Technology, Lahore; Universität Rostock; Universidade Federal Fluminense; Georgia State University; University of Texas at Dallas; Indiana State University; City University of Hong Kong; Hangzhou Dianzi University; University of Alberta","keywords":"Computer science; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.01104840843044858,"score_gpt":0.25204521961555904,"score_spread":0.24099681118511046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407733229","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013915448,0.0012339087,0.98749596,0.00095190475,0.0045952043,0.00059529167,0.000004278882,0.00042792616,0.0045563993],"genre_scores_gemma":[0.085235715,0.00008496169,0.9089588,0.0029397227,0.00088426407,0.000013609929,0.000011187736,0.000053931548,0.0018177981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939629,0.00015302633,0.0007959138,0.0027381945,0.0012430619,0.0011069408],"domain_scores_gemma":[0.99477655,0.0020439213,0.00033492953,0.0021231333,0.00044104183,0.00028040766],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018890518,0.00077999034,0.0009580795,0.0012849197,0.0004984603,0.0012346073,0.0053701964,0.000484146,0.000004187881],"category_scores_gemma":[0.00035114432,0.000766181,0.00014811766,0.0026625372,0.0011003698,0.00059272855,0.0071408045,0.0014500989,0.000013888844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025057716,0.000097265205,0.00037630973,0.00020373278,0.000015728674,0.0001376409,0.00078614475,0.01402427,0.0000107089845,0.030486474,0.00029706658,0.95356214],"study_design_scores_gemma":[0.00029895533,0.00012870195,0.00053107244,0.0003191491,0.000007572431,0.00006760796,1.5319426e-7,0.65902615,0.000117044045,0.3375429,0.0013363194,0.0006244201],"about_ca_topic_score_codex":0.000034690107,"about_ca_topic_score_gemma":0.00003087255,"teacher_disagreement_score":0.9529377,"about_ca_system_score_codex":0.0009463822,"about_ca_system_score_gemma":0.0023774966,"threshold_uncertainty_score":0.99980223},"labels":[],"label_agreement":null},{"id":"W4408045268","doi":"10.1016/b978-0-44-332818-3.00010-1","title":"Essential mathematics for machine learning","year":2025,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Bishop's University","funders":"","keywords":"Mathematics education; Computer science; Mathematics","score_opus":0.01513566904188954,"score_gpt":0.2481466621773964,"score_spread":0.23301099313550686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408045268","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001427725,0.00063796743,0.24312815,0.00016813322,0.0010281753,0.0009807625,0.000025570904,0.00038189333,0.7536479],"genre_scores_gemma":[0.000043140244,0.000022730741,0.15969075,0.00016031199,0.0003610301,0.00006703354,0.000023734483,0.00005413853,0.83957714],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99728906,0.000042153915,0.0007266253,0.0009845964,0.00048577413,0.00047180202],"domain_scores_gemma":[0.99736005,0.0005758623,0.00039293568,0.0012717358,0.00026585645,0.00013355246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006129045,0.00059576094,0.0008349926,0.0002670986,0.00026234315,0.0002708166,0.0017229321,0.00036971676,0.00006584104],"category_scores_gemma":[0.00012005844,0.0005765244,0.0005310521,0.000036721925,0.000116376825,0.0000829167,0.0013154353,0.000722792,0.000078375764],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029526593,0.000019546895,0.0000010433688,0.00032417846,0.0000808748,0.000012483678,0.00023317106,0.000017870665,0.0000065262634,0.14108612,0.00013711576,0.8580781],"study_design_scores_gemma":[0.0002885174,0.000097010714,9.251531e-7,0.00025625428,0.000078981,0.000019091505,0.0000017875316,0.054707263,0.000051053805,0.1986305,0.7453641,0.00050449587],"about_ca_topic_score_codex":7.32757e-7,"about_ca_topic_score_gemma":0.000014063472,"teacher_disagreement_score":0.8575736,"about_ca_system_score_codex":0.0001389175,"about_ca_system_score_gemma":0.00026482568,"threshold_uncertainty_score":0.9996686},"labels":[],"label_agreement":null},{"id":"W4408362526","doi":"10.1007/s11390-024-5036-x","title":"Caging AI","year":2025,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.00567773826158046,"score_gpt":0.255621987237542,"score_spread":0.2499442489759615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408362526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052472427,0.0004369284,0.91758585,0.02762164,0.0014467502,0.00006472954,9.3029286e-8,0.00010414605,0.00026741304],"genre_scores_gemma":[0.7652669,0.000022664788,0.2333113,0.0013046745,0.00007378831,9.778345e-7,1.3260626e-8,0.0000021341289,0.000017567334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983972,0.000028726945,0.00041574848,0.0003654458,0.00044490793,0.00034799325],"domain_scores_gemma":[0.9980077,0.00009336011,0.00019192108,0.00051925087,0.001097422,0.00009030234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014807351,0.00012428324,0.00028265343,0.0017643226,0.00024849112,0.00032126927,0.0025704564,0.000082133614,0.000001210398],"category_scores_gemma":[0.00014622882,0.00010050579,0.000044854783,0.0038277311,0.00077492016,0.0009420995,0.0015311894,0.00038283577,0.000002486741],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017009913,0.00006106658,0.003348401,0.00000967753,0.000012873255,0.000058220376,0.000117950265,0.0000844749,0.0010422689,0.1617335,0.0008230427,0.8327068],"study_design_scores_gemma":[0.0009605452,0.0007740995,0.011166231,0.00014473974,0.00001711306,0.0019162515,0.000044064258,0.509442,0.011425859,0.442695,0.021060325,0.000353804],"about_ca_topic_score_codex":0.00000286014,"about_ca_topic_score_gemma":0.0000012107649,"teacher_disagreement_score":0.832353,"about_ca_system_score_codex":0.00010035785,"about_ca_system_score_gemma":0.00069899124,"threshold_uncertainty_score":0.47765905},"labels":[],"label_agreement":null},{"id":"W4408892541","doi":"10.61091/jcmcc125-11","title":"On edge-disjoint Ramsey numbers of stars","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Stars; Ramsey's theorem; Combinatorics; Enhanced Data Rates for GSM Evolution; Ramsey theory; Mathematics; Computer science; Astronomy; Physics; Artificial intelligence; Graph","score_opus":0.01205835339653154,"score_gpt":0.25956009225338883,"score_spread":0.24750173885685728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408892541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6386193,0.00037866505,0.31333342,0.00067330536,0.041537225,0.0005789326,0.000002631949,0.000117403695,0.0047591254],"genre_scores_gemma":[0.9667875,0.000018686756,0.032642536,0.000066735316,0.00044943692,0.0000016366956,4.4106667e-7,0.000020764835,0.000012224761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959885,0.00024019116,0.0018728883,0.00041604543,0.0010274294,0.0004549744],"domain_scores_gemma":[0.9943402,0.0021934584,0.001517571,0.0007206747,0.0010071996,0.00022089196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027035412,0.0004057732,0.0012281899,0.00048598746,0.00024612877,0.000301354,0.0015524216,0.0002126067,0.0000055992646],"category_scores_gemma":[0.001159696,0.00036223527,0.00035982634,0.000937457,0.00017521529,0.00031658067,0.0009062491,0.0007035815,0.0000026168507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007135844,0.0010548498,0.00014708306,0.00024703762,0.00014131698,0.000020952808,0.000881008,0.00024745878,0.0002719457,0.9893238,0.00061800424,0.0069752047],"study_design_scores_gemma":[0.0040966514,0.0012574537,0.00028557278,0.0006543109,0.00006686047,0.000045821904,0.00015540567,0.030820837,0.0018814692,0.95997673,0.0004320612,0.000326795],"about_ca_topic_score_codex":0.000016052678,"about_ca_topic_score_gemma":4.20697e-7,"teacher_disagreement_score":0.32816824,"about_ca_system_score_codex":0.0001956872,"about_ca_system_score_gemma":0.0004168515,"threshold_uncertainty_score":0.99988294},"labels":[],"label_agreement":null},{"id":"W4409255934","doi":"10.1007/978-3-0348-0692-3_83-1","title":"Games and Algebras","year":2024,"lang":"en","type":"book-chapter","venue":"Operator Theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.01076232554747663,"score_gpt":0.21914924086569215,"score_spread":0.20838691531821552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409255934","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020481063,0.018682575,0.03513794,0.0008022087,0.0026181734,0.00053710607,0.00004234693,0.000800807,0.94117403],"genre_scores_gemma":[0.0061690956,0.0003612008,0.012655049,0.0011831481,0.0008190896,0.000029027835,0.0000090955555,0.00012905296,0.97864527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979275,0.000059968388,0.00032154963,0.0010934714,0.00029955548,0.0002979872],"domain_scores_gemma":[0.99825734,0.00026719362,0.00006360069,0.0011377166,0.00009341015,0.00018071341],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066875847,0.0004675962,0.0004512037,0.00017580147,0.00011038082,0.00058576924,0.0010629839,0.00029397197,0.00044486002],"category_scores_gemma":[0.00003135581,0.00039514824,0.00015204628,0.00006469739,0.00025183352,0.000217857,0.0014786961,0.0005332519,0.0009861633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025331342,0.000008574226,0.0000016392931,0.00004988428,0.000056212462,0.00009880673,0.0002720418,0.0000020403768,0.000016113181,0.92895323,0.00088995375,0.06964896],"study_design_scores_gemma":[0.00008774611,0.00007420908,0.000009361901,0.00010672776,0.000028934232,0.0000774365,0.000007887129,0.0012213433,0.00006576703,0.7998045,0.19806617,0.0004499149],"about_ca_topic_score_codex":0.0000027763306,"about_ca_topic_score_gemma":0.000003318328,"teacher_disagreement_score":0.19717622,"about_ca_system_score_codex":0.00008141855,"about_ca_system_score_gemma":0.00013964338,"threshold_uncertainty_score":0.99985003},"labels":[],"label_agreement":null},{"id":"W4409320974","doi":"10.18280/isi.300324","title":"Unconscious Mind-Inspired Algorithm: A Novel Approach to Machine Learning","year":2025,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unconscious mind; Computer science; Artificial intelligence; Cognitive science; Algorithm; Psychology; Machine learning; Psychoanalysis","score_opus":0.015029208500473087,"score_gpt":0.23302558637828505,"score_spread":0.21799637787781195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409320974","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063113254,0.00009651022,0.9693362,0.00023092427,0.00071602623,0.00068418216,0.000014913046,0.00057379203,0.022036143],"genre_scores_gemma":[0.4378716,0.0000040462496,0.56093776,0.0006562515,0.000059035792,0.00012955288,0.000060730636,0.000010502064,0.00027053713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976566,0.00010543727,0.0008222838,0.00041888226,0.00046096233,0.0005358231],"domain_scores_gemma":[0.99831635,0.00015543142,0.00024658826,0.0006846166,0.00043013008,0.00016691457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009321051,0.0003181214,0.0003709513,0.0007096042,0.00047974236,0.00079753477,0.0011620224,0.0001542879,0.0000066822363],"category_scores_gemma":[0.0005141406,0.0003141241,0.000121375575,0.0019902345,0.00010429045,0.002641092,0.0007776114,0.00032430261,0.00012652663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120571,0.00014051949,0.0007909706,0.00018241598,0.000050837985,0.0000017687345,0.008652034,0.017386908,0.00011024873,0.0094288075,0.00027468306,0.96296877],"study_design_scores_gemma":[0.00062926614,0.00012335632,0.0028348193,0.00008061795,0.000012149946,0.000047489935,0.0003144224,0.9764717,0.0005244841,0.0031204547,0.015464501,0.000376689],"about_ca_topic_score_codex":0.00021644657,"about_ca_topic_score_gemma":0.00001545622,"teacher_disagreement_score":0.96259207,"about_ca_system_score_codex":0.0005704603,"about_ca_system_score_gemma":0.00025890608,"threshold_uncertainty_score":0.9999311},"labels":[],"label_agreement":null},{"id":"W4409346339","doi":"10.23952/asvao.7.2025.3.04","title":"A new proof of the Von Neumann minimax theorem","year":2025,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Minimax; Minimax theorem; Von Neumann architecture; Calculus (dental); Pure mathematics; Mathematical economics; Medicine","score_opus":0.00752367124447857,"score_gpt":0.22964953439488503,"score_spread":0.22212586315040647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409346339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028286527,0.000112704576,0.9935251,0.00060349505,0.00009302685,0.00032574032,0.000002284817,0.000054754964,0.0024542632],"genre_scores_gemma":[0.72506255,0.00001606776,0.2742594,0.00024633209,0.000028710916,0.000016842463,0.0000144963105,0.0000066934476,0.00034892577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853164,0.00010174324,0.00039417128,0.0005054744,0.00028645562,0.00018053019],"domain_scores_gemma":[0.99872476,0.000099735604,0.00020702605,0.0007926461,0.00012022445,0.00005560667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042462556,0.00016666703,0.00035038713,0.000277758,0.0001678967,0.00013884877,0.00068928686,0.000081415514,0.000023300763],"category_scores_gemma":[0.000040355706,0.00011894004,0.00016729385,0.0032738687,0.000078181656,0.0001205018,0.0004407419,0.00009802223,6.891221e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010859005,0.000062155545,0.0009962579,0.000021818876,0.0003041562,2.1185467e-7,0.0005871519,0.82861686,0.000103930855,0.11437834,0.00019011016,0.05472816],"study_design_scores_gemma":[0.00028016817,0.000018127537,0.0035803139,0.000008412373,0.00033182726,3.6721005e-7,0.00004106267,0.980203,0.0016214094,0.01371776,0.00007733102,0.00012024677],"about_ca_topic_score_codex":0.00007077274,"about_ca_topic_score_gemma":0.000032236905,"teacher_disagreement_score":0.7222339,"about_ca_system_score_codex":0.000034753215,"about_ca_system_score_gemma":0.00010746314,"threshold_uncertainty_score":0.4850234},"labels":[],"label_agreement":null},{"id":"W4409361746","doi":"10.1609/aaai.v39i26.34971","title":"Increased Compute Efficiency and the Diffusion of AI Capabilities","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute on Governance","funders":"","keywords":"Diffusion; Computer science; Physics; Thermodynamics","score_opus":0.02748081946654944,"score_gpt":0.2721899647761037,"score_spread":0.24470914530955423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72383636,0.0001571261,0.25096565,0.014970446,0.00081136124,0.0012526013,0.0000064800115,0.00013647687,0.0078634815],"genre_scores_gemma":[0.9970356,0.000029874433,0.0024069268,0.00038395618,0.000028222326,0.000022976612,1.6584484e-7,0.0000055305945,0.00008674652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977746,0.00008005047,0.00075557135,0.0005643185,0.00051738013,0.00030809868],"domain_scores_gemma":[0.99733347,0.0007947774,0.00035696008,0.0005353421,0.0009186406,0.000060805578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013273073,0.0002558209,0.0004668406,0.00016967239,0.0002881056,0.00022683153,0.0026046995,0.00008743615,0.000014469837],"category_scores_gemma":[0.001012408,0.00014814822,0.00016041502,0.0010064038,0.0017278588,0.00023589445,0.001435505,0.00035719102,0.000004928555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008944785,0.00018934603,0.0007391665,0.000096818214,0.00001402816,1.1288275e-7,0.0021170448,0.00007783468,0.0040100846,0.9572331,0.00004492739,0.03538814],"study_design_scores_gemma":[0.00011190663,0.00013532532,0.0013013154,0.00021283947,0.000017900815,0.0000026199052,0.0005007383,0.39409477,0.0998144,0.5036307,0.00003538548,0.00014211386],"about_ca_topic_score_codex":0.00040451906,"about_ca_topic_score_gemma":0.000020133184,"teacher_disagreement_score":0.45360234,"about_ca_system_score_codex":0.000043127475,"about_ca_system_score_gemma":0.0002087259,"threshold_uncertainty_score":0.6366368},"labels":[],"label_agreement":null},{"id":"W4409364876","doi":"10.1609/aaai.v39i13.33540","title":"On the Power of Randomization for Obviously Strategy-Proof Mechanisms","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Azrieli Foundation; Israel Science Foundation; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Randomization; Power (physics); Proof of concept; Computer science; Mathematics; Medicine; Internal medicine; Clinical trial; Physics; Operating system; Thermodynamics","score_opus":0.054668175319098955,"score_gpt":0.2927368003343926,"score_spread":0.23806862501529363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03925392,0.000017904276,0.94429296,0.006320465,0.0007220192,0.001773142,0.000008084769,0.00007230554,0.0075391685],"genre_scores_gemma":[0.9940259,0.0000058388223,0.005320006,0.00032470466,0.00001934544,0.00009573246,3.791226e-7,0.000008728735,0.00019935831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979459,0.00004291476,0.00069995015,0.0005321754,0.0004773421,0.00030171013],"domain_scores_gemma":[0.99699676,0.0007671724,0.0004699405,0.0005014866,0.00122214,0.000042521388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013166389,0.00023871272,0.00036315047,0.00015122736,0.0002262711,0.00020604573,0.002613835,0.00010361265,0.00004399646],"category_scores_gemma":[0.0014350208,0.00014702213,0.00021010789,0.0008643555,0.00026623002,0.0002068744,0.00040258892,0.00022913123,0.000008774091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020761706,0.00018082577,0.000008000013,0.000039846975,0.000020629677,5.552503e-8,0.0005220537,0.0005720957,0.011653634,0.9591561,0.00015066574,0.027488487],"study_design_scores_gemma":[0.000072238814,0.00024576735,0.000023273542,0.000100860256,0.000009292621,3.7923195e-7,0.00020506293,0.112784475,0.34763324,0.5388336,0.000009018784,0.0000827583],"about_ca_topic_score_codex":0.000019664883,"about_ca_topic_score_gemma":0.000007700171,"teacher_disagreement_score":0.954772,"about_ca_system_score_codex":0.00005280578,"about_ca_system_score_gemma":0.00018535976,"threshold_uncertainty_score":0.59953886},"labels":[],"label_agreement":null},{"id":"W4409368921","doi":"10.1007/978-3-031-63665-3_10","title":"Von Neumann Algebras","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Von Neumann architecture; Tomita–Takesaki theory; Abelian von Neumann algebra; Pure mathematics; Algebra over a field; Mathematics; Jordan algebra; Algebra representation","score_opus":0.024172936028792138,"score_gpt":0.24819494862820665,"score_spread":0.2240220125994145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409368921","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003487764,0.0007195203,0.2302447,0.00037982792,0.0015225372,0.0009988694,0.000017556891,0.00058523886,0.76549685],"genre_scores_gemma":[0.00029508062,0.000121751626,0.23561229,0.0005410089,0.00030249136,0.00006868773,0.000018354527,0.000120641336,0.7629197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99545246,0.000060778595,0.0014602873,0.0013709163,0.0009272288,0.00072833704],"domain_scores_gemma":[0.99487865,0.00089587906,0.0005684599,0.0032193637,0.00024490224,0.0001927211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009591618,0.0009445988,0.001332522,0.0007109399,0.00014985843,0.00040415494,0.0035665387,0.00073339784,0.00015781826],"category_scores_gemma":[0.00021188943,0.00094996847,0.0004333217,0.00018744031,0.00026753917,0.00027342787,0.0024209463,0.0012100503,0.000470754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002043376,0.00011893939,0.0000073039264,0.00058416935,0.000057369267,0.00012132471,0.0009042723,0.000049323917,0.0000056250133,0.96719694,0.0061530876,0.024799572],"study_design_scores_gemma":[0.0003036621,0.00008616869,0.00001650578,0.00091166026,0.00004277893,0.000042850523,0.000013561183,0.044722345,0.000047715006,0.8933249,0.05964167,0.00084618316],"about_ca_topic_score_codex":0.00001188097,"about_ca_topic_score_gemma":0.000047122034,"teacher_disagreement_score":0.07387207,"about_ca_system_score_codex":0.00045238825,"about_ca_system_score_gemma":0.00041947275,"threshold_uncertainty_score":0.99929506},"labels":[],"label_agreement":null},{"id":"W4409474276","doi":"10.1109/jsac.2025.3560359","title":"Information Compression in the AI Era: Recent Advances and Future Challenges","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Data compression; Data science; Telecommunications; Artificial intelligence","score_opus":0.024262840188963703,"score_gpt":0.31032110657214346,"score_spread":0.28605826638317977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409474276","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029630043,0.10150847,0.114162184,0.72308856,0.002919029,0.0017800388,0.000010594915,0.00032336803,0.026577683],"genre_scores_gemma":[0.7976125,0.180038,0.018853705,0.0032560697,0.00014526039,0.0000710831,0.000009032802,0.0000060764523,0.000008291641],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980631,0.0008603431,0.00047650217,0.00013241496,0.00026712505,0.00020050086],"domain_scores_gemma":[0.9975056,0.0008090824,0.00017309953,0.001126063,0.00034215927,0.0000439771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974145,0.00013476994,0.00017478215,0.0004143624,0.00038214002,0.00026571512,0.002170646,0.00008079371,0.0000031546888],"category_scores_gemma":[0.0001519801,0.000096750024,0.000028064533,0.0014192458,0.0000711464,0.0010644216,0.00027673153,0.0012096384,0.0000028642055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017451528,0.00034623733,0.00094378664,0.000018595007,0.000010000382,0.0000018103724,0.0046129585,0.00094516366,0.000013972578,0.022603255,0.00066745834,0.9698193],"study_design_scores_gemma":[0.0013499385,0.00020990004,0.2350501,0.00040196182,0.000009901974,0.00016075406,0.0016053518,0.089339316,0.00007393968,0.05514835,0.616339,0.00031144105],"about_ca_topic_score_codex":0.000008121903,"about_ca_topic_score_gemma":0.00028229126,"teacher_disagreement_score":0.9695079,"about_ca_system_score_codex":0.00015480585,"about_ca_system_score_gemma":0.00016664132,"threshold_uncertainty_score":0.52553445},"labels":[],"label_agreement":null},{"id":"W4409624521","doi":"10.4153/s0008439525000475","title":"Multiplicative dependence in linear recurrence sequences","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Institut des Hautes Études Scientifiques, Université Paris-Saclay; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Debreceni Egyetem","keywords":"Mathematics; Multiplicative function; Pure mathematics; Combinatorics; Statistics; Mathematical analysis","score_opus":0.017237863665696778,"score_gpt":0.2676335318190813,"score_spread":0.2503956681533845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409624521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027524102,0.00040766233,0.8798493,0.043906234,0.000609074,0.0012146184,0.00001568141,0.00027441428,0.046198886],"genre_scores_gemma":[0.83368844,0.000011566668,0.16322917,0.0016430288,0.000036738067,0.0001301762,0.0000020433815,0.000009869319,0.0012489574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979021,0.00015368052,0.00043324643,0.0006794445,0.00023919017,0.0005923222],"domain_scores_gemma":[0.99793315,0.0006942015,0.00005938595,0.00081360847,0.00012432506,0.00037530405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007326987,0.00020647656,0.00030525128,0.00031028473,0.00011515787,0.00012333781,0.001687478,0.00012441071,0.0006226203],"category_scores_gemma":[0.0013556614,0.0001958509,0.000066324865,0.00092748925,0.00019825395,0.0000944381,0.00028180756,0.00034999452,0.0026224703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006773087,0.00028786846,0.0033109686,0.00027133783,0.0000284525,0.0003243114,0.0020654267,0.00034397072,0.00006189332,0.88468665,0.0061960765,0.102416255],"study_design_scores_gemma":[0.0004913949,0.00007979543,0.0043016165,0.00049448165,0.000008490802,0.00004547765,0.00018529152,0.37851083,0.00046597762,0.5712765,0.043431077,0.00070905103],"about_ca_topic_score_codex":0.0030009272,"about_ca_topic_score_gemma":0.006475339,"teacher_disagreement_score":0.8061644,"about_ca_system_score_codex":0.0003837603,"about_ca_system_score_gemma":0.00067866076,"threshold_uncertainty_score":0.9981541},"labels":[],"label_agreement":null},{"id":"W4409708667","doi":"10.1007/978-3-031-85352-4_13","title":"Real Number Mathematics","year":2025,"lang":"en","type":"book-chapter","venue":"Computer science foundations and applied logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics education; Mathematics; Computer science","score_opus":0.027419577673465936,"score_gpt":0.2730399116201744,"score_spread":0.24562033394670846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409708667","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003467075,0.000019760515,0.5778154,0.0003046182,0.00068941363,0.00038369972,0.0000055917635,0.00028742044,0.42045942],"genre_scores_gemma":[0.003855807,0.00013314372,0.95476884,0.0005584972,0.00038748552,0.000044684835,0.000021888176,0.000026367976,0.040203262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963073,0.000014554022,0.00065065484,0.001671517,0.00078014086,0.0005758223],"domain_scores_gemma":[0.9970528,0.00032045165,0.00031891634,0.0017187506,0.0003403517,0.0002487588],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00081235915,0.00055533985,0.0006083945,0.00042794636,0.0009417966,0.0015374087,0.002781234,0.00024301263,0.00011332928],"category_scores_gemma":[0.000018662337,0.000504695,0.00013463906,0.0005824028,0.0012419525,0.00046180075,0.0032789216,0.00044349037,0.00031232854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.377957e-7,0.000046316763,0.000003053488,0.000038828905,0.000012523147,0.000004325867,0.00015347239,0.000084589934,0.000012101456,0.8771563,0.0006059566,0.12188198],"study_design_scores_gemma":[0.00021650469,0.000062734136,0.00014537158,0.00007819671,0.000028705188,0.000058691832,0.000005961738,0.13897228,0.000017598948,0.8365214,0.023187468,0.00070512336],"about_ca_topic_score_codex":0.000007941882,"about_ca_topic_score_gemma":0.000005334936,"teacher_disagreement_score":0.38025615,"about_ca_system_score_codex":0.00023267302,"about_ca_system_score_gemma":0.0007099286,"threshold_uncertainty_score":0.9997405},"labels":[],"label_agreement":null},{"id":"W4409708778","doi":"10.1007/978-3-031-85352-4_10","title":"Inductive Sets and Types","year":2025,"lang":"en","type":"book-chapter","venue":"Computer science foundations and applied logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.027517941893495115,"score_gpt":0.2640340615991151,"score_spread":0.23651611970561998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409708778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023772308,0.0002677323,0.8104307,0.000877292,0.0009609057,0.0005860826,0.000009548892,0.00025800613,0.18637203],"genre_scores_gemma":[0.05622416,0.00025729355,0.9202815,0.0018796963,0.00052022067,0.0000706039,0.000030216213,0.00003586387,0.020700386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712116,0.000017669232,0.00037661416,0.0016138054,0.0004589052,0.00041182488],"domain_scores_gemma":[0.99816954,0.00023079713,0.0001975286,0.0009361698,0.00026242345,0.0002035394],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005555621,0.00043040354,0.0004534465,0.0005506373,0.0008526027,0.0011921731,0.0014300095,0.00019571651,0.000025270121],"category_scores_gemma":[0.000018492336,0.00038677445,0.00006004235,0.00044639796,0.0014630752,0.00049019913,0.0029437111,0.00039779814,0.00004294384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.7571e-7,0.000015342002,0.000004757444,0.000015626722,0.000010864735,0.0000023683588,0.00012728921,0.000040398823,0.000010444675,0.6974658,0.00016124788,0.3021451],"study_design_scores_gemma":[0.00026813484,0.00015066417,0.0009353393,0.00006741166,0.00003100403,0.000047618953,0.000007767618,0.075845234,0.00002263021,0.89279485,0.029100442,0.0007288894],"about_ca_topic_score_codex":0.000006789804,"about_ca_topic_score_gemma":0.0000064726155,"teacher_disagreement_score":0.30141622,"about_ca_system_score_codex":0.00012831391,"about_ca_system_score_gemma":0.0004541106,"threshold_uncertainty_score":0.99985844},"labels":[],"label_agreement":null},{"id":"W4409760673","doi":"10.1007/s42484-025-00290-4","title":"Quantum deep sets and sequences","year":2025,"lang":"en","type":"preprint","venue":"Quantum Machine Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum; Computer science; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.03114238965874249,"score_gpt":0.3115091403567371,"score_spread":0.2803667506979946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409760673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071391095,0.007579613,0.97437143,0.0030485322,0.0043817093,0.00088072015,0.00008675224,0.00087460235,0.0016375165],"genre_scores_gemma":[0.9062551,0.0017867188,0.090556,0.00072888646,0.00021963172,0.00014061682,0.00004428222,0.000038120663,0.00023058464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99387133,0.0005078018,0.0012264658,0.0026251907,0.0008656491,0.00090358953],"domain_scores_gemma":[0.99491435,0.0011189382,0.00049990445,0.002729644,0.00038962706,0.00034750398],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014088667,0.0009772034,0.0010681466,0.00053381687,0.0003223349,0.0008659864,0.005201172,0.00052733324,0.00007364579],"category_scores_gemma":[0.0005611053,0.00090599747,0.0003198065,0.000847877,0.000490219,0.00040409953,0.0090929335,0.0018146022,0.0000950736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022971282,0.00030870902,0.0021625964,0.00093273475,0.0001500676,0.00019414678,0.0021582914,0.015780581,0.00003063918,0.4970867,0.00028528608,0.48088726],"study_design_scores_gemma":[0.000042394,0.00010602153,0.0004740277,0.00015843827,0.000018894447,0.000055383658,0.000029276243,0.6030119,0.00030812007,0.3947014,0.0005208362,0.0005733121],"about_ca_topic_score_codex":0.0016048639,"about_ca_topic_score_gemma":0.00026195176,"teacher_disagreement_score":0.89911604,"about_ca_system_score_codex":0.00022332168,"about_ca_system_score_gemma":0.0005751935,"threshold_uncertainty_score":0.99933904},"labels":[],"label_agreement":null},{"id":"W4410278413","doi":"10.61091/jcmcc126-05","title":"Matching-star size Ramsey numbers under connectivity constraint","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Hebei Province; National Natural Science Foundation of China","keywords":"Star (game theory); Constraint (computer-aided design); Matching (statistics); Combinatorics; Mathematics; Computer science; Physics; Statistics; Astrophysics; Geometry","score_opus":0.01256132016380489,"score_gpt":0.2621150696920753,"score_spread":0.24955374952827042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410278413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5605038,0.00022350202,0.4102632,0.00093559077,0.025521625,0.0004145711,0.0000018758603,0.00015138484,0.00198445],"genre_scores_gemma":[0.942743,0.000016884467,0.05634406,0.00016745178,0.00068778597,0.0000023782882,3.886823e-7,0.000025058785,0.000012982092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957462,0.00037167183,0.0017158452,0.0005559694,0.0009808831,0.00062942045],"domain_scores_gemma":[0.99211615,0.0045916946,0.0012917243,0.00071123225,0.0009714139,0.00031780262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003655419,0.0005176587,0.0013080324,0.00029685206,0.00050708523,0.00081321946,0.0015800315,0.00028610916,0.0000103411885],"category_scores_gemma":[0.0010871474,0.00048048125,0.0003788238,0.0008793883,0.00026673893,0.00054509455,0.0011932143,0.0010031669,0.00000389953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004136382,0.0008495282,0.00012239034,0.00017831557,0.00019717295,0.000052564854,0.0011824995,0.00021729754,0.00032482043,0.99317515,0.00016812584,0.0034907646],"study_design_scores_gemma":[0.0042991396,0.00047223896,0.00045355258,0.00035975425,0.000081888735,0.00022993919,0.00056176697,0.018156502,0.00048131184,0.9740822,0.00037662944,0.00044513063],"about_ca_topic_score_codex":0.000046524783,"about_ca_topic_score_gemma":0.0000018738546,"teacher_disagreement_score":0.38223922,"about_ca_system_score_codex":0.0003209464,"about_ca_system_score_gemma":0.0006261053,"threshold_uncertainty_score":0.9997647},"labels":[],"label_agreement":null},{"id":"W4410335433","doi":"10.1088/1367-2630/add7fc","title":"Properties and dynamics of generalized squeezed states","year":2025,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Intelligent Mechatronic Systems (Canada); University of Waterloo","funders":"Ministry of Education, Culture, Sports, Science and Technology","keywords":"Physics; Dynamics (music); Statistical physics; Theoretical physics; Quantum mechanics; Classical mechanics; Acoustics","score_opus":0.021853479623025956,"score_gpt":0.24538294256214815,"score_spread":0.2235294629391222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410335433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2155834,0.0006302119,0.7816432,0.0015465963,0.00037577873,0.000074489944,0.0000013606222,0.000016177626,0.00012874718],"genre_scores_gemma":[0.85849786,0.00015031704,0.14069866,0.00019331808,0.00020671409,7.2682525e-7,6.7043857e-7,0.0000074731315,0.00024425721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990366,0.00007174482,0.00038689774,0.0001323994,0.0002392767,0.00013305346],"domain_scores_gemma":[0.9990325,0.00008327135,0.00026458837,0.0002359239,0.00031657467,0.00006712918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023174245,0.000107316686,0.00030723755,0.00007175829,0.00004013966,0.00007819597,0.00052424474,0.000031298336,0.000001923931],"category_scores_gemma":[0.000041105795,0.000081841325,0.00009106033,0.00030361203,0.00007484811,0.00032365607,0.00024464232,0.00014516778,4.3541561e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101377926,0.00036800883,0.0029485086,0.00019253409,0.00021080348,0.000015017026,0.0024176114,0.013805901,0.0074902237,0.16477084,0.0018694355,0.80580974],"study_design_scores_gemma":[0.0016344745,0.0003210157,0.0019399873,0.00013554867,0.000040313622,0.000024800203,0.0000722906,0.5532284,0.018824834,0.42298174,0.0006235986,0.00017304947],"about_ca_topic_score_codex":0.00005976458,"about_ca_topic_score_gemma":0.000011153401,"teacher_disagreement_score":0.8056367,"about_ca_system_score_codex":0.00005959564,"about_ca_system_score_gemma":0.00028449105,"threshold_uncertainty_score":0.33373922},"labels":[],"label_agreement":null},{"id":"W4410628735","doi":"10.5325/jhistrhetoric.28.1.0105","title":"<i>The Evolution of Mathematics: A Rhetorical Approach</i>, by G. Mitchell Reyes","year":2025,"lang":"en","type":"article","venue":"Journal for the History of Rhetoric","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rhetorical question; Art; Philosophy; Literature","score_opus":0.02117726509435353,"score_gpt":0.25088655730630194,"score_spread":0.2297092922119484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410628735","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005119505,0.02741602,0.9595253,0.0009090027,0.00865132,0.00035244846,0.0000024656206,0.00003698668,0.0025945406],"genre_scores_gemma":[0.29474926,0.0016952876,0.53659356,0.00029585484,0.0014759126,0.0002721026,0.0000024898784,0.00010000528,0.16481553],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980089,0.00014092824,0.00076650776,0.00024318865,0.00052824244,0.00031224373],"domain_scores_gemma":[0.996622,0.0014669154,0.00064815924,0.0007784461,0.00041030947,0.00007416087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023697133,0.00017239316,0.00035908434,0.00014078073,0.00043532284,0.000040385607,0.001957972,0.00008944845,0.0000030102476],"category_scores_gemma":[0.0004433462,0.00010437642,0.0003653287,0.0004506277,0.0002779012,0.00018945686,0.00022149482,0.00031885313,0.0000017129058],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009660486,0.0012976971,0.00013963498,0.00048953685,0.0003278906,0.0000014610534,0.0048137046,0.0008163048,0.004186028,0.24674675,0.7030182,0.038066223],"study_design_scores_gemma":[0.0008324942,0.00033760347,0.00014387016,0.00007788069,0.000111761496,0.000081961785,0.0005563654,0.1876722,0.00033252485,0.1084028,0.70119613,0.00025442248],"about_ca_topic_score_codex":0.000019953255,"about_ca_topic_score_gemma":0.0000021002713,"teacher_disagreement_score":0.42293173,"about_ca_system_score_codex":0.0025824872,"about_ca_system_score_gemma":0.00063126197,"threshold_uncertainty_score":0.6753114},"labels":[],"label_agreement":null},{"id":"W4410713853","doi":"10.31234/osf.io/mjx2v_v1","title":"Illusions of Confidence in Artificial Systems","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Leverhulme Trust; UK Research and Innovation; Wellcome Trust; Canadian Institute for Advanced Research","keywords":"Illusion; Artificial intelligence; Psychology; Computer science; Cognitive psychology","score_opus":0.10959808601367449,"score_gpt":0.3096986493142383,"score_spread":0.2001005633005638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410713853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01849344,0.00014568541,0.97088,0.0011357797,0.006071954,0.0008596973,0.0000195485,0.00056617736,0.0018277646],"genre_scores_gemma":[0.970141,0.000027001446,0.028811477,0.000036389403,0.00017890573,0.000089905174,0.000007257569,0.000018987008,0.00068906543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681747,0.00023519977,0.000958455,0.0010215404,0.0006014687,0.00036584403],"domain_scores_gemma":[0.9969527,0.0005981376,0.00027962518,0.0018178326,0.00025349157,0.00009818322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012720278,0.0002646063,0.00062926253,0.00041759398,0.00004426434,0.00019020005,0.0025636787,0.00028589866,0.000023007473],"category_scores_gemma":[0.00028659496,0.0002477039,0.00015473977,0.0007288917,0.00012075021,0.00011201298,0.0069063976,0.0005543908,0.000120997625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076112974,0.00045400878,0.0020007938,0.000826557,0.00005141754,0.00016691188,0.0027782859,0.21295077,0.0005628293,0.76268417,0.0012384893,0.016278181],"study_design_scores_gemma":[0.00007435454,0.00003918509,0.005899355,0.0002501719,0.000004619565,0.0000069862003,0.00011538773,0.8686897,0.00024366875,0.12424299,0.00011028877,0.000323273],"about_ca_topic_score_codex":0.0049126786,"about_ca_topic_score_gemma":0.00076572836,"teacher_disagreement_score":0.9516476,"about_ca_system_score_codex":0.0001345631,"about_ca_system_score_gemma":0.00042785588,"threshold_uncertainty_score":0.9999975},"labels":[],"label_agreement":null},{"id":"W4410713958","doi":"10.31234/osf.io/mjx2v_v2","title":"Illusions of Confidence in Artificial Systems","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; UK Research and Innovation; HORIZON EUROPE Framework Programme; Government of the United Kingdom; Canadian Institute for Advanced Research","keywords":"Illusion; Artificial intelligence; Computer science; Cognitive psychology; Psychology","score_opus":0.04108516131200808,"score_gpt":0.29532515316988145,"score_spread":0.2542399918578734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410713958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006692736,0.0003319783,0.97451085,0.0007777094,0.0042868718,0.0008189079,0.0000239771,0.00022586081,0.012331092],"genre_scores_gemma":[0.94250983,0.000029588611,0.05600837,0.00008895591,0.00012306788,0.0000849251,0.000005784293,0.000006788473,0.0011426739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970987,0.00025384568,0.0009276662,0.00094739057,0.00046447304,0.00030793154],"domain_scores_gemma":[0.99704766,0.0005214886,0.00024700875,0.0018068263,0.00030131915,0.0000757068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092601066,0.0002619851,0.0006482494,0.0004176278,0.000043156382,0.00016123874,0.0026390685,0.00029284664,0.000027953061],"category_scores_gemma":[0.00022205176,0.0002460251,0.00015275639,0.0006444866,0.00011093574,0.00010276222,0.0067042606,0.00055132096,0.000016867769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000542575,0.00035291348,0.0007953228,0.000652465,0.0000295861,0.000031865344,0.0012087465,0.08078693,0.00015775707,0.8939481,0.000447571,0.021583322],"study_design_scores_gemma":[0.00009399171,0.00003343444,0.0020231465,0.0004254123,0.0000069938833,0.0000048483566,0.00007983105,0.9016772,0.00044803004,0.094569884,0.00032062217,0.00031661868],"about_ca_topic_score_codex":0.0035372018,"about_ca_topic_score_gemma":0.00044736677,"teacher_disagreement_score":0.9358171,"about_ca_system_score_codex":0.00015137011,"about_ca_system_score_gemma":0.0007460687,"threshold_uncertainty_score":0.9999992},"labels":[],"label_agreement":null},{"id":"W4410759958","doi":"10.1016/j.paerosci.2025.101100","title":"The state of hybrid artificial intelligence for interstellar missions","year":2025,"lang":"en","type":"article","venue":"Progress in Aerospace Sciences","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Astrobiology; Aerospace engineering; State (computer science); Physics; Computer science; Astronomy; Engineering","score_opus":0.03840700440084413,"score_gpt":0.3412702750837691,"score_spread":0.30286327068292496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410759958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06095118,0.002811581,0.9227861,0.010599378,0.0015588145,0.00085455383,0.000004882854,0.00009532599,0.00033819058],"genre_scores_gemma":[0.895219,0.00005522836,0.104465485,0.000054482964,0.000017885353,0.0000762199,2.445719e-7,0.0000034277443,0.000108022934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979011,0.00012549505,0.0004935637,0.0005949887,0.00039794215,0.00048693255],"domain_scores_gemma":[0.99788165,0.0011598424,0.00017276383,0.00054574927,0.00017989184,0.000060098744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024403636,0.0001511374,0.0002154228,0.00017783832,0.00045679614,0.00041842586,0.0027357729,0.000022242066,0.0000016582254],"category_scores_gemma":[0.0004345756,0.000101385056,0.00009130704,0.0016080273,0.0016213427,0.0002764458,0.00079296035,0.00013492999,0.0000024617111],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016519945,0.00014452188,0.00406372,0.0000361903,0.000008141749,0.0000023141597,0.00075788697,0.0018138456,0.000059791142,0.08564254,0.000114594586,0.90733993],"study_design_scores_gemma":[0.00006781507,0.0002534269,0.0007432529,0.00011206247,0.0000037539294,0.0000028787438,0.00034266955,0.58723325,0.037040543,0.3730595,0.000964984,0.0001758804],"about_ca_topic_score_codex":0.000015726835,"about_ca_topic_score_gemma":0.000088341054,"teacher_disagreement_score":0.90716404,"about_ca_system_score_codex":0.00005576821,"about_ca_system_score_gemma":0.00028058107,"threshold_uncertainty_score":0.5973905},"labels":[],"label_agreement":null},{"id":"W4410863990","doi":"10.1007/978-3-031-84756-1_11","title":"Generative AI","year":2025,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on games and computational intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Sudbury; University of Alberta","funders":"","keywords":"Generative grammar; Artificial intelligence; Computer science","score_opus":0.01941797278799453,"score_gpt":0.2660577708766524,"score_spread":0.24663979808865785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410863990","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051597503,0.0019114382,0.8946348,0.003958919,0.0004913013,0.00036285236,0.000045146433,0.00020599835,0.098384395],"genre_scores_gemma":[0.15054137,0.0021923778,0.51085347,0.035900827,0.0018042286,0.0003691443,0.00012800035,0.00024887477,0.2979617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996921,0.000103340324,0.0005903149,0.0013733588,0.00065782433,0.00035414516],"domain_scores_gemma":[0.99572426,0.0027983002,0.00024074341,0.0006776171,0.00040411166,0.00015495191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026359592,0.0006672488,0.0006500195,0.0004295799,0.00026860173,0.00045417013,0.0011896269,0.00033615393,0.00022114505],"category_scores_gemma":[0.00021257215,0.0005957558,0.00026898863,0.00014665641,0.00028306467,0.00014717013,0.0005535161,0.00063891534,0.00009716676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010029156,0.000030107825,0.0000015999319,0.000034079032,0.0000919889,0.00001576941,0.00011458077,0.031801064,0.0000011032132,0.57625175,0.0020214797,0.38962647],"study_design_scores_gemma":[0.00003443407,0.0001503462,0.000056415425,0.0002607316,0.000033091303,0.000028895474,0.000004591899,0.21057948,0.00055407954,0.7610139,0.026692742,0.0005912892],"about_ca_topic_score_codex":0.00001425863,"about_ca_topic_score_gemma":0.000013020485,"teacher_disagreement_score":0.3890352,"about_ca_system_score_codex":0.0001505186,"about_ca_system_score_gemma":0.00033802388,"threshold_uncertainty_score":0.9996494},"labels":[],"label_agreement":null},{"id":"W4411055983","doi":"10.2139/ssrn.5282272","title":"Growth in AI Knowledge","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Knowledge management; Computer science; Business; Artificial intelligence","score_opus":0.010975027108442066,"score_gpt":0.2760989157205002,"score_spread":0.26512388861205816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411055983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054352125,0.012480788,0.96548504,0.005438556,0.0036244348,0.0004772108,0.000004618685,0.00025010447,0.0068040583],"genre_scores_gemma":[0.9727418,0.006398129,0.014405597,0.0005659741,0.0013773962,0.000068945745,0.000008577093,0.00004639562,0.0043872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99349254,0.0005413985,0.0008423367,0.0010774203,0.00047620953,0.0035700959],"domain_scores_gemma":[0.9978881,0.00022492252,0.00030542622,0.0010108781,0.00041638964,0.0001543188],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0044126622,0.00051787135,0.0006881048,0.0008500756,0.00017388606,0.0004574454,0.004596339,0.00042602033,0.000010912061],"category_scores_gemma":[0.00021810521,0.00050598435,0.0003936219,0.00094204,0.00007139435,0.00033716974,0.0039950754,0.011569304,0.000050179708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.000014732039,0.00049285765,0.0026776157,0.00011874596,0.00017759866,0.000035562633,0.00088309794,0.0012760386,0.0000056177273,0.8147858,0.00043958388,0.17909275],"study_design_scores_gemma":[0.0005223635,0.00014168592,0.0012574869,0.00015590947,0.000017858372,0.00024855701,0.000050058832,0.042040776,0.000036278383,0.95412326,0.0009349747,0.00047080367],"about_ca_topic_score_codex":0.00023954643,"about_ca_topic_score_gemma":0.0019845527,"teacher_disagreement_score":0.96730655,"about_ca_system_score_codex":0.004757619,"about_ca_system_score_gemma":0.017833501,"threshold_uncertainty_score":0.99973917},"labels":[],"label_agreement":null},{"id":"W4411219706","doi":"10.1007/s00605-025-02079-w","title":"Complexity of well-ordered sets in an ordered Abelian group","year":2025,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Simons Foundation","keywords":"Abelian group; Group (periodic table); Mathematics; Combinatorics; Pure mathematics; Physics; Quantum mechanics","score_opus":0.03914299349381376,"score_gpt":0.31510994104249496,"score_spread":0.2759669475486812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411219706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5295771,0.013554848,0.41725945,0.009121334,0.007331308,0.0059354203,0.0002969442,0.0012439054,0.015679704],"genre_scores_gemma":[0.853766,0.0001771821,0.14465275,0.00050473906,0.00013249788,0.000099837795,0.00007317893,0.00007464576,0.00051916705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99252164,0.00088384235,0.002283503,0.001952134,0.0010980929,0.0012608003],"domain_scores_gemma":[0.9944769,0.00069177983,0.00076512934,0.0032425746,0.0004976339,0.00032599602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002116261,0.00091997813,0.0017464067,0.0010050939,0.00028288295,0.00040829345,0.0037738553,0.0004836013,0.00045397715],"category_scores_gemma":[0.00027507672,0.0009598804,0.0003918678,0.003187859,0.0008885469,0.00079461414,0.0021843645,0.0008424483,0.0002912451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038094155,0.018606577,0.021508776,0.007361208,0.00077614933,0.00042298448,0.022063093,0.0031547344,0.0026196674,0.6156304,0.0053525665,0.3021229],"study_design_scores_gemma":[0.0021381122,0.00044793627,0.04193711,0.0006712598,0.00007977321,0.00001265389,0.00033598268,0.5293578,0.0006273824,0.42020726,0.0032604875,0.0009242443],"about_ca_topic_score_codex":0.0008741324,"about_ca_topic_score_gemma":0.0012509869,"teacher_disagreement_score":0.52620304,"about_ca_system_score_codex":0.00038578006,"about_ca_system_score_gemma":0.00041116288,"threshold_uncertainty_score":0.99928516},"labels":[],"label_agreement":null},{"id":"W4411308457","doi":"10.1080/08865655.2025.2516229","title":"A Review of Border Complexities and Logics of Dis/Order","year":2025,"lang":"en","type":"review","venue":"Journal of Borderlands Studies","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Order (exchange); Epistemology; Political science; Sociology; Economics; Philosophy","score_opus":0.08458873116092218,"score_gpt":0.4057725582123769,"score_spread":0.3211838270514547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411308457","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013260855,0.98722196,0.010441665,0.00053368456,0.00065870606,0.00047750544,0.000035306555,0.000016750051,0.00061307783],"genre_scores_gemma":[0.0000037171715,0.9759416,0.023631949,0.00015667986,0.00012020608,0.000012180203,0.0000029035043,0.000013677563,0.00011707481],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99557984,0.0004530328,0.0026476232,0.00039470513,0.00062088756,0.00030393866],"domain_scores_gemma":[0.99194515,0.0020530408,0.0029797957,0.0006756439,0.0022641884,0.00008218576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001716735,0.0005444029,0.005496446,0.00048403587,0.00009918072,0.00004096836,0.0013215066,0.00014950968,0.000011971957],"category_scores_gemma":[0.001693187,0.00035268653,0.00077861804,0.0012573082,0.00044165223,0.0002102401,0.0014118019,0.00050111796,5.2652575e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046808946,0.0001390371,0.000027949993,0.28195184,0.0009338183,0.000014645483,0.00030707143,0.000002216426,2.584461e-8,0.0020447194,0.0033963693,0.71117765],"study_design_scores_gemma":[0.0003791643,0.00071386015,0.000036559515,0.22843738,0.0011902353,0.00022935671,0.00013589673,0.00005341724,3.6674226e-7,0.005444543,0.7629926,0.0003866204],"about_ca_topic_score_codex":0.000008360473,"about_ca_topic_score_gemma":0.0000091677075,"teacher_disagreement_score":0.7595962,"about_ca_system_score_codex":0.000079446574,"about_ca_system_score_gemma":0.0007544578,"threshold_uncertainty_score":0.99989253},"labels":[],"label_agreement":null},{"id":"W4411374939","doi":"10.1145/3724389.3731277","title":"Extracting Notional Machines for Databases","year":2025,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Notional amount; Computer science; Database; Information retrieval; Business","score_opus":0.03966962032184706,"score_gpt":0.3354051139444419,"score_spread":0.2957354936225948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411374939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020836873,0.00006605643,0.98429507,0.0031591568,0.00085433887,0.00020406976,0.000009280805,0.0002728042,0.009055523],"genre_scores_gemma":[0.12227625,0.0000011190779,0.87466776,0.0008451004,0.00013626905,0.000035814297,0.000012063839,0.0000038592257,0.0020217611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990542,0.000028016424,0.00018772006,0.00040037167,0.00013523613,0.00019444872],"domain_scores_gemma":[0.99842083,0.0009447973,0.000036604786,0.00045323014,0.000108910725,0.00003563139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035267655,0.00009789282,0.00011126704,0.0000897707,0.00015552311,0.00011522138,0.00059912074,0.00002055974,0.0000498314],"category_scores_gemma":[0.00030745243,0.00008339298,0.000067235465,0.00027706433,0.000024597768,0.0004061691,0.0004615384,0.000067027584,0.000013131766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041812127,0.00013408504,0.0028220308,0.000034920762,0.000014541082,0.0000018267791,0.000033342316,0.00026540336,0.00046467758,0.7142215,0.0045111394,0.27749237],"study_design_scores_gemma":[0.0003026084,0.000027184218,0.013369953,0.000014543884,0.000005344668,0.000007989162,0.000010866951,0.8987886,0.0017972642,0.0586417,0.026866062,0.00016788847],"about_ca_topic_score_codex":0.00006347515,"about_ca_topic_score_gemma":0.000043491236,"teacher_disagreement_score":0.8985232,"about_ca_system_score_codex":0.00003132636,"about_ca_system_score_gemma":0.00008691403,"threshold_uncertainty_score":0.3400667},"labels":[],"label_agreement":null},{"id":"W4411408442","doi":"10.1109/mnano.2025.3570822","title":"Approximate and Stochastic Ising Machines","year":2025,"lang":"en","type":"article","venue":"IEEE Nanotechnology Magazine","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Ising model; Statistical physics; Computer science; Physics","score_opus":0.008802828778388574,"score_gpt":0.24670999891556683,"score_spread":0.23790717013717827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411408442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0845005,0.00066323706,0.90535873,0.0064203097,0.0010601234,0.00028512077,0.000002509447,0.0011940226,0.0005154615],"genre_scores_gemma":[0.8873797,0.000020680183,0.11134812,0.000537302,0.00005319521,0.00003858616,0.0000013257603,0.000014876939,0.000606184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982383,0.000056479963,0.00032677042,0.0007756263,0.00015208291,0.00045068914],"domain_scores_gemma":[0.9985976,0.00020407044,0.00008592077,0.0009659784,0.00009349164,0.000052938587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033210023,0.0002564306,0.00035825092,0.0005113921,0.000182566,0.00010883779,0.0010719288,0.0002808333,0.0000059976583],"category_scores_gemma":[0.00019399067,0.00023851264,0.00005292107,0.0010796167,0.00034454162,0.00021465507,0.00085719756,0.00037922335,0.00004662556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002172735,0.00024150703,0.0007691049,0.00013004207,0.00007476798,0.00007584246,0.00016592494,0.0015142476,0.034372423,0.12930107,0.0014692211,0.8318641],"study_design_scores_gemma":[0.0009648455,0.0001575496,0.0017954115,0.00006320867,0.000026115411,0.00019432677,0.000007261825,0.77301997,0.0067632743,0.21445003,0.0021194792,0.00043855098],"about_ca_topic_score_codex":0.000011246538,"about_ca_topic_score_gemma":0.00001662164,"teacher_disagreement_score":0.83142555,"about_ca_system_score_codex":0.00006146825,"about_ca_system_score_gemma":0.000064055064,"threshold_uncertainty_score":0.9726263},"labels":[],"label_agreement":null},{"id":"W4411505518","doi":"10.1007/s00224-025-10227-w","title":"Normality, Relativization, and Randomness","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Gobierno de Aragón; Ministerio de Ciencia e Innovación","keywords":"Normality; Randomness; Mathematics; Statistics; Psychology; Econometrics; Linguistics; Philosophy","score_opus":0.009406357427320907,"score_gpt":0.24446849095528275,"score_spread":0.23506213352796185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411505518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09912467,0.0007646134,0.8919042,0.00015258715,0.0011831394,0.00034774686,0.0000011910491,0.00023457441,0.006287285],"genre_scores_gemma":[0.99253416,0.0000036913295,0.0070327655,0.00005386654,0.00006139182,0.0000035928606,0.0000010121537,0.0000062056674,0.00030329011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976651,0.0008659447,0.0005956015,0.00040095716,0.00024093606,0.00023146684],"domain_scores_gemma":[0.99719834,0.0016177939,0.00024164445,0.0006462953,0.0002438992,0.00005199672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003507374,0.00016566993,0.0004401751,0.00018756262,0.00018080593,0.00013632432,0.0007443272,0.00007512085,0.0000015761934],"category_scores_gemma":[0.00023294373,0.0001517733,0.000061494735,0.0006247871,0.00016930804,0.00019903597,0.00067944976,0.00012397704,0.000003783315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016044947,0.000058444697,0.0046229525,0.0002676307,0.000043894823,0.0000018829501,0.0015559153,0.005715434,0.000064868786,0.96907043,0.000075890675,0.01850659],"study_design_scores_gemma":[0.0018093833,0.000087098866,0.029863855,0.00047661955,0.000027492539,0.000044685818,0.00020738099,0.77232456,0.00040563833,0.19391939,0.00050071004,0.000333203],"about_ca_topic_score_codex":0.00003393279,"about_ca_topic_score_gemma":9.4859166e-7,"teacher_disagreement_score":0.8934095,"about_ca_system_score_codex":0.000040049163,"about_ca_system_score_gemma":0.000074601725,"threshold_uncertainty_score":0.6189136},"labels":[],"label_agreement":null},{"id":"W4411609311","doi":"10.4006/0836-1398-38.2.114","title":"The physics of the discontinuous and the set of realities","year":2025,"lang":"en","type":"article","venue":"Physics Essays","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Set (abstract data type); Theoretical physics; Programming language; Computer science","score_opus":0.012501559556177972,"score_gpt":0.24330164281079308,"score_spread":0.23080008325461512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411609311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045616314,0.0013826751,0.8691033,0.01748901,0.0017419211,0.001281453,0.000071301896,0.00012555254,0.06318843],"genre_scores_gemma":[0.9987884,0.00004212394,0.0006941317,0.000100685305,0.00010190377,0.000017821538,6.2615044e-7,0.0000046948967,0.00024957868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988235,0.00025656406,0.00025354768,0.00021621273,0.00027298293,0.00017716234],"domain_scores_gemma":[0.9972783,0.0012286782,0.00018916321,0.0011487622,0.00013991659,0.000015225981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005901481,0.00012361821,0.0002412452,0.000008356582,0.0002553485,0.00009513408,0.0014269316,0.000022762111,2.990209e-7],"category_scores_gemma":[0.00008019387,0.000056496887,0.00013313169,0.00043968658,0.00093362003,0.00012706121,0.0011855115,0.00014648668,4.891619e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062504287,0.000027457676,0.00038995675,0.000029215224,0.00003030032,8.269794e-8,0.0019216359,0.00021547533,0.000042849533,0.94352025,0.00024774787,0.05356876],"study_design_scores_gemma":[0.00031930907,0.000013971049,0.0012068273,0.000027061104,0.000019502633,5.570621e-7,0.0002277138,0.045443486,0.0017317993,0.9506776,0.00026874203,0.000063483036],"about_ca_topic_score_codex":0.00019621043,"about_ca_topic_score_gemma":0.000020871254,"teacher_disagreement_score":0.95317215,"about_ca_system_score_codex":0.000014872218,"about_ca_system_score_gemma":0.00008240266,"threshold_uncertainty_score":0.3439962},"labels":[],"label_agreement":null},{"id":"W4411777705","doi":"10.1093/logcom/exaf034","title":"Relations enumerable from positive information","year":2025,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Österreichische Agentur für Internationale Mobilität und Kooperation in Bildung, Wissenschaft und Forschung; Austrian Science Fund; European Commission","keywords":"Recursively enumerable language; Computer science; Programming language; Algorithm","score_opus":0.008665284595332114,"score_gpt":0.25040322301304807,"score_spread":0.24173793841771596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411777705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03775312,0.00027140218,0.95636296,0.0026602657,0.00047105137,0.000080137426,0.0000020492519,0.000026898657,0.0023721063],"genre_scores_gemma":[0.8610445,0.000017362901,0.1382933,0.00055321015,0.00005261069,9.638142e-7,0.0000052767514,0.0000011394482,0.00003162605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911904,0.00009214933,0.00041837763,0.00009744516,0.00018280403,0.00009018122],"domain_scores_gemma":[0.9988688,0.00032439097,0.0003003427,0.000088633766,0.00037404892,0.00004376899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031245046,0.00007906456,0.00015482151,0.0001951226,0.00012613572,0.00018665132,0.00020666556,0.000052900115,0.00000569487],"category_scores_gemma":[0.00008772925,0.00006712346,0.000051943105,0.0003253319,0.000028336175,0.0012835427,0.00009983786,0.00015584883,0.0000088669385],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004729968,0.00018368027,0.0061053685,0.000021077436,0.00013084438,0.000015653957,0.0036454431,0.047800828,0.00015323104,0.15810618,0.003635177,0.78015524],"study_design_scores_gemma":[0.0006414577,0.00018978078,0.11947164,0.000050876948,0.000024369556,0.00003034549,0.00014782531,0.35929447,0.000106547246,0.5190937,0.00084422383,0.0001047581],"about_ca_topic_score_codex":0.000027969627,"about_ca_topic_score_gemma":0.0000013715671,"teacher_disagreement_score":0.82329136,"about_ca_system_score_codex":0.00006994558,"about_ca_system_score_gemma":0.000103899,"threshold_uncertainty_score":0.27372155},"labels":[],"label_agreement":null},{"id":"W4412376432","doi":"10.55016/ojs/cdm.v10i1.62182","title":"Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Lemma (botany); Mathematics; Combinatorics; Finite field; Pure mathematics; Discrete mathematics","score_opus":0.03380846415234004,"score_gpt":0.3295930332362433,"score_spread":0.29578456908390327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08508471,0.00008549843,0.91180825,0.0012304647,0.00020457912,0.0007453997,0.0006078227,0.000082274826,0.00015101673],"genre_scores_gemma":[0.8375501,0.000003606389,0.16200498,0.00012876539,0.00006437982,0.000095912575,0.000028356159,0.000011188704,0.0001127365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840635,0.00006477603,0.0005116208,0.0003485953,0.00023617526,0.00043248877],"domain_scores_gemma":[0.99767643,0.00073649763,0.00020526427,0.0006970853,0.00043915986,0.0002455575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012971881,0.00018735921,0.00047308957,0.000115910814,0.00017345691,0.00016864233,0.00047408097,0.00011763667,0.000008548843],"category_scores_gemma":[0.0027755795,0.00017306843,0.00010233678,0.00028815184,0.000058044094,0.00026904943,0.0006402288,0.00009942442,0.0000073688893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007371113,0.00083186175,0.0013131927,0.0006964867,0.00015454629,0.000014095513,0.010563077,0.00026494474,0.0016053304,0.97337246,0.0065789116,0.0045313616],"study_design_scores_gemma":[0.003621273,0.0007307357,0.0038558834,0.00025388954,0.00012950978,0.000045509685,0.00039596148,0.59757394,0.0062733027,0.3797405,0.006514769,0.00086470676],"about_ca_topic_score_codex":0.000018149201,"about_ca_topic_score_gemma":0.0000124534545,"teacher_disagreement_score":0.75246537,"about_ca_system_score_codex":0.000111582325,"about_ca_system_score_gemma":0.00013248755,"threshold_uncertainty_score":0.70575255},"labels":[],"label_agreement":null},{"id":"W4412636726","doi":"10.1007/978-3-031-99264-3_36","title":"Making Generative AI Hallucinations Useful by Reassessing the Troublemaker Agent Strategy","year":2025,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Generative grammar; Computer science; Artificial intelligence","score_opus":0.08497441642269019,"score_gpt":0.349361195893825,"score_spread":0.26438677947113487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412636726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000133654885,0.0006379459,0.8549386,0.0073352614,0.0003915965,0.0005844588,0.00002360822,0.000121013756,0.13595414],"genre_scores_gemma":[0.21084018,0.0039498834,0.75351477,0.019781621,0.00023756095,0.00032884596,0.00030843043,0.000044975302,0.010993761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973182,0.00013879153,0.0009822156,0.0005171792,0.00068739936,0.00035620268],"domain_scores_gemma":[0.99481845,0.00057529635,0.00046451495,0.0032165197,0.00083602016,0.00008918312],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017878439,0.00034800323,0.0003321867,0.00078544253,0.0014869869,0.0025786548,0.0053246254,0.00015709856,0.000010857986],"category_scores_gemma":[0.00007936717,0.00029089075,0.00008355748,0.00092092727,0.0011570613,0.0068689836,0.004500379,0.0008103724,0.000021626269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.074893e-7,0.00002846618,0.000029612473,0.000019527706,0.0000109848215,4.7942797e-7,0.001422025,0.001368557,0.0000021371238,0.7120825,0.002282887,0.28275192],"study_design_scores_gemma":[0.00021718898,0.000041815405,0.0010654373,0.00021198788,0.000010522435,0.000021930713,0.000038317157,0.83718365,0.000008027785,0.041385695,0.11945854,0.00035689247],"about_ca_topic_score_codex":0.00002144053,"about_ca_topic_score_gemma":0.000043068972,"teacher_disagreement_score":0.8358151,"about_ca_system_score_codex":0.00041716965,"about_ca_system_score_gemma":0.0008272964,"threshold_uncertainty_score":0.99995434},"labels":[],"label_agreement":null},{"id":"W4412645768","doi":"10.1093/oso/9780192844835.001.0001","title":"The Computational Evolution of Cognitive Architectures","year":2025,"lang":"en","type":"book","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Cognition; Cognitive science; Psychology; Neuroscience","score_opus":0.0094189609532935,"score_gpt":0.24390379008142157,"score_spread":0.23448482912812807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412645768","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009620181,0.00064911495,0.6976704,0.00037928257,0.0004642039,0.00036215317,0.000025168274,0.00012217884,0.30031785],"genre_scores_gemma":[0.024215724,0.000020420883,0.086065955,0.00042184105,0.0004208397,0.000060920884,0.00008964605,0.00002807464,0.8886766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796045,0.00015226203,0.00046209476,0.00055608485,0.00062489515,0.00024420038],"domain_scores_gemma":[0.9941247,0.004440693,0.00025608923,0.000540594,0.00058691826,0.00005100148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004221411,0.00026467306,0.00032974163,0.00020299104,0.0002147032,0.000106777385,0.0014454171,0.00016540194,0.000020934413],"category_scores_gemma":[0.00026653957,0.00018381447,0.00021748952,0.0002547336,0.00035084737,0.000046992256,0.00096381677,0.00038338348,0.000021903938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012673882,0.0000642792,0.00002674886,0.00006623095,0.00013640063,0.0000036292706,0.00022597956,0.005644178,4.1161815e-7,0.8223686,0.015534273,0.15591659],"study_design_scores_gemma":[0.00021348665,0.00010067011,0.0018074743,0.00015909434,0.000023936982,0.000010273935,0.000011972311,0.1305675,0.000009874843,0.86042345,0.0064511187,0.00022115326],"about_ca_topic_score_codex":0.000032522606,"about_ca_topic_score_gemma":0.000050684343,"teacher_disagreement_score":0.61160445,"about_ca_system_score_codex":0.0002863253,"about_ca_system_score_gemma":0.0017522413,"threshold_uncertainty_score":0.74957365},"labels":[],"label_agreement":null},{"id":"W4413028897","doi":"10.1007/978-3-032-00800-8_30","title":"Value Under Ignorance in Universal Artificial Intelligence","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ignorance; Computer science; Value (mathematics); Artificial intelligence; Machine learning; Philosophy; Epistemology","score_opus":0.025253699761867872,"score_gpt":0.26169167897867796,"score_spread":0.2364379792168101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413028897","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009153386,0.00042163735,0.98815244,0.0021459938,0.0035802955,0.0006510253,0.0000067918822,0.00026011342,0.0046901572],"genre_scores_gemma":[0.22763543,0.00007622794,0.76842904,0.0025571832,0.0006772927,0.00001707375,0.0000066922635,0.000051309118,0.000549728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351627,0.00012709311,0.0010161307,0.0029052822,0.0013184062,0.0011168417],"domain_scores_gemma":[0.9955638,0.0013299114,0.00030444516,0.0022495952,0.00033820825,0.00021401016],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015649336,0.00081584684,0.00088229816,0.0018507476,0.00025564522,0.0006786518,0.006563749,0.0005325205,0.000031386848],"category_scores_gemma":[0.00019490116,0.0008373039,0.0002142713,0.0024069145,0.001269023,0.000798985,0.0034671323,0.0015985568,0.00006085523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006529678,0.000056691457,0.000028989813,0.00002873081,0.0000057901275,0.00012917277,0.00030786547,0.21354392,0.000019103976,0.26187706,0.000005901585,0.5239902],"study_design_scores_gemma":[0.00006956699,0.000085389445,0.00011212746,0.00025601435,0.000003829673,0.00001820923,5.866876e-7,0.5129341,0.00042078726,0.48541284,0.00018229829,0.00050425716],"about_ca_topic_score_codex":0.00019110096,"about_ca_topic_score_gemma":0.00069122814,"teacher_disagreement_score":0.52348596,"about_ca_system_score_codex":0.0012367886,"about_ca_system_score_gemma":0.0017139364,"threshold_uncertainty_score":0.99940777},"labels":[],"label_agreement":null},{"id":"W4413068340","doi":"10.1007/978-3-031-84560-4_1","title":"Introduction to Programming","year":2025,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Programming language","score_opus":0.01583142257196041,"score_gpt":0.2606746907689,"score_spread":0.24484326819693958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413068340","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036478577,0.00013828094,0.9615038,0.0049732565,0.0063040247,0.0010130306,0.0000024621465,0.0005778636,0.025450813],"genre_scores_gemma":[0.0012807829,0.000012472891,0.94604677,0.0010501824,0.0025028521,0.000044972876,0.0000035776773,0.000029617748,0.04902875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939499,0.000047257243,0.00078399654,0.0029591753,0.0013190729,0.00094057893],"domain_scores_gemma":[0.99599564,0.00019648486,0.00022213165,0.0027909032,0.0004794652,0.00031538424],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020690586,0.00058915117,0.0006370364,0.0018172602,0.00030596787,0.0009995265,0.0059745447,0.00022862514,0.000041393967],"category_scores_gemma":[0.000119082884,0.0006059498,0.00015003796,0.001715861,0.0005421195,0.00086979475,0.0055534435,0.0007276781,0.00029021213],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022102295,0.00004675908,0.000009151545,0.000032264463,0.0000051714997,0.000038081078,0.00026943727,0.001603399,0.00000840722,0.1702939,0.0034230025,0.8242682],"study_design_scores_gemma":[0.00038223367,0.0005593034,0.0005856448,0.0005124615,0.000013224051,0.00011261723,0.0000019600495,0.33123702,0.00018630567,0.116420396,0.54827523,0.0017136259],"about_ca_topic_score_codex":0.000024548219,"about_ca_topic_score_gemma":0.00003797793,"teacher_disagreement_score":0.8225546,"about_ca_system_score_codex":0.0008476032,"about_ca_system_score_gemma":0.0008873285,"threshold_uncertainty_score":0.9996392},"labels":[],"label_agreement":null},{"id":"W4413077457","doi":"10.1007/s10107-025-02239-8","title":"Fast Combinatorial Algorithms for Efficient Sortation","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Numerical analysis; Combinatorial analysis; Combinatorics; Mathematical analysis","score_opus":0.022240206692915074,"score_gpt":0.3006588175016855,"score_spread":0.2784186108087704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413077457","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003072236,0.000043471537,0.9918641,0.0007809166,0.0012452563,0.0013006536,0.0000014926997,0.00050289935,0.0011890183],"genre_scores_gemma":[0.19988255,2.9019574e-7,0.7993556,0.000083040555,0.00012997261,0.000377118,0.000005107401,0.000014124133,0.00015215961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797916,0.00006210058,0.0005091778,0.00056962605,0.00037584084,0.000504112],"domain_scores_gemma":[0.99825263,0.0007476684,0.00009942049,0.00057944085,0.00021347593,0.00010737657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088763086,0.00021182971,0.0003291535,0.00013467786,0.000244534,0.00040291838,0.00079576654,0.000106146545,0.000007818822],"category_scores_gemma":[0.00051307294,0.00018936496,0.00017546413,0.00062102266,0.000095300486,0.00013001807,0.00034803175,0.00015264902,0.00003437521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004643652,0.00045194806,0.000015187536,0.00018105005,0.000018681616,0.0000020753141,0.0004423619,0.00025922593,0.000025181278,0.616722,0.000067851,0.38180983],"study_design_scores_gemma":[0.0005976099,0.000106647494,0.00004923012,0.00004881862,0.000016575548,0.0000032869998,0.0000667274,0.6481553,0.00041928355,0.3484514,0.001914536,0.00017063081],"about_ca_topic_score_codex":0.0000038487838,"about_ca_topic_score_gemma":7.5978164e-7,"teacher_disagreement_score":0.64789605,"about_ca_system_score_codex":0.00011454487,"about_ca_system_score_gemma":0.0000844449,"threshold_uncertainty_score":0.7722079},"labels":[],"label_agreement":null},{"id":"W4413174259","doi":"10.2139/ssrn.5373023","title":"Emergent AI Minds: A Phenomenological Study","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Commission Scolaire des Hautes Rivières","funders":"","keywords":"Psychology; Cognitive science; Phenomenology (philosophy); Epistemology; Psychoanalysis; Philosophy","score_opus":0.02322583530706929,"score_gpt":0.30105307213409,"score_spread":0.2778272368270207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413174259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10503828,0.0068076425,0.8729697,0.006255131,0.0049114786,0.0015904082,0.000008176581,0.00046435566,0.0019548612],"genre_scores_gemma":[0.9866706,0.0013155417,0.007670085,0.0004879693,0.0011860011,0.00014343658,0.0000066887146,0.00003259942,0.0024870625],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911545,0.0008387257,0.0011509707,0.0016252085,0.0010507571,0.0041798465],"domain_scores_gemma":[0.99678713,0.0001539023,0.0005210628,0.0018536592,0.00043358788,0.00025066888],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0047056815,0.0007346645,0.0009449349,0.00054178544,0.00043191743,0.0006190112,0.005969976,0.00041171061,0.000065029126],"category_scores_gemma":[0.00018296884,0.0006351103,0.0005535436,0.0007188202,0.00008954269,0.00024997076,0.006607964,0.010908973,0.0000557809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013499353,0.008482125,0.009485089,0.00012323397,0.0034980199,0.0002850838,0.0066022803,0.015473416,0.00002435846,0.3828173,0.0011255904,0.5719485],"study_design_scores_gemma":[0.0015516446,0.0020016248,0.0018693213,0.000057233403,0.00013727498,0.0002699016,0.0012862388,0.022397943,0.00000944627,0.96767366,0.0017891749,0.0009565613],"about_ca_topic_score_codex":0.00012410355,"about_ca_topic_score_gemma":0.00044924766,"teacher_disagreement_score":0.8816323,"about_ca_system_score_codex":0.0036051269,"about_ca_system_score_gemma":0.00910737,"threshold_uncertainty_score":0.99961},"labels":[],"label_agreement":null},{"id":"W4413285727","doi":"10.1007/978-3-031-96688-0_10","title":"Fair Play for the Machines: Turing on Charity Versus Skepticism on the Question of Thinking Machines","year":2025,"lang":"en","type":"book-chapter","venue":"Synthese Library/Synthese library","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Skepticism; Turing; Computer science; Cognitive science; Epistemology; Philosophy; Psychology; Programming language","score_opus":0.025639099818741906,"score_gpt":0.25091841118374986,"score_spread":0.22527931136500795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413285727","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010516285,0.004692869,0.04072444,0.07087558,0.009751137,0.00794156,0.0017344318,0.004184908,0.8590435],"genre_scores_gemma":[0.28587955,0.0042752638,0.17136757,0.022467183,0.0146030495,0.003090419,0.0009844569,0.0026897208,0.4946428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99371094,0.0006066483,0.0013803499,0.0020189045,0.0013542641,0.0009288951],"domain_scores_gemma":[0.9675574,0.027037306,0.0009627312,0.0041515054,0.00007063952,0.00022045957],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0011230009,0.00151294,0.0013902654,0.00074075547,0.0008860901,0.0010783445,0.00813854,0.0008018647,0.00061976543],"category_scores_gemma":[0.00092112634,0.00091927557,0.0011772093,0.00045510582,0.00060062326,0.002725256,0.0035393967,0.0019051983,0.00009054739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005343619,0.00017859855,0.00004439608,0.00027579334,0.00038879117,0.000029171904,0.00072343193,0.00030817123,0.000015267531,0.9095407,0.0063481997,0.08161308],"study_design_scores_gemma":[0.0008170994,0.00087970647,0.00041145156,0.0035727639,0.0002570198,0.000019068397,0.0000467508,0.10038185,0.004450175,0.7913145,0.09604878,0.0018008263],"about_ca_topic_score_codex":0.000033688637,"about_ca_topic_score_gemma":0.00000492426,"teacher_disagreement_score":0.36440066,"about_ca_system_score_codex":0.00008714143,"about_ca_system_score_gemma":0.00048341046,"threshold_uncertainty_score":0.99995863},"labels":[],"label_agreement":null},{"id":"W4413497654","doi":"10.34028/iajit/22/5/1","title":"Exploring the Intersection of Information Theory and Machine Learning","year":2025,"lang":"en","type":"article","venue":"The International Arab Journal of Information Technology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Intersection (aeronautics); Artificial intelligence; Human–computer interaction; Machine learning; Transport engineering","score_opus":0.016055102064805725,"score_gpt":0.23077044416067743,"score_spread":0.2147153420958717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413497654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1572015,0.00006735973,0.83154815,0.008651604,0.000993783,0.00009678374,0.0000011411678,0.00004974352,0.0013899537],"genre_scores_gemma":[0.9942787,0.00009286246,0.0052508074,0.00032230438,0.000025484445,0.000007537294,0.0000014499009,0.0000013225925,0.00001953201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987672,0.00009048233,0.0007145415,0.000047134366,0.0002877979,0.00009287269],"domain_scores_gemma":[0.9980874,0.00040712178,0.0007224968,0.0001934755,0.00057550485,0.000013983879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020021603,0.00008498536,0.00012890209,0.000683473,0.00013722896,0.00012706117,0.0012480847,0.000042818552,0.000006428466],"category_scores_gemma":[0.00103232,0.00005050601,0.000058805777,0.0005197225,0.00014450646,0.0033310489,0.0004900183,0.000452929,0.0000058440296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050892737,0.000011099622,0.0004786452,0.000011088877,0.000061396626,2.6003377e-7,0.0019853895,0.0023228738,0.00009082772,0.53410286,0.000047820384,0.46083683],"study_design_scores_gemma":[0.0015217352,0.00052120845,0.01743587,0.0002430648,0.000041118554,0.0008599046,0.0069448403,0.30674964,0.019903325,0.6086835,0.03686239,0.00023337074],"about_ca_topic_score_codex":0.0000137415645,"about_ca_topic_score_gemma":0.0000027038523,"teacher_disagreement_score":0.8370772,"about_ca_system_score_codex":0.000107969296,"about_ca_system_score_gemma":0.00006736729,"threshold_uncertainty_score":0.241493},"labels":[],"label_agreement":null},{"id":"W4413558190","doi":"10.1080/08956308.2025.2532316","title":"The Economics of Artificial Intelligence","year":2025,"lang":"en","type":"article","venue":"Research-Technology Management","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Artificial intelligence; Computer science","score_opus":0.056547311975691766,"score_gpt":0.36178971635159024,"score_spread":0.30524240437589845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413558190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01151678,0.00057469006,0.9351822,0.03693093,0.0005717066,0.00082919776,9.646128e-7,0.00027985853,0.014113649],"genre_scores_gemma":[0.93593735,0.0012516849,0.060901705,0.00008743976,0.00003325378,0.00019611185,6.378048e-7,0.000009922896,0.0015819198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803245,0.00015942217,0.00042883155,0.0005413258,0.00027073262,0.00056721753],"domain_scores_gemma":[0.99744326,0.00047619126,0.00006737264,0.0017585589,0.00021951774,0.000035073706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026727875,0.000114439244,0.00017375815,0.0008937188,0.00038581897,0.00013986474,0.0038945153,0.00010955091,0.000006239827],"category_scores_gemma":[0.00020679426,0.00009224476,0.0000623005,0.0023089193,0.0010255894,0.00009790969,0.004902659,0.00040993496,0.000073765106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036269244,0.0000487244,0.000035436682,0.000016263135,0.000027631713,0.0000041501517,0.000015696665,0.00018742279,0.000012159988,0.5624312,0.00022518117,0.4369925],"study_design_scores_gemma":[0.000039923278,0.00009561113,0.00024339347,0.000017674889,0.0000033706121,0.0000012441739,0.00036340705,0.08878534,0.004251002,0.8882508,0.017873133,0.000075081145],"about_ca_topic_score_codex":0.000016767079,"about_ca_topic_score_gemma":0.000051747036,"teacher_disagreement_score":0.92442054,"about_ca_system_score_codex":0.00018093437,"about_ca_system_score_gemma":0.00008840966,"threshold_uncertainty_score":0.72370434},"labels":[],"label_agreement":null},{"id":"W4413813760","doi":"10.4171/owr/2025/2","title":"Set Theory","year":2025,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Forcing (mathematics); Set (abstract data type); Set theory; Universal set; Field (mathematics); Mathematics; Computer science; Algebra over a field; Pure mathematics","score_opus":0.01177603001502554,"score_gpt":0.2620725169809206,"score_spread":0.25029648696589507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413813760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033672847,0.00051341916,0.8705695,0.0014069305,0.002885907,0.00036418004,0.0000014504567,0.0007793154,0.08980643],"genre_scores_gemma":[0.9589687,0.0000058626165,0.03121564,0.0008443842,0.00008844933,0.00003854099,0.0000053212684,0.00001114071,0.008821964],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976672,0.00017627061,0.0005495431,0.0008439776,0.00035898943,0.00040403396],"domain_scores_gemma":[0.99740654,0.00025256927,0.00017156011,0.0019148241,0.00014444649,0.000110072804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015377136,0.00021023893,0.00027008928,0.0001657209,0.0001699774,0.00021210608,0.000745234,0.000103665625,0.00007587765],"category_scores_gemma":[0.00033667378,0.00019061717,0.00014576127,0.00074037525,0.000085114065,0.00031023455,0.0008790105,0.00021607197,0.00004922795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010085696,0.00031165415,0.034075793,0.000093922994,0.00012873659,0.0026411316,0.0013101769,0.00055876473,0.00044466794,0.4628155,0.02415258,0.47345698],"study_design_scores_gemma":[0.00023597405,0.0000690236,0.045905367,0.000045142475,0.000024467663,0.0008184761,0.00005530141,0.012529282,0.0028626618,0.81114864,0.12578174,0.00052389473],"about_ca_topic_score_codex":0.00004381872,"about_ca_topic_score_gemma":0.000009824683,"teacher_disagreement_score":0.9252958,"about_ca_system_score_codex":0.000107477936,"about_ca_system_score_gemma":0.00023111768,"threshold_uncertainty_score":0.77731425},"labels":[],"label_agreement":null},{"id":"W4413966130","doi":"10.70930/tac/ppe2lhca","title":"Thestrong amalgamation property and (effective) codescent morphisms","year":2003,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Morphism; Property (philosophy); Mathematics; Computer science; Pure mathematics; Philosophy; Epistemology","score_opus":0.007957139927118391,"score_gpt":0.22472797449508483,"score_spread":0.21677083456796645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06288482,0.000453022,0.9336764,0.00015550737,0.000028465234,0.0006662607,0.0000018433597,0.00007962756,0.0020540056],"genre_scores_gemma":[0.9891522,0.000039715687,0.010406003,0.000025536421,0.00001734576,0.00021990167,0.0000017570849,0.0000048727156,0.00013265731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991281,0.00021000837,0.00016880047,0.0002708618,0.00010053776,0.000121662386],"domain_scores_gemma":[0.9990893,0.0002953848,0.000081726175,0.00038667055,0.00009480511,0.000052118965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007822755,0.00010861382,0.00014466578,0.000049407223,0.00016394402,0.000064566055,0.00021604386,0.00003720264,0.000005241484],"category_scores_gemma":[0.000058653506,0.000075864045,0.000021185395,0.00020491949,0.0003104142,0.00023784397,0.000105413645,0.000067981084,0.000002559063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005573928,0.000054443797,0.00043524423,0.000028756844,0.0000072647003,1.2469424e-7,0.0005610535,0.000025810297,0.00064791116,0.90370065,0.0000042835372,0.09452891],"study_design_scores_gemma":[0.00023841395,0.00009588836,0.0073073194,0.000008404363,0.000016359634,0.000025703994,0.00026003286,0.0017727569,0.017333208,0.96875423,0.0040127276,0.00017495926],"about_ca_topic_score_codex":0.0000070279502,"about_ca_topic_score_gemma":0.000001050737,"teacher_disagreement_score":0.9262674,"about_ca_system_score_codex":0.000014621751,"about_ca_system_score_gemma":0.000028662093,"threshold_uncertainty_score":0.3093646},"labels":[],"label_agreement":null},{"id":"W4413966143","doi":"10.70930/tac/snz2n35e","title":"A universal characterisation of codescent objects","year":2019,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science","score_opus":0.006098162286105265,"score_gpt":0.21688935169009088,"score_spread":0.2107911894039856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41217995,0.00010637166,0.58516806,0.0001037608,0.000052739913,0.00036722704,0.000006364334,0.00005194027,0.0019635598],"genre_scores_gemma":[0.9967568,0.000019401146,0.003054001,0.000016620503,0.00001708112,0.000017320035,0.0000048647535,0.000002945034,0.00011096126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993991,0.00006880342,0.00016791877,0.00018166674,0.000101066995,0.00008141756],"domain_scores_gemma":[0.99908763,0.00020684412,0.00013072902,0.00043268048,0.0001138173,0.000028295197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035567099,0.00006956235,0.0001426634,0.00006305069,0.000039872033,0.000016839458,0.0003261995,0.000031400057,0.00001668799],"category_scores_gemma":[0.000012642869,0.00006473356,0.00002749967,0.00023363002,0.0001514375,0.00020441387,0.0001501283,0.00004360537,0.000008048315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015041774,0.00005904353,0.00073594553,0.00004743896,0.000007873177,5.8086027e-8,0.001260272,0.00002149967,0.0044798492,0.967516,0.0000024441326,0.025854515],"study_design_scores_gemma":[0.00045284737,0.00019523354,0.023596654,0.000018263392,0.000019781432,0.000006352854,0.0012479097,0.003462012,0.057739574,0.91143656,0.0016006912,0.00022414501],"about_ca_topic_score_codex":0.000010788659,"about_ca_topic_score_gemma":9.326518e-7,"teacher_disagreement_score":0.58457685,"about_ca_system_score_codex":0.000012081971,"about_ca_system_score_gemma":0.000043712964,"threshold_uncertainty_score":0.2639758},"labels":[],"label_agreement":null},{"id":"W4414048457","doi":"10.31234/osf.io/jtnad_v1","title":"Compression and Decompression in Cognition","year":2025,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decompression; Compression (physics); Cognition; Context (archaeology); Decompression sickness; Data compression","score_opus":0.00982189936560307,"score_gpt":0.2716766228526874,"score_spread":0.26185472348708433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414048457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111972384,0.00026367456,0.8661143,0.0012525548,0.0003526197,0.00023318848,4.1917227e-7,0.00020699327,0.019603845],"genre_scores_gemma":[0.94377935,0.00002262251,0.055621803,0.0003876727,0.000011280512,0.000010866054,0.000001390109,0.000002061503,0.00016294794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906313,0.000089671135,0.00019179926,0.0003735672,0.0001207385,0.00016111405],"domain_scores_gemma":[0.99937785,0.00021255598,0.000027252512,0.00029408166,0.000044115157,0.000044150915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021480628,0.00009451667,0.00013156164,0.00017732223,0.00006910958,0.00009818571,0.00032985935,0.000056214583,0.000018397008],"category_scores_gemma":[0.000037263544,0.00007844308,0.000020068472,0.00039290203,0.000035675468,0.00027999803,0.0006782299,0.00010874116,0.000008305588],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018757686,0.00037066964,0.022663275,0.000060620838,0.000008235808,0.000017876275,0.00033484446,0.00029716344,0.0053861197,0.06872326,0.0018104878,0.90030867],"study_design_scores_gemma":[0.0009681154,0.00004516044,0.18152575,0.00015772208,0.0000024640578,0.0000073509336,0.000029769113,0.69425714,0.0067260107,0.11406479,0.0020244762,0.00019126905],"about_ca_topic_score_codex":0.000046888552,"about_ca_topic_score_gemma":0.000036516318,"teacher_disagreement_score":0.9001174,"about_ca_system_score_codex":0.00002674968,"about_ca_system_score_gemma":0.000027087417,"threshold_uncertainty_score":0.31988162},"labels":[],"label_agreement":null},{"id":"W4414105428","doi":"10.1017/9781009604987.051","title":"On Numbers","year":2025,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Set (abstract data type); Context (archaeology); Relation (database); Information system; Quality (philosophy)","score_opus":0.016545275149680197,"score_gpt":0.19864643570302218,"score_spread":0.18210116055334197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414105428","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011415192,0.000047464273,0.080382854,0.00007273077,0.0009863958,0.00045214884,0.000083374354,0.00054943806,0.9174142],"genre_scores_gemma":[0.0002676185,0.00002043605,0.003204138,0.0002961488,0.00009630985,7.7931986e-7,0.000014398413,0.0000239217,0.9960762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997553,0.00007241447,0.0002445758,0.0012163502,0.0004943031,0.0004193685],"domain_scores_gemma":[0.99715686,0.00033906417,0.00020694174,0.0018535224,0.00022055616,0.00022307661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015822933,0.0005376701,0.00053533365,0.00034915295,0.0002447862,0.00014565173,0.0026782444,0.0004386741,0.0000060263374],"category_scores_gemma":[0.000024822784,0.0006438812,0.0003736798,0.000028809729,0.00022398157,0.00014566588,0.0021162208,0.0007407836,0.00006271123],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019694227,0.000017928638,5.1292847e-7,0.000049420352,0.00007978011,0.000320026,0.00002870243,0.000019617148,0.000001563027,0.91463864,0.07379625,0.011027857],"study_design_scores_gemma":[0.00050253526,0.00010802992,0.00001200994,0.00018511199,0.000070267204,0.000014363434,0.0000040546274,0.0032520138,0.000081074955,0.00092221267,0.99416476,0.00068353483],"about_ca_topic_score_codex":0.00012290999,"about_ca_topic_score_gemma":0.0000028087675,"teacher_disagreement_score":0.92036855,"about_ca_system_score_codex":0.0005154742,"about_ca_system_score_gemma":0.00029158886,"threshold_uncertainty_score":0.99960124},"labels":[],"label_agreement":null},{"id":"W4414116172","doi":"10.2139/ssrn.5440694","title":"Harmful Hallucinations: Generative AI and&amp;nbsp;Elections","year":2025,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transparency (behavior); Democracy; Generative grammar; Emerging technologies; Generative model","score_opus":0.010343254361716996,"score_gpt":0.2783891722926423,"score_spread":0.2680459179309253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414116172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006977695,0.0034243632,0.9682961,0.01891844,0.0006380561,0.00018351643,0.0000011065802,0.00014615589,0.0014145335],"genre_scores_gemma":[0.94424367,0.0026589846,0.041116897,0.002159773,0.00047144544,0.00004503772,0.0000038050862,0.000021411175,0.009278988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971078,0.00023240015,0.0003632601,0.0004756352,0.00027836993,0.0015425573],"domain_scores_gemma":[0.9988546,0.00014001354,0.00011341524,0.00040936042,0.0003806924,0.00010194966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014657942,0.00020872148,0.0002236121,0.0003786184,0.00075735047,0.0004282871,0.0007602777,0.00008726434,0.000016123553],"category_scores_gemma":[0.0002009686,0.00019391213,0.00011383091,0.0009882997,0.00008175182,0.0006217362,0.00028568963,0.0017986611,0.000024931502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047436947,0.00011804333,0.00056745147,0.000004290894,0.00012209621,0.0000020457828,0.0002642408,0.00035493405,0.0002373611,0.8315961,0.00068151316,0.16604723],"study_design_scores_gemma":[0.0005427379,0.00019535328,0.0018866688,0.000014700019,0.000025149151,0.0005076206,0.00011483907,0.036268793,0.00019873779,0.9502317,0.009779902,0.00023381121],"about_ca_topic_score_codex":0.00006497999,"about_ca_topic_score_gemma":0.0013776909,"teacher_disagreement_score":0.93726593,"about_ca_system_score_codex":0.0011409932,"about_ca_system_score_gemma":0.0028632223,"threshold_uncertainty_score":0.7907507},"labels":[],"label_agreement":null},{"id":"W4414298955","doi":"10.1017/jsl.2025.10143","title":"ON THE COMPUTABILITY OF OPTIMAL SCOTT SENTENCES","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sentence; Countable set; Computable number; Computable analysis; Computable function; Computability; Set (abstract data type)","score_opus":0.01896401671791941,"score_gpt":0.2709963990381654,"score_spread":0.252032382320246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414298955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63024926,0.00042510213,0.35420886,0.010619999,0.0013482025,0.00022809918,0.0000017256577,0.00003881224,0.002879932],"genre_scores_gemma":[0.9784931,0.00002204623,0.020472635,0.00086913095,0.000100721445,0.0000018824894,1.03179026e-7,0.000003462441,0.000036950765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760413,0.00037280933,0.00085194415,0.0002853257,0.00060471374,0.0002810696],"domain_scores_gemma":[0.9966836,0.0014817874,0.00054943725,0.0006847774,0.0005156868,0.0000846935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021105653,0.00018827927,0.00051085255,0.00022570477,0.00012646733,0.00010663688,0.0022028445,0.00007851694,0.000035328223],"category_scores_gemma":[0.00057763746,0.00010694112,0.00030497086,0.00085011835,0.00030100526,0.00022793777,0.00049099996,0.00044184888,0.000008921386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012169303,0.0019849823,0.013457308,0.00015858674,0.00030529927,0.00008614319,0.0023780738,0.036662817,0.0011018111,0.8789541,0.0046413485,0.06014783],"study_design_scores_gemma":[0.0012838846,0.001833625,0.111618206,0.0003551683,0.000066375185,0.00029237042,0.0006254093,0.14294852,0.0039946726,0.7356776,0.0008856485,0.0004185501],"about_ca_topic_score_codex":0.000020028996,"about_ca_topic_score_gemma":0.000002218153,"teacher_disagreement_score":0.34824377,"about_ca_system_score_codex":0.00009956797,"about_ca_system_score_gemma":0.0002914935,"threshold_uncertainty_score":0.43609324},"labels":[],"label_agreement":null},{"id":"W4414360614","doi":"10.24963/ijcai.2025/292","title":"Verified Certificates via SAT and Computer Algebra Systems for the Ramsey R(3,8) and R(3,9) Problems","year":2025,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Waterloo","funders":"","keywords":"Boolean satisfiability problem; Correctness; Satisfiability; Solver; Verifiable secret sharing; Maximum satisfiability problem; Conjunctive normal form; Graph","score_opus":0.02261994542786801,"score_gpt":0.23718884702418994,"score_spread":0.21456890159632191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414360614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005100215,0.00288421,0.98403335,0.0049800756,0.0010850783,0.0013760932,0.0000027415028,0.00027645283,0.00026177234],"genre_scores_gemma":[0.93019086,0.00012249566,0.06730878,0.00096045865,0.00017533643,0.00024335763,0.0000042520173,0.000017118171,0.0009773289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983366,0.000090896625,0.00035562675,0.00071050937,0.00016489705,0.0003414392],"domain_scores_gemma":[0.9979024,0.001081627,0.00007514151,0.0007234987,0.00013240876,0.0000849545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066357903,0.00022136519,0.00028879827,0.00008837761,0.00032158257,0.00075373054,0.00076266413,0.00009091404,0.0000031657758],"category_scores_gemma":[0.000029270424,0.00014279126,0.000057492896,0.0003122457,0.00018360611,0.00024217735,0.0007213527,0.00012405559,0.0000066356956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037073445,0.00024333187,0.004448548,0.00082918577,0.00028093302,0.0000041928965,0.0017527369,0.0021935098,0.0007429475,0.47178555,0.012736705,0.5049453],"study_design_scores_gemma":[0.0004443467,0.00010631024,0.008933348,0.000027862152,0.00001784529,0.000020044143,0.000035383302,0.96042204,0.00016117103,0.015229982,0.014407795,0.00019388468],"about_ca_topic_score_codex":0.00019417144,"about_ca_topic_score_gemma":0.000023385837,"teacher_disagreement_score":0.9582285,"about_ca_system_score_codex":0.000032313354,"about_ca_system_score_gemma":0.000040247367,"threshold_uncertainty_score":0.7268241},"labels":[],"label_agreement":null},{"id":"W4414473838","doi":"10.1007/s11229-025-05275-1","title":"An inferentialist approach to Mates’s Puzzle","year":2025,"lang":"en","type":"article","venue":"Synthese","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Philosophy of language; Face (sociological concept); Object (grammar); Metaphysics; Value (mathematics); Hierarchy; Philosophy of science","score_opus":0.012035120375829456,"score_gpt":0.2785432338228859,"score_spread":0.2665081134470565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414473838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016776862,0.000033830805,0.9385234,0.0012901704,0.00071733457,0.00033869856,0.00000505175,0.0004921793,0.041822463],"genre_scores_gemma":[0.8563843,9.817369e-7,0.1425377,0.00041584802,0.000073804644,0.000057780315,0.0000031073914,0.000008781171,0.00051771547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829197,0.0001513835,0.0002457874,0.0006908296,0.0002501446,0.00036989796],"domain_scores_gemma":[0.99806684,0.00013321557,0.000036848818,0.0014919353,0.00010027804,0.00017085935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046768296,0.00018149485,0.00022725802,0.00021123525,0.00014460189,0.00041448063,0.0018920903,0.00007249358,0.000032472944],"category_scores_gemma":[0.00017063704,0.0001656957,0.00007146818,0.0007835938,0.00005313562,0.00035294684,0.0007484751,0.00012544825,0.00014411984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018001681,0.0017052469,0.0033605646,0.00012366103,0.000058908736,0.000013054654,0.0019487529,0.0022311541,0.002062681,0.53763944,0.0033826763,0.44745585],"study_design_scores_gemma":[0.00066716486,0.00027548123,0.046146065,0.00010795013,0.000039737737,0.000030700157,0.00037808312,0.77238804,0.021389822,0.09345105,0.063655615,0.001470285],"about_ca_topic_score_codex":0.00019029362,"about_ca_topic_score_gemma":0.000034730576,"teacher_disagreement_score":0.8396074,"about_ca_system_score_codex":0.0000807224,"about_ca_system_score_gemma":0.00008342562,"threshold_uncertainty_score":0.6756875},"labels":[],"label_agreement":null},{"id":"W4414734345","doi":"10.1007/978-3-031-98245-3_7","title":"Classical Artificial Intelligence","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transformative learning; Applications of artificial intelligence; Symbolic artificial intelligence; Artificial intelligence, situated approach; Section (typography); Special section","score_opus":0.0476775319578893,"score_gpt":0.27197844355401235,"score_spread":0.22430091159612306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414734345","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.882836e-7,0.00007474271,0.52222055,0.0018247365,0.0010865488,0.00017422994,0.0000034977722,0.00034961684,0.47426587],"genre_scores_gemma":[0.0004370754,0.00003230349,0.1502814,0.0008288507,0.00057629496,0.000011659196,0.000008032868,0.000024113193,0.84780025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707025,0.00003368196,0.00066820893,0.0012468381,0.0005821069,0.00039893258],"domain_scores_gemma":[0.99740106,0.0004643907,0.00013717148,0.0016137685,0.00021692395,0.00016665962],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003227609,0.0004671004,0.0005344551,0.0002730236,0.000113466915,0.00031457015,0.0024476843,0.00046052912,0.0007447008],"category_scores_gemma":[0.000077719626,0.0004252635,0.0003202342,0.00014000696,0.00020812232,0.00016504791,0.001993148,0.0007135338,0.0011388169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001380743,0.000021494816,3.0429e-7,0.000011281982,0.000013516556,0.000021578733,0.000017487064,0.000014314323,9.860868e-7,0.61575043,0.0030979319,0.3810493],"study_design_scores_gemma":[0.000014446444,0.000071249655,0.0000035105281,0.000042234587,0.000011575267,0.0000103977545,0.0000016594499,0.079498075,0.0000987724,0.75063205,0.16922115,0.000394892],"about_ca_topic_score_codex":0.000011583362,"about_ca_topic_score_gemma":0.00004709618,"teacher_disagreement_score":0.38065442,"about_ca_system_score_codex":0.00018157273,"about_ca_system_score_gemma":0.00037640915,"threshold_uncertainty_score":0.99981993},"labels":[],"label_agreement":null},{"id":"W4414833938","doi":"10.29173/alr2848","title":"Vavilov and Generative AI","year":2025,"lang":"en","type":"article","venue":"Alberta Law Review","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Generative grammar; Set (abstract data type); Citizenship; Basis (linear algebra); Generative model","score_opus":0.01199585371072098,"score_gpt":0.2856844672051997,"score_spread":0.2736886134944787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414833938","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047043493,0.3539696,0.3681334,0.15886594,0.0013850548,0.0019314443,0.0000027734197,0.00024109914,0.11500023],"genre_scores_gemma":[0.103317186,0.13402006,0.23485175,0.50926584,0.00050455244,0.0005999136,0.000027198184,0.000069975096,0.01734354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866307,0.00017558823,0.00026650247,0.00053641945,0.00013539234,0.00022303023],"domain_scores_gemma":[0.99858546,0.0003879961,0.00005612208,0.00079585164,0.00009561371,0.000078971265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032515,0.00017447387,0.0003798198,0.000027889151,0.00012454847,0.00012744709,0.0006499962,0.000042589887,0.000035794474],"category_scores_gemma":[0.00012991045,0.00014098057,0.00008381314,0.0004729113,0.00009122732,0.00028141344,0.00061206566,0.00013342124,0.00007763477],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.4273475e-7,0.000031606334,0.00012595966,0.00044006077,0.000019541683,0.0000030009194,0.00004350081,0.0000018820831,0.000006949408,0.89083165,0.0066271937,0.10186833],"study_design_scores_gemma":[0.00014989308,0.000042394382,0.00032175018,0.000928381,0.00002799594,0.000019676017,6.1667765e-7,0.0059076706,0.000112616406,0.024441585,0.96782595,0.00022144726],"about_ca_topic_score_codex":0.00059742195,"about_ca_topic_score_gemma":0.00063652365,"teacher_disagreement_score":0.9611988,"about_ca_system_score_codex":0.000032970638,"about_ca_system_score_gemma":0.00006483573,"threshold_uncertainty_score":0.57490206},"labels":[],"label_agreement":null},{"id":"W4414972727","doi":"10.48550/arxiv.2510.04943","title":"The NPA hierarchy does not always attain the commuting operator value","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Villum Fonden","keywords":"Undecidable problem; Operator (biology); Hierarchy; Value (mathematics); Property (philosophy); Constraint (computer-aided design); Turing machine","score_opus":0.040100954554307275,"score_gpt":0.2880831119645439,"score_spread":0.2479821574102366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414972727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5003567,0.0019924156,0.36889717,0.10380298,0.0144853,0.0033078734,0.00010708942,0.0015753182,0.0054751523],"genre_scores_gemma":[0.9750445,0.00018790437,0.016667986,0.005153386,0.0009246218,0.00028659182,0.000012466095,0.000039979433,0.0016825513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943186,0.001506394,0.00090845465,0.0015321951,0.00077513687,0.0009592241],"domain_scores_gemma":[0.9896514,0.004137046,0.00036458264,0.005320467,0.00038350403,0.00014301404],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0039539267,0.0006654142,0.00062692945,0.0001224808,0.0019120197,0.0012373164,0.01020514,0.00033610605,0.000014300713],"category_scores_gemma":[0.0010332146,0.00035101429,0.00044001327,0.0006301781,0.000543135,0.00022143942,0.01878036,0.0023574731,0.00010350029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079043035,0.0008955744,0.28000998,0.0007647707,0.0012247487,0.00018228305,0.019213956,0.02487383,0.0009413607,0.22364192,0.009104873,0.43906766],"study_design_scores_gemma":[0.000994255,0.0001882843,0.12113791,0.0005574051,0.00014355363,0.00003767514,0.00058433745,0.6841227,0.0075892503,0.07564632,0.10666421,0.0023341454],"about_ca_topic_score_codex":0.0005734216,"about_ca_topic_score_gemma":0.00013547359,"teacher_disagreement_score":0.6592488,"about_ca_system_score_codex":0.0003220271,"about_ca_system_score_gemma":0.0007502423,"threshold_uncertainty_score":0.99994415},"labels":[],"label_agreement":null},{"id":"W4415303904","doi":"10.4153/s000843952510132x","title":"A short proof of the Hilton–Milner Theorem","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Israel Science Foundation","keywords":"Elementary proof; Proofs of Fermat's little theorem; Calculus (dental); Analytic proof; Algebra over a field; Mathematical proof; Fundamental theorem","score_opus":0.009336059005565132,"score_gpt":0.22097880086084062,"score_spread":0.21164274185527548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415303904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036007714,0.00023289524,0.63542515,0.086730905,0.00084621215,0.001777892,0.000018169032,0.00018592153,0.23877516],"genre_scores_gemma":[0.982867,4.9307994e-7,0.012927522,0.0014775291,0.000031509087,0.000041287007,5.259442e-7,0.0000099376275,0.0026441973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983844,0.00013701091,0.00038887977,0.00037551814,0.00028032373,0.00043383052],"domain_scores_gemma":[0.99798906,0.0003265487,0.000043044427,0.0012677955,0.00012765995,0.00024588488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006511029,0.00017072709,0.00028488672,0.00012759959,0.0001333906,0.00008120116,0.0018680538,0.00010021251,0.0008061575],"category_scores_gemma":[0.00060376583,0.000115431954,0.00015594033,0.00058454147,0.00026771793,0.000031596683,0.00042624713,0.00021862065,0.00027501688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011965633,0.00007264972,0.000263687,0.00009875963,0.000021370759,0.000008714645,0.00024491528,0.000034024517,0.000016105188,0.968964,0.01172207,0.01855251],"study_design_scores_gemma":[0.00021504409,0.000043510197,0.0031660495,0.00022481267,0.000028451836,0.000031864653,0.000054854998,0.033181433,0.0022824742,0.886856,0.07357455,0.00034094334],"about_ca_topic_score_codex":0.0003300981,"about_ca_topic_score_gemma":0.00055344787,"teacher_disagreement_score":0.9468593,"about_ca_system_score_codex":0.00017608881,"about_ca_system_score_gemma":0.00046823666,"threshold_uncertainty_score":0.8826859},"labels":[],"label_agreement":null},{"id":"W4415428448","doi":"10.3233/faia251118","title":"Quantize Once, Train Fast: Allreduce-Compatible Compression with Provable Guarantees","year":2025,"lang":"","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Quantization (signal processing); Cloud computing; Deep learning; Scaling; Heuristics; Convergence (economics); Overhead (engineering)","score_opus":0.039790459530184286,"score_gpt":0.2778522652805472,"score_spread":0.2380618057503629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415428448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002489817,0.002322185,0.9681022,0.0013243929,0.00099134,0.004093876,0.00007989902,0.00020232642,0.022634765],"genre_scores_gemma":[0.2404276,0.0055408184,0.7200507,0.0006749872,0.0011758402,0.0028724624,0.00022832768,0.00020966298,0.028819596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99334604,0.00015586831,0.0019598429,0.002713087,0.00080135604,0.0010238059],"domain_scores_gemma":[0.9962187,0.00040079848,0.00069566135,0.0018763526,0.0004890748,0.0003194213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080571516,0.001091124,0.0014587679,0.000997723,0.0009499865,0.0007471948,0.0023545795,0.0005793082,0.0001383387],"category_scores_gemma":[0.00004092215,0.0010543736,0.00024982585,0.0012746605,0.0015915853,0.000591238,0.0007912506,0.0012861232,0.00009677204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088649576,0.00049815566,0.0002046062,0.0001781476,0.000074970136,0.000013561496,0.00093255,0.0040269443,0.00007174563,0.3584259,0.00044652517,0.63503826],"study_design_scores_gemma":[0.00016765307,0.0004514897,0.00011626897,0.0012478955,0.000122754,0.000028184239,0.001229509,0.53780127,0.0023819706,0.40418985,0.050796423,0.0014667506],"about_ca_topic_score_codex":0.00028852458,"about_ca_topic_score_gemma":0.00032696765,"teacher_disagreement_score":0.6335715,"about_ca_system_score_codex":0.00025140977,"about_ca_system_score_gemma":0.00063743093,"threshold_uncertainty_score":0.9991906},"labels":[],"label_agreement":null},{"id":"W4415490944","doi":"10.36227/techrxiv.176127375.51816942/v1","title":"Beyond Transformers: A Neuro-Symbolic and Quantum Hybrid Architecture Toward Artificial General Intelligence","year":2025,"lang":"","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Aging","funders":"","keywords":"Applications of artificial intelligence; Artificial life; Quantum computer; Architecture; Face (sociological concept); Quadratic equation; Transformer","score_opus":0.022175415411975232,"score_gpt":0.2676957926364712,"score_spread":0.24552037722449596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415490944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09746694,0.0015633707,0.87372243,0.017189234,0.004156737,0.0012470534,0.000032159154,0.00035110133,0.004270953],"genre_scores_gemma":[0.96099246,0.0003608409,0.03343446,0.003969629,0.00057000085,0.000049974184,0.000006441075,0.00004023355,0.00057595025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99253315,0.0005285652,0.0016070524,0.0027949577,0.0008687464,0.0016675453],"domain_scores_gemma":[0.99678236,0.0007482905,0.00019210362,0.001376046,0.00031054893,0.00059062213],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010006629,0.0010598481,0.0011202018,0.0007838509,0.00060402486,0.0014528746,0.0023188528,0.00027715173,0.00023285931],"category_scores_gemma":[0.00025175585,0.0010019833,0.00048661855,0.002174501,0.0010418278,0.00062734727,0.0014984307,0.0012722425,0.00006366424],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084239226,0.0004122739,0.00018928424,0.00022143038,0.00009018226,0.00009028973,0.0028355613,0.0020226494,0.000868151,0.15093707,0.00029370343,0.8419552],"study_design_scores_gemma":[0.00026233078,0.0005482525,0.0010564383,0.00006254919,0.000076894285,0.00017943507,0.00015829418,0.68567073,0.010029649,0.2987252,0.0024158673,0.0008143326],"about_ca_topic_score_codex":0.00040084115,"about_ca_topic_score_gemma":0.00016097362,"teacher_disagreement_score":0.8635255,"about_ca_system_score_codex":0.00015535107,"about_ca_system_score_gemma":0.00083087804,"threshold_uncertainty_score":0.9995837},"labels":[],"label_agreement":null},{"id":"W4415536294","doi":"10.1007/978-3-032-07742-4","title":"Artificial Intelligence of Things","year":2025,"lang":"en","type":"book","venue":"Communications in computer and information science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National University of Computer and Emerging Sciences; Mälardalens högskola; Università Politecnica delle Marche; Zhejiang Shuren University; Universiti Kebangsaan Malaysia; University of Technology Sydney; York University; Prince Sattam bin Abdulaziz University; University of Central Punjab; Hamad Bin Khalifa University; Multimedia University; Université de Lille; University of Hail; SRM Institute of Science and Technology; University of Derby; Iqra University; New York University Abu Dhabi; Khalifa University of Science, Technology and Research; Glasgow Caledonian University; Yeditepe Üniversitesi; Norges Teknisk-Naturvitenskapelige Universitet; Southern Connecticut State University","keywords":"Scope (computer science); Variety (cybernetics); Relevance (law); Informatics; Dissemination; Selection (genetic algorithm); Focus (optics)","score_opus":0.0497464842694762,"score_gpt":0.3152909001273997,"score_spread":0.2655444158579235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415536294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012061075,0.00024572553,0.86941695,0.0008836044,0.00045074066,0.00034721327,0.000006037145,0.000086410786,0.12855127],"genre_scores_gemma":[0.01618232,0.0011752252,0.9795799,0.0013568334,0.000049855866,0.000041170748,0.000043535707,0.000007101855,0.0015640574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747217,0.00008137433,0.001218012,0.00037336588,0.0005884236,0.00026664106],"domain_scores_gemma":[0.994857,0.0006846037,0.00047707724,0.0031527975,0.00074533094,0.00008318007],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020839027,0.00022761067,0.00036954042,0.0014872983,0.00032399292,0.00050971296,0.0073843435,0.0001487415,0.0000043364385],"category_scores_gemma":[0.00018646765,0.00023232315,0.00006904393,0.0017989585,0.0014483973,0.0072393254,0.0067872866,0.0005253609,0.000020625977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.444468e-7,0.00002464958,0.000007961768,0.000043893917,0.0000023917626,1.2548715e-7,0.0015593072,0.00027070363,9.134471e-7,0.49332902,0.0001513459,0.5046089],"study_design_scores_gemma":[0.000036390047,0.000050107432,0.00023005733,0.00021225004,0.0000038652593,0.0000072126118,0.000023068913,0.82223195,0.00006382918,0.16129862,0.015614895,0.00022775878],"about_ca_topic_score_codex":0.000024516574,"about_ca_topic_score_gemma":0.0000055777405,"teacher_disagreement_score":0.8219612,"about_ca_system_score_codex":0.00025802015,"about_ca_system_score_gemma":0.0014612286,"threshold_uncertainty_score":0.9979862},"labels":[],"label_agreement":null},{"id":"W4415938642","doi":"10.1016/j.plrev.2025.11.004","title":"The limits of information: comment on “informational embodiment: computational role of information structure in codes and robots” by Alexandre Pitti, Max Austin, Kohei Nakajima, Yasuo Kuniyoshi","year":2025,"lang":"en","type":"review","venue":"Physics of Life Reviews","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"V. Kann Rasmussen Foundation","keywords":"Information structure; Information theory; Data structure; Mathematical structure","score_opus":0.02954619017504007,"score_gpt":0.29973744709346145,"score_spread":0.2701912569184214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415938642","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008272778,0.95333654,0.042052414,0.00042736673,0.00021990595,0.002589316,0.00064024667,0.000026326083,0.0006996432],"genre_scores_gemma":[0.00018796207,0.98283595,0.015330135,0.00050363305,0.00004905575,0.00011589064,0.00096456625,0.000008598444,0.0000042134325],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949515,0.00040286587,0.003263803,0.0002476649,0.0008583804,0.00027579482],"domain_scores_gemma":[0.9937579,0.0015145298,0.0033397812,0.00077801716,0.00050958415,0.0001001963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001200299,0.0005109089,0.002102002,0.00027349856,0.00013437675,0.00014744814,0.0013845833,0.00017531819,0.0000057875873],"category_scores_gemma":[0.0003569701,0.0003721593,0.00038205538,0.0010137374,0.00018038419,0.0016083431,0.000580452,0.00042876817,0.000008731385],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071444624,0.000087434506,0.000023083006,0.017739492,0.00008149112,3.684964e-8,0.0004817461,0.0040066107,1.0066568e-7,0.051860128,0.0029426564,0.9227701],"study_design_scores_gemma":[0.0005415486,0.00016035457,0.000096756245,0.009834505,0.00011750921,0.000004120552,0.00004708682,0.02298792,0.000009214581,0.011926728,0.95385164,0.00042261323],"about_ca_topic_score_codex":0.000024439494,"about_ca_topic_score_gemma":0.000002297661,"teacher_disagreement_score":0.95090896,"about_ca_system_score_codex":0.00013737417,"about_ca_system_score_gemma":0.0006044203,"threshold_uncertainty_score":0.99987304},"labels":[],"label_agreement":null},{"id":"W4416139613","doi":"10.4153/s0008414x2510179x","title":"Computability of Brjuno-like functions","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Turing; Bijection, injection and surjection; Computability; Class (philosophy); Skew; Computable function; Turing machine; Description number","score_opus":0.015297946354671028,"score_gpt":0.2338336640603555,"score_spread":0.21853571770568447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416139613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053779475,0.00033982572,0.94036806,0.0011676368,0.0015802395,0.00013759472,0.000008472785,0.00001903489,0.0025996766],"genre_scores_gemma":[0.78439176,0.0000029387725,0.21514481,0.00017763046,0.000057637208,0.0000012992793,4.554571e-7,0.0000070201068,0.00021642247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842554,0.000083807616,0.000808827,0.00016591366,0.00024492422,0.00027100538],"domain_scores_gemma":[0.9975536,0.000430833,0.00036116442,0.0006606494,0.0006491448,0.00034460152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010246683,0.00013787669,0.00041788977,0.0004401608,0.00011756431,0.00009254434,0.0011763403,0.0000741112,0.000044844997],"category_scores_gemma":[0.0004146468,0.0001246646,0.00020095162,0.00075669395,0.000169947,0.00021123116,0.00009993675,0.00025066044,0.000009957052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001742457,0.0021880318,0.04786224,0.002500612,0.0010908672,0.0003608253,0.014692958,0.019219847,0.00048851746,0.64870363,0.068145454,0.19472957],"study_design_scores_gemma":[0.0018572743,0.0007178217,0.038518243,0.00083057303,0.00024573744,0.00087292097,0.0015634437,0.2638918,0.0010639392,0.6492226,0.040358286,0.00085738074],"about_ca_topic_score_codex":0.0005180727,"about_ca_topic_score_gemma":0.0035377457,"teacher_disagreement_score":0.73061234,"about_ca_system_score_codex":0.00022342463,"about_ca_system_score_gemma":0.0020715727,"threshold_uncertainty_score":0.5083675},"labels":[],"label_agreement":null},{"id":"W4416758352","doi":"10.48550/arxiv.2511.20118","title":"Formalization of Brownian motion in Lean","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Martingale representation theorem; Brownian excursion; Brownian motion; Geometric Brownian motion; Fractional Brownian motion; Reflected Brownian motion; Diffusion process; Extension (predicate logic); Brownian bridge","score_opus":0.0516803984286628,"score_gpt":0.28459235758552126,"score_spread":0.23291195915685847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416758352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49587396,0.00021377124,0.4980416,0.0005050846,0.0026170048,0.0009486863,0.000017746512,0.000121872334,0.0016602936],"genre_scores_gemma":[0.9874416,0.00020625342,0.011282062,0.00017732367,0.00022782177,0.00005885091,0.000055781806,0.000023869898,0.00052643],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9936189,0.0004890292,0.0021529903,0.002093328,0.00079402985,0.0008517088],"domain_scores_gemma":[0.9950184,0.00031739002,0.0009974965,0.0027430116,0.00073570164,0.00018799574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019341885,0.0007382061,0.0011249712,0.0009694956,0.00017962429,0.00015042096,0.002975794,0.00072021526,0.0001171439],"category_scores_gemma":[0.0004889136,0.0008513977,0.00043219156,0.002308286,0.0002795692,0.0008188004,0.005190584,0.0011224265,0.00007890517],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029256873,0.0008036865,0.8138255,0.001026292,0.0000568612,0.000014831992,0.004055557,0.046506118,0.00016348576,0.0053345053,0.000039340324,0.12814456],"study_design_scores_gemma":[0.0006452459,0.00015159608,0.59708923,0.00058274734,0.00003419064,0.0000061763662,0.00006897489,0.39003205,0.0021356733,0.008383553,0.00031815327,0.0005523995],"about_ca_topic_score_codex":0.0010813134,"about_ca_topic_score_gemma":0.00047963078,"teacher_disagreement_score":0.49156767,"about_ca_system_score_codex":0.00062148424,"about_ca_system_score_gemma":0.0007066319,"threshold_uncertainty_score":0.9993937},"labels":[],"label_agreement":null},{"id":"W4416799242","doi":"10.1109/snpd65828.2025.11253606","title":"Chatbots as Turing Machines","year":2025,"lang":"","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University","funders":"","keywords":"Turing; Undecidable problem; Turing machine; Chatbot; Super-recursive algorithm; Face (sociological concept)","score_opus":0.010894486649649995,"score_gpt":0.2760101448846984,"score_spread":0.2651156582350484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416799242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021022173,0.0022002747,0.7965154,0.012298752,0.009285661,0.0006820734,0.000002484514,0.0006808669,0.15731233],"genre_scores_gemma":[0.8988377,0.00008947662,0.065348975,0.0033563897,0.0005572712,0.000028166034,0.0000014879182,0.000022915487,0.03175765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532133,0.0002806188,0.0008846893,0.0018206342,0.0006603377,0.0010323885],"domain_scores_gemma":[0.9965226,0.0005131491,0.00015255241,0.0022202984,0.00030528713,0.0002860954],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009547254,0.0006121353,0.0006402682,0.00045567992,0.00051885383,0.0011348533,0.0031292308,0.00024326664,0.0010500854],"category_scores_gemma":[0.00031150875,0.00057059457,0.00034650593,0.0019995885,0.00024139398,0.0007400063,0.004544595,0.0005446258,0.00089418545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012819297,0.00040051033,0.0032505575,0.00015669348,0.000088667875,0.000061979714,0.000691704,0.000947836,0.00013275623,0.1494738,0.001198021,0.84358466],"study_design_scores_gemma":[0.0006231294,0.00018098747,0.019134657,0.000117385556,0.00003289809,0.000045982426,0.0000369039,0.8675072,0.0023509117,0.09920088,0.010114654,0.00065437844],"about_ca_topic_score_codex":0.000808872,"about_ca_topic_score_gemma":0.00010646487,"teacher_disagreement_score":0.8778155,"about_ca_system_score_codex":0.00023321678,"about_ca_system_score_gemma":0.00046316916,"threshold_uncertainty_score":0.99990207},"labels":[],"label_agreement":null},{"id":"W4416801235","doi":"10.2140/astat.2025.16.217","title":"Lawrence lifts, matroids, and maximum likelihood degrees","year":2025,"lang":"en","type":"article","venue":"Algebraic Statistics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Maximum likelihood; Bayesian probability; Set (abstract data type); Term (time); Estimation theory","score_opus":0.008432347407043001,"score_gpt":0.24432521166932772,"score_spread":0.23589286426228473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416801235","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004791753,0.0012289524,0.9900289,0.0013526186,0.00084300386,0.00023077331,0.00006255815,0.00028155986,0.0011798551],"genre_scores_gemma":[0.1468698,0.0001479884,0.8515247,0.0010050052,0.000079534235,0.000023820494,0.000013297588,0.000015323043,0.00032053387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803084,0.00010502664,0.00037911767,0.0006787532,0.0003171666,0.00048911927],"domain_scores_gemma":[0.99793833,0.00083697424,0.000092845294,0.0008035392,0.00016845467,0.00015985216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032940315,0.000253947,0.00029623506,0.0001500386,0.00019274166,0.00032189838,0.00096173835,0.00008959954,0.000034166023],"category_scores_gemma":[0.0003359098,0.00024997076,0.000039162744,0.00056415796,0.00019457436,0.00021958206,0.0009087738,0.0002195439,0.000059824528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004073293,0.000087917324,0.0031126407,0.00007738244,0.000036698828,0.000043502878,0.00026852926,0.000015371732,0.00007044718,0.5500932,0.009912835,0.43627742],"study_design_scores_gemma":[0.00048171257,0.00015026028,0.047439903,0.000044889675,0.000029110864,0.000033743858,0.000037833055,0.07857983,0.00022712206,0.8674149,0.005177795,0.0003829036],"about_ca_topic_score_codex":0.00009581576,"about_ca_topic_score_gemma":0.00009449329,"teacher_disagreement_score":0.4358945,"about_ca_system_score_codex":0.00005726835,"about_ca_system_score_gemma":0.00021220243,"threshold_uncertainty_score":0.99999523},"labels":[],"label_agreement":null},{"id":"W4416945752","doi":"10.2139/ssrn.5673071","title":"Meaning per Joule in Small Models: A Meterless Instrumented Audit (S4 Set-1)","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Meaning (existential); MNIST database; Audit; Joule (programming language); Energy (signal processing); Inflation (cosmology)","score_opus":0.035260784046372916,"score_gpt":0.26417872650284274,"score_spread":0.22891794245646982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416945752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10437209,0.007843507,0.8753103,0.0028070132,0.004889504,0.0015545082,0.000030300836,0.000247027,0.0029457246],"genre_scores_gemma":[0.9447639,0.013613395,0.037040427,0.00041918477,0.0011178941,0.00013834646,0.000024519863,0.00012904957,0.0027532792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97724795,0.0026368753,0.0036807044,0.0036622,0.0017654484,0.011006823],"domain_scores_gemma":[0.99277556,0.0006189478,0.0019939328,0.0028270916,0.0011233592,0.00066110835],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.014626831,0.002049688,0.0025944405,0.002349025,0.0010291621,0.0020471981,0.009277742,0.0012514472,0.00011551555],"category_scores_gemma":[0.00031240098,0.0021554334,0.0014721412,0.0023406239,0.0003337571,0.0015254943,0.008554617,0.025285462,0.00006963306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00029843408,0.0014146925,0.0012192059,0.00038257372,0.0017918255,0.00015541843,0.010183467,0.22821248,0.00007370778,0.27126947,0.000033545635,0.48496518],"study_design_scores_gemma":[0.0017409587,0.00061248266,0.000117585914,0.0006672852,0.00013730099,0.0009958297,0.0014239092,0.48320168,0.00004189251,0.5096313,0.00030627943,0.0011235224],"about_ca_topic_score_codex":0.0015623498,"about_ca_topic_score_gemma":0.014563926,"teacher_disagreement_score":0.8403918,"about_ca_system_score_codex":0.017047003,"about_ca_system_score_gemma":0.034452472,"threshold_uncertainty_score":0.99946404},"labels":[],"label_agreement":null},{"id":"W50342112","doi":"","title":"The planar Ramsey numbers PR(K4-e, Kk-e).","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Planar; Combinatorics; Computer science; Computer graphics (images)","score_opus":0.01562545040079675,"score_gpt":0.22742869666525334,"score_spread":0.2118032462644566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50342112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247367,0.0012048003,0.019670626,0.0077855373,0.02142538,0.0012682918,0.000008224441,0.0017963847,0.022104064],"genre_scores_gemma":[0.99234957,0.00007724685,0.006411448,0.00039955354,0.000046381763,0.000039257437,0.0000035727096,0.000023767745,0.000649185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732953,0.00023033039,0.00040815087,0.0006662219,0.0006791593,0.0006865932],"domain_scores_gemma":[0.99706006,0.00072483014,0.00019867317,0.0016122207,0.00017839692,0.00022581719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000675057,0.0002832875,0.00028356188,0.000065614666,0.0009200123,0.00022210779,0.002545647,0.000121455734,0.000013373918],"category_scores_gemma":[0.00024810643,0.00021960709,0.00015645388,0.000734335,0.00029349356,0.00041302163,0.0005549325,0.00037425323,0.00029792724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136225135,0.00026413306,0.011880547,0.000009405564,0.000053549433,0.00015542317,0.0012432822,0.00004834879,0.000036727288,0.9409729,0.033881746,0.011440297],"study_design_scores_gemma":[0.0013831651,0.0003021066,0.04476326,0.000015220749,0.000011155014,0.0003013703,0.000058567464,0.016678965,0.00050529075,0.87967116,0.055634957,0.00067476113],"about_ca_topic_score_codex":0.00021925126,"about_ca_topic_score_gemma":0.000032083768,"teacher_disagreement_score":0.067612894,"about_ca_system_score_codex":0.0001535025,"about_ca_system_score_gemma":0.00020175833,"threshold_uncertainty_score":0.89553165},"labels":[],"label_agreement":null},{"id":"W561883102","doi":"10.1017/jsl.2016.12","title":"COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY","year":2017,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; National University of Singapore; City University of New York; National Science Foundation","keywords":"Interpretability; Functor; Equivalence (formal languages); Mathematics; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.019870772776410917,"score_gpt":0.28415104373650796,"score_spread":0.26428027096009704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W561883102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3817952,0.004142338,0.60040224,0.0019392964,0.007959307,0.0010495957,0.000013512754,0.00015967278,0.0025388312],"genre_scores_gemma":[0.9642252,0.00014859931,0.03463069,0.00020211012,0.00071876234,0.00001419753,0.000001288431,0.000021153899,0.00003800057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598694,0.00062662543,0.0011455085,0.00094976666,0.00075253943,0.00053861865],"domain_scores_gemma":[0.99400276,0.00085949595,0.0020228962,0.0018843622,0.0008346694,0.00039579716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030700292,0.0006014982,0.0016328968,0.00037003684,0.0002536604,0.0009922341,0.0037360815,0.0004663843,0.000021423562],"category_scores_gemma":[0.0009321361,0.0004610946,0.0005624518,0.00016021765,0.0004212339,0.000642021,0.006394757,0.0020154894,0.000013797661],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030473087,0.002434182,0.081170484,0.002496421,0.0018870084,0.0011505203,0.012916429,0.018385392,0.0004387868,0.020676067,0.0030254023,0.8551146],"study_design_scores_gemma":[0.0014830369,0.0014549827,0.21441953,0.0007915857,0.00020380554,0.0014105333,0.000068615416,0.10033432,0.00027068728,0.6766788,0.0016770827,0.0012070572],"about_ca_topic_score_codex":0.00007957136,"about_ca_topic_score_gemma":0.000005778034,"teacher_disagreement_score":0.8539075,"about_ca_system_score_codex":0.00040914607,"about_ca_system_score_gemma":0.0004636747,"threshold_uncertainty_score":0.99978405},"labels":[],"label_agreement":null},{"id":"W57848759","doi":"","title":"Exhaustion Numbers of Subsets of Abelian Groups.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Abelian group; Combinatorics","score_opus":0.012046222197444409,"score_gpt":0.23381784705870629,"score_spread":0.22177162486126187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57848759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97776383,0.00017013402,0.014309478,0.00013520134,0.0032524406,0.0002643244,0.0000027066344,0.00012212766,0.0039797355],"genre_scores_gemma":[0.9860095,0.000009536691,0.0138974935,0.000025960218,0.000004125093,0.0000068293293,0.0000017340957,0.000010356634,0.000034505454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982206,0.00017120526,0.00046784276,0.00040421414,0.0004423969,0.0002937166],"domain_scores_gemma":[0.998326,0.0001772785,0.00024411517,0.00089407706,0.0002515801,0.00010696334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066550385,0.00017108217,0.00033104903,0.00012737993,0.00005471788,0.00002737771,0.0008097926,0.000100830606,0.000030610558],"category_scores_gemma":[0.00017661047,0.0001758316,0.00011761215,0.0008453646,0.00012468331,0.00030487464,0.00018200779,0.00013685312,0.000023470666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003849022,0.00032941232,0.012930358,0.000043288714,0.00001951908,0.0000052175114,0.00045253398,0.00006724073,0.0009153274,0.981843,0.00033621216,0.0030540305],"study_design_scores_gemma":[0.0012408004,0.00030304334,0.02976414,0.00003945021,0.0000161473,0.000019462834,0.00006479266,0.004429075,0.027702788,0.9355105,0.00058485207,0.00032492026],"about_ca_topic_score_codex":0.000090443944,"about_ca_topic_score_gemma":0.000006248615,"teacher_disagreement_score":0.046332482,"about_ca_system_score_codex":0.0000719331,"about_ca_system_score_gemma":0.00009751712,"threshold_uncertainty_score":0.7170205},"labels":[],"label_agreement":null},{"id":"W58369529","doi":"10.1007/978-1-4471-4069-6_2","title":"Sets, Sequences, and Counting","year":2012,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Counting problem; Set (abstract data type); Mathematics; Section (typography); Discrete mathematics; Theoretical computer science; Computer science; Algorithm; Combinatorics; Programming language","score_opus":0.03275955338909642,"score_gpt":0.25815284226995433,"score_spread":0.2253932888808579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58369529","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036272718,0.0020677326,0.9328682,0.0051746224,0.0043633743,0.00066266523,0.0000070500146,0.0004438033,0.054049868],"genre_scores_gemma":[0.05710699,0.0011963571,0.9181629,0.0018359561,0.0017582893,0.000022128164,0.000010788536,0.00009126606,0.019815331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99493515,0.000061315885,0.0007642957,0.0018607338,0.0013039227,0.0010745557],"domain_scores_gemma":[0.99702233,0.00029338,0.00037558758,0.0016579943,0.00028854556,0.00036218285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019703456,0.00063744874,0.000655371,0.0007278784,0.00039970945,0.0009930583,0.0034599907,0.00028993873,0.0000137462475],"category_scores_gemma":[0.000045713758,0.0006330968,0.000112572125,0.000531779,0.0012643534,0.0014043478,0.0039149844,0.0008729531,0.000062362546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.292048e-7,0.000027021522,0.0003602937,0.00005237314,0.000008681278,0.000063933694,0.0002515318,0.00021566336,0.000005179324,0.59087366,0.000114387185,0.40802655],"study_design_scores_gemma":[0.00029116747,0.000114300725,0.00094222743,0.0002306351,0.000012203364,0.00024219051,0.000001946686,0.3011686,0.000040272444,0.666244,0.02966007,0.0010524046],"about_ca_topic_score_codex":0.000071908355,"about_ca_topic_score_gemma":0.00007967706,"teacher_disagreement_score":0.40697414,"about_ca_system_score_codex":0.00053524115,"about_ca_system_score_gemma":0.0006069374,"threshold_uncertainty_score":0.99961203},"labels":[],"label_agreement":null},{"id":"W623267829","doi":"10.1142/9013","title":"Notes on Forcing Axioms","year":2013,"lang":"en","type":"book","venue":"Lecture notes series, Institute For Mathematical Sciences","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Forcing (mathematics); Axiom; Mathematical economics; Mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.04155757746760199,"score_gpt":0.2703388827787761,"score_spread":0.2287813053111741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W623267829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006414716,0.00025859298,0.9370506,0.006071028,0.0021122787,0.001947975,0.000054247343,0.0006168218,0.051824305],"genre_scores_gemma":[0.0098754065,0.00004093847,0.9637428,0.0023561378,0.0021141602,0.00057187467,0.00010964493,0.000117940974,0.02107112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943657,0.00006790128,0.0009652984,0.0018913264,0.0014704784,0.0012393037],"domain_scores_gemma":[0.9942128,0.0032063466,0.00048494647,0.0014212652,0.00031355317,0.0003610899],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011122377,0.0010165394,0.0012428743,0.00036887533,0.0010816565,0.0013895397,0.004023498,0.00067285803,0.00017537229],"category_scores_gemma":[0.0027320927,0.00070573675,0.00051550753,0.0007608627,0.0018459121,0.0015263276,0.0009320763,0.00070737064,0.00033228888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009608596,0.00011831823,0.0000012161208,0.0004790349,0.000044585893,0.000011941031,0.0005188929,0.0033958121,0.00003458293,0.9507834,0.0010933452,0.04350927],"study_design_scores_gemma":[0.00021771845,0.0010479854,0.0000054640914,0.00045994308,0.00003950169,0.00009012313,0.000004021121,0.055454157,0.00085072644,0.8888065,0.052074276,0.00094957557],"about_ca_topic_score_codex":0.00006463573,"about_ca_topic_score_gemma":0.00020041999,"teacher_disagreement_score":0.061976884,"about_ca_system_score_codex":0.00042143365,"about_ca_system_score_gemma":0.00112785,"threshold_uncertainty_score":0.99964714},"labels":[],"label_agreement":null},{"id":"W632590909","doi":"","title":"ISSAC 2007 : proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation : July 29-August 1, 2007, University of Waterloo, Waterloo, Ontario, Canada","year":2007,"lang":"en","type":"article","venue":"Medical Entomology and Zoology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Computer science","score_opus":0.005614649752403013,"score_gpt":0.2013731649231988,"score_spread":0.1957585151707958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W632590909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838103,0.00006511997,0.0075307908,0.0032723653,0.001969083,0.00019294916,0.000004467876,0.000028287779,0.003126659],"genre_scores_gemma":[0.99620306,0.000022906268,0.0012328443,0.0008203865,0.000086897875,9.3577637e-7,0.0000062685635,0.0000058629535,0.0016208072],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99822414,0.0000793001,0.00037848757,0.0004690315,0.00046300032,0.00038604124],"domain_scores_gemma":[0.9988876,0.0003395929,0.0001879397,0.00016129621,0.00021435441,0.00020920893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000924828,0.00017275888,0.00034616017,0.00011999004,0.00011318094,0.000011280694,0.000769471,0.00027585053,0.00034791068],"category_scores_gemma":[0.00008848401,0.00013593728,0.000047792717,0.00018283667,0.00074578414,0.00010456622,0.00059903594,0.00040963714,0.0000033634662],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083280756,0.001633448,0.7896105,0.00035093437,0.0006886,0.0007486941,0.019933598,0.00019141554,0.0010556874,0.064603634,0.027560506,0.092790194],"study_design_scores_gemma":[0.0027913034,0.001004715,0.96313137,0.00009022852,0.00007401364,0.0010896452,0.0004121932,0.010871889,0.0013593879,0.012006894,0.0067139687,0.00045441286],"about_ca_topic_score_codex":0.41094404,"about_ca_topic_score_gemma":0.36466348,"teacher_disagreement_score":0.17352088,"about_ca_system_score_codex":0.00015621132,"about_ca_system_score_gemma":0.0003281272,"threshold_uncertainty_score":0.64692974},"labels":[],"label_agreement":null},{"id":"W635314795","doi":"","title":"SNC'07 : proceedings of the 2007 International Workshop on Symbolic-Numeric Computation, London (Ontario, Canada), July 25-27, 2007","year":2007,"lang":"en","type":"book","venue":"Association for Computing Machinery eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computation; Operations research; Library science; Computer science; Engineering; Programming language","score_opus":0.010894267525996579,"score_gpt":0.2362236151590566,"score_spread":0.22532934763306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W635314795","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027072246,0.00013322015,0.10858863,0.0012312235,0.021874962,0.0031739918,0.00017987915,0.0005989809,0.8615119],"genre_scores_gemma":[0.05175402,0.0000043764367,0.019555891,0.0033727058,0.0035060418,0.000044522996,0.00027377528,0.00021996415,0.9212687],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99332625,0.00010145128,0.0017559842,0.0013275555,0.0025186413,0.0009701115],"domain_scores_gemma":[0.99146706,0.00236334,0.0033778623,0.0006057985,0.0019695407,0.00021637406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024851914,0.0008518694,0.0010778023,0.00046582115,0.000560953,0.00041911306,0.0029472322,0.00062820135,0.000025599746],"category_scores_gemma":[0.0005827895,0.0007935332,0.0006213868,0.0003099506,0.00010701593,0.00017829618,0.0010966676,0.0015051474,0.000022542046],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009191027,0.00033134708,0.0114084575,0.00029614917,0.0011096834,0.000011798626,0.0023537793,0.012038761,0.000018429506,0.040825408,0.8447596,0.08675469],"study_design_scores_gemma":[0.0026132697,0.00030045258,0.040362775,0.0010523531,0.00027117887,0.00004918946,0.00004382204,0.16945392,0.0001308653,0.03515415,0.7481964,0.0023716164],"about_ca_topic_score_codex":0.040965036,"about_ca_topic_score_gemma":0.06767807,"teacher_disagreement_score":0.15741517,"about_ca_system_score_codex":0.007839825,"about_ca_system_score_gemma":0.0029595415,"threshold_uncertainty_score":0.9994516},"labels":[],"label_agreement":null},{"id":"W65253951","doi":"","title":"Short Even Cycles In Cages With Odd Girth.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics","score_opus":0.014433864473765129,"score_gpt":0.24293363922177155,"score_spread":0.22849977474800642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65253951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9869319,0.00020656484,0.006789472,0.0008870012,0.0012124456,0.00033622835,0.0000010827783,0.0003368125,0.0032984687],"genre_scores_gemma":[0.9928057,0.000026353542,0.006865264,0.00011249865,0.00001747095,0.000031970012,0.0000022329693,0.00001859946,0.00011986856],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978093,0.00014250533,0.0003216151,0.0007023428,0.0004807872,0.00054348586],"domain_scores_gemma":[0.99844426,0.00020915589,0.000058226815,0.0010233584,0.00011108061,0.000153942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048449327,0.00025956632,0.0003250199,0.00017926244,0.00010660693,0.00015987684,0.0013333545,0.000097277014,0.000015172394],"category_scores_gemma":[0.000051654537,0.00023011437,0.00006235175,0.0010361907,0.000097452976,0.000534779,0.00047757511,0.0002757277,0.000051113806],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032161664,0.00084342225,0.54932964,0.000027244598,0.000039985553,0.0006686573,0.0013434043,0.00072820653,0.000108090164,0.36222783,0.00070227,0.0839491],"study_design_scores_gemma":[0.0010844643,0.0003401126,0.6124916,0.00005057492,0.000006986285,0.00012874299,0.000060272418,0.017411366,0.00039273515,0.3655915,0.0018607508,0.0005808855],"about_ca_topic_score_codex":0.00020271435,"about_ca_topic_score_gemma":0.00018932928,"teacher_disagreement_score":0.08336821,"about_ca_system_score_codex":0.00015999158,"about_ca_system_score_gemma":0.00009660851,"threshold_uncertainty_score":0.93837917},"labels":[],"label_agreement":null},{"id":"W6904771100","doi":"10.1371/journal.pone.0248583.g001","title":"Geographic scope of the analyses.","year":2021,"lang":"en","type":"other","venue":"Figshare","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ecoregion; Census; Scope (computer science); Sampling (signal processing); State (computer science); Production (economics)","score_opus":0.0822546727429145,"score_gpt":0.312950190504649,"score_spread":0.23069551776173453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6904771100","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020076864,0.032551017,0.0010695766,0.0002653225,0.0011732455,0.0009617741,0.09063397,0.00059444545,0.8727486],"genre_scores_gemma":[0.0028577705,0.0003037114,0.060126733,0.002337324,0.0033161577,0.0008030897,0.0921263,0.0014789416,0.83664995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831057,0.00013535355,0.00023683722,0.0005942345,0.00047738638,0.00024563045],"domain_scores_gemma":[0.9973507,0.000104583254,0.00031233317,0.002029064,0.00013877996,0.000064539236],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000055604276,0.00025157558,0.0003813791,0.00019307292,0.00004373346,0.00009855407,0.0027756668,0.00021975154,0.23519337],"category_scores_gemma":[0.00033906774,0.00018012014,0.00037518432,0.001236663,0.000022203747,0.00004091389,0.0019742274,0.00026509925,0.00027515442],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.3307292e-7,0.000039187264,0.000030920706,0.00028027792,0.000056066372,0.000011865288,0.000015851436,0.000022392074,0.0000063933862,0.000050234645,0.99175537,0.007731332],"study_design_scores_gemma":[0.00011870725,0.000020270327,0.0039044095,0.003888186,0.000015721575,0.000011338987,0.0000020376501,0.0017151617,0.00028506067,0.00022565805,0.9894684,0.00034503656],"about_ca_topic_score_codex":0.00010418502,"about_ca_topic_score_gemma":0.00014609548,"teacher_disagreement_score":0.2349182,"about_ca_system_score_codex":0.000023338256,"about_ca_system_score_gemma":0.00022543344,"threshold_uncertainty_score":0.7655058},"labels":[],"label_agreement":null},{"id":"W6910301217","doi":"10.48550/arxiv.1005.1147","title":"Closed manifolds with transcendental L2-Betti numbers","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Transcendental number; Betti number; Group (periodic table); Algebraic number; Element (criminal law); Kernel (algebra); Ring (chemistry); Algebra over a field; Computable number","score_opus":0.04285417531597154,"score_gpt":0.17386765455066122,"score_spread":0.13101347923468967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910301217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46734765,0.000021328142,0.52497774,0.00017786455,0.0012015661,0.0005219958,0.000022926713,0.00062143744,0.0051074727],"genre_scores_gemma":[0.9837355,0.000025649422,0.014802482,0.00012687185,0.00017625077,0.0000021011388,0.000022591168,0.00004233806,0.0010662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610543,0.00020007101,0.0003199023,0.0023280042,0.0003037251,0.00074287754],"domain_scores_gemma":[0.9963524,0.00014743528,0.000294926,0.0025731984,0.00022979185,0.00040225187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035821786,0.0006821305,0.0006152841,0.00032376059,0.00024515262,0.00029823728,0.004193099,0.000657486,0.00012286745],"category_scores_gemma":[0.000013274111,0.00071931194,0.00041024492,0.0008201447,0.0003421167,0.0005241612,0.0020306774,0.0017587066,0.0001633829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056535547,0.0032269193,0.08590612,0.0009404944,0.0014908847,0.011604679,0.004894344,0.2653139,0.000886436,0.60390264,0.0012328645,0.020035394],"study_design_scores_gemma":[0.0039115897,0.00054734125,0.036289576,0.00020855355,0.00035963167,0.00017164793,0.00027866752,0.8538537,0.0011091143,0.0976156,0.0022372394,0.0034173282],"about_ca_topic_score_codex":0.0005574037,"about_ca_topic_score_gemma":0.0007856994,"teacher_disagreement_score":0.58853984,"about_ca_system_score_codex":0.0003596066,"about_ca_system_score_gemma":0.0004223326,"threshold_uncertainty_score":0.9995258},"labels":[],"label_agreement":null},{"id":"W6911412606","doi":"10.5281/zenodo.11852455","title":"Ahmadiyya gebetsplan 2023 pdf","year":2024,"lang":"de","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pretext; Circumstantial evidence; TSG101; Limiting","score_opus":0.03373907129882956,"score_gpt":0.24834145407281552,"score_spread":0.21460238277398597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6911412606","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051651343,0.0025796879,0.061730947,0.001745767,0.0029064754,0.0013411151,0.0006320098,0.002516559,0.9264958],"genre_scores_gemma":[0.0032860306,0.0007677815,0.004617451,0.0005374933,0.0037496942,2.3736415e-7,0.0030510454,0.013579977,0.9704103],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99277425,0.0011934016,0.0008328497,0.0024878094,0.0013915685,0.0013201031],"domain_scores_gemma":[0.9954992,0.000089008856,0.00035677874,0.0025312451,0.0008440023,0.00067978515],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0019498313,0.00078009884,0.0006928349,0.0010939449,0.0019762088,0.006465356,0.0068754847,0.00046625687,0.3461994],"category_scores_gemma":[0.0007397309,0.00083513744,0.00031376677,0.0023845246,0.0005747118,0.0003946078,0.01088481,0.0015271261,0.83437073],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001841891,0.0002474769,7.991517e-7,0.00044410615,0.00022612182,0.00024371644,0.001078031,0.00006271307,0.00009856279,0.0075053363,0.86620986,0.12386483],"study_design_scores_gemma":[0.00042595057,0.00042256742,0.00007804397,0.00033957025,0.00008171781,0.00032558857,0.000088375135,0.0107382275,0.000027092441,0.0022031798,0.9844217,0.0008480236],"about_ca_topic_score_codex":0.00007513831,"about_ca_topic_score_gemma":0.0000022318432,"teacher_disagreement_score":0.48817134,"about_ca_system_score_codex":0.0006090117,"about_ca_system_score_gemma":0.0000305809,"threshold_uncertainty_score":0.9994099},"labels":[],"label_agreement":null},{"id":"W6911462791","doi":"10.5281/zenodo.11043431","title":"Analysis of refactoring evolution between Artificial Intelligence frameworks and Non-Intelligence Frameworks","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Code refactoring; Applications of artificial intelligence; Domain (mathematical analysis); Abstraction; Key (lock)","score_opus":0.04471696041269123,"score_gpt":0.2884742628764803,"score_spread":0.24375730246378907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6911462791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022061707,0.00023120762,0.9744471,0.0004935555,0.0002377524,0.00024076561,0.000044889213,0.00069864927,0.0015444042],"genre_scores_gemma":[0.9885401,0.000056209017,0.010876446,0.000022818405,0.00016774145,5.7846005e-8,0.00008394785,0.0002285051,0.00002417302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743414,0.00026881657,0.00052645645,0.00083110586,0.00054229185,0.00039720617],"domain_scores_gemma":[0.9980974,0.00026544955,0.00011642999,0.00081249647,0.00051746,0.00019072104],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012648298,0.00019123095,0.0003088358,0.00080898084,0.0007519205,0.0014054889,0.0016786221,0.00028877123,0.0007321055],"category_scores_gemma":[0.00073289016,0.00019875787,0.00012324972,0.0039207716,0.0002468882,0.00054371177,0.0022227482,0.0010749588,0.00044758362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010194694,0.0000816734,0.00014905157,0.00009618206,0.00027886455,0.000012539148,0.0029295385,0.004657582,0.00040244675,0.06592393,0.00028386977,0.9251741],"study_design_scores_gemma":[0.000034082164,0.00032793876,0.011884171,0.0001665615,0.00019864972,0.00002205798,0.00035967948,0.92577785,0.0016546138,0.044959527,0.014157179,0.00045766425],"about_ca_topic_score_codex":0.000040690455,"about_ca_topic_score_gemma":8.3254537e-7,"teacher_disagreement_score":0.9664784,"about_ca_system_score_codex":0.0002211734,"about_ca_system_score_gemma":0.000010479234,"threshold_uncertainty_score":0.99963117},"labels":[],"label_agreement":null},{"id":"W6911582740","doi":"10.5281/zenodo.11727313","title":"antibiotic ladder pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Antibiotics; Antibiotic Stewardship; Dosing; Antibiotic resistance; Guideline; Nitrofurantoin; Metronidazole; Antimicrobial stewardship","score_opus":0.027588636250797608,"score_gpt":0.24409898289254298,"score_spread":0.21651034664174537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6911582740","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005401468,0.00058075617,0.07485632,0.0007241384,0.0007678979,0.0004899509,0.000097783544,0.0041493475,0.9183284],"genre_scores_gemma":[0.0022605152,0.0001745989,0.01032012,0.00031007663,0.0010348407,3.6773635e-8,0.00063625776,0.012079373,0.97318417],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970987,0.00034937685,0.00029065568,0.0011216548,0.0006088149,0.000530832],"domain_scores_gemma":[0.99797314,0.000023143248,0.00013570506,0.0013946103,0.00024925545,0.00022416122],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006148201,0.00032049892,0.0002996978,0.0006205497,0.00054971885,0.0022309523,0.0035297137,0.00020352921,0.060246933],"category_scores_gemma":[0.00025198006,0.00032452104,0.00011981411,0.0010806941,0.00019083887,0.00017985236,0.005031754,0.00054144516,0.28142118],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017926196,0.0000845666,2.2759295e-7,0.00017117689,0.00005752601,0.000057390876,0.00021873403,0.0000056675076,0.00004684073,0.008782669,0.9178811,0.07269231],"study_design_scores_gemma":[0.0001670936,0.0001173385,0.000024687879,0.00012338595,0.000016487693,0.00014568264,0.000020373593,0.002124293,0.000029823857,0.0012673356,0.99561644,0.00034704627],"about_ca_topic_score_codex":0.000029550885,"about_ca_topic_score_gemma":7.907757e-7,"teacher_disagreement_score":0.22117426,"about_ca_system_score_codex":0.000167555,"about_ca_system_score_gemma":0.000008939487,"threshold_uncertainty_score":0.99992067},"labels":[],"label_agreement":null},{"id":"W6921157341","doi":"10.6084/m9.figshare.6199211.v1","title":"Viitorul a început în trecut","year":2018,"lang":"ro","type":"article","venue":"Figshare","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Product (mathematics); Context (archaeology); Identification (biology)","score_opus":0.05138828752627546,"score_gpt":0.2820186541869926,"score_spread":0.23063036666071718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6921157341","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051233815,0.010335459,0.019412404,0.011225433,0.030879097,0.007128776,0.70905554,0.006766526,0.20007339],"genre_scores_gemma":[0.8472346,0.000028368406,0.050896287,0.0072102123,0.036863953,0.00084747607,0.03821607,0.0003803847,0.018322619],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951063,0.0002799903,0.0006652712,0.0017408185,0.0009371798,0.0012704786],"domain_scores_gemma":[0.9954462,0.0005459492,0.00032459802,0.0022780779,0.0008764753,0.0005286834],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025562977,0.0006306263,0.0005740018,0.00020894432,0.0005310974,0.0009723718,0.0035097264,0.0003877007,0.26563823],"category_scores_gemma":[0.00167373,0.0006352937,0.00034854436,0.0013808126,0.000111895206,0.0008007709,0.0029690466,0.000537284,0.061241716],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012445859,0.00027677827,0.00007905962,0.00018017806,0.000042747663,0.00011223223,0.0018227819,0.000022726366,0.000035721598,0.00017297998,0.816631,0.18061134],"study_design_scores_gemma":[0.00062842155,0.0009582108,0.006983177,0.0015496131,0.0000191511,0.000098223165,0.000043205855,0.16503929,0.0014639925,0.0014327122,0.8206781,0.0011058843],"about_ca_topic_score_codex":0.000054513257,"about_ca_topic_score_gemma":0.000069187794,"teacher_disagreement_score":0.84211123,"about_ca_system_score_codex":0.0002904509,"about_ca_system_score_gemma":0.0005816343,"threshold_uncertainty_score":0.9996098},"labels":[],"label_agreement":null},{"id":"W6924601270","doi":"10.15468/dl.s8h6fh","title":"Occurrence Download","year":2018,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Lithobates; Range (aeronautics)","score_opus":0.01668460768661365,"score_gpt":0.2227517949990997,"score_spread":0.20606718731248605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924601270","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000100999416,0.000017664299,0.0030000901,0.00028156763,0.002125423,0.00046590195,0.9935195,0.00037687493,0.00011200836],"genre_scores_gemma":[0.000007912944,0.000022820182,0.00018136021,0.00069383474,0.000006664975,0.000004846159,0.99908245,1.757647e-8,9.463037e-8],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99697804,0.00016257563,0.0006532653,0.00064283505,0.0009920843,0.0005712128],"domain_scores_gemma":[0.99650526,0.00005808957,0.00048191854,0.0019150121,0.0007318731,0.00030785703],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006813469,0.0004891503,0.00045394903,0.0001650803,0.00046063244,0.00065291795,0.0034250973,0.0004900203,0.0007125291],"category_scores_gemma":[0.0002798812,0.0004982112,0.00025457065,0.0008684823,0.00038582014,0.0027346904,0.002810871,0.00040752595,0.17923689],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012146906,0.00006586777,0.0002892311,0.00010270584,0.000024343077,0.0000035836997,0.000065671135,0.000009626075,1.3712766e-8,9.956486e-7,0.9942904,0.005135406],"study_design_scores_gemma":[0.00030921397,0.00010615417,0.0001551059,0.0000029420107,0.000022692275,0.00001611268,0.000017276774,0.000021837119,0.0000031233476,0.00002383583,0.99881804,0.0005036752],"about_ca_topic_score_codex":0.000485742,"about_ca_topic_score_gemma":0.00002175304,"teacher_disagreement_score":0.17852436,"about_ca_system_score_codex":0.0006374892,"about_ca_system_score_gemma":0.00036146777,"threshold_uncertainty_score":0.999747},"labels":[],"label_agreement":null},{"id":"W6924615914","doi":"10.15468/dl.nydtc2","title":"Occurrence Download","year":2022,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); Data set; Set (abstract data type)","score_opus":0.01648800682483591,"score_gpt":0.2178908363310797,"score_spread":0.20140282950624377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924615914","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059278107,0.000031454194,0.0015496368,0.00038555966,0.0021046158,0.0005127903,0.994867,0.0003780333,0.000111599446],"genre_scores_gemma":[0.0000050167555,0.00003150002,0.00006829988,0.00080501975,0.0000022548168,0.0000120246905,0.9990757,1.840262e-8,1.266694e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966893,0.00024085546,0.00064164214,0.0006336821,0.0012563657,0.0005381354],"domain_scores_gemma":[0.99703354,0.00007358807,0.00048307749,0.0018052178,0.00033907036,0.00026550228],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000754735,0.00045561124,0.00044493127,0.00018583854,0.000695208,0.0005288418,0.0037886447,0.00029839156,0.014763923],"category_scores_gemma":[0.00021859507,0.00049942755,0.0002840978,0.0010663385,0.00019402096,0.0023905842,0.004711061,0.0006497472,0.05776852],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012513148,0.00008681106,0.00027592288,0.00009757036,0.000024543724,0.000007678975,0.0000836837,0.00010339977,9.6911315e-9,0.000001786863,0.9910684,0.008237676],"study_design_scores_gemma":[0.0003151344,0.00009069377,0.000114733106,9.24326e-7,0.000021697737,0.000020945477,0.000053484055,0.000016514769,8.2536604e-7,0.00001712875,0.9988549,0.00049306825],"about_ca_topic_score_codex":0.0006619665,"about_ca_topic_score_gemma":0.000013118022,"teacher_disagreement_score":0.0430046,"about_ca_system_score_codex":0.001044947,"about_ca_system_score_gemma":0.000410905,"threshold_uncertainty_score":0.9997457},"labels":[],"label_agreement":null},{"id":"W6925323523","doi":"10.18163/urppchusj2015121001","title":"Séminaires en gestion pharmaceutique en établissement de santé : 10 ans de recul","year":2015,"lang":"fr","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Hospitalier Universitaire Sainte-Justine","funders":"","keywords":"Context (archaeology); Authorization; Christian ministry","score_opus":0.05774186079080647,"score_gpt":0.3469773969313708,"score_spread":0.28923553614056435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925323523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049662873,0.00390279,0.8823115,0.04727118,0.0024318383,0.00060402864,0.000010425328,0.0004978209,0.013307526],"genre_scores_gemma":[0.63243806,0.0007870355,0.34349406,0.0027116952,0.00188739,0.0000838566,0.00000871087,0.00005056337,0.018538592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944757,0.002163193,0.00056876807,0.0009655543,0.0006554461,0.0011713202],"domain_scores_gemma":[0.996795,0.00086518994,0.00014242584,0.0009245933,0.00044009794,0.00083269476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0053883214,0.0004391518,0.00037885184,0.0001810221,0.00014793969,0.00044749267,0.0015260334,0.00041884274,0.00085313176],"category_scores_gemma":[0.0009930591,0.00044922653,0.00016128841,0.00074229564,0.00017929303,0.0009520572,0.0011861929,0.00065081293,0.0004363597],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059364476,0.0012134841,0.010232231,0.00016575542,0.00008833156,0.00028412812,0.027469153,0.007896937,0.0017779681,0.014818073,0.06617794,0.86981666],"study_design_scores_gemma":[0.00097021786,0.00062791136,0.035294015,0.00013354603,0.00006607054,0.00038034774,0.00045105364,0.7435346,0.011546649,0.02240974,0.18388507,0.00070074934],"about_ca_topic_score_codex":0.0036028142,"about_ca_topic_score_gemma":0.00062712684,"teacher_disagreement_score":0.8691159,"about_ca_system_score_codex":0.0018570264,"about_ca_system_score_gemma":0.0012994873,"threshold_uncertainty_score":0.999796},"labels":[],"label_agreement":null},{"id":"W6926300273","doi":"10.25384/sage.21213746","title":"Supplemental Material - Canadian Association of Radiologists/Canadian Association for Interventional Radiology/Canadian Society of Thoracic Radiology Guidelines on Thoracic Interventions","year":2023,"lang":"en","type":"article","venue":"Sage Journals Data","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Association (psychology); Psychological intervention; Interventional radiology; Professional association; MEDLINE","score_opus":0.12668352735546615,"score_gpt":0.407888504854488,"score_spread":0.28120497749902185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926300273","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24008591,0.0048486674,0.2208288,0.18280838,0.027103169,0.0071422607,0.31545448,0.0006735379,0.0010547764],"genre_scores_gemma":[0.8904196,0.0017417979,0.08521065,0.0015329976,0.0020286012,0.00014949362,0.017532423,0.00008453528,0.0012999194],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9951526,0.0008276077,0.0016536689,0.000749865,0.0004968451,0.0011194351],"domain_scores_gemma":[0.9955773,0.0007972262,0.0012170952,0.0011097296,0.0006918744,0.00060681836],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010768866,0.00030124802,0.0007033792,0.0010702033,0.00043775642,0.00019247925,0.0027340811,0.00045376635,0.0010430793],"category_scores_gemma":[0.0025633422,0.00031110266,0.0006195923,0.00095163705,0.00009081284,0.0006726459,0.0004405652,0.00039166657,0.000032381424],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006032009,0.00023972704,0.11241116,0.00036402012,0.0016283762,0.00004165223,0.00067677355,0.0010934739,0.0010892651,0.000982284,0.7161828,0.16523014],"study_design_scores_gemma":[0.0043922015,0.0031916825,0.5111368,0.0035381753,0.00078744034,0.00045756923,0.0014035016,0.2678464,0.0021544036,0.04494844,0.15736371,0.0027796917],"about_ca_topic_score_codex":0.3813935,"about_ca_topic_score_gemma":0.892062,"teacher_disagreement_score":0.65033364,"about_ca_system_score_codex":0.0032239158,"about_ca_system_score_gemma":0.0019065554,"threshold_uncertainty_score":0.9999341},"labels":[],"label_agreement":null},{"id":"W6929316692","doi":"10.4224/20377283","title":"MIIP Report: a primer on municipal infrastructure asset management","year":2004,"lang":"en","type":"report","venue":"NPARC","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de la Défense Nationale; Public Works and Government Services Canada","keywords":"Asset management; Urban infrastructure; Asset (computer security); Service (business); Critical infrastructure; Transport infrastructure; Remedial education","score_opus":0.02764129638065955,"score_gpt":0.29559817361375623,"score_spread":0.2679568772330967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929316692","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003144934,0.00031941684,0.090764835,0.0014638563,0.010699928,0.0021286132,0.000054479613,0.0011800734,0.8902439],"genre_scores_gemma":[0.1020574,0.0007919853,0.8502606,0.0013454298,0.003909064,0.0005136842,0.00058578834,0.00032251154,0.04021352],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928695,0.00016111277,0.0011189099,0.0020661463,0.0029170397,0.0008672689],"domain_scores_gemma":[0.99380285,0.00013127824,0.0008088541,0.0045409594,0.00043068142,0.00028540567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014633925,0.0007984027,0.0009276779,0.0004743021,0.00018816866,0.0003519757,0.0030755298,0.0005957721,0.000330591],"category_scores_gemma":[0.0002377376,0.00072436564,0.0004442927,0.00074583024,0.00013653752,0.00020618194,0.0025015275,0.0012686242,0.00014615271],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004171962,0.0013330155,0.001280933,0.0017497975,0.0013208562,0.02944142,0.0012871183,0.006845426,0.00009995759,0.03967173,0.27866793,0.63826007],"study_design_scores_gemma":[0.0007293269,0.0003745634,0.018666826,0.00052616384,0.00014327353,0.0033386142,0.000019122932,0.0048291716,0.00013644832,0.12421322,0.8454547,0.0015685979],"about_ca_topic_score_codex":0.0001581322,"about_ca_topic_score_gemma":0.000025936904,"teacher_disagreement_score":0.85003036,"about_ca_system_score_codex":0.001665715,"about_ca_system_score_gemma":0.0013934423,"threshold_uncertainty_score":0.9995207},"labels":[],"label_agreement":null},{"id":"W6929870811","doi":"10.5255/ukda-sn-8588-1","title":"Quarterly Labour Force Survey, July - September, 2019","year":2020,"lang":"en","type":"dataset","venue":"UK Data Archive","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Unemployment; Documentation; Current Population Survey; Population; Work (physics); Sample (material); Data collection; International comparisons","score_opus":0.039537583762615465,"score_gpt":0.28519021907592124,"score_spread":0.24565263531330578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929870811","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032937244,0.00014097428,0.14101715,0.00026364348,0.0018164841,0.0006236556,0.85571367,0.00022061815,0.00020052877],"genre_scores_gemma":[0.000011819365,0.000070631715,0.030378852,0.0008615691,0.000672262,0.000022905628,0.96759963,0.000035815985,0.00034649402],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99302995,0.0011673449,0.0008700184,0.002984301,0.0010044153,0.0009439421],"domain_scores_gemma":[0.98727965,0.001872588,0.0004988839,0.009692478,0.00013990798,0.0005165],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013366155,0.00081978703,0.00101202,0.0002726717,0.00022824034,0.00079882157,0.01756135,0.00027021003,0.00014054339],"category_scores_gemma":[0.00045178464,0.0007994713,0.00018382623,0.00075585913,0.00022303555,0.00079516746,0.009701968,0.0014225848,0.010670026],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017088732,0.000111877234,0.00001685689,0.00012142605,0.0001019137,0.00014513955,0.0001386366,0.000010297306,0.0000027166511,0.000113994196,0.9931355,0.006084514],"study_design_scores_gemma":[0.0003750447,0.00041198722,0.0022794355,0.000050111987,0.00003895182,0.00005097405,0.000005963902,0.007257705,0.0000015065528,0.0051784613,0.983481,0.00086884585],"about_ca_topic_score_codex":0.0033965514,"about_ca_topic_score_gemma":0.0040888544,"teacher_disagreement_score":0.111886,"about_ca_system_score_codex":0.000075060365,"about_ca_system_score_gemma":0.0006355804,"threshold_uncertainty_score":0.9994456},"labels":[],"label_agreement":null},{"id":"W6930207677","doi":"10.5281/zenodo.12006590","title":"Unfallanzeige vbg pdf","year":2024,"lang":"de","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Force majeure; German; Context (archaeology)","score_opus":0.03273231208679961,"score_gpt":0.2474596904555029,"score_spread":0.2147273783687033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930207677","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006417513,0.0023842067,0.07275312,0.0019526441,0.0026965423,0.0012866473,0.00038818087,0.0034332387,0.91504127],"genre_scores_gemma":[0.008768206,0.0010173164,0.00895135,0.00085117674,0.0049397806,2.5761324e-7,0.0031362309,0.022540769,0.9497949],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9930773,0.0011402792,0.00079193944,0.0023831548,0.0013650456,0.0012422813],"domain_scores_gemma":[0.9955523,0.00007877039,0.00033418133,0.0025138855,0.0009042491,0.00061660865],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0018242993,0.00074556906,0.0006568204,0.0009871545,0.0018432782,0.006117153,0.0066418853,0.0004451561,0.27544588],"category_scores_gemma":[0.0007520549,0.0007872212,0.00031245215,0.002139199,0.0005468706,0.00033891806,0.0112313675,0.0013932394,0.7627541],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017279337,0.00028516538,0.0000010113673,0.0004470874,0.00021375835,0.00020335375,0.0014027255,0.000045641427,0.00011419761,0.014027385,0.8500617,0.13318066],"study_design_scores_gemma":[0.00041358676,0.0004218432,0.000077362194,0.0002792594,0.00007069516,0.00022719003,0.00008240723,0.007336828,0.000030510932,0.0031661424,0.9870924,0.00080181245],"about_ca_topic_score_codex":0.00005308313,"about_ca_topic_score_gemma":0.0000014882864,"teacher_disagreement_score":0.48730817,"about_ca_system_score_codex":0.0006244755,"about_ca_system_score_gemma":0.00002883669,"threshold_uncertainty_score":0.9994579},"labels":[],"label_agreement":null},{"id":"W6930480208","doi":"10.5281/zenodo.12276479","title":"2021 gmc acadia brochure pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Brochure; Phone; Las vegas; Gallon (US)","score_opus":0.023902386927783337,"score_gpt":0.24144090898135084,"score_spread":0.2175385220535675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930480208","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000500874,0.000981401,0.06840265,0.0010369276,0.00084457576,0.0005614446,0.0001609155,0.0027775886,0.9252295],"genre_scores_gemma":[0.0006304699,0.0002839962,0.008016808,0.0002735895,0.0014963045,1.2333345e-7,0.00080618664,0.009882254,0.9786103],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965618,0.00042343355,0.0003422783,0.001313964,0.000736443,0.00062205817],"domain_scores_gemma":[0.99760747,0.000029914605,0.00016273597,0.0015738382,0.00031463132,0.00031141302],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006666845,0.0003816187,0.00034593826,0.0006659631,0.0006410094,0.0024463409,0.0043593673,0.00029692805,0.12115245],"category_scores_gemma":[0.0003426322,0.00039327907,0.00014802214,0.0013320749,0.00019544938,0.00022560323,0.005893673,0.0008200077,0.31267378],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002735727,0.00006940754,1.9024688e-7,0.00013913077,0.00005909236,0.000060092494,0.00030314212,0.0000069511348,0.00006868981,0.007574033,0.8877711,0.103945404],"study_design_scores_gemma":[0.0001914125,0.0001167392,0.00002019216,0.00012905762,0.000018064282,0.00014290209,0.000027111617,0.0019809434,0.00002165332,0.0018317149,0.995113,0.00040717548],"about_ca_topic_score_codex":0.000034345372,"about_ca_topic_score_gemma":0.0000013816833,"teacher_disagreement_score":0.19152133,"about_ca_system_score_codex":0.00023701656,"about_ca_system_score_gemma":0.000014102111,"threshold_uncertainty_score":0.9998519},"labels":[],"label_agreement":null},{"id":"W6930504902","doi":"10.5281/zenodo.12365805","title":"flight attendant training manual pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Crew; Training manual; Certificate; Training (meteorology); Flight training; Manual handling; Standard operating procedure","score_opus":0.04213220330132471,"score_gpt":0.2606741057411564,"score_spread":0.21854190243983168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930504902","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000740038,0.00042181008,0.10318892,0.0010110666,0.00085925387,0.00048207422,0.00014341419,0.0040053767,0.88988066],"genre_scores_gemma":[0.0018994453,0.00013459573,0.01566823,0.00036254837,0.0016781304,1.648729e-7,0.0007275117,0.013208117,0.96632123],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99641985,0.00039452055,0.00036433604,0.0012501667,0.00091990957,0.0006512167],"domain_scores_gemma":[0.9979345,0.000029643517,0.00016277772,0.0012757315,0.0003225334,0.0002748151],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010633749,0.00036984417,0.00035912817,0.0006779941,0.0006912302,0.0021141414,0.0037349865,0.00020069644,0.054023642],"category_scores_gemma":[0.00030876254,0.0003725648,0.00014224258,0.0009578275,0.0002009529,0.00020667785,0.0048603895,0.00065059785,0.16845825],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027457538,0.00005874253,7.25612e-8,0.00012695615,0.00006136716,0.000095570715,0.0010912764,0.0000061005444,0.000053809836,0.009511851,0.8458502,0.14314127],"study_design_scores_gemma":[0.00019760284,0.00013945454,0.000013422012,0.00013850254,0.000017276305,0.00026517452,0.00008882926,0.0026366918,0.00002103778,0.0014195711,0.9946591,0.00040330182],"about_ca_topic_score_codex":0.000024456225,"about_ca_topic_score_gemma":0.0000013497761,"teacher_disagreement_score":0.1488089,"about_ca_system_score_codex":0.0002828382,"about_ca_system_score_gemma":0.000015462738,"threshold_uncertainty_score":0.9998726},"labels":[],"label_agreement":null},{"id":"W6930556008","doi":"10.5281/zenodo.15033546","title":"COVID touch and travel data around US and foreign hospitals 2020-2021","year":2020,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Documentation; Pandemic; Dozen; Population; Health care; Coronavirus disease 2019 (COVID-19); Public health; Value (mathematics)","score_opus":0.047389891446629855,"score_gpt":0.26248621518802334,"score_spread":0.21509632374139348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930556008","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013857873,0.00042258532,0.036537692,0.0017120163,0.0002431343,0.0009626708,0.95742035,0.00045196334,0.002111037],"genre_scores_gemma":[0.0010368379,0.0010894736,0.0033271613,0.0006099205,0.00045420797,9.862733e-8,0.99279964,0.00060534483,0.00007733304],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99593556,0.00053920347,0.00046581286,0.0018282454,0.0006967675,0.00053442124],"domain_scores_gemma":[0.9961732,0.00012786387,0.00023025126,0.0024559752,0.00035678325,0.0006559277],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.00096964394,0.00039516357,0.0004655314,0.00021598475,0.0015287491,0.003533844,0.005773414,0.0001931729,0.0018312699],"category_scores_gemma":[0.0018783462,0.00041717067,0.000047700316,0.0007978689,0.0003702529,0.00077294407,0.019359414,0.0006779942,0.002842974],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013145877,0.00007321248,0.0000021045494,0.00019713056,0.000052413106,0.000105477484,0.00016961315,0.0000050949843,0.00002300768,0.0005725287,0.9603159,0.038470384],"study_design_scores_gemma":[0.00045340357,0.00037112128,0.00031202752,0.00003273919,0.000033555003,0.00036871532,0.0000927984,0.006782198,0.00000719489,0.0008427149,0.99026304,0.0004405159],"about_ca_topic_score_codex":0.000073469215,"about_ca_topic_score_gemma":0.0000019785875,"teacher_disagreement_score":0.03802987,"about_ca_system_score_codex":0.00014735936,"about_ca_system_score_gemma":0.000032924625,"threshold_uncertainty_score":0.99982804},"labels":[],"label_agreement":null},{"id":"W6930598968","doi":"10.5281/zenodo.15753357","title":"Fig. 44 in A revision of Parapterogramma Papp and Pseudopterogramma Papp, with a review of the Parapterogramma genus group of the Pacific and Indomalayan regions (Diptera, Sphaeroceridae, Limosininae)","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Aedeagus; Genus; Group (periodic table); Scale (ratio); Holotype","score_opus":0.017425069726873674,"score_gpt":0.22686407813830042,"score_spread":0.20943900841142676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930598968","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06728829,0.225286,0.17147781,0.016561534,0.0022736494,0.04744332,0.0022034852,0.004479793,0.4629861],"genre_scores_gemma":[0.930356,0.038480878,0.019633867,0.00050402264,0.00017271291,0.0000031675654,0.00028768982,0.0033704538,0.007191168],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965065,0.0009961408,0.0007167338,0.0007784014,0.0006271959,0.00037499843],"domain_scores_gemma":[0.99696916,0.00008783669,0.0007852834,0.0016850075,0.00035628784,0.00011641987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010949518,0.00035269195,0.0006728874,0.00030725962,0.0003394964,0.00023832277,0.0023482535,0.00015506039,0.00028425065],"category_scores_gemma":[0.00031852844,0.00023875324,0.00014613391,0.0017250393,0.0008387763,0.0001302826,0.0031308485,0.00042980263,0.000010851263],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079280624,0.0004660163,0.0010550867,0.0072698127,0.00016120975,0.000015371385,0.0012261141,0.0000048653496,0.00005563003,0.007497822,0.02994514,0.95222366],"study_design_scores_gemma":[0.001076636,0.0006543819,0.006728554,0.011648726,0.0000837059,0.00014644756,0.00010879129,0.00036073948,0.000051483188,0.0002533434,0.9785257,0.0003614958],"about_ca_topic_score_codex":0.00015264556,"about_ca_topic_score_gemma":0.000014828322,"teacher_disagreement_score":0.95186216,"about_ca_system_score_codex":0.00004964153,"about_ca_system_score_gemma":0.000020538342,"threshold_uncertainty_score":0.9736075},"labels":[],"label_agreement":null},{"id":"W6930911243","doi":"10.5281/zenodo.14794556","title":"La pédagogie par le jeu en enseignement supérieur : un levier pour favoriser le développement du savoir-être","year":2025,"lang":"fr","type":"book","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Continuing education; Primary health care; Health services","score_opus":0.06150793556530028,"score_gpt":0.25953493727899923,"score_spread":0.19802700171369897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930911243","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012386331,0.001284124,0.37697327,0.035337042,0.0014381119,0.0027333628,0.00064396125,0.002138055,0.57821345],"genre_scores_gemma":[0.16419134,0.0069382177,0.0965771,0.0064799953,0.0047815316,0.000005257046,0.011181389,0.012268702,0.69757646],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98963124,0.0039223167,0.0012442952,0.0023111869,0.0015097419,0.0013812109],"domain_scores_gemma":[0.9939283,0.0005165639,0.00049107586,0.0023302971,0.002101096,0.00063264533],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0037330366,0.0009437327,0.0008780614,0.000651319,0.004932191,0.0029789975,0.006253396,0.00052976084,0.009895734],"category_scores_gemma":[0.0022433312,0.0010775398,0.00039897545,0.0012847716,0.00079165376,0.00067414687,0.014563303,0.0015911685,0.009940578],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004640532,0.0011725053,0.000014257044,0.0004997903,0.00027012933,0.00028999607,0.0063471557,0.00052504987,0.00020760573,0.055930182,0.5256689,0.409028],"study_design_scores_gemma":[0.0014703125,0.0004384284,0.0016374341,0.0003608379,0.00008025535,0.00024794324,0.00052030315,0.006156425,0.00036288935,0.0052449754,0.98250866,0.0009715445],"about_ca_topic_score_codex":0.000119806566,"about_ca_topic_score_gemma":0.000004949468,"teacher_disagreement_score":0.45683974,"about_ca_system_score_codex":0.0021357008,"about_ca_system_score_gemma":0.0006767756,"threshold_uncertainty_score":0.9991675},"labels":[],"label_agreement":null},{"id":"W6930962083","doi":"10.5281/zenodo.286387","title":"FIGURE 14. Sphaerotylus verenae n in Taxonomic review of Hadromerida (Porifera, Demospongiae) from British Columbia, Canada, and adjacent waters, with the description of nine new species","year":2014,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Bar (unit); Scale (ratio); Absolute scale; Full scale; Scale effects","score_opus":0.016288089918503605,"score_gpt":0.1764819190009493,"score_spread":0.1601938290824457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930962083","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068747915,0.06803371,0.27292687,0.011533792,0.0026810018,0.016565613,0.004781112,0.0026206886,0.5521093],"genre_scores_gemma":[0.16341734,0.03515447,0.03630516,0.0026408043,0.0016605331,0.0000020972843,0.0065917093,0.011574287,0.7426536],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978104,0.00041170255,0.00041532126,0.0005722407,0.0005042706,0.00028602025],"domain_scores_gemma":[0.9983916,0.000040824612,0.0003922521,0.00077575754,0.0002588582,0.00014070133],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005351404,0.00018717421,0.0004813983,0.00008752081,0.00021237486,0.00046152662,0.0015601631,0.000081346014,0.011689407],"category_scores_gemma":[0.00018261305,0.00019829127,0.00004248388,0.00045690266,0.00020683152,0.000120200006,0.0011277078,0.00027187748,0.00008469433],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009352877,0.000043096617,0.00017902031,0.0006521771,0.000045824312,0.000014859754,0.00010762094,0.000012526584,0.0000309717,0.000040108313,0.95489097,0.04397348],"study_design_scores_gemma":[0.00047586038,0.00015718304,0.016555207,0.0017231674,0.000021778551,0.00003759597,0.000020008189,0.00021444606,0.000014349074,0.000025780733,0.980537,0.00021765505],"about_ca_topic_score_codex":0.43007305,"about_ca_topic_score_gemma":0.14534642,"teacher_disagreement_score":0.28472662,"about_ca_system_score_codex":0.00022962596,"about_ca_system_score_gemma":0.00006464448,"threshold_uncertainty_score":0.98921406},"labels":[],"label_agreement":null},{"id":"W6930980619","doi":"10.5281/zenodo.14554548","title":"Data from ''A Proof‐of‐Principle Demonstration: Exploring the Effect of Anode Layer Microstructure on the Alkaline Oxygen Evolution Reaction''","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Microstructure; Anode; Oxygen evolution; Layer (electronics); Oxygen","score_opus":0.07793594250172797,"score_gpt":0.27840423412647675,"score_spread":0.20046829162474877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930980619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53310674,0.00055532926,0.44880947,0.0053285537,0.0012088687,0.0019020615,0.0010994937,0.001241665,0.0067478092],"genre_scores_gemma":[0.99818933,0.000012895626,0.00093061366,0.000026843496,0.00019757595,1.976938e-7,0.00040362697,0.00019046802,0.00004844193],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978244,0.00066464016,0.0002984704,0.0005376571,0.00047386123,0.00020101923],"domain_scores_gemma":[0.9976938,0.0003183942,0.00010902628,0.00158033,0.0002463791,0.00005210258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001482559,0.0001403841,0.00014333244,0.000111965004,0.0008019493,0.0005133955,0.0028454575,0.000043076245,0.00045318186],"category_scores_gemma":[0.0006873063,0.00008982311,0.00005417271,0.0008450367,0.00016679923,0.0005649622,0.0024967014,0.00032381478,0.00037965723],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029598945,0.00031273972,0.000110061046,0.0004976116,0.00046984415,0.000033701803,0.005010117,0.004410886,0.29405367,0.08689321,0.08216332,0.52574885],"study_design_scores_gemma":[0.0005152471,0.00087223755,0.009959994,0.00020156024,0.000062007224,0.00012339592,0.0001644683,0.2664926,0.052161444,0.0042374744,0.66486466,0.000344897],"about_ca_topic_score_codex":0.00003832282,"about_ca_topic_score_gemma":0.0000017534746,"teacher_disagreement_score":0.5827013,"about_ca_system_score_codex":0.00011160768,"about_ca_system_score_gemma":0.000011616589,"threshold_uncertainty_score":0.61680263},"labels":[],"label_agreement":null},{"id":"W6931093132","doi":"10.5281/zenodo.16813645","title":"TuringLang/Turing.jl: v0.40.0","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fowler Kennedy Sport Medicine Clinic; Tellabs (Canada); University of British Columbia","funders":"","keywords":"Turing; Value (mathematics); Variable (mathematics); Relation (database); Field (mathematics); Object (grammar)","score_opus":0.024798837642399315,"score_gpt":0.23761244618270633,"score_spread":0.212813608540307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931093132","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011861899,0.0003008076,0.1836465,0.00072376605,0.00058266596,0.00055212155,0.00014139336,0.0045757117,0.80946517],"genre_scores_gemma":[0.004523026,0.00033371864,0.027693672,0.0006852705,0.0017075199,2.5974572e-7,0.0014710223,0.012048806,0.9515367],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99678683,0.0004977953,0.0003373885,0.0011335968,0.00064477394,0.00059958675],"domain_scores_gemma":[0.99738616,0.000054608478,0.00020489881,0.001730917,0.00039589682,0.00022751013],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00077219226,0.00036462268,0.00035458882,0.0006958007,0.00097635627,0.0015426324,0.004839351,0.00023169795,0.016421016],"category_scores_gemma":[0.0005656523,0.000383408,0.00012968761,0.000942637,0.00016378575,0.0001863455,0.006440651,0.00056734006,0.012857606],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006060499,0.00011577434,9.182486e-7,0.00013233755,0.000056289467,0.000034253688,0.00020883513,0.000022850616,0.000031225547,0.011125934,0.8110491,0.17721643],"study_design_scores_gemma":[0.00030749873,0.000089601985,0.00013481283,0.00010771739,0.000012265877,0.00005656436,0.000014582197,0.0016018352,0.000070634,0.0009829324,0.9962498,0.00037178266],"about_ca_topic_score_codex":0.00008997273,"about_ca_topic_score_gemma":0.0000016788239,"teacher_disagreement_score":0.18520068,"about_ca_system_score_codex":0.00024623948,"about_ca_system_score_gemma":0.000017739065,"threshold_uncertainty_score":0.9998618},"labels":[],"label_agreement":null},{"id":"W6931145076","doi":"10.5281/zenodo.3775781","title":"Preserving the agricultural data story at the Ontario Agricultural College","year":2018,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Agriculture; RDM; Variety (cybernetics); Christian ministry; Social research; Presentation (obstetrics); Research council; Applied research","score_opus":0.05800143300932929,"score_gpt":0.2410828996120538,"score_spread":0.1830814666027245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931145076","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37775066,0.00064687815,0.05642504,0.057612427,0.0031628304,0.004822441,0.00087973644,0.0050419476,0.49365804],"genre_scores_gemma":[0.9709803,0.000019137638,0.0033536605,0.0007343867,0.0013565356,2.742348e-7,0.0012125213,0.00056250993,0.021780675],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996979,0.0008431241,0.00024746335,0.0007619341,0.00067618326,0.000492272],"domain_scores_gemma":[0.996507,0.00013426064,0.00013489026,0.0023030008,0.0007772264,0.00014361368],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0015969055,0.00019357457,0.00014062706,0.00005296612,0.006621337,0.0014304887,0.009377856,0.000054497843,0.0040919795],"category_scores_gemma":[0.00055629597,0.000104317594,0.000058259222,0.0008358263,0.00044542897,0.00084870274,0.020094095,0.00045714912,0.0048464113],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001601116,0.00007941848,0.000013557763,0.000012632997,0.00005388703,0.000007162904,0.00817457,0.000054957745,0.0012796759,0.007383451,0.96304643,0.019878263],"study_design_scores_gemma":[0.00022376704,0.00014929367,0.028409237,0.0000102134,0.000010758298,0.0002445888,0.0006236665,0.003188563,0.00018660871,0.0002192848,0.96654254,0.00019147975],"about_ca_topic_score_codex":0.00041084486,"about_ca_topic_score_gemma":0.0005482131,"teacher_disagreement_score":0.59322965,"about_ca_system_score_codex":0.0005375308,"about_ca_system_score_gemma":0.000013535895,"threshold_uncertainty_score":0.99960613},"labels":[],"label_agreement":null},{"id":"W6931160740","doi":"10.5281/zenodo.7609193","title":"FIGURE 3 in Revealing a new species of Agarista (Ericaceae) endemic to the Chapada Diamantina, Brazil, segregated from A. revoluta by multiple evidence","year":2023,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Taxonomy (biology); Section (typography); Morphology (biology); Tympanum (architecture)","score_opus":0.04608834769675613,"score_gpt":0.25661566204793507,"score_spread":0.21052731435117894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931160740","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006049601,0.011537059,0.6695683,0.027981915,0.002829336,0.009916462,0.0039015508,0.016723951,0.25149184],"genre_scores_gemma":[0.06705742,0.0040552113,0.04153674,0.0012101216,0.0020089936,0.0000014412224,0.002365607,0.023830047,0.8579344],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964205,0.0006551302,0.00053936103,0.0010732721,0.0007757016,0.0005360034],"domain_scores_gemma":[0.9971454,0.000353974,0.00036376438,0.0016402461,0.00027570143,0.0002208857],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010616696,0.00032296934,0.00044491023,0.0004453405,0.00044912513,0.00060549367,0.00484588,0.00017250594,0.0042106826],"category_scores_gemma":[0.0036375176,0.0002921867,0.00009232874,0.0023682937,0.00015458667,0.0002391438,0.004600177,0.00057360536,0.0042376015],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015830363,0.00005721194,0.00005254763,0.000058616068,0.000033361302,0.00001583988,0.0016046113,0.0001471061,0.00088232505,0.00020101573,0.96129996,0.035631597],"study_design_scores_gemma":[0.0002806591,0.00011135567,0.0019183467,0.0005711247,0.000009554445,0.0000064532646,0.000091007234,0.0062469477,0.00010862263,0.000115579125,0.99022955,0.00031080504],"about_ca_topic_score_codex":0.002923268,"about_ca_topic_score_gemma":0.00010336296,"teacher_disagreement_score":0.62803155,"about_ca_system_score_codex":0.00026147245,"about_ca_system_score_gemma":0.0000255917,"threshold_uncertainty_score":0.99995303},"labels":[],"label_agreement":null},{"id":"W6931352311","doi":"10.5281/zenodo.4900537","title":"Black magic specialist in Quebec City +918696805715","year":2021,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wife; MAGIC (telescope); Event (particle physics)","score_opus":0.042097909910409965,"score_gpt":0.25143355950819046,"score_spread":0.2093356495977805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931352311","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11728781,0.00027241634,0.41825858,0.011868833,0.001007106,0.0011147679,0.00015487462,0.0030918715,0.44694376],"genre_scores_gemma":[0.9672974,0.00011223973,0.017465126,0.0010681914,0.00079158973,6.132598e-8,0.0009942529,0.0014149253,0.010856245],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971224,0.0006523901,0.0003763516,0.00081850303,0.0005264962,0.0005038744],"domain_scores_gemma":[0.9979107,0.00004754048,0.00009294383,0.0010679637,0.0006753778,0.00020551606],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000887085,0.00017933214,0.00021983983,0.00022594733,0.0006495677,0.0018591202,0.0022011548,0.000073907046,0.008937164],"category_scores_gemma":[0.00083950575,0.00020336997,0.000076601216,0.0016768111,0.00021883813,0.0005907676,0.00396521,0.00036649712,0.0067966296],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039787286,0.001230482,0.00014776716,0.00013462962,0.000049394443,0.000733842,0.006928697,0.0008558033,0.0023774228,0.10157493,0.17419808,0.71172917],"study_design_scores_gemma":[0.0006420186,0.00009077734,0.014596832,0.000025553776,0.0000041490553,0.00014281,0.00021155205,0.013044851,0.00069096003,0.0042172694,0.9659928,0.00034043426],"about_ca_topic_score_codex":0.00070495333,"about_ca_topic_score_gemma":0.00016459404,"teacher_disagreement_score":0.85000956,"about_ca_system_score_codex":0.0004264302,"about_ca_system_score_gemma":0.000024264658,"threshold_uncertainty_score":0.99917704},"labels":[],"label_agreement":null},{"id":"W6931502596","doi":"10.5281/zenodo.5929790","title":"Paragus (Pandasyopthalmus) haemorrhous Meigen 1822","year":2019,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wadi; Cape; Period (music); Natural (archaeology)","score_opus":0.028585622203268768,"score_gpt":0.23471524289990756,"score_spread":0.2061296206966388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931502596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14266278,0.0003876832,0.47047406,0.0028243233,0.0014975573,0.0022061132,0.00012952469,0.006929752,0.3728882],"genre_scores_gemma":[0.988284,0.000028000357,0.00834714,0.0003054653,0.00020627881,7.40107e-8,0.00021709301,0.00092014985,0.0016917926],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99712276,0.00042889873,0.0003366892,0.0008687956,0.00064012705,0.00060269533],"domain_scores_gemma":[0.99755657,0.0000628813,0.00012578591,0.0014271479,0.0005656038,0.00026203922],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009738841,0.00021930393,0.000245783,0.0002473347,0.0012187617,0.0014190667,0.0034667363,0.0000848073,0.0072093196],"category_scores_gemma":[0.00031612313,0.00022487597,0.00009597568,0.00097018667,0.00011836576,0.000597693,0.0037526726,0.00033840575,0.029299632],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005829249,0.0005747205,0.00013582573,0.00013795805,0.00009625506,0.00012175885,0.0039761406,0.0014208351,0.0028595226,0.048679087,0.07812319,0.86381644],"study_design_scores_gemma":[0.00073449255,0.0004361685,0.0033355567,0.000019067355,0.000008115619,0.0004515747,0.00009939224,0.033211242,0.000642224,0.0023113096,0.95832026,0.00043057764],"about_ca_topic_score_codex":0.000027490029,"about_ca_topic_score_gemma":3.0428689e-7,"teacher_disagreement_score":0.8801971,"about_ca_system_score_codex":0.00021005956,"about_ca_system_score_gemma":0.000010368074,"threshold_uncertainty_score":0.9996176},"labels":[],"label_agreement":null},{"id":"W6931559671","doi":"10.5281/zenodo.5696399","title":"Philetus Melander","year":2016,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Simple eye in invertebrates; Seta; Bristle; Genus; Lobe","score_opus":0.03602937470028306,"score_gpt":0.23522817905677046,"score_spread":0.1991988043564874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931559671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062403767,0.00006765555,0.89916795,0.0060534743,0.0003301709,0.00037205938,0.00004200168,0.0024613722,0.08526494],"genre_scores_gemma":[0.9899758,0.000047227342,0.0070484667,0.00034934317,0.00030014318,5.0140518e-8,0.0000638674,0.0007960025,0.0014191049],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796057,0.00032587047,0.00023040539,0.0006031757,0.0004438071,0.00043615027],"domain_scores_gemma":[0.9982372,0.000067290544,0.0000769413,0.00093928294,0.00047078865,0.00020848156],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00073646806,0.00014432384,0.00013875538,0.0001805677,0.0011460375,0.0007636937,0.0024737434,0.000055746186,0.005758625],"category_scores_gemma":[0.0005125276,0.000111019704,0.000061099454,0.00057727046,0.00015098076,0.00053363346,0.0028863333,0.00014104247,0.012790638],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013084576,0.00015333749,0.000013756643,0.000016502581,0.000026774946,0.000024133353,0.0006116501,0.000016772206,0.0038412157,0.045487363,0.08660111,0.8631943],"study_design_scores_gemma":[0.0005656823,0.0001834058,0.0017322048,0.000017552742,0.0000036619513,0.00015633606,0.000019898142,0.0018670995,0.00074312155,0.005758615,0.9887259,0.0002265482],"about_ca_topic_score_codex":0.00000579277,"about_ca_topic_score_gemma":1.5742074e-7,"teacher_disagreement_score":0.98373544,"about_ca_system_score_codex":0.00016347806,"about_ca_system_score_gemma":0.000004764969,"threshold_uncertainty_score":0.99515027},"labels":[],"label_agreement":null},{"id":"W6931739734","doi":"10.5281/zenodo.7003356","title":"Copelatus glyphicus NA","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Laurentian University","funders":"","keywords":"Instar; Ephemeral key; Head (geology); Margin (machine learning); Dorsum","score_opus":0.031492937767468226,"score_gpt":0.23182915052247458,"score_spread":0.20033621275500635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931739734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04172522,0.00049179664,0.65515506,0.006979339,0.0017903411,0.0018059753,0.00033135607,0.008493483,0.28322744],"genre_scores_gemma":[0.99155104,0.00001322192,0.0056003025,0.00049368036,0.00014662513,1.5042372e-7,0.0003122578,0.00082359434,0.0010591187],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970892,0.000709392,0.0002731324,0.0006947602,0.0007476397,0.00048586333],"domain_scores_gemma":[0.99824446,0.000049771275,0.00010514191,0.0010286532,0.00036537918,0.0002065792],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012025303,0.00015574734,0.00015924675,0.00024898036,0.0040566702,0.0010391779,0.0037322715,0.00003586599,0.011501021],"category_scores_gemma":[0.0003233719,0.00017612304,0.00007448054,0.0013538215,0.0001188459,0.00038121638,0.00934845,0.00048496606,0.0046440177],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044578825,0.00057297706,0.000015399028,0.000041105784,0.000053606956,0.00012873362,0.003283407,0.0026939458,0.0019083791,0.083537586,0.1799319,0.7277884],"study_design_scores_gemma":[0.00041293007,0.00035564968,0.00074265694,0.0000034272125,0.0000042574547,0.00036092763,0.0001321135,0.029483458,0.00011468337,0.0021773465,0.9659785,0.00023406312],"about_ca_topic_score_codex":0.000019664987,"about_ca_topic_score_gemma":1.214511e-7,"teacher_disagreement_score":0.9498258,"about_ca_system_score_codex":0.00035344,"about_ca_system_score_gemma":0.00000955208,"threshold_uncertainty_score":0.99999785},"labels":[],"label_agreement":null},{"id":"W6931784854","doi":"10.5284/1116274","title":"Archaeological monitoring at Blue House Barn, Sudbury Road, Downham, Essex, CM11 1LA.","year":2019,"lang":"en","type":"article","venue":"Archaeology Data Service","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Excavation; Natural (archaeology); Archaeological record; Archaeological evidence; Archaeological science","score_opus":0.03818199057091914,"score_gpt":0.27310135239272193,"score_spread":0.23491936182180279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931784854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9221544,0.00059066905,0.06469186,0.007656684,0.0026027567,0.00075507065,0.00008150384,0.0012611473,0.00020587014],"genre_scores_gemma":[0.89755356,0.00013763722,0.09934757,0.0018933698,0.0005072369,0.000053794043,0.00020717051,0.000065749264,0.00023392457],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99357796,0.00071082363,0.0007736705,0.002746163,0.00071565964,0.0014757001],"domain_scores_gemma":[0.99049985,0.0012067198,0.00026524352,0.0073094284,0.00027934808,0.00043942206],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015289834,0.0006132364,0.0008182941,0.0002695084,0.0002609638,0.00007199828,0.01089337,0.00042594224,0.00026936343],"category_scores_gemma":[0.0002230442,0.0005675926,0.00011687848,0.001065005,0.0006046366,0.0013488727,0.03980011,0.000896106,0.0027983102],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003481409,0.0010666284,0.84569687,0.0005712502,0.00047203235,0.0013291817,0.026908511,0.006252429,0.00804895,0.017360669,0.0016434662,0.090301886],"study_design_scores_gemma":[0.0031384525,0.00090956275,0.6031488,0.000108270135,0.000080284815,0.0016107076,0.00050793274,0.3116401,0.0031198105,0.020741846,0.052632935,0.0023612618],"about_ca_topic_score_codex":0.0021156468,"about_ca_topic_score_gemma":0.0009166477,"teacher_disagreement_score":0.30538768,"about_ca_system_score_codex":0.00018695561,"about_ca_system_score_gemma":0.0001839228,"threshold_uncertainty_score":0.99967754},"labels":[],"label_agreement":null},{"id":"W6949149078","doi":"10.5281/zenodo.10791599","title":"Toronto Google Ads Experts – Eunorial Consulting","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Track (disk drive); The Internet","score_opus":0.031189589577349703,"score_gpt":0.26054171608818394,"score_spread":0.22935212651083423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949149078","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010809965,0.0017341832,0.05346675,0.00037099235,0.0021544523,0.00065688766,0.0001593871,0.0058044866,0.93564206],"genre_scores_gemma":[0.0069316574,0.0006629295,0.03763063,0.00059818465,0.00873327,6.589609e-7,0.0019272735,0.03453255,0.9089829],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99670374,0.00043181286,0.0003773608,0.0012140684,0.0006828926,0.0005901348],"domain_scores_gemma":[0.9978338,0.000042204974,0.00018022995,0.0013559781,0.00032683392,0.00026098097],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00072445004,0.00036200808,0.00034244882,0.00025965308,0.0007094312,0.0022539983,0.003318752,0.00023047415,0.029693771],"category_scores_gemma":[0.00050624396,0.00037240545,0.00012374217,0.00055075064,0.00017325567,0.00030627867,0.005466551,0.00035705464,0.02148377],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005895965,0.00008091576,1.4856944e-7,0.00012540056,0.000054524135,0.000040707608,0.0010379334,0.0000032988996,0.000119229066,0.007674982,0.88070077,0.11015618],"study_design_scores_gemma":[0.00031864495,0.00014226398,0.0000042202223,0.00012515648,0.00001333304,0.00010792464,0.000114431685,0.002278151,0.000032751876,0.00052060524,0.9959441,0.00039842818],"about_ca_topic_score_codex":0.00027639672,"about_ca_topic_score_gemma":0.00000973713,"teacher_disagreement_score":0.11524331,"about_ca_system_score_codex":0.00047095888,"about_ca_system_score_gemma":0.000013578948,"threshold_uncertainty_score":0.9998728},"labels":[],"label_agreement":null},{"id":"W6949183986","doi":"10.5281/zenodo.12477545","title":"la leyenda del bosque pdf","year":2024,"lang":"es","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Amazon rainforest; Economic shortage; Statistical analysis","score_opus":0.03120954266980967,"score_gpt":0.2561384835968229,"score_spread":0.22492894092701324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949183986","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015936038,0.0009384869,0.07832173,0.0012780167,0.001070029,0.0008970222,0.00030983644,0.0027112067,0.9143143],"genre_scores_gemma":[0.048828777,0.0013995455,0.015006007,0.0008314227,0.003782426,4.4982096e-7,0.0020815504,0.028698936,0.8993709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936844,0.0015857078,0.00066152116,0.0019921125,0.0011096157,0.0009666493],"domain_scores_gemma":[0.99639595,0.00011833168,0.00028739887,0.0019645074,0.0007489015,0.00048491175],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0020334157,0.0006480551,0.0005608442,0.00089014653,0.0014698359,0.0061463565,0.0054658065,0.00046300123,0.12063],"category_scores_gemma":[0.0008453438,0.0006818919,0.00026888802,0.0017889976,0.00062210555,0.00040173027,0.0096916575,0.0014483047,0.41909444],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015115213,0.00026369517,0.0000013450891,0.00049819157,0.00014799056,0.00020985906,0.0012645262,0.00005632609,0.0001493008,0.02463629,0.70148826,0.27126908],"study_design_scores_gemma":[0.00037147047,0.00028903634,0.00015183998,0.00032827424,0.000048953905,0.00052671734,0.000100079706,0.007703643,0.000047895435,0.0025133672,0.9872388,0.00067989214],"about_ca_topic_score_codex":0.00007629679,"about_ca_topic_score_gemma":0.0000013802472,"teacher_disagreement_score":0.29846442,"about_ca_system_score_codex":0.0005406038,"about_ca_system_score_gemma":0.00003190617,"threshold_uncertainty_score":0.9999151},"labels":[],"label_agreement":null},{"id":"W6949436466","doi":"10.5281/zenodo.15623166","title":"igfuw/libmpdataxx: ICMW2024 mixed-phase Pi chamber","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Semtech (Canada)","funders":"","keywords":"Cloud computing; Code (set theory); Numerical modeling; Standard Model (mathematical formulation); Lagrangian","score_opus":0.0298319750916647,"score_gpt":0.2712102054815349,"score_spread":0.24137823038987022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949436466","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013362245,0.00036735865,0.2552321,0.00095644157,0.0008886996,0.0007536807,0.00064438116,0.0041013127,0.73704267],"genre_scores_gemma":[0.002866408,0.00053866376,0.026555635,0.0010269012,0.0018483482,5.1170053e-7,0.005667172,0.015036015,0.94646037],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958735,0.000659819,0.00046252832,0.0014740833,0.00079998793,0.00073007884],"domain_scores_gemma":[0.9964807,0.00006308653,0.0002605004,0.0023687733,0.0005048416,0.00032211418],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00090789376,0.00046662422,0.00045995662,0.000860278,0.001107421,0.0019541685,0.0044000964,0.00028133122,0.03230591],"category_scores_gemma":[0.0006244435,0.0004943794,0.0001564504,0.0014957874,0.0002529629,0.00031456575,0.008286997,0.00068294164,0.025118923],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008290297,0.00026466628,2.3375785e-7,0.000119508375,0.00006822409,0.000063792264,0.0001505212,0.000009134363,0.000030659266,0.01698657,0.7879712,0.19432724],"study_design_scores_gemma":[0.0007257924,0.00019512202,0.000024251942,0.00011792105,0.000021510206,0.000105576786,0.000024784742,0.0036865473,0.00004922754,0.0009821263,0.99359703,0.00047008484],"about_ca_topic_score_codex":0.00008382201,"about_ca_topic_score_gemma":0.000002737899,"teacher_disagreement_score":0.22867645,"about_ca_system_score_codex":0.0002585518,"about_ca_system_score_gemma":0.000030665688,"threshold_uncertainty_score":0.9997508},"labels":[],"label_agreement":null},{"id":"W6949461027","doi":"10.5281/zenodo.15272620","title":"Artifact: Symbolic Reduction for Formal Synthesis of Global Lyapunov Functions","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reduction (mathematics); Artifact (error); Lyapunov function; Core (optical fiber); Lyapunov equation; Sequence (biology); Formal verification; Lyapunov optimization; Algebra over a field","score_opus":0.02259161177934815,"score_gpt":0.24472015278803452,"score_spread":0.22212854100868637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949461027","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035451376,0.00010607165,0.54149175,0.00038751267,0.0005981131,0.0008484682,0.0007464267,0.0015260678,0.45426014],"genre_scores_gemma":[0.21708415,0.00064978126,0.1423738,0.00046165515,0.005094241,0.000008164,0.0047514606,0.021355538,0.60822123],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976142,0.00027884045,0.00041804876,0.0007668955,0.00043189968,0.0004901089],"domain_scores_gemma":[0.99780536,0.00008188818,0.00029446135,0.0010952514,0.00057974114,0.0001432937],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006918295,0.0002704359,0.00036494748,0.00038140515,0.00093080493,0.00049757626,0.0020867414,0.00020110948,0.0052059633],"category_scores_gemma":[0.0008450134,0.00029213022,0.00017689679,0.0009868202,0.00018429564,0.00028784954,0.002196784,0.00020748263,0.0015650628],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020425954,0.00023739881,0.0000022914933,0.0002591916,0.0001145847,0.0000013727843,0.00011911074,0.0000731496,0.00008382386,0.03061884,0.5658899,0.4025799],"study_design_scores_gemma":[0.00022143743,0.00017547498,0.00027876423,0.00014308612,0.00004898095,0.000057899553,0.000064802094,0.002964495,0.00013115721,0.0012252514,0.99439955,0.00028913244],"about_ca_topic_score_codex":0.000073742965,"about_ca_topic_score_gemma":0.0000016243281,"teacher_disagreement_score":0.42850962,"about_ca_system_score_codex":0.00031076712,"about_ca_system_score_gemma":0.00003171288,"threshold_uncertainty_score":0.9999531},"labels":[],"label_agreement":null},{"id":"W6949518521","doi":"10.5281/zenodo.4025322","title":"HD Mulan Film Streaming Français","year":2020,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Passer; Reel; Yiddish","score_opus":0.04306278933780278,"score_gpt":0.23723689188474795,"score_spread":0.19417410254694517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949518521","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003074357,0.00080738706,0.2680707,0.003390756,0.0010746788,0.0011711981,0.00047163366,0.0027639633,0.72194225],"genre_scores_gemma":[0.23847064,0.0016239999,0.13268879,0.005289269,0.013301683,8.397294e-7,0.010469892,0.0592031,0.53895175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99421245,0.0011536374,0.00069216685,0.0018345957,0.0010754552,0.0010316907],"domain_scores_gemma":[0.9963518,0.00013180838,0.00036849396,0.0017016516,0.0007489746,0.0006972978],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0008686318,0.0006311465,0.00063762633,0.0004525602,0.0025343788,0.0032375464,0.005426947,0.00034843702,0.15898487],"category_scores_gemma":[0.0014894218,0.00071565376,0.0002409148,0.0016747604,0.000514129,0.00046361182,0.008262568,0.0011030451,0.0774814],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022046299,0.00034903747,0.000010408779,0.00040135838,0.0001468541,0.00019592694,0.006513001,0.00046773072,0.0003876576,0.017476525,0.25786188,0.71616757],"study_design_scores_gemma":[0.0005553471,0.00042684132,0.0012515197,0.00017698576,0.00003562015,0.00019316249,0.00014241788,0.060165275,0.00007436692,0.0004909522,0.93582845,0.00065909326],"about_ca_topic_score_codex":0.000219867,"about_ca_topic_score_gemma":0.0000053409235,"teacher_disagreement_score":0.71550846,"about_ca_system_score_codex":0.00039001802,"about_ca_system_score_gemma":0.000024692874,"threshold_uncertainty_score":0.99995416},"labels":[],"label_agreement":null},{"id":"W6949518751","doi":"10.5281/zenodo.1467808","title":"The Outcomes Of The Community Cooking Workshops For International Students At Simon Fraser University","year":2018,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nutrition Education; International education; Program evaluation; Higher education; Study abroad; Community health","score_opus":0.038425725993422276,"score_gpt":0.2697995199847431,"score_spread":0.23137379399132083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949518751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68511504,0.000026099035,0.2790765,0.0054274695,0.001825529,0.0014544127,0.00016503719,0.00077967934,0.026130222],"genre_scores_gemma":[0.9976456,0.00000841293,0.0009204488,0.00012758776,0.00007673698,2.0196662e-8,0.00003397197,0.00013346289,0.0010537232],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982716,0.0006231663,0.00018272283,0.00022634352,0.00047660663,0.00021960586],"domain_scores_gemma":[0.99762577,0.00026664147,0.00014509016,0.0008743971,0.0010279798,0.00006014508],"candidate_categories":["sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013590847,0.00009329368,0.000099164354,0.0000647928,0.0046275873,0.00047147894,0.00586275,0.000037539907,0.0002852365],"category_scores_gemma":[0.0010322665,0.000068309,0.00007512246,0.0004226631,0.00038722725,0.00021894687,0.00870825,0.00022103693,0.00019384359],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047118583,0.0018046927,0.02176288,0.00008357465,0.0007710877,0.00000769909,0.014465359,0.00070299004,0.0009531184,0.061998338,0.28321928,0.6137598],"study_design_scores_gemma":[0.0007435096,0.00016977268,0.07318259,0.000016220558,0.000011150871,0.0000026202158,0.0007465354,0.010120838,0.00051809807,0.0012750432,0.9130743,0.00013932641],"about_ca_topic_score_codex":0.00002547697,"about_ca_topic_score_gemma":0.000019442023,"teacher_disagreement_score":0.62985504,"about_ca_system_score_codex":0.00024330197,"about_ca_system_score_gemma":0.000004915299,"threshold_uncertainty_score":0.999516},"labels":[],"label_agreement":null},{"id":"W6949573180","doi":"10.5281/zenodo.15490267","title":"Red Mercury Price","year":2025,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mercury (programming language); Bottle; Red mud; Liquid liquid; Red meat","score_opus":0.02686380525080776,"score_gpt":0.2539831923012131,"score_spread":0.22711938705040532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949573180","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005711652,0.00021480797,0.09375416,0.0025625469,0.0011278873,0.0010835642,0.8664899,0.002414666,0.032346785],"genre_scores_gemma":[0.000052098898,0.00022750518,0.004101824,0.00042383283,0.00034368393,1.0607388e-7,0.9933349,0.0005020043,0.0010140294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957427,0.00085089076,0.000532019,0.0013358202,0.00085953425,0.0006790307],"domain_scores_gemma":[0.9955716,0.000115346804,0.00026324636,0.0027866838,0.0009846898,0.00027844086],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0012980251,0.0003884567,0.00041169103,0.00063385465,0.0020569786,0.0022818882,0.008257982,0.0002579772,0.005430187],"category_scores_gemma":[0.0015562192,0.0004204448,0.0001441557,0.001821634,0.00018616424,0.00043289032,0.011777943,0.0009086472,0.004010526],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000942604,0.00017869897,5.6695566e-8,0.00016755491,0.000047892652,0.000038881186,0.00009050502,0.000032798343,0.000021517139,0.0010722696,0.9508457,0.04749466],"study_design_scores_gemma":[0.00028417105,0.00016259088,0.000031472613,0.00006419013,0.000020908885,0.00010134906,0.000012918444,0.001567475,0.000020724237,0.000565754,0.9967741,0.00039438735],"about_ca_topic_score_codex":0.000046328823,"about_ca_topic_score_gemma":6.037819e-7,"teacher_disagreement_score":0.12684505,"about_ca_system_score_codex":0.00041554368,"about_ca_system_score_gemma":0.000030119014,"threshold_uncertainty_score":0.99982476},"labels":[],"label_agreement":null},{"id":"W6949586587","doi":"10.5281/zenodo.13393668","title":"Artificial Intelligence and How to Detect It in Students' Submissions","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Applications of artificial intelligence; Feature (linguistics); Key (lock); Artificial neural network; Field (mathematics)","score_opus":0.08512835829948126,"score_gpt":0.3040225263251852,"score_spread":0.21889416802570397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949586587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12803161,0.000038756025,0.840731,0.021415863,0.00034142597,0.0011635638,0.0000385068,0.0024791227,0.0057601193],"genre_scores_gemma":[0.99374807,0.000035033263,0.005265061,0.00019624479,0.00007914032,1.318279e-7,0.00003720209,0.00031403085,0.00032505993],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997976,0.00032049927,0.00020397748,0.0006000466,0.00048826804,0.00041117513],"domain_scores_gemma":[0.9988509,0.00008399287,0.000041863397,0.00055069604,0.00022744878,0.00024510417],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013584807,0.00012322952,0.00013277587,0.00046535252,0.00085670024,0.0015271838,0.0020816624,0.000044427317,0.0004494447],"category_scores_gemma":[0.0012678575,0.00012880635,0.000027823458,0.0022320012,0.00008104234,0.00028899108,0.0049931877,0.00021476489,0.0033879403],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016345755,0.00010542019,0.000044935357,0.000026209933,0.000010360032,0.00005954299,0.0037179415,0.00054294907,0.0017628671,0.008247402,0.02158286,0.96388316],"study_design_scores_gemma":[0.00029479846,0.00089321117,0.025402829,0.00009012082,0.000007765931,0.00014092376,0.0013760591,0.0812561,0.0025344521,0.019205227,0.86802816,0.0007703789],"about_ca_topic_score_codex":0.000011341223,"about_ca_topic_score_gemma":0.0000029315497,"teacher_disagreement_score":0.9631128,"about_ca_system_score_codex":0.00010913954,"about_ca_system_score_gemma":0.0000047916246,"threshold_uncertainty_score":0.99950933},"labels":[],"label_agreement":null},{"id":"W6949693624","doi":"10.5281/zenodo.15643878","title":"Data: Modulation of Histone Tail Electrostatic Potentials in Nucleosome Core Particles by Acetylation and PARylation","year":2025,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Histone; Acetylation; Nucleosome; Modulation (music); Core (optical fiber); Linker DNA","score_opus":0.045591050752581026,"score_gpt":0.30245993500429924,"score_spread":0.2568688842517182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949693624","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074013253,0.0006035913,0.115875274,0.0010028586,0.0002717402,0.0014935203,0.87259495,0.0004925626,0.00026415894],"genre_scores_gemma":[0.03256349,0.000298028,0.002194422,0.000054083168,0.000048054804,1.3318015e-7,0.9646329,0.00016293098,0.000045951216],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971365,0.0005016695,0.000626911,0.0008709013,0.0005285525,0.00033546405],"domain_scores_gemma":[0.99757224,0.00010352604,0.00038552188,0.0014273901,0.00041255736,0.00009873503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012049342,0.00022385434,0.00034144052,0.00044362876,0.0005442644,0.0005390286,0.0021137514,0.00014934523,0.00029101133],"category_scores_gemma":[0.00089111476,0.00025502683,0.000032591943,0.0010100382,0.0001584964,0.00079001166,0.003322379,0.00032826926,0.00006939697],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025067453,0.00021164016,0.000004793903,0.000203641,0.000027200964,0.000004094671,0.00018140332,0.00030678656,0.0025668873,0.0007461869,0.9453065,0.050415833],"study_design_scores_gemma":[0.00064070744,0.00021202788,0.0015642167,0.00009117965,0.000031523094,0.000019983787,0.00002856994,0.09890658,0.00013546382,0.0017094674,0.89635247,0.00030780377],"about_ca_topic_score_codex":0.000112131966,"about_ca_topic_score_gemma":0.0000068388977,"teacher_disagreement_score":0.113680854,"about_ca_system_score_codex":0.00022736359,"about_ca_system_score_gemma":0.000018258568,"threshold_uncertainty_score":0.9999902},"labels":[],"label_agreement":null},{"id":"W6949929648","doi":"10.5281/zenodo.3500447","title":"Podocinum pacificum Berlese 1895","year":2012,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Uttar pradesh; China; Fish <Actinopterygii>; Period (music)","score_opus":0.03936210849234578,"score_gpt":0.24592218262129223,"score_spread":0.20656007412894645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949929648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031347513,0.00047073327,0.67731905,0.0037444804,0.0014139651,0.0010730883,0.00010540027,0.0056894184,0.27883634],"genre_scores_gemma":[0.985452,0.000026922584,0.011707111,0.0002679457,0.0005031147,6.2652234e-8,0.00020934401,0.0008373136,0.0009961718],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972971,0.0004990107,0.00030162037,0.0005570915,0.00057019974,0.00077498774],"domain_scores_gemma":[0.99780244,0.000057239344,0.00010781625,0.0011245197,0.0004952565,0.00041271455],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001374447,0.00019840222,0.00018540806,0.00022552263,0.001679024,0.0011709388,0.0026124255,0.00007799367,0.0039231777],"category_scores_gemma":[0.0005167794,0.00020118039,0.000084429375,0.00097471185,0.00015741392,0.0010524172,0.0035959443,0.0003248556,0.014718872],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025674248,0.0008742139,0.00012869907,0.00007722611,0.00006459902,0.000027627624,0.0069843777,0.00009056268,0.002962916,0.10425999,0.23254952,0.6519546],"study_design_scores_gemma":[0.0003249812,0.00014464093,0.0039197975,0.000010141446,0.000006287991,0.00022296702,0.00016519614,0.0038635728,0.00049950625,0.0013414903,0.9892042,0.00029718762],"about_ca_topic_score_codex":0.000013214651,"about_ca_topic_score_gemma":1.3969297e-7,"teacher_disagreement_score":0.9541045,"about_ca_system_score_codex":0.00021571509,"about_ca_system_score_gemma":0.000005282355,"threshold_uncertainty_score":0.99986595},"labels":[],"label_agreement":null},{"id":"W6950310580","doi":"10.5281/zenodo.5687120","title":"Ephippiochthonius tetrachelatus Preyssler 1790, n. comb.","year":2017,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Carapace; Czech; Extant taxon; Femur; High resolution; Pathognomonic","score_opus":0.04971995254509561,"score_gpt":0.26621040065467805,"score_spread":0.21649044810958243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950310580","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03620064,0.00027206418,0.4619818,0.0065818545,0.0014187918,0.001419334,0.00011432216,0.004679232,0.48733196],"genre_scores_gemma":[0.9860813,0.00003329777,0.010975836,0.0001828684,0.00027701637,8.0261216e-8,0.00011491496,0.00079111586,0.001543586],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972189,0.0003682902,0.00032663145,0.0008460646,0.00062298094,0.00061712327],"domain_scores_gemma":[0.9961811,0.0000560508,0.0002306864,0.0025599324,0.0006603666,0.00031190578],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011911992,0.00022656207,0.00022683573,0.00019925667,0.0054921187,0.00444822,0.006310849,0.000106513944,0.0026004338],"category_scores_gemma":[0.0012746037,0.00023425787,0.0001000939,0.00034875335,0.00035433954,0.0010676323,0.00673118,0.000454797,0.008594112],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003311052,0.00057665736,0.0001177842,0.00008284456,0.00008561155,0.00010738666,0.0021109208,0.00020579676,0.0019809746,0.05303215,0.115720905,0.82594585],"study_design_scores_gemma":[0.0007827549,0.00028899292,0.023538982,0.000028252844,0.000011564689,0.0002549146,0.000047732472,0.015222697,0.00067808776,0.0061914693,0.95250857,0.00044596405],"about_ca_topic_score_codex":0.000028962824,"about_ca_topic_score_gemma":5.2628315e-7,"teacher_disagreement_score":0.94988066,"about_ca_system_score_codex":0.00017655439,"about_ca_system_score_gemma":0.000008981093,"threshold_uncertainty_score":0.99906546},"labels":[],"label_agreement":null},{"id":"W69562194","doi":"10.1007/978-1-4614-7717-4_4","title":"Arithmetic in $$\\mathbb{Q}[\\sqrt{D}]$$","year":2013,"lang":"en","type":"book-chapter","venue":"Universitext","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Arithmetic; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.012599628374409309,"score_gpt":0.17820563969063766,"score_spread":0.16560601131622835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69562194","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010004244,0.00044010463,0.07314679,0.00063302775,0.0007316211,0.00052177615,0.000010817817,0.0003251291,0.9240907],"genre_scores_gemma":[0.004708719,0.00014073412,0.04837358,0.000367982,0.00020776626,0.0000038619596,0.000021535612,0.00006538391,0.9461104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99752486,0.000046918638,0.0003702857,0.0010645645,0.0004983773,0.0004950222],"domain_scores_gemma":[0.99779,0.00021043596,0.00020667566,0.0014140286,0.00017120434,0.00020767059],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020732055,0.0004987892,0.00056867604,0.00080923317,0.00009761948,0.00017725091,0.002243677,0.00044532339,0.0017720207],"category_scores_gemma":[0.000018420309,0.00054430874,0.00023883201,0.00021490411,0.00016298443,0.00052600866,0.0015239688,0.0006795126,0.00422107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038423063,0.00009223808,0.000030437028,0.000051292955,0.000049538936,0.0005432166,0.00072847464,0.00024961637,0.0000052732917,0.8368437,0.0068148053,0.15458752],"study_design_scores_gemma":[0.000764974,0.00017841192,0.00035359184,0.00019353449,0.000033713273,0.000059591188,0.000034806566,0.041171443,0.00001022731,0.16354534,0.7924241,0.0012303129],"about_ca_topic_score_codex":0.00012244245,"about_ca_topic_score_gemma":0.00006243298,"teacher_disagreement_score":0.78560925,"about_ca_system_score_codex":0.00055418996,"about_ca_system_score_gemma":0.00018659171,"threshold_uncertainty_score":0.99970084},"labels":[],"label_agreement":null},{"id":"W6959232425","doi":"10.6084/m9.figshare.6199211","title":"Viitorul a început în trecut","year":2018,"lang":"ro","type":"article","venue":"Figshare","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Product (mathematics); Context (archaeology); Identification (biology)","score_opus":0.05138828752627546,"score_gpt":0.2820186541869926,"score_spread":0.23063036666071718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6959232425","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051233815,0.010335459,0.019412404,0.011225433,0.030879097,0.007128776,0.70905554,0.006766526,0.20007339],"genre_scores_gemma":[0.8472346,0.000028368406,0.050896287,0.0072102123,0.036863953,0.00084747607,0.03821607,0.0003803847,0.018322619],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951063,0.0002799903,0.0006652712,0.0017408185,0.0009371798,0.0012704786],"domain_scores_gemma":[0.9954462,0.0005459492,0.00032459802,0.0022780779,0.0008764753,0.0005286834],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025562977,0.0006306263,0.0005740018,0.00020894432,0.0005310974,0.0009723718,0.0035097264,0.0003877007,0.26563823],"category_scores_gemma":[0.00167373,0.0006352937,0.00034854436,0.0013808126,0.000111895206,0.0008007709,0.0029690466,0.000537284,0.061241716],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012445859,0.00027677827,0.00007905962,0.00018017806,0.000042747663,0.00011223223,0.0018227819,0.000022726366,0.000035721598,0.00017297998,0.816631,0.18061134],"study_design_scores_gemma":[0.00062842155,0.0009582108,0.006983177,0.0015496131,0.0000191511,0.000098223165,0.000043205855,0.16503929,0.0014639925,0.0014327122,0.8206781,0.0011058843],"about_ca_topic_score_codex":0.000054513257,"about_ca_topic_score_gemma":0.000069187794,"teacher_disagreement_score":0.84211123,"about_ca_system_score_codex":0.0002904509,"about_ca_system_score_gemma":0.0005816343,"threshold_uncertainty_score":0.9996098},"labels":[],"label_agreement":null},{"id":"W6963404441","doi":"10.18150/wsta4e","title":"Distributional semantics in the Corpus of Turing writing (generated sample)","year":2022,"lang":"en","type":"dataset","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Turing; Semantics (computer science); Set (abstract data type); Venn diagram; Prolog; Sketch; Metaphor; Negation","score_opus":0.026082050367676884,"score_gpt":0.26356774795704335,"score_spread":0.23748569758936647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6963404441","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044159533,0.000108880646,0.09613499,0.00049582013,0.0006226524,0.00030628016,0.9018117,0.000057079462,0.000020955937],"genre_scores_gemma":[0.0033598847,0.00003398897,0.012228303,0.00026045376,0.0001595173,0.000039249873,0.9839043,0.0000075872254,0.000006722392],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701834,0.0004209492,0.00068312517,0.0006096576,0.0008878741,0.00038005915],"domain_scores_gemma":[0.9968149,0.0015020457,0.00027536947,0.0012349847,0.00012730494,0.000045412045],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014675489,0.00026890615,0.00038872624,0.00016804857,0.00018310756,0.00018054542,0.003159628,0.0001190405,0.0011661933],"category_scores_gemma":[0.0003584506,0.00021017567,0.00012429168,0.0010455942,0.000087029206,0.00011975057,0.0020726733,0.0007010847,0.0000045805778],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035349103,0.00034409677,0.00035632233,0.0001243388,0.000026608617,0.000078510406,0.000073982395,0.0025099067,0.000008213594,0.0064375885,0.9879672,0.0020697087],"study_design_scores_gemma":[0.00050733745,0.0001766239,0.003348802,0.000052415544,0.000030375008,0.00015867616,0.00010047564,0.086510316,0.000094914176,0.0057100253,0.9025693,0.0007407317],"about_ca_topic_score_codex":0.0013606739,"about_ca_topic_score_gemma":0.0002929873,"teacher_disagreement_score":0.085397884,"about_ca_system_score_codex":0.00017454881,"about_ca_system_score_gemma":0.0002390776,"threshold_uncertainty_score":0.99974686},"labels":[],"label_agreement":null},{"id":"W6968916646","doi":"10.5281/zenodo.8164704","title":"HETP: An updated inorganic heterogeneous chemistry solver for metastable state based on ISORROPIA II","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Environment and Climate Change Canada","funders":"","keywords":"Metastability; Fortran; Solver; State (computer science); Computer program","score_opus":0.025895361712947908,"score_gpt":0.24527483769497332,"score_spread":0.21937947598202542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968916646","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006344419,0.0006045748,0.59619933,0.0012928019,0.0013842512,0.0035733508,0.0034703233,0.013710611,0.3791303],"genre_scores_gemma":[0.044034176,0.00013053507,0.049963582,0.0019921865,0.0020125655,0.0000028165719,0.021530807,0.047712706,0.8326206],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962079,0.0003235583,0.00042448204,0.0016058265,0.000679475,0.00075875834],"domain_scores_gemma":[0.99701947,0.000027360396,0.00022582176,0.0019294258,0.00044849486,0.00034943593],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000732006,0.00050405203,0.00044005955,0.0004195501,0.0013963609,0.0014492313,0.003473187,0.00021569189,0.023372134],"category_scores_gemma":[0.00016682588,0.0005176603,0.00016978031,0.0009271956,0.00015344976,0.00022271015,0.0039422493,0.0005244477,0.005552704],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052688796,0.0005617489,2.0049606e-7,0.0003914063,0.00016097752,0.000059825077,0.00050516886,0.0010967018,0.0018440223,0.00057122414,0.96293116,0.031824898],"study_design_scores_gemma":[0.00052700983,0.0005402492,0.0000016535762,0.00006243686,0.000032554664,0.000056536774,0.000010789717,0.06870981,0.0013814793,0.00059367524,0.9275737,0.00051009766],"about_ca_topic_score_codex":0.000033980108,"about_ca_topic_score_gemma":0.000002078391,"teacher_disagreement_score":0.54623574,"about_ca_system_score_codex":0.0003298963,"about_ca_system_score_gemma":0.000029552473,"threshold_uncertainty_score":0.9999037},"labels":[],"label_agreement":null},{"id":"W6969440833","doi":"10.5683/sp3/pu6duu","title":"Enquête sur la population active, octobre 2023 [Canada] [Remanié 2025]","year":2023,"lang":"fr","type":"dataset","venue":"Borealis","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Statistics Canada","funders":"","keywords":"Population; Research methodology; Publics; Social interest","score_opus":0.030071742015527918,"score_gpt":0.2665620214582259,"score_spread":0.23649027944269796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6969440833","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013002456,0.00042771772,0.0030230891,0.0031147955,0.004996986,0.0010882,0.9855355,0.00037111546,0.0013125836],"genre_scores_gemma":[0.000115063376,0.0003964736,0.0020041985,0.00059824,0.0015665104,0.00012636358,0.9910375,0.000106118874,0.0040495405],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920373,0.0010465492,0.0012502339,0.0022877238,0.0019966024,0.0013816046],"domain_scores_gemma":[0.9925479,0.0022103458,0.00075400225,0.00327901,0.0006268376,0.0005818575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011538981,0.0011099209,0.0012379731,0.00040744126,0.00047611183,0.0008053452,0.0035553959,0.0008659296,0.00015499949],"category_scores_gemma":[0.0011744224,0.0012205732,0.00039773536,0.0018090811,0.00023664958,0.0008598304,0.002520424,0.0012820457,0.000633969],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020478237,0.0001865552,0.00020823271,0.00029820896,0.00014429024,0.00080356037,0.00008136922,0.00079399353,0.0000016541202,0.0015697723,0.95097125,0.044920646],"study_design_scores_gemma":[0.0004064734,0.000114008064,0.089254186,0.0002380523,0.000110915644,0.00008748524,0.000025854682,0.024160264,0.00000941015,0.0020594734,0.8824566,0.001077263],"about_ca_topic_score_codex":0.99003565,"about_ca_topic_score_gemma":0.9923182,"teacher_disagreement_score":0.08904595,"about_ca_system_score_codex":0.0014193668,"about_ca_system_score_gemma":0.0020468286,"threshold_uncertainty_score":0.9990244},"labels":[],"label_agreement":null},{"id":"W6976749731","doi":"10.60692/9yn50-tbd11","title":"Additional file 3 of Conservatively transmitted alleles of key agronomic genes provide insights into the genetic basis of founder parents in bread wheat (Triticum aestivum L.)","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Jewish General Hospital","funders":"","keywords":"Allele; Key (lock); Table (database); Gene; Genetic variation; Genotype","score_opus":0.02880368716891969,"score_gpt":0.20614562567973757,"score_spread":0.1773419385108179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976749731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8813206,0.000017487058,0.09842465,0.00015821749,0.00021711923,0.0011534796,0.018263437,0.00017307009,0.00027193312],"genre_scores_gemma":[0.99055076,4.9129267e-7,0.008283801,0.000033528882,0.000018627006,0.0003016532,0.0007868286,0.0000068241916,0.00001749287],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99770373,0.00022086571,0.001183179,0.00022358578,0.0004510905,0.00021755927],"domain_scores_gemma":[0.9980337,0.00045022505,0.00055561174,0.00048024696,0.00042875914,0.000051478302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023868812,0.00019309697,0.0003959098,0.00043404114,0.00007115548,0.000044388442,0.00067539583,0.00008770924,0.0007181721],"category_scores_gemma":[0.00009298409,0.00014500636,0.00011508132,0.0008737864,0.00016165937,0.00063743175,0.0001912592,0.00007689479,0.000074921154],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026260028,0.00017430467,0.14846368,0.007070441,0.0005755636,0.000018920797,0.7438044,0.021592328,0.00009789354,0.0020954332,0.039804377,0.036040056],"study_design_scores_gemma":[0.00086701446,0.00012672038,0.76839393,0.00059665204,0.000013507673,0.000013453376,0.006090042,0.22162294,0.0009758669,0.00014625232,0.0009112773,0.00024236842],"about_ca_topic_score_codex":0.00013336058,"about_ca_topic_score_gemma":0.000017658347,"teacher_disagreement_score":0.73771435,"about_ca_system_score_codex":0.000101181904,"about_ca_system_score_gemma":0.00020849817,"threshold_uncertainty_score":0.7863481},"labels":[],"label_agreement":null},{"id":"W6976946405","doi":"10.60692/2k5e9-2b950","title":"Gender and contextual variations in self-perceived cognitive competence","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"","keywords":"Competence (human resources); Cognition; Association (psychology); Social competence; Social cognitive theory","score_opus":0.03605258800584023,"score_gpt":0.21627083065969524,"score_spread":0.180218242653855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976946405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4241499,0.000005059822,0.5717985,0.000053592816,0.0004456224,0.0006405916,0.00008034465,0.0004172528,0.0024091175],"genre_scores_gemma":[0.99350905,6.690769e-8,0.006006926,0.00027517483,0.000021302129,0.00016270175,0.000010619815,0.000004472524,0.000009691421],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9982135,0.00028542738,0.00055072823,0.00027629547,0.00041456005,0.00025943795],"domain_scores_gemma":[0.999146,0.00006400874,0.00020474827,0.000322938,0.00017775502,0.00008454235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611477,0.00016085473,0.00022160517,0.00032691096,0.00033058523,0.0002654678,0.0004328162,0.000042904812,0.00002137369],"category_scores_gemma":[0.00002796332,0.00015872515,0.000040130857,0.0005397234,0.000031295425,0.0010930998,0.0006206187,0.00018485605,0.00008863318],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030940122,0.00002988751,0.22816461,0.00019467426,0.000065032014,0.000022784747,0.7426826,0.001732193,0.0000021470166,0.024457797,0.00002874017,0.002588599],"study_design_scores_gemma":[0.0012644149,0.0000749394,0.5349729,0.000019393592,0.000008789847,0.00014528647,0.02403433,0.43914402,0.000006142349,0.00003731896,0.000058203055,0.00023422968],"about_ca_topic_score_codex":0.000020597165,"about_ca_topic_score_gemma":4.5737124e-7,"teacher_disagreement_score":0.71864825,"about_ca_system_score_codex":0.00024277855,"about_ca_system_score_gemma":0.00009987312,"threshold_uncertainty_score":0.6472624},"labels":[],"label_agreement":null},{"id":"W6977394838","doi":"10.6084/m9.figshare.17162766","title":"Additional file 3 of Soluble amyloid-beta isoforms predict downstream Alzheimer’s disease pathology","year":2021,"lang":"en","type":"article","venue":"Figshare","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Cerebrospinal fluid; Gene isoform; Disease; Downstream (manufacturing); Immunohistochemistry; Cerebrospinal fluid proteins","score_opus":0.030663603256300218,"score_gpt":0.23684381573875485,"score_spread":0.20618021248245463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977394838","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011112078,0.00025284427,0.0002218591,0.00021760074,0.0001507257,0.00017662333,0.99540955,0.00020496425,0.0033547208],"genre_scores_gemma":[0.0015113599,0.0000013319842,0.015801495,0.00030073617,0.0002112548,0.0006899289,0.980819,0.00001623293,0.0006486858],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803805,0.00008844581,0.00034331,0.0006854807,0.0004328466,0.0004118778],"domain_scores_gemma":[0.9968405,0.0012689409,0.00017722658,0.001018296,0.0004281213,0.00026694196],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0000423114,0.00021293323,0.00027403721,0.000077132536,0.00011632527,0.000091616435,0.00097218115,0.000104471066,0.9780612],"category_scores_gemma":[0.0017803317,0.00020254601,0.00021371862,0.0004754424,0.000035342036,0.00041538037,0.0012695981,0.00018389669,0.002428477],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026632313,0.00017422716,0.000012204171,0.000040315554,0.000023102688,0.00018881785,0.000033364075,0.00006897714,0.0000026421274,0.00007275783,0.9840998,0.015281148],"study_design_scores_gemma":[0.00028582333,0.00011430377,0.022889765,0.00061574404,0.000016558139,0.000111092195,0.000013827435,0.02963178,0.00036585648,0.0021146273,0.943448,0.00039259612],"about_ca_topic_score_codex":0.0000025184272,"about_ca_topic_score_gemma":0.0000094547695,"teacher_disagreement_score":0.9756327,"about_ca_system_score_codex":0.000038398153,"about_ca_system_score_gemma":0.0006894849,"threshold_uncertainty_score":0.99834824},"labels":[],"label_agreement":null},{"id":"W6977488372","doi":"10.6084/m9.figshare.c.7932657.v1","title":"Artificial intelligence for diagnosing rare bone diseases: a global survey of healthcare professionals","year":2025,"lang":"en","type":"other","venue":"Figshare","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Health care; Medical imaging; Health professionals; Process (computing); Survey data collection; MEDLINE; Healthcare system; Teleradiology","score_opus":0.08651197768518548,"score_gpt":0.3703084122488927,"score_spread":0.28379643456370723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977488372","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010740492,0.007210885,0.045348898,0.00086287,0.0011036199,0.0026327847,0.939042,0.0005097729,0.003288115],"genre_scores_gemma":[0.019872116,0.000102106256,0.11463301,0.0035549656,0.0037029607,0.008321118,0.7938735,0.0010628499,0.0548774],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969809,0.00034628384,0.0006689868,0.0010194262,0.00050393736,0.00048046943],"domain_scores_gemma":[0.9960567,0.001453696,0.0005415004,0.0010992483,0.0006598691,0.00018900212],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022243932,0.0004063701,0.00073797116,0.00018604287,0.00010570628,0.00012462288,0.0016879934,0.00037405253,0.012583767],"category_scores_gemma":[0.004881242,0.00039169056,0.00023911726,0.000951537,0.000024789786,0.00010678418,0.001231177,0.00020773952,0.00013879569],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012716731,0.000245667,0.00018936301,0.0022572272,0.000031402757,0.000012111352,0.000037290043,0.000016565506,5.9211594e-8,0.00088484766,0.87080437,0.12550835],"study_design_scores_gemma":[0.0009992039,0.001490232,0.06340587,0.13816021,0.00018012151,0.00003522611,0.00019511282,0.09854041,0.00040436164,0.086590655,0.6030613,0.006937271],"about_ca_topic_score_codex":0.0007523488,"about_ca_topic_score_gemma":0.0012646925,"teacher_disagreement_score":0.26774308,"about_ca_system_score_codex":0.00017465123,"about_ca_system_score_gemma":0.0014846774,"threshold_uncertainty_score":0.9998535},"labels":[],"label_agreement":null},{"id":"W6980280078","doi":"","title":"+91-9829791419^% Black Magic To Kill Enemy In Mangalore, Hubli","year":2021,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mantra; MAGIC (telescope); Spell; Unicorn; nobody","score_opus":0.017630685517248234,"score_gpt":0.26080827418139885,"score_spread":0.24317758866415062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980280078","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007899985,0.000020380987,0.075660035,0.00083352893,0.001632339,0.0021351257,0.000026578251,0.0007555585,0.91814643],"genre_scores_gemma":[0.0019517442,0.00014659132,0.06315172,0.0007488102,0.0004147867,0.00023655505,0.000050739487,0.0004109708,0.9328881],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98740876,0.0014153096,0.001276421,0.00723676,0.001269215,0.0013935093],"domain_scores_gemma":[0.9853981,0.0006191429,0.0005358963,0.012469887,0.0002596166,0.0007173637],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0046684397,0.0011277448,0.0014769705,0.0012796804,0.00009952536,0.00066233915,0.007572081,0.0009222108,0.4909727],"category_scores_gemma":[0.0021882993,0.0013136398,0.0005289104,0.0018903248,0.00029164716,0.00031048228,0.013358218,0.0014129133,0.69865507],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054227738,0.002263283,0.012487463,0.0010416615,0.0004534876,0.0011482518,0.004592958,0.0047424682,0.00059904164,0.013273694,0.8462108,0.11313268],"study_design_scores_gemma":[0.00094721525,0.000004709595,0.010755167,0.0006764214,0.000039775776,0.00009344108,0.00008620648,0.0073907706,0.0007146418,0.008728906,0.9687327,0.0018300083],"about_ca_topic_score_codex":0.0017341095,"about_ca_topic_score_gemma":0.0016704206,"teacher_disagreement_score":0.20768234,"about_ca_system_score_codex":0.00087268057,"about_ca_system_score_gemma":0.0005937632,"threshold_uncertainty_score":0.99893135},"labels":[],"label_agreement":null},{"id":"W6986661862","doi":"","title":"Producción de chicha de maíz en la Huaca San Marcos","year":2015,"lang":"es","type":"dissertation","venue":"renati","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Exhibition; Quarter (Canadian coin); Butcher","score_opus":0.014738510066188232,"score_gpt":0.3020577489546502,"score_spread":0.287319238888462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986661862","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6608559,0.008430421,0.20166045,0.005238384,0.009716664,0.0057991617,0.0002289326,0.0024257929,0.10564428],"genre_scores_gemma":[0.8923516,0.00034174082,0.09852139,0.00027268947,0.0022427333,0.00024991354,0.00041447274,0.00015729618,0.0054481113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939944,0.0013261047,0.0007615708,0.001646415,0.0011818014,0.001089722],"domain_scores_gemma":[0.99591976,0.00069762487,0.00048373282,0.0016754442,0.0007144995,0.00050891755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032792166,0.0007539431,0.0007818437,0.0004397852,0.0002450747,0.00063536095,0.0027627207,0.00078999496,0.00009117214],"category_scores_gemma":[0.0014459435,0.0007648286,0.0002711419,0.0010085313,0.0001291363,0.0003823457,0.0004904416,0.0011629188,0.00015371286],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009058253,0.0010306394,0.0075889514,0.0014258153,0.00024255516,0.00029719027,0.028514126,0.0014478975,0.001204389,0.014732106,0.011286236,0.9321395],"study_design_scores_gemma":[0.0020884376,0.0010290515,0.36683556,0.0015029283,0.00030582462,0.0006626397,0.0010092813,0.45581117,0.0059835864,0.11215534,0.048954647,0.0036615382],"about_ca_topic_score_codex":0.0006336213,"about_ca_topic_score_gemma":0.00030296494,"teacher_disagreement_score":0.928478,"about_ca_system_score_codex":0.00087273784,"about_ca_system_score_gemma":0.0025006384,"threshold_uncertainty_score":0.99948025},"labels":[],"label_agreement":null},{"id":"W7010900882","doi":"","title":"La comédienne de théâtre à Montréal, 1840-1876: activités et représentations","year":2013,"lang":"fr","type":"other","venue":"uO Research (University of Ottawa)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Context (archaeology); Identification (biology); Work (physics)","score_opus":0.07368571193269494,"score_gpt":0.3462557178810725,"score_spread":0.27257000594837755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010900882","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013367535,0.00044277645,0.21544804,0.034900833,0.00056827953,0.0016044166,0.00013799063,0.00027449292,0.7332556],"genre_scores_gemma":[0.029052613,0.0011071839,0.091449305,0.00016162396,0.00024160475,0.000007702471,0.000043745407,0.00014702116,0.8777892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99174464,0.0036151006,0.000326579,0.0014335706,0.0015218543,0.0013582496],"domain_scores_gemma":[0.9930383,0.0027557772,0.00035701157,0.0020864392,0.0010750055,0.0006874818],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0030828754,0.00047097664,0.000776017,0.0012503914,0.0007664988,0.000335766,0.0036317569,0.0007200262,0.0074694036],"category_scores_gemma":[0.0006222104,0.0005854868,0.00040396635,0.0019067301,0.002075994,0.00097291206,0.003185054,0.0020650704,0.0015883326],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119738725,0.0016775879,0.0068620774,0.00043654008,0.00038073203,0.00092696707,0.008403919,0.00076411903,0.00046970672,0.5615713,0.26769203,0.15080306],"study_design_scores_gemma":[0.0009941831,0.000420581,0.06879285,0.00024247322,0.0000469005,0.00009680862,0.0032735588,0.08202786,0.000052853804,0.0056423373,0.83782595,0.0005836108],"about_ca_topic_score_codex":0.019326407,"about_ca_topic_score_gemma":0.015964964,"teacher_disagreement_score":0.570134,"about_ca_system_score_codex":0.0008098818,"about_ca_system_score_gemma":0.0014138059,"threshold_uncertainty_score":0.99965966},"labels":[],"label_agreement":null},{"id":"W7011143923","doi":"","title":"La sublimació i el procés d'individualització de la dona a la novel·la europea del segle XIX","year":2009,"lang":"ca","type":"dissertation","venue":"RECERCAT (Consorci de Serveis Universitaris de Catalunya)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Period (music); Time line; Quarter (Canadian coin); Context (archaeology)","score_opus":0.013986803707796371,"score_gpt":0.2782409106925512,"score_spread":0.2642541069847548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011143923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7015824,0.003939013,0.13721009,0.0027247788,0.0014740684,0.0034546482,0.0012314412,0.0022164236,0.14616717],"genre_scores_gemma":[0.890753,0.0023669102,0.092598505,0.000953283,0.00060209405,0.00007806794,0.002899131,0.00049623515,0.009252787],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9844294,0.0060202754,0.0015258748,0.0035610097,0.0016877125,0.0027756856],"domain_scores_gemma":[0.98785925,0.0050553204,0.0012542428,0.0029337616,0.0012952862,0.001602164],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0069128224,0.0021488387,0.0018986668,0.0020911354,0.0011686649,0.0021425614,0.0066378596,0.0030552896,0.00022340468],"category_scores_gemma":[0.0013395309,0.0026522784,0.0012453125,0.004270815,0.0010451373,0.0019956187,0.0018094889,0.004274316,0.00030481632],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.0028571167,0.015141925,0.05752706,0.0074866014,0.005369768,0.016235884,0.16208586,0.02656372,0.012082598,0.1468658,0.025172165,0.5226115],"study_design_scores_gemma":[0.01392721,0.0020502505,0.324822,0.0032003631,0.003951412,0.011575284,0.016305817,0.17329785,0.005220815,0.015967147,0.41768467,0.011997158],"about_ca_topic_score_codex":0.0035496631,"about_ca_topic_score_gemma":0.0007440375,"teacher_disagreement_score":0.51061434,"about_ca_system_score_codex":0.004156965,"about_ca_system_score_gemma":0.0066524805,"threshold_uncertainty_score":0.9996659},"labels":[],"label_agreement":null},{"id":"W7011469330","doi":"","title":"Meteorological characteristics of the Canadian Arctic Shelf Exchange Study","year":2008,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Arctic; The arctic; Sea surface temperature; Sea ice","score_opus":0.022259097814896114,"score_gpt":0.20844114247934645,"score_spread":0.18618204466445032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011469330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938884,0.00009396189,0.0010205266,0.00075603306,0.0012910163,0.00087935256,0.00003777236,0.00006393606,0.0019690369],"genre_scores_gemma":[0.99685585,0.00004520781,0.002347424,0.000030158526,0.00005186004,9.441831e-7,0.000029498731,0.000012440663,0.00062661996],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99789715,0.00031569408,0.00020331453,0.00056776276,0.0006612906,0.00035476696],"domain_scores_gemma":[0.9976409,0.00013639209,0.00047015725,0.0010744359,0.00050726446,0.00017084293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034701178,0.0002763079,0.0005942232,0.000308973,0.0004884864,0.000036514914,0.0026356406,0.00029056153,0.000017710674],"category_scores_gemma":[0.000113583614,0.0002748225,0.00025451859,0.000621251,0.00018843992,0.00017030339,0.00048385016,0.0004665102,0.000018959126],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002530681,0.0033199687,0.88797873,0.0015014868,0.0010437439,0.0012968114,0.036863156,0.00012105979,0.00019133397,0.005431091,0.004351015,0.057648532],"study_design_scores_gemma":[0.0002891199,0.0002941993,0.99243647,0.000040352108,0.00008646161,0.000009485661,0.0042298427,0.0010976827,0.000014873033,0.0001621479,0.0010906091,0.00024873993],"about_ca_topic_score_codex":0.22186716,"about_ca_topic_score_gemma":0.98552847,"teacher_disagreement_score":0.7636613,"about_ca_system_score_codex":0.00047326958,"about_ca_system_score_gemma":0.00057749613,"threshold_uncertainty_score":0.9999704},"labels":[],"label_agreement":null},{"id":"W7011797488","doi":"","title":"No-Vacation Nation Revisited","year":2013,"lang":"en","type":"other","venue":"Issue Lab (Candid)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mandate; Statutory law; Order (exchange); Quarter (Canadian coin); Developed country; Service (business)","score_opus":0.012920293400514508,"score_gpt":0.2447109311458532,"score_spread":0.2317906377453387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011797488","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012595266,0.0020386775,0.1889143,0.0013627597,0.0025136764,0.0011681004,0.00002718161,0.0015397276,0.802423],"genre_scores_gemma":[0.00029380372,0.00019819323,0.04969326,0.0005340991,0.0025751335,0.00008687292,0.00012410409,0.00023765657,0.9462569],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99755,0.0001767774,0.0003817307,0.00092635816,0.0005735981,0.00039150647],"domain_scores_gemma":[0.9976566,0.00009601898,0.00037681416,0.0014792659,0.00024984812,0.00014148558],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031229173,0.00039819287,0.00046140334,0.00038768767,0.00007847392,0.0003290036,0.0014349488,0.00040985722,0.0040463577],"category_scores_gemma":[0.00013640973,0.00037842244,0.00010472343,0.000666956,0.000056952966,0.00026797265,0.0004352134,0.0002913236,0.008680312],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014750626,0.000067804736,0.000082276856,0.00012112075,0.00003350391,0.0000061154965,0.0001308002,0.000007634595,0.000026214253,0.007111349,0.9273816,0.06503012],"study_design_scores_gemma":[0.00027705642,0.00006248315,0.0003567041,0.00013974903,0.000014157116,0.0000065649647,0.0000022385912,0.026813239,0.000036761092,0.0014741911,0.9703811,0.00043575326],"about_ca_topic_score_codex":0.0014581801,"about_ca_topic_score_gemma":0.00011037123,"teacher_disagreement_score":0.1438339,"about_ca_system_score_codex":0.00018070295,"about_ca_system_score_gemma":0.00008893847,"threshold_uncertainty_score":0.9998668},"labels":[],"label_agreement":null},{"id":"W7013074677","doi":"","title":"Palermo","year":2011,"lang":"it","type":"book-chapter","venue":"Nova Science Publishers (Nova Science Publishers, Inc.)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Work (physics)","score_opus":0.07998518800032535,"score_gpt":0.2780734719359292,"score_spread":0.19808828393560385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7013074677","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024579633,0.0005436846,0.043233346,0.011739028,0.06329036,0.004927763,0.00016596686,0.0025790173,0.8710629],"genre_scores_gemma":[0.66902095,0.00018230268,0.2185386,0.012385262,0.006492341,0.00039344287,0.000279212,0.0012480854,0.09145981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.94086367,0.0003785089,0.005872172,0.018007826,0.022693036,0.012184769],"domain_scores_gemma":[0.95227146,0.00094423513,0.004818372,0.015709382,0.018694,0.007562572],"candidate_categories":["metaresearch","metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaresearch","metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.042985007,0.0051969076,0.004190602,0.014912717,0.0074334154,0.110909805,0.075445816,0.0026787708,0.015691146],"category_scores_gemma":[0.011000289,0.00513081,0.0016209441,0.034819305,0.06751363,0.16201,0.02912693,0.0077378755,0.00454306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00012462694,0.0018548782,0.002309253,0.0004046379,0.00026111383,0.0006281265,0.007868234,0.00058173266,0.002075995,0.6190794,0.04057542,0.32423657],"study_design_scores_gemma":[0.008298081,0.0049677156,0.037430253,0.0022504677,0.0006843481,0.0029517754,0.0031579558,0.044495024,0.002543131,0.29218867,0.57452554,0.02650704],"about_ca_topic_score_codex":0.0055445475,"about_ca_topic_score_gemma":0.00035692877,"teacher_disagreement_score":0.77960306,"about_ca_system_score_codex":0.010048686,"about_ca_system_score_gemma":0.04699182,"threshold_uncertainty_score":0.998616},"labels":[],"label_agreement":null},{"id":"W7014589232","doi":"","title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing Montreal, Quebec, Canada ; May 19 - 21, 2002","year":2002,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics)","score_opus":0.013064423703024287,"score_gpt":0.20416732446837013,"score_spread":0.19110290076534583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7014589232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85679525,0.00031229653,0.016279252,0.016721593,0.0018378343,0.0015581988,0.000057297955,0.0004460154,0.10599227],"genre_scores_gemma":[0.98532104,0.000005771491,0.0074075987,0.0006520237,0.00008792553,0.000003849211,3.408136e-7,0.0000139913645,0.006507465],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761105,0.00008753462,0.0005369855,0.000570364,0.00075513986,0.00043894324],"domain_scores_gemma":[0.9976371,0.0006165137,0.00032286198,0.0009417019,0.00034372913,0.00013807855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055047765,0.00025808983,0.00037297353,0.00008636265,0.00014702909,0.00006255038,0.0028542692,0.00007792982,0.000116519666],"category_scores_gemma":[0.0002448116,0.00017552689,0.00012454986,0.000671712,0.00018480701,0.00023384498,0.0012856014,0.000224311,0.0000059931667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006752459,0.0022920547,0.022474691,0.0005990087,0.00029265345,0.00003182168,0.027566705,0.012331594,0.0028161122,0.24517487,0.5399942,0.14635882],"study_design_scores_gemma":[0.002624379,0.0009707451,0.29132116,0.00039880798,0.00009260884,0.00011549548,0.0040877634,0.642963,0.025287606,0.017116543,0.012986811,0.0020350837],"about_ca_topic_score_codex":0.36021736,"about_ca_topic_score_gemma":0.26063237,"teacher_disagreement_score":0.6306314,"about_ca_system_score_codex":0.00022227396,"about_ca_system_score_gemma":0.00021657586,"threshold_uncertainty_score":0.7528592},"labels":[],"label_agreement":null},{"id":"W7025186971","doi":"","title":"Turismus jako alternativa rozvoje rurální krajiny","year":2002,"lang":"en","type":"article","venue":"Digital Repository (National Repository of Grey Literature)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Lagging; Tourism; Rural tourism; Globalization; Disadvantaged; Situated; Rural area","score_opus":0.012395064343766372,"score_gpt":0.21743281998012767,"score_spread":0.2050377556363613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025186971","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27249488,0.012640061,0.062742114,0.0017992958,0.01463981,0.0019109986,0.00016878673,0.001933055,0.631671],"genre_scores_gemma":[0.97964996,0.00001158142,0.006052702,0.00016152461,0.0010603955,0.000037027952,0.000030934596,0.000040487495,0.01295541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994425,0.0001953124,0.0012389361,0.0012908357,0.0022735512,0.00057633873],"domain_scores_gemma":[0.9952479,0.00056107674,0.0006570647,0.0012452719,0.001925027,0.0003636311],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00026977566,0.0005715494,0.0005617327,0.00045151767,0.00047050606,0.0022741095,0.0019994753,0.00029011827,0.00001362067],"category_scores_gemma":[0.00040066606,0.0005460699,0.00049431104,0.00093586394,0.00029487876,0.0038525416,0.0006091697,0.0005378212,0.00003907412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063565664,0.018076789,0.15576163,0.002086893,0.0034723084,0.011734825,0.03536989,0.0090933535,0.07584875,0.35517204,0.15018119,0.18256666],"study_design_scores_gemma":[0.0064266603,0.0026809056,0.124262184,0.0019611153,0.00017980732,0.01654704,0.000145357,0.48717993,0.12968399,0.06969294,0.15412484,0.007115245],"about_ca_topic_score_codex":0.000011526608,"about_ca_topic_score_gemma":4.5055822e-7,"teacher_disagreement_score":0.70715505,"about_ca_system_score_codex":0.00040831658,"about_ca_system_score_gemma":0.00017942564,"threshold_uncertainty_score":0.99969906},"labels":[],"label_agreement":null},{"id":"W7025303307","doi":"","title":"The Type Ia Supernova Rate at z ≈ 0.5 from the Supernova Legacy Survey**Based on observations obtained with MegaPrime/MegaCam, a joint project of the Canada-France-Hawaii Telescope (CFHT) and CEA/DAPNIA, at CFHT, which is operated by the National Research Council (NRC) of Canada, the Institut National des Sciences de l’Univers of the Centre National de la Recherche Scientifique (CNRS) of France, and the University of Hawaii. This work is based in part on data products produced at the Canadian Astronomy Data Centre as part of the Canada-France-Hawaii Telescope Legacy Survey, a collaborative project of NRC and CNRS. This work is also based on observations obtained at the European Southern Observatory using the Very Large Telescope on the Cerro Paranal (ESO Large Program 171.A-0486), and on observations (programs GN-2004A-Q-19, GS-2004A-Q-11, GN-2003B-Q-9, and GS-2003B-Q-8) obtained at the Gemini Observatory, which is operated by the Association of Universities for Research in Astronomy, Inc., under a cooperative agreement with the National Science Foundation (NSF) on behalf of the Gemini partnership: the NSF (United States), the Particle Physics and Astronomy Research Council (United Kingdom), the National Research Council (Canada), CONICYT (Chile), the Australian Research Council (Australia), CNPq (Brazil), and CONICET (Argentina). This work is also based on observations obtained at the W. M. Keck Observatory, which is operated as a scientific partnership among the California Institute of Technology, the University of California, and the National Aeronautics and Space Administration. The Observatory was made possible by the generous financial support of the W. M. Keck Foundation.","year":2020,"lang":"en","type":"other","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Supernova; Joint (building); Telescope; Type (biology); Luminosity","score_opus":0.3393736433949001,"score_gpt":0.3493407303856977,"score_spread":0.009967086990797569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025303307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7948288,0.0003290539,0.00001889656,0.18499023,0.00011230741,0.009203771,0.010077577,0.000009984914,0.0004294267],"genre_scores_gemma":[0.99322593,0.00011145442,0.0001104712,0.0025874244,0.00006604687,0.00022624504,0.00035212113,0.000059829075,0.00326045],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.96556795,0.017419161,0.001244595,0.0014536092,0.0131423455,0.0011723632],"domain_scores_gemma":[0.93905735,0.023841647,0.001878599,0.0028527856,0.032223314,0.0001462975],"candidate_categories":["metaresearch","metaepi_narrow","sts","open_science"],"consensus_categories":["metaresearch","sts"],"category_scores_codex":[0.09388936,0.00070847117,0.0006815758,0.0001540753,0.0149638755,0.000736214,0.0058446317,0.00026508298,0.000053628737],"category_scores_gemma":[0.013713294,0.00024740116,0.00011209457,0.012596283,0.026489979,0.00045974515,0.0019957102,0.0021737458,3.7578098e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.004761747,0.0009756927,0.25748852,0.00024851406,0.0016372675,0.0000016976338,0.040993392,0.024272338,0.00076283695,0.01766037,0.650985,0.00021260323],"study_design_scores_gemma":[0.0075799376,0.0007453582,0.43216327,0.0013169167,0.00050510134,0.0000092248865,0.062179722,0.12067086,0.0025529969,0.00027800037,0.37117854,0.0008200768],"about_ca_topic_score_codex":0.6333538,"about_ca_topic_score_gemma":0.9777452,"teacher_disagreement_score":0.34439138,"about_ca_system_score_codex":0.00794545,"about_ca_system_score_gemma":0.121112436,"threshold_uncertainty_score":0.9999978},"labels":[],"label_agreement":null},{"id":"W7026278371","doi":"","title":"Abandonment for trumpet and orchestra","year":2013,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Abandonment (legal); Musical; Narrative; Transformational leadership; The Symbolic; Archipelago; Period (music)","score_opus":0.018947266997384662,"score_gpt":0.2405151343528556,"score_spread":0.22156786735547093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7026278371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97823834,0.0005958135,0.00025888317,0.00011912678,0.003359794,0.0032670829,0.0005529602,0.0007662558,0.012841762],"genre_scores_gemma":[0.89390105,0.00030698391,0.09388559,0.00057434815,0.00020670149,0.0012202323,0.0006798306,0.0002714792,0.00895377],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436474,0.00028985186,0.0010923075,0.0022445745,0.0009239215,0.0010846289],"domain_scores_gemma":[0.9960031,0.00075676345,0.0006124729,0.0016012355,0.00046803922,0.0005584263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012593457,0.0010143332,0.0010260283,0.0003890018,0.0009985906,0.0005112525,0.0020617284,0.0008007852,0.000083194005],"category_scores_gemma":[0.00055722194,0.0010228606,0.00043169947,0.000502099,0.00008930585,0.0013446606,0.00056371844,0.0011051791,0.0001504683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007586364,0.0003635985,0.000026446334,0.0006425859,0.00019690242,0.00003103097,0.000065900225,0.000031689135,0.00645307,0.24845378,0.000027976777,0.7436312],"study_design_scores_gemma":[0.0069814017,0.0023171683,0.017477525,0.00087788585,0.0005120144,0.0002552828,0.00038229095,0.013775943,0.09774791,0.66988575,0.1827228,0.00706404],"about_ca_topic_score_codex":0.00022293761,"about_ca_topic_score_gemma":0.0003119994,"teacher_disagreement_score":0.73656714,"about_ca_system_score_codex":0.0005939288,"about_ca_system_score_gemma":0.00009481301,"threshold_uncertainty_score":0.99922216},"labels":[],"label_agreement":null},{"id":"W7027227614","doi":"","title":"The cheapest police: the limits of recognition and intellectual freedom in Canadian libraries","year":2024,"lang":"en","type":"other","venue":"University of Birmingham Institutional Research Archive (University of Birmingham)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Politics; Hegemony; Indigenous; Liberalism; State (computer science); Intellectual freedom; Bourgeoisie; Political philosophy; Political freedom; Censorship","score_opus":0.06199998188421963,"score_gpt":0.2595990146398851,"score_spread":0.19759903275566548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027227614","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03936189,0.008383519,0.09892163,0.013617561,0.0017827373,0.005083314,0.0042659435,0.0004903219,0.8280931],"genre_scores_gemma":[0.6802498,0.017276814,0.10997487,0.00011158635,0.0007636247,0.0000036135168,0.00038587637,0.00038445412,0.19084936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99699545,0.00052013015,0.0002375167,0.0006821553,0.00091638276,0.0006483408],"domain_scores_gemma":[0.99639577,0.0020148773,0.00023455395,0.0006934473,0.00034238302,0.00031897106],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015389634,0.0002602381,0.00043795633,0.0021589962,0.0007825002,0.000075186676,0.002591931,0.0002452466,0.00016481573],"category_scores_gemma":[0.0005031965,0.0002520533,0.00018892792,0.001577639,0.0062800953,0.00035496568,0.0018671218,0.000978962,0.00007787922],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008024173,0.00088119623,0.0017312265,0.0022958932,0.001265157,0.0009039365,0.094935186,0.00042719164,0.0007122723,0.44400212,0.27764887,0.17439455],"study_design_scores_gemma":[0.0010926677,0.00053128565,0.0036755088,0.0017157431,0.000070196875,0.00006071269,0.012571559,0.0253511,0.000052917578,0.024890037,0.92937684,0.0006114601],"about_ca_topic_score_codex":0.5308972,"about_ca_topic_score_gemma":0.6684423,"teacher_disagreement_score":0.651728,"about_ca_system_score_codex":0.00031271603,"about_ca_system_score_gemma":0.0031440111,"threshold_uncertainty_score":0.99999315},"labels":[],"label_agreement":null},{"id":"W7027347937","doi":"","title":"Company announces indefinite shutdown at Nova Scotia paper mill, citing costs","year":2011,"lang":"en","type":"other","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nova scotia; Shutdown; Window (computing); Government (linguistics)","score_opus":0.032808021592938476,"score_gpt":0.24351892915490533,"score_spread":0.21071090756196686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027347937","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001724263,0.0015099084,0.053244527,0.000289138,0.0031225458,0.00064192904,0.000052024032,0.0016313966,0.9393361],"genre_scores_gemma":[0.010542011,0.00014644966,0.31357244,0.004387445,0.0018032811,0.000035560584,0.00013879527,0.00073576666,0.6686383],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99548924,0.00023218222,0.0006875386,0.0017454635,0.0008750516,0.0009704973],"domain_scores_gemma":[0.9965815,0.00032683733,0.000492219,0.0021197875,0.00017808743,0.00030160075],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006188486,0.00083696854,0.00092800177,0.0004924751,0.00014770361,0.00033708397,0.0031376418,0.0005638294,0.011868231],"category_scores_gemma":[0.00007772122,0.0007131289,0.0002741349,0.0007814383,0.00033267424,0.00033474588,0.0027137501,0.0005386333,0.0056814463],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008893499,0.0003041274,0.005552504,0.00014806577,0.00019780433,0.00009236811,0.00054507714,0.000012432894,0.000066744986,0.021917703,0.925797,0.045357306],"study_design_scores_gemma":[0.0007685042,0.00019078467,0.004820345,0.00037977056,0.000037465936,0.000117111114,0.000029784867,0.003475481,0.00006739965,0.0018150958,0.9863891,0.001909186],"about_ca_topic_score_codex":0.007952657,"about_ca_topic_score_gemma":0.011641731,"teacher_disagreement_score":0.27069783,"about_ca_system_score_codex":0.00032551022,"about_ca_system_score_gemma":0.00017078842,"threshold_uncertainty_score":0.999532},"labels":[],"label_agreement":null},{"id":"W7028389165","doi":"","title":"Fall Quarter Graduate's Research Recognized by Navy Oceanographer","year":2014,"lang":"en","type":"article","venue":"Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Navy; Period (music); Maritime history","score_opus":0.0565491063902289,"score_gpt":0.300051350400271,"score_spread":0.24350224401004208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028389165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5234019,0.0021220976,0.35094503,0.07447876,0.009389535,0.0073481095,0.0011810557,0.003430162,0.027703341],"genre_scores_gemma":[0.95833874,0.0005247662,0.029548816,0.0049139103,0.002716495,0.00047220392,0.0007927705,0.00024406276,0.0024482552],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9780713,0.0057648323,0.0025545738,0.0040385043,0.005691015,0.0038798135],"domain_scores_gemma":[0.98609537,0.0031160722,0.00072964735,0.004370976,0.002950553,0.0027374001],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts"],"category_scores_codex":[0.010133038,0.0019311495,0.001649561,0.001360741,0.004366731,0.0024599645,0.008555337,0.00054929114,0.000107094944],"category_scores_gemma":[0.005182168,0.0015016972,0.0013982572,0.0043327753,0.003990493,0.0027706833,0.0033751717,0.0061828326,0.006057502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025095106,0.0040163877,0.013847998,0.00045896252,0.0018643809,0.00056757696,0.0029408145,0.002789082,0.015840486,0.19836116,0.6612578,0.095545836],"study_design_scores_gemma":[0.010480696,0.0036434669,0.051022727,0.0007508038,0.00031814355,0.0018328419,0.00049328286,0.11375745,0.003231104,0.64604217,0.16253528,0.00589202],"about_ca_topic_score_codex":0.0025885461,"about_ca_topic_score_gemma":0.00039535266,"teacher_disagreement_score":0.49872252,"about_ca_system_score_codex":0.00089509523,"about_ca_system_score_gemma":0.0019207933,"threshold_uncertainty_score":0.9993432},"labels":[],"label_agreement":null},{"id":"W7029608335","doi":"","title":"Le système racinaire du pin gris en plantation âgé de 18 à 25 ans","year":2014,"lang":"fr","type":"other","venue":"Constellation (Université du Québec à Chicoutimi)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Environmental factor; Semis; Zea mays; Water stress","score_opus":0.009146365061278541,"score_gpt":0.18543581196841602,"score_spread":0.1762894469071375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029608335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049876063,0.00064213463,0.56625855,0.0073462343,0.001540815,0.0007970049,0.000043834847,0.0005077663,0.41787606],"genre_scores_gemma":[0.9357551,0.00025882164,0.008733215,0.0006136782,0.0014393581,0.0000056918648,0.00013025053,0.00019220453,0.05287171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995208,0.0011198254,0.00069844123,0.0014939529,0.0006646945,0.0008150454],"domain_scores_gemma":[0.99570364,0.0012825717,0.0009041271,0.0012155145,0.00044335178,0.00045082238],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009197737,0.0008317026,0.0009577468,0.0007065392,0.0008959855,0.00038510183,0.0016434044,0.0008770192,0.030467903],"category_scores_gemma":[0.00019733202,0.0010316351,0.00042347965,0.0008535952,0.0007028817,0.0007189591,0.0007767763,0.0006691477,0.00089716556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021790253,0.0010868621,0.08120834,0.0016376222,0.001005279,0.00065271766,0.05380177,0.057399254,0.00029322287,0.25767335,0.21923417,0.3257895],"study_design_scores_gemma":[0.0023975556,0.00025869146,0.09792167,0.00054073235,0.0003125383,0.0006479115,0.00085932534,0.62209785,0.00004753904,0.0014146206,0.27194467,0.0015568912],"about_ca_topic_score_codex":0.022001766,"about_ca_topic_score_gemma":0.022301376,"teacher_disagreement_score":0.9307675,"about_ca_system_score_codex":0.0024235689,"about_ca_system_score_gemma":0.00479531,"threshold_uncertainty_score":0.99988073},"labels":[],"label_agreement":null},{"id":"W7033999715","doi":"","title":"A Short History of the Canadian Law and Society Association","year":2003,"lang":"en","type":"article","venue":"eYLS (Yale Law School)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Association (psychology); Government (linguistics); Legislation","score_opus":0.013852545383787447,"score_gpt":0.2120114382524275,"score_spread":0.19815889286864005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033999715","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19675654,0.0046937526,0.020441934,0.0064628134,0.011614877,0.0022336864,0.000054768712,0.0006294056,0.7571122],"genre_scores_gemma":[0.9841742,0.000006056029,0.010832081,0.0029834048,0.000059849925,0.000011108031,8.3843435e-7,0.000009134771,0.0019233313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984916,0.00019143209,0.00022806565,0.00035770822,0.0003922713,0.00033893445],"domain_scores_gemma":[0.9987723,0.00011956162,0.00009181138,0.00064135867,0.00014966291,0.0002252757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009103716,0.00013117766,0.00018089329,0.000020660149,0.00023907647,0.0000889047,0.0005820635,0.0001352495,0.000033363332],"category_scores_gemma":[0.00013143024,0.00011264608,0.00013040584,0.00020592635,0.00015596297,0.00028253274,0.00015109302,0.00027383785,0.000013120416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.636136e-7,0.000056606998,0.027487868,0.000021839101,0.000043225253,0.0000027375174,0.0011791191,0.00006672453,0.00015576942,0.95678926,0.012888363,0.0013078199],"study_design_scores_gemma":[0.00045872387,0.000063979496,0.07345231,0.000025955718,0.00003004223,0.00001930825,0.00004663345,0.006947874,0.0007214293,0.026884869,0.8908704,0.00047847643],"about_ca_topic_score_codex":0.09272521,"about_ca_topic_score_gemma":0.31354907,"teacher_disagreement_score":0.9299044,"about_ca_system_score_codex":0.002098126,"about_ca_system_score_gemma":0.0006560978,"threshold_uncertainty_score":0.9133164},"labels":[],"label_agreement":null},{"id":"W7035673806","doi":"","title":"Advisory - Third Quarter 2020 Results Conference Call and Webcast - Earnings News (EARNINGS) News","year":2020,"lang":"en","type":"other","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Webcast; Quarter (Canadian coin); Earnings; Liberian dollar","score_opus":0.019532918194161572,"score_gpt":0.2371155197123186,"score_spread":0.217582601518157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035673806","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006231119,0.00036544603,0.295724,0.010019775,0.0011447411,0.0008622361,0.000042991025,0.0019483805,0.6898301],"genre_scores_gemma":[0.0031238229,0.00056956074,0.17876418,0.004245687,0.002044241,0.00006555628,0.00008905571,0.0004687306,0.8106292],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99446106,0.00043104804,0.00085822586,0.0025577282,0.0008017809,0.0008901549],"domain_scores_gemma":[0.9965512,0.000340406,0.00068527315,0.0016198063,0.00012464523,0.0006786666],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00037969952,0.0009083818,0.0010992164,0.0002723548,0.00014500447,0.00074287097,0.0022936258,0.00063235057,0.0009253719],"category_scores_gemma":[0.00035691686,0.00080433674,0.00021783837,0.0006385827,0.0002923332,0.00033457566,0.0019200211,0.001290645,0.00096900115],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026160717,0.00006519262,0.0007948815,0.00010145646,0.000059582773,0.000113210466,0.0021069623,0.000014457762,0.000023349889,0.0010387704,0.96582335,0.029832646],"study_design_scores_gemma":[0.0010337916,0.000501215,0.0030277956,0.00014854822,0.000027192942,0.0000598395,0.00014929067,0.031969205,0.0000074711493,0.00041251423,0.96156466,0.0010984538],"about_ca_topic_score_codex":0.004201285,"about_ca_topic_score_gemma":0.0021694205,"teacher_disagreement_score":0.120799065,"about_ca_system_score_codex":0.00007465729,"about_ca_system_score_gemma":0.0003689709,"threshold_uncertainty_score":0.9999879},"labels":[],"label_agreement":null},{"id":"W7066781492","doi":"","title":"iShares MSCI Canada ETF Target of Unusually High Options Trading (NYSEARCA:EWC)","year":2023,"lang":"en","type":"other","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Investment (military); Work (physics); Order (exchange); Term (time)","score_opus":0.02025547608580767,"score_gpt":0.24112204562762193,"score_spread":0.22086656954181427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066781492","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010423147,0.0009382257,0.327453,0.003150951,0.0070067695,0.0015785798,0.0008228674,0.0043228576,0.65462255],"genre_scores_gemma":[0.011931169,0.00011794044,0.27112272,0.00046025286,0.0009464007,0.00014304543,0.000073031784,0.00097285793,0.71423256],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99683774,0.00013468442,0.00050205353,0.0009644173,0.00096589135,0.00059519726],"domain_scores_gemma":[0.99770224,0.00039424666,0.00024093114,0.0012954385,0.00013597519,0.00023115508],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037791423,0.00040905474,0.0006233814,0.00045065864,0.00009163894,0.00014020164,0.002406842,0.00023558884,0.0025347169],"category_scores_gemma":[0.00012911035,0.00038202226,0.00015268076,0.0011257051,0.00010479974,0.0001510225,0.000836782,0.000342855,0.00005792629],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001143918,0.000085724125,0.00016104292,0.00012795966,0.00012659318,0.00006937678,0.0000851265,0.00036331403,0.0000079189385,0.036517102,0.9516639,0.010790783],"study_design_scores_gemma":[0.0010308229,0.00031916096,0.010228613,0.00052952964,0.000069236055,0.000045139142,0.0001483231,0.13201417,0.00050894934,0.022960877,0.8293391,0.0028060651],"about_ca_topic_score_codex":0.6815889,"about_ca_topic_score_gemma":0.74708337,"teacher_disagreement_score":0.13165087,"about_ca_system_score_codex":0.0003358471,"about_ca_system_score_gemma":0.0012827092,"threshold_uncertainty_score":0.99986315},"labels":[],"label_agreement":null},{"id":"W7087797040","doi":"10.5281/zenodo.17313453","title":"aluisayala/the-real-scope-of-omega: The Real Scope of Ω","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ottawa Public Health","funders":"","keywords":"Scope (computer science); The Symbolic; Declaration; Verifiable secret sharing; Symbolic trajectory evaluation; Computation; Continuation; Symbolic dynamics; Symbolic data analysis","score_opus":0.02561741277465796,"score_gpt":0.2548098304817162,"score_spread":0.22919241770705823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7087797040","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005771738,0.00074844493,0.042190883,0.0008893725,0.0004510368,0.0010193586,0.00021057711,0.0009010167,0.95353156],"genre_scores_gemma":[0.03516906,0.017817853,0.027108088,0.00090778165,0.002710088,0.0000015593382,0.0017484532,0.019196099,0.89534104],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99640477,0.0009541162,0.00055383146,0.00077382044,0.00085128023,0.0004622128],"domain_scores_gemma":[0.99621147,0.00017387918,0.0004629846,0.0023134467,0.0007178661,0.00012037614],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014951845,0.00031463767,0.000441128,0.00040846676,0.00084367313,0.0005423995,0.00663233,0.00016555542,0.0060361056],"category_scores_gemma":[0.00057633617,0.00023022661,0.00015721892,0.0015609025,0.0006326707,0.00014025644,0.006244692,0.0004901573,0.0018043343],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001852119,0.0001900473,0.000004003441,0.00024019263,0.0001314507,0.000009701716,0.0006653746,0.00008347463,0.00018996076,0.040177837,0.74864346,0.20964596],"study_design_scores_gemma":[0.00031444718,0.00019811818,0.00042044694,0.00016477639,0.000027338763,0.000017519009,0.000047908994,0.0012095626,0.0002575329,0.00067054905,0.99643964,0.00023213979],"about_ca_topic_score_codex":0.00069051626,"about_ca_topic_score_gemma":0.000008503167,"teacher_disagreement_score":0.2477962,"about_ca_system_score_codex":0.0001366514,"about_ca_system_score_gemma":0.000049193422,"threshold_uncertainty_score":0.9989729},"labels":[],"label_agreement":null},{"id":"W7094219592","doi":"","title":"Cue List","year":2017,"lang":"","type":"article","venue":"Scholar Works  (Boise State University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Window (computing); Feature (linguistics); Quarter (Canadian coin); Period (music)","score_opus":0.019559712624407154,"score_gpt":0.229654544545402,"score_spread":0.21009483192099485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7094219592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32301554,0.0017575151,0.55698603,0.00620647,0.01229273,0.0019827923,0.00019017805,0.0010237505,0.096544966],"genre_scores_gemma":[0.9379827,0.0016490282,0.028855128,0.00024507783,0.0004946324,0.0000012528873,0.000011601648,0.00007791529,0.030682698],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99321055,0.00087183976,0.00062980835,0.002494103,0.0010669589,0.0017267376],"domain_scores_gemma":[0.99050665,0.0002543061,0.00094607857,0.00620227,0.0009135172,0.0011771979],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018162642,0.0009087448,0.0008848473,0.00087196106,0.0070589995,0.007503291,0.01067428,0.0004841698,0.00042869485],"category_scores_gemma":[0.00071485265,0.0011196168,0.0006217475,0.0014678894,0.0013521208,0.009652985,0.008392811,0.0029575992,0.0008204366],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003614041,0.0011643857,0.018022755,0.00015945951,0.00045522186,0.0064392667,0.0039339345,0.0033690522,0.00017759662,0.020591056,0.0019390546,0.9433868],"study_design_scores_gemma":[0.009045058,0.0010802017,0.10608542,0.0016633109,0.00045909808,0.00014432182,0.0011939122,0.22181778,0.00087135046,0.02036916,0.6318056,0.005464762],"about_ca_topic_score_codex":0.00073994836,"about_ca_topic_score_gemma":0.0005154632,"teacher_disagreement_score":0.93792206,"about_ca_system_score_codex":0.00089712674,"about_ca_system_score_gemma":0.0008051956,"threshold_uncertainty_score":0.99995756},"labels":[],"label_agreement":null},{"id":"W7095104973","doi":"","title":"Social Capital, Internet Use and Engagement","year":2005,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"The Internet; Social capital; Sociology of the Internet; Civic engagement; Politics; Social engagement; Individual capital; Suicide and the Internet","score_opus":0.05436964832176816,"score_gpt":0.27447266861569813,"score_spread":0.22010302029392997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095104973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5188995,0.000046839115,0.47458297,0.0037992685,0.00016739639,0.0001442725,5.8320006e-7,0.00027611927,0.002083067],"genre_scores_gemma":[0.884949,0.0000036017193,0.11322217,0.00068263314,0.00014979087,0.000005352662,5.449714e-7,0.000004112432,0.0009827494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990238,0.00007783742,0.0001554843,0.00035513655,0.00017768492,0.00021007338],"domain_scores_gemma":[0.99949586,0.00010625274,0.000029257522,0.00025343397,0.0000465472,0.000068644644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002935068,0.00010725255,0.00010859546,0.000049689446,0.00008179573,0.00036617517,0.00043259235,0.00003584803,0.000091349015],"category_scores_gemma":[0.00003082729,0.0000934191,0.00003694153,0.00010561943,0.000054212655,0.00062408025,0.00084005314,0.000110951165,0.000080671685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055800615,0.00042918292,0.0050553204,0.000017139959,0.000047896883,0.000018869885,0.018294467,0.00009288682,0.00019738953,0.3760717,0.033313733,0.56645584],"study_design_scores_gemma":[0.0012959779,0.00031938302,0.14709102,0.000008225694,0.000014318229,0.000049479124,0.00024855539,0.66606176,0.0016116609,0.018078957,0.16433556,0.0008850914],"about_ca_topic_score_codex":0.00009403861,"about_ca_topic_score_gemma":0.00008396408,"teacher_disagreement_score":0.6659689,"about_ca_system_score_codex":0.000055960623,"about_ca_system_score_gemma":0.000018236986,"threshold_uncertainty_score":0.380952},"labels":[],"label_agreement":null},{"id":"W7095658827","doi":"","title":"Yee-Hong Yang, Computing Science","year":2016,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Permission; Work (physics); Association (psychology); Government (linguistics); License; Product (mathematics)","score_opus":0.013486242197983321,"score_gpt":0.25231281511657777,"score_spread":0.23882657291859444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095658827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058973785,0.000025199926,0.9234673,0.0025014442,0.00096400053,0.00013814744,4.815937e-7,0.00070797454,0.013221686],"genre_scores_gemma":[0.7999358,0.0000015069168,0.19911204,0.0003357345,0.00012534505,0.000001826975,6.019002e-8,0.0000062069876,0.00048143818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744856,0.000055635763,0.00028889973,0.00088770257,0.0006508322,0.00066839234],"domain_scores_gemma":[0.99801165,0.0003325806,0.00008106746,0.0011152553,0.00023545328,0.0002239989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012218698,0.00017289912,0.0001787887,0.00019635785,0.000327253,0.00032437392,0.0027066784,0.000041392264,0.000079327365],"category_scores_gemma":[0.00023154642,0.00010822842,0.00007150865,0.0011626399,0.00046572054,0.0010404756,0.0020101992,0.00008556685,0.00045254602],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012277335,0.00009200932,0.007601228,0.000006233409,0.0000052919895,0.00002040491,0.000299076,0.000057912755,0.0110418545,0.18973236,0.0005564477,0.79058594],"study_design_scores_gemma":[0.0017346122,0.00043302748,0.160254,0.00013549879,0.000008002613,0.0002063378,0.00010214687,0.6860912,0.05490036,0.082411535,0.01197984,0.001743459],"about_ca_topic_score_codex":0.00003756088,"about_ca_topic_score_gemma":0.000013050342,"teacher_disagreement_score":0.7888425,"about_ca_system_score_codex":0.0001677366,"about_ca_system_score_gemma":0.00020903094,"threshold_uncertainty_score":0.5816715},"labels":[],"label_agreement":null},{"id":"W7096206124","doi":"","title":"It was rewardi...","year":2008,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Product (mathematics); Subject (documents); Black box","score_opus":0.035466019808226765,"score_gpt":0.24709026687945213,"score_spread":0.21162424707122535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096206124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009450891,0.000056328125,0.8806715,0.0068597314,0.00064651005,0.00013637576,5.529885e-7,0.000665038,0.10151307],"genre_scores_gemma":[0.6376702,0.000020638972,0.35364813,0.0027324313,0.00019733708,0.000010598033,0.0000010531421,0.000009638584,0.0057099448],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986015,0.00005586168,0.00021228338,0.00047731315,0.00033811774,0.00031491014],"domain_scores_gemma":[0.998678,0.00012593452,0.000034002966,0.00094450504,0.00009147676,0.0001260738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023490202,0.0001300999,0.00016607333,0.00006685295,0.00015514213,0.0000597981,0.001108768,0.000052391835,0.00013712815],"category_scores_gemma":[0.000058384347,0.00010868376,0.0000937978,0.00040756707,0.00007909018,0.00033631627,0.0006178082,0.00011480712,0.0006832844],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001609376,0.0012965498,0.025579391,0.00005584817,0.0001107735,0.0011613722,0.010684085,0.0019843872,0.001076393,0.23376364,0.39540187,0.32886958],"study_design_scores_gemma":[0.0013291534,0.00052872056,0.07312117,0.000014841863,0.0000093796,0.0015462539,0.00007724667,0.4932775,0.0075367414,0.053698327,0.36737782,0.0014828541],"about_ca_topic_score_codex":0.000055798788,"about_ca_topic_score_gemma":0.000010086529,"teacher_disagreement_score":0.62821937,"about_ca_system_score_codex":0.00004981043,"about_ca_system_score_gemma":0.00008402278,"threshold_uncertainty_score":0.87824667},"labels":[],"label_agreement":null},{"id":"W7097219834","doi":"","title":"the Eastern Quebec telepathology project","year":2016,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.01899277963459117,"score_gpt":0.2543930971046957,"score_spread":0.23540031747010454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097219834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027401181,0.00006317733,0.9511198,0.010769843,0.0008456571,0.00028623603,6.877369e-7,0.00043694637,0.0090765115],"genre_scores_gemma":[0.86960745,0.000025822983,0.08026137,0.0009705603,0.00038588457,0.00009045758,2.9054723e-7,0.00001939847,0.04863875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856263,0.0001775752,0.0002086851,0.0004492814,0.0002140025,0.0003877935],"domain_scores_gemma":[0.99821436,0.0005552789,0.000053821583,0.0010327011,0.00009155674,0.000052266372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053194596,0.00012750663,0.000121945726,0.000046373458,0.00015829287,0.00015899714,0.0015420415,0.000051594652,0.000017842089],"category_scores_gemma":[0.000120834935,0.00005381625,0.00006858642,0.0002275225,0.0001676934,0.00026896506,0.0008151413,0.000068457055,0.00039372387],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003210055,0.00003920088,0.005062534,0.0000018612615,0.000006376648,0.000016062386,0.00023188694,8.171626e-7,0.00023251501,0.07539217,0.0018331874,0.9171802],"study_design_scores_gemma":[0.0023925998,0.0010433827,0.08843983,0.000046384605,0.00001526144,0.0006253707,0.00022449577,0.1368865,0.0045140926,0.1514624,0.61273086,0.0016188403],"about_ca_topic_score_codex":0.0010591466,"about_ca_topic_score_gemma":0.0032659688,"teacher_disagreement_score":0.9155613,"about_ca_system_score_codex":0.000067187735,"about_ca_system_score_gemma":0.00015098785,"threshold_uncertainty_score":0.5060655},"labels":[],"label_agreement":null},{"id":"W7097468637","doi":"","title":"Inheritance","year":2007,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Labrador Retriever; Class (philosophy); Construct (python library); Base (topology); Inheritance (genetic algorithm)","score_opus":0.016350965462946496,"score_gpt":0.2546907270218193,"score_spread":0.23833976155887276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097468637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01632717,0.000065838096,0.9272981,0.0006570104,0.00048513353,0.00007605257,1.08780995e-7,0.00043373235,0.054656837],"genre_scores_gemma":[0.576247,0.0000012790864,0.42227882,0.0006044599,0.00008251141,0.0000014095066,1.2848653e-7,0.0000034032269,0.00078100426],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99897814,0.000017129238,0.00017283777,0.00032199477,0.00021296737,0.0002969619],"domain_scores_gemma":[0.9990976,0.00012794633,0.00002734432,0.00058553024,0.00006581411,0.000095800424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059603766,0.00008559139,0.000090817724,0.000050117455,0.000053665874,0.00007161781,0.0008206423,0.000037321446,0.000055107554],"category_scores_gemma":[0.000037714864,0.00007416047,0.000040680767,0.0004213099,0.000034523677,0.0002660187,0.00031654738,0.000082480954,0.00019812818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027185765,0.00013097527,0.0051905783,0.0000066634716,0.000006170688,0.000056298333,0.00038084335,0.00004291563,0.0007355858,0.31605098,0.0016898991,0.6757064],"study_design_scores_gemma":[0.0010951723,0.00041705402,0.37335825,0.000017922626,0.000004850075,0.00020773207,0.00012423615,0.20542078,0.023869416,0.2513552,0.1427438,0.0013855799],"about_ca_topic_score_codex":0.000023615965,"about_ca_topic_score_gemma":0.000050289,"teacher_disagreement_score":0.6743208,"about_ca_system_score_codex":0.000042173433,"about_ca_system_score_gemma":0.00002366601,"threshold_uncertainty_score":0.3024176},"labels":[],"label_agreement":null},{"id":"W7098609416","doi":"","title":"2002. Quantifying impact of pulp mill effluent on fish in Canadian marine and estuarine environments: problems and progress. Water Quality Research","year":2015,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Effluent; Water quality; Estuary; Water pollution; Pulp mill; Paper mill; Fish <Actinopterygii>; Bay; Fish kill","score_opus":0.16881194459676038,"score_gpt":0.38038441618387453,"score_spread":0.21157247158711415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098609416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960456,0.00010227833,0.0005258438,0.0015493521,0.000055649107,0.00072021503,0.0000046498144,0.000026083095,0.0009703373],"genre_scores_gemma":[0.9946427,0.000021283244,0.0050315014,0.000059928298,0.000017281518,0.000029196903,0.000004762249,0.000009971327,0.00018338143],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9971072,0.00041456262,0.00043070607,0.0006666881,0.00058229914,0.00079851813],"domain_scores_gemma":[0.9984683,0.0001493391,0.000048991904,0.0006405361,0.00009409335,0.0005987782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040982817,0.0001969466,0.00031375047,0.00037323832,0.00007857762,0.00015494054,0.00047833627,0.000085513435,0.000057968133],"category_scores_gemma":[0.0001371075,0.00013453291,0.00004293237,0.00032119203,0.00026613477,0.00029438536,0.0011053478,0.00028203477,0.000014138537],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030617328,0.00037048006,0.94497365,0.00007977322,0.000030464973,0.00002915465,0.0025206269,0.00045356227,0.00015256644,0.0007218326,0.00025937243,0.050377917],"study_design_scores_gemma":[0.0010231584,0.000930127,0.9437754,0.000032408025,0.0000024767182,0.000017524746,0.000054460827,0.04973164,0.0006007452,0.0024682195,0.0011004019,0.0002634269],"about_ca_topic_score_codex":0.496455,"about_ca_topic_score_gemma":0.27270293,"teacher_disagreement_score":0.22375208,"about_ca_system_score_codex":0.00050721236,"about_ca_system_score_gemma":0.0001639072,"threshold_uncertainty_score":0.74056834},"labels":[],"label_agreement":null},{"id":"W7098791549","doi":"","title":"Canadian and Prairie Agricultural Productivity: Measurement, Causes, and Policy Implications","year":2007,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Productivity; Agriculture; Agricultural productivity; Estimation; Underpinning; Total factor productivity","score_opus":0.030097538395816487,"score_gpt":0.26018109003966833,"score_spread":0.23008355164385183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098791549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36439213,0.0007228849,0.32614553,0.28130853,0.00046993722,0.0018029818,0.000016734826,0.0007431027,0.024398183],"genre_scores_gemma":[0.98083186,0.0000040955006,0.018346494,0.000387966,0.0001667156,0.000009670846,0.0000012164254,0.0000043325736,0.0002476754],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986642,0.000035251913,0.0001619733,0.0005134637,0.0002081176,0.0004169784],"domain_scores_gemma":[0.99880236,0.000052362117,0.000039418246,0.00043968754,0.0002495048,0.00041665052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007433214,0.00013494588,0.000118415766,0.00017295005,0.00024327572,0.00020273752,0.00028521114,0.00004644769,0.0000022281902],"category_scores_gemma":[0.00020286077,0.000105165374,0.00001830026,0.0005959123,0.00007710212,0.00039295846,0.00022046383,0.00009491498,0.0000046240366],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002967316,0.0002060249,0.15196003,0.000046442947,0.0000713003,0.000014165568,0.0019086669,0.00001404269,0.005673575,0.3864284,0.00818638,0.44548804],"study_design_scores_gemma":[0.0001087428,0.000039209317,0.9810668,0.00000277834,0.0000040778996,0.00012687764,0.00003340776,0.00020317065,0.00041595852,0.0070958594,0.010726195,0.00017688642],"about_ca_topic_score_codex":0.10100688,"about_ca_topic_score_gemma":0.58472484,"teacher_disagreement_score":0.8291068,"about_ca_system_score_codex":0.00035431862,"about_ca_system_score_gemma":0.00038534004,"threshold_uncertainty_score":0.9049796},"labels":[],"label_agreement":null},{"id":"W7099077343","doi":"","title":"Author manuscript, published in &amp;quot;ACM SIGCOMM, Canada (2011)&amp;quot; Broadband Internet Performance: A View From the Gateway","year":2014,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Gateway (web page); Residential gateway; The Internet; Broadband; Internet access; Broadband networks; Access Point Name; Wireless broadband; Wireless network","score_opus":0.03372453203263651,"score_gpt":0.2367590708285244,"score_spread":0.2030345387958879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099077343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64637697,0.0008209034,0.3015607,0.035666898,0.005429826,0.0012030752,0.000029103481,0.000621942,0.008290622],"genre_scores_gemma":[0.92003167,0.000026399977,0.06017986,0.0057444666,0.00048034455,0.000106761996,0.00006893131,0.000048796916,0.013312751],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948035,0.0006946315,0.0010115792,0.0014038269,0.0010275681,0.001058903],"domain_scores_gemma":[0.99385256,0.0012209766,0.0002572437,0.0040391916,0.00025963603,0.00037037142],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002342216,0.0005751518,0.00070997345,0.0001668516,0.00022216799,0.0010892733,0.00646099,0.00018931001,0.0020041203],"category_scores_gemma":[0.00075817335,0.0003955987,0.00014477324,0.00074994226,0.00017796736,0.0011293554,0.0028430019,0.0008165141,0.00036942237],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046749446,0.00044584548,0.07958641,0.00012881859,0.00011241131,0.000022158358,0.0053728656,0.00058385317,0.0001269,0.005047129,0.674366,0.23416086],"study_design_scores_gemma":[0.001109191,0.00012022063,0.1322273,0.000105512896,0.000020656362,0.000041033887,0.00008603125,0.13344738,0.00027327292,0.008976189,0.7225932,0.0010000434],"about_ca_topic_score_codex":0.5478027,"about_ca_topic_score_gemma":0.81474525,"teacher_disagreement_score":0.27365476,"about_ca_system_score_codex":0.0004955237,"about_ca_system_score_gemma":0.0005735268,"threshold_uncertainty_score":0.99994767},"labels":[],"label_agreement":null},{"id":"W7099877734","doi":"","title":"Monetary policy transparency, public commentary and market perceptions about monetary policy in canada’, Bundesbank Discussion Paper 08/00","year":2000,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Monetary policy; Perception; Public policy; Monetary hegemony; Monetary system; Inflation targeting","score_opus":0.011431696137391674,"score_gpt":0.23342525724137414,"score_spread":0.22199356110398247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099877734","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3741595,0.0011287029,0.018077381,0.56795084,0.00041969997,0.0014967629,0.00021578724,0.0005840459,0.03596729],"genre_scores_gemma":[0.9723092,0.0006997289,0.010726971,0.014878344,0.00024768317,0.000043555596,0.000053750184,0.000027034892,0.0010137318],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9961258,0.000422357,0.0007375526,0.0010441965,0.0006323599,0.0010377245],"domain_scores_gemma":[0.99795073,0.000186867,0.00006570711,0.0011665204,0.000041749525,0.0005884485],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038693787,0.00047483796,0.00048576447,0.0004968698,0.0003433828,0.00024313114,0.0013341821,0.00012699029,0.0034661985],"category_scores_gemma":[0.000025625926,0.00035630018,0.000116643794,0.0013869902,0.00018476509,0.0013551173,0.00038902846,0.00043708272,0.000025070074],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003432591,0.0005772207,0.16168277,0.000058342524,0.000056860932,0.00008501954,0.002346331,0.0013016512,0.00006197603,0.0015970129,0.039769877,0.7924286],"study_design_scores_gemma":[0.00078749,0.000093538525,0.8535931,0.000028982784,0.000008202381,0.00006217204,0.00024898432,0.12029696,0.0000040107575,0.005355446,0.018932924,0.00058814714],"about_ca_topic_score_codex":0.9250494,"about_ca_topic_score_gemma":0.87880933,"teacher_disagreement_score":0.79184043,"about_ca_system_score_codex":0.0012101993,"about_ca_system_score_gemma":0.001488211,"threshold_uncertainty_score":0.9998889},"labels":[],"label_agreement":null},{"id":"W7099916623","doi":"","title":"Small Vessels of Opportunity Collections off Tofino, BC","year":2006,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Aerial survey; Synthetic aperture radar; Radar; Radar imaging; Aerial photography; 3D radar; Side looking airborne radar","score_opus":0.04245486425285959,"score_gpt":0.23801886823634308,"score_spread":0.1955640039834835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099916623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050784282,0.000064468775,0.7890704,0.0007905155,0.00050415116,0.00026158415,0.0000053853732,0.0003660033,0.15815318],"genre_scores_gemma":[0.7328062,0.000011268772,0.24632995,0.00027527905,0.0001680466,0.000025733474,0.0000059045096,0.000013157446,0.020364486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863756,0.00009898206,0.0003750254,0.0003854539,0.00023375328,0.0002692184],"domain_scores_gemma":[0.99854004,0.00021359009,0.00010788077,0.00079043885,0.00022969952,0.00011833533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035232372,0.00013912498,0.00022612988,0.00016116271,0.00016224716,0.00009966568,0.0007948376,0.00006767774,0.00022671818],"category_scores_gemma":[0.00007005796,0.00012833945,0.00010453181,0.0011141895,0.00008752742,0.00019274953,0.00039999973,0.00011099794,0.000023776265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019632402,0.0044662743,0.015860017,0.0001342458,0.00009765943,0.000102391634,0.00073321135,0.007103463,0.0051923646,0.6354164,0.12031307,0.21056128],"study_design_scores_gemma":[0.001697383,0.0008957679,0.12223088,0.00003328041,0.00004365277,0.0002001041,0.00010887817,0.4746523,0.03961109,0.27464637,0.084487446,0.0013928282],"about_ca_topic_score_codex":0.0019140915,"about_ca_topic_score_gemma":0.00058257114,"teacher_disagreement_score":0.6820219,"about_ca_system_score_codex":0.000062773935,"about_ca_system_score_gemma":0.00025139147,"threshold_uncertainty_score":0.5233531},"labels":[],"label_agreement":null},{"id":"W7100003138","doi":"","title":"in the United States &amp;amp; Canada Multi-Registry Cancer Incidence and Mortality Data in","year":2005,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Comparability; Cancer incidence; Incidence (geometry); Cancer; Data quality; Cancer registry; Quality (philosophy)","score_opus":0.08431882123114645,"score_gpt":0.3453859935001825,"score_spread":0.2610671722690361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100003138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9157163,0.00024237805,0.0759253,0.007579147,0.00015350162,0.00024092974,0.00004574797,0.000039386938,0.00005733168],"genre_scores_gemma":[0.933253,0.0000947215,0.062424336,0.0038983612,0.00006303474,0.000022952374,0.000052944357,0.0000058615615,0.00018477425],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980618,0.00020993763,0.00033541955,0.00063253776,0.00041525406,0.00034505484],"domain_scores_gemma":[0.99739844,0.00039604443,0.00007101655,0.0019911383,0.000062491614,0.00008089966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010696051,0.00016075502,0.00017676408,0.000081467064,0.00006427092,0.00015118167,0.0025138827,0.000043355198,0.000041046093],"category_scores_gemma":[0.00019659559,0.000116437666,0.000010403215,0.0008866693,0.00010248951,0.00062039704,0.001266097,0.00026210505,0.0000041251683],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005593855,0.00032582541,0.9283774,0.000050257313,0.00001807242,0.00007307109,0.0038983524,0.03711263,0.000027484324,0.0012793497,0.014215629,0.014616321],"study_design_scores_gemma":[0.00022724248,0.0000030972824,0.4439764,0.000010308779,0.00000196509,0.0000114140885,0.0000827633,0.53588885,0.000008431971,0.00030724073,0.019318663,0.00016359957],"about_ca_topic_score_codex":0.9673144,"about_ca_topic_score_gemma":0.99873847,"teacher_disagreement_score":0.49877623,"about_ca_system_score_codex":0.00024669853,"about_ca_system_score_gemma":0.000510317,"threshold_uncertainty_score":0.47481903},"labels":[],"label_agreement":null},{"id":"W7100055679","doi":"","title":"MADR2 Maps to 18q21 and Encodes a","year":2007,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Receptor; Ligand (biochemistry); Signal transduction; G protein-coupled receptor","score_opus":0.01094846954194762,"score_gpt":0.24935950637356405,"score_spread":0.23841103683161644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100055679","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05080983,0.00006448569,0.9281543,0.0016384686,0.00027545955,0.00016788658,6.9159245e-7,0.00027089615,0.018617999],"genre_scores_gemma":[0.48164594,0.0000022111822,0.5161365,0.001220006,0.00008343662,0.0000036097695,3.0189346e-7,0.0000049524556,0.0009030174],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99876535,0.00002518386,0.00018667208,0.00045634448,0.00022318536,0.00034327718],"domain_scores_gemma":[0.9989895,0.00019386235,0.000021613349,0.0005068142,0.00006404821,0.00022412621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007120902,0.00011720712,0.0001294379,0.00011464728,0.00007254357,0.00015703925,0.0005846345,0.000042355416,0.000036843634],"category_scores_gemma":[0.00005840285,0.0000989929,0.00003140937,0.00041255308,0.000038503527,0.00020676533,0.00072261976,0.00007509319,0.000120684235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008094747,0.00013320913,0.007150833,0.000015027108,0.000010705406,0.00006951469,0.0016529816,0.000048835238,0.0011278222,0.13955434,0.0037250023,0.8465036],"study_design_scores_gemma":[0.0016245367,0.0013872103,0.4144488,0.000049160124,0.000015259267,0.0005465786,0.0005419827,0.11995869,0.02535572,0.2749005,0.15897596,0.0021956016],"about_ca_topic_score_codex":0.0000955516,"about_ca_topic_score_gemma":0.0001727358,"teacher_disagreement_score":0.844308,"about_ca_system_score_codex":0.000038095375,"about_ca_system_score_gemma":0.000024948158,"threshold_uncertainty_score":0.40368134},"labels":[],"label_agreement":null},{"id":"W7100529792","doi":"","title":"by","year":2003,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Shrimp; Index (typography); Spring (device); Selection (genetic algorithm); Field survey","score_opus":0.007938708709766294,"score_gpt":0.20854228576185774,"score_spread":0.20060357705209145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100529792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023862792,0.00008297837,0.89848834,0.00058060343,0.00031378417,0.00006255574,2.7887788e-7,0.00025959744,0.097825594],"genre_scores_gemma":[0.55722463,0.0000034823015,0.4364795,0.0012039326,0.00002593869,0.0000073425886,5.2366113e-7,0.0000059707604,0.005048668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991932,0.000056886114,0.000106779786,0.00028877048,0.00015651128,0.0001978531],"domain_scores_gemma":[0.9993024,0.0000695162,0.000017024608,0.0005004917,0.000034914145,0.00007564429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022484886,0.000074499905,0.00007728662,0.000024013194,0.000047277837,0.00008926366,0.0005272772,0.000027959804,0.00019024998],"category_scores_gemma":[0.000050704315,0.000062043495,0.00003432359,0.00024628456,0.000022003669,0.00018238556,0.00011892561,0.000056267036,0.0002496463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.8152595e-7,0.00019481417,0.0016929389,0.000004294065,0.000007738024,0.0000077223485,0.0001696362,0.00004570734,0.00068254024,0.84375656,0.06613548,0.08730217],"study_design_scores_gemma":[0.00061501237,0.00019215069,0.0020502484,0.0000030649205,0.000003113209,0.00007525753,0.000029464576,0.09392674,0.024847507,0.18865949,0.6889352,0.00066271145],"about_ca_topic_score_codex":0.000015150815,"about_ca_topic_score_gemma":0.0000025450217,"teacher_disagreement_score":0.65509707,"about_ca_system_score_codex":0.00002415422,"about_ca_system_score_gemma":0.000028923909,"threshold_uncertainty_score":0.32087818},"labels":[],"label_agreement":null},{"id":"W7100982741","doi":"","title":"100Copyright © Canadian Academy of Oriental and Occidental Culture Industrial Cluster, Similarity, and External Economies","year":2014,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); China; Work (physics); Productivity","score_opus":0.019145723063063978,"score_gpt":0.238384781699,"score_spread":0.219239058635936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100982741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96244,0.00020481556,0.027692279,0.0045858556,0.0008008396,0.0004312985,0.000022304586,0.00009750679,0.0037250596],"genre_scores_gemma":[0.98257333,0.000013484628,0.015755955,0.0011830499,0.00028857487,0.0000037482844,0.0000017802963,0.000006702673,0.00017336337],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855816,0.000098920085,0.00031466392,0.0005189695,0.0001772386,0.00033202226],"domain_scores_gemma":[0.99916357,0.00011534367,0.0000911022,0.00020828232,0.000029782092,0.0003919005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004210133,0.00019439665,0.00027493434,0.00013747437,0.00015276228,0.00022086402,0.0005760226,0.00022137513,0.00005038719],"category_scores_gemma":[0.00004638785,0.00016404182,0.000046752128,0.00013201091,0.00021132718,0.0005609237,0.00068092,0.00028264348,0.0000051791253],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085669286,0.000296795,0.5276735,0.000109372646,0.0001470576,0.000024567202,0.0058612283,0.00017461681,0.00068387616,0.16452931,0.030025901,0.2703881],"study_design_scores_gemma":[0.008717133,0.0012582354,0.3006756,0.00012236777,0.000071339775,0.00090563775,0.0004082759,0.48178536,0.010057759,0.09842329,0.095471635,0.0021033762],"about_ca_topic_score_codex":0.011748366,"about_ca_topic_score_gemma":0.014926772,"teacher_disagreement_score":0.48161072,"about_ca_system_score_codex":0.000093448805,"about_ca_system_score_gemma":0.00006979021,"threshold_uncertainty_score":0.9948325},"labels":[],"label_agreement":null},{"id":"W7101027816","doi":"","title":"Ill Acknowledgments","year":2015,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"MEDLINE; Work (physics)","score_opus":0.05621985008243472,"score_gpt":0.274335779548781,"score_spread":0.2181159294663463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101027816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074776737,0.00007402077,0.8795999,0.0012272864,0.0014377722,0.000126036,3.671261e-7,0.00048411143,0.10957279],"genre_scores_gemma":[0.49078378,0.0000021384906,0.49930832,0.0015354598,0.0002752382,0.000014406524,0.0000013233215,0.000011162462,0.008068165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989154,0.00005045528,0.00014982012,0.0003512429,0.0002896536,0.00024343381],"domain_scores_gemma":[0.99872965,0.000046760182,0.000027645769,0.0006767863,0.00030019268,0.00021894538],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003543853,0.0001023922,0.000113162845,0.000053796633,0.000036515554,0.00011895106,0.0010251885,0.000038035847,0.000066617155],"category_scores_gemma":[0.00013243838,0.00008318139,0.000041406165,0.0003110497,0.000031594693,0.00035520975,0.00077241194,0.00007066812,0.0016300164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008034339,0.0008384831,0.011078481,0.000018875668,0.000043392065,0.00005964024,0.0031882334,0.00053124886,0.00016339595,0.17883566,0.14492431,0.66031027],"study_design_scores_gemma":[0.0015686343,0.00044154705,0.008909711,0.000010338192,0.0000064745986,0.000057031215,0.00012675083,0.6054748,0.0027522936,0.16096811,0.21890192,0.0007823571],"about_ca_topic_score_codex":0.000025091973,"about_ca_topic_score_gemma":0.000013311478,"teacher_disagreement_score":0.6595279,"about_ca_system_score_codex":0.000083619954,"about_ca_system_score_gemma":0.00008796208,"threshold_uncertainty_score":0.99914736},"labels":[],"label_agreement":null},{"id":"W7113906228","doi":"10.1007/978-3-031-99804-1_2","title":"A Brief Overview of Foundations and Advances in Programming with AI","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Applications of artificial intelligence; Computer programming; Expert system; Automated planning and scheduling","score_opus":0.026224654120781635,"score_gpt":0.2944704828003149,"score_spread":0.2682458286795333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7113906228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008058655,0.0075847115,0.66784525,0.00082610955,0.00012447783,0.00081202487,0.0000052299088,0.00014397736,0.32265016],"genre_scores_gemma":[0.0024291957,0.002719143,0.8524018,0.0008288655,0.000086634915,0.000092681075,0.000018945706,0.000038348233,0.14138438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986138,0.000019319054,0.00035698427,0.0005770408,0.00025795112,0.00017495232],"domain_scores_gemma":[0.9989013,0.0001900383,0.00014534035,0.00055654853,0.00015947146,0.0000472717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001945585,0.00023019715,0.00041447827,0.00022438797,0.000041573625,0.000109979585,0.00048857613,0.000096031334,0.000032963253],"category_scores_gemma":[0.000020259704,0.0001886692,0.00005555432,0.0001821994,0.00015017245,0.00041626245,0.00051395624,0.00020898145,0.0000018173643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015976482,0.000020373825,0.00012295175,0.00018537037,0.000009094218,0.0000045281004,0.000053037926,0.000014507727,9.295532e-8,0.555046,0.000016935584,0.4445255],"study_design_scores_gemma":[0.00067660445,0.000462611,0.00084017863,0.0018815526,0.000035632933,0.00003734608,0.00001222942,0.016269399,0.000009174747,0.30897683,0.67010254,0.0006959122],"about_ca_topic_score_codex":0.00007975552,"about_ca_topic_score_gemma":0.0011536194,"teacher_disagreement_score":0.6700856,"about_ca_system_score_codex":0.000052909618,"about_ca_system_score_gemma":0.00022882555,"threshold_uncertainty_score":0.76937073},"labels":[],"label_agreement":null},{"id":"W7116863534","doi":"10.64628/aam.dnh6myqhc","title":"How can Canada become a global AI powerhouse? By investing in mathematics","year":2025,"lang":"","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary; University of British Columbia","funders":"","keywords":"Government (linguistics); Key (lock)","score_opus":0.011804512951536655,"score_gpt":0.23746120760072803,"score_spread":0.22565669464919139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116863534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06805789,0.0013250852,0.7570333,0.14791659,0.0053984504,0.0017095396,0.00016663114,0.0004745961,0.017917948],"genre_scores_gemma":[0.92259526,0.0000123160935,0.063838646,0.007876225,0.00008182093,0.000028256669,0.0000051757243,0.000025403775,0.0055368813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99428964,0.00030104467,0.0012309753,0.0015733198,0.0010560611,0.0015489751],"domain_scores_gemma":[0.99649596,0.0006113283,0.00029329676,0.0017716915,0.00032972253,0.00049800583],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009591316,0.0007445463,0.0009857118,0.00020046384,0.00029673582,0.0015605275,0.0030818204,0.00025565983,0.00004771055],"category_scores_gemma":[0.0008579933,0.000771761,0.00014783513,0.0035485711,0.00025332972,0.00050358695,0.00266322,0.00069756276,0.000005150206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00002333785,0.0036814099,0.24114637,0.0025955592,0.00048281832,0.0010649852,0.005794357,0.00512246,0.00015081641,0.27198097,0.2127759,0.25518098],"study_design_scores_gemma":[0.001051749,0.00013145083,0.007504504,0.0003145542,0.00003313391,0.00006190781,0.00074759824,0.91808337,0.000255111,0.0635316,0.007160127,0.0011249084],"about_ca_topic_score_codex":0.76338345,"about_ca_topic_score_gemma":0.9706793,"teacher_disagreement_score":0.9129609,"about_ca_system_score_codex":0.0039397078,"about_ca_system_score_gemma":0.0075867204,"threshold_uncertainty_score":0.999884},"labels":[],"label_agreement":null},{"id":"W7153979123","doi":"10.1145/3772318.3809019","title":"10.1145/3772318.3809019","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Generative grammar; Generative model; Component (thermodynamics)","score_opus":0.006433923958321936,"score_gpt":0.17763441966372376,"score_spread":0.17120049570540183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7153979123","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008894317,0.000065518245,0.0036354607,0.0013698745,0.000022858096,0.00033145092,0.0000054036436,0.000745733,0.9929343],"genre_scores_gemma":[0.00042748498,2.2915519e-7,0.019822523,0.0002169017,0.00017250868,0.000018551256,0.0000031577329,0.000016573073,0.9793221],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99810594,0.00009444311,0.00027302574,0.00064966996,0.0003839129,0.0004930289],"domain_scores_gemma":[0.99833447,0.00013243116,0.000036208654,0.0011528848,0.000084554165,0.00025943053],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033664837,0.00021744693,0.00024604323,0.00010928385,0.00011678306,0.00020258954,0.0015538485,0.000074253025,0.9312076],"category_scores_gemma":[0.00004421252,0.00021294116,0.00010189774,0.00067346636,0.000045721765,0.000312656,0.00042659848,0.00014224998,0.9686408],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008877712,0.000088005116,6.9181124e-7,0.0000037620757,0.000007970189,0.000013954617,0.000048772486,0.00070900755,0.000017673307,0.00006353241,0.037331183,0.9617066],"study_design_scores_gemma":[0.00018588027,0.0002048828,0.00024872314,0.0000069876864,0.000004203455,0.000026746957,2.877227e-7,0.034503818,0.00006323108,0.00048338244,0.9639925,0.00027940716],"about_ca_topic_score_codex":0.000032595806,"about_ca_topic_score_gemma":2.6429484e-7,"teacher_disagreement_score":0.96142715,"about_ca_system_score_codex":0.00008082125,"about_ca_system_score_gemma":0.00006406667,"threshold_uncertainty_score":0.8683489},"labels":[],"label_agreement":null},{"id":"W7163300282","doi":"","title":"When Algorithms Rule, Values Can Wither","year":2022,"lang":"en","type":"article","venue":"VU Research Portal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"","score_opus":0.0726899668738104,"score_gpt":0.34964330361641427,"score_spread":0.27695333674260386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7163300282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45220637,0.003039923,0.27109846,0.04824521,0.008379217,0.0064316695,0.000450131,0.004192477,0.20595653],"genre_scores_gemma":[0.912247,0.000015934173,0.07410072,0.0004904283,0.0006655611,0.00050960795,0.000036949135,0.000070390524,0.011863433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99347216,0.00096959487,0.00037981392,0.0010632914,0.0029406862,0.0011744341],"domain_scores_gemma":[0.99725735,0.0003828881,0.00008100529,0.0015535535,0.00035530436,0.00036989193],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004323132,0.00022707756,0.00027943446,0.00047134454,0.0009947884,0.00036061005,0.003223346,0.0000595329,0.002122596],"category_scores_gemma":[0.00022012708,0.00021752623,0.0001375116,0.0014079543,0.00031506227,0.00033904542,0.0044572973,0.0011155197,0.00013135107],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083122926,0.0030007134,0.022218034,0.000109223474,0.00033433374,0.005478341,0.019633746,0.0030859644,0.0012128833,0.104190886,0.27589762,0.56475514],"study_design_scores_gemma":[0.0022205373,0.0029535396,0.032700863,0.0000306288,0.000016631786,0.00094813126,0.0029876616,0.38183045,0.0015829802,0.40517348,0.16768242,0.001872662],"about_ca_topic_score_codex":0.0012421019,"about_ca_topic_score_gemma":0.00009140867,"teacher_disagreement_score":0.5628825,"about_ca_system_score_codex":0.00023299702,"about_ca_system_score_gemma":0.0006625213,"threshold_uncertainty_score":0.9987896},"labels":[],"label_agreement":null},{"id":"W7165839929","doi":"10.53437/j4n1gz59","title":"Monotonicity restored: more never means purer","year":2019,"lang":"","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Monotonic function; Measure (data warehouse); Constraint (computer-aided design); Range (aeronautics); Ring (chemistry)","score_opus":0.015459545503532015,"score_gpt":0.24976313861184885,"score_spread":0.23430359310831683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7165839929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3513172,0.0007689536,0.58365214,0.014906257,0.009856912,0.0028447877,0.000020661235,0.00091399794,0.035719104],"genre_scores_gemma":[0.88723505,0.000056822253,0.0927322,0.0039538033,0.0005416273,0.00003400885,0.0000047412454,0.00005699448,0.015384779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919877,0.00045231346,0.001199291,0.0029256153,0.0017195764,0.0017154695],"domain_scores_gemma":[0.99299115,0.0004549303,0.00034755157,0.004905402,0.00061867153,0.0006823004],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014786276,0.00092937285,0.0010459326,0.00030091574,0.00031671397,0.0008543219,0.0044475505,0.0005433384,0.0037035854],"category_scores_gemma":[0.00016013201,0.00085504266,0.0006109608,0.001607469,0.00041174155,0.0025252926,0.0038728516,0.001046104,0.00465342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002172499,0.003991027,0.08924891,0.0005357765,0.0005946908,0.0003209262,0.014387199,0.04226711,0.001104032,0.24094453,0.02788134,0.5785072],"study_design_scores_gemma":[0.0010979403,0.00048073445,0.062710784,0.00004764729,0.000037263493,0.000059172988,0.00014156435,0.87530744,0.000772168,0.0073382347,0.050805695,0.0012013317],"about_ca_topic_score_codex":0.00094402104,"about_ca_topic_score_gemma":0.00009014752,"teacher_disagreement_score":0.83304036,"about_ca_system_score_codex":0.00062733237,"about_ca_system_score_gemma":0.00071420346,"threshold_uncertainty_score":0.99939},"labels":[],"label_agreement":null},{"id":"W73276164","doi":"","title":"Complexity Of Computing Of The Domination Number In Hereditary Classes Of Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Theoretical computer science; Computer science","score_opus":0.01675329425092998,"score_gpt":0.2472004153658352,"score_spread":0.23044712111490523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73276164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932927,0.000053873384,0.0030691614,0.00017747087,0.0016426028,0.00025963073,0.000005092586,0.000034814006,0.0014646385],"genre_scores_gemma":[0.9900555,0.0000012069966,0.009904798,0.0000126914965,0.000007850045,0.0000023090633,0.0000023512905,0.000006922602,0.00000638205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979862,0.00027040055,0.0007315713,0.00030303036,0.00048896734,0.00021986221],"domain_scores_gemma":[0.99805164,0.0004385635,0.00047029555,0.00070787163,0.000305123,0.000026493313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068705,0.00014928312,0.0003993796,0.00010976813,0.000050937913,0.000014269394,0.0011157084,0.0000799487,0.000007241398],"category_scores_gemma":[0.00009116,0.0001270711,0.00014745489,0.0011800345,0.0004204278,0.00020293554,0.0005940689,0.00016640328,0.0000012917974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055260634,0.00055139844,0.16826452,0.00007852239,0.000010152261,0.000002157845,0.00034387485,0.0004906146,0.00054720993,0.8281211,0.00019420662,0.0013906572],"study_design_scores_gemma":[0.0005034464,0.000038953982,0.44100764,0.00004175542,0.000003936752,0.00000437949,0.000023702547,0.018823076,0.0062398217,0.5332279,0.0000072594157,0.00007807949],"about_ca_topic_score_codex":0.0011800436,"about_ca_topic_score_gemma":0.00012110074,"teacher_disagreement_score":0.29489323,"about_ca_system_score_codex":0.000063842854,"about_ca_system_score_gemma":0.000085314736,"threshold_uncertainty_score":0.5181809},"labels":[],"label_agreement":null},{"id":"W96496641","doi":"","title":"Black-White Pebbling is PSPACE-Complete","year":2007,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PSPACE; PH; White (mutation); Completeness (order theory); Complexity class; Computational complexity theory; Computation; Discrete mathematics; Mathematics; Bounded function; Structural complexity theory; Combinatorics; Computer science; Model of computation; Theoretical computer science; Time complexity; Algorithm; Quantum complexity theory; Quantum computer; Physics","score_opus":0.03925007688016794,"score_gpt":0.290956658325877,"score_spread":0.25170658144570907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96496641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06751897,0.00013024156,0.9150711,0.006811895,0.00077137933,0.0008243652,0.000035145848,0.00087481743,0.007962082],"genre_scores_gemma":[0.8985184,0.0000049402415,0.097060025,0.0033457559,0.00045681832,0.000019938354,0.00005683532,0.00004874912,0.00048856385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99313915,0.00029507498,0.0010341918,0.0017274673,0.0018165963,0.0019875],"domain_scores_gemma":[0.99589074,0.0012756007,0.00041120322,0.0012886445,0.0006840288,0.00044977976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002381581,0.00069298275,0.0007001459,0.0006313536,0.0008004265,0.00046188178,0.0023188419,0.00018536231,0.00033431652],"category_scores_gemma":[0.00013061125,0.00074752764,0.0004126614,0.0021730382,0.0004585689,0.00053262245,0.00083283253,0.0010273628,0.00060128124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022417739,0.0009066731,0.0015182176,0.00005160555,0.00018300634,0.00006602396,0.0018501944,0.05556965,0.00021385758,0.91861975,0.0067358473,0.014060984],"study_design_scores_gemma":[0.0013885397,0.0008239856,0.036801852,0.000025686435,0.000016115475,0.00009496859,0.000051091174,0.5944611,0.0002344148,0.346275,0.018933296,0.00089397386],"about_ca_topic_score_codex":0.000066661436,"about_ca_topic_score_gemma":0.00022401042,"teacher_disagreement_score":0.8309994,"about_ca_system_score_codex":0.0013281946,"about_ca_system_score_gemma":0.0008511275,"threshold_uncertainty_score":0.9994976},"labels":[],"label_agreement":null}]}