{"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037708823,0.015131035,0.7106762,0.0034509425,0.0021491833,0.00022486976,0.0014978299,0.001330281,0.26176873],"genre_scores_gemma":[0.36321712,0.05169219,0.32857525,0.0045798607,0.0032408258,0.0011600703,0.004092516,0.00081137556,0.24263081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991222,0.00018547203,0.00004167662,0.00015436263,0.00036203317,0.00013415288],"domain_scores_gemma":[0.9986731,0.00057896733,0.00005483539,0.0002944462,0.0003502001,0.000048395017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067381316,0.00086566544,0.0006428687,0.0012401757,0.00087704026,0.0025342542,0.0010047044,0.001450805,0.016873138],"category_scores_gemma":[0.0028151388,0.00030565826,0.00058630196,0.0018060034,0.0020076109,0.002575977,0.0016525349,0.0018969154,0.005529273],"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.000040336,0.000013181021,0.0000662759,0.00018913191,0.000016234346,0.000086308275,0.00009941632,0.0054375716,0.001454018,0.8917362,0.03215537,0.06870595],"study_design_scores_gemma":[0.000040187795,0.000055029825,0.00016841888,0.00035012641,0.00003122566,0.00049273664,0.000057098605,0.027847005,0.0036444806,0.6770109,0.29023585,0.00006687597],"about_ca_topic_score_codex":0.0024369785,"about_ca_topic_score_gemma":0.0015066018,"teacher_disagreement_score":0.016873138,"about_ca_system_score_codex":0.0014433833,"about_ca_system_score_gemma":0.0016229849,"threshold_uncertainty_score":0.056446314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4671216,0.0006687338,0.51174366,0.0022659453,0.00008059406,0.00011738551,0.0006565527,0.0011113487,0.016234094],"genre_scores_gemma":[0.9529429,0.0002666194,0.042675056,0.00014322947,0.00011294879,0.00014064145,0.00034138656,0.000064651176,0.0033125123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978916,0.0005219211,0.000114036804,0.00054341543,0.00054610026,0.00038280274],"domain_scores_gemma":[0.99223787,0.0054610274,0.0006625104,0.00093494816,0.0003486194,0.00035514002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016311101,0.00060422544,0.0008987277,0.0005470807,0.0007061784,0.0027605994,0.0012944975,0.001359944,0.0026067607],"category_scores_gemma":[0.01195444,0.00037836045,0.00093734363,0.0006144884,0.002564786,0.004671049,0.0017225959,0.0025771484,0.0003754889],"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.0007009848,0.00016315607,0.0031581088,0.00029757974,0.00009561559,0.0006536583,0.00067557214,0.20422582,0.009593139,0.7442547,0.0021233698,0.034058362],"study_design_scores_gemma":[0.00006605297,0.00011076559,0.0008086178,0.000028393426,0.00003452237,0.0002862485,0.00009622022,0.4118818,0.0055569448,0.577156,0.003939016,0.000035430032],"about_ca_topic_score_codex":0.000838598,"about_ca_topic_score_gemma":0.00045380366,"teacher_disagreement_score":0.0027605994,"about_ca_system_score_codex":0.0012948008,"about_ca_system_score_gemma":0.0007036116,"threshold_uncertainty_score":0.0093945265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15259773,0.003970986,0.22909921,0.0025147253,0.0017540884,0.0023633707,0.22120634,0.21676958,0.169724],"genre_scores_gemma":[0.346621,0.0018911817,0.2528057,0.0007264039,0.00021243042,0.0030233753,0.3132149,0.020150455,0.06135459],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99094754,0.0018864466,0.0013389278,0.0010170406,0.0044964952,0.0003135433],"domain_scores_gemma":[0.97401154,0.007136105,0.0013824567,0.0034528638,0.013193897,0.00082309946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005953685,0.0009639211,0.0005767148,0.008128799,0.0007722861,0.00233754,0.0014110208,0.0011750517,0.027720701],"category_scores_gemma":[0.03493921,0.0003964308,0.0005570318,0.008060607,0.00041977494,0.0029104135,0.0016885037,0.0007966415,0.019322017],"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.0017699979,0.0009319782,0.019185131,0.0018595895,0.0001957137,0.00027821487,0.0008148953,0.0037226228,0.0086077945,0.012531305,0.26028866,0.68981403],"study_design_scores_gemma":[0.000568371,0.0010381228,0.060956225,0.0008692033,0.0002857297,0.0014980107,0.0014642627,0.06332848,0.041955225,0.011991237,0.81576234,0.00028284034],"about_ca_topic_score_codex":0.0061355764,"about_ca_topic_score_gemma":0.00392829,"teacher_disagreement_score":0.027720701,"about_ca_system_score_codex":0.0013911361,"about_ca_system_score_gemma":0.0024914546,"threshold_uncertainty_score":0.09273493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010487933,0.072725475,0.097861215,0.036696523,0.0045395144,0.000029770636,0.0003068388,0.00034607667,0.7770066],"genre_scores_gemma":[0.52598524,0.041988477,0.056779467,0.010847426,0.011579913,0.00027364536,0.0003508643,0.00062079565,0.3515742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994855,0.0001613059,0.000017614828,0.00014465104,0.00013858163,0.000052269417],"domain_scores_gemma":[0.9992304,0.0004850404,0.00003980645,0.00011453238,0.00007713974,0.000053078333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010175457,0.00065089006,0.00053965655,0.0009159179,0.0016416385,0.005016242,0.0009904277,0.001730536,0.0094299],"category_scores_gemma":[0.002731032,0.00034292627,0.00044776697,0.0011823435,0.010343463,0.011406837,0.0013768767,0.003734737,0.0018262637],"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.0000038029782,0.0000012755924,0.000011416374,0.0000111183135,0.000001122988,0.000003998469,0.000075792595,0.000077337536,0.00003501726,0.99392915,0.003401492,0.002448389],"study_design_scores_gemma":[0.0000031148247,0.000003170255,0.000033986278,0.00001843398,0.0000017624274,0.000034482062,0.000055689427,0.00034749196,0.000050918043,0.93976337,0.059683826,0.000003777171],"about_ca_topic_score_codex":0.0017396532,"about_ca_topic_score_gemma":0.0016177378,"teacher_disagreement_score":0.0094299,"about_ca_system_score_codex":0.002318445,"about_ca_system_score_gemma":0.00075045164,"threshold_uncertainty_score":0.031546175},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062819766,0.08569594,0.3367283,0.032749023,0.06276001,0.0005286404,0.004574753,0.007110742,0.46357056],"genre_scores_gemma":[0.08290168,0.100190155,0.23898557,0.008944639,0.032141272,0.0010140076,0.01919714,0.0035390032,0.51308644],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964187,0.0008535602,0.00034639103,0.000637271,0.0014838305,0.00026021467],"domain_scores_gemma":[0.9963212,0.0010340728,0.000110737325,0.0009403306,0.0012362441,0.00035744114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027275807,0.0016018312,0.0021739977,0.001991192,0.0016388156,0.0103500895,0.002290418,0.0023177036,0.104702115],"category_scores_gemma":[0.007561079,0.00064783834,0.0019048806,0.002336098,0.0022079863,0.0065567414,0.004000491,0.00541484,0.04182856],"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.00017945486,0.00008267564,0.0004056275,0.00051928964,0.00011564529,0.00019178678,0.00040532553,0.0028692698,0.0018291515,0.24608879,0.54443806,0.20287496],"study_design_scores_gemma":[0.000024721425,0.000028049935,0.00018294851,0.00020140811,0.000028011897,0.00019018211,0.000073536445,0.005185922,0.0006850857,0.074461564,0.918913,0.000025658432],"about_ca_topic_score_codex":0.0018822567,"about_ca_topic_score_gemma":0.0016539815,"teacher_disagreement_score":0.104702115,"about_ca_system_score_codex":0.0024281878,"about_ca_system_score_gemma":0.00393095,"threshold_uncertainty_score":0.35026348},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00803664,0.17634338,0.27113563,0.07199777,0.13053405,0.00092798227,0.00650319,0.005437913,0.32908338],"genre_scores_gemma":[0.08314333,0.16828306,0.12532762,0.018038983,0.058650352,0.0016675345,0.01884925,0.003510917,0.5225289],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99660325,0.0010221374,0.0002758672,0.0005096006,0.0013424779,0.00024670374],"domain_scores_gemma":[0.992304,0.0028382305,0.00023164529,0.0017039957,0.0016684347,0.0012537533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004296941,0.0018200384,0.0034097056,0.0020149518,0.0019253999,0.007538752,0.002521405,0.0021644456,0.10521018],"category_scores_gemma":[0.012561671,0.0008653236,0.0014137169,0.002457964,0.0023177566,0.007673071,0.0040730014,0.008005902,0.033625297],"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.00025085415,0.00014482687,0.001034324,0.00055956503,0.00020926076,0.00018232736,0.00033322113,0.0010276368,0.0009798656,0.07151004,0.7642097,0.15955842],"study_design_scores_gemma":[0.000038010792,0.000056091354,0.00048683942,0.00027604026,0.000069481765,0.00021743898,0.000097152224,0.0030289593,0.0003145025,0.05425812,0.94112724,0.000030139148],"about_ca_topic_score_codex":0.0020501092,"about_ca_topic_score_gemma":0.003045975,"teacher_disagreement_score":0.10521018,"about_ca_system_score_codex":0.0026976655,"about_ca_system_score_gemma":0.0036270183,"threshold_uncertainty_score":0.3519631},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037215024,0.030774143,0.5336132,0.07440255,0.010706326,0.0003251493,0.0025096005,0.002629172,0.30782473],"genre_scores_gemma":[0.48671713,0.027743632,0.38110638,0.01724207,0.020124324,0.00060053496,0.003194729,0.0019261685,0.06134497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995181,0.0012784488,0.00025709643,0.0010066606,0.0018145684,0.00046218082],"domain_scores_gemma":[0.9462191,0.044198144,0.0006603364,0.0058670435,0.0019547795,0.0011006347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042905686,0.0014335923,0.0018780901,0.0032046882,0.0041894154,0.009522711,0.0039435877,0.0025823617,0.023564478],"category_scores_gemma":[0.036258608,0.0009780402,0.0025775651,0.006177025,0.009848368,0.025441656,0.007303127,0.014231072,0.004349269],"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.00023257396,0.00008782646,0.0009571867,0.0004727853,0.00008318241,0.00036044884,0.00038125052,0.0049828617,0.001336297,0.870113,0.07097569,0.05001693],"study_design_scores_gemma":[0.00002000626,0.000020895417,0.00034417768,0.00006846863,0.000026353693,0.00014223784,0.00009665002,0.0075218775,0.00073085044,0.9649128,0.02608126,0.000034431047],"about_ca_topic_score_codex":0.008887159,"about_ca_topic_score_gemma":0.010242984,"teacher_disagreement_score":0.023564478,"about_ca_system_score_codex":0.004391177,"about_ca_system_score_gemma":0.002781991,"threshold_uncertainty_score":0.07883108},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12560089,0.019965094,0.34265453,0.0077278283,0.0008346321,0.00009124531,0.0011775644,0.00080085295,0.50114745],"genre_scores_gemma":[0.8526847,0.006135808,0.058443826,0.0011067993,0.00087012973,0.00011915623,0.0008354762,0.00024476447,0.07955935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985454,0.00044418845,0.0001067784,0.00036185267,0.00033804937,0.00020369446],"domain_scores_gemma":[0.99571335,0.0026711572,0.00032269198,0.000606968,0.00042740858,0.00025837575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014679212,0.00049926917,0.00068426196,0.0016428377,0.0018110996,0.00408966,0.000936691,0.0007846858,0.014846072],"category_scores_gemma":[0.0062104114,0.00049153465,0.000853079,0.0025304998,0.0048887474,0.008699164,0.0030518118,0.0024230487,0.002085897],"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.000017848126,0.000007549967,0.00024282654,0.000039113074,0.000008326892,0.000043915956,0.00015318733,0.0004133464,0.0001352646,0.98844856,0.0024576895,0.008032366],"study_design_scores_gemma":[0.0000066377584,0.00000617049,0.00020798302,0.0000208344,0.000011208618,0.00014496062,0.000083711675,0.0011248922,0.00020699088,0.9821268,0.01605367,0.0000061868827],"about_ca_topic_score_codex":0.002461337,"about_ca_topic_score_gemma":0.0030761259,"teacher_disagreement_score":0.014846072,"about_ca_system_score_codex":0.0016480138,"about_ca_system_score_gemma":0.0007764502,"threshold_uncertainty_score":0.049665034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24889061,0.0035367217,0.43434584,0.04707644,0.0031157942,0.0003144298,0.0023391857,0.0042744675,0.2561066],"genre_scores_gemma":[0.8602511,0.0015992374,0.085565515,0.003941559,0.0015316828,0.00034474712,0.0019484558,0.0014535271,0.043364123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967912,0.0010861682,0.00016377073,0.00061232847,0.0006793282,0.0006672634],"domain_scores_gemma":[0.99080175,0.0053121587,0.00027266188,0.0026558817,0.0005941086,0.00036350358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018255875,0.0008018348,0.0020510782,0.0009366575,0.002612763,0.005739216,0.002244055,0.0030750453,0.024312956],"category_scores_gemma":[0.021040725,0.00074965326,0.0020720107,0.0012561824,0.0041728374,0.014858825,0.0038433322,0.0047272854,0.0058242353],"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.00013135023,0.00009029101,0.00016647525,0.00013831114,0.000031190528,0.00005281108,0.00016039416,0.004106557,0.0006105336,0.96839595,0.011037322,0.015078865],"study_design_scores_gemma":[0.000018257904,0.000008695797,0.00004547538,0.000015960803,0.000012271017,0.000022224605,0.000041941174,0.005663271,0.00036710317,0.9904096,0.0033858565,0.0000093595445],"about_ca_topic_score_codex":0.0014016497,"about_ca_topic_score_gemma":0.0015612036,"teacher_disagreement_score":0.024312956,"about_ca_system_score_codex":0.0012994448,"about_ca_system_score_gemma":0.0027479304,"threshold_uncertainty_score":0.08133489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045130678,0.00927864,0.88230014,0.0024818522,0.0007433052,0.00063213514,0.0028213533,0.0031042434,0.053507697],"genre_scores_gemma":[0.53651905,0.0039234827,0.44003963,0.00077369803,0.0009457595,0.0025206378,0.0032875487,0.001499923,0.010490266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97929746,0.007455748,0.0022871862,0.0021234385,0.008114639,0.0007215003],"domain_scores_gemma":[0.94047034,0.034032222,0.007773889,0.008638425,0.00671761,0.0023674937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014593786,0.002197136,0.0017602971,0.012383114,0.0020027575,0.007094104,0.0034267125,0.0035961866,0.0067550023],"category_scores_gemma":[0.12372929,0.00074576953,0.0016945233,0.008212237,0.006621158,0.01862199,0.005650408,0.003024516,0.0041337814],"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.00068795634,0.00023950399,0.01852299,0.0018612689,0.00032885792,0.00020823586,0.0032744291,0.026986947,0.0060774437,0.5120685,0.02787812,0.40186575],"study_design_scores_gemma":[0.000060473405,0.00076065393,0.024452385,0.00050053076,0.00012635128,0.0010029798,0.0011656849,0.06452852,0.008783415,0.83972,0.058522254,0.00037669396],"about_ca_topic_score_codex":0.0011869362,"about_ca_topic_score_gemma":0.00086558214,"teacher_disagreement_score":0.014593786,"about_ca_system_score_codex":0.002027201,"about_ca_system_score_gemma":0.0016973685,"threshold_uncertainty_score":0.07718021},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05610715,0.013620798,0.27736342,0.011205919,0.0016366091,0.00005638891,0.00078108045,0.0008875652,0.63834107],"genre_scores_gemma":[0.7833547,0.010388516,0.06793556,0.0044006817,0.0019960192,0.00027278575,0.001144491,0.0007092136,0.129798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990722,0.00027947902,0.00006474628,0.00016040042,0.00029685037,0.00012637525],"domain_scores_gemma":[0.9965952,0.0021807966,0.0001845652,0.00044545947,0.00037070818,0.00022324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018022166,0.0007571425,0.0006483467,0.0022431016,0.002151114,0.0032971294,0.0011630772,0.0010220605,0.015039691],"category_scores_gemma":[0.006024244,0.0004881686,0.00089892297,0.0014875833,0.0052663274,0.0129871,0.003850523,0.003773131,0.0036467095],"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.000013125469,0.000008449906,0.000073699885,0.000035269444,0.0000041087287,0.00003095862,0.000101414305,0.00019263911,0.0001143685,0.9926603,0.002979972,0.0037856332],"study_design_scores_gemma":[0.000005419926,0.0000030992032,0.00008701697,0.00002042979,0.0000041071085,0.000057314028,0.000034837754,0.0006865566,0.00015604953,0.9920655,0.006874674,0.000004990832],"about_ca_topic_score_codex":0.0010159527,"about_ca_topic_score_gemma":0.0017601515,"teacher_disagreement_score":0.015039691,"about_ca_system_score_codex":0.001895411,"about_ca_system_score_gemma":0.00066656125,"threshold_uncertainty_score":0.050312757},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074577387,0.009369729,0.085916966,0.0073701823,0.0016874409,0.000044537966,0.00015812973,0.00025786224,0.8877375],"genre_scores_gemma":[0.3567637,0.013199914,0.07494793,0.0036841028,0.0036622686,0.00036603742,0.0005105216,0.000769421,0.5460961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942565,0.00018258774,0.000032801647,0.000118028125,0.00018374815,0.000057336372],"domain_scores_gemma":[0.99928826,0.00039177306,0.000026965175,0.00017693582,0.00008922008,0.000026925038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081554934,0.000773957,0.00068143406,0.0013763051,0.0013969749,0.002534992,0.0009799028,0.0010730256,0.029379642],"category_scores_gemma":[0.0023531578,0.00043185955,0.00090975995,0.0012109956,0.007298137,0.008110055,0.0023126944,0.0045371717,0.0057293884],"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.000004546951,0.0000029831583,0.000011735956,0.000029423209,0.0000015656104,0.0000069343705,0.000072652074,0.00013908053,0.00007321205,0.9884143,0.003589973,0.007653666],"study_design_scores_gemma":[0.0000030221072,0.0000027792728,0.000021070113,0.000016416105,0.0000014686216,0.000022236993,0.000012839626,0.00026338937,0.00009851307,0.9638028,0.035753123,0.000002220708],"about_ca_topic_score_codex":0.0006749951,"about_ca_topic_score_gemma":0.00075905985,"teacher_disagreement_score":0.029379642,"about_ca_system_score_codex":0.0020478843,"about_ca_system_score_gemma":0.00058282365,"threshold_uncertainty_score":0.09828466},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10347797,0.024225613,0.47997794,0.013851992,0.00094537577,0.00008306246,0.0011124281,0.00025866617,0.37606695],"genre_scores_gemma":[0.92583966,0.013834677,0.028040208,0.00056672207,0.001586932,0.00018266511,0.0005259418,0.00009500929,0.02932822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920696,0.00017382605,0.000032548294,0.000121433965,0.00039684094,0.000068347465],"domain_scores_gemma":[0.9963301,0.0030909355,0.0001381619,0.00017593976,0.00019581168,0.00006906432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005858266,0.0005106664,0.00067572977,0.0008483528,0.000659231,0.0025013743,0.00076081813,0.00087180495,0.0069886],"category_scores_gemma":[0.0054356805,0.00033779306,0.0004343851,0.0010425518,0.001545484,0.0036480383,0.0010933143,0.0021232602,0.0004530788],"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.000026396725,0.000025733581,0.00028606504,0.0001218,0.000017902785,0.00007627088,0.00012372929,0.069061056,0.00052356086,0.9018142,0.0054190485,0.022504259],"study_design_scores_gemma":[0.00000467841,0.0000070989754,0.0003038241,0.000022600036,0.0000071817244,0.000047202888,0.000030734842,0.12009059,0.00015351984,0.8746414,0.0046835085,0.0000076252327],"about_ca_topic_score_codex":0.0019792165,"about_ca_topic_score_gemma":0.001029011,"teacher_disagreement_score":0.0069886,"about_ca_system_score_codex":0.001674534,"about_ca_system_score_gemma":0.00085697585,"threshold_uncertainty_score":0.023379266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24782193,0.00476311,0.57722807,0.029887248,0.00062627747,0.00038432554,0.00064188853,0.00059283373,0.13805433],"genre_scores_gemma":[0.8863009,0.0018126969,0.09691501,0.0023481955,0.00059461413,0.00038734847,0.00045219355,0.00017262655,0.011016383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98856014,0.0057888757,0.0007361306,0.0017649654,0.002427471,0.0007223839],"domain_scores_gemma":[0.94124913,0.048815187,0.0030595234,0.0034372094,0.0022933423,0.001145595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012891225,0.0008717876,0.0013135249,0.0030334305,0.0022593183,0.0061930837,0.002422477,0.0023127242,0.007865178],"category_scores_gemma":[0.06008698,0.0011771191,0.002512559,0.002178724,0.012746298,0.018844318,0.009512826,0.0068697254,0.0007741761],"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.00004108575,0.000017804614,0.00027887357,0.000093452196,0.000023712231,0.00004788975,0.0002183029,0.0032477134,0.00033567077,0.99053836,0.00057153724,0.004585508],"study_design_scores_gemma":[0.0000273281,0.000028905879,0.00012080098,0.00003117903,0.000023515287,0.000068627596,0.00012254907,0.010281072,0.0004652889,0.986014,0.0028026775,0.000014069675],"about_ca_topic_score_codex":0.00075999426,"about_ca_topic_score_gemma":0.0006787847,"teacher_disagreement_score":0.012891225,"about_ca_system_score_codex":0.0029314682,"about_ca_system_score_gemma":0.0015099641,"threshold_uncertainty_score":0.06817609},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012920814,0.012372796,0.8711405,0.016811727,0.0010153527,0.000061611536,0.00018904333,0.00067075714,0.08481753],"genre_scores_gemma":[0.5618748,0.013605995,0.39087024,0.00505727,0.0026411277,0.00071679277,0.0003969726,0.0009850798,0.023851667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974239,0.0013297829,0.00018199679,0.00036891925,0.00045394592,0.00024143673],"domain_scores_gemma":[0.9954418,0.0031463674,0.00022913406,0.0005068329,0.0004675275,0.00020832852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030362858,0.0012696553,0.00096879574,0.0029382661,0.0018437075,0.008479187,0.0024684442,0.0032700282,0.007980437],"category_scores_gemma":[0.00759029,0.0012788696,0.0012109218,0.0028390219,0.02077787,0.024334922,0.0034062008,0.008459159,0.0015314529],"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.0000029235023,0.0000035659102,0.000018709175,0.000039913433,0.0000021914927,0.000016033173,0.0002488858,0.00021656534,0.00007213307,0.99653566,0.00049077935,0.0023526032],"study_design_scores_gemma":[0.0000057552716,0.000005336917,0.000024376757,0.000041310348,0.0000043140935,0.00003156874,0.0001338661,0.0010698288,0.0001902902,0.9877835,0.010704198,0.0000057033267],"about_ca_topic_score_codex":0.0019360174,"about_ca_topic_score_gemma":0.0010549271,"teacher_disagreement_score":0.008479187,"about_ca_system_score_codex":0.0030111207,"about_ca_system_score_gemma":0.0018632928,"threshold_uncertainty_score":0.026697218},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7167396,0.00022412372,0.27568197,0.00022061849,0.00008552386,0.000037600745,0.00035240952,0.0008687742,0.0057894094],"genre_scores_gemma":[0.96573514,0.00006352318,0.032655247,0.000028441498,0.000029682617,0.000019487248,0.0002524948,0.000083780724,0.001132145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999684,0.00006773048,0.000019572082,0.000070409085,0.000102493475,0.000055892335],"domain_scores_gemma":[0.9981627,0.001236949,0.00013489112,0.00019342726,0.00016998693,0.00010199872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044328903,0.00030391885,0.00055977545,0.0008855547,0.000374219,0.0015450176,0.0007297119,0.0006456185,0.0027277377],"category_scores_gemma":[0.0039210613,0.00029770035,0.00039341464,0.00058519124,0.00079421635,0.0029626004,0.0011788124,0.00065667817,0.00024374128],"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.0022451796,0.00029241334,0.007982941,0.00042676172,0.00013372583,0.0007058657,0.00087850465,0.16566728,0.10257622,0.5311101,0.003103295,0.18487766],"study_design_scores_gemma":[0.000037368827,0.00010890065,0.0026167133,0.000026860725,0.000029178796,0.00015990362,0.00015654722,0.6056289,0.039795484,0.35051262,0.0008873005,0.000040311734],"about_ca_topic_score_codex":0.00052855216,"about_ca_topic_score_gemma":0.00082843547,"teacher_disagreement_score":0.0027277377,"about_ca_system_score_codex":0.00065497996,"about_ca_system_score_gemma":0.0002671874,"threshold_uncertainty_score":0.009125233},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46053883,0.002130382,0.36871257,0.0029823082,0.00038792033,0.00021897985,0.0010617239,0.0017533414,0.16221389],"genre_scores_gemma":[0.93859476,0.0004900664,0.03944442,0.00028874376,0.00012764642,0.00016267136,0.00097275816,0.0002656108,0.019653294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990073,0.00026729694,0.000062066094,0.0002564228,0.00026551972,0.00014138327],"domain_scores_gemma":[0.9954568,0.003240926,0.00019307241,0.00057202246,0.0002948535,0.00024222687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086401164,0.00066050724,0.0011748166,0.0023051053,0.0015867793,0.0046165106,0.0016722422,0.0014309067,0.0074900854],"category_scores_gemma":[0.004282088,0.0007877996,0.001344797,0.0024929494,0.0041610817,0.007596485,0.002827364,0.0037243618,0.0006935909],"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.000020184363,0.000009066848,0.00017128115,0.000040545143,0.0000049493256,0.000039050905,0.00026349621,0.0012048894,0.00046095828,0.9936941,0.0006230163,0.0034683773],"study_design_scores_gemma":[0.000008167583,0.0000041303556,0.000082892555,0.000011575487,0.0000055300898,0.000030098925,0.000063412255,0.0019309404,0.0003349868,0.9960788,0.0014441092,0.0000054230454],"about_ca_topic_score_codex":0.0016085084,"about_ca_topic_score_gemma":0.0021102931,"teacher_disagreement_score":0.0074900854,"about_ca_system_score_codex":0.0026999807,"about_ca_system_score_gemma":0.0009719687,"threshold_uncertainty_score":0.025056899},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068932665,0.2461557,0.31113243,0.012563834,0.034107573,0.00044060274,0.004619867,0.013171804,0.37091494],"genre_scores_gemma":[0.0150001,0.09838328,0.0936852,0.0010809592,0.0031655023,0.0001812001,0.005945781,0.0027010597,0.779857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999159,0.00009502496,0.000049591268,0.00015869735,0.00045950827,0.00007825692],"domain_scores_gemma":[0.9980903,0.00026855842,0.00003496299,0.00023657201,0.001161049,0.00020849571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015959267,0.0024799658,0.0021490813,0.0018251141,0.001773714,0.0063919052,0.001984671,0.0014995479,0.06574414],"category_scores_gemma":[0.0021450785,0.001196588,0.00079620775,0.0050836727,0.001423685,0.0037479748,0.0013961046,0.0034172337,0.03523316],"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.00009542776,0.00007309259,0.00026188092,0.0003715555,0.000032304797,0.000042700773,0.00011394705,0.0015817508,0.0009911458,0.010616653,0.7751146,0.21070498],"study_design_scores_gemma":[0.00004002394,0.000049073304,0.0011431435,0.00029843612,0.00005672941,0.00033522886,0.00012982346,0.010611253,0.0014626809,0.012837494,0.97300273,0.000033510565],"about_ca_topic_score_codex":0.06046055,"about_ca_topic_score_gemma":0.12500615,"teacher_disagreement_score":0.93953943,"about_ca_system_score_codex":0.004072019,"about_ca_system_score_gemma":0.006565947,"threshold_uncertainty_score":0.21993601},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065673697,0.0024588448,0.826089,0.00618287,0.0006437588,0.000050601877,0.0002763092,0.00019347652,0.1575377],"genre_scores_gemma":[0.70321023,0.004559799,0.21776342,0.0022022342,0.0024282343,0.0003188758,0.00044403996,0.00023652405,0.06883665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866533,0.00055489736,0.000104617895,0.00014963829,0.00041638062,0.00010905298],"domain_scores_gemma":[0.9970663,0.0016605825,0.00016094293,0.0006000358,0.00035545096,0.00015660223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001895607,0.0007854021,0.0006655837,0.0023553898,0.0015212833,0.0034245441,0.0020890206,0.0016962029,0.012318207],"category_scores_gemma":[0.0060892277,0.0005954241,0.000989059,0.0023167448,0.0062461197,0.01056008,0.0034683954,0.0035820603,0.0012767524],"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":[9.374052e-7,8.347168e-7,0.0000077441555,0.0000071698405,8.544106e-7,0.0000069598923,0.000035458896,0.0005307866,0.000022585004,0.99782676,0.00034629068,0.0012135578],"study_design_scores_gemma":[9.744832e-7,0.0000020699417,0.000010277151,0.000004905057,0.0000013654002,0.000018726645,0.000013401338,0.0036295694,0.000042474738,0.9923483,0.003925464,0.000002579959],"about_ca_topic_score_codex":0.0015411056,"about_ca_topic_score_gemma":0.0012822212,"teacher_disagreement_score":0.012318207,"about_ca_system_score_codex":0.002410145,"about_ca_system_score_gemma":0.0007897305,"threshold_uncertainty_score":0.041208446},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007282154,0.15142483,0.33004093,0.06289097,0.1273173,0.0010859416,0.008063074,0.0064032776,0.30549154],"genre_scores_gemma":[0.093951486,0.14652725,0.16025685,0.023514599,0.0699941,0.00257831,0.024422359,0.005055575,0.4736995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938368,0.0020376213,0.00057412643,0.0010684496,0.0020310339,0.0004520003],"domain_scores_gemma":[0.98732156,0.0054476415,0.0003985171,0.0028473688,0.0023605505,0.0016242829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058745043,0.0020530957,0.0038253283,0.0019688294,0.0016924718,0.008495379,0.0028214254,0.0026567373,0.14622411],"category_scores_gemma":[0.016554862,0.0011314404,0.0017160657,0.0026423791,0.0023700679,0.0074660406,0.0042634727,0.009107856,0.056924205],"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.00022740437,0.00013384511,0.00085786235,0.000878067,0.00024989704,0.00016548547,0.00026089099,0.0015632119,0.0012752932,0.072075546,0.7434274,0.17888509],"study_design_scores_gemma":[0.000050758383,0.00007896981,0.0005886441,0.0003837743,0.000066922774,0.00025494274,0.00009930656,0.004024819,0.00035843888,0.06127848,0.93277276,0.000042135274],"about_ca_topic_score_codex":0.0013267847,"about_ca_topic_score_gemma":0.0014386832,"teacher_disagreement_score":0.14622411,"about_ca_system_score_codex":0.002746291,"about_ca_system_score_gemma":0.0036602495,"threshold_uncertainty_score":0.4891684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012065096,0.001301092,0.928419,0.0028250227,0.0004699381,0.00010893588,0.0008136297,0.0028755313,0.051121816],"genre_scores_gemma":[0.36266518,0.0036783277,0.54239595,0.0021140766,0.0011324603,0.0007526468,0.0033076156,0.0030100273,0.0809438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645776,0.0007762614,0.0003493963,0.0007317722,0.0013523006,0.00033251286],"domain_scores_gemma":[0.9914083,0.005937915,0.00024289604,0.0016259464,0.00060999976,0.00017499033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025243065,0.0016522212,0.0013718794,0.0014949818,0.0015983279,0.007250394,0.0029776334,0.0021418168,0.011054871],"category_scores_gemma":[0.011706071,0.0022035555,0.0023419433,0.0025880102,0.004683549,0.023207061,0.005422274,0.010998022,0.003190229],"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.000046500845,0.000025824836,0.00013129025,0.00025167406,0.000012811267,0.00004432333,0.0003091502,0.0014223865,0.0012404572,0.960357,0.0043666638,0.03179189],"study_design_scores_gemma":[0.000019792808,0.000010572859,0.0000717958,0.000060969225,0.000015818534,0.00008040273,0.000043619304,0.003148606,0.002085218,0.9754087,0.019041626,0.0000128907195],"about_ca_topic_score_codex":0.0006912298,"about_ca_topic_score_gemma":0.0007551584,"teacher_disagreement_score":0.011054871,"about_ca_system_score_codex":0.00259708,"about_ca_system_score_gemma":0.0018450998,"threshold_uncertainty_score":0.03698224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3918703,0.0006543382,0.5437192,0.0010380138,0.000083066014,0.00020592335,0.0006806332,0.0017233696,0.060025267],"genre_scores_gemma":[0.96324944,0.00021843654,0.02845101,0.00014136476,0.00006954758,0.000071857285,0.0003466507,0.00012993744,0.0073216674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745053,0.00045737013,0.00016602413,0.0007022064,0.0006470706,0.0005767899],"domain_scores_gemma":[0.9937402,0.0028889205,0.00044867152,0.001634989,0.0006710807,0.0006162195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001656235,0.0005880749,0.00076913537,0.0012476447,0.001260059,0.0025474837,0.0013222231,0.00058512157,0.0063552335],"category_scores_gemma":[0.005780282,0.0007696966,0.0013328984,0.00084493984,0.003750158,0.007364257,0.00695501,0.002201932,0.00072008726],"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.00014209573,0.00006013196,0.0026047097,0.00013534517,0.0000419545,0.00026624842,0.0009980807,0.01319831,0.008859703,0.9590696,0.0011642758,0.0134594375],"study_design_scores_gemma":[0.000052201238,0.0000855402,0.0015129329,0.000062782514,0.00010937598,0.00031124995,0.00046531178,0.04501451,0.020926446,0.9089303,0.022481687,0.000047600348],"about_ca_topic_score_codex":0.0031001447,"about_ca_topic_score_gemma":0.0024878925,"teacher_disagreement_score":0.0063552335,"about_ca_system_score_codex":0.0018412197,"about_ca_system_score_gemma":0.0010258006,"threshold_uncertainty_score":0.021260321},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01635614,0.10852346,0.16649984,0.018991021,0.0066668107,0.00013693367,0.0008470727,0.0011287982,0.6808499],"genre_scores_gemma":[0.21606833,0.106827036,0.12610324,0.0043731066,0.005967062,0.00039491506,0.0015295006,0.0009908872,0.53774595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981314,0.000049223054,0.000011256147,0.00003621973,0.00007723414,0.0000129894715],"domain_scores_gemma":[0.99945277,0.00030132334,0.00003229152,0.00009483712,0.00007862979,0.000040170355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024907882,0.0006657966,0.0007179727,0.00203192,0.00082183053,0.0029305832,0.0008658873,0.0006361676,0.015369743],"category_scores_gemma":[0.0011677293,0.0004309412,0.00035917514,0.004901376,0.0022048643,0.0065312255,0.00091623253,0.0014809191,0.0031835125],"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.000006518896,0.000011897697,0.00008975951,0.00016935769,0.00000846308,0.000024524541,0.00017799386,0.000850563,0.00023573477,0.87723154,0.05594924,0.06524437],"study_design_scores_gemma":[0.0000030529745,0.000003349882,0.00007659921,0.000035437748,0.000004553845,0.000073819596,0.00006334407,0.0006841496,0.00008952314,0.9054803,0.09348248,0.0000032907649],"about_ca_topic_score_codex":0.001346152,"about_ca_topic_score_gemma":0.0024881125,"teacher_disagreement_score":0.015369743,"about_ca_system_score_codex":0.0010633852,"about_ca_system_score_gemma":0.0007338945,"threshold_uncertainty_score":0.051416934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014967976,0.00057202735,0.78405994,0.0057165106,0.0007889227,0.00021607435,0.00040877107,0.009681976,0.18358783],"genre_scores_gemma":[0.121526346,0.001128295,0.790767,0.002157363,0.00028990084,0.0002370739,0.0010411246,0.0032742387,0.079578646],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992267,0.00023117189,0.000042504278,0.00014543791,0.00027565175,0.000078568235],"domain_scores_gemma":[0.9979505,0.0012274536,0.00006499003,0.00016665633,0.00038187948,0.00020862123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014875578,0.0007472774,0.00022077806,0.0006422143,0.00082334015,0.0025518602,0.0014853517,0.0008285792,0.024044588],"category_scores_gemma":[0.0064374986,0.00055355264,0.00042676687,0.00054943305,0.00082409254,0.002996062,0.0016490176,0.0033720103,0.010696175],"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.0001693019,0.00036331613,0.00086408434,0.00020622548,0.0000140022175,0.00013975275,0.0009373425,0.006908338,0.004541402,0.12679309,0.16074724,0.6983159],"study_design_scores_gemma":[0.00014642018,0.00008758879,0.0006760026,0.00036319872,0.00003252998,0.00029580976,0.00077245815,0.086821474,0.0222242,0.32983574,0.55868816,0.00005645243],"about_ca_topic_score_codex":0.0027972043,"about_ca_topic_score_gemma":0.00474079,"teacher_disagreement_score":0.024044588,"about_ca_system_score_codex":0.0012488099,"about_ca_system_score_gemma":0.0020308625,"threshold_uncertainty_score":0.08043718},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50236696,0.0007717653,0.4333439,0.0024240932,0.00021802362,0.0002125697,0.00042102474,0.0011423342,0.059099425],"genre_scores_gemma":[0.91543084,0.00032248968,0.07484311,0.00018447185,0.00013549034,0.00015701198,0.0003963246,0.00021214121,0.008318197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969133,0.00044785492,0.0001666844,0.00083816866,0.0010631925,0.0005707795],"domain_scores_gemma":[0.9925167,0.0046294816,0.00031838007,0.0016168738,0.00051781524,0.00040083952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016991842,0.0004751339,0.0010511341,0.0011758001,0.0021520723,0.005642307,0.0022038291,0.0009040758,0.006879554],"category_scores_gemma":[0.011847726,0.0005731322,0.0018803028,0.0010687073,0.0058036298,0.009497705,0.004673546,0.0048657176,0.00082879787],"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.0000538233,0.000028598673,0.00040251226,0.00005761888,0.000012696007,0.00005246139,0.0004192135,0.0037079386,0.001575148,0.987245,0.0003541929,0.0060907286],"study_design_scores_gemma":[0.000017812914,0.000024001461,0.00012835539,0.0000204753,0.000008682943,0.00006622689,0.00010945668,0.016547369,0.004136811,0.9757421,0.0031825867,0.00001622704],"about_ca_topic_score_codex":0.000847548,"about_ca_topic_score_gemma":0.0006251271,"teacher_disagreement_score":0.006879554,"about_ca_system_score_codex":0.0021138499,"about_ca_system_score_gemma":0.0013497999,"threshold_uncertainty_score":0.023014426},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005384717,0.068845116,0.4836271,0.07985325,0.08538458,0.0005558969,0.0032256488,0.0038816466,0.2692421],"genre_scores_gemma":[0.1064248,0.06777163,0.3971429,0.013618308,0.06458222,0.001293746,0.007414517,0.0045040264,0.33724788],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99285936,0.0018829561,0.00064203254,0.0012361535,0.0027815923,0.00059789314],"domain_scores_gemma":[0.99254465,0.0026791994,0.00021474464,0.001522769,0.0024427585,0.00059590617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010622461,0.002047856,0.0031136938,0.0025478557,0.0033910675,0.013880653,0.0032520213,0.0032043771,0.050087076],"category_scores_gemma":[0.017230846,0.0014688686,0.0048710704,0.0033493584,0.003318866,0.012971083,0.0062537016,0.018135043,0.018141732],"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.00024489147,0.00008834976,0.00023242424,0.00040723023,0.00010869299,0.00010243534,0.0004389283,0.002440971,0.0009629891,0.36277828,0.53120977,0.10098501],"study_design_scores_gemma":[0.000060383303,0.00006436559,0.0002744151,0.00038924365,0.00007028957,0.0001801657,0.00012592836,0.007390761,0.0011016976,0.15904696,0.83123004,0.00006578235],"about_ca_topic_score_codex":0.0044366033,"about_ca_topic_score_gemma":0.00719248,"teacher_disagreement_score":0.050087076,"about_ca_system_score_codex":0.008707926,"about_ca_system_score_gemma":0.008048846,"threshold_uncertainty_score":0.16755795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14810342,0.0027495872,0.54142153,0.009087377,0.00043214875,0.000115540686,0.00065451453,0.00041008188,0.29702577],"genre_scores_gemma":[0.8725178,0.0016222327,0.085978046,0.00097647705,0.0004239417,0.00021528437,0.00051294506,0.000345419,0.037407864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969964,0.0009577089,0.00021404466,0.0007556852,0.0006011309,0.00047504823],"domain_scores_gemma":[0.9846949,0.0086773215,0.0011620661,0.002948258,0.0014180448,0.001099386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033160564,0.00059312984,0.0011834004,0.0025409504,0.005428979,0.008809981,0.0020624362,0.0038361296,0.030398857],"category_scores_gemma":[0.019501958,0.0010160218,0.0011114834,0.0045366697,0.010402128,0.025480423,0.0070115468,0.00484409,0.0020799013],"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.000009065325,0.0000036293218,0.00006832287,0.000008377918,0.0000016867422,0.000036389727,0.00011030628,0.00024065367,0.000027218279,0.99809045,0.0002659141,0.0011379373],"study_design_scores_gemma":[0.0000036802103,0.0000018238458,0.00001661837,0.00001037616,0.000001991531,0.00003134835,0.00006752956,0.0015157275,0.00004561015,0.9963961,0.0019065487,0.000002724238],"about_ca_topic_score_codex":0.002993505,"about_ca_topic_score_gemma":0.0019439372,"teacher_disagreement_score":0.030398857,"about_ca_system_score_codex":0.0021012782,"about_ca_system_score_gemma":0.0014050183,"threshold_uncertainty_score":0.101694286},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22226357,0.005670351,0.5522642,0.015470366,0.0004863506,0.00043307152,0.0037265106,0.001712684,0.19797283],"genre_scores_gemma":[0.87953323,0.0035465015,0.086940184,0.0014991184,0.0011594353,0.00066193484,0.005827269,0.0006275177,0.020204885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935091,0.0014348038,0.00042920528,0.0014211753,0.0023142917,0.0008913306],"domain_scores_gemma":[0.9827339,0.012611976,0.0007777171,0.0025462853,0.0007158638,0.00061411544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035973266,0.0016391105,0.0023208945,0.0029943474,0.002717853,0.009238876,0.0058055115,0.0035797972,0.013039217],"category_scores_gemma":[0.017901754,0.0015004756,0.004035706,0.004961993,0.0072456244,0.022221992,0.005904989,0.009846782,0.001074942],"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.00007889196,0.00005439821,0.0004448671,0.0002042346,0.000039833783,0.00006401753,0.00021598542,0.00958958,0.00038481937,0.9734596,0.0030880722,0.0123756],"study_design_scores_gemma":[0.000022663256,0.0000057239536,0.000147846,0.000016750024,0.000016030535,0.00005362523,0.000030354684,0.009442287,0.00023324192,0.9882682,0.0017562793,0.0000070324363],"about_ca_topic_score_codex":0.0017374305,"about_ca_topic_score_gemma":0.0017801643,"teacher_disagreement_score":0.013039217,"about_ca_system_score_codex":0.0059083346,"about_ca_system_score_gemma":0.0019411304,"threshold_uncertainty_score":0.043620586},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022063235,0.015135125,0.7866417,0.085255444,0.0011248575,0.00010269275,0.00082515937,0.0004699077,0.08838189],"genre_scores_gemma":[0.7850047,0.012265521,0.14747189,0.0042538545,0.0030015644,0.00028532906,0.00055725046,0.00055891526,0.04660094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99520147,0.0021943825,0.00029464465,0.0009049752,0.0010054888,0.0003990235],"domain_scores_gemma":[0.96314174,0.02902044,0.0011891108,0.00409218,0.001440767,0.0011157587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076449076,0.00086917356,0.0022858428,0.0016358934,0.0025252611,0.011381142,0.003763679,0.0056425054,0.009933276],"category_scores_gemma":[0.04430298,0.0008941495,0.001476492,0.00342868,0.01620379,0.04191032,0.005579838,0.007494266,0.0014191896],"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.000038769682,0.000013124668,0.00011816122,0.000065615706,0.000011833629,0.00003740225,0.0001118473,0.0023082956,0.000054947188,0.9807194,0.0028602479,0.013660394],"study_design_scores_gemma":[0.0000051187903,0.0000028183422,0.000013836467,0.0000108786635,0.0000027758042,0.000015753458,0.00001543415,0.0033382846,0.000041186788,0.9943816,0.002168768,0.000003437924],"about_ca_topic_score_codex":0.002581788,"about_ca_topic_score_gemma":0.0013943095,"teacher_disagreement_score":0.011381142,"about_ca_system_score_codex":0.0038651477,"about_ca_system_score_gemma":0.0027494454,"threshold_uncertainty_score":0.040430605},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033776425,0.038473066,0.7262204,0.03748311,0.0019245299,0.000104519786,0.00063345226,0.0013519818,0.16003242],"genre_scores_gemma":[0.73623776,0.021595202,0.20118426,0.0072607626,0.0041563804,0.00037193083,0.00092242396,0.0010207868,0.027250487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636495,0.0014197412,0.00030414763,0.0006017298,0.0009947421,0.00031455886],"domain_scores_gemma":[0.99340206,0.004259899,0.0003186942,0.0011606138,0.00059300155,0.00026580502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058364463,0.00079300144,0.0013187709,0.0011483644,0.0015212948,0.009746767,0.0038512854,0.0025362414,0.0062072896],"category_scores_gemma":[0.010897232,0.00069307187,0.0014691156,0.0019033698,0.008191803,0.025194762,0.0035957273,0.0069836453,0.0015750178],"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.000011495424,0.000008092339,0.00008939699,0.000087608714,0.000008189204,0.000047657843,0.00022965296,0.0007636611,0.00027225268,0.98870075,0.001762519,0.008018693],"study_design_scores_gemma":[0.0000064709534,0.000007765573,0.00006598213,0.00008020837,0.000010593013,0.00016279917,0.00009464033,0.003565,0.00031332695,0.9772933,0.01838658,0.00001336044],"about_ca_topic_score_codex":0.0014155768,"about_ca_topic_score_gemma":0.00071798183,"teacher_disagreement_score":0.009746767,"about_ca_system_score_codex":0.0021594155,"about_ca_system_score_gemma":0.00096572423,"threshold_uncertainty_score":0.030866444},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007965104,0.0033138958,0.006011518,0.06192783,0.0017294047,0.00002299492,0.000032245196,0.000048714384,0.91894835],"genre_scores_gemma":[0.49911514,0.0036786909,0.0045880806,0.02273757,0.0018079069,0.00017095433,0.000057035093,0.0004662473,0.46737847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560684,0.0028958283,0.000062267,0.00041247823,0.00065587927,0.0003666363],"domain_scores_gemma":[0.99369603,0.0054420866,0.00013022259,0.00019070618,0.00023339465,0.00030759972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004882984,0.000682879,0.0005279716,0.0007529746,0.0091266725,0.015208975,0.0021278325,0.005774314,0.017865757],"category_scores_gemma":[0.013448953,0.00047131025,0.00038074143,0.00102481,0.025680467,0.023298314,0.00572762,0.011633125,0.003335707],"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.000009931823,0.0000070970873,0.000023508792,0.000012226119,8.8687585e-7,0.0000783619,0.011166741,0.00010371399,0.000026871681,0.9694287,0.016738135,0.0024038134],"study_design_scores_gemma":[0.00001345624,0.0000075646976,0.00005955562,0.00012593612,0.0000019813817,0.000116368064,0.016068622,0.0007619267,0.00011673977,0.53975016,0.4429616,0.000016085025],"about_ca_topic_score_codex":0.007363894,"about_ca_topic_score_gemma":0.012389793,"teacher_disagreement_score":0.017865757,"about_ca_system_score_codex":0.0071243765,"about_ca_system_score_gemma":0.0027090285,"threshold_uncertainty_score":0.05976689},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052999213,0.0013282765,0.8339497,0.001645232,0.00053821725,0.00017624632,0.0015230994,0.0014841274,0.10635586],"genre_scores_gemma":[0.74789786,0.00065515004,0.19948077,0.001326472,0.000625049,0.0005072901,0.0033769934,0.0006374098,0.04549292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985178,0.00021300223,0.00010921597,0.0003125909,0.00053833914,0.00030899062],"domain_scores_gemma":[0.9982767,0.00052640325,0.00012245915,0.00030882857,0.0005830894,0.0001824998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011727705,0.00066739274,0.00051242905,0.0020135113,0.0019536745,0.004281393,0.0014587174,0.0012716068,0.006428002],"category_scores_gemma":[0.001709902,0.00049826293,0.0015904565,0.0017676795,0.003559746,0.004782112,0.0019963612,0.0033203934,0.0012519057],"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.0000053239673,0.0000057550387,0.0001065214,0.000017787614,0.0000029306839,0.000026793998,0.0001035543,0.0003094867,0.0004211629,0.99676824,0.0006975928,0.0015348813],"study_design_scores_gemma":[0.000025268162,0.000044178367,0.00030176964,0.000041186977,0.000021374857,0.00021887729,0.0001636335,0.01624184,0.0031595177,0.9169875,0.06276332,0.00003156012],"about_ca_topic_score_codex":0.0065396987,"about_ca_topic_score_gemma":0.004615941,"teacher_disagreement_score":0.0065396987,"about_ca_system_score_codex":0.0037387542,"about_ca_system_score_gemma":0.0020128388,"threshold_uncertainty_score":0.02712673},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031248372,0.0011689825,0.33074254,0.026349077,0.007681168,0.0012790482,0.03746685,0.26178837,0.30227557],"genre_scores_gemma":[0.22472085,0.0019925784,0.15211229,0.006845394,0.005908338,0.0009689409,0.04504316,0.06320779,0.49920067],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975647,0.00054248876,0.0001740497,0.0003680309,0.0011031765,0.0002475137],"domain_scores_gemma":[0.9553292,0.010721531,0.0011552633,0.02590882,0.004534821,0.002350302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003034221,0.001265466,0.0010987148,0.0031980155,0.0031453723,0.0065720556,0.0018475711,0.0023070243,0.23158272],"category_scores_gemma":[0.036378954,0.0010840032,0.0007415928,0.004355758,0.0014177131,0.010087496,0.0065712095,0.0028862073,0.16254318],"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.0006729927,0.00012665894,0.0013992758,0.00022017742,0.000031815085,0.00024872966,0.00079205714,0.0007716253,0.0049695596,0.011437828,0.7503451,0.22898416],"study_design_scores_gemma":[0.0002059917,0.00014927733,0.0015661216,0.00017546397,0.00006162843,0.00047897297,0.0015488097,0.00831705,0.01571477,0.048674915,0.92299515,0.000111965426],"about_ca_topic_score_codex":0.0015310788,"about_ca_topic_score_gemma":0.0016544769,"teacher_disagreement_score":0.23158272,"about_ca_system_score_codex":0.0010873066,"about_ca_system_score_gemma":0.0014605889,"threshold_uncertainty_score":0.7747214},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000655034,0.2720371,0.002759347,0.51925826,0.079338625,0.00002316692,0.0002396009,0.0002958964,0.12539302],"genre_scores_gemma":[0.015997382,0.13232836,0.0033451908,0.15032023,0.055018175,0.00006772006,0.00023891147,0.000693667,0.6419904],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940014,0.00015674216,0.000031520893,0.00012898177,0.00024156977,0.00004097338],"domain_scores_gemma":[0.9974044,0.0013128391,0.000092686954,0.00020085346,0.0005507905,0.00043836303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012114957,0.00087413494,0.0010407552,0.0009627728,0.00228081,0.004470147,0.0011218382,0.0017753452,0.02776228],"category_scores_gemma":[0.0043160217,0.00061842095,0.00044184134,0.0009662874,0.0030483708,0.011730154,0.0021739306,0.011983157,0.021371072],"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.00001116782,0.0000131859915,0.000024050938,0.00006155854,0.0000050256244,0.000024630212,0.00021925304,0.000030558866,0.00006981293,0.0382145,0.9455478,0.015778467],"study_design_scores_gemma":[0.0000029653695,0.0000075790695,0.000046448335,0.00011313732,0.0000019737558,0.00013568466,0.00014444052,0.000029383069,0.000047003745,0.0137562305,0.9857094,0.0000057724765],"about_ca_topic_score_codex":0.0015228274,"about_ca_topic_score_gemma":0.00298347,"teacher_disagreement_score":0.02776228,"about_ca_system_score_codex":0.001155461,"about_ca_system_score_gemma":0.0016155381,"threshold_uncertainty_score":0.09287411},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01075989,0.19063772,0.060529135,0.4693918,0.005099715,0.00007232227,0.0002556183,0.00090643356,0.26234728],"genre_scores_gemma":[0.4852308,0.27223802,0.10372865,0.047639646,0.022438897,0.00052432786,0.0008086531,0.00040570603,0.066985324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99683714,0.0016410286,0.0000890515,0.00032369673,0.0007934175,0.0003157162],"domain_scores_gemma":[0.98178905,0.011770798,0.0006203458,0.0014373763,0.002741029,0.0016413662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0096405605,0.00060498493,0.0008044542,0.0018507465,0.0023846556,0.006865264,0.0021112103,0.007409811,0.038959768],"category_scores_gemma":[0.011173542,0.0003743168,0.0008212211,0.0011051408,0.00893727,0.014526046,0.0034677433,0.0062181684,0.005831606],"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.000053725882,0.00008943573,0.00022148943,0.0002761006,0.000008264896,0.00004962226,0.00018832088,0.0011608299,0.00025811823,0.93727505,0.024130741,0.036288343],"study_design_scores_gemma":[0.000036424008,0.0000451328,0.00031343318,0.00022121066,0.000004762968,0.00010547972,0.00035747836,0.0022903252,0.00021345909,0.71357757,0.28280976,0.000025014786],"about_ca_topic_score_codex":0.0012724524,"about_ca_topic_score_gemma":0.0013131528,"teacher_disagreement_score":0.038959768,"about_ca_system_score_codex":0.0030934864,"about_ca_system_score_gemma":0.0048535606,"threshold_uncertainty_score":0.13033342},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20327859,0.0034558962,0.7102966,0.002536343,0.0003650041,0.00010834746,0.00049060915,0.00056424463,0.07890439],"genre_scores_gemma":[0.8803094,0.0010168409,0.11114722,0.00047029028,0.000304534,0.00019582342,0.00028794998,0.00009451268,0.006173519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975007,0.0007601339,0.00018650875,0.0005915862,0.00075653236,0.00020454619],"domain_scores_gemma":[0.9949774,0.0029578751,0.00076141855,0.00069236703,0.00041169103,0.0001992099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667514,0.00041110595,0.0004373913,0.0013531271,0.0009092362,0.0021823177,0.0006892775,0.001060157,0.0031245276],"category_scores_gemma":[0.009998408,0.00028079987,0.0003964308,0.0009621268,0.0045266007,0.0046913023,0.0015733645,0.0017234143,0.00054359867],"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.00005094596,0.000009350939,0.00069398823,0.00004433938,0.0000062550116,0.000058167854,0.00013491749,0.0032426259,0.0025978142,0.9792234,0.0004411792,0.013497052],"study_design_scores_gemma":[0.000012536182,0.00008587579,0.0013373106,0.00006149664,0.00000784361,0.0002586763,0.00014724361,0.02847387,0.0058223517,0.95351756,0.010233559,0.000041709394],"about_ca_topic_score_codex":0.00046051765,"about_ca_topic_score_gemma":0.00026030777,"teacher_disagreement_score":0.0031245276,"about_ca_system_score_codex":0.0013340387,"about_ca_system_score_gemma":0.00058892893,"threshold_uncertainty_score":0.010452628},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0404791,0.07124295,0.21799964,0.015925001,0.0010700276,0.00007593108,0.0005397185,0.0003204791,0.65234715],"genre_scores_gemma":[0.71472496,0.03783521,0.07458429,0.0027223919,0.003997013,0.00037641646,0.0006785144,0.00020210762,0.16487914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995266,0.00013600301,0.00002277649,0.000089825226,0.00019215768,0.000032611537],"domain_scores_gemma":[0.9987746,0.0007988778,0.00006525406,0.000092136615,0.00021881914,0.000050297163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008085238,0.0005166075,0.0005401856,0.0021640223,0.0012566263,0.003443452,0.0008374306,0.0007667412,0.0056237257],"category_scores_gemma":[0.0035086847,0.0003451517,0.0004389451,0.0026219634,0.0039834674,0.0078062876,0.0010705069,0.0022129547,0.0011430156],"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.753487e-7,0.0000021456183,0.00002161293,0.000018180448,8.3539425e-7,0.0000052290625,0.00004109761,0.00021793177,0.00003260991,0.99482477,0.0017894099,0.0030453624],"study_design_scores_gemma":[0.0000011261696,0.000002070032,0.000082780236,0.000013373476,0.0000015636839,0.00002348598,0.000023936072,0.0009787716,0.00004227251,0.9872432,0.011585165,0.0000021478336],"about_ca_topic_score_codex":0.0015995145,"about_ca_topic_score_gemma":0.0010841608,"teacher_disagreement_score":0.0056237257,"about_ca_system_score_codex":0.0031006208,"about_ca_system_score_gemma":0.0008613084,"threshold_uncertainty_score":0.02249664},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0846924,0.004313908,0.81861025,0.016471406,0.00046747847,0.00016535968,0.0010061,0.0011606752,0.07311244],"genre_scores_gemma":[0.8406056,0.0037548165,0.13473591,0.0023969412,0.0010022568,0.00066299643,0.0010919909,0.0007607644,0.014988637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98692244,0.003127906,0.0006622506,0.003250799,0.0046670907,0.0013694606],"domain_scores_gemma":[0.9210544,0.058219723,0.0021047725,0.013415032,0.0040861834,0.0011199532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006573447,0.001370625,0.002131356,0.0022943998,0.0019525999,0.008679103,0.0023115065,0.002960141,0.006196249],"category_scores_gemma":[0.059173476,0.0009035781,0.0019845143,0.002702528,0.010504093,0.020811975,0.0058489987,0.011184394,0.0012895622],"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.00012395107,0.000024157938,0.00037798527,0.00020408284,0.00004067966,0.000045439865,0.00017847949,0.01280222,0.00084518985,0.97214,0.0018940023,0.011323829],"study_design_scores_gemma":[0.000018786282,0.000023586841,0.00026666987,0.000047971633,0.000016241343,0.00006126129,0.000030440207,0.03338086,0.0011822311,0.9604458,0.0045066834,0.000019501585],"about_ca_topic_score_codex":0.0020945498,"about_ca_topic_score_gemma":0.0008703542,"teacher_disagreement_score":0.008679103,"about_ca_system_score_codex":0.0058490406,"about_ca_system_score_gemma":0.002825144,"threshold_uncertainty_score":0.04243791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43124893,0.0009863238,0.45125756,0.004315117,0.0005448229,0.00026873665,0.0008760732,0.0011563307,0.109345995],"genre_scores_gemma":[0.96747464,0.00024120233,0.02507851,0.0002860846,0.0003451313,0.00019484006,0.0005000325,0.00011712359,0.005762335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504447,0.001789172,0.00026963378,0.0005685226,0.0018798918,0.00044830254],"domain_scores_gemma":[0.94305754,0.04718626,0.0021339413,0.003569347,0.0023154903,0.0017373275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003738722,0.0007721294,0.0009803828,0.0047152643,0.0015539082,0.0038779005,0.001552249,0.0026831208,0.008186485],"category_scores_gemma":[0.030891024,0.0004527054,0.0011126344,0.0020392013,0.007472909,0.012422779,0.0039343643,0.0043266267,0.0009872664],"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.00023179312,0.00006345737,0.0017498166,0.00008398169,0.000022604208,0.00008406647,0.00015292811,0.006920533,0.0021327368,0.970679,0.001992546,0.015886465],"study_design_scores_gemma":[0.00003920986,0.00015768396,0.0007329321,0.000033990375,0.000015860749,0.0001858804,0.00007902222,0.06092348,0.0038786405,0.9316327,0.0022862514,0.00003433952],"about_ca_topic_score_codex":0.00044705157,"about_ca_topic_score_gemma":0.00024444386,"teacher_disagreement_score":0.008186485,"about_ca_system_score_codex":0.0020304208,"about_ca_system_score_gemma":0.0013250988,"threshold_uncertainty_score":0.027386546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03796991,0.00074278883,0.91459763,0.0025286826,0.00021496475,0.00011530455,0.00021827375,0.006576965,0.037035488],"genre_scores_gemma":[0.61235344,0.00070682727,0.36020672,0.0010942775,0.0005407216,0.00024379519,0.0005572322,0.0014991802,0.02279779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99623615,0.00083168084,0.00025348473,0.0011440407,0.0010963288,0.00043840986],"domain_scores_gemma":[0.98731893,0.006013159,0.00041252645,0.005027595,0.00076359697,0.00046415426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027210175,0.0010478916,0.0011107028,0.0014624309,0.0016912717,0.0040593105,0.001938812,0.0016863622,0.01298339],"category_scores_gemma":[0.016268393,0.00072768313,0.0011641169,0.002532991,0.0025451838,0.009346654,0.0044868104,0.005064809,0.0029673046],"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.0003939472,0.00016300473,0.0008939771,0.0001930718,0.00006645419,0.000054260367,0.0003686993,0.030234363,0.004683158,0.72807693,0.018928532,0.21594368],"study_design_scores_gemma":[0.000068048714,0.000042773383,0.00017292684,0.000039499086,0.000027376007,0.00005896172,0.000037970472,0.16009697,0.0074655362,0.8142751,0.017689105,0.00002575562],"about_ca_topic_score_codex":0.0016590758,"about_ca_topic_score_gemma":0.0018481234,"teacher_disagreement_score":0.01298339,"about_ca_system_score_codex":0.0023210216,"about_ca_system_score_gemma":0.002437856,"threshold_uncertainty_score":0.043433726},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021560977,0.011487854,0.0004727658,0.8096575,0.030637013,0.0001289981,0.0006898035,0.00013848889,0.1446314],"genre_scores_gemma":[0.018837614,0.0074230647,0.00058422954,0.36247468,0.006565698,0.0003166452,0.0003758428,0.00021062534,0.6032116],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.9990085,0.00030063413,0.000033762557,0.00013837276,0.0002516834,0.00026704627],"domain_scores_gemma":[0.9964057,0.0010034253,0.00011488919,0.00007035531,0.001160519,0.0012451572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019487094,0.00074520515,0.00073305506,0.0010342973,0.008799289,0.004119101,0.00083278894,0.0052369586,0.1456031],"category_scores_gemma":[0.009619877,0.00059133145,0.00035070177,0.001132158,0.0015610943,0.004469916,0.0030279716,0.011916279,0.054672796],"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.0000065334602,0.0000094486995,0.000049530216,0.000024164574,4.5396203e-7,0.000053723485,0.0010827414,0.0000068110057,0.00003294022,0.0014876847,0.9936479,0.003598026],"study_design_scores_gemma":[0.0000029787332,0.000007150975,0.00017227507,0.00006559586,6.102583e-7,0.00011355163,0.00410563,0.000010915452,0.000016577433,0.00049334904,0.9950058,0.000005641645],"about_ca_topic_score_codex":0.015185311,"about_ca_topic_score_gemma":0.02916809,"teacher_disagreement_score":0.1456031,"about_ca_system_score_codex":0.003937574,"about_ca_system_score_gemma":0.004947188,"threshold_uncertainty_score":0.4870909},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012743777,0.0068537155,0.8953213,0.0088672135,0.001256234,0.00010247917,0.00009221107,0.000499421,0.074263625],"genre_scores_gemma":[0.4674825,0.007725297,0.48565903,0.0017570975,0.0014780351,0.00022548265,0.00021674717,0.00017231607,0.035283484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994698,0.000183582,0.000028620978,0.00007292595,0.00020765519,0.000037397454],"domain_scores_gemma":[0.99925596,0.00035876027,0.000057818863,0.0001067786,0.000115502546,0.00010519135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011112991,0.0007027277,0.000643036,0.0007902703,0.0006317896,0.0035211476,0.0013627413,0.0015772659,0.0047984994],"category_scores_gemma":[0.0018031149,0.00029620665,0.0005137593,0.00069526595,0.0023938196,0.0031079578,0.0020240364,0.0016496747,0.00096114463],"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.000110394154,0.000073053045,0.0006192117,0.0003482282,0.00010199825,0.00024961217,0.0004469313,0.02445348,0.0062079695,0.7710946,0.012791971,0.1835026],"study_design_scores_gemma":[0.000043797303,0.00014037958,0.00034478732,0.00012463014,0.000032555152,0.00033759137,0.0002295108,0.12034633,0.0018161567,0.810398,0.06614691,0.000039426428],"about_ca_topic_score_codex":0.0005765898,"about_ca_topic_score_gemma":0.00054391637,"teacher_disagreement_score":0.0047984994,"about_ca_system_score_codex":0.000533791,"about_ca_system_score_gemma":0.000623736,"threshold_uncertainty_score":0.016052604},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043272506,0.012919,0.12343163,0.012295513,0.0008358612,0.000054724685,0.00042733163,0.0004650117,0.84524375],"genre_scores_gemma":[0.40299892,0.027367132,0.06819826,0.00547705,0.0041017723,0.0006481801,0.0015423071,0.0010537972,0.4886125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925727,0.00015221092,0.000027175278,0.00014275538,0.00034155772,0.00007905225],"domain_scores_gemma":[0.99862206,0.00083516235,0.00003780482,0.00032440625,0.00012861135,0.000051992836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000693062,0.0009236667,0.0009148311,0.0009359836,0.0012813,0.003346811,0.0011717934,0.0011781136,0.024778651],"category_scores_gemma":[0.00335374,0.00048426478,0.000710539,0.0016778741,0.0036461654,0.0076258094,0.0019098986,0.0047651916,0.0051545496],"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.0000037386503,0.0000056824897,0.000017613818,0.00003778889,0.0000031852937,0.0000076204906,0.00004531831,0.00055333367,0.000077093304,0.97568446,0.013888658,0.009675488],"study_design_scores_gemma":[0.0000021406058,0.0000015221293,0.000028821638,0.000017182438,0.0000021864987,0.000013835251,0.000009580602,0.000698321,0.00007950741,0.9643529,0.034791954,0.0000021156227],"about_ca_topic_score_codex":0.0013783835,"about_ca_topic_score_gemma":0.0011647192,"teacher_disagreement_score":0.024778651,"about_ca_system_score_codex":0.0035581782,"about_ca_system_score_gemma":0.0012595652,"threshold_uncertainty_score":0.082892895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00827269,0.03261521,0.76917565,0.037127335,0.0016329727,0.00008464538,0.0005535218,0.00066848507,0.1498695],"genre_scores_gemma":[0.60684764,0.03945248,0.31523302,0.006071781,0.0078013865,0.00062980084,0.0007463573,0.000521353,0.02269614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982034,0.00063109264,0.00010261689,0.0002548724,0.00062138634,0.00018660846],"domain_scores_gemma":[0.99503374,0.0027351019,0.00023766239,0.0012379319,0.00048081085,0.00027473678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044991807,0.0008009814,0.0009494342,0.0025001243,0.0024623815,0.007834084,0.0018556851,0.0031086893,0.007529699],"category_scores_gemma":[0.008831663,0.00063576666,0.0011920416,0.0028770703,0.011357269,0.015840966,0.0035764328,0.0067423894,0.002486759],"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.000002073469,0.0000028854938,0.000024702802,0.00003068607,0.0000018016158,0.000008209321,0.000031881213,0.0005362534,0.00004396965,0.99592197,0.0008778428,0.0025177365],"study_design_scores_gemma":[0.0000013526721,0.0000012020778,0.000013646543,0.000015119328,6.661811e-7,0.0000070177553,0.0000092030405,0.0011246998,0.000025281912,0.9932928,0.005506711,0.0000023590146],"about_ca_topic_score_codex":0.0015683225,"about_ca_topic_score_gemma":0.0010776488,"teacher_disagreement_score":0.007834084,"about_ca_system_score_codex":0.002993781,"about_ca_system_score_gemma":0.002367672,"threshold_uncertainty_score":0.0251894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51309496,0.0052325167,0.3190381,0.008512135,0.00030841303,0.00017068391,0.00078723027,0.0011977938,0.15165819],"genre_scores_gemma":[0.9659908,0.0011927271,0.025695695,0.00043949633,0.0003845152,0.000111582536,0.0004078862,0.00011165598,0.0056655887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942153,0.001293341,0.00037866345,0.0012212779,0.002155098,0.0007364009],"domain_scores_gemma":[0.9881689,0.007932125,0.0007267655,0.00157461,0.0010383297,0.00055925775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028380705,0.0006028463,0.001343703,0.0034362073,0.0024659,0.0064780265,0.0013724706,0.0014967922,0.0046649077],"category_scores_gemma":[0.015129407,0.0006824996,0.0015685247,0.0021508469,0.008592539,0.013259593,0.0035191237,0.004944932,0.000545864],"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.00002563569,0.000014866727,0.00031233314,0.000057927933,0.00001003975,0.000077754834,0.00044461904,0.0012387959,0.000648896,0.991598,0.0003257056,0.00524534],"study_design_scores_gemma":[0.00001441213,0.000016830058,0.00046162272,0.00002233945,0.000013076558,0.00011620838,0.00010624149,0.0032976442,0.00065472524,0.99301857,0.0022664925,0.000011729144],"about_ca_topic_score_codex":0.0021062053,"about_ca_topic_score_gemma":0.0010956534,"teacher_disagreement_score":0.0064780265,"about_ca_system_score_codex":0.0027971552,"about_ca_system_score_gemma":0.0009987977,"threshold_uncertainty_score":0.020294905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18185295,0.0030819504,0.4572732,0.012778972,0.00081761007,0.0001454306,0.0009089224,0.0006135232,0.34252748],"genre_scores_gemma":[0.9318896,0.00115724,0.026122004,0.0007739779,0.0012019171,0.00014206229,0.0007233933,0.00021523451,0.037774544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717605,0.0008652059,0.00016218008,0.00047309624,0.0010052667,0.0003182356],"domain_scores_gemma":[0.9884057,0.00782162,0.0004568436,0.0015350939,0.0010509031,0.000729867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021762114,0.00057248736,0.0018567082,0.002300269,0.0043839808,0.005391053,0.0017485248,0.0017160567,0.010635298],"category_scores_gemma":[0.011956568,0.0011344688,0.0019292451,0.002928224,0.0074830954,0.015620118,0.0045006266,0.008498717,0.0012464802],"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.000011311049,0.000010613522,0.00007764431,0.000011597109,0.0000041329236,0.000009541313,0.00007615945,0.00026339528,0.000046447843,0.9978156,0.00043238592,0.0012412159],"study_design_scores_gemma":[0.0000048593606,0.0000020777393,0.00005911333,0.0000026735295,0.0000037253928,0.000011579575,0.00001338007,0.0012099744,0.00005698992,0.99769324,0.00093907776,0.0000033825406],"about_ca_topic_score_codex":0.0026603811,"about_ca_topic_score_gemma":0.0025772403,"teacher_disagreement_score":0.010635298,"about_ca_system_score_codex":0.002498246,"about_ca_system_score_gemma":0.001846939,"threshold_uncertainty_score":0.03557855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006135636,0.077067494,0.54968137,0.04119461,0.0039281873,0.00008285245,0.00075788435,0.0008649725,0.32028702],"genre_scores_gemma":[0.38494876,0.10285598,0.2911847,0.013841225,0.025239136,0.0010983997,0.0021385285,0.002813459,0.17587985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980781,0.00075828057,0.00015140582,0.00033445345,0.00056872156,0.00010899093],"domain_scores_gemma":[0.9887468,0.009310183,0.00022530729,0.0012448087,0.00036382303,0.00010900813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002980853,0.0017034156,0.0026570307,0.0029898796,0.0021132203,0.004740786,0.0022326557,0.0028291068,0.014254223],"category_scores_gemma":[0.01097821,0.0011197958,0.003958373,0.003483209,0.012525248,0.01814803,0.0040940554,0.010953634,0.0034966],"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.000012687175,0.000011446244,0.000066170855,0.0002054656,0.000029610432,0.00003726849,0.00008053142,0.0033054855,0.00011186345,0.97365856,0.010599886,0.011880992],"study_design_scores_gemma":[0.000002341409,0.000003460299,0.000034854093,0.00003263004,0.000005291393,0.000013949649,0.0000068431646,0.0012072563,0.000051496467,0.9853892,0.013248741,0.0000040073774],"about_ca_topic_score_codex":0.0024249258,"about_ca_topic_score_gemma":0.001835839,"teacher_disagreement_score":0.014254223,"about_ca_system_score_codex":0.0034843283,"about_ca_system_score_gemma":0.0011632816,"threshold_uncertainty_score":0.047685087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14577435,0.0007758637,0.7565082,0.003440198,0.00026843286,0.0004619493,0.00043299136,0.0015999171,0.09073821],"genre_scores_gemma":[0.8885738,0.0005935974,0.08232694,0.0013720818,0.00039451415,0.000995021,0.00039985718,0.0005485179,0.024795655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926448,0.0018394206,0.0003020438,0.0017094272,0.0021629834,0.0013412881],"domain_scores_gemma":[0.9724873,0.019987408,0.0018181406,0.0034371112,0.0012025671,0.0010675909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005693841,0.0017869729,0.0023817068,0.0021938977,0.0025119316,0.004342553,0.0040592547,0.003146126,0.008106756],"category_scores_gemma":[0.026914116,0.0010514836,0.00396635,0.0014477182,0.0048475508,0.008724728,0.0074014827,0.0068137115,0.0018077131],"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.00019023952,0.00016221151,0.0005476252,0.000113129296,0.000062606494,0.00025176455,0.00035869214,0.022276742,0.0026871809,0.95823264,0.0032264504,0.011890708],"study_design_scores_gemma":[0.000062239254,0.00006633396,0.00015696163,0.000025371659,0.000030398847,0.00016689845,0.00004140382,0.1382262,0.0015989305,0.85770684,0.0018764414,0.00004194748],"about_ca_topic_score_codex":0.0015738372,"about_ca_topic_score_gemma":0.0014614112,"teacher_disagreement_score":0.008106756,"about_ca_system_score_codex":0.0041670077,"about_ca_system_score_gemma":0.0030317975,"threshold_uncertainty_score":0.03023386},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40126166,0.0010009096,0.4075201,0.0046640793,0.00050492876,0.00016964784,0.0003536028,0.00049495057,0.18403009],"genre_scores_gemma":[0.92826426,0.00037636523,0.040970467,0.0003224944,0.00018485452,0.0001485029,0.00018913051,0.000107004875,0.02943696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785596,0.00034443673,0.0001077695,0.0004324784,0.00083740725,0.0004218715],"domain_scores_gemma":[0.99344915,0.0036436697,0.000399461,0.0011189323,0.00083368603,0.0005551049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015140697,0.00051704893,0.00088986545,0.0009136147,0.0019563148,0.0048191654,0.0012604365,0.00082288886,0.008288203],"category_scores_gemma":[0.010732945,0.000393666,0.00097602577,0.00076708186,0.005249396,0.00776274,0.00450663,0.0046704593,0.00084538077],"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.000016213131,0.000011410343,0.00011657479,0.000026131069,0.0000021657065,0.000030376901,0.000112874535,0.00068949227,0.00051619584,0.99704117,0.00029500693,0.001142315],"study_design_scores_gemma":[0.00001634178,0.00001779906,0.00012891974,0.000014430128,0.0000053527397,0.000081432976,0.000101194026,0.012422578,0.0020596196,0.9809373,0.004203063,0.0000121122575],"about_ca_topic_score_codex":0.00065602636,"about_ca_topic_score_gemma":0.0005757701,"teacher_disagreement_score":0.008288203,"about_ca_system_score_codex":0.0018643208,"about_ca_system_score_gemma":0.001194309,"threshold_uncertainty_score":0.027726829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3588771,0.0021140743,0.55112684,0.032292347,0.00034598893,0.0005729114,0.004688984,0.0019402205,0.0480416],"genre_scores_gemma":[0.8933648,0.0009637026,0.09409442,0.0011348913,0.0003826607,0.0004327441,0.0027983605,0.00030102272,0.0065273833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9885821,0.0048344713,0.0007592501,0.0020069,0.0025034342,0.0013138896],"domain_scores_gemma":[0.86472136,0.11910825,0.0038847101,0.0074556503,0.0033243236,0.0015058306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074817706,0.0009204451,0.0017827818,0.0017124303,0.0025695476,0.006735384,0.00345731,0.0029677234,0.011825384],"category_scores_gemma":[0.081952624,0.0010230201,0.002467666,0.001980416,0.006023587,0.016035715,0.0046826513,0.0046354528,0.0011448114],"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.001085212,0.0002774162,0.0113336,0.0006495655,0.0003098348,0.00076446374,0.0012977764,0.19644268,0.0015640158,0.6947117,0.013815653,0.07774816],"study_design_scores_gemma":[0.000092926966,0.000036121302,0.0011357531,0.00003751697,0.000047093363,0.00014288789,0.00017753708,0.19933431,0.00070050935,0.7955489,0.0027141059,0.000032368],"about_ca_topic_score_codex":0.009103703,"about_ca_topic_score_gemma":0.0049130716,"teacher_disagreement_score":0.011825384,"about_ca_system_score_codex":0.0051860805,"about_ca_system_score_gemma":0.004612892,"threshold_uncertainty_score":0.03956783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020100042,0.0025622793,0.20284568,0.003650821,0.0005686129,0.00009776087,0.0001465535,0.00045596223,0.7695722],"genre_scores_gemma":[0.63555384,0.0019202853,0.09196179,0.0020811607,0.00029902637,0.00030942145,0.00031140752,0.0005407123,0.2670224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992913,0.00028434646,0.000029434406,0.00012253711,0.00014300607,0.000129433],"domain_scores_gemma":[0.9992655,0.00034024805,0.00004856728,0.00015669175,0.00008456006,0.0001044261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091514236,0.00095489685,0.00074714277,0.0006637669,0.0021591883,0.005026339,0.0015514555,0.0021898493,0.017771814],"category_scores_gemma":[0.0029460914,0.0004888381,0.0009435235,0.00053748,0.0046524704,0.0068687364,0.0024029547,0.0037363945,0.0035522492],"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.000025395553,0.0000115849725,0.000044016215,0.000020548692,0.0000041954427,0.000028205754,0.00023692817,0.00092583883,0.00019805589,0.98011976,0.0064263963,0.011959144],"study_design_scores_gemma":[0.0000059615127,0.000011544147,0.0000572638,0.000031444382,0.0000032733442,0.00006027343,0.00014148158,0.0031661552,0.00033144682,0.96673656,0.0294477,0.0000068783006],"about_ca_topic_score_codex":0.0018068083,"about_ca_topic_score_gemma":0.002686609,"teacher_disagreement_score":0.017771814,"about_ca_system_score_codex":0.0017308111,"about_ca_system_score_gemma":0.0011059743,"threshold_uncertainty_score":0.059452653},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43176523,0.0030414506,0.34860116,0.008796131,0.00093009335,0.00013626274,0.0016414969,0.0016217612,0.20346643],"genre_scores_gemma":[0.96255165,0.00060974236,0.012773212,0.00048187596,0.0006709706,0.00008545709,0.00054231455,0.00018422415,0.022100586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953967,0.0012885239,0.00032143347,0.00062467123,0.0015796603,0.000789093],"domain_scores_gemma":[0.99286747,0.0037706885,0.00070490054,0.0007893036,0.0008375477,0.0010301374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027171308,0.0010691584,0.001698728,0.0059453626,0.0037989502,0.009461416,0.001558228,0.0018594594,0.016157512],"category_scores_gemma":[0.011568613,0.0011010934,0.001462543,0.0034352755,0.005718715,0.015640521,0.005072564,0.004314952,0.0019152563],"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.000039183662,0.00001368771,0.00026129658,0.000027378122,0.000009783583,0.000036695874,0.00020296537,0.00043435118,0.00017550703,0.9953499,0.0007071376,0.0027421943],"study_design_scores_gemma":[0.000011985187,0.000011172892,0.00013674668,0.000011388479,0.000009881355,0.000037787177,0.00008069217,0.0016322098,0.00016679321,0.99576855,0.0021218974,0.000010995583],"about_ca_topic_score_codex":0.0014364498,"about_ca_topic_score_gemma":0.0019107423,"teacher_disagreement_score":0.016157512,"about_ca_system_score_codex":0.0022838786,"about_ca_system_score_gemma":0.0014006644,"threshold_uncertainty_score":0.054052234},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007568341,0.00849146,0.05200075,0.0043647015,0.0008863345,0.00005001545,0.00019626113,0.00048364955,0.93277],"genre_scores_gemma":[0.13334908,0.021244315,0.086113974,0.0033575438,0.0008500359,0.0005561588,0.0007025157,0.00079789053,0.7530285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996315,0.00011663347,0.000014777094,0.000070866634,0.00012451319,0.000041709478],"domain_scores_gemma":[0.9997695,0.000081181046,0.000012093903,0.00006442905,0.000049369602,0.00002347055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034870065,0.00067051087,0.0003125601,0.0010575448,0.0018125873,0.004815407,0.0010801007,0.0008966022,0.032201998],"category_scores_gemma":[0.0011280795,0.00041716325,0.00050317944,0.0013447187,0.0057166433,0.005563941,0.0012426511,0.0025375157,0.011959143],"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.0000021808935,0.0000015452761,0.00001081081,0.000019091762,5.9981323e-7,0.0000069082107,0.0000808809,0.00018117888,0.00004280532,0.98092043,0.012305074,0.0064285244],"study_design_scores_gemma":[0.0000033278866,0.0000032070363,0.000042587926,0.0000572288,0.0000011990838,0.0000442111,0.00007563343,0.0006599284,0.00006410801,0.46356267,0.5354822,0.0000036638955],"about_ca_topic_score_codex":0.0051118257,"about_ca_topic_score_gemma":0.00574444,"teacher_disagreement_score":0.032201998,"about_ca_system_score_codex":0.0036355187,"about_ca_system_score_gemma":0.0019692904,"threshold_uncertainty_score":0.107726455},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4721279,0.00069940556,0.38020614,0.004629188,0.00026460277,0.00014400974,0.00050446345,0.00089359115,0.14053072],"genre_scores_gemma":[0.9595822,0.00017548076,0.032021277,0.00034178345,0.00010620966,0.000103288185,0.00037112768,0.00009316745,0.0072056083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976025,0.0006663986,0.00013609027,0.0006785203,0.0006218044,0.00029471144],"domain_scores_gemma":[0.9892042,0.007680217,0.00031036267,0.0016980354,0.0007651203,0.00034208075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017133362,0.00039006802,0.0007073015,0.00084777176,0.0017635756,0.003034785,0.0015677864,0.0007628011,0.0061524785],"category_scores_gemma":[0.010105906,0.0004995269,0.0015244619,0.0007097336,0.004920056,0.0092116725,0.0037651397,0.0039435932,0.0004489327],"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.000026449088,0.000017587769,0.0003858746,0.000032663036,0.000007224313,0.000041925694,0.0001868064,0.0010286162,0.0010805398,0.99301517,0.0005165232,0.0036605073],"study_design_scores_gemma":[0.000019849183,0.000014576309,0.00049211964,0.000016086167,0.000011772597,0.000066117966,0.00007696666,0.0073186276,0.0023050967,0.9837299,0.0059367926,0.0000120897175],"about_ca_topic_score_codex":0.0016408883,"about_ca_topic_score_gemma":0.0021282285,"teacher_disagreement_score":0.0061524785,"about_ca_system_score_codex":0.0022572114,"about_ca_system_score_gemma":0.001258938,"threshold_uncertainty_score":0.02058208},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3456221,0.00067291595,0.6206215,0.002169058,0.0003636525,0.00017780905,0.0010309905,0.0034075342,0.025934478],"genre_scores_gemma":[0.9213076,0.0004776265,0.068866566,0.00042328882,0.00043152302,0.00027854712,0.00078312925,0.00060223613,0.006829415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921187,0.0010157767,0.0008940613,0.002298158,0.002153224,0.0015199448],"domain_scores_gemma":[0.9722845,0.013858903,0.0025473046,0.0076800194,0.0023026108,0.0013267878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044135796,0.0011886598,0.0015360211,0.001818157,0.0016553213,0.009088262,0.0026380634,0.0022489983,0.0036258693],"category_scores_gemma":[0.019512752,0.0011424707,0.0026146763,0.0021185027,0.011073905,0.020905241,0.0067975703,0.004970752,0.0010315984],"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.00043496222,0.00011970432,0.008906901,0.00028172947,0.00006915274,0.0010580852,0.0015741499,0.0063860873,0.005273562,0.95261663,0.001574177,0.02170486],"study_design_scores_gemma":[0.000024715753,0.00006634083,0.0006607822,0.000029390178,0.00004001278,0.00080890156,0.00013353273,0.013979732,0.007360695,0.97305894,0.0037886375,0.00004830828],"about_ca_topic_score_codex":0.0010307094,"about_ca_topic_score_gemma":0.00061264774,"teacher_disagreement_score":0.009088262,"about_ca_system_score_codex":0.0018897301,"about_ca_system_score_gemma":0.0016909353,"threshold_uncertainty_score":0.023341477},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19745135,0.0016869277,0.7583763,0.0024370758,0.00018914696,0.000088687004,0.00036494795,0.00019480547,0.03921069],"genre_scores_gemma":[0.92964584,0.0007632197,0.063132994,0.0003601037,0.00054756296,0.00020849315,0.00035750004,0.000079801306,0.004904421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932239,0.0020714088,0.0005158158,0.0013948135,0.0022088704,0.0005852907],"domain_scores_gemma":[0.97562486,0.017270172,0.0021782327,0.0025451977,0.0015146516,0.00086694735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043010274,0.0007101694,0.0011250109,0.0027967282,0.001277739,0.0041274265,0.0012860242,0.0016352588,0.0033898575],"category_scores_gemma":[0.020439325,0.00040836397,0.0015006899,0.0018026094,0.010269814,0.010162,0.0031933964,0.0030770514,0.00028604298],"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.000011095944,0.0000058927303,0.00046037798,0.000020477679,0.000008006741,0.000021835514,0.00006063044,0.0021116138,0.0002804288,0.994208,0.00010869542,0.0027030383],"study_design_scores_gemma":[0.000011836107,0.00005932259,0.00062232034,0.000026212612,0.000011271688,0.00016376369,0.00007075191,0.018786581,0.00077183347,0.97556406,0.0038903856,0.000021696684],"about_ca_topic_score_codex":0.0005660615,"about_ca_topic_score_gemma":0.000247873,"teacher_disagreement_score":0.0043010274,"about_ca_system_score_codex":0.002097105,"about_ca_system_score_gemma":0.00091168424,"threshold_uncertainty_score":0.022746265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02515127,0.00077223254,0.968782,0.00020280498,0.00012628961,0.00004809164,0.00003318274,0.00035083757,0.004533294],"genre_scores_gemma":[0.38170385,0.0016271349,0.6115695,0.00031404506,0.0001280919,0.00011701022,0.000083377934,0.00008012782,0.0043768752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966884,0.000049510552,0.0000252139,0.00006365252,0.00016423977,0.000028586846],"domain_scores_gemma":[0.99980766,0.00009197175,0.000032650925,0.000027743692,0.000028807912,0.000011102395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034209754,0.00032511642,0.00041568335,0.0003053169,0.00026493208,0.00083601824,0.0005646015,0.00042620418,0.0008324098],"category_scores_gemma":[0.0008312992,0.00020078983,0.00039117326,0.00042457122,0.00066393963,0.0008872637,0.00043998487,0.0004547299,0.00031893226],"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.00031835583,0.00012435988,0.0011746596,0.00040243604,0.000075867145,0.000326409,0.0002708871,0.17586769,0.18916638,0.42666206,0.0021592195,0.20345174],"study_design_scores_gemma":[0.000048098897,0.00020749388,0.0004845583,0.000049061597,0.000043378463,0.00039403743,0.00004436888,0.79515404,0.101795204,0.08268634,0.019043753,0.000049639257],"about_ca_topic_score_codex":0.00036965378,"about_ca_topic_score_gemma":0.0005243976,"teacher_disagreement_score":0.00083601824,"about_ca_system_score_codex":0.0003731172,"about_ca_system_score_gemma":0.00029840364,"threshold_uncertainty_score":0.0027846694},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38733366,0.0010274958,0.58310014,0.0017994717,0.0001478668,0.00009182045,0.0004504196,0.00110713,0.024942018],"genre_scores_gemma":[0.940725,0.00036513,0.056776516,0.00007078206,0.00012439281,0.000054489596,0.00012010363,0.00023828784,0.0015253054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735,0.0006101787,0.00021624348,0.000649638,0.0007812726,0.0003926351],"domain_scores_gemma":[0.95590127,0.031639345,0.0028332043,0.007212304,0.0012632662,0.0011506228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033172483,0.0006129304,0.0013048789,0.00064264325,0.0013855803,0.0032022046,0.002036425,0.0010474749,0.004305643],"category_scores_gemma":[0.030443897,0.0009272772,0.0012733702,0.0014350879,0.0040324456,0.01240232,0.0038592713,0.0033538486,0.00032091906],"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.0010184003,0.00012069001,0.002463085,0.00041167522,0.000104983876,0.00041660634,0.0009294215,0.17609517,0.0140176825,0.7452678,0.0015151526,0.05763937],"study_design_scores_gemma":[0.000044294793,0.00004467998,0.0005437571,0.000030909894,0.000053121472,0.0001087383,0.000102982885,0.20078202,0.006745228,0.79009897,0.0014177909,0.000027578932],"about_ca_topic_score_codex":0.00095726474,"about_ca_topic_score_gemma":0.0012358304,"teacher_disagreement_score":0.004305643,"about_ca_system_score_codex":0.00101514,"about_ca_system_score_gemma":0.0013738405,"threshold_uncertainty_score":0.017543495},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075808284,0.104540184,0.36396006,0.033408612,0.08243128,0.0005508004,0.004229766,0.0065643922,0.39673412],"genre_scores_gemma":[0.10563099,0.09092406,0.25905275,0.0084559955,0.03398409,0.0010591038,0.01758199,0.0027368555,0.4805742],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99647874,0.0009239408,0.00039399165,0.0006112766,0.0013570971,0.00023493491],"domain_scores_gemma":[0.99629396,0.00092525856,0.00011335997,0.00092697254,0.0013088699,0.0004316553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034397691,0.0016439572,0.0022794192,0.0020441008,0.0017916673,0.0100437505,0.0023263476,0.0022022517,0.07461648],"category_scores_gemma":[0.0073697586,0.0006256173,0.0019063135,0.002446079,0.0019732465,0.005557512,0.003662955,0.005606465,0.027615],"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.00022785121,0.000081542465,0.00045837276,0.00062797964,0.00015232513,0.00024109002,0.00050364196,0.0035581626,0.0018052917,0.241878,0.5272919,0.22317389],"study_design_scores_gemma":[0.000025997957,0.000037861057,0.00021405549,0.00021142712,0.000034556426,0.00017741846,0.00006428319,0.0060975244,0.0006319177,0.066929534,0.9255492,0.000026201638],"about_ca_topic_score_codex":0.0020584615,"about_ca_topic_score_gemma":0.0019577257,"teacher_disagreement_score":0.07461648,"about_ca_system_score_codex":0.0029686466,"about_ca_system_score_gemma":0.0038451895,"threshold_uncertainty_score":0.24961698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88295645,0.00060529594,0.10329393,0.0014879128,0.000045696426,0.00009359824,0.0010380582,0.00048606197,0.009992933],"genre_scores_gemma":[0.98289824,0.00020602476,0.015104644,0.000046499536,0.00006664951,0.000055877194,0.0005532908,0.00008588881,0.000982837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942054,0.0015095779,0.00041000213,0.0013916945,0.0019204039,0.00056304026],"domain_scores_gemma":[0.87025917,0.09968608,0.008802634,0.014584511,0.0032795423,0.003388186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042075226,0.0007480116,0.0011819453,0.0050218715,0.0012768072,0.0075177466,0.0025004442,0.0024750717,0.006885339],"category_scores_gemma":[0.06635198,0.0010874118,0.0012771885,0.0033285916,0.0038203637,0.018666113,0.003241463,0.003845818,0.0004863852],"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.0010851108,0.000616791,0.070547305,0.00043936138,0.0004210711,0.0002465084,0.0016206906,0.1722119,0.008856401,0.6617327,0.0040172297,0.07820494],"study_design_scores_gemma":[0.00005071214,0.00013481556,0.011882871,0.000038298193,0.00009896124,0.00027967407,0.0005372715,0.27031037,0.005014701,0.7098119,0.0017734232,0.00006695171],"about_ca_topic_score_codex":0.0017806744,"about_ca_topic_score_gemma":0.0018751677,"teacher_disagreement_score":0.0075177466,"about_ca_system_score_codex":0.0029595403,"about_ca_system_score_gemma":0.0014761363,"threshold_uncertainty_score":0.023033798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40874052,0.0014048177,0.2665138,0.0035265514,0.0012738166,0.00022005118,0.0009458035,0.00089350797,0.3164811],"genre_scores_gemma":[0.9486521,0.0004068,0.029487768,0.0007153426,0.00032793492,0.00009694764,0.0005120217,0.00017087936,0.019630186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993839,0.00014155936,0.000058580434,0.00015170095,0.00013992909,0.00012414092],"domain_scores_gemma":[0.9979284,0.0007842777,0.00026263515,0.00045256948,0.0002953959,0.00027672446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006045117,0.00035372627,0.00040964887,0.0009907043,0.001437715,0.0021241817,0.00070903497,0.0011043499,0.010295757],"category_scores_gemma":[0.0056412187,0.0002462385,0.00043606933,0.0011292918,0.0027302876,0.0030446954,0.0012188276,0.0018966383,0.0012265899],"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.00005505495,0.000017537413,0.00026529096,0.00005602485,0.000003934729,0.00026896136,0.00023642318,0.0003778574,0.00215506,0.98536694,0.0015363721,0.009660635],"study_design_scores_gemma":[0.000015511006,0.000025712376,0.0005447556,0.000022735194,0.000006791078,0.0005982036,0.00019317174,0.0018742821,0.002139828,0.9836918,0.010871701,0.000015549189],"about_ca_topic_score_codex":0.0006683315,"about_ca_topic_score_gemma":0.0009133322,"teacher_disagreement_score":0.010295757,"about_ca_system_score_codex":0.000612759,"about_ca_system_score_gemma":0.0005643457,"threshold_uncertainty_score":0.034442723},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25058967,0.009481308,0.35280547,0.0057476056,0.0005349671,0.00004977616,0.00041678664,0.0004336928,0.37994072],"genre_scores_gemma":[0.9307996,0.0030768528,0.034433916,0.00034770273,0.0005334455,0.00005593498,0.00023861094,0.00014267092,0.030371219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993926,0.00013034609,0.00003089066,0.00015843652,0.00021878067,0.00006895653],"domain_scores_gemma":[0.99872655,0.000840615,0.00006663212,0.00018785862,0.00010281785,0.000075374875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010931075,0.0005064568,0.0008356221,0.0010688626,0.0008972308,0.0038338436,0.00092191,0.00090077065,0.005097806],"category_scores_gemma":[0.003250164,0.00040666494,0.0009929952,0.00085590436,0.0043078004,0.007840184,0.0016628315,0.0034629297,0.0008441648],"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.000006669235,0.0000037686318,0.000042691063,0.000011668405,0.0000019921663,0.000015016573,0.000037760266,0.0004074319,0.0001640663,0.9972588,0.00024225168,0.0018079741],"study_design_scores_gemma":[0.0000044679587,0.000003788726,0.000076464516,0.0000056490417,0.000002353562,0.000040611278,0.0000120997365,0.0028925587,0.0002234871,0.9948196,0.0019153978,0.000003567491],"about_ca_topic_score_codex":0.00066644885,"about_ca_topic_score_gemma":0.0004354427,"teacher_disagreement_score":0.005097806,"about_ca_system_score_codex":0.0017340917,"about_ca_system_score_gemma":0.00065487664,"threshold_uncertainty_score":0.017053843},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03415438,0.01048511,0.56492317,0.009258454,0.0025806103,0.00013651732,0.0002944472,0.0010129227,0.37715438],"genre_scores_gemma":[0.5002632,0.013706968,0.3020837,0.0048144055,0.0032559203,0.00052368885,0.00047311143,0.0011550584,0.17372395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992455,0.00023275484,0.000031822477,0.00012534492,0.0002353703,0.00012920225],"domain_scores_gemma":[0.9982456,0.0010647397,0.000065072076,0.00026199,0.00022879394,0.00013378805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016144419,0.0009786773,0.0010033451,0.0034863784,0.0028311063,0.002422553,0.0020862045,0.0015992512,0.012595079],"category_scores_gemma":[0.0075524,0.00035843631,0.0015578624,0.004021586,0.0047365422,0.008246387,0.004950724,0.0036782539,0.002498271],"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.000016296884,0.00001485247,0.00011440997,0.00003963409,0.000004815673,0.00006672228,0.00014142142,0.00053032837,0.00014893284,0.9788134,0.0037201855,0.01638898],"study_design_scores_gemma":[0.000008602493,0.000016198735,0.00017178591,0.000034551867,0.000011749605,0.0001712187,0.000059267546,0.0040325057,0.00030437947,0.9627656,0.032408547,0.000015645648],"about_ca_topic_score_codex":0.0037782358,"about_ca_topic_score_gemma":0.0036405013,"teacher_disagreement_score":0.012595079,"about_ca_system_score_codex":0.001798156,"about_ca_system_score_gemma":0.0010745033,"threshold_uncertainty_score":0.04213476},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07482792,0.012336479,0.72594845,0.023640009,0.0007996341,0.00019561876,0.0005155074,0.00058146747,0.161155],"genre_scores_gemma":[0.7018905,0.0072895223,0.27476498,0.0012121774,0.001200596,0.00045240266,0.000843356,0.0005537495,0.0117926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99077433,0.0057207514,0.0004486342,0.00094850676,0.0017016034,0.00040624526],"domain_scores_gemma":[0.8917733,0.091456495,0.002265117,0.010867491,0.0022337085,0.0014038815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007362866,0.0009462657,0.0012859919,0.0013514587,0.0016422496,0.0076651387,0.003080936,0.0022078278,0.016029177],"category_scores_gemma":[0.09232323,0.0009762164,0.0018362174,0.0038417939,0.006084471,0.018637113,0.005648651,0.0064251586,0.0011257731],"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.000067497975,0.00007488937,0.0008018707,0.00023962495,0.000053605,0.00004081656,0.00025432307,0.03937396,0.00023257674,0.91080207,0.0032451726,0.04481349],"study_design_scores_gemma":[0.000017410206,0.000010286217,0.00020730661,0.00003718487,0.000014373526,0.00001901383,0.00009158602,0.039666526,0.0001126796,0.9551884,0.004627476,0.0000077392415],"about_ca_topic_score_codex":0.0027474079,"about_ca_topic_score_gemma":0.00257866,"teacher_disagreement_score":0.016029177,"about_ca_system_score_codex":0.004456769,"about_ca_system_score_gemma":0.0028522073,"threshold_uncertainty_score":0.05362296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021707008,0.0021593838,0.67149854,0.008315636,0.0013270518,0.00010210489,0.00051852793,0.0015250138,0.2928468],"genre_scores_gemma":[0.6329294,0.0033830386,0.26521942,0.0070404694,0.0021165377,0.00043676075,0.0013691385,0.003218737,0.08428656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951866,0.0018682699,0.00033615535,0.000846479,0.0011552575,0.0006071545],"domain_scores_gemma":[0.99222624,0.0039596586,0.00032375896,0.001816428,0.0013160268,0.00035791696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006621083,0.0011816943,0.0012957421,0.0020852776,0.00442251,0.0064230007,0.00260627,0.0022406261,0.013912175],"category_scores_gemma":[0.01104659,0.0012297427,0.0037622883,0.0020277482,0.011411183,0.022894964,0.007426836,0.0070563047,0.0046285824],"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.000009098306,0.00000629333,0.000055516597,0.000023605673,0.0000051953925,0.00003713481,0.00019822227,0.00016899945,0.00012030703,0.99513066,0.0015221532,0.002722813],"study_design_scores_gemma":[0.000013163705,0.000010923497,0.0000930932,0.000027672462,0.000011838102,0.00007813789,0.0000830659,0.0011532371,0.00056636625,0.9792047,0.018742183,0.000015633346],"about_ca_topic_score_codex":0.0060778046,"about_ca_topic_score_gemma":0.0049925135,"teacher_disagreement_score":0.013912175,"about_ca_system_score_codex":0.003545703,"about_ca_system_score_gemma":0.002130999,"threshold_uncertainty_score":0.046540856},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015788112,0.011033326,0.009878597,0.033981133,0.001411118,0.000015055734,0.00009773144,0.00007621748,0.92771864],"genre_scores_gemma":[0.8949834,0.0057872925,0.0036714002,0.0052238447,0.0027777187,0.000038946415,0.000059988935,0.0001564209,0.08730101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980258,0.0009781347,0.00006801972,0.00033621117,0.00041710347,0.00017474982],"domain_scores_gemma":[0.99585354,0.0026002827,0.00012396005,0.0006641226,0.0005511005,0.00020704142],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028583019,0.00035946615,0.0004841466,0.001849718,0.00354987,0.003552082,0.0006838897,0.0019170457,0.0070287213],"category_scores_gemma":[0.00923187,0.0003198616,0.0004471645,0.0009423619,0.01856855,0.0051126136,0.0017130426,0.00440363,0.0010826668],"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.0000045947577,0.0000021713313,0.000038770955,0.00000802899,0.0000016949773,0.00000992871,0.00025224494,0.00006334176,0.000014282788,0.9968585,0.001548738,0.0011976232],"study_design_scores_gemma":[0.000008621721,0.000003955598,0.00014019219,0.000019993387,0.0000028637878,0.000032588625,0.000098084645,0.0001659548,0.000119786215,0.9343074,0.06509492,0.0000055535834],"about_ca_topic_score_codex":0.006805746,"about_ca_topic_score_gemma":0.0067147,"teacher_disagreement_score":0.9964501,"about_ca_system_score_codex":0.0058695497,"about_ca_system_score_gemma":0.0017683154,"threshold_uncertainty_score":0.042586803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11023614,0.00045550798,0.8696911,0.0009600027,0.00016835057,0.00016680866,0.00040882258,0.0024570667,0.015456262],"genre_scores_gemma":[0.8260957,0.00040977323,0.16371424,0.00039230124,0.00035881062,0.00017869871,0.0006047799,0.000557011,0.0076885954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997426,0.0007232381,0.00024829464,0.00039671376,0.0007445768,0.00046125427],"domain_scores_gemma":[0.9905912,0.006758585,0.00042258546,0.0011538876,0.00070856523,0.00036514222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046323314,0.0007955904,0.001097055,0.0023420434,0.0019394683,0.0052240617,0.0020144524,0.001406053,0.0057476354],"category_scores_gemma":[0.010669782,0.0010037548,0.0020580324,0.0021969248,0.0037985314,0.012463244,0.0033730986,0.0038843602,0.0010757098],"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.00011374875,0.000042680887,0.00080166955,0.00008756431,0.000022279475,0.00016619543,0.0005906258,0.0012106799,0.0021514057,0.97285855,0.0011622517,0.020792294],"study_design_scores_gemma":[0.000038386264,0.000026355106,0.00032427307,0.000032192987,0.00007097892,0.00017706685,0.00015374036,0.01982721,0.0038967289,0.9717485,0.00366638,0.000038146136],"about_ca_topic_score_codex":0.0009734214,"about_ca_topic_score_gemma":0.0013683387,"teacher_disagreement_score":0.0057476354,"about_ca_system_score_codex":0.0016757813,"about_ca_system_score_gemma":0.001431719,"threshold_uncertainty_score":0.024498463},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.633514,0.00067306485,0.25048858,0.0017993854,0.00019609115,0.00019917496,0.0017319653,0.0010558655,0.11034179],"genre_scores_gemma":[0.92643607,0.0001551204,0.057873774,0.0002596178,0.000061995896,0.00013658838,0.0009414772,0.00011901006,0.0140163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849236,0.0003090541,0.00011263217,0.00048362775,0.00031542568,0.00028688135],"domain_scores_gemma":[0.9974953,0.0009587919,0.00022627176,0.0003723134,0.00042762398,0.0005197358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008604086,0.00048388273,0.00075572095,0.0013391606,0.0025276982,0.0026248053,0.00089504826,0.0010759403,0.009416392],"category_scores_gemma":[0.0047750636,0.00076687685,0.00088925316,0.0008062922,0.0023560992,0.004657755,0.0028212415,0.0017850082,0.0014628203],"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.00021093184,0.000056324847,0.002180103,0.00014372058,0.000031834858,0.00032468152,0.0007866429,0.0011350324,0.0058842236,0.97678053,0.0017044591,0.01076151],"study_design_scores_gemma":[0.00007415605,0.00016537815,0.002202251,0.000092353665,0.00006655018,0.0009272906,0.00076476025,0.007020047,0.0121577075,0.95769244,0.018763602,0.000073480995],"about_ca_topic_score_codex":0.0005196931,"about_ca_topic_score_gemma":0.00082510733,"teacher_disagreement_score":0.009416392,"about_ca_system_score_codex":0.0011583235,"about_ca_system_score_gemma":0.0011628828,"threshold_uncertainty_score":0.031500995},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065755667,0.047668274,0.047218658,0.04443048,0.4948995,0.00050045364,0.003833384,0.0028958027,0.3519779],"genre_scores_gemma":[0.029675819,0.03271399,0.014477708,0.0030767322,0.28607863,0.00030844132,0.0065194736,0.0017835262,0.6253657],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828416,0.00023952863,0.00014984103,0.00035200268,0.0008150488,0.00015944455],"domain_scores_gemma":[0.99385417,0.0011092176,0.0002523732,0.00095423224,0.002972566,0.0008574967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020713275,0.001981074,0.0032456936,0.003897684,0.002217536,0.008170012,0.0017697209,0.0027655845,0.15131384],"category_scores_gemma":[0.006016914,0.0006551904,0.0012894996,0.0043382198,0.001513661,0.0048336172,0.0025556788,0.0036562423,0.05256721],"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.00010594801,0.00008288133,0.0003424182,0.0003939755,0.000029047618,0.00007505692,0.000034666587,0.0008652781,0.00043998825,0.019543255,0.8881447,0.08994293],"study_design_scores_gemma":[0.00003469996,0.00009768173,0.0015592037,0.00034885376,0.000060517857,0.00028624985,0.00007148006,0.0051313136,0.0009326213,0.030395437,0.9610426,0.00003925849],"about_ca_topic_score_codex":0.0022155168,"about_ca_topic_score_gemma":0.004189411,"teacher_disagreement_score":0.15131384,"about_ca_system_score_codex":0.0029126548,"about_ca_system_score_gemma":0.0039909757,"threshold_uncertainty_score":0.5061952},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067489315,0.13746333,0.19271572,0.03642326,0.018770812,0.000087509616,0.0015112701,0.0011947735,0.60508436],"genre_scores_gemma":[0.34265074,0.07511504,0.09080631,0.015353421,0.04456965,0.00061791495,0.0014387904,0.0013317154,0.42811644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990609,0.00029035573,0.00005238811,0.00023432264,0.00027022482,0.000091752525],"domain_scores_gemma":[0.99848795,0.00082009105,0.000045142668,0.00025709122,0.00025966665,0.00013006377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009962759,0.00084342033,0.0011607258,0.0034135105,0.0024208827,0.004061549,0.001088877,0.0015903588,0.024506167],"category_scores_gemma":[0.003371249,0.00071461994,0.0009830587,0.0040092743,0.006549979,0.007167874,0.0028553675,0.005910259,0.0070908335],"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.0000043883997,0.0000063069647,0.000047305843,0.00006171776,0.000004013813,0.000013933994,0.0001623869,0.0001463268,0.00010857711,0.96516365,0.022274978,0.012006374],"study_design_scores_gemma":[0.0000022593565,0.0000044730436,0.000098746146,0.000039271352,0.0000037125014,0.00005874529,0.000034776764,0.00024605694,0.000083667815,0.7678422,0.2315794,0.000006688062],"about_ca_topic_score_codex":0.0011756221,"about_ca_topic_score_gemma":0.0015028034,"teacher_disagreement_score":0.024506167,"about_ca_system_score_codex":0.002645588,"about_ca_system_score_gemma":0.0016082512,"threshold_uncertainty_score":0.08198136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8452503,0.00038920811,0.112596676,0.0013683465,0.0000634368,0.000084905696,0.00023828658,0.00045672336,0.039552078],"genre_scores_gemma":[0.9960743,0.00005162028,0.0027512575,0.000085910775,0.00002923689,0.00001136475,0.00006433101,0.000016545646,0.00091546966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976935,0.0004240142,0.00013773853,0.00050183275,0.0004955164,0.00074746116],"domain_scores_gemma":[0.99083626,0.004023425,0.0011733223,0.0014195663,0.0015344694,0.0010128773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017153699,0.00036527627,0.0007680678,0.001514912,0.0021998775,0.0023276706,0.0010052272,0.00081833935,0.0072506787],"category_scores_gemma":[0.0075460663,0.0004049165,0.0009983925,0.0010153654,0.008676457,0.0057803644,0.004409048,0.002357614,0.00035474618],"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.00019896416,0.000054989938,0.003556775,0.000102938524,0.000034043038,0.00028428473,0.0006123526,0.005055358,0.0048547266,0.9783685,0.00054718985,0.006329895],"study_design_scores_gemma":[0.000030389103,0.00010816555,0.0021820057,0.000029274315,0.000031551153,0.00025156993,0.00040371536,0.01107348,0.0056463517,0.97833496,0.0018568346,0.000051820803],"about_ca_topic_score_codex":0.0013058343,"about_ca_topic_score_gemma":0.0010693601,"teacher_disagreement_score":0.0072506787,"about_ca_system_score_codex":0.0016770327,"about_ca_system_score_gemma":0.0006863683,"threshold_uncertainty_score":0.024255872},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09178342,0.010987175,0.25951254,0.23419721,0.0053266273,0.00019404496,0.000395332,0.0018768333,0.39572683],"genre_scores_gemma":[0.9030404,0.003322673,0.048576437,0.021971196,0.0023364772,0.00047543395,0.00019678423,0.00035977608,0.019720716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995414,0.0019367812,0.00019360415,0.0008472754,0.0010253035,0.0005830076],"domain_scores_gemma":[0.98681086,0.0081482185,0.00052158633,0.0029571617,0.0009654822,0.00059671653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00526376,0.0008614049,0.00090854464,0.0017475315,0.0036245394,0.0057853456,0.002488379,0.005612186,0.006496001],"category_scores_gemma":[0.020397946,0.00056458486,0.0013927169,0.0007706386,0.036121245,0.012342545,0.0069502625,0.007977565,0.0013096425],"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.000020069217,0.000010270363,0.00008176547,0.00002536445,0.000005956725,0.000056512326,0.00020467283,0.0004628726,0.000070128255,0.9942848,0.00323605,0.0015414401],"study_design_scores_gemma":[0.000017423909,0.000009854982,0.00007621563,0.000034410357,0.000003994209,0.00010714292,0.000106212654,0.0016808338,0.0002596686,0.98594636,0.011744982,0.000012912045],"about_ca_topic_score_codex":0.0012562075,"about_ca_topic_score_gemma":0.00080365426,"teacher_disagreement_score":0.006496001,"about_ca_system_score_codex":0.0024592748,"about_ca_system_score_gemma":0.0010926448,"threshold_uncertainty_score":0.027837753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05774701,0.019185212,0.6547922,0.0058967215,0.0021619333,0.00005451893,0.0004511146,0.0007896448,0.25892168],"genre_scores_gemma":[0.77444047,0.00959525,0.15527523,0.002212548,0.0042225607,0.00022001784,0.0006374885,0.0007158001,0.05268069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973314,0.000914778,0.00015748446,0.00047421502,0.0008694179,0.00025265818],"domain_scores_gemma":[0.9951403,0.0033854533,0.00037654786,0.0003694546,0.0005245698,0.00020360961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043799803,0.0010772881,0.0008708233,0.003765861,0.0016359416,0.0036190075,0.0014710263,0.00095679564,0.010183559],"category_scores_gemma":[0.010639221,0.00039491014,0.0014081548,0.0025886393,0.005218692,0.009471271,0.0031449848,0.003660302,0.0021481488],"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.000028998875,0.000006902994,0.00016054619,0.000045544773,0.000010818554,0.000026436355,0.00011853286,0.0009344188,0.0001730495,0.98695487,0.0013666007,0.010173211],"study_design_scores_gemma":[0.000008288133,0.000016039821,0.00018847252,0.000016141146,0.000007975715,0.000028367305,0.000035641875,0.00298032,0.0006025618,0.98834383,0.007761913,0.000010459233],"about_ca_topic_score_codex":0.0020162794,"about_ca_topic_score_gemma":0.0012831838,"teacher_disagreement_score":0.010183559,"about_ca_system_score_codex":0.0039350577,"about_ca_system_score_gemma":0.001214874,"threshold_uncertainty_score":0.034067452},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093084145,0.040651184,0.34133482,0.21687607,0.03535147,0.00009604343,0.0005328315,0.00082406536,0.3550251],"genre_scores_gemma":[0.4173334,0.032156013,0.1716717,0.032269657,0.055843655,0.00030590524,0.00035479115,0.00083641254,0.2892286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979054,0.00074120366,0.00010328393,0.00044279685,0.0006298426,0.00017746644],"domain_scores_gemma":[0.9966181,0.002388374,0.00009271162,0.00034428283,0.0003694292,0.00018711248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002181999,0.000540008,0.0007666748,0.0016281139,0.0022389244,0.0028607,0.0007982582,0.0016296749,0.008007402],"category_scores_gemma":[0.009160637,0.00048980414,0.00072649965,0.0013178117,0.00602214,0.008482749,0.0024447923,0.0057906336,0.0023184977],"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.000010011819,0.000010363176,0.00006223577,0.000041653897,0.0000060818406,0.000020790583,0.00024430582,0.0003519104,0.00010752957,0.95849264,0.029743643,0.010908759],"study_design_scores_gemma":[0.0000064692717,0.0000049161304,0.00005080185,0.000026577616,0.0000052793102,0.000045763958,0.000041655843,0.0009828985,0.00027169005,0.8410967,0.15745436,0.000012932665],"about_ca_topic_score_codex":0.00216851,"about_ca_topic_score_gemma":0.0018812213,"teacher_disagreement_score":0.008007402,"about_ca_system_score_codex":0.002835129,"about_ca_system_score_gemma":0.0012623401,"threshold_uncertainty_score":0.02678746},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09091862,0.002328987,0.8754918,0.0041732835,0.00019431578,0.000044270626,0.00014416312,0.0003753994,0.02632916],"genre_scores_gemma":[0.8953413,0.0016137956,0.09838988,0.0003939967,0.00024258226,0.00012700532,0.00015853986,0.00012677746,0.0036061832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836534,0.0005069575,0.000103666534,0.00042225193,0.0004418537,0.00015992277],"domain_scores_gemma":[0.9960408,0.0024085813,0.00038100552,0.0007383984,0.00025121134,0.00017995384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015782785,0.0006957584,0.0007922616,0.0016466626,0.0011165965,0.0034322436,0.0011719938,0.0013469766,0.0026770744],"category_scores_gemma":[0.00906694,0.00035892,0.0011170678,0.0014600967,0.010036068,0.012530798,0.0027679498,0.0025056503,0.00031664787],"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.0000065936797,0.000005211818,0.00012837246,0.000033144875,0.0000061901555,0.000029083081,0.0001010279,0.0046710176,0.00040992504,0.9919933,0.0001301725,0.002485918],"study_design_scores_gemma":[0.0000039709707,0.0000068847926,0.000066436114,0.000010053721,0.0000032329426,0.000025649266,0.000027499726,0.011707502,0.00048266948,0.98648584,0.0011742725,0.0000059685735],"about_ca_topic_score_codex":0.0011041326,"about_ca_topic_score_gemma":0.00039913112,"teacher_disagreement_score":0.0034322436,"about_ca_system_score_codex":0.0022622265,"about_ca_system_score_gemma":0.0007084193,"threshold_uncertainty_score":0.016413629},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10537021,0.012502858,0.56418794,0.0128236655,0.0009016397,0.0001054997,0.0006749943,0.0010057064,0.3024276],"genre_scores_gemma":[0.8852352,0.002565418,0.088212326,0.001108879,0.00093214016,0.00023955018,0.00039757258,0.00024857023,0.021060368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970817,0.0014195442,0.00014544201,0.0005566713,0.00055987743,0.00023674846],"domain_scores_gemma":[0.9973551,0.0012951249,0.00022117326,0.00066503417,0.00027399012,0.00018965552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038821024,0.00056627253,0.0007247733,0.0018012963,0.0022714604,0.0061524375,0.00096213643,0.001136779,0.004084724],"category_scores_gemma":[0.0039636213,0.00047794587,0.0013430939,0.0018436664,0.008816011,0.013029654,0.00266403,0.004226993,0.0008988185],"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.000003979185,0.0000033704623,0.000040494622,0.000009325983,0.0000015684737,0.000011940236,0.00020543832,0.0001749904,0.000104118226,0.9980825,0.00026146154,0.0011009013],"study_design_scores_gemma":[0.0000043147556,0.000010290217,0.00005000373,0.000010623842,0.0000024113406,0.000019480993,0.0000576674,0.0010068341,0.000118302014,0.9905048,0.008211466,0.00000376974],"about_ca_topic_score_codex":0.001609791,"about_ca_topic_score_gemma":0.0013529666,"teacher_disagreement_score":0.0061524375,"about_ca_system_score_codex":0.0034033484,"about_ca_system_score_gemma":0.0010274114,"threshold_uncertainty_score":0.024693131},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10407817,0.0043673567,0.72780406,0.0051483037,0.00048369117,0.00014897904,0.0008672403,0.0015576769,0.15554455],"genre_scores_gemma":[0.8097535,0.001353351,0.15511246,0.0026900538,0.0008081129,0.00038134452,0.0009953816,0.0004965781,0.028409196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807703,0.00044943814,0.00017004173,0.00046364297,0.0006218368,0.00021806719],"domain_scores_gemma":[0.99779654,0.001119455,0.00017318384,0.0003455704,0.00045918112,0.00010608681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019409439,0.00046775563,0.0006943263,0.0014811623,0.0015038492,0.002214486,0.00090115133,0.00082343206,0.0047497824],"category_scores_gemma":[0.0033525245,0.0004440285,0.0017254378,0.000965686,0.0038014106,0.0069031254,0.002933077,0.0021520793,0.0009734245],"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.000015050221,0.000006244497,0.0001235269,0.00005171469,0.0000146785505,0.00013287152,0.00046191528,0.00031220028,0.000909586,0.9913502,0.0014562558,0.0051657464],"study_design_scores_gemma":[0.000014446121,0.000026115922,0.0002955369,0.000028729213,0.000017237306,0.0004154615,0.00012532069,0.00417343,0.0014451758,0.97254974,0.020890407,0.000018432274],"about_ca_topic_score_codex":0.0009644723,"about_ca_topic_score_gemma":0.0007212926,"teacher_disagreement_score":0.0047497824,"about_ca_system_score_codex":0.0016265181,"about_ca_system_score_gemma":0.0007907516,"threshold_uncertainty_score":0.015889585},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24536511,0.002144336,0.6321393,0.0064543504,0.0004733761,0.00015953812,0.0015173049,0.001959652,0.10978702],"genre_scores_gemma":[0.9279338,0.00066038675,0.05810006,0.00060595374,0.00030122045,0.00015683158,0.0011325377,0.00023165299,0.010877568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982256,0.00065029314,0.00014332122,0.00027847817,0.0004553427,0.00024705043],"domain_scores_gemma":[0.99558604,0.0026225604,0.00041664293,0.0006849726,0.0004916897,0.00019801666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016270841,0.0009495595,0.0011598113,0.0021041147,0.0024484897,0.0075713447,0.0018115876,0.0023182605,0.0075642793],"category_scores_gemma":[0.006666654,0.0012296734,0.0018208286,0.0022802285,0.006186408,0.013902367,0.0032202932,0.005700434,0.00086675247],"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.000018192943,0.000009201525,0.00007158543,0.0000207521,0.0000058996457,0.000041498126,0.00024578304,0.0010216486,0.00024447136,0.9968965,0.00034510263,0.0010794852],"study_design_scores_gemma":[0.000007747765,0.0000031313357,0.0000266044,0.000007499444,0.0000054279058,0.000014579107,0.00004914807,0.0024842413,0.0001437647,0.996347,0.0009066604,0.000004163748],"about_ca_topic_score_codex":0.0021653613,"about_ca_topic_score_gemma":0.0026635802,"teacher_disagreement_score":0.0075713447,"about_ca_system_score_codex":0.0026810607,"about_ca_system_score_gemma":0.0012918893,"threshold_uncertainty_score":0.025305033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5819306,0.000678116,0.320837,0.0011222648,0.00010172322,0.00009671127,0.0006632106,0.00083637587,0.093734115],"genre_scores_gemma":[0.9592978,0.0001448036,0.027133565,0.00011439123,0.00007127963,0.000050710387,0.0004511893,0.0000677305,0.012668588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821246,0.00026508514,0.00016614443,0.00040104688,0.0006877386,0.00026750154],"domain_scores_gemma":[0.9961385,0.0014188188,0.0003412587,0.00072474784,0.0009144057,0.00046224336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077810494,0.00034774904,0.00041174388,0.0011152884,0.0011981912,0.0021061422,0.00054392853,0.00047613584,0.00329177],"category_scores_gemma":[0.0034236622,0.00026813545,0.0007870608,0.0008480715,0.0028365448,0.002509054,0.001351034,0.0014198425,0.00038197348],"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.00010323797,0.00003680154,0.0017130645,0.00005519626,0.000013474667,0.00021130657,0.000518119,0.007093524,0.005683737,0.96538615,0.00087300775,0.018312305],"study_design_scores_gemma":[0.000024743153,0.00011908935,0.0017632733,0.00002885425,0.000026246349,0.00040042071,0.00023631404,0.031836946,0.0085803,0.94085705,0.016093519,0.000033176468],"about_ca_topic_score_codex":0.0031459164,"about_ca_topic_score_gemma":0.003513127,"teacher_disagreement_score":0.00329177,"about_ca_system_score_codex":0.002088192,"about_ca_system_score_gemma":0.0012036385,"threshold_uncertainty_score":0.015150964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026834847,0.14338084,0.45819244,0.08057947,0.0022445046,0.000117024494,0.00024149659,0.00038276997,0.28802666],"genre_scores_gemma":[0.7190536,0.09229897,0.14246766,0.0076387743,0.0025545887,0.00046265824,0.0002670734,0.00018711151,0.03506957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640346,0.0018327377,0.00014773289,0.00039872096,0.0010407747,0.00017662588],"domain_scores_gemma":[0.9928328,0.0052619833,0.000369346,0.0008342787,0.00051701994,0.0001846236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044786395,0.00091165595,0.0009956135,0.0017525619,0.0011797925,0.0075345044,0.001330598,0.003201255,0.0053408057],"category_scores_gemma":[0.008149216,0.00047770859,0.0011255292,0.0022734725,0.019039398,0.009711282,0.0032636514,0.006666446,0.0011754922],"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.000011714791,0.0000114077,0.00014391608,0.000113561255,0.000010429879,0.000025696987,0.00043549357,0.0014739056,0.0001631937,0.98800653,0.0012743676,0.008329827],"study_design_scores_gemma":[0.00000597015,0.00001515665,0.00017508959,0.000093132534,0.0000061554174,0.00005035002,0.00019723794,0.0018135121,0.00030633353,0.9582973,0.039026216,0.000013475836],"about_ca_topic_score_codex":0.0046033124,"about_ca_topic_score_gemma":0.0027263355,"teacher_disagreement_score":0.0075345044,"about_ca_system_score_codex":0.0047528804,"about_ca_system_score_gemma":0.0029290663,"threshold_uncertainty_score":0.034484684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15063944,0.0019393588,0.8290048,0.0018117009,0.00025357332,0.00006516372,0.000307761,0.00022043801,0.015757699],"genre_scores_gemma":[0.8483759,0.0020714828,0.13311623,0.00042500056,0.0006710987,0.00018892068,0.00045034318,0.00017954737,0.014521495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966904,0.0008273761,0.00028918622,0.00075558806,0.001097321,0.00034005323],"domain_scores_gemma":[0.97440004,0.018852396,0.001468079,0.0015098279,0.002128952,0.0016406565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050877547,0.00076284073,0.0011111214,0.002779151,0.0014034376,0.0051304055,0.0019388517,0.0016101418,0.004122463],"category_scores_gemma":[0.027387576,0.00093430316,0.001430549,0.0025913196,0.005783431,0.014774381,0.0034886026,0.0042420686,0.00030649954],"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.00007985601,0.00002136926,0.0004147194,0.00003844131,0.000013724512,0.00012709651,0.00039801537,0.0029827333,0.0005716129,0.99035954,0.0002159584,0.0047767675],"study_design_scores_gemma":[0.00003172875,0.000034222685,0.00036918672,0.000020729909,0.000017002008,0.00015372456,0.00016013508,0.037966646,0.00052340043,0.9590681,0.0016397903,0.000015268302],"about_ca_topic_score_codex":0.002063914,"about_ca_topic_score_gemma":0.0010764832,"teacher_disagreement_score":0.0051304055,"about_ca_system_score_codex":0.0021533403,"about_ca_system_score_gemma":0.0013763562,"threshold_uncertainty_score":0.026906908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0682742,0.003060518,0.82611465,0.0059654475,0.000287544,0.00010703661,0.00067923125,0.00057936553,0.09493206],"genre_scores_gemma":[0.86960524,0.001635678,0.103080705,0.00050341885,0.0004339152,0.00026352244,0.0006494319,0.00017319729,0.023654943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982476,0.000731389,0.000119305376,0.00028999848,0.00039824247,0.00021331942],"domain_scores_gemma":[0.9969548,0.0018129429,0.00018879223,0.00058039656,0.00026884527,0.00019417568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021713618,0.0011828904,0.0012009494,0.0014974574,0.0017580062,0.009034967,0.0020665133,0.002097074,0.0075613153],"category_scores_gemma":[0.005847432,0.0008210208,0.0022697968,0.001828022,0.0061699334,0.014286769,0.002433105,0.0035455702,0.00090600486],"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.000006165645,0.000003907002,0.000034576096,0.000009262627,0.0000032486023,0.0000116024685,0.00006256923,0.0014388987,0.000047125348,0.99759346,0.00018921247,0.00059991836],"study_design_scores_gemma":[0.000008064102,0.0000045905736,0.000022297063,0.000007773564,0.00000415199,0.000015168533,0.000032578268,0.009419898,0.000048411108,0.98899674,0.0014355924,0.000004755638],"about_ca_topic_score_codex":0.0028453805,"about_ca_topic_score_gemma":0.0029573052,"teacher_disagreement_score":0.009034967,"about_ca_system_score_codex":0.002901735,"about_ca_system_score_gemma":0.0013048551,"threshold_uncertainty_score":0.025295138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14258638,0.0010213057,0.8398922,0.0011036115,0.00015338216,0.000047238253,0.00015168806,0.00069704873,0.014347102],"genre_scores_gemma":[0.8637423,0.00065929076,0.1278815,0.00028325876,0.00015202753,0.00010250962,0.00035162675,0.00019935294,0.006628183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99511576,0.0016455799,0.000300917,0.0006239428,0.0018302731,0.00048342926],"domain_scores_gemma":[0.9843092,0.01067949,0.00075170305,0.002457475,0.0010811958,0.0007210093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031102307,0.0011066815,0.0016708244,0.0017796668,0.0012125197,0.005526169,0.0026182027,0.0017673848,0.004208226],"category_scores_gemma":[0.025435213,0.000929916,0.0014116915,0.002205284,0.0036632281,0.010064875,0.0065117055,0.0038663854,0.0005601179],"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.00017953533,0.000102652855,0.0010662229,0.00015191421,0.00004324075,0.00009597955,0.00046994427,0.050928373,0.0020656846,0.9130894,0.0009040265,0.030903088],"study_design_scores_gemma":[0.000025102187,0.000054972617,0.00018015289,0.000032762222,0.00002282254,0.00006399214,0.000132935,0.17585142,0.0016233991,0.82005817,0.0019406283,0.000013720394],"about_ca_topic_score_codex":0.0019200232,"about_ca_topic_score_gemma":0.0020107946,"teacher_disagreement_score":0.005526169,"about_ca_system_score_codex":0.0025424445,"about_ca_system_score_gemma":0.0009875665,"threshold_uncertainty_score":0.018446863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02758002,0.0056504067,0.8858369,0.004260049,0.00032351675,0.00007674427,0.0002893035,0.0006780074,0.07530499],"genre_scores_gemma":[0.68509287,0.005116212,0.2826432,0.00095711485,0.002109181,0.0002658661,0.00046772874,0.00063501333,0.02271272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952295,0.002495547,0.00027582503,0.00059194845,0.0011055146,0.00030172616],"domain_scores_gemma":[0.96651644,0.027625201,0.0012253454,0.0016374064,0.0019997016,0.0009959204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071049137,0.0011682527,0.0021654312,0.0055683223,0.0018855033,0.008156025,0.0025432827,0.001866005,0.0092630405],"category_scores_gemma":[0.029111018,0.0008971294,0.0019408423,0.005639798,0.006104406,0.013279871,0.0041913474,0.005929017,0.0011314998],"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.00002741912,0.000030555526,0.0002563546,0.000081091246,0.00001243265,0.00003305142,0.00021045688,0.005420202,0.00014012915,0.97008836,0.0016745803,0.022025347],"study_design_scores_gemma":[0.000013279632,0.000024205756,0.00019420595,0.000038421564,0.000023293347,0.00006466451,0.00010820111,0.054566722,0.00038564918,0.9404883,0.004075284,0.000017855933],"about_ca_topic_score_codex":0.00208998,"about_ca_topic_score_gemma":0.001624022,"teacher_disagreement_score":0.0092630405,"about_ca_system_score_codex":0.003736902,"about_ca_system_score_gemma":0.0013060278,"threshold_uncertainty_score":0.037574828},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65506524,0.0043247435,0.3052915,0.0018828766,0.0005591878,0.0001782439,0.00535035,0.007616519,0.01973133],"genre_scores_gemma":[0.9333716,0.00045648706,0.058317043,0.00020953844,0.00019561496,0.000057364326,0.004100594,0.00025033066,0.0030414672],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775594,0.0005994584,0.0001801709,0.00064436387,0.00065808627,0.00016194988],"domain_scores_gemma":[0.987689,0.009115679,0.0005389783,0.0010354839,0.0012968719,0.00032383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021997069,0.0004902025,0.0009833688,0.0018197014,0.0004990848,0.0018463342,0.0008347931,0.0010526668,0.0052658357],"category_scores_gemma":[0.021345478,0.00026565598,0.00049546815,0.0014311424,0.0003773966,0.0029362456,0.0017771858,0.0012164273,0.0033315243],"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.0063596633,0.00078845484,0.026524281,0.00094721484,0.00036494294,0.0004217169,0.001121864,0.015687829,0.061639827,0.008604674,0.024486477,0.85305303],"study_design_scores_gemma":[0.00030942235,0.0015032026,0.043241754,0.00016617893,0.00053088705,0.0011393178,0.0011499012,0.778981,0.11278532,0.045797504,0.014136615,0.00025883748],"about_ca_topic_score_codex":0.0041689477,"about_ca_topic_score_gemma":0.0054746796,"teacher_disagreement_score":0.0052658357,"about_ca_system_score_codex":0.0005583131,"about_ca_system_score_gemma":0.0010638093,"threshold_uncertainty_score":0.017615974},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01082529,0.02900167,0.030025402,0.73536336,0.0030379638,0.000029749126,0.00023150234,0.0002337461,0.19125143],"genre_scores_gemma":[0.5427292,0.02515548,0.03242129,0.1325947,0.0027956995,0.00016856947,0.0002679934,0.00087373535,0.26299328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988123,0.00036533078,0.000060349666,0.00022278445,0.00042241818,0.000116794676],"domain_scores_gemma":[0.99568474,0.002434158,0.00018927126,0.00038349646,0.0010006302,0.0003076471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030974047,0.00037281058,0.00041798168,0.00091894495,0.0036608863,0.0074483687,0.001050635,0.0055641145,0.018533958],"category_scores_gemma":[0.01666389,0.00049889594,0.00035517899,0.0010948662,0.011418957,0.017966269,0.0028361494,0.006920856,0.0029744275],"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.000019381943,0.000012706794,0.00023519491,0.00003917583,0.0000053373383,0.000042010895,0.000792432,0.0002006054,0.000081481805,0.8683553,0.11889337,0.011322981],"study_design_scores_gemma":[0.000014481228,0.000005014846,0.000314085,0.0000872931,0.0000052086107,0.00005453163,0.00075036834,0.00052423036,0.00021186759,0.7586863,0.23933235,0.000014254461],"about_ca_topic_score_codex":0.0129429195,"about_ca_topic_score_gemma":0.021380143,"teacher_disagreement_score":0.018533958,"about_ca_system_score_codex":0.0042971596,"about_ca_system_score_gemma":0.0035405634,"threshold_uncertainty_score":0.06200224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69577736,0.0029334985,0.16837062,0.005266987,0.0009544878,0.00010233048,0.0013983872,0.0013832914,0.12381305],"genre_scores_gemma":[0.9706342,0.00045711303,0.01537181,0.0005049565,0.00015552576,0.000080479214,0.0006833218,0.00014691513,0.011965693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779797,0.00036021316,0.00020771967,0.0006303534,0.0006013251,0.00040256913],"domain_scores_gemma":[0.99396175,0.002690177,0.00054069184,0.0008790673,0.0012542313,0.0006741023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020705676,0.0005764505,0.0012351755,0.002290576,0.004791184,0.008611561,0.0013450647,0.0019949556,0.0073506953],"category_scores_gemma":[0.004173852,0.0011863947,0.001827395,0.0024039438,0.007749445,0.015094851,0.0058475845,0.0034966613,0.0009987302],"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.00010033809,0.000014140433,0.0006772659,0.000051994033,0.000020245503,0.00009422943,0.00038868046,0.00017117034,0.0005273526,0.9943809,0.0008239222,0.0027497949],"study_design_scores_gemma":[0.000029604902,0.00003149941,0.0007232053,0.0000232912,0.00002889107,0.00035859208,0.00039387355,0.0008521213,0.0007728334,0.986819,0.009941545,0.0000256181],"about_ca_topic_score_codex":0.0029778033,"about_ca_topic_score_gemma":0.0023636254,"teacher_disagreement_score":0.008611561,"about_ca_system_score_codex":0.002064571,"about_ca_system_score_gemma":0.0014478444,"threshold_uncertainty_score":0.024590492},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5792991,0.00040242626,0.157652,0.0023747596,0.00036801054,0.000077730714,0.00035415703,0.0009364903,0.25853527],"genre_scores_gemma":[0.9774139,0.00008283028,0.0069731507,0.00011527867,0.00006713913,0.000020430847,0.00011133199,0.00017217951,0.015043825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909055,0.0002318108,0.000034054476,0.00014544374,0.00029943098,0.00019873207],"domain_scores_gemma":[0.99669814,0.0014560982,0.00024163986,0.0007344478,0.00044832914,0.00042137818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073220325,0.00040469322,0.0005513823,0.0009111424,0.0014043968,0.0051559554,0.00080537994,0.00095208565,0.01922302],"category_scores_gemma":[0.007548666,0.00044068543,0.00045348713,0.00075567747,0.0039959108,0.006326673,0.0032283175,0.0027250992,0.00094040297],"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.0001467192,0.000015069791,0.0003473269,0.00003994337,0.000004671864,0.0001311305,0.0010084921,0.0008161159,0.0019304672,0.99056166,0.0008238989,0.0041745324],"study_design_scores_gemma":[0.00006418836,0.00008947259,0.0012613044,0.000032381195,0.000019965271,0.0003407926,0.0015757054,0.012241724,0.002639798,0.9714698,0.010229193,0.000035632533],"about_ca_topic_score_codex":0.0005410758,"about_ca_topic_score_gemma":0.000398439,"teacher_disagreement_score":0.01922302,"about_ca_system_score_codex":0.00084716483,"about_ca_system_score_gemma":0.00031268856,"threshold_uncertainty_score":0.06430733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39747682,0.0034181736,0.537623,0.0048506483,0.00016705948,0.00004554282,0.00028529105,0.00038577284,0.05574771],"genre_scores_gemma":[0.9710722,0.00089746376,0.022743717,0.00010811231,0.00008720803,0.00006876796,0.00009524033,0.000100370555,0.0048269755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944144,0.00017073925,0.000032456763,0.00010861317,0.0001741503,0.00007261568],"domain_scores_gemma":[0.9907238,0.007892495,0.00053603237,0.00038586397,0.00028846154,0.00017335765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010466016,0.00045371373,0.00037719304,0.0014009225,0.00042217938,0.0016399394,0.00049788266,0.00065753364,0.0059841773],"category_scores_gemma":[0.009930509,0.00035102642,0.00036031497,0.0008819901,0.0031434754,0.0030048373,0.0012571933,0.0011642062,0.00036120642],"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.000073553594,0.000035756882,0.0026037837,0.00011005853,0.000036077734,0.00009270633,0.00024307099,0.056245055,0.0053337514,0.91868126,0.00045908126,0.016085735],"study_design_scores_gemma":[0.000012564967,0.000039535782,0.0033648384,0.000038901384,0.000015575437,0.00017975643,0.00008013348,0.19702928,0.005544185,0.79098165,0.0026707125,0.000042971464],"about_ca_topic_score_codex":0.0014889246,"about_ca_topic_score_gemma":0.0010584415,"teacher_disagreement_score":0.0059841773,"about_ca_system_score_codex":0.0019643453,"about_ca_system_score_gemma":0.0006809258,"threshold_uncertainty_score":0.020019114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8449244,0.0007292101,0.12702861,0.00087742956,0.000049223585,0.00004301669,0.00017096529,0.0003936935,0.025783384],"genre_scores_gemma":[0.9927341,0.000084227,0.005907548,0.000035523426,0.000039155224,0.000014156761,0.00003545053,0.000013586045,0.0011363681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819535,0.00031994013,0.00011294724,0.00055398355,0.0005280991,0.00028970468],"domain_scores_gemma":[0.9928397,0.004665071,0.0005812029,0.000721003,0.000647517,0.00054548634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020345983,0.00027194346,0.00055543863,0.0021385083,0.0015240221,0.003093919,0.0007033716,0.0008164626,0.002846796],"category_scores_gemma":[0.011475379,0.0003555857,0.00078502344,0.0007703981,0.006055128,0.0071831294,0.002623877,0.0015641549,0.00021462256],"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.000050901694,0.000019174397,0.0020139415,0.000040853178,0.000013014309,0.00015017547,0.0009841457,0.002448678,0.00276512,0.9872843,0.00017115448,0.0040585757],"study_design_scores_gemma":[0.00000942021,0.000028454708,0.00082839874,0.000025730134,0.000014891729,0.00024300485,0.0002873525,0.013501327,0.004414715,0.9781528,0.0024747688,0.000019111914],"about_ca_topic_score_codex":0.000908771,"about_ca_topic_score_gemma":0.00063542556,"teacher_disagreement_score":0.003093919,"about_ca_system_score_codex":0.0017198315,"about_ca_system_score_gemma":0.00046420994,"threshold_uncertainty_score":0.012478292},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21591695,0.0229143,0.18855204,0.26119626,0.005299302,0.00005661403,0.00048119033,0.00042795812,0.3051554],"genre_scores_gemma":[0.9802801,0.0028204154,0.0031221432,0.005208999,0.0008194315,0.000011739571,0.000056138124,0.00003259916,0.007648405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985948,0.0007740189,0.0000647056,0.00015161051,0.00033384693,0.000081030004],"domain_scores_gemma":[0.99079263,0.0047723735,0.0012746431,0.0014099006,0.0014686969,0.00028178358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002321239,0.00029423134,0.0003051967,0.00059998716,0.0011401556,0.0046231197,0.0005263286,0.0024872606,0.004688789],"category_scores_gemma":[0.019757684,0.00015753208,0.0002255219,0.00035394068,0.007942904,0.0071916906,0.0015737391,0.004047399,0.00076640124],"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.00013628915,0.000035672834,0.0021555028,0.00023657668,0.000060527676,0.0006415201,0.006219475,0.0027685508,0.0025286626,0.9245863,0.021795146,0.038835797],"study_design_scores_gemma":[0.000014190479,0.000034195447,0.00081884384,0.00016662743,0.000027585831,0.00050373975,0.0013244217,0.004796601,0.001671305,0.9530215,0.03758839,0.000032668697],"about_ca_topic_score_codex":0.0006766575,"about_ca_topic_score_gemma":0.0004315945,"teacher_disagreement_score":0.004688789,"about_ca_system_score_codex":0.0008683499,"about_ca_system_score_gemma":0.00045201715,"threshold_uncertainty_score":0.015685618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104417466,0.0010321862,0.8695471,0.002094779,0.00009657787,0.00009144149,0.00078539643,0.00035906857,0.021575963],"genre_scores_gemma":[0.87582886,0.00094259786,0.11358826,0.0005418439,0.00023496828,0.00033897895,0.0010639892,0.000156799,0.0073036975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943218,0.0014913331,0.0005095956,0.0009795828,0.0020469872,0.0006507455],"domain_scores_gemma":[0.9847007,0.009560692,0.0010805876,0.0024336025,0.0017167774,0.0005076837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029723055,0.00072514947,0.0009850763,0.0026073114,0.0016544824,0.006085152,0.0016632511,0.001698491,0.0037931437],"category_scores_gemma":[0.015708383,0.0005323328,0.0021597955,0.002625768,0.0065338397,0.014654473,0.0042539244,0.004437336,0.00047733053],"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.000014243801,0.000008404549,0.00019280014,0.000031129486,0.000007407325,0.000036256384,0.00013743386,0.004566379,0.00030794513,0.99125004,0.00020859277,0.0032394344],"study_design_scores_gemma":[0.0000040617983,0.000013162738,0.00011215151,0.0000134989605,0.000008113078,0.00004754444,0.000046902554,0.024644755,0.00066958315,0.97267085,0.0017537752,0.000015510424],"about_ca_topic_score_codex":0.0015651262,"about_ca_topic_score_gemma":0.0007359781,"teacher_disagreement_score":0.006085152,"about_ca_system_score_codex":0.0043604462,"about_ca_system_score_gemma":0.0016021874,"threshold_uncertainty_score":0.03163743},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015727988,0.95777136,0.0010256122,0.030850654,0.0053652977,0.000005707428,0.00004759069,0.000016290473,0.004760236],"genre_scores_gemma":[0.004260176,0.9658486,0.0007379684,0.0056705005,0.016056316,0.000015707757,0.00012550058,0.00003943616,0.0072458535],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988261,0.00029681204,0.00007533424,0.00020711198,0.0005157926,0.00007881435],"domain_scores_gemma":[0.9944652,0.0029278037,0.00027410858,0.00017694607,0.0017625381,0.0003933956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022237443,0.0009951328,0.0013446376,0.004115337,0.0008297501,0.0025293361,0.0011154006,0.001397303,0.0070089144],"category_scores_gemma":[0.0065229316,0.0006790228,0.000614597,0.0069442885,0.0029635855,0.0057190857,0.0012726907,0.005266705,0.0056991563],"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.000055915058,0.00003043359,0.00021815956,0.0026994327,0.000054144984,0.000044358974,0.00014264324,0.00058557617,0.0003240799,0.062417362,0.779479,0.15394889],"study_design_scores_gemma":[0.0000099086765,0.000020662508,0.00041174405,0.0011420228,0.000017998766,0.00012832646,0.000065775865,0.00020629025,0.00013971029,0.031015856,0.96682537,0.000016393502],"about_ca_topic_score_codex":0.0036638237,"about_ca_topic_score_gemma":0.004455995,"teacher_disagreement_score":0.0070089144,"about_ca_system_score_codex":0.0028639284,"about_ca_system_score_gemma":0.0025679048,"threshold_uncertainty_score":0.023447156},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34287238,0.0013590609,0.56717646,0.0042250664,0.00026472655,0.0001664314,0.00084920047,0.0015108996,0.08157572],"genre_scores_gemma":[0.97767913,0.00015491915,0.017362505,0.00040303572,0.0001459925,0.00006108515,0.00024224086,0.00005572565,0.003895265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950805,0.0011246157,0.00035134185,0.0009788134,0.0016144641,0.00085032434],"domain_scores_gemma":[0.9878898,0.0063676317,0.0010228236,0.0021701842,0.0019027631,0.0006467901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025076903,0.00053105137,0.0009383341,0.0026837077,0.0021505982,0.0040849647,0.0013390502,0.0010008576,0.007094366],"category_scores_gemma":[0.009851954,0.00055799045,0.0013243443,0.0016052466,0.006846439,0.008279577,0.0035569596,0.0037072827,0.00081391784],"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.00009261623,0.000029861654,0.00065034995,0.00006341155,0.000022840373,0.00009267986,0.00040046003,0.003203966,0.0018108306,0.987182,0.0010456247,0.005405308],"study_design_scores_gemma":[0.000010144526,0.0000204227,0.0002719378,0.00001370459,0.000011763985,0.000095681076,0.00016239354,0.0069815665,0.0030111508,0.9874894,0.0019090518,0.000022831846],"about_ca_topic_score_codex":0.0010101608,"about_ca_topic_score_gemma":0.0007524553,"teacher_disagreement_score":0.007094366,"about_ca_system_score_codex":0.0025122329,"about_ca_system_score_gemma":0.0008468239,"threshold_uncertainty_score":0.02373296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40860918,0.002463794,0.53042704,0.002198331,0.00025467365,0.00005485342,0.00060706696,0.00044016464,0.054944854],"genre_scores_gemma":[0.9610347,0.00072788115,0.025041657,0.00016252426,0.00018929136,0.00006351433,0.00053172436,0.00009707257,0.012151629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824023,0.000585271,0.00015790483,0.0002551177,0.00050670933,0.00025476952],"domain_scores_gemma":[0.99522144,0.0023613377,0.0004823939,0.00055587274,0.0006989656,0.000679987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014513175,0.0007522015,0.00093690795,0.0018989742,0.0016891444,0.0055998336,0.0010391496,0.00087172614,0.005499963],"category_scores_gemma":[0.005786769,0.00077049836,0.00080669724,0.0019071539,0.0056337477,0.012343713,0.003638999,0.0033190427,0.00056723243],"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.00002548251,0.000012403986,0.0001540011,0.00001863656,0.0000049294304,0.000018378922,0.00018479848,0.00046203393,0.0002782017,0.9968753,0.0001931774,0.0017726771],"study_design_scores_gemma":[0.0000075453995,0.00001000717,0.00010574484,0.00000878436,0.000004328399,0.000029095505,0.00009532055,0.0033188493,0.00030857598,0.9950991,0.0010058897,0.0000068115473],"about_ca_topic_score_codex":0.0008511701,"about_ca_topic_score_gemma":0.0009652632,"teacher_disagreement_score":0.0055998336,"about_ca_system_score_codex":0.0012752551,"about_ca_system_score_gemma":0.0009792607,"threshold_uncertainty_score":0.018399179},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5224635,0.0014447548,0.41994062,0.002091736,0.00036224874,0.00016483001,0.0010491922,0.0008087508,0.051674366],"genre_scores_gemma":[0.95144606,0.00031654397,0.03910205,0.00028316726,0.00030861876,0.00013080447,0.00081967015,0.00014525787,0.0074478462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630094,0.0006289037,0.00045176788,0.0007653118,0.0013744985,0.00047846793],"domain_scores_gemma":[0.97598594,0.015382781,0.0023736537,0.0026220572,0.0023870585,0.0012484113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027928315,0.0005731557,0.001063052,0.004384018,0.0031034462,0.0083555775,0.0024412817,0.0015869976,0.0084252665],"category_scores_gemma":[0.017614642,0.0009501803,0.0015800152,0.0033105812,0.005386723,0.012463174,0.0043507502,0.0031356865,0.0007476478],"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.00005945893,0.00002588273,0.000693323,0.000044845845,0.000009374962,0.00011871135,0.00067393377,0.0006034769,0.000792472,0.9927527,0.00037081083,0.003855021],"study_design_scores_gemma":[0.000016290323,0.000026033746,0.0003990627,0.000029232086,0.000012291257,0.00020590334,0.00033457973,0.0057009947,0.0015246667,0.988545,0.0031806298,0.000025399459],"about_ca_topic_score_codex":0.00065621396,"about_ca_topic_score_gemma":0.0006200718,"teacher_disagreement_score":0.0084252665,"about_ca_system_score_codex":0.0021856376,"about_ca_system_score_gemma":0.0012818804,"threshold_uncertainty_score":0.028185308},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011489121,0.076528065,0.776779,0.010874191,0.0008981095,0.00011299564,0.00021565484,0.0004354935,0.1226673],"genre_scores_gemma":[0.77359533,0.067025304,0.13825792,0.0022908053,0.0029341257,0.00056448625,0.00022430063,0.00013373437,0.01497392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991979,0.00023242059,0.000049223312,0.00018102954,0.0002625062,0.000076948476],"domain_scores_gemma":[0.99800164,0.0014131552,0.00010249346,0.00016622202,0.00025038313,0.000066155255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010826286,0.0008971756,0.0008465346,0.0016405617,0.0007067911,0.0032587922,0.0014403736,0.0022235042,0.00540265],"category_scores_gemma":[0.004688967,0.00030859862,0.0007954229,0.0018412285,0.0046552955,0.0026559304,0.0014418042,0.0021412536,0.00068330666],"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.00001539073,0.000032062326,0.00050265866,0.0003138004,0.00004409823,0.00006693875,0.00016111322,0.023490332,0.0002764429,0.9115043,0.0027630257,0.06082976],"study_design_scores_gemma":[0.0000117328245,0.000026929696,0.00038080936,0.00015022155,0.00001439945,0.00007380851,0.00007492216,0.04839079,0.00019686813,0.9325531,0.018104162,0.000022315453],"about_ca_topic_score_codex":0.0052817,"about_ca_topic_score_gemma":0.001249654,"teacher_disagreement_score":0.00540265,"about_ca_system_score_codex":0.0023671957,"about_ca_system_score_gemma":0.0016570014,"threshold_uncertainty_score":0.018073678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5803302,0.0013728044,0.3186113,0.014322512,0.0005173804,0.0002445113,0.0018556196,0.0010651959,0.08168045],"genre_scores_gemma":[0.91796184,0.0006503258,0.060568143,0.002276183,0.0004036255,0.00038608504,0.0021380307,0.00024207728,0.015373691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980673,0.0003878846,0.00010680792,0.0006402312,0.00045904302,0.00033876725],"domain_scores_gemma":[0.98000515,0.015412204,0.0012054789,0.0016011253,0.0008894997,0.00088649243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012423245,0.0006264222,0.0016037371,0.00056978106,0.0024474463,0.0040429095,0.0021875738,0.0017739605,0.010164082],"category_scores_gemma":[0.014854839,0.0008378509,0.0010588322,0.00076704496,0.0031874748,0.008442449,0.0038658583,0.004722424,0.0014802677],"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.0011767099,0.00042396475,0.006392154,0.0017410974,0.0002893231,0.0011238074,0.0011865125,0.025267059,0.017550576,0.83961815,0.02689252,0.078338124],"study_design_scores_gemma":[0.00008491971,0.00009045839,0.0009884977,0.000059541544,0.00005461312,0.0006962515,0.0005913142,0.03411468,0.0065390253,0.9453931,0.011358761,0.000028733843],"about_ca_topic_score_codex":0.0004060806,"about_ca_topic_score_gemma":0.0007258069,"teacher_disagreement_score":0.010164082,"about_ca_system_score_codex":0.0008447857,"about_ca_system_score_gemma":0.0006746025,"threshold_uncertainty_score":0.034002244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4584079,0.0043546027,0.5081939,0.0025752317,0.0002321843,0.000099428464,0.00080152,0.0020277246,0.023307547],"genre_scores_gemma":[0.9658373,0.0005952583,0.029237552,0.00015172061,0.00033117848,0.000051151797,0.00030251098,0.00041093727,0.0030823925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930864,0.0015449293,0.00033365842,0.0010361501,0.002396597,0.0016023288],"domain_scores_gemma":[0.87536484,0.10227923,0.005764809,0.008488218,0.0051779626,0.0029249827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0100222435,0.00124894,0.0025209745,0.0062225685,0.0019826142,0.0047467067,0.0066827782,0.0027166954,0.010596308],"category_scores_gemma":[0.083246335,0.0012165844,0.0014290669,0.0073060663,0.0047840704,0.019040298,0.0029970803,0.0033670892,0.000737599],"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.0007466107,0.00028892324,0.006557367,0.00031046255,0.000118941374,0.00057678286,0.00034861598,0.51552415,0.0035652397,0.42984483,0.004674954,0.03744325],"study_design_scores_gemma":[0.000015376001,0.00004304836,0.0006576087,0.000015631205,0.000038968843,0.00020114948,0.00004882202,0.90719163,0.0011550772,0.0902165,0.0003920824,0.00002404781],"about_ca_topic_score_codex":0.0042565954,"about_ca_topic_score_gemma":0.004287078,"teacher_disagreement_score":0.010596308,"about_ca_system_score_codex":0.0042403387,"about_ca_system_score_gemma":0.0029885352,"threshold_uncertainty_score":0.05300331},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023406211,0.011579585,0.00077405525,0.0357606,0.92936003,0.00005332225,0.00021773129,0.00016110158,0.021859618],"genre_scores_gemma":[0.00343443,0.0099135125,0.0006633239,0.010069736,0.8575864,0.00013576551,0.0005845721,0.00035863652,0.11725372],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971149,0.00040110326,0.0002644646,0.0005253659,0.0012813034,0.0004129313],"domain_scores_gemma":[0.98941857,0.0017718811,0.00057583366,0.00061773637,0.005320697,0.002295296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037739861,0.0033549152,0.0037675411,0.005936481,0.0034541604,0.0103940265,0.0031411767,0.006158348,0.1118008],"category_scores_gemma":[0.009086918,0.00091453356,0.002296017,0.00345834,0.0010857964,0.0060337167,0.0033543252,0.008743297,0.048974175],"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.000034347868,0.000020418247,0.000043643126,0.00015717154,0.000007672828,0.000031322892,0.000007038439,0.00004724337,0.00010865389,0.0015178337,0.98796916,0.010055515],"study_design_scores_gemma":[0.000039798797,0.00004761585,0.0005490629,0.00028109472,0.000029276975,0.00011709583,0.000029568397,0.00043002836,0.00028516483,0.0031726619,0.9949982,0.00002045379],"about_ca_topic_score_codex":0.0010813866,"about_ca_topic_score_gemma":0.0026242526,"teacher_disagreement_score":0.1118008,"about_ca_system_score_codex":0.003809782,"about_ca_system_score_gemma":0.0027439883,"threshold_uncertainty_score":0.37401092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46351236,0.00070390897,0.45815298,0.0017433831,0.0003733923,0.00032290383,0.0011090895,0.0035408204,0.070541084],"genre_scores_gemma":[0.9159885,0.00015877959,0.07601741,0.00032205513,0.0000936302,0.00009285037,0.0005815195,0.00036847714,0.0063768495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740076,0.00048530864,0.00027697725,0.00074281427,0.0006188219,0.0004752812],"domain_scores_gemma":[0.99561226,0.0009894482,0.0007344572,0.0016943396,0.0006460891,0.00032332673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018023624,0.0010089985,0.00087683974,0.0011352515,0.001320355,0.0030814619,0.0013310271,0.0012626029,0.009553883],"category_scores_gemma":[0.0063876733,0.00053270895,0.0018295088,0.0008624882,0.004373028,0.0077919634,0.0048990482,0.0014554177,0.0015711534],"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.0014653814,0.00013993419,0.009817561,0.0007483768,0.0001771456,0.0007497009,0.001093822,0.01944368,0.041262724,0.8636436,0.005056925,0.05640123],"study_design_scores_gemma":[0.000106557665,0.00038079754,0.0035299372,0.00019710916,0.00017351263,0.0011943805,0.00044308804,0.04040508,0.056607038,0.8626285,0.03415898,0.00017489803],"about_ca_topic_score_codex":0.0006082414,"about_ca_topic_score_gemma":0.00087253796,"teacher_disagreement_score":0.009553883,"about_ca_system_score_codex":0.0017877087,"about_ca_system_score_gemma":0.0008143166,"threshold_uncertainty_score":0.031960905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14477678,0.0009562142,0.81501496,0.0015921303,0.00012691057,0.00011561733,0.0005057507,0.00097555056,0.035936218],"genre_scores_gemma":[0.91864264,0.00049449946,0.07446375,0.0002674038,0.00007681741,0.00016301528,0.00054172653,0.0001349291,0.005215368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526346,0.0012416214,0.0006085875,0.0008130058,0.0014813159,0.0005921177],"domain_scores_gemma":[0.99459887,0.0020381096,0.0004921004,0.0010751925,0.001539631,0.00025624962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023909106,0.0005624426,0.00067671196,0.0013045726,0.0010020966,0.0033906712,0.0011651291,0.000992406,0.0027313733],"category_scores_gemma":[0.0091101965,0.00038690196,0.0012565905,0.0014048156,0.007526838,0.009284429,0.0028980523,0.0024529009,0.00038819062],"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.000005886056,0.0000046531463,0.0001271664,0.000016736483,0.00000317978,0.000017707775,0.00011340439,0.0015477773,0.0003673796,0.9957942,0.00012981956,0.0018721696],"study_design_scores_gemma":[0.000014051088,0.000019597248,0.0001592597,0.000030095072,0.00001573452,0.0000865932,0.00015649259,0.019635297,0.0035674218,0.96895313,0.0073395865,0.000022651422],"about_ca_topic_score_codex":0.004357592,"about_ca_topic_score_gemma":0.0023485892,"teacher_disagreement_score":0.004357592,"about_ca_system_score_codex":0.003136575,"about_ca_system_score_gemma":0.002282422,"threshold_uncertainty_score":0.02275753},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21644568,0.00089318835,0.5773773,0.0033637157,0.00069556345,0.00031973416,0.0026578265,0.0023045365,0.19594243],"genre_scores_gemma":[0.75261843,0.0004616638,0.1804232,0.0010076243,0.00017243778,0.00034618456,0.0029459172,0.0008050707,0.0612195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976057,0.00046252855,0.0001461043,0.0006749933,0.00063523365,0.00047533584],"domain_scores_gemma":[0.99770963,0.0006299902,0.00015517834,0.00027876033,0.00073372613,0.00049272086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012269638,0.0010206574,0.00084003207,0.0014554968,0.0019690215,0.0029326545,0.0013623948,0.0011224134,0.018496905],"category_scores_gemma":[0.0045770085,0.0009120053,0.0017132498,0.00073147274,0.0020850543,0.005498651,0.0045015733,0.0028900702,0.0041024885],"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.00016991056,0.00007495458,0.0008055291,0.00020394713,0.000041619995,0.00026807448,0.0004231363,0.0014909441,0.0047022407,0.9717743,0.0053062458,0.014739177],"study_design_scores_gemma":[0.00007029145,0.000099025354,0.00072147365,0.00009099895,0.000052352327,0.00045039994,0.0004952335,0.0068544927,0.0076865177,0.94548005,0.037939917,0.000059182017],"about_ca_topic_score_codex":0.00092714425,"about_ca_topic_score_gemma":0.0018817936,"teacher_disagreement_score":0.018496905,"about_ca_system_score_codex":0.0022431358,"about_ca_system_score_gemma":0.0010728376,"threshold_uncertainty_score":0.061878324},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021161651,0.010778673,0.4000783,0.0094717005,0.0038510177,0.00018729069,0.009963,0.00680958,0.5376988],"genre_scores_gemma":[0.43378904,0.015552662,0.1793061,0.002150307,0.0047516255,0.0007242704,0.027009824,0.005819443,0.3308968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979765,0.00032804746,0.0001988519,0.00030406774,0.0010452714,0.00014735665],"domain_scores_gemma":[0.99523216,0.0018677488,0.00026000498,0.0017116248,0.000700943,0.00022743877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016575673,0.0009967639,0.0018768195,0.0057582096,0.0031623123,0.00994558,0.0027074637,0.0011738949,0.060899112],"category_scores_gemma":[0.009251888,0.0010730645,0.0013810181,0.010769272,0.0025575904,0.0119344555,0.00375657,0.0055630514,0.015963405],"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.00006421617,0.000049450828,0.00015195539,0.0001487471,0.000018210272,0.000052652882,0.0001730782,0.0010976709,0.00038433075,0.8946264,0.045389757,0.05784348],"study_design_scores_gemma":[0.00001368066,0.000009729876,0.00015342736,0.00006155567,0.0000189012,0.00011294847,0.000061466264,0.002774185,0.0008162633,0.8824814,0.113478616,0.00001781749],"about_ca_topic_score_codex":0.001060512,"about_ca_topic_score_gemma":0.0012977547,"teacher_disagreement_score":0.060899112,"about_ca_system_score_codex":0.0028532709,"about_ca_system_score_gemma":0.0014374317,"threshold_uncertainty_score":0.20372784},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09178384,0.0034261683,0.66104585,0.033005323,0.0026260377,0.00011586245,0.00066451775,0.0009744113,0.20635799],"genre_scores_gemma":[0.9184222,0.0008295919,0.0595847,0.0031718016,0.0018200971,0.00023970458,0.00025205486,0.00028993524,0.015389889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995509,0.0011984007,0.0002465356,0.0008282717,0.0017398754,0.00047790987],"domain_scores_gemma":[0.98398834,0.01122298,0.00053743634,0.0019467587,0.001590833,0.0007136084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042504882,0.0012485072,0.0020135792,0.0030771422,0.004016656,0.0057184547,0.0038407757,0.0034043575,0.008769649],"category_scores_gemma":[0.020781985,0.0012742667,0.0030931672,0.0025684505,0.0139337,0.015591088,0.0077884216,0.009341216,0.0011260852],"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.000010629856,0.000010746094,0.00005246729,0.000017495942,0.000006859172,0.000022566459,0.000067136774,0.00040766396,0.00011391708,0.99725276,0.00079359056,0.0012441988],"study_design_scores_gemma":[0.000009845783,0.0000058436453,0.00005431214,0.00000869242,0.0000053548615,0.00002504808,0.000017354385,0.0027413166,0.00017467137,0.9955884,0.0013616853,0.000007526422],"about_ca_topic_score_codex":0.0014428654,"about_ca_topic_score_gemma":0.0010838783,"teacher_disagreement_score":0.008769649,"about_ca_system_score_codex":0.0045358236,"about_ca_system_score_gemma":0.0020070977,"threshold_uncertainty_score":0.03290987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8256747,0.00075398706,0.15273747,0.00046283047,0.00008772311,0.000036025427,0.00014032371,0.00012197942,0.019984929],"genre_scores_gemma":[0.98697996,0.00012014286,0.010553477,0.00006225279,0.00009308869,0.00005060295,0.00009156895,0.000021803924,0.0020271256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848676,0.00039547554,0.0001119227,0.00031860528,0.0005121662,0.00017509851],"domain_scores_gemma":[0.994414,0.0029512595,0.00068203214,0.00047564635,0.00087266776,0.00060438126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012762509,0.00026905915,0.0006762565,0.002454667,0.0012901317,0.0022060364,0.0008787074,0.0008585905,0.0028189095],"category_scores_gemma":[0.010913975,0.00024794176,0.00043790028,0.001592386,0.0029908975,0.0040037846,0.0021829687,0.00078803266,0.000331748],"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.00014479348,0.00003429076,0.0030205336,0.00008790706,0.000023361104,0.00027705604,0.0010905393,0.0031187495,0.004791342,0.97684175,0.00045357115,0.010116233],"study_design_scores_gemma":[0.000021678085,0.00012544154,0.003930476,0.000053684795,0.000027484724,0.00089889637,0.0007647136,0.05320096,0.0035045582,0.9338372,0.0035741024,0.000060872073],"about_ca_topic_score_codex":0.000698661,"about_ca_topic_score_gemma":0.00037074604,"teacher_disagreement_score":0.0028189095,"about_ca_system_score_codex":0.00091570977,"about_ca_system_score_gemma":0.00032526243,"threshold_uncertainty_score":0.00943023},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12623727,0.0015508409,0.15173054,0.16086431,0.002684589,0.00012187371,0.0005250476,0.0006507681,0.55563474],"genre_scores_gemma":[0.9655664,0.00047912882,0.014709346,0.007809929,0.00050846324,0.00014907023,0.00014991652,0.00017793218,0.010449918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948289,0.0020190675,0.00030952154,0.00097179506,0.0012403292,0.00063031114],"domain_scores_gemma":[0.9808009,0.010993743,0.00081651245,0.0049066027,0.0015736836,0.0009085746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00951767,0.0005029272,0.00097254297,0.0010823301,0.004669424,0.0052815317,0.001835223,0.0047628446,0.007867132],"category_scores_gemma":[0.025662566,0.0005154175,0.0012447127,0.00065531995,0.026236938,0.014966827,0.0063315816,0.00960282,0.0009808695],"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.000017839422,0.0000097024185,0.000078106656,0.000013575749,0.0000047134263,0.000014649126,0.0002395723,0.00011058769,0.00012992704,0.9976343,0.0008144328,0.00093261927],"study_design_scores_gemma":[0.000015270773,0.0000073029087,0.000117271986,0.000008294884,0.0000050289805,0.000023744633,0.00013994826,0.00038837036,0.00018949922,0.99384815,0.0052483683,0.000008775359],"about_ca_topic_score_codex":0.0026944214,"about_ca_topic_score_gemma":0.0013332207,"teacher_disagreement_score":0.00951767,"about_ca_system_score_codex":0.0026581818,"about_ca_system_score_gemma":0.0023631598,"threshold_uncertainty_score":0.05033487},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7478,0.0052348725,0.14965974,0.0060548866,0.00050848274,0.000058119196,0.00025583047,0.0003925537,0.09003552],"genre_scores_gemma":[0.9701484,0.0011543786,0.014206103,0.00025755187,0.0006346265,0.00010301491,0.00016023773,0.00007485237,0.013260854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914527,0.00022340009,0.000033897497,0.00014017882,0.00030230006,0.0001548507],"domain_scores_gemma":[0.9916643,0.005945059,0.0006141574,0.00045619265,0.00043208303,0.00088829786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001856041,0.0007280469,0.0011656771,0.003888085,0.0022098457,0.0045299022,0.0014141902,0.0015844837,0.00587069],"category_scores_gemma":[0.015043583,0.00060679356,0.0005860072,0.0022721058,0.0056774514,0.010184712,0.002695643,0.003960577,0.0005723968],"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.000031183143,0.000007813306,0.00023678369,0.000020844607,0.0000035806909,0.000028978919,0.00023933504,0.0009127135,0.0003805304,0.99527377,0.00031582738,0.0025487167],"study_design_scores_gemma":[0.0000071370855,0.000005483859,0.000200296,0.000008231768,0.0000035294158,0.00004784811,0.00003879262,0.004368111,0.00023490471,0.9940785,0.0010006505,0.000006497424],"about_ca_topic_score_codex":0.00062706973,"about_ca_topic_score_gemma":0.0005216159,"teacher_disagreement_score":0.00587069,"about_ca_system_score_codex":0.002193736,"about_ca_system_score_gemma":0.00050928,"threshold_uncertainty_score":0.019639432},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015245643,0.006441793,0.0065355836,0.35008743,0.6028108,0.000038438484,0.0015582866,0.0005951117,0.030407945],"genre_scores_gemma":[0.077772744,0.022064062,0.01926254,0.23329768,0.16799511,0.0002624535,0.003382706,0.0027838757,0.47317883],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99709976,0.00054645276,0.00039824078,0.0004401424,0.0012825431,0.00023291759],"domain_scores_gemma":[0.9849353,0.007218902,0.0007602019,0.00078827766,0.0058572167,0.00044008924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038804212,0.0018128598,0.0013362131,0.0024509274,0.0044199307,0.0031676001,0.0025853664,0.0035904043,0.03974045],"category_scores_gemma":[0.034807425,0.0008956203,0.0013168381,0.0019060966,0.005199113,0.005111459,0.0017217088,0.009508454,0.01702625],"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.000058668877,0.000010065828,0.00009914939,0.000090693335,0.00001065941,0.000120025354,0.00012753355,0.000069252885,0.000092681024,0.017081354,0.9758078,0.0064321887],"study_design_scores_gemma":[0.000054343087,0.000034315028,0.0013655423,0.00031096704,0.000051794585,0.00048999215,0.00029614786,0.00063017115,0.0007300071,0.033110123,0.9628462,0.000080358164],"about_ca_topic_score_codex":0.01570906,"about_ca_topic_score_gemma":0.015928956,"teacher_disagreement_score":0.03974045,"about_ca_system_score_codex":0.0046613356,"about_ca_system_score_gemma":0.0026158951,"threshold_uncertainty_score":0.132945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42638007,0.0039116195,0.27628058,0.018594418,0.00029060553,0.00007040055,0.00026840885,0.00047356036,0.27373037],"genre_scores_gemma":[0.9887304,0.00029669277,0.006118807,0.00034695034,0.000092902264,0.000016742872,0.000034286328,0.000011471587,0.004351892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906915,0.00031565272,0.000059405964,0.0001714602,0.0002893453,0.00009501796],"domain_scores_gemma":[0.99781126,0.0012827547,0.00023121302,0.000245753,0.0003636527,0.000065387016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018424613,0.0002475357,0.00037529526,0.00074148574,0.0007274643,0.001922425,0.00073937816,0.00072491594,0.003824727],"category_scores_gemma":[0.0035367634,0.00017258275,0.00046366954,0.0006121674,0.008767295,0.0038514924,0.0015795106,0.0020976497,0.0002598141],"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.000010526151,0.0000069788184,0.00013773952,0.000019071833,0.0000047565404,0.00002454832,0.00014036808,0.0007771088,0.00022716253,0.99685895,0.00021288171,0.0015797963],"study_design_scores_gemma":[0.0000054023485,0.0000066639705,0.00017148278,0.000008026317,0.000003384329,0.00002617319,0.00004920271,0.0021448007,0.00019385458,0.9956793,0.0017086696,0.0000030665299],"about_ca_topic_score_codex":0.0018513597,"about_ca_topic_score_gemma":0.0018802297,"teacher_disagreement_score":0.003824727,"about_ca_system_score_codex":0.00208113,"about_ca_system_score_gemma":0.0009555585,"threshold_uncertainty_score":0.015099704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12622215,0.0027685913,0.4889293,0.02430819,0.0013251235,0.00011696922,0.0008477401,0.0009148842,0.35456708],"genre_scores_gemma":[0.9511598,0.0009921079,0.026509387,0.0019106682,0.0010113486,0.00011033034,0.00031198002,0.0002714992,0.017723018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710065,0.0009090369,0.00016605263,0.00056470354,0.00091673376,0.00034289664],"domain_scores_gemma":[0.98372155,0.010691886,0.0006119137,0.0029220886,0.0014196829,0.00063283497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046208296,0.0005795164,0.0013827151,0.0016959315,0.0022966748,0.00515898,0.0022090487,0.0024382945,0.017499667],"category_scores_gemma":[0.02165646,0.00072634564,0.0012328693,0.0015640603,0.0063377596,0.019089464,0.0051908134,0.0053320057,0.0022406208],"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.00006298392,0.000016008973,0.00015386382,0.000042278225,0.000011774405,0.0000448604,0.000076817065,0.00037958528,0.00033713458,0.9936376,0.0012923888,0.003944577],"study_design_scores_gemma":[0.0000219855,0.000009346884,0.00009687901,0.000011054675,0.000010168225,0.00006801297,0.0000263794,0.0017925707,0.0005077235,0.9953434,0.002105644,0.000006829547],"about_ca_topic_score_codex":0.00044023426,"about_ca_topic_score_gemma":0.0002846151,"teacher_disagreement_score":0.017499667,"about_ca_system_score_codex":0.0013412245,"about_ca_system_score_gemma":0.0012119464,"threshold_uncertainty_score":0.058542192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012380973,0.0001420308,0.9766767,0.00015109873,0.00009997843,0.00034670482,0.00011273321,0.0016736428,0.0084161265],"genre_scores_gemma":[0.13874024,0.00025488244,0.8517976,0.00012092219,0.000025361202,0.0004969798,0.0002704367,0.0002566095,0.008037074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996786,0.000070364804,0.000024317542,0.0000619469,0.00013758562,0.000027102606],"domain_scores_gemma":[0.9996748,0.00006100337,0.000025370739,0.00006391452,0.0001318329,0.00004305525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003281995,0.00044431302,0.00029403565,0.00039036523,0.00032499587,0.0006170327,0.001009773,0.0005694225,0.0061831544],"category_scores_gemma":[0.0009115158,0.00034543575,0.00033068034,0.00033333947,0.00048963673,0.00077598565,0.0006345463,0.0010097403,0.0023181625],"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.00044275817,0.0002658023,0.0028142363,0.0011928881,0.000089168054,0.00073251146,0.00074624445,0.07281396,0.35470477,0.17547867,0.011513861,0.37920508],"study_design_scores_gemma":[0.00024154893,0.0017832431,0.003235483,0.00023052387,0.00015262366,0.0026247585,0.00022296737,0.262538,0.30945802,0.035965297,0.3833969,0.00015067561],"about_ca_topic_score_codex":0.0003766158,"about_ca_topic_score_gemma":0.0004413076,"teacher_disagreement_score":0.0061831544,"about_ca_system_score_codex":0.00021688084,"about_ca_system_score_gemma":0.00070221926,"threshold_uncertainty_score":0.02068466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0524118,0.0006626755,0.94020736,0.00033291828,0.00005014749,0.00007759806,0.00013297566,0.00032240798,0.005802154],"genre_scores_gemma":[0.795665,0.0006877397,0.20117934,0.00012712857,0.00011744662,0.00016932357,0.00033597395,0.0000907095,0.0016272829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976157,0.0004681153,0.00019878893,0.00046200684,0.0010963278,0.0001590155],"domain_scores_gemma":[0.99515355,0.00217702,0.00080933137,0.0009409158,0.0006252645,0.00029391175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015385828,0.00045180522,0.0011787934,0.003309543,0.00076775247,0.0022867215,0.0015333461,0.0010597333,0.0019720795],"category_scores_gemma":[0.011652589,0.00023952717,0.00091206696,0.0020424488,0.0032702892,0.006465226,0.0029155684,0.0011625517,0.00029505696],"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.00015780568,0.00006162192,0.0030212575,0.00028859163,0.000075728916,0.00020580937,0.00027104805,0.12292476,0.0099287,0.76606697,0.0015652605,0.09543244],"study_design_scores_gemma":[0.000015678259,0.00012797206,0.0023838305,0.00003136174,0.000028408293,0.00041945835,0.0000882589,0.4781454,0.0036064435,0.5122538,0.0028423036,0.00005701207],"about_ca_topic_score_codex":0.00089827477,"about_ca_topic_score_gemma":0.0006924354,"teacher_disagreement_score":0.003309543,"about_ca_system_score_codex":0.0018327483,"about_ca_system_score_gemma":0.0008677412,"threshold_uncertainty_score":0.013297617},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063177235,0.0025031068,0.75704956,0.02599214,0.00092092325,0.00014036558,0.00021393421,0.0028197078,0.147183],"genre_scores_gemma":[0.787213,0.002299174,0.1687284,0.004007789,0.00044386322,0.00032557885,0.00022524997,0.0007676981,0.035989173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816173,0.00080480025,0.00009156851,0.000408222,0.00043514906,0.000098469216],"domain_scores_gemma":[0.991819,0.0041768784,0.0005651631,0.0028032206,0.00048688633,0.00014881653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024252038,0.00071141846,0.00044065644,0.000527216,0.00083754834,0.0020535423,0.0016409827,0.0021018633,0.007341148],"category_scores_gemma":[0.016717719,0.00040880116,0.000881628,0.00037316632,0.008280834,0.004816246,0.0021013361,0.002159811,0.0020151811],"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.00008452384,0.000046426016,0.001408309,0.00040301844,0.00009966363,0.00036829227,0.0011096053,0.017526887,0.0073518977,0.9208165,0.0043859365,0.046399012],"study_design_scores_gemma":[0.000050503233,0.00013867367,0.0012670209,0.00010602385,0.00004133188,0.0008763096,0.00032468583,0.03921576,0.007503437,0.88309765,0.06732389,0.000054786975],"about_ca_topic_score_codex":0.00055933895,"about_ca_topic_score_gemma":0.0005217549,"teacher_disagreement_score":0.007341148,"about_ca_system_score_codex":0.0004946893,"about_ca_system_score_gemma":0.00036480927,"threshold_uncertainty_score":0.024558604},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059237678,0.0072825877,0.22003868,0.11289424,0.0018038704,0.000104807565,0.00033491052,0.0004660147,0.5978372],"genre_scores_gemma":[0.96732193,0.00178654,0.016361786,0.004334867,0.0008860696,0.00010373325,0.000108684246,0.00013424158,0.008962015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935408,0.0026458257,0.00029571544,0.0010494996,0.0020541463,0.00041409887],"domain_scores_gemma":[0.991651,0.0039466103,0.0006467365,0.0016315967,0.001606852,0.000517197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005798487,0.000522612,0.0008017019,0.0029172488,0.003332042,0.0065981527,0.002317522,0.003296108,0.00544904],"category_scores_gemma":[0.0121397115,0.0003807616,0.0009267503,0.0010225874,0.034027647,0.009423426,0.0032499556,0.0059564537,0.001000963],"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.0000035140401,0.0000020862753,0.00002748666,0.000012893419,0.0000028223935,0.000009680633,0.000113846276,0.000089075715,0.00004008717,0.9986261,0.00045707176,0.0006152241],"study_design_scores_gemma":[0.000008131503,0.000010722656,0.00011706499,0.000023607341,0.00000851893,0.00005268784,0.0001340017,0.00045438082,0.00022146729,0.98739237,0.01156825,0.000008670546],"about_ca_topic_score_codex":0.0029178467,"about_ca_topic_score_gemma":0.0020432868,"teacher_disagreement_score":0.0065981527,"about_ca_system_score_codex":0.0048811375,"about_ca_system_score_gemma":0.0030011798,"threshold_uncertainty_score":0.03541535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69598806,0.00073558633,0.2778104,0.0019755524,0.00032465692,0.000102421225,0.00038050985,0.0019129651,0.020769745],"genre_scores_gemma":[0.886084,0.00007619996,0.11163543,0.00017340343,0.000042965614,0.000058310754,0.0002098892,0.00015472675,0.0015650433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981889,0.000415108,0.0001947703,0.000471437,0.00048360968,0.0002461092],"domain_scores_gemma":[0.98764706,0.0068737785,0.001003949,0.0027304846,0.0010110639,0.0007335667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016073143,0.00083596964,0.00080697244,0.0009506444,0.00091018045,0.002801019,0.0010970441,0.0012353626,0.004989551],"category_scores_gemma":[0.014212688,0.00045300624,0.0009258249,0.00062611717,0.0031065738,0.0066101337,0.0023440833,0.0019418113,0.00060567784],"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.001656586,0.00021538876,0.0096681,0.0007525259,0.00017968228,0.00048551755,0.0009018946,0.06099253,0.05096108,0.78793424,0.005390502,0.08086195],"study_design_scores_gemma":[0.00015869983,0.0005397387,0.002509628,0.00013682165,0.00010530845,0.00075518945,0.0003993581,0.25223097,0.053691667,0.674827,0.014483362,0.00016226602],"about_ca_topic_score_codex":0.00032928484,"about_ca_topic_score_gemma":0.0003586573,"teacher_disagreement_score":0.004989551,"about_ca_system_score_codex":0.0013610111,"about_ca_system_score_gemma":0.00091317086,"threshold_uncertainty_score":0.016691744},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024147367,0.11143701,0.11560315,0.05796928,0.041571714,0.0012005868,0.022638531,0.010270387,0.615162],"genre_scores_gemma":[0.031716514,0.019996073,0.015511957,0.00069013983,0.003774724,0.0001252736,0.0066825007,0.0019134552,0.9195892],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913126,0.00009949492,0.000022500515,0.00017835778,0.00043083646,0.00013753757],"domain_scores_gemma":[0.99854183,0.00020404097,0.000042332234,0.00014967,0.0007378371,0.00032428585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002632867,0.0018327448,0.0015214818,0.0017869038,0.0017864106,0.0037842907,0.0029461668,0.0009247415,0.10104452],"category_scores_gemma":[0.0024620525,0.00080077467,0.00062792015,0.0022322661,0.001272876,0.0019477588,0.0022753726,0.0016253531,0.039063755],"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.00016753598,0.000102373924,0.00068726117,0.0001355824,0.00002448411,0.0001103348,0.00013310465,0.00097029866,0.0010170244,0.003612243,0.9049275,0.08811227],"study_design_scores_gemma":[0.000053197018,0.000056066063,0.0052136714,0.00016865412,0.000031811982,0.00010272237,0.00012286441,0.0040508425,0.0020803176,0.0031512135,0.98494786,0.000020754436],"about_ca_topic_score_codex":0.13792437,"about_ca_topic_score_gemma":0.3323515,"teacher_disagreement_score":0.13792437,"about_ca_system_score_codex":0.004458557,"about_ca_system_score_gemma":0.0035815737,"threshold_uncertainty_score":0.3380276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17310743,0.010781261,0.67214864,0.026339456,0.0006236812,0.00018093712,0.0004122882,0.00065553526,0.11575083],"genre_scores_gemma":[0.94166636,0.0025063832,0.05104896,0.00089856004,0.0006191594,0.00017592807,0.000121196674,0.00014510808,0.0028182538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99201655,0.0031407394,0.00039747046,0.0015405433,0.0019677847,0.00093684485],"domain_scores_gemma":[0.96188855,0.030115783,0.0014701186,0.004105607,0.0015894743,0.00083037914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064350865,0.00077885523,0.0016398912,0.0015139523,0.0032041157,0.006202538,0.0018983379,0.002299921,0.0028741537],"category_scores_gemma":[0.02968869,0.0007855993,0.0023161122,0.0014359615,0.020654367,0.0119564785,0.00733972,0.0056223394,0.00030007542],"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.000012475901,0.0000072910075,0.00021755007,0.000054260072,0.000013711429,0.000058983853,0.00029669906,0.006911449,0.000116211406,0.9898666,0.000314131,0.0021305264],"study_design_scores_gemma":[0.0000047275903,0.000005479474,0.00007612065,0.000014074018,0.00000387875,0.000021421261,0.000045182653,0.008898007,0.00008758643,0.98981327,0.0010223899,0.000007913556],"about_ca_topic_score_codex":0.002822378,"about_ca_topic_score_gemma":0.0010779497,"teacher_disagreement_score":0.0064350865,"about_ca_system_score_codex":0.003325562,"about_ca_system_score_gemma":0.001797669,"threshold_uncertainty_score":0.034032345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3116915,0.003440977,0.46481407,0.0058537456,0.00028901763,0.000092740396,0.00060175464,0.00046209904,0.21275415],"genre_scores_gemma":[0.9788432,0.0006773833,0.012637566,0.00020426285,0.00021569149,0.000053327796,0.00016812366,0.000035716857,0.0071646855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918526,0.00026574588,0.000036779213,0.0002202743,0.00022142113,0.00007051773],"domain_scores_gemma":[0.9947864,0.0038433673,0.00032179843,0.0005848406,0.0002771532,0.00018637626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009532306,0.00039603384,0.0007191655,0.0013174671,0.0008606079,0.002724739,0.0012780579,0.0010488584,0.010885829],"category_scores_gemma":[0.008987369,0.0003316648,0.00074199156,0.00085752556,0.0031245053,0.005093302,0.0015536641,0.0018475149,0.00040596115],"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.000016175103,0.0000073433885,0.00013836414,0.000032282052,0.000011124155,0.000022262773,0.00005422455,0.009670593,0.00025714372,0.9859956,0.00030500686,0.003489998],"study_design_scores_gemma":[0.0000051086386,0.0000024864464,0.00007002418,0.0000049866394,0.00000311878,0.000016684546,0.0000092008395,0.020311445,0.00011549771,0.97890115,0.00055801845,0.000002295376],"about_ca_topic_score_codex":0.0012251245,"about_ca_topic_score_gemma":0.000725789,"teacher_disagreement_score":0.010885829,"about_ca_system_score_codex":0.0015025316,"about_ca_system_score_gemma":0.00049341423,"threshold_uncertainty_score":0.03641677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874456,0.0011507858,0.0049764174,0.00015035005,0.000015104758,0.000029148023,0.000047926296,0.000024870831,0.006159915],"genre_scores_gemma":[0.997442,0.0001895941,0.0016915994,0.000031607335,0.000021189504,0.000014913428,0.00005980831,0.000010520441,0.00053871464],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9991448,0.00016636323,0.000070428716,0.00015749571,0.00040227317,0.000058732312],"domain_scores_gemma":[0.9941948,0.0033426187,0.0011450027,0.0005701135,0.00040292155,0.00034454736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059603533,0.00020603157,0.0003833106,0.00094663276,0.00033086893,0.002243712,0.00050716137,0.00054163695,0.0023460544],"category_scores_gemma":[0.0111773675,0.00026887402,0.0003173623,0.000585119,0.0010492741,0.0035831684,0.0015843977,0.00065512856,0.00020002606],"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.006401203,0.0013600806,0.120852396,0.0013258852,0.00048641113,0.00080589333,0.006483268,0.017137961,0.38429832,0.087256186,0.0012630492,0.37232944],"study_design_scores_gemma":[0.00026617077,0.0027141448,0.6627178,0.00010995348,0.00029651445,0.0016110048,0.0012195854,0.036424477,0.043548293,0.24623221,0.0046331915,0.00022664672],"about_ca_topic_score_codex":0.00064178545,"about_ca_topic_score_gemma":0.00043405686,"teacher_disagreement_score":0.0023460544,"about_ca_system_score_codex":0.0006375047,"about_ca_system_score_gemma":0.00027282984,"threshold_uncertainty_score":0.007848382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99145377,0.00008766979,0.004186538,0.00015619755,0.000005587528,0.000048924936,0.000011868187,0.000017171238,0.0040323064],"genre_scores_gemma":[0.9980737,0.000042391468,0.0012368842,0.000048393977,0.0000032248606,0.000023204233,0.000021667309,0.0000054936722,0.0005450585],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9950956,0.0021927455,0.00015874502,0.00067494664,0.0015046105,0.00037331152],"domain_scores_gemma":[0.97101194,0.020719284,0.0043018013,0.0018637027,0.0011293922,0.00097397773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004778121,0.00041984036,0.00035780435,0.0012051103,0.0008935482,0.0053196815,0.0009111432,0.0014825234,0.0034839904],"category_scores_gemma":[0.044781953,0.0005335891,0.00047199565,0.00045355025,0.0043323184,0.0031207069,0.0019497873,0.0025823016,0.00022569677],"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.00090284186,0.0019690057,0.4513048,0.0005935562,0.00024234582,0.0008435616,0.38862038,0.0053021815,0.030170508,0.051570747,0.0013943792,0.067085765],"study_design_scores_gemma":[0.00014689653,0.0018428616,0.75274754,0.00021542452,0.000107679545,0.0012904077,0.12860319,0.018502967,0.0060077906,0.078295484,0.011842482,0.00039731537],"about_ca_topic_score_codex":0.0027513942,"about_ca_topic_score_gemma":0.0017797592,"teacher_disagreement_score":0.0053196815,"about_ca_system_score_codex":0.0010975887,"about_ca_system_score_gemma":0.0006995538,"threshold_uncertainty_score":0.02526939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81276035,0.0023144067,0.11619993,0.011163156,0.00030611502,0.000084626605,0.00066570326,0.0003549293,0.056150775],"genre_scores_gemma":[0.98806816,0.00048241345,0.005647186,0.00018331228,0.00039777582,0.00005891971,0.00021954846,0.00004647333,0.0048961826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720603,0.00082166307,0.00014529336,0.00044690212,0.0009867735,0.0003932649],"domain_scores_gemma":[0.9724425,0.022511007,0.0013623607,0.0014979467,0.0008945774,0.0012916377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029838188,0.0008076695,0.0018336585,0.0030561993,0.002698149,0.009842716,0.0028192112,0.0022699838,0.008206192],"category_scores_gemma":[0.020865604,0.0008066641,0.0012632266,0.0031035303,0.008318858,0.022445196,0.004479866,0.005435451,0.0005859455],"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.00011075868,0.000042875596,0.00085821474,0.000047191235,0.000013624089,0.00005822462,0.0004368511,0.0049540773,0.00026710628,0.9893884,0.0006821468,0.0031404677],"study_design_scores_gemma":[0.000016929602,0.0000074543227,0.00012969704,0.0000050351246,0.0000061393125,0.000027106422,0.00005798005,0.008146461,0.00014986536,0.9910487,0.0003960897,0.00000864287],"about_ca_topic_score_codex":0.0015190482,"about_ca_topic_score_gemma":0.0013861259,"teacher_disagreement_score":0.009842716,"about_ca_system_score_codex":0.004303566,"about_ca_system_score_gemma":0.001921656,"threshold_uncertainty_score":0.031224668},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07728847,0.0027693545,0.3105164,0.32002738,0.0035204485,0.00015392635,0.000390917,0.0023493574,0.28298366],"genre_scores_gemma":[0.88768274,0.0013128472,0.052127477,0.022254847,0.00072360184,0.00015827037,0.0002588824,0.0011932681,0.034287997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943401,0.00266728,0.0002634549,0.0011149952,0.0009398849,0.0006742245],"domain_scores_gemma":[0.98940814,0.0038242587,0.0006840138,0.0031552871,0.001898296,0.001030003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005373853,0.00052261574,0.0006396945,0.00049791706,0.0031818482,0.0046930905,0.0011061792,0.0047403043,0.014270949],"category_scores_gemma":[0.020813487,0.0005067719,0.0010292748,0.0003453281,0.01627901,0.013401334,0.0031573316,0.003867662,0.008196422],"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.00019294956,0.00006426854,0.002611154,0.0003498753,0.00009498093,0.0002662201,0.0066212565,0.001336455,0.0048129912,0.9315274,0.020777889,0.031344593],"study_design_scores_gemma":[0.000071876115,0.00014495439,0.0015735739,0.0002438858,0.00006717011,0.0004893615,0.0054266276,0.0037681698,0.0057664406,0.7652094,0.21710718,0.0001313232],"about_ca_topic_score_codex":0.0024267156,"about_ca_topic_score_gemma":0.0014560478,"teacher_disagreement_score":0.014270949,"about_ca_system_score_codex":0.0015117171,"about_ca_system_score_gemma":0.0019453114,"threshold_uncertainty_score":0.047741115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19228704,0.005597035,0.64794874,0.0043833684,0.00040100713,0.00009742968,0.00039560682,0.00044269243,0.14844708],"genre_scores_gemma":[0.9495094,0.0010074796,0.038823653,0.00024594078,0.00020365207,0.000117192496,0.00016370039,0.000055720793,0.009873258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990601,0.00027524933,0.000061700746,0.00017738431,0.000281967,0.00014361608],"domain_scores_gemma":[0.9984432,0.00088364276,0.00015350255,0.00019181122,0.00018349751,0.00014432336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009089499,0.00039827934,0.0002964259,0.0019289734,0.0011874806,0.002817165,0.00086181494,0.0009839883,0.0035201872],"category_scores_gemma":[0.0026548633,0.00022440459,0.0007586072,0.0013253418,0.005998342,0.0057236757,0.0018617078,0.0014850419,0.00023879475],"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.000004448939,0.0000022884192,0.0000944944,0.000013170688,0.0000017227927,0.00001889657,0.00010448151,0.0008320937,0.00017822142,0.9968604,0.000122746,0.001767137],"study_design_scores_gemma":[0.0000024725537,0.000009741998,0.00021321006,0.000011921493,0.0000032913583,0.000066507586,0.000110856075,0.0049264627,0.00028020775,0.9891344,0.005231387,0.000009489328],"about_ca_topic_score_codex":0.0028411653,"about_ca_topic_score_gemma":0.00167039,"teacher_disagreement_score":0.0035201872,"about_ca_system_score_codex":0.0027034625,"about_ca_system_score_gemma":0.0008818355,"threshold_uncertainty_score":0.019615054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62887067,0.0011734823,0.36351672,0.0006446934,0.000084814135,0.00019900032,0.0005276903,0.00079926534,0.004183801],"genre_scores_gemma":[0.9338207,0.00023596332,0.0644173,0.000051242296,0.000061024337,0.000052181247,0.0003937948,0.000038172104,0.0009295033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884856,0.00032639474,0.00009837041,0.00023378873,0.00041379957,0.00007910701],"domain_scores_gemma":[0.9785922,0.01600053,0.0012086136,0.0018019697,0.0019972331,0.00039942242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022605902,0.00034025105,0.0006760525,0.0023255597,0.00048338968,0.0018815419,0.0011427717,0.0009907925,0.0023099708],"category_scores_gemma":[0.023281254,0.0002163845,0.00035321325,0.0029858367,0.001124654,0.0037966894,0.00104948,0.0013494658,0.00037658925],"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.0014630429,0.00056958024,0.046489168,0.0004207779,0.00014192081,0.00024667988,0.00051876495,0.032744095,0.027758528,0.021881815,0.0022900426,0.86547554],"study_design_scores_gemma":[0.00004689413,0.00048823672,0.02850611,0.000059148042,0.00007377905,0.00045037968,0.00026410283,0.9336674,0.011754981,0.02314022,0.00151529,0.00003347545],"about_ca_topic_score_codex":0.0025046829,"about_ca_topic_score_gemma":0.0025805444,"teacher_disagreement_score":0.0025046829,"about_ca_system_score_codex":0.0006349198,"about_ca_system_score_gemma":0.00092208607,"threshold_uncertainty_score":0.011955321},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059886854,0.004101137,0.9770642,0.0020972153,0.000107773056,0.000043027623,0.00014993889,0.0001757979,0.010272246],"genre_scores_gemma":[0.72868705,0.014869277,0.24501783,0.0012895163,0.0013408522,0.00057431357,0.00062722154,0.00018258525,0.0074113016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815327,0.0007273386,0.000089464476,0.00030005438,0.0006229159,0.00010694636],"domain_scores_gemma":[0.99426997,0.0045802733,0.00042672062,0.00033790714,0.0003207914,0.000064364074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022241094,0.0011245179,0.001446717,0.0018893724,0.0005865515,0.0030667768,0.0013779845,0.0019372938,0.0025724838],"category_scores_gemma":[0.0111831715,0.00053301465,0.00086829986,0.002324501,0.003705105,0.0050022868,0.001910015,0.002218258,0.00053342304],"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.000017075918,0.000024651497,0.00060460606,0.00021469055,0.000077804274,0.000121935744,0.00014535405,0.11814977,0.00041832976,0.8498108,0.0018888445,0.028526204],"study_design_scores_gemma":[0.000004805337,0.0000143642255,0.00016946216,0.000036712918,0.000013178652,0.000057454658,0.000022963535,0.14182489,0.00023245848,0.8548084,0.0028007547,0.000014561003],"about_ca_topic_score_codex":0.0016644907,"about_ca_topic_score_gemma":0.0007492929,"teacher_disagreement_score":0.0030667768,"about_ca_system_score_codex":0.0019923921,"about_ca_system_score_gemma":0.001341618,"threshold_uncertainty_score":0.014455855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018736485,0.00023112872,0.9805517,0.00005124361,0.000007644627,0.000016536886,0.000016478618,0.0001210861,0.00026772564],"genre_scores_gemma":[0.25815055,0.00053559325,0.7404731,0.000033270793,0.000025736514,0.000094738825,0.00007798029,0.00012326612,0.0004857991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996275,0.00012645322,0.000032771935,0.00006250653,0.00012390797,0.000026815716],"domain_scores_gemma":[0.99896705,0.00067490933,0.000105715786,0.00007627767,0.000121336285,0.00005464957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080584135,0.00053581473,0.0007966415,0.0010998097,0.00022857444,0.00094619987,0.0006943783,0.00037476938,0.0008621065],"category_scores_gemma":[0.0031301857,0.00026999813,0.0005601635,0.00072712376,0.00048181065,0.0017308153,0.0009536716,0.0006467871,0.00013359582],"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.0004924207,0.00011069711,0.0011772398,0.0003581183,0.000088704684,0.00024349488,0.0003844735,0.30742812,0.20288074,0.08492889,0.0014837753,0.40042326],"study_design_scores_gemma":[0.000011134146,0.000073803596,0.0003036513,0.0000095640235,0.000012660949,0.00010243878,0.00001944207,0.9703254,0.015798071,0.012395757,0.0009298972,0.000018060598],"about_ca_topic_score_codex":0.00063416205,"about_ca_topic_score_gemma":0.00062093785,"teacher_disagreement_score":0.0010998097,"about_ca_system_score_codex":0.0004900542,"about_ca_system_score_gemma":0.0004790022,"threshold_uncertainty_score":0.004261732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098321155,0.027757764,0.51627225,0.05561129,0.00076005654,0.00024231563,0.00044351362,0.0003808163,0.3002109],"genre_scores_gemma":[0.90224904,0.0073583,0.07951471,0.0011850368,0.0007726051,0.00030805584,0.0002804447,0.000091035436,0.008240708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99350196,0.0025545377,0.000435889,0.00089066307,0.0020510086,0.00056595774],"domain_scores_gemma":[0.9863966,0.008290178,0.0010569533,0.0021541293,0.0013152679,0.0007868623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040186765,0.0007965561,0.00081402133,0.003274512,0.0030598408,0.01022256,0.001503749,0.0029441926,0.0041554053],"category_scores_gemma":[0.01769437,0.0007170803,0.0010254419,0.0014719435,0.022380425,0.021651758,0.0068129343,0.004842286,0.0005526662],"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.0000052805844,0.000003399739,0.00017475024,0.000029312403,0.000005394295,0.000017771345,0.00037189267,0.0011407896,0.00006044502,0.9955205,0.0003416116,0.0023287458],"study_design_scores_gemma":[0.0000029096916,0.0000047422127,0.00015075243,0.00002225043,0.000003560649,0.00003796932,0.00018765379,0.0022481258,0.000047481255,0.9889888,0.00829706,0.000008631283],"about_ca_topic_score_codex":0.0018395756,"about_ca_topic_score_gemma":0.0009577067,"teacher_disagreement_score":0.01022256,"about_ca_system_score_codex":0.004316835,"about_ca_system_score_gemma":0.0017075838,"threshold_uncertainty_score":0.03132099},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008687112,0.009985128,0.58066195,0.06597537,0.0016121337,0.00007349107,0.00031646757,0.00027513734,0.33241314],"genre_scores_gemma":[0.7903568,0.0119025465,0.1354458,0.0119363805,0.0067590703,0.0002689084,0.00036472586,0.00032722324,0.04263847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939838,0.0029444667,0.0002419065,0.0010572851,0.0014262485,0.0003462244],"domain_scores_gemma":[0.98903614,0.0076880893,0.00046598655,0.0010584868,0.0012018621,0.00054939155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050548445,0.00084959937,0.00080048584,0.0028766354,0.0027589274,0.008035411,0.0019281199,0.0032966938,0.013725632],"category_scores_gemma":[0.010600048,0.0005341603,0.0010814051,0.0017966947,0.015813233,0.019080048,0.0037193296,0.005887819,0.001966115],"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.0000014907264,0.0000016744838,0.000017722452,0.000009416426,0.0000011964418,0.000007448779,0.00005735403,0.00019503986,0.000015665326,0.9981377,0.0005705662,0.000984715],"study_design_scores_gemma":[0.0000027103067,0.0000030361666,0.00002522272,0.000017558341,0.0000019420295,0.000022344919,0.00004557702,0.0010837982,0.000033868873,0.98410255,0.014658441,0.0000030852796],"about_ca_topic_score_codex":0.0027031077,"about_ca_topic_score_gemma":0.0012945918,"teacher_disagreement_score":0.013725632,"about_ca_system_score_codex":0.0046524485,"about_ca_system_score_gemma":0.0022327248,"threshold_uncertainty_score":0.045916855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58570945,0.0006301913,0.40776896,0.00052708667,0.000054540982,0.00006407533,0.00022460533,0.0006460929,0.0043749516],"genre_scores_gemma":[0.9716784,0.00020524593,0.027067723,0.00003303258,0.000049220045,0.00005098418,0.00012332872,0.00009370265,0.0006984257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774677,0.00075394247,0.00015795325,0.0004912685,0.0005880387,0.00026205147],"domain_scores_gemma":[0.95709604,0.034292046,0.002145104,0.0029065383,0.002172208,0.0013879781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045931614,0.0007438329,0.0012299072,0.0030974918,0.00090757955,0.0038660378,0.0014989682,0.0012167617,0.0024390172],"category_scores_gemma":[0.050288144,0.0006599447,0.00077795883,0.001637471,0.0045363833,0.009859948,0.002805958,0.0022060303,0.00028041942],"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.00053266383,0.00007447186,0.0136426,0.00020502458,0.00013946998,0.00026514678,0.0009992116,0.18182494,0.006105638,0.77256006,0.0006293075,0.02302144],"study_design_scores_gemma":[0.000037649104,0.000071004135,0.0020440146,0.000026875008,0.000029721663,0.000117044154,0.00009711957,0.53194314,0.0045919484,0.46024668,0.000752277,0.000042589014],"about_ca_topic_score_codex":0.0011974074,"about_ca_topic_score_gemma":0.0007252117,"teacher_disagreement_score":0.0045931614,"about_ca_system_score_codex":0.002306594,"about_ca_system_score_gemma":0.0006835353,"threshold_uncertainty_score":0.024291277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012572536,0.0051869135,0.9280634,0.0073763444,0.0003515691,0.00008440495,0.00034576684,0.00023698133,0.045782145],"genre_scores_gemma":[0.6267629,0.00664165,0.3407151,0.0023255716,0.0026136183,0.0008182148,0.00085005857,0.0003073177,0.01896555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960264,0.0014822494,0.000259242,0.0006064782,0.0013228145,0.00030285952],"domain_scores_gemma":[0.9905041,0.0071084434,0.00036854701,0.0011340377,0.0006398816,0.0002450698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038965233,0.0011709499,0.0011675145,0.0025748084,0.0020540056,0.0051189456,0.0019245957,0.001662895,0.0053787716],"category_scores_gemma":[0.00817535,0.0004738236,0.002798701,0.0029749575,0.0076600695,0.014167557,0.0038051177,0.0067119654,0.0007601576],"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.0000029619434,0.000003561138,0.000040949242,0.000029606965,0.000005307153,0.000013016192,0.000053598815,0.0010856629,0.000073377516,0.9967332,0.00039479305,0.0015640248],"study_design_scores_gemma":[0.0000031093753,0.000004232736,0.000036159534,0.000009571295,0.0000035573019,0.000015348394,0.000017673578,0.005172664,0.000066249406,0.9907691,0.0038989314,0.0000034619375],"about_ca_topic_score_codex":0.0018527965,"about_ca_topic_score_gemma":0.0009871301,"teacher_disagreement_score":0.0053787716,"about_ca_system_score_codex":0.004489659,"about_ca_system_score_gemma":0.0012440674,"threshold_uncertainty_score":0.032574892},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042962234,0.0053268103,0.6254683,0.007964205,0.0030924175,0.00018040896,0.015570616,0.010452309,0.2889827],"genre_scores_gemma":[0.48723722,0.0059636654,0.2213333,0.0017755119,0.0023028022,0.0003733807,0.018834988,0.0037874084,0.25839177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898344,0.00021693482,0.00011657297,0.00015751713,0.0003815121,0.00014395034],"domain_scores_gemma":[0.995817,0.0016206404,0.00023123974,0.0013402486,0.00071502087,0.00027588365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012179149,0.00088959374,0.0010905442,0.0036034335,0.0028895508,0.0073320186,0.0016895618,0.0011684619,0.041365486],"category_scores_gemma":[0.004412796,0.0010677171,0.000992615,0.0069477977,0.002866195,0.009242667,0.0020057973,0.0054239584,0.01768558],"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.000075686876,0.000036189114,0.00015417006,0.00011190159,0.0000071741183,0.000060544877,0.00025297215,0.0006378591,0.0004532784,0.94728786,0.022614416,0.028307967],"study_design_scores_gemma":[0.000021764019,0.00001786906,0.00014010727,0.00005057377,0.000012608776,0.0001517512,0.00009005257,0.0023289716,0.0016486982,0.88372487,0.11178608,0.000026667461],"about_ca_topic_score_codex":0.0017714942,"about_ca_topic_score_gemma":0.002097543,"teacher_disagreement_score":0.041365486,"about_ca_system_score_codex":0.0027692227,"about_ca_system_score_gemma":0.0021973923,"threshold_uncertainty_score":0.1383813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14588717,0.02920207,0.43815604,0.028201345,0.0014656902,0.000117869095,0.0013028699,0.0004973087,0.35516962],"genre_scores_gemma":[0.93445176,0.005649743,0.041321952,0.0013152298,0.0014200101,0.00017776866,0.00042499503,0.000109221575,0.015129421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985989,0.00057811465,0.00012573152,0.00027958036,0.00026597976,0.00015182847],"domain_scores_gemma":[0.99513125,0.0034354476,0.0002964301,0.00039994586,0.00049224263,0.00024469124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036235906,0.0006024104,0.00091014063,0.0027885523,0.0020061955,0.003459162,0.0010507992,0.0017890441,0.008214233],"category_scores_gemma":[0.008562176,0.00049403496,0.0010379322,0.0018626376,0.008729219,0.007922493,0.0019484904,0.0038413978,0.0006039399],"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.000003876226,0.0000022278512,0.000026418582,0.000011003444,0.0000014475561,0.000004871214,0.00002783605,0.00021989498,0.000035953126,0.9986058,0.0003414396,0.00071914005],"study_design_scores_gemma":[0.000005220171,0.000001918561,0.000033656885,0.000007382579,0.0000016492534,0.0000077607,0.00001567914,0.00036504652,0.000035558383,0.99753654,0.0019872417,0.0000024475598],"about_ca_topic_score_codex":0.0025254607,"about_ca_topic_score_gemma":0.0016018563,"teacher_disagreement_score":0.008214233,"about_ca_system_score_codex":0.0028712198,"about_ca_system_score_gemma":0.0020878888,"threshold_uncertainty_score":0.02747935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079340085,0.0052147694,0.84450966,0.016291207,0.0008202509,0.00008787474,0.00053156214,0.00024877657,0.052955862],"genre_scores_gemma":[0.9279361,0.0037516588,0.047767963,0.0013039919,0.0028647317,0.00029456295,0.00039416802,0.00019852171,0.01548832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722654,0.0011303304,0.0001481403,0.00044194525,0.0008009283,0.0002521502],"domain_scores_gemma":[0.9902773,0.0065215994,0.00058705534,0.0012237675,0.0008807837,0.0005095665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031964886,0.00094384403,0.0018293521,0.0024927347,0.0020104875,0.005719862,0.0031097338,0.0031231216,0.004502142],"category_scores_gemma":[0.010570962,0.0008909051,0.0024755076,0.0013579561,0.009231799,0.013791278,0.0035882536,0.0044283634,0.0004342905],"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.000003670829,0.000004480153,0.000050273742,0.000015282465,0.0000067270976,0.000016819196,0.00003749784,0.0024895975,0.00012237819,0.99668854,0.0001286701,0.00043605213],"study_design_scores_gemma":[0.000007586554,0.000009451088,0.00007533401,0.000007560906,0.000004472551,0.000023695586,0.000016581229,0.012952592,0.0000777084,0.9859877,0.00082764466,0.00000964221],"about_ca_topic_score_codex":0.0013942795,"about_ca_topic_score_gemma":0.0007266174,"teacher_disagreement_score":0.005719862,"about_ca_system_score_codex":0.0031710153,"about_ca_system_score_gemma":0.0013567171,"threshold_uncertainty_score":0.023007393},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021902227,0.0748055,0.033551924,0.024326835,0.025893034,0.00010867032,0.0005850469,0.00034687287,0.83819187],"genre_scores_gemma":[0.12475395,0.1415755,0.052300557,0.02052392,0.02964766,0.000611319,0.0015252748,0.00067234057,0.62838954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988651,0.0003116517,0.00008255617,0.00017762104,0.0005058785,0.00005729225],"domain_scores_gemma":[0.9989021,0.00051028456,0.00007712234,0.00012093193,0.00031410521,0.00007536052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000746994,0.00074606633,0.0006045785,0.0016083852,0.001821028,0.0082116,0.00093314704,0.0022238046,0.027919564],"category_scores_gemma":[0.002157697,0.00036708772,0.00026014252,0.003678689,0.00570844,0.0072816215,0.0017176503,0.0036282835,0.012176139],"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.000032344742,0.000025467507,0.00020817289,0.00052558584,0.000008508633,0.00009761958,0.0008798264,0.00030955154,0.0009051807,0.76849437,0.154314,0.07419932],"study_design_scores_gemma":[0.0000014779343,0.000011675072,0.00019395389,0.00012942929,0.000002688354,0.00012414905,0.00018565865,0.00017811063,0.000106030035,0.053314503,0.9457456,0.0000068359004],"about_ca_topic_score_codex":0.0015819255,"about_ca_topic_score_gemma":0.001910497,"teacher_disagreement_score":0.027919564,"about_ca_system_score_codex":0.0029194665,"about_ca_system_score_gemma":0.0018321369,"threshold_uncertainty_score":0.09340024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93697155,0.0006564289,0.030581672,0.00047161328,0.00015365148,0.00007617698,0.0008008439,0.00060631614,0.029681683],"genre_scores_gemma":[0.9801154,0.00019835253,0.017176684,0.000081336744,0.000017727674,0.00009330979,0.00038872185,0.0000937946,0.0018346158],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991762,0.00017079,0.000035704197,0.0001875679,0.00031612732,0.00011355355],"domain_scores_gemma":[0.9976388,0.0013044692,0.00019915178,0.00041807332,0.0003600266,0.00007944211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009700726,0.00033911163,0.00021983871,0.00045368663,0.00072675064,0.00050576933,0.0009420342,0.00071610336,0.0057469676],"category_scores_gemma":[0.0035567635,0.00024418856,0.00013317178,0.00057521666,0.0010782742,0.0009883948,0.00067148067,0.0012501744,0.0006884988],"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.00061650283,0.00073192955,0.0057045585,0.0003791259,0.00005389002,0.00022464243,0.0005076154,0.0070384312,0.892287,0.06392668,0.0036463728,0.024883099],"study_design_scores_gemma":[0.000077917066,0.0005075022,0.003689686,0.000035365058,0.000023252655,0.00016190585,0.00016238364,0.027307665,0.9514226,0.0069775605,0.009575338,0.00005892571],"about_ca_topic_score_codex":0.0005211177,"about_ca_topic_score_gemma":0.00073956914,"teacher_disagreement_score":0.0057469676,"about_ca_system_score_codex":0.00044766755,"about_ca_system_score_gemma":0.00028691423,"threshold_uncertainty_score":0.019225478},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011239775,0.06118215,0.86357296,0.009078857,0.0015998076,0.00009163607,0.00069510273,0.00052698556,0.052012704],"genre_scores_gemma":[0.5511043,0.10396704,0.28018528,0.0058235778,0.015258814,0.0012149874,0.0022029018,0.0010150297,0.03922814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99230254,0.003369519,0.000390378,0.0012501779,0.0021909063,0.0004965374],"domain_scores_gemma":[0.9713478,0.024291545,0.0010417537,0.0013613255,0.0015170947,0.00044047483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064494773,0.001981634,0.0025509598,0.005758832,0.0013812365,0.006048124,0.002179908,0.0026125084,0.0077563953],"category_scores_gemma":[0.024504233,0.0009714432,0.0025681783,0.005945526,0.0073995003,0.008863288,0.0028346141,0.007332174,0.0020643696],"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.000011718131,0.000013285375,0.00020152271,0.0001853862,0.000037915943,0.00004433212,0.00012925526,0.007132404,0.00018048949,0.9778741,0.0036280486,0.010561561],"study_design_scores_gemma":[0.0000072341704,0.00001668584,0.000199291,0.00006024938,0.000008408408,0.000044017343,0.000020929692,0.011841737,0.00008268094,0.9780598,0.009648523,0.000010407473],"about_ca_topic_score_codex":0.0024217258,"about_ca_topic_score_gemma":0.00080150104,"teacher_disagreement_score":0.0077563953,"about_ca_system_score_codex":0.004120891,"about_ca_system_score_gemma":0.0017179996,"threshold_uncertainty_score":0.03410852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33798203,0.00047573,0.6549048,0.00042925472,0.000047475103,0.00011248222,0.00003792409,0.00016851541,0.005841769],"genre_scores_gemma":[0.9075169,0.00013732162,0.09068826,0.000052209412,0.00000876745,0.00017578433,0.00003724537,0.000030337877,0.0013531526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996487,0.00019470166,0.000014939623,0.000041705738,0.000065735665,0.000034279812],"domain_scores_gemma":[0.99919194,0.00058443024,0.000057001227,0.00004947046,0.00008525846,0.000031879303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009290299,0.00034628925,0.00046987188,0.00065809226,0.0005473595,0.0007093351,0.00041673318,0.0006903352,0.0011783554],"category_scores_gemma":[0.003618256,0.00033178148,0.0004888689,0.00042849692,0.000947045,0.0007625181,0.0005715036,0.00049438427,0.00009732065],"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.00004960728,0.000011674845,0.0005318335,0.000022232894,0.000018460234,0.00003507543,0.000066109526,0.9809326,0.0010393473,0.01297905,0.00012854945,0.0041854465],"study_design_scores_gemma":[0.000009342848,0.000019350655,0.00013068177,0.0000029536532,0.0000040538553,0.000007434482,0.000009327304,0.99531317,0.00022118044,0.0041005225,0.00017861144,0.000003416209],"about_ca_topic_score_codex":0.003587105,"about_ca_topic_score_gemma":0.0026345907,"teacher_disagreement_score":0.003587105,"about_ca_system_score_codex":0.0008812412,"about_ca_system_score_gemma":0.0007605264,"threshold_uncertainty_score":0.007132411},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1601278,0.0012337237,0.77939105,0.0020537516,0.00014090352,0.00006539955,0.00012613622,0.0011042439,0.05575692],"genre_scores_gemma":[0.8911488,0.0008315696,0.09494268,0.00030696974,0.00019401223,0.000111395384,0.00014004501,0.0004007823,0.011923681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989864,0.00021541626,0.000066525,0.00022364827,0.00040175612,0.00010609052],"domain_scores_gemma":[0.99785244,0.0010445695,0.00022290132,0.00050637097,0.0002018202,0.00017190083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072301895,0.00030293674,0.00039461418,0.000874771,0.0011798402,0.0027454528,0.0006883443,0.0009832573,0.003055897],"category_scores_gemma":[0.004420485,0.00059403555,0.0006113173,0.0008917595,0.005819786,0.0056598624,0.0025631117,0.0014315711,0.00046725964],"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.000015805674,0.000007991568,0.00027023253,0.000034399523,0.000003621246,0.00009230502,0.00041013086,0.0042642327,0.0012779657,0.98460996,0.0005364945,0.008476853],"study_design_scores_gemma":[0.000016885278,0.000020646117,0.0003547058,0.000013869597,0.000007139497,0.00012032206,0.00010320805,0.01163066,0.001470195,0.9733782,0.012870795,0.000013297186],"about_ca_topic_score_codex":0.0015447139,"about_ca_topic_score_gemma":0.0010311317,"teacher_disagreement_score":0.003055897,"about_ca_system_score_codex":0.00097446016,"about_ca_system_score_gemma":0.00049131847,"threshold_uncertainty_score":0.010223031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014278614,0.018807,0.47694522,0.040716816,0.0011320768,0.00006582439,0.00014354229,0.00038135765,0.44752946],"genre_scores_gemma":[0.6668238,0.01919297,0.23484853,0.012510405,0.0038100602,0.0003714692,0.00026444587,0.0003007217,0.06187763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764013,0.000716661,0.00010922648,0.00036788714,0.0009515081,0.00021456578],"domain_scores_gemma":[0.99822503,0.00082079717,0.00015494433,0.00029747534,0.00034419203,0.00015759598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003035788,0.00062570436,0.0007994556,0.0022934515,0.0037516158,0.00819377,0.001870846,0.0036576719,0.0033903117],"category_scores_gemma":[0.0037233995,0.00042576727,0.0007390917,0.0020252196,0.022044864,0.013811878,0.0024361322,0.004962391,0.0012898239],"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.0000015966385,0.0000029522746,0.000017766313,0.000008230238,6.3893344e-7,0.000009553419,0.00023110479,0.00008495702,0.000025547044,0.99777895,0.00053413084,0.0013046437],"study_design_scores_gemma":[0.0000027356543,0.000003638532,0.00003967493,0.00001994935,0.0000013251008,0.00002318497,0.000067737965,0.00032384502,0.00003661333,0.9750196,0.024458738,0.0000029876846],"about_ca_topic_score_codex":0.0026494737,"about_ca_topic_score_gemma":0.0020120246,"teacher_disagreement_score":0.00819377,"about_ca_system_score_codex":0.003702499,"about_ca_system_score_gemma":0.002423308,"threshold_uncertainty_score":0.026863694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3046521,0.00032990714,0.6922261,0.0005802286,0.000039926457,0.000049778922,0.00018319287,0.0007231806,0.001215595],"genre_scores_gemma":[0.8992913,0.00015334792,0.09891715,0.000072732204,0.000046538804,0.00006094711,0.00034186814,0.00010610335,0.0010100849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967115,0.0011011476,0.00025162424,0.00076749944,0.00082676066,0.0003414446],"domain_scores_gemma":[0.9503695,0.042757493,0.0018281518,0.0024580245,0.0014614583,0.0011253913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040968116,0.0009967866,0.0016893632,0.0021006383,0.0010454322,0.002779595,0.0036271408,0.0018874706,0.0021057343],"category_scores_gemma":[0.042787988,0.0011131947,0.0010502712,0.001985559,0.003257386,0.007296672,0.00428427,0.003807474,0.0002402465],"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.0005173429,0.0001401023,0.006277001,0.00017928502,0.000066182736,0.00007627516,0.00056220434,0.82166016,0.0015627247,0.11990296,0.0005044698,0.04855128],"study_design_scores_gemma":[0.000013347311,0.00003073193,0.00031636746,0.00000766408,0.000010970868,0.000015516027,0.00004929126,0.8873317,0.00053368526,0.11153518,0.00014690749,0.000008672556],"about_ca_topic_score_codex":0.00864256,"about_ca_topic_score_gemma":0.009254638,"teacher_disagreement_score":0.00864256,"about_ca_system_score_codex":0.0035423317,"about_ca_system_score_gemma":0.0015815881,"threshold_uncertainty_score":0.025701523},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032108724,0.021980297,0.88268447,0.009421506,0.0011471817,0.000071613504,0.00031728775,0.00012939426,0.05213948],"genre_scores_gemma":[0.5836945,0.0236038,0.3570256,0.0028460429,0.004805563,0.00041969883,0.0012473101,0.0003329702,0.02602441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940065,0.0026817666,0.0004896652,0.0010482057,0.00152076,0.00025315877],"domain_scores_gemma":[0.9810619,0.013128162,0.0010522958,0.0021395595,0.00203272,0.0005853337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054053897,0.0011135888,0.0018028428,0.005258288,0.002140143,0.0049151797,0.00238135,0.0038357927,0.0052552014],"category_scores_gemma":[0.030987153,0.000858757,0.0013600256,0.007168953,0.008810005,0.021895533,0.005965634,0.004614572,0.0012337398],"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.000019432971,0.0000071010186,0.00017653446,0.0000507328,0.000011209635,0.000032715285,0.00012284968,0.0014235084,0.00017685413,0.9853908,0.0012625472,0.011325726],"study_design_scores_gemma":[0.0000047072003,0.000014404597,0.00012121624,0.000025121391,0.0000073767637,0.00007345388,0.00003852878,0.00555686,0.00009606339,0.9873863,0.006663509,0.0000124327535],"about_ca_topic_score_codex":0.0021665175,"about_ca_topic_score_gemma":0.0010792372,"teacher_disagreement_score":0.0054053897,"about_ca_system_score_codex":0.0023307211,"about_ca_system_score_gemma":0.0010254751,"threshold_uncertainty_score":0.028586805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22162211,0.0028155514,0.62376636,0.0020124277,0.0006419937,0.00010814862,0.00027740872,0.00044645532,0.14830951],"genre_scores_gemma":[0.8350755,0.0016038079,0.13411227,0.0005382268,0.0004352658,0.00012948524,0.00021601084,0.00020345376,0.027686037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992403,0.0002174401,0.000039912182,0.00013920707,0.00027628135,0.00008690868],"domain_scores_gemma":[0.9982211,0.0009752957,0.00014913558,0.00021095388,0.000315823,0.0001276683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009920974,0.0003451168,0.0004755555,0.0015072713,0.00074762746,0.0018820865,0.0005866158,0.0005316652,0.007356453],"category_scores_gemma":[0.003988829,0.00026185607,0.00047152146,0.0010636891,0.0025740908,0.002938124,0.0020354707,0.001832663,0.0011235469],"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.000012896588,0.00000689688,0.00010854792,0.000024118826,0.0000032753476,0.00004416957,0.00008406833,0.0022912382,0.00070285005,0.98783803,0.0007089796,0.008174856],"study_design_scores_gemma":[0.000008945497,0.000014792567,0.00009609421,0.000020907786,0.0000033076285,0.000108265245,0.000045066852,0.017671753,0.00076458394,0.97376084,0.0074978094,0.000007677167],"about_ca_topic_score_codex":0.0006021716,"about_ca_topic_score_gemma":0.0006007399,"teacher_disagreement_score":0.007356453,"about_ca_system_score_codex":0.0008142219,"about_ca_system_score_gemma":0.0004377346,"threshold_uncertainty_score":0.024609804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07480125,0.21209797,0.36907443,0.08788499,0.0031890105,0.00008722982,0.0007026896,0.0005199298,0.25164247],"genre_scores_gemma":[0.91688955,0.030687751,0.03459823,0.0032839784,0.0041263625,0.00019600303,0.00018981962,0.00021324783,0.009815122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981665,0.0007900857,0.000096111056,0.00030330973,0.0005478474,0.00009611078],"domain_scores_gemma":[0.98732424,0.010016253,0.00062831887,0.0008367009,0.00076905306,0.00042553627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024929172,0.0007522632,0.0010091465,0.0029580675,0.0011545642,0.0066286833,0.00088341365,0.0021641427,0.0047597922],"category_scores_gemma":[0.017213939,0.00038719122,0.00045208656,0.003955935,0.012450204,0.020471122,0.0020692488,0.0038542594,0.0006436393],"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.000010718277,0.00001011281,0.00050775683,0.000099347,0.000015092665,0.0000106175585,0.00039940432,0.0011902979,0.00014046121,0.97416276,0.0036047269,0.019848742],"study_design_scores_gemma":[0.0000014481126,0.0000060218,0.00047729968,0.000035069403,0.000004764408,0.000023760711,0.00014093185,0.0014980221,0.000056420038,0.99178857,0.0059590642,0.000008687001],"about_ca_topic_score_codex":0.001469338,"about_ca_topic_score_gemma":0.0010991828,"teacher_disagreement_score":0.0066286833,"about_ca_system_score_codex":0.0022101433,"about_ca_system_score_gemma":0.0010775195,"threshold_uncertainty_score":0.016035736},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15647052,0.018269293,0.54408175,0.14867657,0.001523554,0.00015680307,0.0026434315,0.0006230599,0.12755497],"genre_scores_gemma":[0.92067,0.006190813,0.058190715,0.0042786323,0.001807446,0.00017747153,0.0011451961,0.0002355908,0.007304282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99458754,0.0015972679,0.0004273408,0.00077197555,0.0022229587,0.00039296946],"domain_scores_gemma":[0.8922348,0.07030776,0.007621523,0.013110254,0.014710224,0.002015463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010464034,0.00046356238,0.0018845326,0.002828819,0.0020975112,0.0066075944,0.0029864374,0.002909716,0.009638357],"category_scores_gemma":[0.08415756,0.0009130538,0.0014041469,0.002440159,0.011528383,0.028772159,0.003385609,0.005667293,0.0011007116],"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.00004023791,0.000028470897,0.0015832112,0.0002629816,0.00005904367,0.000094668685,0.0005658743,0.0024621303,0.00026154146,0.97508985,0.0036185556,0.015933469],"study_design_scores_gemma":[0.000006907,0.00000543551,0.0003555731,0.00005134656,0.000010219564,0.00005769493,0.00018389664,0.0025330067,0.00017967813,0.99242,0.0041813147,0.000014839075],"about_ca_topic_score_codex":0.0025434038,"about_ca_topic_score_gemma":0.0018623405,"teacher_disagreement_score":0.010464034,"about_ca_system_score_codex":0.0030375954,"about_ca_system_score_gemma":0.0035563072,"threshold_uncertainty_score":0.055339754},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07689656,0.024715377,0.2341984,0.2800967,0.0039041294,0.0002742898,0.0009293189,0.0011885184,0.3777967],"genre_scores_gemma":[0.9262873,0.008879755,0.027275288,0.008226046,0.0029154092,0.00038645422,0.0003358559,0.0005373107,0.025156563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917277,0.003564716,0.00036118817,0.0015424141,0.001689427,0.0011145556],"domain_scores_gemma":[0.97857565,0.011160985,0.0018417039,0.004530276,0.0022653819,0.0016259336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011929812,0.00081316865,0.0011694463,0.0026353209,0.0050448375,0.015977928,0.0028464196,0.005154249,0.015817227],"category_scores_gemma":[0.02973497,0.0008340167,0.0010819724,0.0024652116,0.03507152,0.05675327,0.012662481,0.0075809816,0.004140371],"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.00003797074,0.0000101479045,0.00035652285,0.00008081751,0.00000996822,0.000061197075,0.0016390193,0.00011951369,0.00013235444,0.98980427,0.002457882,0.0052902284],"study_design_scores_gemma":[0.000016836959,0.000011658594,0.0001630176,0.00011888466,0.00001134088,0.00011309908,0.0018133782,0.00034025134,0.00031602298,0.96363294,0.03344708,0.000015524889],"about_ca_topic_score_codex":0.002869398,"about_ca_topic_score_gemma":0.0018329638,"teacher_disagreement_score":0.015977928,"about_ca_system_score_codex":0.003816676,"about_ca_system_score_gemma":0.0033964575,"threshold_uncertainty_score":0.063091636},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023819596,0.0068817646,0.6376434,0.038213145,0.0006714157,0.0001127406,0.00037389196,0.00087870867,0.29140523],"genre_scores_gemma":[0.76323825,0.00553786,0.15777597,0.0056207334,0.0010535353,0.00045763684,0.00050190924,0.000533412,0.06528076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984598,0.00060117216,0.00006284211,0.00028127644,0.0004781547,0.00011675992],"domain_scores_gemma":[0.9956469,0.0022023076,0.0002020393,0.0011957068,0.00048405761,0.0002690195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022632775,0.0005538049,0.00073606893,0.0013967655,0.0014120956,0.003964629,0.0017605536,0.0017850294,0.0140234055],"category_scores_gemma":[0.008121862,0.0004448307,0.0011172555,0.0010057526,0.008986902,0.013075725,0.0025407304,0.0050392784,0.0033146841],"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.0000031191635,0.0000026371838,0.00002913713,0.000012466449,0.0000025520415,0.000009537944,0.000036235677,0.0005156387,0.000040418116,0.99606484,0.0008642355,0.0024192312],"study_design_scores_gemma":[0.0000019697397,0.0000025555412,0.000015717536,0.000007633469,0.0000015026505,0.000010170463,0.0000080198815,0.001996277,0.00006184316,0.9911629,0.0067298836,0.000001591066],"about_ca_topic_score_codex":0.0028575093,"about_ca_topic_score_gemma":0.0018774591,"teacher_disagreement_score":0.0140234055,"about_ca_system_score_codex":0.0023410933,"about_ca_system_score_gemma":0.0015545564,"threshold_uncertainty_score":0.04691291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6826703,0.00055551715,0.26506484,0.0017576315,0.00007107886,0.00008353989,0.0005490109,0.0007340855,0.048514128],"genre_scores_gemma":[0.97241175,0.00012634204,0.022006867,0.00007154812,0.000036013866,0.000028615224,0.00020134295,0.00003496101,0.005082527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996271,0.000060213824,0.000023204359,0.00006529956,0.00013872635,0.000085403124],"domain_scores_gemma":[0.9985214,0.00076760765,0.00015610542,0.00022687983,0.00017902917,0.00014904166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004348487,0.00022068062,0.00033468707,0.000732791,0.0009808737,0.0015328185,0.00041139722,0.00039003885,0.0026923493],"category_scores_gemma":[0.002909192,0.00018430858,0.00043260594,0.0009918918,0.0018295305,0.0032024484,0.0010069491,0.0011067279,0.00020790253],"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.00011952313,0.000027602468,0.0013627515,0.00006341436,0.0000059439058,0.00022329712,0.0006417989,0.0060648867,0.0044859773,0.9743871,0.0010782173,0.01153952],"study_design_scores_gemma":[0.000038579732,0.000051809853,0.0020784042,0.000021959357,0.000027876007,0.00024160626,0.0004390148,0.03376128,0.0102628125,0.94324386,0.00979795,0.000034742712],"about_ca_topic_score_codex":0.0028993906,"about_ca_topic_score_gemma":0.004138979,"teacher_disagreement_score":0.0028993906,"about_ca_system_score_codex":0.0013523811,"about_ca_system_score_gemma":0.0007201082,"threshold_uncertainty_score":0.009812295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47865227,0.0017996164,0.43160444,0.0057798675,0.00016617092,0.000084652995,0.0002514333,0.0010409934,0.08062048],"genre_scores_gemma":[0.9712738,0.00044001514,0.02065056,0.0002985215,0.00016361124,0.00008730286,0.00012086333,0.00010326008,0.0068621165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981304,0.0005262117,0.00008801263,0.00044436267,0.00055841706,0.00025260195],"domain_scores_gemma":[0.9859373,0.009511642,0.0005489105,0.0024170945,0.0009878227,0.0005972325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002094519,0.0003440252,0.001048245,0.0009867215,0.0019995102,0.0040671136,0.00092414516,0.0011302808,0.0051148357],"category_scores_gemma":[0.012155721,0.00052747666,0.00081375695,0.0015569682,0.007922647,0.011388268,0.004482659,0.0030833827,0.0004436505],"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.000028397637,0.0000097762595,0.00051829254,0.00001816641,0.000005498632,0.00006505195,0.00031051162,0.00046447816,0.00073298387,0.99058926,0.00039360902,0.0068639205],"study_design_scores_gemma":[0.000009908074,0.000008172607,0.00018195162,0.0000043638474,0.000007652505,0.00009004029,0.00005815673,0.0027200552,0.00080356194,0.9945798,0.0015317239,0.0000046374835],"about_ca_topic_score_codex":0.0012848097,"about_ca_topic_score_gemma":0.000794607,"teacher_disagreement_score":0.0051148357,"about_ca_system_score_codex":0.001212239,"about_ca_system_score_gemma":0.0011253399,"threshold_uncertainty_score":0.017110765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004065277,0.0141709205,0.8053573,0.011259702,0.0029527892,0.00016914796,0.00092792313,0.00033880197,0.1607582],"genre_scores_gemma":[0.42979804,0.031097561,0.4147344,0.012123263,0.017377047,0.0012715688,0.001489896,0.00042292938,0.09168525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99273103,0.0025660845,0.00036390813,0.0012809853,0.0028116053,0.000246379],"domain_scores_gemma":[0.9854408,0.011090273,0.00040162037,0.0012452819,0.0016447946,0.0001772917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009480173,0.001227086,0.0025427106,0.00439625,0.0013398278,0.005517151,0.0017621147,0.0029111248,0.01842938],"category_scores_gemma":[0.041835327,0.00084218197,0.0013672112,0.0023874126,0.0041440073,0.0052866424,0.00149956,0.00452754,0.006832896],"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.000011592005,0.000011167628,0.00036117167,0.00015633932,0.00005829107,0.000050414637,0.00007827092,0.0008733352,0.0000885723,0.9507054,0.007827578,0.03977782],"study_design_scores_gemma":[0.000011521163,0.0000052917176,0.00017704372,0.000082445265,0.00002349217,0.00010406415,0.000016919485,0.0031954865,0.00010698625,0.98211896,0.014149621,0.0000082281285],"about_ca_topic_score_codex":0.0016211763,"about_ca_topic_score_gemma":0.0011711685,"teacher_disagreement_score":0.01842938,"about_ca_system_score_codex":0.001587383,"about_ca_system_score_gemma":0.0018500102,"threshold_uncertainty_score":0.061652362},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05453357,0.08653483,0.07696578,0.12970662,0.002423394,0.0000834103,0.00041118445,0.00015970692,0.64918154],"genre_scores_gemma":[0.94049555,0.015735794,0.011428169,0.005014586,0.0031755345,0.000109753164,0.00017266942,0.00004762591,0.023820192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985461,0.0005948672,0.000058548518,0.00023801894,0.00043415662,0.00012833021],"domain_scores_gemma":[0.9965013,0.0025304037,0.00018669809,0.00021699055,0.00037232108,0.00019225178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019698977,0.00037908053,0.0006707787,0.0016591082,0.002403716,0.0042800796,0.00075728394,0.0016595797,0.005470209],"category_scores_gemma":[0.0050249505,0.00024623238,0.000400617,0.0018262411,0.013277461,0.006260349,0.0021002966,0.003757166,0.00060492614],"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.0000023880089,0.0000020123439,0.000026446805,0.000016358017,0.0000016710527,0.00001013843,0.000059977738,0.00018532587,0.000016090991,0.9976573,0.0010870643,0.0009352675],"study_design_scores_gemma":[0.00000192206,0.0000013174456,0.00002484956,0.000010016097,6.243527e-7,0.000009815372,0.000018837887,0.00030038462,0.000013831548,0.9939873,0.0056294384,0.0000015599197],"about_ca_topic_score_codex":0.0024318693,"about_ca_topic_score_gemma":0.0014064038,"teacher_disagreement_score":0.005470209,"about_ca_system_score_codex":0.004168635,"about_ca_system_score_gemma":0.0019941146,"threshold_uncertainty_score":0.030245662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1987374,0.003988481,0.7465229,0.004589821,0.00066730665,0.00024805593,0.0006207632,0.0012167912,0.043408476],"genre_scores_gemma":[0.8396422,0.003331191,0.12650757,0.00092992524,0.000688669,0.0006757938,0.0010150692,0.001214753,0.025994891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956002,0.0020549423,0.0002014519,0.00060505094,0.00097201637,0.0005663177],"domain_scores_gemma":[0.9382245,0.046142213,0.0019313064,0.0048305965,0.006213141,0.0026582426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010137912,0.0011600765,0.0018165566,0.0033620992,0.0018540969,0.00396756,0.003779833,0.0032832092,0.010507389],"category_scores_gemma":[0.07866146,0.00076747336,0.0014096341,0.0020918965,0.004791205,0.00808381,0.004040412,0.0038584066,0.0018316095],"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.0005405255,0.00008040946,0.00281403,0.00030400176,0.00011350815,0.00012598233,0.00041047737,0.09362401,0.0027912487,0.8665663,0.0056334594,0.026996024],"study_design_scores_gemma":[0.000084464424,0.00016608027,0.0010756892,0.00011045493,0.000058467474,0.0001883658,0.00013693504,0.5907099,0.002612356,0.40121692,0.0035755744,0.000064764885],"about_ca_topic_score_codex":0.0024735394,"about_ca_topic_score_gemma":0.0012899215,"teacher_disagreement_score":0.010507389,"about_ca_system_score_codex":0.0022419218,"about_ca_system_score_gemma":0.0023722234,"threshold_uncertainty_score":0.053615034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39029095,0.0029041483,0.50398076,0.0074226395,0.00031377966,0.00009503782,0.0011041274,0.00094855647,0.092940025],"genre_scores_gemma":[0.93473905,0.0015499837,0.034311846,0.00059247145,0.0005931552,0.00016667909,0.0010082447,0.00038010022,0.026658565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796224,0.0007105666,0.0000984469,0.00029157175,0.00059230207,0.00034477204],"domain_scores_gemma":[0.9771741,0.013490166,0.0013736805,0.0031912983,0.0032414906,0.0015292263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004678582,0.00060356036,0.0011069535,0.0043095816,0.0045272326,0.0065989275,0.0036568535,0.0014856877,0.011715558],"category_scores_gemma":[0.033676,0.00080092566,0.0006163715,0.0044933856,0.005081558,0.010801178,0.003541741,0.003996826,0.0016202134],"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.000070349495,0.000017500388,0.00025444478,0.000013329169,0.0000033928382,0.000022720042,0.00015638677,0.0016609663,0.00022175594,0.99024385,0.0013262404,0.0060092113],"study_design_scores_gemma":[0.000012969643,0.000011107349,0.00013584003,0.00001588792,0.0000038753387,0.00004378415,0.00006989691,0.011878703,0.00034271643,0.98546785,0.0020072209,0.000010048559],"about_ca_topic_score_codex":0.0022350715,"about_ca_topic_score_gemma":0.0017663486,"teacher_disagreement_score":0.011715558,"about_ca_system_score_codex":0.004062479,"about_ca_system_score_gemma":0.0018213312,"threshold_uncertainty_score":0.039192438},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8906342,0.00016517904,0.081168674,0.000529776,0.00003678907,0.000033912434,0.00017074776,0.0001999246,0.02706079],"genre_scores_gemma":[0.9941368,0.000044500885,0.0047222115,0.000041425497,0.000027216569,0.00001440529,0.000054269472,0.000016353093,0.00094271236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896955,0.00020404973,0.000052818694,0.00023351955,0.00031412466,0.00022588058],"domain_scores_gemma":[0.9964216,0.0018454527,0.00039928683,0.0004758144,0.0003794936,0.00047849072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009511259,0.00021896219,0.000338226,0.0016636092,0.0011065586,0.0021902954,0.0006595376,0.0006548314,0.0045025093],"category_scores_gemma":[0.004431808,0.00023738008,0.00041396637,0.00054303935,0.0035571575,0.004685788,0.001724111,0.0012270426,0.00033351878],"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.00004406162,0.00001868122,0.0014452713,0.000025006722,0.0000063656894,0.000086278174,0.00039614656,0.0020605351,0.005454558,0.9865333,0.00023979237,0.0036900367],"study_design_scores_gemma":[0.000022346258,0.00004644843,0.0026478518,0.000028814147,0.00001567834,0.0004495524,0.00042740945,0.018683614,0.008023629,0.96671975,0.0029027197,0.000032259915],"about_ca_topic_score_codex":0.0003560009,"about_ca_topic_score_gemma":0.00027156496,"teacher_disagreement_score":0.0045025093,"about_ca_system_score_codex":0.0008337227,"about_ca_system_score_gemma":0.00030686677,"threshold_uncertainty_score":0.015062392},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42843986,0.004354464,0.24437073,0.008841176,0.0007099115,0.00021950772,0.001485365,0.0007278237,0.31085113],"genre_scores_gemma":[0.9624286,0.0013007247,0.022868406,0.0004875822,0.00045081408,0.00011771897,0.0005405679,0.000075436765,0.011730047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979249,0.00051581836,0.00017652179,0.00042751757,0.00057616073,0.0003790295],"domain_scores_gemma":[0.992924,0.0047065723,0.0003661002,0.00063653843,0.0009132503,0.00045359888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025090172,0.00039007733,0.00060853513,0.002076552,0.002170617,0.004210651,0.0006430816,0.0012715983,0.012934091],"category_scores_gemma":[0.009529847,0.00041160535,0.00081523624,0.0018218862,0.0064025465,0.012151925,0.0039211637,0.0026921085,0.0011064939],"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.000021294589,0.0000062265212,0.00017936675,0.000024360175,0.0000024104274,0.000043498996,0.00011736343,0.00036759552,0.00020063501,0.99674916,0.00038462837,0.0019036209],"study_design_scores_gemma":[0.000019735224,0.000012206001,0.00012705027,0.000023195413,0.00000631878,0.000048696635,0.00009341514,0.0020816533,0.0007352556,0.9929361,0.003907597,0.000008886112],"about_ca_topic_score_codex":0.0018216721,"about_ca_topic_score_gemma":0.001420815,"teacher_disagreement_score":0.012934091,"about_ca_system_score_codex":0.0026396562,"about_ca_system_score_gemma":0.0012915283,"threshold_uncertainty_score":0.04326886},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099726714,0.0016417103,0.5920648,0.0021910092,0.0004031626,0.00016290485,0.001366905,0.001211378,0.30123144],"genre_scores_gemma":[0.9086949,0.001154686,0.055159308,0.00046664092,0.00037461845,0.0002620651,0.0014796015,0.0003043257,0.03210396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777067,0.00035521254,0.00018507917,0.000748557,0.0006142863,0.00032620673],"domain_scores_gemma":[0.99811804,0.0005399315,0.00017307156,0.00054698996,0.00044917167,0.00017282316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318671,0.0006540022,0.0007162173,0.0017057233,0.002249517,0.0049253493,0.00070284156,0.0008702903,0.014976206],"category_scores_gemma":[0.0025649385,0.000517449,0.0012831789,0.0013954611,0.0059494334,0.010233706,0.0030852638,0.0026423163,0.0016958064],"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.000009219801,0.0000064707024,0.00014695516,0.000028146667,0.000009678435,0.00005601104,0.00022332015,0.00025863797,0.00041112758,0.99407166,0.00045652012,0.0043221097],"study_design_scores_gemma":[0.000007215074,0.000025354177,0.000374427,0.000019102305,0.000016719121,0.0002106596,0.00027754027,0.0010787164,0.00079923554,0.9663852,0.03079068,0.000015126986],"about_ca_topic_score_codex":0.0014511304,"about_ca_topic_score_gemma":0.001143596,"teacher_disagreement_score":0.014976206,"about_ca_system_score_codex":0.0014411282,"about_ca_system_score_gemma":0.0008553935,"threshold_uncertainty_score":0.050100386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44221485,0.0036683762,0.07036095,0.0629349,0.0012159422,0.00045712217,0.00014569455,0.00033814574,0.41866398],"genre_scores_gemma":[0.8293508,0.003917411,0.022340981,0.007497266,0.0002799742,0.0003072154,0.00018774811,0.00038079376,0.13573769],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.98953307,0.0062774285,0.00023417607,0.0008250461,0.0023429617,0.0007873892],"domain_scores_gemma":[0.97824883,0.013053707,0.0015487289,0.0012038293,0.004187508,0.0017573489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009398156,0.0006266566,0.00028770068,0.0018361937,0.0056146267,0.007661204,0.00170681,0.0016645739,0.00906017],"category_scores_gemma":[0.030384066,0.00044988503,0.00055528356,0.0017219483,0.008308047,0.009239243,0.0037143324,0.0051303594,0.0017809066],"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.00012639548,0.00048912055,0.0086787455,0.00047257778,0.00002575269,0.001469098,0.47736365,0.0014193588,0.004163055,0.35125282,0.06164017,0.0928993],"study_design_scores_gemma":[0.000020652464,0.00030828596,0.008571089,0.0006826183,0.000014624984,0.0011681335,0.35178813,0.0040406343,0.004755245,0.051115856,0.57743794,0.000096866104],"about_ca_topic_score_codex":0.003938543,"about_ca_topic_score_gemma":0.006188258,"teacher_disagreement_score":0.009398156,"about_ca_system_score_codex":0.0075040865,"about_ca_system_score_gemma":0.005943827,"threshold_uncertainty_score":0.05444622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4216048,0.0023946683,0.5030166,0.010585206,0.00021758462,0.00020533633,0.00093507353,0.0009411976,0.06009954],"genre_scores_gemma":[0.9030901,0.001324669,0.085861504,0.00048420933,0.00033275792,0.00031887292,0.00088587054,0.0003408793,0.0073609785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959466,0.0014025572,0.0001905146,0.00069863955,0.0010440082,0.0007176629],"domain_scores_gemma":[0.96976376,0.02598774,0.00075927266,0.0023602007,0.00064113265,0.0004878082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035485597,0.0010306465,0.0016746616,0.0013497318,0.0020855414,0.0054679886,0.0028247947,0.0020009056,0.010040731],"category_scores_gemma":[0.0294599,0.00062622223,0.0017068222,0.0022804746,0.0056555653,0.015475608,0.005807863,0.0055318247,0.00089221983],"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.00044479128,0.000108228785,0.0013607692,0.00028417516,0.000042982745,0.00012780543,0.00038659835,0.113290034,0.0021361285,0.8549935,0.0032530483,0.023571832],"study_design_scores_gemma":[0.000043449818,0.00003487464,0.00044186716,0.000032510026,0.000024119527,0.000056060548,0.00009255505,0.2407746,0.0011922759,0.7557483,0.0015364296,0.000022950924],"about_ca_topic_score_codex":0.0029347285,"about_ca_topic_score_gemma":0.0017870237,"teacher_disagreement_score":0.010040731,"about_ca_system_score_codex":0.0037264677,"about_ca_system_score_gemma":0.0018150493,"threshold_uncertainty_score":0.0335896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093681335,0.0007390251,0.8711662,0.0013287542,0.00015124894,0.00006966451,0.00025924415,0.0006952404,0.031909253],"genre_scores_gemma":[0.8669272,0.00074296497,0.12063334,0.00036970156,0.00020835566,0.00015561662,0.000334689,0.0002153151,0.010412857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975994,0.0007847347,0.0001437524,0.00034318437,0.000870146,0.00025870375],"domain_scores_gemma":[0.9980094,0.0006960559,0.0002252386,0.00041862324,0.00041552243,0.00023519617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015007013,0.0006886379,0.0006758209,0.0008424095,0.0010474559,0.0033446215,0.0011155774,0.0010753558,0.0045689084],"category_scores_gemma":[0.0041317153,0.000364185,0.0015309601,0.001040206,0.0046126605,0.0096924715,0.0026891208,0.00271718,0.0007271681],"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.000006757753,0.000004682008,0.000043284217,0.000019877187,0.000003429938,0.000014991416,0.00006649708,0.0030220195,0.0003742072,0.9954,0.00011009805,0.00093436154],"study_design_scores_gemma":[0.0000073799406,0.000025247784,0.00006181766,0.000017945275,0.000008364083,0.000038322552,0.00005488563,0.042710308,0.0010855753,0.95267445,0.0032994987,0.000016344471],"about_ca_topic_score_codex":0.0017647898,"about_ca_topic_score_gemma":0.0010619906,"teacher_disagreement_score":0.0045689084,"about_ca_system_score_codex":0.0022804064,"about_ca_system_score_gemma":0.0014032024,"threshold_uncertainty_score":0.016545534},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2975664,0.0038148318,0.60894144,0.007266157,0.00092819624,0.00019024817,0.00039196463,0.0021685055,0.07873224],"genre_scores_gemma":[0.959135,0.0010239352,0.029432043,0.0007873787,0.00065079937,0.00021120504,0.00025353744,0.0005574567,0.007948595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947802,0.0014181313,0.00039756644,0.00094076694,0.0014887211,0.0009746098],"domain_scores_gemma":[0.91644,0.059070263,0.004635046,0.01309857,0.004464406,0.0022916524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007430725,0.00076658017,0.0021428363,0.0017964143,0.0028127735,0.004129442,0.0027985706,0.0026916745,0.005204658],"category_scores_gemma":[0.06791892,0.0015560478,0.0010909801,0.001938444,0.009756257,0.017653847,0.007566406,0.008637136,0.0005950712],"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.0007021978,0.00010262414,0.0015241881,0.00020750306,0.00003165056,0.00025029265,0.0005788311,0.011076671,0.0017565915,0.9535203,0.0028842266,0.027364925],"study_design_scores_gemma":[0.00006690752,0.00005207783,0.00017122332,0.000032706823,0.000024290815,0.00011025213,0.00007634779,0.021680936,0.0009367633,0.9751883,0.0016458969,0.000014325379],"about_ca_topic_score_codex":0.0009911645,"about_ca_topic_score_gemma":0.0008402426,"teacher_disagreement_score":0.007430725,"about_ca_system_score_codex":0.0012823793,"about_ca_system_score_gemma":0.0018255278,"threshold_uncertainty_score":0.03929788},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2693981,0.0015618386,0.4993439,0.032850508,0.0009630985,0.00030625644,0.0005598813,0.001992848,0.19302349],"genre_scores_gemma":[0.96594644,0.00038327224,0.019364497,0.0017803913,0.00019773297,0.00020795884,0.0001016614,0.00020023099,0.0118178725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933343,0.0023425533,0.00030693872,0.0012647165,0.0014763144,0.0012752066],"domain_scores_gemma":[0.9491121,0.029083569,0.004003916,0.013173113,0.002366107,0.0022611015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055297078,0.0008681436,0.0010424927,0.0012958137,0.0030571192,0.0030044871,0.0020186545,0.0045398152,0.017383987],"category_scores_gemma":[0.043360054,0.00050988916,0.001295981,0.00088419975,0.0068729697,0.010690737,0.0068195546,0.0054969876,0.0023299195],"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.00032203647,0.0001880755,0.002265937,0.00021313108,0.00011384012,0.0010538134,0.0013258116,0.018187802,0.004721729,0.9283736,0.008494906,0.034739416],"study_design_scores_gemma":[0.000082443265,0.00016415685,0.0005781766,0.000057972673,0.000045581666,0.0005553704,0.00027177323,0.035388604,0.004040437,0.9446851,0.014081941,0.0000483395],"about_ca_topic_score_codex":0.0017981251,"about_ca_topic_score_gemma":0.0009324761,"teacher_disagreement_score":0.017383987,"about_ca_system_score_codex":0.0016734918,"about_ca_system_score_gemma":0.0017760542,"threshold_uncertainty_score":0.05815524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056865282,0.0020852436,0.8482247,0.0046064444,0.0003610576,0.00011417419,0.00049115584,0.00076681183,0.08648512],"genre_scores_gemma":[0.8756692,0.0008470444,0.106933355,0.0009357467,0.00060443435,0.00014765258,0.0004474683,0.00024210181,0.01417302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973992,0.000951639,0.00023096353,0.0006192876,0.0005664803,0.0002323866],"domain_scores_gemma":[0.9927487,0.004312138,0.00030946813,0.0012615335,0.0009880236,0.0003801687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051382286,0.00089376705,0.0015349962,0.0030054117,0.0022039204,0.0059287054,0.0029823738,0.0020483336,0.010206712],"category_scores_gemma":[0.009597252,0.001197043,0.00224109,0.0025191861,0.00805521,0.01915698,0.0039699385,0.006681528,0.0011677948],"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.000013133432,0.000005020168,0.00003666641,0.000013651634,0.000006004585,0.000011788214,0.00009187918,0.00019272987,0.000083133156,0.9979073,0.00018885153,0.0014498715],"study_design_scores_gemma":[0.000008063742,0.000003818455,0.00001744147,0.000004754669,0.0000072479306,0.000014285074,0.000020182932,0.0011344756,0.000119627766,0.99797887,0.0006867018,0.0000045215297],"about_ca_topic_score_codex":0.0014001143,"about_ca_topic_score_gemma":0.0012571382,"teacher_disagreement_score":0.010206712,"about_ca_system_score_codex":0.0033300505,"about_ca_system_score_gemma":0.00090721773,"threshold_uncertainty_score":0.03414482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017138332,0.008178226,0.9406647,0.0016660913,0.00071767945,0.000274634,0.0012487371,0.00049411354,0.029617468],"genre_scores_gemma":[0.40905893,0.007961843,0.56073093,0.001379951,0.0016951257,0.0011642737,0.00377163,0.0005252091,0.013712076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895583,0.0029273748,0.0013557264,0.0024326486,0.00338744,0.00033846675],"domain_scores_gemma":[0.9903715,0.004296718,0.0010180045,0.0020442954,0.0017417625,0.0005276278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033581357,0.0013919028,0.0016293321,0.0070213242,0.0017508101,0.005967382,0.0026578773,0.0027976593,0.005436026],"category_scores_gemma":[0.021854687,0.00047434782,0.0013488041,0.006406176,0.0040108417,0.012948374,0.004357489,0.0024876238,0.0024954372],"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.00008603358,0.000048733415,0.0021422764,0.0006354045,0.00013508636,0.0001978624,0.00043759678,0.008945958,0.0039514066,0.81549644,0.00941837,0.1585049],"study_design_scores_gemma":[0.000020322097,0.00020034307,0.0016004604,0.00017825748,0.000074646654,0.0013778369,0.0002822947,0.042303726,0.003143461,0.8451907,0.10553688,0.00009116291],"about_ca_topic_score_codex":0.0008084814,"about_ca_topic_score_gemma":0.00049875857,"teacher_disagreement_score":0.0070213242,"about_ca_system_score_codex":0.0022414087,"about_ca_system_score_gemma":0.0014070979,"threshold_uncertainty_score":0.018185318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08791372,0.011365675,0.5350858,0.018997818,0.0016715976,0.00012802235,0.0012024936,0.00069502,0.34293985],"genre_scores_gemma":[0.8274487,0.0069532753,0.09975462,0.0034470682,0.001712038,0.00014462759,0.0009716844,0.0003436548,0.05922431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895597,0.00023362217,0.000053239037,0.0002907425,0.00029664094,0.00016972322],"domain_scores_gemma":[0.9986343,0.0005744154,0.00011378425,0.00032143222,0.00023223012,0.00012383894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016456869,0.00090401387,0.0006696746,0.002238955,0.0018124682,0.003186778,0.0007574936,0.0016573722,0.01959612],"category_scores_gemma":[0.0025840767,0.0003153891,0.0017370228,0.0021729833,0.005982238,0.011500059,0.0023549944,0.0035262706,0.0012094417],"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.000004059368,0.000011450646,0.00020297374,0.000034611443,0.000004688538,0.00006085503,0.00030905675,0.0003856528,0.00038051626,0.994962,0.000971528,0.0026725994],"study_design_scores_gemma":[0.000003911299,0.000024086694,0.00046412757,0.00003513431,0.000008280742,0.00013816789,0.00020376589,0.0008624149,0.0003777471,0.97066534,0.027201062,0.000015996184],"about_ca_topic_score_codex":0.001993716,"about_ca_topic_score_gemma":0.0016748848,"teacher_disagreement_score":0.01959612,"about_ca_system_score_codex":0.0014956703,"about_ca_system_score_gemma":0.00049751834,"threshold_uncertainty_score":0.06555557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5901428,0.0012514087,0.21359047,0.0029752576,0.00024985042,0.00015242894,0.00043028974,0.00084711623,0.19036044],"genre_scores_gemma":[0.97613156,0.00022011394,0.015542333,0.00030373898,0.00012536177,0.00008622893,0.00018391611,0.000098749355,0.0073079625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962437,0.00066221156,0.00028253574,0.00066445314,0.0015050111,0.0006420624],"domain_scores_gemma":[0.98897064,0.007131481,0.00046370947,0.0013596574,0.0013867071,0.0006878715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038358476,0.0005622786,0.00093223306,0.0024763988,0.0016339973,0.0033268076,0.0014335751,0.0013127865,0.008146934],"category_scores_gemma":[0.016202902,0.00066748966,0.0014709297,0.0010294993,0.006287494,0.007729827,0.006248986,0.0047678538,0.00057059113],"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.000051625484,0.000036820267,0.0007431911,0.000047507583,0.00001643275,0.00022457191,0.0003778653,0.0019164546,0.0011283174,0.9902925,0.00049373816,0.0046710647],"study_design_scores_gemma":[0.00001547038,0.00002824291,0.0002976994,0.00001707744,0.0000151847025,0.00018408912,0.00018348006,0.009266546,0.0016248311,0.9862618,0.0020899188,0.000015707006],"about_ca_topic_score_codex":0.0013173926,"about_ca_topic_score_gemma":0.0010656472,"teacher_disagreement_score":0.008146934,"about_ca_system_score_codex":0.0015149466,"about_ca_system_score_gemma":0.0007351884,"threshold_uncertainty_score":0.027254224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029211964,0.00029829066,0.9667242,0.00022841377,0.0000544555,0.000044077628,0.00005162178,0.0009845305,0.0024024593],"genre_scores_gemma":[0.72160155,0.0007445703,0.27224854,0.0002761576,0.00042414528,0.00015536933,0.00034560778,0.00018831308,0.004015714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975151,0.00048548763,0.00017010781,0.00032062587,0.001347078,0.0001616502],"domain_scores_gemma":[0.9841471,0.010334748,0.001743465,0.0014205272,0.0020651014,0.00028908366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023903581,0.00085371174,0.0013442752,0.0039481907,0.0007344528,0.0024235835,0.0008821145,0.0012374859,0.0021532911],"category_scores_gemma":[0.02663564,0.0005868862,0.0009696582,0.0012273857,0.0012514503,0.0048741037,0.0013820122,0.0015609441,0.0009964391],"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.0005919502,0.0002395957,0.013118263,0.00031059526,0.00029709536,0.00045380634,0.0005403241,0.26096362,0.0288844,0.116468996,0.0060444125,0.572087],"study_design_scores_gemma":[0.000020625288,0.0000935723,0.0030355414,0.000027207028,0.000038909842,0.00020006669,0.00003508292,0.9388499,0.007689546,0.047032032,0.0029084112,0.00006916916],"about_ca_topic_score_codex":0.0022686527,"about_ca_topic_score_gemma":0.0018806384,"teacher_disagreement_score":0.0039481907,"about_ca_system_score_codex":0.0014569632,"about_ca_system_score_gemma":0.001206965,"threshold_uncertainty_score":0.012641549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11652919,0.0019183314,0.72849613,0.004438767,0.0006232337,0.000083571715,0.00048531467,0.0004328296,0.14699265],"genre_scores_gemma":[0.80496025,0.0017620695,0.13594912,0.0013705433,0.0012693816,0.00020498624,0.0006155664,0.0003059614,0.053562284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990841,0.00017990133,0.000059827693,0.00021923585,0.00029705864,0.00015988521],"domain_scores_gemma":[0.99840873,0.00068626157,0.00010381053,0.00027102698,0.00033119097,0.00019896233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015486637,0.0007131742,0.0011976755,0.0027435096,0.002083754,0.004076531,0.0010226893,0.0012456978,0.006125094],"category_scores_gemma":[0.0034255385,0.00057910534,0.001870125,0.001578752,0.003531848,0.009535853,0.0024886772,0.004466972,0.0010973205],"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.000005550781,0.0000054741136,0.000039581464,0.000010659456,0.0000028255308,0.000007333708,0.00006023165,0.000121950885,0.00016211523,0.99736685,0.00055953895,0.0016578585],"study_design_scores_gemma":[0.0000046897285,0.000005925756,0.00006833599,0.000005814911,0.000003847837,0.00003655234,0.000017794016,0.0017344083,0.00023854221,0.9956903,0.0021883177,0.000005373617],"about_ca_topic_score_codex":0.0007282718,"about_ca_topic_score_gemma":0.0007548634,"teacher_disagreement_score":0.006125094,"about_ca_system_score_codex":0.0017834251,"about_ca_system_score_gemma":0.0008505629,"threshold_uncertainty_score":0.020490468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005358156,0.00024923668,0.9667723,0.0012616892,0.00030114592,0.00025743543,0.000457368,0.012213397,0.013129105],"genre_scores_gemma":[0.031626258,0.00024326333,0.9405797,0.0006295525,0.0001413583,0.0003615082,0.0010285615,0.0012959662,0.024093784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737513,0.00079439103,0.00017571928,0.0005660842,0.0008030892,0.00028557546],"domain_scores_gemma":[0.9937943,0.0025955965,0.0003896212,0.0018425934,0.00067164353,0.0007062836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049330792,0.0010928191,0.0018124881,0.0021689907,0.002822511,0.003888344,0.0043581426,0.0029495067,0.026690597],"category_scores_gemma":[0.011192861,0.001513171,0.0024650218,0.0023863977,0.0020834515,0.0064508705,0.007127996,0.0028760855,0.015580027],"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.0012793876,0.00038919557,0.0020091308,0.0009226234,0.00013330622,0.00046389762,0.00061800156,0.015746485,0.014110314,0.40369794,0.12683524,0.4337944],"study_design_scores_gemma":[0.00076759123,0.00051941094,0.0007779938,0.00015740076,0.00013298688,0.0017584623,0.0002432063,0.29967362,0.028281664,0.41985857,0.24751417,0.00031493907],"about_ca_topic_score_codex":0.0014484532,"about_ca_topic_score_gemma":0.003075152,"teacher_disagreement_score":0.026690597,"about_ca_system_score_codex":0.0017244829,"about_ca_system_score_gemma":0.004774511,"threshold_uncertainty_score":0.08928895},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029857583,0.0009820134,0.93352294,0.0022173172,0.00042228057,0.00013727183,0.00039269918,0.00027845718,0.032189384],"genre_scores_gemma":[0.7738691,0.00090416183,0.21069585,0.0011280804,0.0010495549,0.0005326543,0.00048638723,0.0003973343,0.010936891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98741364,0.0048137354,0.00091705564,0.0026737326,0.0032280174,0.0009538261],"domain_scores_gemma":[0.9849568,0.0076581463,0.0013598735,0.0035355652,0.0017993007,0.0006903251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072463895,0.0014528089,0.0012507626,0.0026342385,0.0022606968,0.005612833,0.0035170943,0.0029859531,0.008280004],"category_scores_gemma":[0.01792269,0.000841675,0.0018536126,0.0025572437,0.014646323,0.022618493,0.0077240244,0.008792032,0.0009680571],"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.000019642475,0.000013937848,0.00008218647,0.000033004966,0.0000096719,0.00003886522,0.0001410094,0.0015871383,0.0005305279,0.9953892,0.00017098415,0.0019837543],"study_design_scores_gemma":[0.000015724276,0.000065969,0.00010952099,0.00002664809,0.000014226824,0.00013073937,0.00009270686,0.017075486,0.0013757638,0.97731584,0.0037404592,0.00003692868],"about_ca_topic_score_codex":0.0007803835,"about_ca_topic_score_gemma":0.0003828791,"teacher_disagreement_score":0.008280004,"about_ca_system_score_codex":0.0025541345,"about_ca_system_score_gemma":0.0016836976,"threshold_uncertainty_score":0.038323045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057672644,0.00007106938,0.9868853,0.0003834253,0.00007317622,0.000055684348,0.000063672655,0.0011299516,0.005570517],"genre_scores_gemma":[0.23788498,0.0002953246,0.7506464,0.00044165202,0.00024280057,0.00025466052,0.00042879354,0.00070693746,0.009098399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958942,0.0010364101,0.00019491036,0.0010085063,0.0016269606,0.00023900601],"domain_scores_gemma":[0.9914278,0.004541968,0.00034773568,0.0024261028,0.0010684365,0.00018807172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003562665,0.000544788,0.0010310939,0.00087639707,0.0011005685,0.0015267287,0.003130577,0.0011118137,0.009084526],"category_scores_gemma":[0.012423212,0.00067035976,0.0014685099,0.001302833,0.0028564949,0.004405608,0.004104827,0.002447253,0.002321155],"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.00011434188,0.00008643069,0.0006825514,0.00016871387,0.00006801929,0.00018911896,0.00017167236,0.074402474,0.0054817093,0.7241045,0.0050224136,0.18950808],"study_design_scores_gemma":[0.000026091959,0.000020054415,0.000098132914,0.000013287624,0.000014888942,0.00010349572,0.00001675518,0.3956949,0.0046293256,0.593047,0.0063234875,0.000012476462],"about_ca_topic_score_codex":0.0011947675,"about_ca_topic_score_gemma":0.0020110453,"teacher_disagreement_score":0.009084526,"about_ca_system_score_codex":0.0016924872,"about_ca_system_score_gemma":0.0021833845,"threshold_uncertainty_score":0.03039074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078727774,0.0026931057,0.8647924,0.001403673,0.00029415864,0.00012110433,0.00088034,0.0010179345,0.050069567],"genre_scores_gemma":[0.6581019,0.002242036,0.32118234,0.0008908771,0.00047549416,0.00059902767,0.0013369869,0.00032607574,0.014845287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973584,0.000782626,0.00034814025,0.00057311874,0.00068435044,0.0002533998],"domain_scores_gemma":[0.9971042,0.0017058301,0.0003072829,0.00036141174,0.00037572827,0.00014548624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002248997,0.0008531432,0.0007467527,0.0020477313,0.0011063056,0.005027128,0.0013159986,0.0011646037,0.0041117957],"category_scores_gemma":[0.005581349,0.00054548506,0.001152042,0.002215719,0.00472452,0.008904135,0.002097083,0.0024154258,0.0009514467],"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.000019728139,0.000006842575,0.00012978495,0.000045265995,0.000007394342,0.000065027874,0.0002925918,0.0010759248,0.00094412063,0.98913145,0.00032040212,0.007961621],"study_design_scores_gemma":[0.000015052484,0.000021791437,0.0001900044,0.000054953784,0.000021912474,0.00023669736,0.00013615948,0.009597556,0.0027271542,0.9664699,0.020505484,0.000023394325],"about_ca_topic_score_codex":0.0006883092,"about_ca_topic_score_gemma":0.0004516913,"teacher_disagreement_score":0.005027128,"about_ca_system_score_codex":0.001716864,"about_ca_system_score_gemma":0.0008173372,"threshold_uncertainty_score":0.0137553215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020628441,0.17839298,0.41733736,0.008618598,0.003376342,0.00006948411,0.0008270169,0.0006008095,0.370149],"genre_scores_gemma":[0.58503824,0.108168595,0.13749832,0.0021495356,0.008123395,0.00024319769,0.0012049834,0.0004137544,0.15715997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907255,0.0001880103,0.000059708447,0.00023258789,0.0003835611,0.00006356731],"domain_scores_gemma":[0.99787486,0.0012299777,0.000120374236,0.0002994519,0.0003628524,0.000112571746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008419164,0.0007682139,0.0012435539,0.003335691,0.0009213743,0.0028800333,0.001118485,0.0015247567,0.011729955],"category_scores_gemma":[0.005598737,0.0003304503,0.0005098828,0.0063255313,0.0022477305,0.0050195353,0.002400479,0.0024278944,0.003502901],"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.0000152470175,0.000017564931,0.0002168453,0.00017610815,0.000011931691,0.000035634836,0.00007725696,0.0026418124,0.00022242485,0.8809537,0.011920115,0.103711344],"study_design_scores_gemma":[0.0000029395028,0.000013350449,0.00021996847,0.0000560344,0.000009212165,0.00017987563,0.00004275155,0.0086872205,0.0003416501,0.94612783,0.044309355,0.000009787258],"about_ca_topic_score_codex":0.00082617457,"about_ca_topic_score_gemma":0.00046693685,"teacher_disagreement_score":0.011729955,"about_ca_system_score_codex":0.001681775,"about_ca_system_score_gemma":0.00062428106,"threshold_uncertainty_score":0.0392406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13798814,0.013981187,0.663518,0.013544335,0.0010258118,0.00012489082,0.00077773654,0.00052137487,0.16851859],"genre_scores_gemma":[0.9287723,0.002767048,0.054522507,0.0007981765,0.0007889159,0.00015345374,0.0003175304,0.00010965778,0.011770551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797636,0.0005235865,0.00016798956,0.0005561987,0.00060686836,0.00016903094],"domain_scores_gemma":[0.9916198,0.0059724716,0.00037815317,0.001023815,0.00072127586,0.00028438205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021832949,0.00083306,0.00074881065,0.003524192,0.0017906637,0.0045464463,0.0011322341,0.0011635848,0.004963724],"category_scores_gemma":[0.0085580265,0.00037646378,0.0012603692,0.003092459,0.007958663,0.008538928,0.0038183501,0.0048087738,0.0005352438],"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.0000047068474,0.0000032185703,0.000111359564,0.000018307748,0.0000035183873,0.0000183998,0.00007528443,0.00079933845,0.00014378641,0.99689853,0.00022953788,0.0016940518],"study_design_scores_gemma":[0.0000039302085,0.000004690146,0.00012547622,0.000012939933,0.000003880884,0.000031741125,0.00003484027,0.0046800287,0.00033295518,0.9901624,0.004602186,0.000004846315],"about_ca_topic_score_codex":0.0017528122,"about_ca_topic_score_gemma":0.0007621029,"teacher_disagreement_score":0.004963724,"about_ca_system_score_codex":0.004624662,"about_ca_system_score_gemma":0.00061374175,"threshold_uncertainty_score":0.033554435},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010759926,0.018575735,0.76589614,0.052350465,0.02971399,0.00024198524,0.0024367147,0.009282379,0.11074265],"genre_scores_gemma":[0.32432097,0.020363878,0.5208308,0.012349107,0.021482568,0.0011655,0.0031853504,0.0048706844,0.091431126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976931,0.000477183,0.00013755627,0.00064440997,0.0008375078,0.00021007058],"domain_scores_gemma":[0.99326396,0.003569826,0.00021908924,0.0016947263,0.000936837,0.00031558183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002512673,0.0015327492,0.0009280263,0.001363828,0.0017879902,0.0074525233,0.0016546549,0.002136874,0.04550985],"category_scores_gemma":[0.026641347,0.0011423195,0.0010021849,0.002488811,0.0030504528,0.016907154,0.0035006846,0.0058170417,0.018297618],"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.0006531926,0.000053216983,0.0012304294,0.00038617427,0.00012113914,0.00019947074,0.00030679477,0.02242191,0.0026218423,0.4570661,0.3232856,0.19165412],"study_design_scores_gemma":[0.000078023586,0.00005677955,0.0004290131,0.00018518385,0.000055177672,0.00019332304,0.000118757285,0.05462735,0.002465881,0.7117367,0.22999483,0.000059006717],"about_ca_topic_score_codex":0.0026049018,"about_ca_topic_score_gemma":0.0020222247,"teacher_disagreement_score":0.04550985,"about_ca_system_score_codex":0.0019200944,"about_ca_system_score_gemma":0.0010311007,"threshold_uncertainty_score":0.15224558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34502953,0.0013866643,0.56028587,0.0026781831,0.00023072776,0.00026494285,0.00086757616,0.0003546517,0.08890184],"genre_scores_gemma":[0.8960192,0.0007448537,0.08551315,0.0003517755,0.00014349236,0.00022619213,0.00051796564,0.00008561386,0.016397685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823135,0.00061794155,0.000098132026,0.00034259868,0.0002978031,0.00041212374],"domain_scores_gemma":[0.9980552,0.0010165003,0.00025323153,0.00015422895,0.00016213309,0.00035869092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017970384,0.0007987859,0.0008041085,0.0013023354,0.001487829,0.003000616,0.0012077505,0.0009157211,0.006954421],"category_scores_gemma":[0.004393538,0.00036925366,0.0005305386,0.0014491259,0.0026158553,0.0074953376,0.0023391417,0.0015157878,0.0007594697],"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.00015283517,0.000035704496,0.00040247414,0.000040233674,0.000010052703,0.0000534708,0.00017493436,0.007810026,0.0012550233,0.97933257,0.0009577019,0.009774971],"study_design_scores_gemma":[0.000044333283,0.0000843854,0.00022593453,0.000024169007,0.000010056134,0.00010405876,0.00013074254,0.03832485,0.00080301904,0.9532429,0.0069859587,0.000019468649],"about_ca_topic_score_codex":0.0018670505,"about_ca_topic_score_gemma":0.0013942311,"teacher_disagreement_score":0.006954421,"about_ca_system_score_codex":0.0024111161,"about_ca_system_score_gemma":0.0009904592,"threshold_uncertainty_score":0.023264885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11416112,0.009227965,0.65453464,0.0077750734,0.0012678679,0.00015432261,0.0064107548,0.0031602015,0.20330806],"genre_scores_gemma":[0.6964665,0.0047759,0.20011711,0.0009438551,0.0014233878,0.00032435864,0.006106352,0.0007916437,0.08905093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880064,0.00032087194,0.00012653647,0.0002726617,0.00037296137,0.00010633646],"domain_scores_gemma":[0.9932545,0.0033472134,0.0005172351,0.0017096136,0.0008425023,0.00032908804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016344057,0.00083162374,0.0010480593,0.003598744,0.0023147142,0.008056338,0.0019975756,0.0010155244,0.020277474],"category_scores_gemma":[0.010414554,0.0007017456,0.0009783519,0.004516766,0.003214806,0.012373261,0.0022817685,0.0050910143,0.006462442],"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.000047941525,0.00002149505,0.00017221586,0.000072246985,0.000008555532,0.000029993376,0.00016343055,0.00051457545,0.00040002572,0.981062,0.0035523302,0.0139551805],"study_design_scores_gemma":[0.000013023484,0.000011324326,0.00017859631,0.00003857829,0.000013034728,0.00012512975,0.000060352213,0.0024437637,0.0008170519,0.97533643,0.020950506,0.000012334597],"about_ca_topic_score_codex":0.0005012426,"about_ca_topic_score_gemma":0.0006414555,"teacher_disagreement_score":0.020277474,"about_ca_system_score_codex":0.0021331962,"about_ca_system_score_gemma":0.0011482374,"threshold_uncertainty_score":0.067834914},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010515453,0.06202008,0.8258931,0.013479871,0.0011083507,0.00011779719,0.00041806084,0.00027256273,0.0861747],"genre_scores_gemma":[0.49225998,0.06829939,0.4092544,0.0042465026,0.006260126,0.00058965344,0.00078439066,0.00023173414,0.01807389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944675,0.0019146441,0.00047558808,0.0011277478,0.0017645502,0.0002499857],"domain_scores_gemma":[0.9855414,0.010210747,0.00052457914,0.0015130839,0.0018218462,0.00038836186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047834483,0.001075572,0.0014609492,0.0060526463,0.0021081977,0.0043942467,0.0020739234,0.0033424303,0.0046339016],"category_scores_gemma":[0.020461181,0.00064650393,0.00153541,0.0074911383,0.0071182833,0.009331764,0.0049995584,0.0053633265,0.0012271386],"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.0000114097065,0.000013190922,0.00033779533,0.00016404434,0.00001966392,0.00006535141,0.00013741285,0.0032596155,0.00018194351,0.9621615,0.0020187597,0.03162927],"study_design_scores_gemma":[0.0000041973676,0.000017127228,0.0001797725,0.00007064635,0.000010018006,0.00018129515,0.00005746433,0.010784242,0.0002552031,0.97042364,0.018001283,0.000015083636],"about_ca_topic_score_codex":0.0019987938,"about_ca_topic_score_gemma":0.0006875202,"teacher_disagreement_score":0.0060526463,"about_ca_system_score_codex":0.003916373,"about_ca_system_score_gemma":0.001480769,"threshold_uncertainty_score":0.028415382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45543894,0.002155892,0.33903584,0.0034912685,0.0016966067,0.0001397797,0.0011124985,0.0004877984,0.19644143],"genre_scores_gemma":[0.8784498,0.0021216255,0.055244923,0.00090450357,0.0010629378,0.0002708472,0.0016394948,0.0007107707,0.05959521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989097,0.00027136164,0.00006804894,0.00018411802,0.0002631889,0.00030365048],"domain_scores_gemma":[0.9935661,0.0049506947,0.00039979693,0.00050718145,0.00038789026,0.000188445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001053204,0.00096298975,0.0010096807,0.0024450412,0.002176726,0.0025395416,0.0010913673,0.0018302405,0.015265959],"category_scores_gemma":[0.009328534,0.0005554535,0.0012039841,0.0041975873,0.0018430839,0.0073259575,0.0022705928,0.0017496421,0.0016792597],"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.0001755289,0.00003090699,0.00032430235,0.00014501029,0.000016372682,0.0002736643,0.0001761539,0.007370856,0.0017854484,0.9709589,0.0037963253,0.014946653],"study_design_scores_gemma":[0.00001983093,0.000024093319,0.00024810177,0.00003556852,0.000012748253,0.00011134031,0.00004840636,0.015232328,0.0011079197,0.97980803,0.0033307667,0.000020974383],"about_ca_topic_score_codex":0.00084332353,"about_ca_topic_score_gemma":0.0009540579,"teacher_disagreement_score":0.015265959,"about_ca_system_score_codex":0.0012915325,"about_ca_system_score_gemma":0.00054178794,"threshold_uncertainty_score":0.051069736},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11848792,0.11027878,0.07456539,0.17294914,0.013429267,0.00061237626,0.044208437,0.00846469,0.45700398],"genre_scores_gemma":[0.3995818,0.038813528,0.06784085,0.005921944,0.0071817087,0.00066012796,0.020565934,0.00057226076,0.45886186],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.99892694,0.00018155125,0.000056716377,0.00030405764,0.00039300468,0.00013776685],"domain_scores_gemma":[0.99726665,0.00024506223,0.0002659575,0.0002897132,0.0014872456,0.00044546105],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015110299,0.0006655609,0.00028189886,0.0029503694,0.0011389783,0.001854667,0.00044979478,0.000678035,0.019559437],"category_scores_gemma":[0.0030488668,0.00030527383,0.00013976822,0.0022094618,0.0009871912,0.0012448474,0.0026147682,0.0008804535,0.0071229697],"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.00019342003,0.000051900755,0.016490916,0.00013550883,0.000017354228,0.00020680271,0.00047865752,0.0007421855,0.0015740714,0.02073726,0.49658418,0.46278766],"study_design_scores_gemma":[0.0000075816806,0.000029940666,0.0087832445,0.00006598204,0.000006340745,0.000037218222,0.00009252026,0.00042939448,0.0008019601,0.001782613,0.9879551,0.000008042421],"about_ca_topic_score_codex":0.010017636,"about_ca_topic_score_gemma":0.012581021,"teacher_disagreement_score":0.998861,"about_ca_system_score_codex":0.0022401763,"about_ca_system_score_gemma":0.0025148033,"threshold_uncertainty_score":0.06543285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009484835,0.003969051,0.6566969,0.029220844,0.0006650025,0.0001084504,0.00023341214,0.00018603702,0.29943547],"genre_scores_gemma":[0.76622045,0.0033665197,0.17431408,0.008413333,0.0015761536,0.0007330396,0.00020613465,0.00023065762,0.044939626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962681,0.0016291771,0.00013180406,0.0007113656,0.00096965465,0.00028982502],"domain_scores_gemma":[0.99688953,0.0018617979,0.00019883603,0.0005321664,0.0003456826,0.00017199603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033418473,0.0010320998,0.0007841834,0.0009992298,0.0019037874,0.0040763645,0.0027399112,0.0032568753,0.007021749],"category_scores_gemma":[0.007668813,0.00041574438,0.0014302226,0.0009958982,0.012658457,0.007862314,0.0037224444,0.006264714,0.0012925386],"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.0000013842895,0.0000027849853,0.000017787714,0.0000063610546,0.0000017421928,0.000008372173,0.0000605914,0.000409757,0.00002807143,0.9984263,0.00038961615,0.0006473658],"study_design_scores_gemma":[0.0000028130855,0.0000027009457,0.000010484506,0.000007654361,0.0000012233824,0.000006634281,0.00001616992,0.0015738629,0.0000242494,0.99397624,0.0043762005,0.0000017141263],"about_ca_topic_score_codex":0.0024958444,"about_ca_topic_score_gemma":0.0019152454,"teacher_disagreement_score":0.007021749,"about_ca_system_score_codex":0.0045861206,"about_ca_system_score_gemma":0.0025874735,"threshold_uncertainty_score":0.03327477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009185152,0.0008941877,0.9682682,0.0016308093,0.00031492236,0.00004626347,0.00020420636,0.00018622143,0.019270107],"genre_scores_gemma":[0.45855814,0.0028015377,0.5089469,0.0022463358,0.0014402155,0.00045819063,0.0011389022,0.00041694188,0.023992812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971437,0.00066322583,0.00019897324,0.0007907008,0.0008667494,0.00033653656],"domain_scores_gemma":[0.99462813,0.0034745706,0.00025658042,0.0007498154,0.0006113743,0.00027955428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040589385,0.00070347585,0.0008662352,0.0018017782,0.0012808742,0.0037558135,0.0019471426,0.0018123068,0.008271015],"category_scores_gemma":[0.01072327,0.0005108334,0.0024073094,0.0021551556,0.0043531074,0.014009396,0.005107641,0.005809738,0.0013086762],"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.0000076017373,0.000008774614,0.00005454019,0.00004096997,0.0000073973283,0.000035724795,0.000098384255,0.0007174583,0.00032310557,0.9893064,0.0011162808,0.008283398],"study_design_scores_gemma":[0.000020451964,0.0000236733,0.00008067169,0.00004613816,0.000019908945,0.00019940517,0.00005144331,0.010625601,0.00092411897,0.9740967,0.013896293,0.000015662414],"about_ca_topic_score_codex":0.0010554941,"about_ca_topic_score_gemma":0.0005453853,"teacher_disagreement_score":0.008271015,"about_ca_system_score_codex":0.0019018486,"about_ca_system_score_gemma":0.0011424746,"threshold_uncertainty_score":0.027669251},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026028631,0.00024267811,0.9912407,0.00024133947,0.000043993077,0.00004460114,0.000029101062,0.000028641887,0.005526134],"genre_scores_gemma":[0.10150063,0.0012168812,0.89244235,0.00034525828,0.00015586852,0.00044881232,0.00009965382,0.00007912906,0.0037113952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904305,0.00045307606,0.00006187316,0.00015660952,0.00023409218,0.00005121107],"domain_scores_gemma":[0.99824655,0.0013026524,0.00015464357,0.00013410767,0.0001238441,0.000038097205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021172543,0.0013705278,0.0011127314,0.001866807,0.00058922876,0.0017151355,0.0010584102,0.0010928815,0.0071050352],"category_scores_gemma":[0.0047054305,0.0007278767,0.001233234,0.0019253202,0.0017168745,0.002367538,0.00129341,0.002211114,0.0007115439],"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.000047174424,0.000065651475,0.00021471096,0.00026658698,0.000034374203,0.00006213286,0.000061754785,0.2591796,0.0013150278,0.6818444,0.0023357812,0.05457278],"study_design_scores_gemma":[0.00004599155,0.000100062476,0.000066855115,0.0000701385,0.000020449499,0.000105807856,0.000040464613,0.557797,0.0013315048,0.4312527,0.009144602,0.000024476083],"about_ca_topic_score_codex":0.0005486212,"about_ca_topic_score_gemma":0.0007228794,"teacher_disagreement_score":0.0071050352,"about_ca_system_score_codex":0.001218206,"about_ca_system_score_gemma":0.0013529571,"threshold_uncertainty_score":0.023768663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28647918,0.002110335,0.48089883,0.0033866703,0.0005329845,0.00010416846,0.00038337757,0.00065080525,0.22545356],"genre_scores_gemma":[0.95352757,0.00076919975,0.028589072,0.0002496428,0.00045315272,0.000055806682,0.00016024167,0.00006654498,0.016128607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990926,0.00020419284,0.000076611395,0.00016369173,0.00028509085,0.00017784133],"domain_scores_gemma":[0.99876726,0.00046779003,0.00014023193,0.00018686634,0.00018642918,0.00025135546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096040824,0.0004035006,0.00031435373,0.0016561821,0.0014652481,0.0036797374,0.0005377962,0.0006844505,0.0070245364],"category_scores_gemma":[0.0015649355,0.00023914676,0.0007187757,0.00073704286,0.005446278,0.005870891,0.0025029702,0.001612272,0.0006651294],"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.0000062173917,0.000005987218,0.00017312757,0.000013035761,0.0000018401356,0.000067175824,0.00026844972,0.00029920723,0.0005987596,0.99654144,0.000141363,0.0018834644],"study_design_scores_gemma":[0.000006536474,0.000025594332,0.0004601472,0.000017801985,0.000009600255,0.00028617898,0.0003036524,0.004209166,0.0015207175,0.9810807,0.012069131,0.000010732341],"about_ca_topic_score_codex":0.00089128345,"about_ca_topic_score_gemma":0.000444012,"teacher_disagreement_score":0.0070245364,"about_ca_system_score_codex":0.0010641047,"about_ca_system_score_gemma":0.0005015059,"threshold_uncertainty_score":0.02349937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51676536,0.0017847668,0.38809904,0.00574831,0.0002580283,0.00006476176,0.00027694646,0.0004588469,0.086543985],"genre_scores_gemma":[0.97887224,0.00019506407,0.016848065,0.0004035859,0.00010397446,0.000037851984,0.000058296355,0.000030095116,0.0034507366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983,0.0006362022,0.00010206667,0.00038177738,0.0003971966,0.00018264371],"domain_scores_gemma":[0.99448276,0.003554318,0.00057145784,0.0006617585,0.0004726897,0.00025705647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004028586,0.00031144344,0.0005950596,0.0011536403,0.0013903725,0.0017301867,0.0010466808,0.0007696904,0.0036931795],"category_scores_gemma":[0.00673017,0.00034465353,0.0007179285,0.00054519007,0.006272642,0.007298427,0.0026862307,0.0022103083,0.00025069105],"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.000023228013,0.00000976137,0.00031688597,0.000020396817,0.000007247659,0.00006636725,0.00011806648,0.0009360966,0.00076319533,0.9955973,0.00024934535,0.0018921234],"study_design_scores_gemma":[0.000014380363,0.000030952022,0.00052231573,0.000015837191,0.000013064395,0.000101069854,0.000105936655,0.006053239,0.0012301819,0.9893935,0.0025004582,0.00001917697],"about_ca_topic_score_codex":0.0007859992,"about_ca_topic_score_gemma":0.0009301849,"teacher_disagreement_score":0.004028586,"about_ca_system_score_codex":0.0013458098,"about_ca_system_score_gemma":0.0005785619,"threshold_uncertainty_score":0.021305442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09178647,0.0017481712,0.5875998,0.015111857,0.0011733857,0.00039679345,0.000669908,0.00059850747,0.300915],"genre_scores_gemma":[0.78452116,0.0013918757,0.122616716,0.005100185,0.00051918346,0.00032225923,0.00047271696,0.00015021022,0.08490574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979777,0.0007434542,0.00010478062,0.00045292173,0.00041036928,0.00031084727],"domain_scores_gemma":[0.9970757,0.001493325,0.00019161667,0.0004888828,0.00042215633,0.00032828443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014662525,0.0007366335,0.00069166673,0.0004560185,0.0015581666,0.0032509658,0.0013771928,0.0028756245,0.009355978],"category_scores_gemma":[0.0060928883,0.0003802389,0.00076843245,0.0005169087,0.0039067194,0.0072979433,0.0023652697,0.0036336193,0.0011521067],"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.00008826639,0.000037028858,0.00036329505,0.00006409702,0.000026317182,0.00011267383,0.0003702319,0.0023861718,0.0014963794,0.97257084,0.005888895,0.01659591],"study_design_scores_gemma":[0.00007629069,0.00012163613,0.0004791978,0.000066843146,0.0000472014,0.000349498,0.00034505042,0.040118717,0.0025705458,0.89192533,0.063839585,0.00006011969],"about_ca_topic_score_codex":0.002967622,"about_ca_topic_score_gemma":0.0026108602,"teacher_disagreement_score":0.009355978,"about_ca_system_score_codex":0.0016838666,"about_ca_system_score_gemma":0.0011825952,"threshold_uncertainty_score":0.031298935},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03537794,0.0044308687,0.95481515,0.0007767126,0.0002710139,0.00010556649,0.00038419678,0.0006119639,0.0032265552],"genre_scores_gemma":[0.5598829,0.002312975,0.43253535,0.00023095595,0.0006029864,0.00026008664,0.00092361675,0.000087277935,0.0031638145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966888,0.0008499724,0.000352272,0.00065530173,0.0013313423,0.00012233948],"domain_scores_gemma":[0.9950422,0.002711821,0.0002129494,0.00043217442,0.001405816,0.00019504805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024641682,0.00044226824,0.0011753724,0.0039559165,0.00090643746,0.0023031246,0.0014235772,0.0013168731,0.001770593],"category_scores_gemma":[0.010442002,0.00024405916,0.00081057154,0.0034075105,0.0008604312,0.0054152096,0.0014106325,0.0011330934,0.00035263086],"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.0007743758,0.0004734341,0.01044122,0.0007368404,0.0003010186,0.00032611503,0.00060443237,0.05072978,0.015878508,0.25635985,0.012058671,0.6513158],"study_design_scores_gemma":[0.000045236124,0.00025960465,0.0042044283,0.00004162858,0.00012610585,0.0004853917,0.00015065857,0.8665485,0.009996169,0.106198385,0.011855279,0.0000885161],"about_ca_topic_score_codex":0.0018836644,"about_ca_topic_score_gemma":0.0009460891,"teacher_disagreement_score":0.0039559165,"about_ca_system_score_codex":0.0015075082,"about_ca_system_score_gemma":0.0011445954,"threshold_uncertainty_score":0.0130319595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3840631,0.0020510335,0.24718276,0.0051484015,0.0003895988,0.00020628239,0.0021840844,0.001065865,0.3577089],"genre_scores_gemma":[0.90898556,0.0008730359,0.040990144,0.00074406044,0.00044242377,0.0002677707,0.0015715673,0.00030810933,0.045817327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988433,0.00022949994,0.000090748596,0.00028870528,0.0003230239,0.0002246332],"domain_scores_gemma":[0.99726176,0.0015365458,0.00021445761,0.00040666273,0.00038130704,0.00019931626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011824617,0.0007157128,0.0010650271,0.002743679,0.0033808132,0.0039465106,0.0011270441,0.0010405445,0.01351552],"category_scores_gemma":[0.003921296,0.0009928023,0.0016449544,0.0026303364,0.0039566117,0.007029334,0.003013717,0.0048910743,0.0016642847],"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.000024529669,0.000012761932,0.000112163136,0.000026912914,0.000009629547,0.000041037798,0.0001945056,0.00024312551,0.00031305075,0.9953181,0.0008584953,0.0028456731],"study_design_scores_gemma":[0.000012060261,0.000007307457,0.00014049411,0.000008370509,0.000011677574,0.00006022711,0.0000623829,0.00061988406,0.0002827396,0.9965301,0.0022579136,0.000006873794],"about_ca_topic_score_codex":0.00079393486,"about_ca_topic_score_gemma":0.00087787554,"teacher_disagreement_score":0.01351552,"about_ca_system_score_codex":0.0012613703,"about_ca_system_score_gemma":0.00063148385,"threshold_uncertainty_score":0.045213938},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066168316,0.0120444475,0.5402155,0.006668327,0.0062909913,0.00015373844,0.000905898,0.0021264204,0.36542633],"genre_scores_gemma":[0.7122136,0.005631008,0.13960959,0.0023516924,0.0040676016,0.0003739255,0.0011793006,0.002101111,0.13247219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955252,0.0012376205,0.00042461415,0.0009332977,0.0014875275,0.00039173395],"domain_scores_gemma":[0.9952591,0.0026590375,0.00029466028,0.00065371185,0.00077036733,0.00036310573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035007328,0.001463432,0.001502679,0.0032132952,0.0023700104,0.007519682,0.0011598847,0.00079947966,0.015581072],"category_scores_gemma":[0.01653179,0.0009330151,0.0021039206,0.0029189778,0.0054330695,0.011268825,0.0052478644,0.004028374,0.0056859422],"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.000050653925,0.000007655881,0.00014573014,0.00009137511,0.000017318405,0.000058358888,0.00025756075,0.000370946,0.00038462286,0.9785942,0.0044752015,0.015546342],"study_design_scores_gemma":[0.000012954948,0.000017487688,0.00014910194,0.000029820812,0.000020088259,0.00011543426,0.00005087783,0.0013592482,0.00069778087,0.9736602,0.02386559,0.000021424483],"about_ca_topic_score_codex":0.00095989136,"about_ca_topic_score_gemma":0.0011178071,"teacher_disagreement_score":0.015581072,"about_ca_system_score_codex":0.0022637642,"about_ca_system_score_gemma":0.0010744301,"threshold_uncertainty_score":0.052123904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030786695,0.0009617466,0.95291877,0.0034962932,0.00008488116,0.00006706033,0.00031163578,0.00038485514,0.010988018],"genre_scores_gemma":[0.80737644,0.0014559763,0.18430668,0.0009384222,0.00050353294,0.0004133646,0.00065570563,0.00040130905,0.003948506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864444,0.006351691,0.00063122396,0.002928984,0.002765951,0.00087772775],"domain_scores_gemma":[0.8625879,0.12141084,0.0029809384,0.009423663,0.0025728487,0.0010238341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013748391,0.0012349884,0.0016617791,0.003041105,0.0022169119,0.0062078782,0.003305896,0.002312545,0.0039006728],"category_scores_gemma":[0.097687274,0.0012669434,0.0028474256,0.002521435,0.018693646,0.018456588,0.007349228,0.00999931,0.0006188614],"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.000024121093,0.000011191703,0.00036010912,0.000045052526,0.000014710431,0.000055249544,0.00018015134,0.011956064,0.000159435,0.98355377,0.00026364948,0.0033766655],"study_design_scores_gemma":[0.0000073297615,0.0000058755927,0.000109276116,0.000018965162,0.0000061557657,0.000027690527,0.000015381529,0.036999993,0.00021308217,0.9620566,0.000530026,0.000009786236],"about_ca_topic_score_codex":0.003642422,"about_ca_topic_score_gemma":0.001657983,"teacher_disagreement_score":0.013748391,"about_ca_system_score_codex":0.0046518017,"about_ca_system_score_gemma":0.0022793154,"threshold_uncertainty_score":0.07270932},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007903536,0.010881067,0.13927959,0.0067199413,0.0008306491,0.00005548868,0.0006095881,0.00073704193,0.8329831],"genre_scores_gemma":[0.2906657,0.019208148,0.1170549,0.0028143227,0.0029028326,0.0003910851,0.0034867972,0.0013965584,0.5620796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933296,0.000120536446,0.000029621015,0.00013007753,0.00033058104,0.00005619698],"domain_scores_gemma":[0.9991578,0.00044298678,0.000026871761,0.00020284245,0.0001257677,0.00004371766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005667806,0.0007136804,0.0007516694,0.0015828831,0.0014266288,0.0045624566,0.0009731172,0.0009564939,0.034117833],"category_scores_gemma":[0.0029673707,0.00045034842,0.0006718026,0.003453714,0.002669529,0.008960665,0.0021427323,0.004152762,0.007573068],"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.000007278929,0.000010732413,0.000068590336,0.000058119,0.0000056379636,0.000012302003,0.000095873314,0.0005922877,0.00013965205,0.942106,0.022407364,0.03449605],"study_design_scores_gemma":[0.000002806681,0.000002762688,0.00007931957,0.000027115599,0.0000040228624,0.00003835768,0.000028475773,0.0011810412,0.00017566142,0.91216564,0.0862906,0.0000042969687],"about_ca_topic_score_codex":0.0011752817,"about_ca_topic_score_gemma":0.0015778156,"teacher_disagreement_score":0.034117833,"about_ca_system_score_codex":0.0028408114,"about_ca_system_score_gemma":0.0013105932,"threshold_uncertainty_score":0.11413556},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060449545,0.00056770135,0.9739683,0.0010663131,0.00033676185,0.00006204187,0.00008459674,0.0004570553,0.017412234],"genre_scores_gemma":[0.35852164,0.0015965336,0.6077712,0.0015378385,0.0010024183,0.00043750717,0.00017419337,0.0004848738,0.02847381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984238,0.00036954661,0.00009951098,0.00023355875,0.00069037074,0.00018330295],"domain_scores_gemma":[0.9989506,0.00044824366,0.00008736206,0.00018341176,0.00023618595,0.00009415152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002103487,0.0005831756,0.0006239619,0.00087542477,0.0019172509,0.0028963387,0.0017381046,0.0011607584,0.005303434],"category_scores_gemma":[0.0026937593,0.0005140026,0.0014815313,0.000981913,0.0048246663,0.0055043437,0.0022649267,0.0031899302,0.0012951572],"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.000005041868,0.0000058951814,0.000018775916,0.000016578128,0.0000025263623,0.000028265018,0.000095621785,0.001245038,0.0004426504,0.9954053,0.00033262672,0.002401743],"study_design_scores_gemma":[0.000015207763,0.00001826854,0.00003343187,0.000020746225,0.000012518552,0.000056853685,0.000033065357,0.016458098,0.0009283058,0.9566192,0.025782613,0.000021657757],"about_ca_topic_score_codex":0.0022546817,"about_ca_topic_score_gemma":0.0013938136,"teacher_disagreement_score":0.005303434,"about_ca_system_score_codex":0.0014858604,"about_ca_system_score_gemma":0.002227443,"threshold_uncertainty_score":0.0177418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054863665,0.10190996,0.38643625,0.10170509,0.003965883,0.00011980434,0.0007776129,0.00020949874,0.35001236],"genre_scores_gemma":[0.86846524,0.041328654,0.059551764,0.00800156,0.0049290545,0.00030105558,0.0002694327,0.000115818366,0.017037477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988231,0.00041669767,0.000054594188,0.00022518162,0.00034550624,0.00013482547],"domain_scores_gemma":[0.9938585,0.0047756545,0.00039053435,0.00038934514,0.00035962413,0.00022637493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015259534,0.0006758113,0.00080632296,0.0024293743,0.0013809314,0.0043777805,0.0012537637,0.0025878057,0.008349088],"category_scores_gemma":[0.0062008956,0.00027580743,0.00068338355,0.0025197016,0.009073819,0.012222204,0.002555142,0.0037859627,0.00066323957],"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.0000042314878,0.000005634378,0.000104907216,0.000052810206,0.0000049822556,0.000025019252,0.00005001682,0.00038744885,0.000091974835,0.9951788,0.0010776821,0.0030165196],"study_design_scores_gemma":[0.0000017627201,0.0000071292193,0.00013615428,0.000032611617,0.000002984753,0.000053312575,0.000054920667,0.000978678,0.0000749239,0.99115974,0.0074922037,0.000005642404],"about_ca_topic_score_codex":0.0009834152,"about_ca_topic_score_gemma":0.0007643077,"teacher_disagreement_score":0.008349088,"about_ca_system_score_codex":0.002178502,"about_ca_system_score_gemma":0.0006814964,"threshold_uncertainty_score":0.027930498},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0653935,0.015817806,0.39735442,0.024183724,0.0007066658,0.00007525084,0.0011096991,0.00069780846,0.49466112],"genre_scores_gemma":[0.85622424,0.009494033,0.05358926,0.0018338626,0.0016898937,0.00026595063,0.0013086817,0.0004981527,0.07509591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981134,0.00064532546,0.00009805981,0.00027624518,0.00064524973,0.00022177945],"domain_scores_gemma":[0.99398017,0.004337222,0.0002652798,0.00089877343,0.00039082736,0.00012782542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016452256,0.00075122225,0.00086578424,0.002349991,0.0018560711,0.0047586155,0.0015373813,0.0020518007,0.017439803],"category_scores_gemma":[0.011153129,0.0006796573,0.00096333394,0.004845798,0.005185084,0.015216577,0.002472576,0.005470175,0.0022037232],"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.0000073117794,0.0000055391,0.000053801123,0.0000220792,0.0000023579887,0.000009116778,0.000060432623,0.00096470455,0.000051430496,0.99016035,0.0020717576,0.006591135],"study_design_scores_gemma":[0.0000011335254,0.0000012008675,0.000029627077,0.000008542425,0.0000018617624,0.00001292657,0.000013556906,0.0011313794,0.00006186932,0.99645007,0.0022853513,0.0000024496924],"about_ca_topic_score_codex":0.0015171133,"about_ca_topic_score_gemma":0.0012017671,"teacher_disagreement_score":0.017439803,"about_ca_system_score_codex":0.0045424425,"about_ca_system_score_gemma":0.001264366,"threshold_uncertainty_score":0.05834198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032997,0.005268664,0.61072344,0.04251373,0.000775263,0.00017328307,0.0006071061,0.0005576602,0.30638382],"genre_scores_gemma":[0.87892824,0.004250012,0.08420013,0.006130631,0.0014671843,0.00043462176,0.0005335396,0.00025751395,0.023798188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731964,0.0007376892,0.00014658905,0.000795292,0.00071508123,0.00028567645],"domain_scores_gemma":[0.9916113,0.0056655565,0.00045331882,0.0011878465,0.00078501605,0.0002969894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037208158,0.0006519305,0.0007812872,0.0013540618,0.0019008268,0.0056039663,0.0014877213,0.0021511468,0.010241166],"category_scores_gemma":[0.01490714,0.0003501639,0.001936586,0.0009638425,0.012841798,0.011841873,0.0033357337,0.004765621,0.0016316451],"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.0000048249426,0.0000044080502,0.00007980772,0.000030844178,0.000006368281,0.00002478291,0.00012741932,0.00055917207,0.0000693439,0.99458545,0.0013080679,0.0031994975],"study_design_scores_gemma":[0.0000049636305,0.0000051084967,0.00008257924,0.000014410833,0.0000042137003,0.000039274597,0.000033444256,0.0014391482,0.00009839708,0.99052775,0.007745866,0.0000048279867],"about_ca_topic_score_codex":0.002629736,"about_ca_topic_score_gemma":0.0012395321,"teacher_disagreement_score":0.010241166,"about_ca_system_score_codex":0.003838979,"about_ca_system_score_gemma":0.0028166722,"threshold_uncertainty_score":0.034260154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021730551,0.049908735,0.74052316,0.03624567,0.0015753794,0.000080561134,0.00012587414,0.00042784004,0.14938222],"genre_scores_gemma":[0.8383492,0.018260572,0.11910203,0.003969242,0.002627778,0.00024516592,0.00020699612,0.00022291637,0.017016102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535525,0.0029287226,0.00028365466,0.00044862521,0.00072578964,0.00025792542],"domain_scores_gemma":[0.9960514,0.0025922374,0.00021062246,0.0007049692,0.00033452982,0.000106337146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050389646,0.000579086,0.0008483572,0.0016057548,0.0016123272,0.0044096317,0.0011699047,0.0015027885,0.00300894],"category_scores_gemma":[0.007690813,0.00036347675,0.0014133467,0.0015956402,0.014253539,0.011073565,0.004231304,0.0040998417,0.00057104294],"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.0000043064415,0.00000193463,0.00004066413,0.000034228196,0.0000050640174,0.000015145047,0.00027309865,0.00063849194,0.00003652204,0.99429387,0.00068225386,0.003974426],"study_design_scores_gemma":[0.0000030420963,0.00000424559,0.000026039183,0.000021452099,0.0000034259128,0.000020049669,0.00006550521,0.0012134224,0.00005491009,0.9884412,0.010143348,0.0000033943054],"about_ca_topic_score_codex":0.0017285435,"about_ca_topic_score_gemma":0.0009852978,"teacher_disagreement_score":0.0050389646,"about_ca_system_score_codex":0.003171591,"about_ca_system_score_gemma":0.0011767319,"threshold_uncertainty_score":0.026648879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097569786,0.00056704343,0.8789157,0.0012314324,0.00003709207,0.000107598804,0.0004253976,0.00025447184,0.020891525],"genre_scores_gemma":[0.80352026,0.00040420642,0.19067357,0.0002419786,0.000137773,0.0002859505,0.0005816058,0.00007008841,0.004084507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632496,0.0011701415,0.00022128897,0.00068356143,0.0012883708,0.00031159286],"domain_scores_gemma":[0.97830576,0.015898613,0.0016626802,0.0023100753,0.0012722869,0.0005506248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003633058,0.00048129336,0.00068325945,0.0061722463,0.0012294961,0.003378823,0.0017201689,0.0011791335,0.0072552077],"category_scores_gemma":[0.028320674,0.00043864187,0.0014399489,0.003498887,0.0039705494,0.008511789,0.0037541955,0.0020706297,0.00056108204],"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.000037858998,0.00005251221,0.0037076795,0.000106866944,0.00005007521,0.00007279427,0.0006909799,0.01782112,0.0006385058,0.92282486,0.00056535203,0.053431407],"study_design_scores_gemma":[0.000006767238,0.000020897067,0.0016597328,0.000025607189,0.000012930248,0.000028365532,0.0000850856,0.06223182,0.00037770713,0.9340693,0.0014711636,0.000010556762],"about_ca_topic_score_codex":0.0028946344,"about_ca_topic_score_gemma":0.0018213954,"teacher_disagreement_score":0.0072552077,"about_ca_system_score_codex":0.0023498456,"about_ca_system_score_gemma":0.0010966319,"threshold_uncertainty_score":0.024271071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5548233,0.0012592421,0.32735392,0.0077133807,0.0003946566,0.000082187005,0.00043723706,0.0008136472,0.107122436],"genre_scores_gemma":[0.9875485,0.000169725,0.008617736,0.00046911673,0.00015213137,0.000042597403,0.000071914415,0.000055670665,0.0028727294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99497545,0.001396169,0.00028602796,0.0013844956,0.0013707925,0.0005871656],"domain_scores_gemma":[0.97647494,0.014746151,0.0014390001,0.003910124,0.0020170365,0.001412699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005329707,0.00040240295,0.0012499898,0.0012328335,0.0022249678,0.0034797583,0.0017742536,0.0013368559,0.008621606],"category_scores_gemma":[0.02063236,0.0008108589,0.0008819742,0.00057572016,0.006356212,0.011155939,0.006380169,0.0032286686,0.00071523077],"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.00012926885,0.000027729613,0.0014271927,0.00010388996,0.000035616973,0.00010253742,0.00024615423,0.0022301832,0.002725052,0.985935,0.001289119,0.005748272],"study_design_scores_gemma":[0.000031710144,0.00007047216,0.0007857825,0.000030370751,0.00003428609,0.00027220574,0.00016099165,0.016356496,0.0034085053,0.97501504,0.0037975681,0.000036629088],"about_ca_topic_score_codex":0.00091025943,"about_ca_topic_score_gemma":0.00073208776,"teacher_disagreement_score":0.008621606,"about_ca_system_score_codex":0.0014362166,"about_ca_system_score_gemma":0.0008618375,"threshold_uncertainty_score":0.028842151},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08650916,0.0025066987,0.8602833,0.015494714,0.00024323174,0.00012099884,0.00029861927,0.00050783285,0.034035407],"genre_scores_gemma":[0.7471886,0.0021993734,0.23757683,0.0010746194,0.00026959123,0.0006834068,0.0003018291,0.0003749903,0.010330793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938777,0.0027802254,0.00028589938,0.001203326,0.0015216902,0.00033123564],"domain_scores_gemma":[0.9712781,0.019624962,0.0013533931,0.0054572937,0.0017062437,0.0005800321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008642221,0.0009882518,0.0020408574,0.0015431216,0.0019079027,0.008852253,0.0038856075,0.0041895844,0.00721423],"category_scores_gemma":[0.034746744,0.0015369882,0.0025556085,0.0014595239,0.011530139,0.016321912,0.005040007,0.0063938983,0.0012155605],"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.00004166071,0.00003020819,0.0010771833,0.00014029029,0.00005208945,0.00010517542,0.00083045,0.04179341,0.00073479937,0.94844276,0.0005895819,0.0061624795],"study_design_scores_gemma":[0.000024346295,0.000020315956,0.0002599783,0.000058766553,0.000014819862,0.000057803176,0.00013563754,0.1591514,0.00047221582,0.8360773,0.0036930707,0.00003434521],"about_ca_topic_score_codex":0.005829298,"about_ca_topic_score_gemma":0.0031867432,"teacher_disagreement_score":0.008852253,"about_ca_system_score_codex":0.004395576,"about_ca_system_score_gemma":0.0032186927,"threshold_uncertainty_score":0.04570502},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029225886,0.009487637,0.0013354478,0.04047224,0.91769814,0.000094006726,0.0008029201,0.00027906528,0.02953824],"genre_scores_gemma":[0.0032175032,0.011892756,0.00080693164,0.013952863,0.7985647,0.00013393158,0.0020877167,0.0005746825,0.1687689],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982084,0.00019048167,0.00018871548,0.00031230337,0.0009319585,0.00016813105],"domain_scores_gemma":[0.9851767,0.0041894643,0.0006825986,0.00068205496,0.006945498,0.0023237474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028025378,0.0016903525,0.0020102982,0.005463877,0.0025039823,0.008241428,0.0017574766,0.0034526621,0.12151671],"category_scores_gemma":[0.011813939,0.00056098687,0.001338242,0.003341085,0.0009630105,0.005046132,0.0019837797,0.0057064374,0.06034995],"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.00001844266,0.00001575916,0.00004590975,0.000110627785,0.0000033157664,0.000019602307,0.000015028435,0.000029525414,0.00008109526,0.00066902506,0.9894225,0.009569291],"study_design_scores_gemma":[0.000019233808,0.000040098053,0.00070368743,0.00025532237,0.000011428892,0.00007737472,0.00004325358,0.00019408365,0.00012041819,0.0017897645,0.99673235,0.000012942138],"about_ca_topic_score_codex":0.0021699488,"about_ca_topic_score_gemma":0.0031215677,"teacher_disagreement_score":0.12151671,"about_ca_system_score_codex":0.0033447647,"about_ca_system_score_gemma":0.0025275177,"threshold_uncertainty_score":0.40651387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7841934,0.0015480771,0.15712492,0.0014710553,0.000051868108,0.00015155211,0.0011432568,0.00047215846,0.05384367],"genre_scores_gemma":[0.9769498,0.00027876234,0.01983989,0.00013038366,0.00006346785,0.00008393688,0.00046960937,0.00004539054,0.002138657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970415,0.0005599686,0.00019505229,0.0005735164,0.0010903043,0.0005396903],"domain_scores_gemma":[0.97293603,0.021272428,0.0013769639,0.0017069109,0.0016084881,0.0010991566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003111331,0.0003547311,0.00096308615,0.002759699,0.0016887505,0.0039345515,0.0010913912,0.0013199892,0.004754216],"category_scores_gemma":[0.021808986,0.0006981878,0.0010608279,0.0013629769,0.00439534,0.006742527,0.00295151,0.0024905268,0.00026737648],"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.00008235635,0.000039976643,0.0014742013,0.00009155572,0.00001742022,0.00013110612,0.00059013255,0.0036261098,0.0011905134,0.9837843,0.00060884334,0.008363465],"study_design_scores_gemma":[0.000034748606,0.00005875048,0.0014013769,0.000056941833,0.000022318995,0.00036578477,0.00034422733,0.016577667,0.0034626657,0.9743148,0.0033221387,0.000038602953],"about_ca_topic_score_codex":0.0008366729,"about_ca_topic_score_gemma":0.00075074774,"teacher_disagreement_score":0.004754216,"about_ca_system_score_codex":0.0017048045,"about_ca_system_score_gemma":0.0006380876,"threshold_uncertainty_score":0.016454518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10880376,0.0038797532,0.69541615,0.05458115,0.0016637938,0.00081568945,0.0037558195,0.008812342,0.122271605],"genre_scores_gemma":[0.5797671,0.0038744577,0.37605995,0.005109946,0.0023271446,0.00094105786,0.008110496,0.0032529738,0.020556884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96598047,0.012032503,0.0018093047,0.0048217904,0.012899534,0.0024564853],"domain_scores_gemma":[0.8653711,0.1021847,0.002303163,0.01995178,0.008410115,0.0017790761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014054494,0.0018118566,0.0037442143,0.0025185691,0.005248958,0.0121773835,0.008258336,0.0036738021,0.032056395],"category_scores_gemma":[0.08619881,0.0024546129,0.006483854,0.0038295174,0.00858454,0.034275603,0.012066908,0.012760052,0.0065376456],"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.0006383241,0.00037768795,0.003210308,0.0020386786,0.00047563514,0.0008976057,0.0012800235,0.037307557,0.003931373,0.7774839,0.04378587,0.12857302],"study_design_scores_gemma":[0.000104767416,0.00004045049,0.0004388965,0.00011243655,0.00009026676,0.00014448335,0.00034177318,0.054146,0.0022700194,0.9303007,0.011949568,0.000060581606],"about_ca_topic_score_codex":0.0056490987,"about_ca_topic_score_gemma":0.0048396117,"teacher_disagreement_score":0.032056395,"about_ca_system_score_codex":0.007592726,"about_ca_system_score_gemma":0.006842475,"threshold_uncertainty_score":0.107239306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033470277,0.070494026,0.17408204,0.032776356,0.0017943741,0.000107317435,0.0007995259,0.0007530065,0.685723],"genre_scores_gemma":[0.76218176,0.034786448,0.025893832,0.005793596,0.0016697033,0.00031158546,0.0007782148,0.00028392076,0.16830099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996865,0.00007740382,0.000014923512,0.00008352325,0.00008757336,0.000050128743],"domain_scores_gemma":[0.99938893,0.0003438301,0.000042815023,0.00009648184,0.000064176376,0.000063704225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006472699,0.0002312962,0.00043175745,0.0006917676,0.0010096186,0.002329034,0.0007072624,0.0012388616,0.012834323],"category_scores_gemma":[0.0020143364,0.00017034523,0.0003466835,0.000684039,0.0032586309,0.0035532487,0.0018010418,0.0024331792,0.0014679576],"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.000004713235,0.0000024997498,0.000059945953,0.0000317418,0.0000023759285,0.00006400362,0.00011465139,0.0006378984,0.00031873467,0.9825387,0.0039638677,0.012260913],"study_design_scores_gemma":[0.0000043670225,0.000007250482,0.00010918483,0.00003979157,0.000003597446,0.00025554764,0.000058020923,0.0009899023,0.00050783175,0.91704065,0.08097701,0.0000068426443],"about_ca_topic_score_codex":0.0014991052,"about_ca_topic_score_gemma":0.0020917999,"teacher_disagreement_score":0.012834323,"about_ca_system_score_codex":0.0023655712,"about_ca_system_score_gemma":0.0009422846,"threshold_uncertainty_score":0.042935073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032216296,0.0015509645,0.92401713,0.0015688017,0.00018318564,0.00007462734,0.00011861059,0.00035966127,0.039910793],"genre_scores_gemma":[0.62836456,0.0022795259,0.3447207,0.0005459187,0.00058357575,0.0002748593,0.00030853497,0.00020705369,0.02271524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987715,0.00033904135,0.00009285604,0.0002588272,0.00043828707,0.00009949277],"domain_scores_gemma":[0.9979291,0.0011777751,0.0001993481,0.00030092886,0.00027935367,0.00011349362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001356285,0.00035515512,0.00044048406,0.0012784902,0.00074751634,0.0024438808,0.0007188,0.00086015655,0.005870969],"category_scores_gemma":[0.006260467,0.00025453008,0.0006757707,0.0011404939,0.002627352,0.0053880345,0.0018766479,0.0018969616,0.0010430407],"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.000006451531,0.0000039833512,0.000102128004,0.000019979878,0.00000410906,0.00001305061,0.00007749427,0.0065799817,0.00025046038,0.97951126,0.00050167297,0.012929362],"study_design_scores_gemma":[0.000007194234,0.000008253486,0.00007712596,0.000010531775,0.0000024909032,0.000039150633,0.000021082451,0.06313412,0.0003468979,0.9298308,0.006515701,0.0000068182535],"about_ca_topic_score_codex":0.0007342754,"about_ca_topic_score_gemma":0.00058029266,"teacher_disagreement_score":0.005870969,"about_ca_system_score_codex":0.0016165999,"about_ca_system_score_gemma":0.000626495,"threshold_uncertainty_score":0.019640326},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016251808,0.11228562,0.24964488,0.06622866,0.0025921853,0.0001111191,0.00023883313,0.0006297542,0.55201715],"genre_scores_gemma":[0.6631122,0.09095431,0.11994756,0.01803022,0.004592391,0.00041473607,0.00030539234,0.0003525342,0.10229059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991653,0.00035378948,0.0000311486,0.0001268604,0.0002637913,0.00005908616],"domain_scores_gemma":[0.99951935,0.000236575,0.000029855371,0.0000762932,0.000090072914,0.000047858673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008172414,0.00041625835,0.00041099096,0.000777768,0.0010171297,0.002129515,0.00073644787,0.0013560149,0.003757248],"category_scores_gemma":[0.0013290036,0.00027993327,0.00031611908,0.0006619513,0.010683427,0.0034637724,0.0013983573,0.0029982706,0.0013969344],"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.0000059765885,0.000009102604,0.00007426931,0.00007663023,0.000004986992,0.000037240072,0.00059959886,0.0007018013,0.00015452903,0.98323613,0.004722245,0.010377384],"study_design_scores_gemma":[0.000005539199,0.000022147184,0.00014499918,0.00009971333,0.000004274226,0.00008407337,0.0002072097,0.0013509323,0.00014930122,0.8135728,0.18434983,0.000009195124],"about_ca_topic_score_codex":0.0017992108,"about_ca_topic_score_gemma":0.0008317687,"teacher_disagreement_score":0.003757248,"about_ca_system_score_codex":0.0021450499,"about_ca_system_score_gemma":0.0013631515,"threshold_uncertainty_score":0.015563488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055423647,0.00086898636,0.93590987,0.0011953025,0.000108329434,0.00010412626,0.0006853014,0.0030632925,0.0026412308],"genre_scores_gemma":[0.66190445,0.0002844675,0.33459973,0.00043918446,0.00009479804,0.00021113135,0.0011099584,0.00033627215,0.0010200317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856335,0.0005507224,0.00013052714,0.000359823,0.00028819553,0.00010734107],"domain_scores_gemma":[0.98871094,0.009121399,0.00036378187,0.001159865,0.00043947875,0.00020453472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035127047,0.00095363444,0.0019055043,0.0022652475,0.0008382565,0.001892152,0.0019993228,0.0016056502,0.004887022],"category_scores_gemma":[0.021537106,0.00089883094,0.0011672737,0.0013788424,0.00092878705,0.004862302,0.0025282993,0.0030004377,0.0005771792],"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.00031248777,0.00017218088,0.00329257,0.00025218216,0.00014150873,0.000110067616,0.00010504749,0.74961466,0.0010898785,0.02467889,0.004736176,0.2154943],"study_design_scores_gemma":[0.000017323013,0.000012346959,0.000051324478,0.000012868423,0.000010949468,0.000007864695,0.00000937697,0.9711166,0.00039674086,0.028057475,0.00030398383,0.0000030516221],"about_ca_topic_score_codex":0.005017525,"about_ca_topic_score_gemma":0.006634281,"teacher_disagreement_score":0.005017525,"about_ca_system_score_codex":0.0024530105,"about_ca_system_score_gemma":0.0020701657,"threshold_uncertainty_score":0.018577218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115582086,0.021230277,0.66203886,0.016517986,0.0005707917,0.00006809721,0.0005689765,0.0002457057,0.18317729],"genre_scores_gemma":[0.95405805,0.0029427607,0.033728316,0.0006261774,0.00079304114,0.000100275465,0.00015886179,0.00006925882,0.007523167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812883,0.00054148183,0.00012152594,0.00035064403,0.0006645702,0.0001930803],"domain_scores_gemma":[0.9939173,0.0044438834,0.00040532212,0.0006486997,0.00043074344,0.00015410276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019467089,0.00041101995,0.00048636412,0.0018300576,0.00097612845,0.0028818606,0.0007235635,0.0012083316,0.0034371319],"category_scores_gemma":[0.011495138,0.00028924577,0.00059711223,0.0010984741,0.006923839,0.0072271978,0.002688296,0.0017589745,0.00040965085],"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.0000045911743,0.0000018728775,0.00009628692,0.000013432095,0.0000025177699,0.0000059336467,0.000025520627,0.0024765264,0.000110407505,0.9947207,0.00021687463,0.0023253756],"study_design_scores_gemma":[0.0000020945654,0.0000055205137,0.00018732678,0.000011900623,0.0000013686401,0.000014838983,0.000011704618,0.006164287,0.00021277937,0.9911142,0.0022673707,0.0000066303933],"about_ca_topic_score_codex":0.00090945273,"about_ca_topic_score_gemma":0.00054885447,"teacher_disagreement_score":0.0034371319,"about_ca_system_score_codex":0.0032968083,"about_ca_system_score_gemma":0.0007870638,"threshold_uncertainty_score":0.023920119},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20734468,0.0036237806,0.63496524,0.041086845,0.0009603303,0.0010492138,0.00464729,0.008185746,0.09813687],"genre_scores_gemma":[0.6780974,0.0028928178,0.28931478,0.0028976635,0.0012395984,0.0007997886,0.0060477424,0.0023753566,0.01633472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9755047,0.008309005,0.0013973064,0.0032243207,0.009287075,0.0022775817],"domain_scores_gemma":[0.82655334,0.14327598,0.0031161723,0.019018658,0.0063390746,0.0016967091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009366804,0.0013869188,0.0029434913,0.0020121157,0.0040618344,0.0087712575,0.0068002464,0.0027750507,0.030597676],"category_scores_gemma":[0.0703525,0.0021642582,0.005157184,0.0031194314,0.0064499355,0.029258218,0.008470449,0.009328891,0.0047703707],"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.0021096645,0.0006336494,0.0057854247,0.0036455712,0.0007883473,0.0014194826,0.002115147,0.073765576,0.013146524,0.6236303,0.044667326,0.22829305],"study_design_scores_gemma":[0.0002535169,0.00008428739,0.0010879161,0.00015544439,0.00020423604,0.000328125,0.0005462703,0.109179355,0.0065285917,0.87086636,0.010678964,0.00008690625],"about_ca_topic_score_codex":0.004276708,"about_ca_topic_score_gemma":0.004709749,"teacher_disagreement_score":0.030597676,"about_ca_system_score_codex":0.006292156,"about_ca_system_score_gemma":0.0064114593,"threshold_uncertainty_score":0.10235947},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059785455,0.021417351,0.025125528,0.03656136,0.00044213788,0.000053411564,0.00008806346,0.00009633134,0.8564303],"genre_scores_gemma":[0.96686023,0.004209703,0.0034048164,0.0016720985,0.00014448343,0.000044866105,0.000030138257,0.000055642107,0.023578016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986064,0.00092424575,0.00003649141,0.00012637333,0.00016682473,0.00013963622],"domain_scores_gemma":[0.99848855,0.0010273411,0.000094656214,0.00019100562,0.00009901437,0.00009946392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039907,0.00037691768,0.0002624189,0.0016052136,0.005033906,0.0056315577,0.0007203714,0.0029804688,0.0051861787],"category_scores_gemma":[0.0037500993,0.0002932649,0.0004487303,0.0012619213,0.04415023,0.014748915,0.0033137312,0.003366944,0.00053992565],"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.0000062242784,0.000002611048,0.00004907264,0.00001754153,0.0000011006072,0.000039771323,0.0074507087,0.00011392975,0.000043651602,0.99014777,0.0010724815,0.0010551753],"study_design_scores_gemma":[0.0000104026585,0.000012900003,0.00015352326,0.00010609822,0.0000021565183,0.00022053714,0.0071470872,0.0004306894,0.00008038081,0.89444786,0.09737632,0.000012001167],"about_ca_topic_score_codex":0.004155725,"about_ca_topic_score_gemma":0.0026923288,"teacher_disagreement_score":0.0056315577,"about_ca_system_score_codex":0.004300078,"about_ca_system_score_gemma":0.001052898,"threshold_uncertainty_score":0.031199336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52148867,0.00090669363,0.37956768,0.0035018486,0.00036144926,0.000080898775,0.0006519312,0.00075330306,0.09268756],"genre_scores_gemma":[0.9294963,0.00024904418,0.053259347,0.00035822182,0.00015076985,0.00006595535,0.00025602314,0.000094307165,0.016069982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991757,0.00018498857,0.000063998785,0.00019388503,0.00020194278,0.00017954381],"domain_scores_gemma":[0.9982474,0.0006535817,0.00018133226,0.0002678402,0.00023851618,0.00041133995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007173698,0.0003423181,0.00050809426,0.0008151745,0.0011638514,0.002283028,0.000530258,0.0005308641,0.0062320447],"category_scores_gemma":[0.0025323553,0.00036777466,0.0007158612,0.0005854066,0.0024317512,0.0042373417,0.0018899963,0.002305191,0.0007935707],"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.00008458553,0.0000258296,0.00029431187,0.000030023959,0.0000044518574,0.00009205986,0.0002807267,0.0008014185,0.0029112643,0.9881577,0.00050314725,0.0068144384],"study_design_scores_gemma":[0.000029646644,0.00005560427,0.0005025622,0.000018772877,0.000011939038,0.00020761308,0.00024893525,0.005639662,0.003408386,0.9811524,0.008702045,0.000022384716],"about_ca_topic_score_codex":0.0008815297,"about_ca_topic_score_gemma":0.0009378059,"teacher_disagreement_score":0.0062320447,"about_ca_system_score_codex":0.0008271636,"about_ca_system_score_gemma":0.00047821243,"threshold_uncertainty_score":0.020848274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1533002,0.0011775945,0.72690934,0.0063691526,0.00047994408,0.0003366054,0.00078037643,0.0012689128,0.10937781],"genre_scores_gemma":[0.88878125,0.00071396906,0.09043293,0.0010994892,0.0006885271,0.0003914215,0.00044961297,0.00031351997,0.01712936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620396,0.000990087,0.00024039314,0.000640652,0.0014553332,0.00046958416],"domain_scores_gemma":[0.98554623,0.009563534,0.000758181,0.0025778299,0.0011417492,0.0004124728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035025412,0.0007409712,0.001474435,0.001393357,0.0024028497,0.0041369903,0.002851932,0.0018568955,0.012388053],"category_scores_gemma":[0.015347792,0.0008859421,0.0016582,0.0013143752,0.004539302,0.011034631,0.0044763545,0.004463421,0.0014930725],"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.00009860165,0.000028968134,0.00016415618,0.00006823674,0.00002332566,0.00006023881,0.00011536544,0.004728136,0.00085381744,0.9847312,0.001818831,0.0073091914],"study_design_scores_gemma":[0.000024727216,0.000011756179,0.000054197124,0.000008053962,0.000011114096,0.00003568841,0.00001230831,0.017867943,0.00079995673,0.9802403,0.0009231972,0.000010767736],"about_ca_topic_score_codex":0.0010977444,"about_ca_topic_score_gemma":0.0010676587,"teacher_disagreement_score":0.012388053,"about_ca_system_score_codex":0.0023600818,"about_ca_system_score_gemma":0.002911421,"threshold_uncertainty_score":0.041442156},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012952697,0.22218376,0.02989608,0.015235075,0.0042924806,0.000047146106,0.0003802758,0.0003391311,0.7263308],"genre_scores_gemma":[0.08895444,0.22179134,0.027022833,0.009473912,0.0125675965,0.0003555332,0.0008485069,0.00051905354,0.63846666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960047,0.00007223482,0.000017482562,0.00007591153,0.0002085451,0.000025405701],"domain_scores_gemma":[0.9993968,0.0003837745,0.000023576753,0.00007847115,0.000078392164,0.000038971528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056657643,0.0011175914,0.0011077188,0.0020174244,0.0012791868,0.0045032296,0.0008810107,0.001532644,0.02546913],"category_scores_gemma":[0.0017667606,0.0004969661,0.0004741116,0.0034273183,0.005067893,0.005138375,0.0009817661,0.0041111377,0.008194995],"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.000006193615,0.000014880483,0.000058571033,0.00020908905,0.00000880098,0.000020148891,0.00019245349,0.00032421382,0.00016300964,0.864098,0.09785836,0.037046313],"study_design_scores_gemma":[0.000005132822,0.0000060830303,0.00013910055,0.00017496671,0.000005464366,0.0000583226,0.000064227956,0.00039084608,0.0000852479,0.6690573,0.3300069,0.0000064345136],"about_ca_topic_score_codex":0.0021234045,"about_ca_topic_score_gemma":0.0028272483,"teacher_disagreement_score":0.02546913,"about_ca_system_score_codex":0.0022143754,"about_ca_system_score_gemma":0.0018460213,"threshold_uncertainty_score":0.085202694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004040741,0.038703717,0.6136847,0.049278095,0.0043691746,0.00035263534,0.00031868616,0.00061150256,0.28864074],"genre_scores_gemma":[0.36409804,0.04356304,0.48790425,0.021581084,0.01431885,0.002560533,0.0006223359,0.00072265655,0.064629264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.988091,0.00704194,0.00062062574,0.0013536135,0.0023917637,0.0005011483],"domain_scores_gemma":[0.98943275,0.0077967867,0.0005327298,0.0011657225,0.000816864,0.00025497793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013270217,0.0013408088,0.0019455807,0.0048848283,0.0040882695,0.009347417,0.0044517512,0.006087592,0.007970501],"category_scores_gemma":[0.02026436,0.00091392506,0.0022391842,0.0029899748,0.03828556,0.018740168,0.0060201283,0.010703801,0.0024714356],"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.0000036736467,0.000003106286,0.000026953172,0.000034704964,0.0000042969805,0.000022145397,0.00021665444,0.00024676052,0.000029248156,0.9947007,0.0016969034,0.003014879],"study_design_scores_gemma":[0.0000037102764,0.000007075506,0.000028358141,0.000047844896,0.0000032093233,0.0000406714,0.00005362832,0.0006428418,0.00009984313,0.97501266,0.024052426,0.00000774395],"about_ca_topic_score_codex":0.0017260029,"about_ca_topic_score_gemma":0.001142916,"teacher_disagreement_score":0.013270217,"about_ca_system_score_codex":0.00510823,"about_ca_system_score_gemma":0.0037194127,"threshold_uncertainty_score":0.070180416},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029592477,0.070623204,0.57578117,0.051570863,0.0018511462,0.00014090039,0.00095378945,0.00041332966,0.2690731],"genre_scores_gemma":[0.73085797,0.047017224,0.17572674,0.0051520593,0.006405155,0.0005850954,0.001168415,0.00038560416,0.032701652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972698,0.0010846221,0.0001450598,0.0004959037,0.0007964157,0.00020823455],"domain_scores_gemma":[0.99428576,0.004105801,0.00022671276,0.0007731517,0.0004467904,0.00016175798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023632678,0.0009071408,0.0011233552,0.0023534657,0.0015844806,0.0054931464,0.0011763468,0.0014355746,0.0059113433],"category_scores_gemma":[0.0071952217,0.00043021207,0.0016898804,0.0025720482,0.010481765,0.009403106,0.0028878725,0.006474658,0.00092832337],"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.000002135145,0.0000023685482,0.000041654333,0.00003466715,0.0000054908555,0.000007534009,0.0000554689,0.0006861119,0.000050647053,0.9957902,0.0010194171,0.0023043475],"study_design_scores_gemma":[0.0000023809855,0.0000041028666,0.000092763745,0.000019671364,0.0000026818357,0.000015475538,0.000028393137,0.0013171555,0.000056990506,0.98547447,0.012982396,0.0000035347875],"about_ca_topic_score_codex":0.00226633,"about_ca_topic_score_gemma":0.0011767464,"teacher_disagreement_score":0.0059113433,"about_ca_system_score_codex":0.0051499372,"about_ca_system_score_gemma":0.0014889821,"threshold_uncertainty_score":0.037365556},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30452776,0.0037015367,0.6097785,0.0032349327,0.00033408272,0.000121394456,0.00059029,0.00052640605,0.077185065],"genre_scores_gemma":[0.9486864,0.00094461325,0.044313055,0.00025944976,0.00029439462,0.00013996038,0.00027736853,0.0000759955,0.0050087366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972367,0.00076252874,0.00026057562,0.00048967084,0.00089035596,0.00036006034],"domain_scores_gemma":[0.99257374,0.0036928575,0.0009255046,0.0011830229,0.00103175,0.00059304247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031580476,0.00056067255,0.00064121105,0.003367376,0.00230888,0.004851817,0.0013115368,0.0011429824,0.0039680516],"category_scores_gemma":[0.00827939,0.00043620256,0.0011421357,0.0022490087,0.011659142,0.012313428,0.0030982133,0.0028947694,0.00046587808],"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.000008585673,0.000006153789,0.00008805289,0.000022123924,0.000003691124,0.000040710715,0.00028112932,0.0004813764,0.0002507035,0.9976674,0.00006166094,0.0010884254],"study_design_scores_gemma":[0.000007696427,0.000021282965,0.00015916093,0.000017517812,0.000007913742,0.000072973766,0.00017016739,0.0031501844,0.00072437484,0.9930427,0.0026154167,0.000010723631],"about_ca_topic_score_codex":0.0010419759,"about_ca_topic_score_gemma":0.0004733701,"teacher_disagreement_score":0.004851817,"about_ca_system_score_codex":0.001898506,"about_ca_system_score_gemma":0.0011385053,"threshold_uncertainty_score":0.01670158},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024699312,0.0030247238,0.86676794,0.08470119,0.0022532807,0.00009824444,0.00008143539,0.00061493966,0.01775894],"genre_scores_gemma":[0.35165346,0.0024589463,0.6246684,0.0070704077,0.0020020225,0.00034042093,0.00010729076,0.00032798364,0.011371002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941909,0.0019672036,0.0005755902,0.0014321452,0.0016009383,0.00023314438],"domain_scores_gemma":[0.98353666,0.008596636,0.0010462324,0.0033089786,0.0032069075,0.0003046111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010842479,0.0008387639,0.0011093228,0.00080455653,0.0020930097,0.0027755336,0.001988657,0.00457167,0.0025890665],"category_scores_gemma":[0.046842355,0.0005016704,0.000854616,0.0011456202,0.007860752,0.01573714,0.0037045048,0.0062542884,0.0012461109],"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.00017953239,0.00005424897,0.00067947357,0.00048380042,0.00008189811,0.0001283857,0.0010200705,0.008104618,0.0024698223,0.829221,0.016683897,0.14089313],"study_design_scores_gemma":[0.000035144967,0.000026183436,0.00009488191,0.000062071216,0.00002446416,0.00013788289,0.00022892888,0.012636862,0.0017238873,0.9675414,0.017454818,0.000033593053],"about_ca_topic_score_codex":0.0012697072,"about_ca_topic_score_gemma":0.0008201669,"teacher_disagreement_score":0.010842479,"about_ca_system_score_codex":0.0012410453,"about_ca_system_score_gemma":0.002114044,"threshold_uncertainty_score":0.05734116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30706653,0.004412999,0.5850009,0.0249037,0.00020561276,0.00017772322,0.0020471967,0.00047706702,0.07570825],"genre_scores_gemma":[0.961293,0.0015372136,0.028837582,0.0005800072,0.00033186318,0.00020020087,0.0010166498,0.00009943797,0.006104111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916637,0.0026958175,0.0005694995,0.0010067465,0.0033427433,0.0007215129],"domain_scores_gemma":[0.9530526,0.038533237,0.001889011,0.0034292305,0.0020114467,0.0010844885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004867475,0.00070896436,0.0014453145,0.0027709617,0.0019456577,0.00952008,0.0030458304,0.0020447264,0.008278567],"category_scores_gemma":[0.027099604,0.0010502152,0.0019331392,0.0031063964,0.0064727864,0.021298734,0.004745175,0.006041033,0.00046930675],"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.000024294988,0.000023430173,0.0004355783,0.00007515639,0.000019879393,0.000028831151,0.00028626312,0.005339821,0.00015260204,0.9890416,0.0006553985,0.003916986],"study_design_scores_gemma":[0.000007299746,0.0000036011756,0.0001189557,0.000008052251,0.000007129913,0.000021243684,0.000051617848,0.012410769,0.00009891869,0.9865906,0.0006757655,0.0000059740205],"about_ca_topic_score_codex":0.0023741291,"about_ca_topic_score_gemma":0.0015385798,"teacher_disagreement_score":0.00952008,"about_ca_system_score_codex":0.0057406393,"about_ca_system_score_gemma":0.0022488816,"threshold_uncertainty_score":0.041651487},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038475126,0.011368965,0.035012208,0.00789303,0.0017462611,0.000022388333,0.00019377789,0.00017059156,0.93974525],"genre_scores_gemma":[0.41488004,0.019729381,0.040228892,0.0066039762,0.00908498,0.00027198633,0.00061407685,0.00043868143,0.5081479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995252,0.0001248882,0.000019289153,0.000110869696,0.00016503806,0.000054786113],"domain_scores_gemma":[0.99964714,0.00018306535,0.000018060668,0.00006809216,0.0000618878,0.000021793428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000544761,0.0006054897,0.0005577748,0.0010852618,0.0016185966,0.0031950804,0.00070101634,0.0011954488,0.014220025],"category_scores_gemma":[0.0018513023,0.00038965105,0.00054437254,0.0009918432,0.006307409,0.005824829,0.0014546564,0.0038347105,0.0044959993],"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.000002844595,0.0000019058898,0.000013755438,0.000017590588,0.0000012607222,0.0000036450922,0.00007380003,0.00005737711,0.000052403575,0.98739654,0.005956287,0.0064225867],"study_design_scores_gemma":[0.0000035424382,0.0000024608362,0.000047034013,0.000016762659,0.0000016233971,0.000019021863,0.000022207847,0.000114394345,0.00005681279,0.9327198,0.06699411,0.0000021601236],"about_ca_topic_score_codex":0.00095962477,"about_ca_topic_score_gemma":0.00089915335,"teacher_disagreement_score":0.014220025,"about_ca_system_score_codex":0.0019776751,"about_ca_system_score_gemma":0.0012952073,"threshold_uncertainty_score":0.047570765},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028824317,0.24332117,0.101922944,0.018303044,0.012473288,0.00030530858,0.002951454,0.0015898988,0.61625034],"genre_scores_gemma":[0.05684823,0.25409392,0.088748634,0.013127268,0.016645063,0.001098162,0.0064307125,0.0020528904,0.5609551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.00010151281,0.00004721711,0.00009648775,0.00025629826,0.00005028815],"domain_scores_gemma":[0.99937123,0.00028951533,0.000039585702,0.000060294242,0.00019196204,0.00004751489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049768714,0.0012951498,0.00092014,0.0022704578,0.0010104433,0.0040959907,0.001677463,0.0018269802,0.03832099],"category_scores_gemma":[0.0023584375,0.00080434687,0.00083491084,0.0035818336,0.001719608,0.005952621,0.0014975907,0.0030580768,0.027761808],"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.00002471469,0.000063244086,0.000102460064,0.00095452066,0.0000143146,0.00015396788,0.0004740831,0.0020242056,0.000897692,0.45847726,0.42179683,0.1150167],"study_design_scores_gemma":[0.0000052584774,0.0000125374345,0.00017406298,0.0003655381,0.0000043047567,0.00018739543,0.00007047914,0.000732785,0.000101966885,0.14343958,0.8548946,0.000011469086],"about_ca_topic_score_codex":0.0017316566,"about_ca_topic_score_gemma":0.0017837129,"teacher_disagreement_score":0.03832099,"about_ca_system_score_codex":0.0027148228,"about_ca_system_score_gemma":0.0020287288,"threshold_uncertainty_score":0.12819648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27575222,0.0036956028,0.55150753,0.006940604,0.00019041119,0.000069568356,0.00020550979,0.00031562464,0.16132292],"genre_scores_gemma":[0.955869,0.0012543857,0.032374028,0.00041399465,0.0002698772,0.00009824742,0.00013662437,0.000098532204,0.009485401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982418,0.00041721482,0.00011553728,0.0004236167,0.00053668086,0.00026510478],"domain_scores_gemma":[0.9958515,0.0024219484,0.00031655421,0.00068657147,0.00043987928,0.00028355612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014182626,0.0005182711,0.0006106325,0.0017995121,0.0017834201,0.002625442,0.0007970345,0.0008294003,0.0039982325],"category_scores_gemma":[0.0061029885,0.0003017966,0.0008665262,0.0017695887,0.010053646,0.008804456,0.0046997233,0.0034656723,0.00042063615],"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.00000429743,0.0000028298534,0.000072526265,0.000009300988,0.0000018006798,0.00001821587,0.000102381775,0.0003768929,0.00018254538,0.9977977,0.000094207666,0.0013373091],"study_design_scores_gemma":[0.0000035078651,0.000008764877,0.00020252464,0.000009932503,0.0000030864621,0.000057152974,0.000057587167,0.0038541728,0.0003987446,0.9925096,0.0028896648,0.000005213402],"about_ca_topic_score_codex":0.0020184605,"about_ca_topic_score_gemma":0.0010225524,"teacher_disagreement_score":0.0039982325,"about_ca_system_score_codex":0.0024556161,"about_ca_system_score_gemma":0.00071820733,"threshold_uncertainty_score":0.017816842},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004029072,0.13809901,0.027923288,0.03749376,0.22486465,0.0008396166,0.01281382,0.0020632958,0.55187345],"genre_scores_gemma":[0.012315434,0.072111376,0.011933432,0.0043867202,0.08786426,0.0006986377,0.014127527,0.0018662896,0.7946963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99665064,0.00047908572,0.00028756316,0.00043556796,0.0019747892,0.00017245884],"domain_scores_gemma":[0.98574847,0.0018583925,0.00057514565,0.0010041983,0.007889947,0.0029238542],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032608854,0.0017195998,0.0016869177,0.006480153,0.002008229,0.006665347,0.001212328,0.0012101491,0.30960426],"category_scores_gemma":[0.014147046,0.00059391785,0.0018645561,0.0062246597,0.00079613493,0.0036430832,0.002633774,0.0037615912,0.18504319],"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.00005266629,0.000041063286,0.00012029594,0.0005599082,0.000024077828,0.000037303955,0.000103709004,0.00015970551,0.0007038056,0.0068508815,0.9123044,0.07904212],"study_design_scores_gemma":[0.000013496895,0.00003080644,0.00045751076,0.00028240733,0.000017718949,0.00009274976,0.000080727455,0.0002224686,0.00028527036,0.005833624,0.9926704,0.000012908733],"about_ca_topic_score_codex":0.00076539145,"about_ca_topic_score_gemma":0.0011749689,"teacher_disagreement_score":0.30960426,"about_ca_system_score_codex":0.0028221325,"about_ca_system_score_gemma":0.0033907616,"threshold_uncertainty_score":0.9847657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1352164,0.009213793,0.7629804,0.009043109,0.00028422137,0.0003032604,0.0007520154,0.00074514485,0.08146163],"genre_scores_gemma":[0.7571873,0.0025013487,0.20879762,0.0009651154,0.0005439206,0.00050509215,0.0010735241,0.00019778677,0.02822829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963062,0.0016150597,0.0002475532,0.00047459104,0.00094985263,0.00040690493],"domain_scores_gemma":[0.98449177,0.012321388,0.00080440607,0.0010072457,0.00068592886,0.00068931916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004142302,0.0006988625,0.0011369815,0.0016828032,0.0015025416,0.0030204481,0.001704953,0.001769919,0.010149998],"category_scores_gemma":[0.015928807,0.00058810017,0.0012226402,0.001358643,0.002763,0.005722851,0.0033356466,0.002789982,0.000602448],"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.00005389793,0.000054244865,0.0009893711,0.0003087561,0.00007771679,0.00010316638,0.00055498135,0.025672296,0.00046163224,0.9349383,0.0050202883,0.031765305],"study_design_scores_gemma":[0.000028846252,0.000021031756,0.00031341126,0.000029709776,0.000014287027,0.00008367072,0.0000891355,0.0954861,0.00011410405,0.8984439,0.005367007,0.000008957099],"about_ca_topic_score_codex":0.0020993503,"about_ca_topic_score_gemma":0.005666315,"teacher_disagreement_score":0.010149998,"about_ca_system_score_codex":0.0027244086,"about_ca_system_score_gemma":0.001433165,"threshold_uncertainty_score":0.033955097},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7417749,0.0006048427,0.22146018,0.0008190322,0.000093959956,0.000054795386,0.00025345566,0.00073832925,0.034200326],"genre_scores_gemma":[0.9734744,0.00011108331,0.024254013,0.00008048012,0.000022794542,0.00004156085,0.00009203318,0.00008591584,0.0018377948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983469,0.00035231738,0.00008113947,0.0003114832,0.0005051128,0.00040301422],"domain_scores_gemma":[0.99336773,0.0040606754,0.00044784148,0.001123728,0.00036594534,0.0006340517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016882594,0.00061825657,0.00062273035,0.0012479989,0.0011226481,0.0030751303,0.0013917178,0.0007502922,0.0054774587],"category_scores_gemma":[0.012237482,0.00057843345,0.0006269478,0.00084388256,0.004216441,0.005477609,0.0046560713,0.0020154293,0.0004288811],"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.00032102954,0.000045801753,0.001868087,0.00010986683,0.000019048017,0.00008985466,0.00047882693,0.029954296,0.006456364,0.9488292,0.0009354528,0.010892227],"study_design_scores_gemma":[0.000046487785,0.00009241938,0.0008013902,0.000046567387,0.000018952116,0.00013743027,0.00022444455,0.1280915,0.010394301,0.8542915,0.0058064945,0.000048480226],"about_ca_topic_score_codex":0.0008057926,"about_ca_topic_score_gemma":0.00095105247,"teacher_disagreement_score":0.0054774587,"about_ca_system_score_codex":0.0018433093,"about_ca_system_score_gemma":0.0006065288,"threshold_uncertainty_score":0.018323898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011608583,0.0018145825,0.92761797,0.0010019591,0.0005143732,0.00013108083,0.0046075284,0.035918426,0.027233163],"genre_scores_gemma":[0.07213963,0.005166434,0.7707387,0.0020186314,0.0012898884,0.0012916179,0.021946613,0.044435017,0.0809734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99474204,0.0015962505,0.00057125697,0.00061396323,0.0020702367,0.00040630327],"domain_scores_gemma":[0.9895439,0.005172642,0.00041992785,0.0018993269,0.0024829733,0.00048116187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00548078,0.0022014752,0.0019335008,0.0061059915,0.0026752087,0.008525859,0.0046711974,0.0016026892,0.10391979],"category_scores_gemma":[0.01818905,0.0025447456,0.0029330393,0.009023549,0.002457108,0.015295721,0.008401318,0.0066648354,0.05807701],"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.0002394364,0.00007494693,0.00030404193,0.0009496184,0.000061398714,0.00024757552,0.0005997842,0.0022775435,0.0024532308,0.5546728,0.282704,0.15541568],"study_design_scores_gemma":[0.00011059376,0.000029573835,0.00020357395,0.00037286864,0.000046690722,0.00032043445,0.00012512568,0.013027852,0.0068870406,0.34879133,0.6299665,0.0001184229],"about_ca_topic_score_codex":0.005169428,"about_ca_topic_score_gemma":0.005529949,"teacher_disagreement_score":0.10391979,"about_ca_system_score_codex":0.0027745718,"about_ca_system_score_gemma":0.004141539,"threshold_uncertainty_score":0.34764636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044001967,0.20159718,0.48811638,0.08764057,0.019415528,0.00010655025,0.0008483233,0.0014338993,0.15683967],"genre_scores_gemma":[0.63762903,0.0983347,0.09517962,0.018040337,0.039060198,0.00061818294,0.0017446165,0.0012884311,0.108104855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856323,0.0005798692,0.00006154856,0.00027685642,0.0003732564,0.00014524226],"domain_scores_gemma":[0.9968779,0.0024943727,0.00010101939,0.00014085874,0.00022698472,0.00015883944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026430315,0.0008488755,0.0009383355,0.0026513354,0.0015977406,0.005843021,0.00095762865,0.0021220148,0.015451644],"category_scores_gemma":[0.007351427,0.00090119475,0.00092294096,0.0027959119,0.0033095086,0.010120137,0.0042177364,0.0052030087,0.0025348088],"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.00005915855,0.000030813466,0.00023266579,0.0003068896,0.000045770415,0.00008492857,0.00045111484,0.001346074,0.00065491075,0.92307353,0.0396917,0.034022454],"study_design_scores_gemma":[0.000014494886,0.000014727401,0.0003002037,0.0001396563,0.000028335338,0.00008872109,0.00012566903,0.0014249018,0.00030165332,0.94277644,0.054762002,0.000023270855],"about_ca_topic_score_codex":0.0007547019,"about_ca_topic_score_gemma":0.00053037,"teacher_disagreement_score":0.015451644,"about_ca_system_score_codex":0.00298744,"about_ca_system_score_gemma":0.00080104783,"threshold_uncertainty_score":0.051690876},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7386576,0.0018661052,0.11578328,0.0045225215,0.00034002715,0.00010246953,0.00061557227,0.00021496005,0.13789731],"genre_scores_gemma":[0.9750866,0.0005259592,0.010059512,0.00024939486,0.00031789826,0.00007070771,0.0002926949,0.000025520625,0.01337166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987556,0.0003852354,0.00010333762,0.00023742154,0.00033903559,0.0001793316],"domain_scores_gemma":[0.9951563,0.0027072981,0.00065026723,0.0005041145,0.00047172865,0.0005104216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017635452,0.00047475108,0.00078702223,0.0022464767,0.0024123117,0.003966776,0.00095585984,0.00087470136,0.007007003],"category_scores_gemma":[0.0045889034,0.0004787233,0.00062147155,0.0019864305,0.0061309696,0.008256509,0.0026084958,0.0017822566,0.00064296275],"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.000029695882,0.000016586086,0.00017553194,0.000014322598,0.0000038710664,0.000024808078,0.00020774105,0.0002632615,0.0001764722,0.9969361,0.0002693563,0.001882154],"study_design_scores_gemma":[0.000014673382,0.000009630153,0.00012480297,0.0000040425634,0.0000046336463,0.00004834817,0.00012032924,0.00050052506,0.0001865563,0.997675,0.0013063503,0.0000050561407],"about_ca_topic_score_codex":0.0009595393,"about_ca_topic_score_gemma":0.000809086,"teacher_disagreement_score":0.007007003,"about_ca_system_score_codex":0.0016242686,"about_ca_system_score_gemma":0.0012446399,"threshold_uncertainty_score":0.023440778},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025300326,0.008079151,0.56423736,0.0110970205,0.0013371451,0.00014745751,0.0014016087,0.00075450056,0.38764545],"genre_scores_gemma":[0.685948,0.006561729,0.14919595,0.006188589,0.0024165476,0.0006568043,0.0019645896,0.0006602887,0.14640757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694175,0.0005243107,0.00017514164,0.00071245787,0.001288092,0.0003581903],"domain_scores_gemma":[0.99516785,0.0025425744,0.00018015673,0.0007678697,0.0011734202,0.00016812404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039757164,0.0007986492,0.0012835506,0.0014756402,0.0018271914,0.0035708195,0.0018386112,0.00144168,0.009490131],"category_scores_gemma":[0.009662931,0.00048267207,0.0019442885,0.0009511893,0.005001807,0.009028932,0.0028183158,0.0050473055,0.0019217208],"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.0000071461864,0.0000036455247,0.000048613812,0.000053999716,0.000005464476,0.000033574397,0.00014026203,0.00030553679,0.00017523092,0.99124444,0.0026661328,0.0053159944],"study_design_scores_gemma":[0.000012360089,0.000011081626,0.00011327592,0.00005998417,0.000009829956,0.00017085341,0.000039710343,0.001985223,0.00080507685,0.9554478,0.041331537,0.000013291536],"about_ca_topic_score_codex":0.0022891022,"about_ca_topic_score_gemma":0.0012697339,"teacher_disagreement_score":0.009490131,"about_ca_system_score_codex":0.002850827,"about_ca_system_score_gemma":0.00230197,"threshold_uncertainty_score":0.03174764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002108569,0.020964488,0.030467777,0.0045578266,0.00087508425,0.000026004902,0.00031606917,0.00027083704,0.9404133],"genre_scores_gemma":[0.20653829,0.023630826,0.034566652,0.003447248,0.0032654423,0.00025796014,0.0010712221,0.00052760326,0.72669476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965227,0.00008840494,0.000015377822,0.00008335726,0.0001359463,0.000024588084],"domain_scores_gemma":[0.9996593,0.00014356335,0.000015941338,0.00008097362,0.00007714107,0.000023087496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003949103,0.00066466554,0.00066217565,0.001264033,0.0015274334,0.0038161124,0.0006162919,0.0007402213,0.031420313],"category_scores_gemma":[0.0015932886,0.00029288293,0.0003603909,0.0015575805,0.0030836219,0.004926824,0.0012258306,0.0030917737,0.010389873],"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.0000034211444,0.0000053837707,0.000037557602,0.000040571747,0.0000022787517,0.000009717108,0.00011446084,0.00010019946,0.000115424155,0.95930684,0.023609713,0.016654512],"study_design_scores_gemma":[0.0000026385335,0.0000033655917,0.00009133019,0.00003461726,0.000002373495,0.000047195856,0.00004102258,0.00028400435,0.000090247915,0.7864481,0.2129524,0.0000026680527],"about_ca_topic_score_codex":0.0017927096,"about_ca_topic_score_gemma":0.0019686813,"teacher_disagreement_score":0.031420313,"about_ca_system_score_codex":0.002659029,"about_ca_system_score_gemma":0.0009856739,"threshold_uncertainty_score":0.10511142},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04102561,0.01636258,0.5215498,0.15004952,0.004015601,0.000104195555,0.0007492821,0.00066386984,0.26547953],"genre_scores_gemma":[0.8181136,0.007846343,0.11518918,0.014366948,0.0064155455,0.00028963978,0.0007423792,0.00042491994,0.036611438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969003,0.0012441832,0.00013807944,0.0006668593,0.00079675566,0.00025391442],"domain_scores_gemma":[0.99360025,0.0038698334,0.00036728775,0.00088761025,0.0009979461,0.00027710534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007816576,0.00053528947,0.0009516363,0.0011487352,0.0020746181,0.0057926783,0.0010875921,0.0026297998,0.004231453],"category_scores_gemma":[0.015144269,0.00040374915,0.0012039657,0.00071291666,0.0135307815,0.018677043,0.0029393085,0.0046491222,0.0018846752],"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.000008450958,0.0000042362262,0.00003313929,0.000020654708,0.000002695322,0.000006507429,0.00006078531,0.00018352404,0.00003932766,0.99477416,0.0027555465,0.0021110189],"study_design_scores_gemma":[0.000004104142,0.0000032116172,0.000026333337,0.000008012172,0.000001087755,0.000009876904,0.000026267071,0.00041753438,0.000053482156,0.9907307,0.008716023,0.0000032379053],"about_ca_topic_score_codex":0.0010112392,"about_ca_topic_score_gemma":0.0005498651,"teacher_disagreement_score":0.007816576,"about_ca_system_score_codex":0.002152574,"about_ca_system_score_gemma":0.002293709,"threshold_uncertainty_score":0.041338563},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43417358,0.0012443207,0.2061665,0.002441921,0.00045056123,0.00009377852,0.0011601475,0.00084124645,0.35342792],"genre_scores_gemma":[0.9531243,0.00055011315,0.017356787,0.0004213329,0.00034776647,0.00006869273,0.0006688763,0.00033580922,0.027126255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829704,0.00024361839,0.00008097479,0.0003719881,0.0006211351,0.00038534836],"domain_scores_gemma":[0.9979431,0.00069984054,0.00018627678,0.0002140198,0.0005478162,0.00040885972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009394769,0.00070731435,0.00064604287,0.0038018746,0.0021775817,0.0036567352,0.0010043465,0.00072000764,0.0111236125],"category_scores_gemma":[0.002867854,0.00040148312,0.00093542016,0.0018723585,0.002957177,0.005154513,0.0021461034,0.0020927088,0.001515992],"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.00002080442,0.000011194847,0.00021310817,0.000022096463,0.0000045624815,0.000049155213,0.000203408,0.00032910184,0.0006979219,0.9935454,0.0010874602,0.003815723],"study_design_scores_gemma":[0.000015342543,0.000021145346,0.00091332395,0.000020932966,0.000007754873,0.00014453323,0.00020852541,0.0039319317,0.0010539547,0.9854423,0.008220343,0.000019934736],"about_ca_topic_score_codex":0.0038898084,"about_ca_topic_score_gemma":0.0031782417,"teacher_disagreement_score":0.0111236125,"about_ca_system_score_codex":0.0028627724,"about_ca_system_score_gemma":0.0005203826,"threshold_uncertainty_score":0.037212253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030481482,0.049944416,0.5164469,0.13776712,0.021310015,0.00085580203,0.0033427381,0.0021385874,0.23771296],"genre_scores_gemma":[0.40541637,0.028490506,0.21907938,0.010796647,0.010017485,0.0012786612,0.008575917,0.0013257583,0.31501928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98888355,0.0053403624,0.0006641981,0.0017298543,0.0023894105,0.0009926502],"domain_scores_gemma":[0.9641853,0.023670742,0.00086404395,0.0045077843,0.0035357787,0.0032363185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015026375,0.0013142845,0.0017102268,0.0033363,0.0039308695,0.0136726005,0.003201876,0.003786283,0.022510355],"category_scores_gemma":[0.029395318,0.0010370426,0.0018783209,0.0040975916,0.0051662237,0.010551107,0.008775777,0.0055840174,0.0044516753],"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.0005595678,0.0002999922,0.0025860968,0.0007820161,0.0002359988,0.000813044,0.0050894427,0.0063341283,0.002404235,0.3675007,0.34576896,0.26762575],"study_design_scores_gemma":[0.00006516884,0.00008272313,0.0011679981,0.0004478497,0.000060528397,0.00027176147,0.0014466608,0.009746939,0.0022554891,0.12120499,0.8631733,0.00007663702],"about_ca_topic_score_codex":0.011019431,"about_ca_topic_score_gemma":0.012977372,"teacher_disagreement_score":0.022510355,"about_ca_system_score_codex":0.005336266,"about_ca_system_score_gemma":0.0074210493,"threshold_uncertainty_score":0.07946801},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33119246,0.00454795,0.30195555,0.010744777,0.0014971425,0.00019019614,0.0024283554,0.001785511,0.34565806],"genre_scores_gemma":[0.8870177,0.0010991467,0.06652857,0.0008884627,0.0007134272,0.000101009435,0.002141658,0.00037600743,0.04113396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762124,0.0004295048,0.00021740686,0.0005383715,0.00089389377,0.00029968345],"domain_scores_gemma":[0.99227387,0.0042768796,0.0004853742,0.0011529126,0.0012809046,0.0005300172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014413162,0.00047381886,0.0006545818,0.0026240405,0.0021620945,0.004258253,0.0010302651,0.0007777813,0.012173335],"category_scores_gemma":[0.010108711,0.00047017095,0.0013100585,0.0025635334,0.0032359154,0.006295663,0.0020109795,0.003770078,0.001174858],"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.00011166619,0.00004992459,0.0006887954,0.00006522668,0.000016001675,0.00015493885,0.00029054194,0.0027388723,0.00073532667,0.96583587,0.0050288835,0.024283834],"study_design_scores_gemma":[0.000012868785,0.000020932968,0.00034970362,0.000018738263,0.000009513103,0.00012432008,0.00007788913,0.004035132,0.0005358914,0.9882046,0.006598115,0.000012342104],"about_ca_topic_score_codex":0.004210367,"about_ca_topic_score_gemma":0.0042923656,"teacher_disagreement_score":0.012173335,"about_ca_system_score_codex":0.0027768803,"about_ca_system_score_gemma":0.0019546256,"threshold_uncertainty_score":0.0407238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039909333,0.012529194,0.7649156,0.057522893,0.000345362,0.00006235787,0.00021676542,0.00025809815,0.12424049],"genre_scores_gemma":[0.83451265,0.0053021526,0.15088055,0.002002134,0.00073295133,0.00021554045,0.00013127936,0.00010852284,0.0061141206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943915,0.0030563567,0.00028336892,0.00053553475,0.0014934046,0.0002399448],"domain_scores_gemma":[0.96892065,0.02488638,0.0016456048,0.002574655,0.0013949015,0.00057772495],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.009213561,0.00065302686,0.00074269396,0.0027152386,0.0023859513,0.0066368836,0.0017465815,0.0027866156,0.0038339235],"category_scores_gemma":[0.029186599,0.00052298495,0.00085971283,0.0015165529,0.020223653,0.013071856,0.0047491784,0.0047599524,0.00045409077],"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.0000021328308,0.0000025660106,0.00007275502,0.000020246487,0.0000028836787,0.0000052202536,0.000099448975,0.0010639781,0.000025178835,0.9970835,0.00021941346,0.0014026547],"study_design_scores_gemma":[0.000002627052,0.0000016543189,0.000053465898,0.000016609196,0.000001364918,0.000007869677,0.000035077974,0.0030007202,0.000032393527,0.9950146,0.0018301089,0.0000035863022],"about_ca_topic_score_codex":0.0021165754,"about_ca_topic_score_gemma":0.0020653452,"teacher_disagreement_score":0.997614,"about_ca_system_score_codex":0.003941511,"about_ca_system_score_gemma":0.0025042968,"threshold_uncertainty_score":0.04872656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42686957,0.00076963555,0.50351655,0.0019735834,0.00017057655,0.00015670997,0.00055159495,0.0015987961,0.06439306],"genre_scores_gemma":[0.9505885,0.00020252063,0.043267496,0.000117060255,0.00007431456,0.00015850218,0.00020551967,0.00014879908,0.005237294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989722,0.00014948798,0.000048906863,0.00027105043,0.00029792014,0.00026038638],"domain_scores_gemma":[0.99601364,0.0025901305,0.00021449501,0.00056880125,0.00031420606,0.00029870585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093388534,0.00052111695,0.0010396374,0.0012135942,0.0017940694,0.004237875,0.0014269311,0.0012270082,0.00686436],"category_scores_gemma":[0.0065617156,0.00038020065,0.0012152717,0.0010293111,0.0036663464,0.0049581784,0.0019467329,0.0028642784,0.00078065606],"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.00003851196,0.00002000388,0.00023764725,0.000041194,0.000008759022,0.0001233321,0.00016647887,0.006040142,0.0019254908,0.9885322,0.00044398644,0.0024221935],"study_design_scores_gemma":[0.000022053355,0.000015616322,0.00013233845,0.000012901867,0.000010634611,0.00007021179,0.0000410797,0.03362043,0.0023632084,0.9617605,0.0019368589,0.000014254437],"about_ca_topic_score_codex":0.0016720049,"about_ca_topic_score_gemma":0.0014309522,"teacher_disagreement_score":0.00686436,"about_ca_system_score_codex":0.0025153046,"about_ca_system_score_gemma":0.0011993969,"threshold_uncertainty_score":0.022963583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14964458,0.009266925,0.72976786,0.0144175915,0.000587397,0.00009216519,0.00021744765,0.00053716,0.09546888],"genre_scores_gemma":[0.9573663,0.0018173257,0.030668395,0.0012208339,0.00039261367,0.000123367,0.00007671422,0.000045497985,0.008289088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996132,0.00011794888,0.000014331384,0.000064489665,0.00013601247,0.000054057513],"domain_scores_gemma":[0.99855703,0.0009002289,0.00014816546,0.0001832456,0.0001379777,0.000073381656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079646194,0.000375486,0.0003291756,0.0009166543,0.0005938406,0.00091659225,0.00054646295,0.0009529536,0.0022299625],"category_scores_gemma":[0.0048698867,0.00018988084,0.00028894178,0.00050438044,0.0035982651,0.002709772,0.0010197563,0.0014107024,0.00039756144],"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.000012885106,0.0000028222905,0.00010100378,0.000015399248,0.00000331178,0.00003217855,0.000041452382,0.0032451812,0.0004939232,0.9915332,0.0007436445,0.0037750169],"study_design_scores_gemma":[0.000009683292,0.000011382775,0.00014473355,0.0000076063475,0.0000017772759,0.000040409584,0.000010029842,0.0139071215,0.00040235333,0.9826769,0.0027805383,0.0000073578203],"about_ca_topic_score_codex":0.00073367596,"about_ca_topic_score_gemma":0.0005594242,"teacher_disagreement_score":0.0022299625,"about_ca_system_score_codex":0.0006969788,"about_ca_system_score_gemma":0.0004481293,"threshold_uncertainty_score":0.0074599385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36213338,0.0019994022,0.4390808,0.0047221,0.000435252,0.000114446986,0.0003130972,0.0009366309,0.19026484],"genre_scores_gemma":[0.96353155,0.00036025918,0.017723128,0.00047067518,0.00015910812,0.000040593448,0.00014128014,0.00025160867,0.017321829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979785,0.0006405278,0.00009486029,0.00043873666,0.00045549095,0.00039189646],"domain_scores_gemma":[0.99405235,0.0026194246,0.00029387756,0.0018542042,0.0007445281,0.00043564182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025620868,0.00046803753,0.0008143779,0.001605135,0.002164327,0.0025316735,0.0007014427,0.0011333396,0.008412179],"category_scores_gemma":[0.005645328,0.0005530197,0.0012624104,0.00091043464,0.008354708,0.007769096,0.0051915324,0.0032633706,0.0010320039],"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.000050486993,0.000012319212,0.0004082645,0.0000339029,0.000012150146,0.00011092981,0.000521892,0.0007193522,0.0013013146,0.9907857,0.0006617737,0.0053819884],"study_design_scores_gemma":[0.000011611304,0.000036197416,0.00025009707,0.0000253613,0.000013950412,0.00010269789,0.00037343835,0.0017200153,0.0032976207,0.9870449,0.007107552,0.00001656041],"about_ca_topic_score_codex":0.001656142,"about_ca_topic_score_gemma":0.0012200507,"teacher_disagreement_score":0.008412179,"about_ca_system_score_codex":0.0015668814,"about_ca_system_score_gemma":0.0005952337,"threshold_uncertainty_score":0.028141558},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023791917,0.917528,0.0007635503,0.05898212,0.014379826,0.0000067738147,0.00013909051,0.00003006787,0.007932583],"genre_scores_gemma":[0.009446911,0.9312828,0.00080582616,0.016036578,0.019103443,0.000020847192,0.00024196418,0.000059063517,0.023002485],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919456,0.00019990587,0.000075351105,0.00016577727,0.00031706213,0.00004727162],"domain_scores_gemma":[0.99653745,0.0017440696,0.00017418645,0.00007737893,0.0012082695,0.0002587149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011474907,0.0010746383,0.0011211134,0.0031580778,0.0012024913,0.0017529073,0.001069242,0.0018089216,0.023825312],"category_scores_gemma":[0.005332547,0.00058992696,0.00034941462,0.0037680103,0.0023566037,0.00516879,0.0010083343,0.0049073705,0.0073944796],"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.000024319183,0.000008051248,0.00014847436,0.0016563252,0.000022727476,0.0000704881,0.0004313341,0.00018531422,0.00013745771,0.025240835,0.922252,0.049822778],"study_design_scores_gemma":[0.000010714643,0.000004813279,0.00068698183,0.00078397186,0.000010335705,0.00017753478,0.00025656965,0.00006499072,0.00009293568,0.009456596,0.98844016,0.000014471385],"about_ca_topic_score_codex":0.010182443,"about_ca_topic_score_gemma":0.01993585,"teacher_disagreement_score":0.023825312,"about_ca_system_score_codex":0.0022978825,"about_ca_system_score_gemma":0.0018098793,"threshold_uncertainty_score":0.07970363},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0405016,0.02995362,0.082806185,0.4741545,0.0060305693,0.00021317424,0.0012028676,0.00045976194,0.36467776],"genre_scores_gemma":[0.85462767,0.02088033,0.036146153,0.065363586,0.004909555,0.00035042333,0.0012165284,0.00024466056,0.016261065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994989,0.002541801,0.00024656756,0.00064799323,0.0010523533,0.0005222644],"domain_scores_gemma":[0.9941559,0.002831801,0.00050548505,0.00077993673,0.0009326007,0.0007943789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005469713,0.0006720479,0.00074629596,0.0016718396,0.004890763,0.013326684,0.0015795308,0.008101551,0.006501328],"category_scores_gemma":[0.011205682,0.0005819111,0.00068293104,0.0018367996,0.025449604,0.029278832,0.002764338,0.0058569754,0.002376379],"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.00003586899,0.000027429467,0.00087796984,0.0002895269,0.000033829936,0.00022859342,0.0042672367,0.0003073817,0.00034975237,0.9598236,0.01675865,0.017000051],"study_design_scores_gemma":[0.0000067720307,0.00001720019,0.0006295517,0.00016515766,0.000011877036,0.00021708941,0.0029346633,0.00025734832,0.00018657005,0.92496926,0.07057412,0.00003031239],"about_ca_topic_score_codex":0.002312108,"about_ca_topic_score_gemma":0.0016393843,"teacher_disagreement_score":0.013326684,"about_ca_system_score_codex":0.0032482382,"about_ca_system_score_gemma":0.0026653456,"threshold_uncertainty_score":0.028926909},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39569858,0.0099074915,0.15429094,0.026246814,0.001986931,0.00008757217,0.00047281393,0.0006329415,0.4106759],"genre_scores_gemma":[0.9619385,0.0016363567,0.0130434,0.0013219749,0.001319574,0.000089894966,0.0001839306,0.00012099032,0.020345459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864787,0.0005213532,0.0000965938,0.0002546889,0.0002805099,0.0001990654],"domain_scores_gemma":[0.997638,0.0010509521,0.00020393524,0.00049397745,0.000323552,0.00028948492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024833772,0.0006195528,0.0013584108,0.002352212,0.0033083775,0.0054056873,0.0010994074,0.0020353312,0.008278935],"category_scores_gemma":[0.005020776,0.0006197149,0.0012752059,0.0017421684,0.011250505,0.012272054,0.003901964,0.005092616,0.0005655077],"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.000002681588,0.0000019740855,0.00001752408,0.000004896768,0.0000011416798,0.000008602672,0.000049844057,0.00003904552,0.000025480444,0.9994273,0.00012623126,0.00029520298],"study_design_scores_gemma":[0.0000033687113,0.0000011513403,0.00002415553,0.0000019497404,0.0000010522516,0.000010913761,0.000019509913,0.0001471131,0.000014036498,0.9991798,0.0005951391,0.000001697261],"about_ca_topic_score_codex":0.0008569934,"about_ca_topic_score_gemma":0.000794777,"teacher_disagreement_score":0.008278935,"about_ca_system_score_codex":0.0022333805,"about_ca_system_score_gemma":0.000778938,"threshold_uncertainty_score":0.027695775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99834013,0.000038009395,0.0011403792,0.00001204928,0.0000019634467,0.000009253219,0.00010637494,0.000032009255,0.00031990107],"genre_scores_gemma":[0.9981791,0.00004195136,0.0011191939,0.000006195703,0.0000032570472,0.000010025765,0.0003098914,0.00002365717,0.00030681753],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996747,0.00005760511,0.000033219374,0.000053009742,0.0001435965,0.000037899386],"domain_scores_gemma":[0.97311723,0.01984855,0.0039292388,0.0008695771,0.0015345933,0.00070082204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003995982,0.0002319302,0.0001762391,0.0008123005,0.000103491504,0.0007151687,0.00018443727,0.00035099126,0.0019429132],"category_scores_gemma":[0.026711049,0.00016160404,0.00018507073,0.0005576209,0.00020963169,0.00087873876,0.00037661186,0.00024768777,0.00035763741],"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.0042143217,0.00046640416,0.8108705,0.0001661117,0.00016321447,0.00040290513,0.00067958864,0.038122073,0.0664191,0.0005254483,0.000964178,0.07700613],"study_design_scores_gemma":[0.000039117782,0.00085861306,0.91409236,0.000023119255,0.000034882676,0.00054043863,0.00016668723,0.07427683,0.009153493,0.00051516225,0.0002588334,0.00004039837],"about_ca_topic_score_codex":0.0027683973,"about_ca_topic_score_gemma":0.002170842,"teacher_disagreement_score":0.0027683973,"about_ca_system_score_codex":0.00026092574,"about_ca_system_score_gemma":0.00019680354,"threshold_uncertainty_score":0.006499648},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047452293,0.00071729237,0.86668664,0.0013707101,0.00046293662,0.00041371438,0.0010888722,0.05512967,0.026677812],"genre_scores_gemma":[0.21065283,0.0012278612,0.721713,0.0013785592,0.000111238616,0.0013050603,0.005838612,0.020200245,0.037572596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993236,0.00022993503,0.000029144549,0.00013513728,0.0001983847,0.000083807645],"domain_scores_gemma":[0.99887985,0.00059295923,0.0000607412,0.00017169096,0.00016392276,0.0001307911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017473792,0.0007024214,0.00034551084,0.00045684123,0.00048073166,0.00106232,0.0014649691,0.00095610676,0.0063640587],"category_scores_gemma":[0.003282312,0.00043107558,0.0007120832,0.00027435448,0.0014962144,0.001708958,0.0018054998,0.0019760563,0.0018289291],"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.0010608037,0.0005094381,0.0036240253,0.0012225552,0.00014953646,0.0008216831,0.0024118684,0.099535584,0.055338435,0.36573362,0.11553153,0.35406098],"study_design_scores_gemma":[0.00054851465,0.00085623196,0.0014695415,0.0003576898,0.00007112872,0.0011514281,0.00030024766,0.29198262,0.046954345,0.057458114,0.5987002,0.00014990038],"about_ca_topic_score_codex":0.0019934895,"about_ca_topic_score_gemma":0.0012573884,"teacher_disagreement_score":0.0063640587,"about_ca_system_score_codex":0.0008036271,"about_ca_system_score_gemma":0.0011734533,"threshold_uncertainty_score":0.021289885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21628045,0.013245283,0.6213116,0.017316472,0.0007902375,0.00009367183,0.0008388001,0.0008146865,0.12930888],"genre_scores_gemma":[0.9713987,0.0024164405,0.017106434,0.00032810034,0.0004955902,0.00007140082,0.00015035474,0.00007400603,0.007958883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980704,0.0006773131,0.000108783235,0.0004098153,0.0005050437,0.00022869663],"domain_scores_gemma":[0.9932808,0.004632008,0.00039537717,0.00075335527,0.0005965166,0.0003419851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018283798,0.00061631505,0.0009753128,0.0015808963,0.0016815084,0.005754048,0.0012798693,0.0015793277,0.005827723],"category_scores_gemma":[0.011239779,0.000520064,0.0007638646,0.001856283,0.009043351,0.01212154,0.002496817,0.0029454133,0.0005744669],"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.000017732786,0.0000046465834,0.000058584053,0.00001468383,0.0000023053447,0.000009689965,0.0000877062,0.0012029292,0.000081840415,0.9964288,0.0002672136,0.0018238883],"study_design_scores_gemma":[0.000004459339,0.0000042907955,0.000022578633,0.0000043130726,0.0000014708621,0.0000067068495,0.000023277793,0.0020858957,0.00005477697,0.9968778,0.0009115606,0.0000029820899],"about_ca_topic_score_codex":0.0030394124,"about_ca_topic_score_gemma":0.0016230822,"teacher_disagreement_score":0.005827723,"about_ca_system_score_codex":0.003115768,"about_ca_system_score_gemma":0.0016924789,"threshold_uncertainty_score":0.022606611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08299109,0.0016226901,0.835854,0.0067307143,0.0005134357,0.00012780499,0.00005854531,0.0023631523,0.069738485],"genre_scores_gemma":[0.79971355,0.00095539575,0.18866327,0.0007912944,0.00014649902,0.00018571405,0.000053055195,0.00024449022,0.009246661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999218,0.0002403007,0.000036598125,0.00013080119,0.0002574996,0.000116844574],"domain_scores_gemma":[0.9986456,0.00046150017,0.00008027961,0.000510492,0.0001370232,0.00016520527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012056195,0.00039112254,0.00034032747,0.00049982534,0.0010774697,0.002809195,0.0011747355,0.0014488872,0.002195815],"category_scores_gemma":[0.0039927675,0.0003180626,0.00043230684,0.00040725467,0.0055118273,0.0055869524,0.0031792843,0.0027664562,0.00048457115],"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.00009324846,0.000037247646,0.0005040262,0.00007095444,0.000016036338,0.0001778471,0.00082261465,0.019469181,0.006292531,0.9362487,0.0023065233,0.03396112],"study_design_scores_gemma":[0.00006143396,0.00017237583,0.00048449833,0.0000937978,0.000028700057,0.00034384456,0.0004281805,0.18875712,0.015523905,0.69012874,0.10390739,0.00007011089],"about_ca_topic_score_codex":0.0011627,"about_ca_topic_score_gemma":0.0007433234,"teacher_disagreement_score":0.002809195,"about_ca_system_score_codex":0.001090715,"about_ca_system_score_gemma":0.00095948495,"threshold_uncertainty_score":0.007913768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6432419,0.0018083232,0.16413243,0.0027690176,0.00035737714,0.00011455317,0.000687209,0.000570719,0.1863185],"genre_scores_gemma":[0.95810187,0.00094720314,0.013834544,0.00032161002,0.00040156653,0.000076703414,0.0006106229,0.00013716452,0.025568647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946743,0.00012405188,0.000031645188,0.0001091264,0.00014622933,0.00012156864],"domain_scores_gemma":[0.9970246,0.0019191144,0.00035225664,0.0002373541,0.000145902,0.00032074892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063980574,0.00061261974,0.000742533,0.0019922915,0.001651438,0.0030613844,0.0012291553,0.0011419076,0.01598575],"category_scores_gemma":[0.0050896937,0.00047937012,0.00083510857,0.0015040275,0.0028356372,0.005401446,0.0019716271,0.0025711202,0.0010485407],"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.00007443275,0.000040146642,0.00068347994,0.00008723516,0.000013846548,0.00014827149,0.0001854099,0.0030739666,0.0009248961,0.98176414,0.0026721593,0.010332033],"study_design_scores_gemma":[0.000024076664,0.000024317276,0.00034815536,0.000031224266,0.000017000413,0.00022393612,0.0001081095,0.01024727,0.0007310055,0.98430717,0.003927839,0.000010008841],"about_ca_topic_score_codex":0.0007146731,"about_ca_topic_score_gemma":0.0010662682,"teacher_disagreement_score":0.01598575,"about_ca_system_score_codex":0.0015550739,"about_ca_system_score_gemma":0.0003768171,"threshold_uncertainty_score":0.053477705},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06076217,0.02295255,0.2652488,0.03113801,0.0030531823,0.000060919014,0.0004186298,0.00053854444,0.61582714],"genre_scores_gemma":[0.83869916,0.0098979,0.059061617,0.0060238307,0.004331712,0.00015189093,0.00042269778,0.00028962735,0.08112154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992065,0.00029490225,0.00003407379,0.00014144937,0.00020004195,0.00012308711],"domain_scores_gemma":[0.9975896,0.0017068208,0.000104042985,0.00028162744,0.00018172902,0.00013625174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016442094,0.0005939252,0.00066510466,0.0013375169,0.0019126912,0.0026316615,0.0009616388,0.0013422602,0.012533384],"category_scores_gemma":[0.0050001326,0.00035581138,0.00064847025,0.0014111251,0.0072825765,0.011139675,0.003084679,0.0028585475,0.0022115717],"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.000008807228,0.0000061837777,0.000059551476,0.000017736491,0.0000030296453,0.000024890413,0.000054275104,0.00016628375,0.000056378063,0.9913031,0.003499302,0.0048004393],"study_design_scores_gemma":[0.0000036138495,0.000002476754,0.000048491034,0.0000058871533,0.0000014263564,0.000021168915,0.000016096232,0.00030987398,0.000043454274,0.99512154,0.0044238544,0.000002207038],"about_ca_topic_score_codex":0.0011365598,"about_ca_topic_score_gemma":0.001342009,"teacher_disagreement_score":0.012533384,"about_ca_system_score_codex":0.0013053418,"about_ca_system_score_gemma":0.00052517094,"threshold_uncertainty_score":0.04192841},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22866207,0.009221499,0.31955606,0.009854303,0.0016309902,0.00008607054,0.000512742,0.000703951,0.42977226],"genre_scores_gemma":[0.907724,0.0019128923,0.033178803,0.00079913647,0.000816962,0.00006816098,0.00022113557,0.0001676756,0.05511119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890435,0.0003858885,0.00006673545,0.00015446327,0.0003421457,0.00014652906],"domain_scores_gemma":[0.99747,0.0014486213,0.00022993816,0.00038267826,0.0002861239,0.00018265343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011665446,0.0004510459,0.00065658527,0.0015574894,0.0017912731,0.0032942083,0.00096644805,0.0007339722,0.015372131],"category_scores_gemma":[0.0073939064,0.0003681356,0.00059187954,0.0015183548,0.0047184923,0.008085699,0.0023650695,0.002557582,0.0023264815],"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.00001401823,0.00000964873,0.00010612111,0.000022697439,0.000002572152,0.000037604277,0.00006812113,0.0003187934,0.0001504369,0.9926817,0.0012173878,0.005370853],"study_design_scores_gemma":[0.0000048244297,0.000005292085,0.00008258768,0.000008013101,0.0000022910456,0.000064941574,0.000030313082,0.0015458986,0.00014104093,0.9942047,0.0039045885,0.000005418751],"about_ca_topic_score_codex":0.0008620433,"about_ca_topic_score_gemma":0.0014498408,"teacher_disagreement_score":0.015372131,"about_ca_system_score_codex":0.001057159,"about_ca_system_score_gemma":0.0007475138,"threshold_uncertainty_score":0.05142486},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026325523,0.032634355,0.16584998,0.004412199,0.002668005,0.000049897353,0.00025601257,0.0005210339,0.790976],"genre_scores_gemma":[0.13283119,0.07322637,0.10352583,0.003161531,0.006380977,0.00034399977,0.0011869662,0.0011122811,0.67823076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970007,0.000054827793,0.0000157577,0.000051651397,0.0001526378,0.000025038467],"domain_scores_gemma":[0.9997435,0.00013659633,0.000010172642,0.000045699788,0.000049676244,0.000014297538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035254867,0.000864794,0.00059574255,0.0017565181,0.0009566087,0.0035410866,0.0009638182,0.00082564965,0.020537915],"category_scores_gemma":[0.0010707001,0.00039346472,0.0006994445,0.002498449,0.0027335277,0.0068495916,0.0015697477,0.0034621547,0.006285382],"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.000001926941,0.0000057793645,0.000013181732,0.00008061041,0.0000026834437,0.00001005956,0.00006641248,0.0004655288,0.0002018556,0.95975333,0.013840395,0.025558105],"study_design_scores_gemma":[0.0000018022919,0.00000206326,0.000034512483,0.00006166696,0.000002734849,0.00003066435,0.000019318471,0.000920969,0.00017993724,0.8450204,0.15372126,0.0000047162152],"about_ca_topic_score_codex":0.0015493054,"about_ca_topic_score_gemma":0.0022886174,"teacher_disagreement_score":0.020537915,"about_ca_system_score_codex":0.0023704998,"about_ca_system_score_gemma":0.0010977031,"threshold_uncertainty_score":0.068706155},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002447297,0.036004934,0.118449755,0.024468344,0.0029433973,0.00008494711,0.0016250503,0.0053616515,0.8086147],"genre_scores_gemma":[0.1300243,0.023941332,0.09986879,0.006329611,0.0017359193,0.0003654724,0.0033878207,0.0020049177,0.7323418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974066,0.000061380895,0.00001730669,0.00006320811,0.00008705964,0.000030498213],"domain_scores_gemma":[0.99959344,0.00012053257,0.000028032186,0.00009026077,0.00008562467,0.00008204539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052593165,0.00084575015,0.00041974912,0.00085853157,0.0011333072,0.0038641253,0.0012739592,0.0022939774,0.058496926],"category_scores_gemma":[0.0013734428,0.00046978123,0.00033924164,0.0007867932,0.001466471,0.005198006,0.0020271286,0.0015945301,0.030562278],"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.000066344895,0.000034200315,0.00035373433,0.00022697666,0.00001814554,0.00015653738,0.0002991955,0.0009616835,0.00096660404,0.41766185,0.32702136,0.25223327],"study_design_scores_gemma":[0.000015371712,0.0000119861015,0.0002604256,0.00015102635,0.000015370715,0.0002955929,0.00011338244,0.002788317,0.0012185373,0.19403778,0.8010799,0.000012323115],"about_ca_topic_score_codex":0.002531947,"about_ca_topic_score_gemma":0.005312515,"teacher_disagreement_score":0.058496926,"about_ca_system_score_codex":0.0008008101,"about_ca_system_score_gemma":0.00092379865,"threshold_uncertainty_score":0.1956917},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36836058,0.007196546,0.38605055,0.0072294027,0.00068140466,0.0001159267,0.00089163025,0.00038247457,0.22909151],"genre_scores_gemma":[0.94430524,0.0020546438,0.03769587,0.00051323767,0.0006006526,0.00011336351,0.00029129337,0.00005174493,0.014373976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860126,0.0004249479,0.000106370695,0.00029441406,0.000417841,0.00015513213],"domain_scores_gemma":[0.9980683,0.0008576114,0.00014532651,0.00030299075,0.00032169552,0.00030411518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017667506,0.0004685886,0.00061278784,0.0011752392,0.0016566347,0.0038594182,0.0005692128,0.0008501018,0.0036123353],"category_scores_gemma":[0.002535941,0.00032011754,0.00088403677,0.0010480868,0.0055195536,0.006967256,0.003714038,0.0017683231,0.0004962473],"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.0000072811713,0.000002704717,0.00013232711,0.000019280207,0.0000029553003,0.000027941276,0.00018811118,0.00028776465,0.00025834548,0.997486,0.0003045584,0.0012826599],"study_design_scores_gemma":[0.000006098909,0.000019750103,0.00031637136,0.000010378226,0.0000046524824,0.00008419091,0.000119365366,0.0015459965,0.00030198903,0.9910793,0.006501661,0.000010286048],"about_ca_topic_score_codex":0.00062311237,"about_ca_topic_score_gemma":0.00048262152,"teacher_disagreement_score":0.0038594182,"about_ca_system_score_codex":0.0014300492,"about_ca_system_score_gemma":0.0005994813,"threshold_uncertainty_score":0.012084484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04768618,0.0017331693,0.9115059,0.0013258491,0.0004228462,0.00026988355,0.0015021439,0.008257779,0.027296312],"genre_scores_gemma":[0.3836449,0.00068456435,0.5954526,0.000512311,0.0003136821,0.00026526145,0.00276364,0.0013697497,0.014993284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983198,0.00029004767,0.00013152232,0.00034053883,0.0007074425,0.00021070128],"domain_scores_gemma":[0.9964187,0.001045228,0.00012067535,0.0019443529,0.00035325228,0.00011772566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096869137,0.001071496,0.0015758219,0.001638258,0.0012643093,0.0029588551,0.0027934455,0.0013299077,0.015244284],"category_scores_gemma":[0.007676953,0.0006293524,0.0010997164,0.0036702538,0.0015786603,0.0077501303,0.004456739,0.0022336417,0.0039021054],"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.0010153296,0.00023822684,0.0014474014,0.00040298764,0.00012602963,0.00022765914,0.00033016613,0.04406271,0.009659033,0.2882509,0.032277696,0.6219619],"study_design_scores_gemma":[0.00013971838,0.00011936009,0.0005367016,0.00006579085,0.00007894556,0.00023151713,0.00012393613,0.25328916,0.010943935,0.71491635,0.019506363,0.000048104714],"about_ca_topic_score_codex":0.002568453,"about_ca_topic_score_gemma":0.005357695,"teacher_disagreement_score":0.015244284,"about_ca_system_score_codex":0.0013635202,"about_ca_system_score_gemma":0.0018872676,"threshold_uncertainty_score":0.050997198},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26487544,0.008184519,0.24896626,0.013689377,0.00148087,0.000086810775,0.0014080122,0.0008057702,0.4605029],"genre_scores_gemma":[0.90879405,0.0030743647,0.040030375,0.001310654,0.0009124191,0.00016290894,0.0006405898,0.00022516065,0.04484946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912184,0.00031956742,0.000047569945,0.00018672993,0.00017291316,0.00015144452],"domain_scores_gemma":[0.9961242,0.0024550883,0.00037104893,0.00035280804,0.0003258533,0.00037092896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017248254,0.00059546524,0.00060903066,0.0023305113,0.0019114247,0.002820284,0.0009220536,0.0012891275,0.013136148],"category_scores_gemma":[0.008289936,0.00042355253,0.00048650225,0.0013383784,0.0033732266,0.00989755,0.003191283,0.0025996098,0.0023443755],"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.000057419235,0.000013455022,0.00024719632,0.00004245214,0.000006605054,0.00004425241,0.0001270594,0.0010077903,0.00025131597,0.98491514,0.0052448576,0.008042368],"study_design_scores_gemma":[0.000010056778,0.000009791443,0.00031013077,0.000029856046,0.0000064125293,0.00008621323,0.000074101896,0.0034494437,0.00018965075,0.9905365,0.0052864635,0.000011408437],"about_ca_topic_score_codex":0.0015034991,"about_ca_topic_score_gemma":0.0020903572,"teacher_disagreement_score":0.013136148,"about_ca_system_score_codex":0.001621485,"about_ca_system_score_gemma":0.0006707678,"threshold_uncertainty_score":0.043944776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5216036,0.0053999685,0.14067487,0.01582357,0.001151494,0.00010437557,0.0013481189,0.0005897645,0.31330425],"genre_scores_gemma":[0.9519572,0.0016150721,0.022611793,0.00093738956,0.00051446824,0.00011628812,0.0004235799,0.00012547511,0.02169868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990947,0.00032317362,0.000041690022,0.00018289233,0.00018755886,0.00016996889],"domain_scores_gemma":[0.992255,0.005203128,0.0008633073,0.000513034,0.0004660561,0.0006995394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019203915,0.0005832926,0.00055245624,0.0023750735,0.0016825172,0.0026487315,0.0010698604,0.0013451307,0.0117142275],"category_scores_gemma":[0.010391344,0.00039042573,0.00049923226,0.0010996556,0.0033327213,0.008843493,0.0031070183,0.0026690757,0.0014638116],"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.00016628986,0.000029127037,0.00055791426,0.00004954142,0.000009788945,0.00007766299,0.00023663352,0.0022522372,0.00049749535,0.98230493,0.005586176,0.008232168],"study_design_scores_gemma":[0.00003060325,0.000022077364,0.00093747803,0.0000573702,0.000010671701,0.00013977788,0.00016677023,0.0110429255,0.00043150276,0.9823741,0.00476265,0.00002408219],"about_ca_topic_score_codex":0.0018294479,"about_ca_topic_score_gemma":0.002668747,"teacher_disagreement_score":0.0117142275,"about_ca_system_score_codex":0.0019486989,"about_ca_system_score_gemma":0.0008578962,"threshold_uncertainty_score":0.039187968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16544132,0.0058331448,0.43628868,0.003929598,0.0010308692,0.00012809521,0.0015511988,0.0010557884,0.38474137],"genre_scores_gemma":[0.871757,0.0023224037,0.074361086,0.00057761086,0.0007149738,0.00013213129,0.0010042739,0.00025648688,0.04887404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990337,0.0002775826,0.00008665081,0.00016428134,0.00029177289,0.00014597962],"domain_scores_gemma":[0.99841917,0.00065221556,0.00020163212,0.0003336822,0.00024386277,0.00014941691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006759929,0.00053384725,0.0005084642,0.0027866832,0.0018354807,0.0048452048,0.00076921046,0.0008734197,0.01335905],"category_scores_gemma":[0.00312068,0.00040213106,0.0007646752,0.002370846,0.0037029947,0.007371078,0.0030477857,0.002236633,0.00261648],"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.000007600157,0.000004838063,0.000121314086,0.0000217521,0.0000037712375,0.000037332164,0.000115050156,0.00020274325,0.00030390988,0.9941848,0.0007852405,0.0042117224],"study_design_scores_gemma":[0.000003887029,0.0000054616407,0.00017334436,0.000021365595,0.0000043866685,0.00012875201,0.000115781884,0.001752185,0.0003845336,0.9879711,0.009431305,0.000007919518],"about_ca_topic_score_codex":0.0009347844,"about_ca_topic_score_gemma":0.0009974189,"teacher_disagreement_score":0.01335905,"about_ca_system_score_codex":0.0012809174,"about_ca_system_score_gemma":0.0005418373,"threshold_uncertainty_score":0.04469043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20185223,0.0043403963,0.65067035,0.04226611,0.0006871349,0.0003869184,0.005882095,0.0022722797,0.09164256],"genre_scores_gemma":[0.8427675,0.0021493856,0.13056047,0.0018994854,0.0012477401,0.00041490808,0.0032855237,0.0008037398,0.01687134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961189,0.0013100764,0.00016714924,0.0010094339,0.00096534565,0.00042910432],"domain_scores_gemma":[0.95459396,0.03740571,0.0011214268,0.0045821657,0.0011653324,0.001131428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027498887,0.0008584024,0.0017966768,0.0010244391,0.0010488009,0.0052820505,0.0051248935,0.0034266817,0.019602781],"category_scores_gemma":[0.030497229,0.00069379684,0.0011941998,0.0020813923,0.0024484128,0.014699317,0.0021256518,0.0052730837,0.0014537618],"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.0012637748,0.00047899323,0.0030796647,0.0011109135,0.00014978078,0.00020751636,0.00033522103,0.08017034,0.0073140603,0.72224617,0.036125857,0.1475178],"study_design_scores_gemma":[0.00019691285,0.00008603117,0.00097045995,0.000064052736,0.00006229983,0.00025849047,0.00009352009,0.13114576,0.0029171037,0.8580447,0.006134528,0.000026130823],"about_ca_topic_score_codex":0.0011333973,"about_ca_topic_score_gemma":0.0014991487,"teacher_disagreement_score":0.019602781,"about_ca_system_score_codex":0.002507465,"about_ca_system_score_gemma":0.0022274663,"threshold_uncertainty_score":0.065577805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17712846,0.0006306305,0.8014786,0.005785967,0.0001192954,0.0002252682,0.0001650071,0.0003672543,0.01409952],"genre_scores_gemma":[0.8869905,0.00015436669,0.10731234,0.00055393984,0.00007951309,0.00019926114,0.00017660444,0.000048063943,0.0044853725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98380697,0.010926997,0.0005802659,0.002362801,0.0016200822,0.0007028604],"domain_scores_gemma":[0.8795681,0.08947679,0.013184596,0.011103591,0.0032982354,0.0033687474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018000647,0.00094790437,0.0012634991,0.00057754404,0.0013847649,0.0018165808,0.0032245433,0.003802129,0.005796728],"category_scores_gemma":[0.11966969,0.00070201716,0.0009664319,0.00065281714,0.0041183517,0.0065656337,0.00489876,0.0035562871,0.0009286737],"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.0020118845,0.00096270675,0.025514513,0.0012507064,0.0008731101,0.0027089096,0.00566484,0.16124202,0.012815266,0.523728,0.0075101345,0.255718],"study_design_scores_gemma":[0.00034401746,0.0007875228,0.0030686953,0.00011708731,0.00014005059,0.0008437468,0.0007547256,0.373592,0.0060644946,0.6059027,0.0082889525,0.00009599116],"about_ca_topic_score_codex":0.0007119641,"about_ca_topic_score_gemma":0.0008972201,"teacher_disagreement_score":0.018000647,"about_ca_system_score_codex":0.0010685567,"about_ca_system_score_gemma":0.0010018421,"threshold_uncertainty_score":0.09519768},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61846817,0.0024538538,0.2640899,0.007986675,0.00058510946,0.00012216331,0.0006631221,0.0013012232,0.10432973],"genre_scores_gemma":[0.9779593,0.0005635309,0.01369817,0.00039129445,0.00031372858,0.00007808265,0.00023780606,0.00018646716,0.0065717273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982918,0.00028885063,0.00011150032,0.00046420863,0.0004982175,0.00034540577],"domain_scores_gemma":[0.9748787,0.02008249,0.001012792,0.0017160873,0.0012502162,0.001059649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021101919,0.0010585341,0.0015763515,0.0045510023,0.0025448655,0.007297477,0.0014278854,0.0021725409,0.009377672],"category_scores_gemma":[0.028137455,0.0008977665,0.00100906,0.0023428325,0.0067200353,0.018503474,0.0039095576,0.005330592,0.0009292574],"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.00015942975,0.000031826195,0.0014445683,0.000119503646,0.000014262837,0.00013176363,0.00039610398,0.0013268688,0.0011420993,0.98619163,0.0012469451,0.0077948794],"study_design_scores_gemma":[0.000026713054,0.000011794319,0.00028981362,0.000029495572,0.000012226291,0.0000828182,0.0000594059,0.0059342734,0.00077207386,0.99150497,0.0012644012,0.000011900752],"about_ca_topic_score_codex":0.0010819173,"about_ca_topic_score_gemma":0.0011167438,"teacher_disagreement_score":0.009377672,"about_ca_system_score_codex":0.0035124912,"about_ca_system_score_gemma":0.0014808521,"threshold_uncertainty_score":0.031371415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16797137,0.008711598,0.51042825,0.008795574,0.0009997191,0.00016396973,0.0011441174,0.0010430998,0.30074227],"genre_scores_gemma":[0.88343793,0.003225325,0.047438547,0.002931957,0.0022322878,0.000305274,0.0007957456,0.00083182065,0.05880113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803966,0.00043142555,0.00007356773,0.0005440289,0.00062195404,0.00028937618],"domain_scores_gemma":[0.99530494,0.0025326582,0.0005480461,0.0007066162,0.000559658,0.0003480929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018179424,0.0012068052,0.001052179,0.0023209355,0.0015031835,0.0029087355,0.0012384558,0.0015591237,0.015699139],"category_scores_gemma":[0.012341446,0.00059300236,0.0012551902,0.0011187643,0.004890279,0.0071038906,0.0041527483,0.0037910196,0.002400751],"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.000048974554,0.000012518565,0.00041712975,0.00006494525,0.000012140505,0.00007280755,0.00017983215,0.0014825228,0.0014261946,0.9838938,0.002816863,0.00957217],"study_design_scores_gemma":[0.000020476726,0.000043315464,0.00082889193,0.000045398203,0.000020499938,0.0003681544,0.00009056987,0.01781984,0.0022795226,0.9650092,0.013446215,0.000027843831],"about_ca_topic_score_codex":0.0013407941,"about_ca_topic_score_gemma":0.00076971314,"teacher_disagreement_score":0.015699139,"about_ca_system_score_codex":0.0022182951,"about_ca_system_score_gemma":0.00065537734,"threshold_uncertainty_score":0.052518904},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1223346,0.0053543877,0.27536634,0.10538216,0.0050291857,0.0002428465,0.0042896587,0.0018492035,0.48015156],"genre_scores_gemma":[0.8539632,0.004141432,0.06212906,0.015294115,0.0052501373,0.00045708538,0.0025230367,0.0007411803,0.055500742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966768,0.00071979355,0.00017910758,0.0007735743,0.001119801,0.00053100375],"domain_scores_gemma":[0.9715921,0.021878252,0.0009511646,0.0028187733,0.0016518331,0.0011078244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028695986,0.0013518841,0.0013341252,0.002243807,0.0026086434,0.0051450194,0.0038019505,0.003724845,0.0436339],"category_scores_gemma":[0.02103742,0.00062276894,0.0019702034,0.002549075,0.0058241906,0.019842172,0.0055654314,0.007909551,0.0038706758],"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.0001870136,0.00007712907,0.0009401641,0.00027844546,0.000036866033,0.00036307893,0.0003015521,0.0038974755,0.0009550628,0.95464957,0.027440256,0.010873411],"study_design_scores_gemma":[0.000016810434,0.000016669152,0.00044281254,0.000024420764,0.000010352569,0.0001307332,0.00009182401,0.002795154,0.00034817567,0.9901653,0.0059381016,0.000019703608],"about_ca_topic_score_codex":0.0023928643,"about_ca_topic_score_gemma":0.0023423398,"teacher_disagreement_score":0.0436339,"about_ca_system_score_codex":0.0021860723,"about_ca_system_score_gemma":0.0008971141,"threshold_uncertainty_score":0.14596999},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08480141,0.0020002394,0.64819455,0.021123698,0.0030441082,0.0007514352,0.0087167965,0.004897511,0.22647025],"genre_scores_gemma":[0.781453,0.0014095264,0.17144352,0.00499233,0.0017493877,0.0008276027,0.01000648,0.00092998764,0.0271881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994995,0.0010181335,0.0006219892,0.0014078624,0.0011496491,0.00080743025],"domain_scores_gemma":[0.9625531,0.022064019,0.0014270076,0.0052517233,0.0064908657,0.0022133186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004197657,0.00083641586,0.00177274,0.002093095,0.00365487,0.004604842,0.0023871867,0.0051238895,0.045744844],"category_scores_gemma":[0.03923489,0.0014705629,0.003042062,0.0018088442,0.005964545,0.013049482,0.0059207967,0.008632727,0.010506834],"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.00034213334,0.00017366027,0.0016390976,0.00040091405,0.00006991495,0.0005698874,0.00039705125,0.0017598296,0.005537061,0.95880926,0.016145078,0.014156159],"study_design_scores_gemma":[0.00024183483,0.00016505376,0.0015640925,0.00030202986,0.0001117257,0.001858841,0.0006752737,0.015265618,0.013486053,0.92267525,0.04354462,0.00010952169],"about_ca_topic_score_codex":0.0013318324,"about_ca_topic_score_gemma":0.001796186,"teacher_disagreement_score":0.045744844,"about_ca_system_score_codex":0.0014852372,"about_ca_system_score_gemma":0.0035831614,"threshold_uncertainty_score":0.1530317},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022810405,0.19003361,0.23215756,0.13409464,0.006372175,0.000090167334,0.0008460911,0.00028634793,0.413309],"genre_scores_gemma":[0.7737494,0.10059812,0.062143963,0.019502375,0.009276614,0.0003708162,0.00044514157,0.00021241154,0.03370123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988049,0.0004269668,0.000047853344,0.00024196874,0.00035497296,0.00012338298],"domain_scores_gemma":[0.9942222,0.004627572,0.00033105735,0.00030638362,0.00030499915,0.00020777505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014331151,0.00074612355,0.00079598627,0.0023110402,0.0011642311,0.004421966,0.0012658981,0.003421265,0.011777465],"category_scores_gemma":[0.006021692,0.0002688012,0.0006425593,0.0030572717,0.00740743,0.011438234,0.0021074763,0.0041145477,0.0013942145],"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.000004701982,0.0000060871494,0.00009645011,0.00008221745,0.0000060255115,0.000032474818,0.000052439522,0.00025993766,0.0000846316,0.9909576,0.0031598294,0.00525748],"study_design_scores_gemma":[0.0000017948854,0.0000059915847,0.00012953216,0.000043897686,0.000003634638,0.00007489592,0.00006344489,0.00073755416,0.00006318199,0.98298657,0.015885042,0.000004458385],"about_ca_topic_score_codex":0.0011090883,"about_ca_topic_score_gemma":0.001093957,"teacher_disagreement_score":0.011777465,"about_ca_system_score_codex":0.0023956732,"about_ca_system_score_gemma":0.00069920457,"threshold_uncertainty_score":0.039399505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19020547,0.0009786754,0.7647479,0.006176566,0.00017579095,0.0004200581,0.002744805,0.002300628,0.03225012],"genre_scores_gemma":[0.823849,0.0006892064,0.16036972,0.00070507155,0.00030436675,0.00044315224,0.0026189068,0.00073271245,0.010287829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753016,0.00061988895,0.00013001946,0.0007560668,0.00061504496,0.00034889078],"domain_scores_gemma":[0.98526615,0.01146652,0.00068704475,0.0014925466,0.000559211,0.0005284732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015068,0.0008454996,0.0012036344,0.000783201,0.0007683453,0.0030460793,0.0029937567,0.0020217386,0.010464622],"category_scores_gemma":[0.016163243,0.00047252845,0.0012735189,0.0012869714,0.001851313,0.009210789,0.0020356392,0.0035414838,0.0006901418],"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.00075146195,0.00043398593,0.0024746305,0.0007285148,0.00014661903,0.00024382441,0.00029982708,0.3350758,0.012547942,0.53656936,0.013293242,0.09743482],"study_design_scores_gemma":[0.00013372365,0.00018920474,0.000874526,0.00004280403,0.00006336562,0.0002106621,0.00008927816,0.44103417,0.007863119,0.54425174,0.0052141836,0.000033254495],"about_ca_topic_score_codex":0.0016404627,"about_ca_topic_score_gemma":0.0019233072,"teacher_disagreement_score":0.010464622,"about_ca_system_score_codex":0.002091133,"about_ca_system_score_gemma":0.0021718794,"threshold_uncertainty_score":0.035007596},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12918696,0.014108297,0.38907135,0.005654295,0.0017076505,0.00011997651,0.0010166513,0.00077724206,0.4583576],"genre_scores_gemma":[0.897149,0.0024969177,0.040258273,0.0006264509,0.0011280337,0.00015045363,0.00051681884,0.00021640978,0.057457626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877197,0.0003551024,0.00009773618,0.00020013942,0.00041180736,0.0001632198],"domain_scores_gemma":[0.9964684,0.0019241739,0.00037946008,0.00042332956,0.0006040247,0.0002006707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014069418,0.0005145079,0.00079831673,0.0024072153,0.0016268921,0.0038422681,0.0009060432,0.00088724814,0.010800053],"category_scores_gemma":[0.010645804,0.00041612226,0.00091187324,0.0017739792,0.0027264734,0.005692926,0.0014476073,0.0026256668,0.0021820175],"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.000009329772,0.000006156725,0.00013660666,0.000017128521,0.0000034829645,0.000041089148,0.000104493825,0.00031248975,0.000137416,0.99394095,0.0013664712,0.0039244103],"study_design_scores_gemma":[0.0000051271227,0.0000047124563,0.00013140732,0.000010256021,0.000005122695,0.00009997371,0.000028063694,0.003538481,0.00020960237,0.9917653,0.004193091,0.00000868086],"about_ca_topic_score_codex":0.0022397893,"about_ca_topic_score_gemma":0.0029935006,"teacher_disagreement_score":0.010800053,"about_ca_system_score_codex":0.0022762213,"about_ca_system_score_gemma":0.0009549128,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22307794,0.002130422,0.19581702,0.002610839,0.0023935006,0.00015782686,0.0011402256,0.001936979,0.5707353],"genre_scores_gemma":[0.8710022,0.00083710504,0.046374563,0.0011806475,0.0006652057,0.00021595368,0.0007918408,0.00080153084,0.07813094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912554,0.00014231657,0.000055746747,0.00017066022,0.00023911447,0.00026654344],"domain_scores_gemma":[0.99868494,0.0003556627,0.00015833143,0.00031475985,0.00020277663,0.00028352617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067097467,0.0005901215,0.00082014815,0.002313981,0.003055374,0.0044591604,0.0014390437,0.0012457749,0.029638682],"category_scores_gemma":[0.004511801,0.00037782136,0.00063635886,0.001982032,0.0031698775,0.007056645,0.0034301989,0.002453391,0.006110922],"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.00009913895,0.000025262803,0.0002660507,0.000042516873,0.0000068910904,0.00006021402,0.00011437058,0.00037688343,0.00088560855,0.977005,0.004503191,0.016614832],"study_design_scores_gemma":[0.000013734235,0.000032790555,0.00027357077,0.000033192424,0.0000106782745,0.00016441233,0.000080160185,0.0034866238,0.0016451223,0.97625834,0.017982768,0.00001852509],"about_ca_topic_score_codex":0.00081514416,"about_ca_topic_score_gemma":0.00095998595,"teacher_disagreement_score":0.029638682,"about_ca_system_score_codex":0.0014086256,"about_ca_system_score_gemma":0.0009462625,"threshold_uncertainty_score":0.09915125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12715837,0.0024458072,0.5817521,0.0060865134,0.00083214394,0.00017463374,0.0018972383,0.0030382543,0.27661493],"genre_scores_gemma":[0.7917658,0.0014230649,0.13415179,0.0010531867,0.0006295009,0.00023396035,0.001275618,0.0008028598,0.06866425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773514,0.0005268769,0.00015139984,0.00039792835,0.0008494815,0.00033915983],"domain_scores_gemma":[0.99779725,0.0009444169,0.00015809447,0.00041637413,0.00048500384,0.00019891158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013992564,0.00065792823,0.0005402837,0.002644958,0.002621967,0.0049859397,0.0011215113,0.0010884098,0.017955083],"category_scores_gemma":[0.005296441,0.00052649516,0.0016963038,0.0023672634,0.004880762,0.008413559,0.0037704704,0.0030191937,0.0022065288],"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.000010773513,0.000008137363,0.00009935902,0.000039366852,0.0000031280733,0.000078994504,0.00018610213,0.0005909766,0.00032072628,0.99378186,0.0012034378,0.0036769854],"study_design_scores_gemma":[0.000016381073,0.00001828159,0.0001852642,0.00003454838,0.000012958978,0.00013647818,0.00021310688,0.0041578957,0.00140803,0.9654247,0.028363839,0.000028562397],"about_ca_topic_score_codex":0.0020138486,"about_ca_topic_score_gemma":0.0026996352,"teacher_disagreement_score":0.017955083,"about_ca_system_score_codex":0.0031313181,"about_ca_system_score_gemma":0.001032987,"threshold_uncertainty_score":0.060065746},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030811451,0.03782484,0.114669256,0.1609617,0.0018725973,0.00009254539,0.000122637,0.00032712801,0.65331787],"genre_scores_gemma":[0.84427035,0.016357645,0.05457544,0.007651505,0.0009962883,0.00016129714,0.00006370746,0.00021008604,0.07571363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915767,0.00048993895,0.000022641067,0.00013345489,0.00013404957,0.00006236447],"domain_scores_gemma":[0.9984561,0.0010459189,0.000071937626,0.00018293361,0.00012469065,0.000118402335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002269515,0.00043504292,0.00045170874,0.001275311,0.0033907017,0.003413684,0.0011915126,0.0034563981,0.0040561925],"category_scores_gemma":[0.0069859596,0.00033917403,0.0003947948,0.0010935814,0.012169293,0.009986403,0.0024886192,0.003630908,0.0009226948],"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.000010244848,0.000003912439,0.00007303298,0.000010828779,0.000002536796,0.00010450222,0.0010084079,0.00074260763,0.000031579744,0.9892697,0.005243024,0.0034997554],"study_design_scores_gemma":[0.0000071661743,0.0000051052434,0.00006094461,0.000033713575,0.0000037082934,0.000111192596,0.00018200358,0.0026438115,0.000061842096,0.94609267,0.050786756,0.000011131307],"about_ca_topic_score_codex":0.019301798,"about_ca_topic_score_gemma":0.016291117,"teacher_disagreement_score":0.019301798,"about_ca_system_score_codex":0.0027888997,"about_ca_system_score_gemma":0.0020332392,"threshold_uncertainty_score":0.038378894},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17919824,0.0020150156,0.18606263,0.021590697,0.0025205475,0.00018200927,0.0007383252,0.0007890568,0.60690343],"genre_scores_gemma":[0.7124845,0.0025194073,0.05434462,0.0010984885,0.0010227287,0.00032304064,0.0007774821,0.00047715497,0.22695264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998118,0.00002970181,0.0000084535195,0.00003192011,0.000071226896,0.000046806854],"domain_scores_gemma":[0.99943787,0.00027082942,0.00006995249,0.000033073036,0.00009818393,0.00009004453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039474288,0.00079471717,0.0005492082,0.0006534461,0.00076015503,0.0024284374,0.00072746404,0.0011842167,0.05902786],"category_scores_gemma":[0.0032936712,0.0002176137,0.00058538455,0.000719568,0.0011269437,0.0016612547,0.0012535488,0.0015418857,0.005724221],"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.0002015145,0.000097427175,0.0008641853,0.00017114222,0.000021941225,0.0006667082,0.00020082325,0.008706883,0.005481753,0.86018074,0.07926318,0.044143774],"study_design_scores_gemma":[0.00013660909,0.000078539844,0.001062213,0.000110513516,0.000025700636,0.0010132855,0.00051499484,0.051709335,0.0042683217,0.9022502,0.038776778,0.000053497493],"about_ca_topic_score_codex":0.0005805596,"about_ca_topic_score_gemma":0.0007012903,"teacher_disagreement_score":0.05902786,"about_ca_system_score_codex":0.00076274696,"about_ca_system_score_gemma":0.00042814194,"threshold_uncertainty_score":0.19746786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04392075,0.0023040557,0.9247241,0.0035322537,0.00043656275,0.00018277887,0.00031762946,0.0009739838,0.023607923],"genre_scores_gemma":[0.7323365,0.0016812136,0.25521848,0.0014963809,0.0006271079,0.00040443975,0.00036195223,0.00041680457,0.007457087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918358,0.0033184302,0.0006276543,0.0018469669,0.0016205268,0.0007506597],"domain_scores_gemma":[0.9718071,0.019341588,0.0018559956,0.005272413,0.0012048106,0.0005179939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071569243,0.0010248525,0.0013616756,0.0013864798,0.0011701571,0.0057791066,0.0028085983,0.0026600119,0.0074125854],"category_scores_gemma":[0.040864382,0.00065286696,0.0021345182,0.001669321,0.011943749,0.018724786,0.0040813,0.004338166,0.0012277635],"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.00006323902,0.000014955861,0.00035718974,0.00009795949,0.000019296398,0.00006003485,0.00013406022,0.0053868555,0.0005361227,0.9852926,0.0004683398,0.0075693517],"study_design_scores_gemma":[0.000021122734,0.000043424443,0.000178904,0.000038338534,0.000020129175,0.000062284205,0.000042940806,0.031058237,0.0015874371,0.9632868,0.0036350193,0.000025386884],"about_ca_topic_score_codex":0.0009954699,"about_ca_topic_score_gemma":0.0004622558,"teacher_disagreement_score":0.0074125854,"about_ca_system_score_codex":0.0018816985,"about_ca_system_score_gemma":0.0010266345,"threshold_uncertainty_score":0.037849903},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048929457,0.026256165,0.191931,0.006030996,0.0010649534,0.000043061893,0.0004517604,0.00053913135,0.72475356],"genre_scores_gemma":[0.7083753,0.022358539,0.059383124,0.0009133589,0.002117216,0.00014658736,0.00070780085,0.00024241416,0.20575581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997069,0.000066433,0.00001936479,0.000050793486,0.00012043192,0.00003606699],"domain_scores_gemma":[0.99960154,0.00018864071,0.000032907945,0.000087733024,0.00005159339,0.00003759288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054663094,0.0005392447,0.00051337236,0.0012057705,0.00075899035,0.0043241233,0.0005557482,0.0007711473,0.0077612414],"category_scores_gemma":[0.0014608664,0.0002706992,0.00032196593,0.0018680211,0.0032492622,0.007506871,0.0011616306,0.0027010234,0.0011253909],"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.000003088514,0.0000029196099,0.000021014615,0.000020289897,0.000001197936,0.0000070107167,0.000100276266,0.00024150626,0.00009727575,0.98787665,0.0018306818,0.009797935],"study_design_scores_gemma":[0.0000025341392,0.0000023742664,0.000033920544,0.000017936274,0.0000016744925,0.000024509109,0.000029990839,0.00059549586,0.00006164863,0.9791443,0.02008318,0.0000024884282],"about_ca_topic_score_codex":0.0009206889,"about_ca_topic_score_gemma":0.0009283013,"teacher_disagreement_score":0.0077612414,"about_ca_system_score_codex":0.0014227342,"about_ca_system_score_gemma":0.0006160702,"threshold_uncertainty_score":0.025963962},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014489648,0.04567918,0.045712344,0.005667646,0.005043806,0.00006736972,0.0005146144,0.00053592405,0.8953301],"genre_scores_gemma":[0.041031983,0.078833364,0.0502168,0.003202968,0.010094293,0.00036122862,0.0010016924,0.00064617826,0.81461143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995968,0.0000539778,0.00001996775,0.00006358514,0.00022881865,0.0000368593],"domain_scores_gemma":[0.9995459,0.00021247617,0.000021836591,0.000066113455,0.000090603084,0.00006315007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039931512,0.0012469016,0.0009997269,0.0017068898,0.0010102262,0.0029152413,0.00094905164,0.00072002306,0.042987842],"category_scores_gemma":[0.0011010031,0.00043849912,0.0004341106,0.0024485153,0.0015889512,0.0027222976,0.0010341095,0.004198907,0.020804374],"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.000017166121,0.0000639894,0.00017610726,0.000552851,0.000010908963,0.00003938725,0.00023788417,0.00087425654,0.0010071014,0.49816853,0.23874591,0.26010585],"study_design_scores_gemma":[0.00001033087,0.00001853298,0.00047822722,0.0001964502,0.00000604458,0.00010951194,0.00006335925,0.0012480961,0.0002819819,0.25192744,0.74565095,0.00000908217],"about_ca_topic_score_codex":0.0009370713,"about_ca_topic_score_gemma":0.0017521065,"teacher_disagreement_score":0.042987842,"about_ca_system_score_codex":0.0021001857,"about_ca_system_score_gemma":0.0018680905,"threshold_uncertainty_score":0.14380872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016542141,0.0795809,0.039590612,0.04915786,0.0047328467,0.000045776833,0.00054403086,0.00060279545,0.82409084],"genre_scores_gemma":[0.04133125,0.050093886,0.014634373,0.012393727,0.0037277504,0.00009115182,0.00058755383,0.0008323513,0.8763078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995358,0.00009517446,0.000016659244,0.00008529358,0.00021941717,0.00004771281],"domain_scores_gemma":[0.99913424,0.0004373727,0.000018688073,0.00012193106,0.00019364378,0.000094066054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006972808,0.0008285543,0.0006225951,0.001838359,0.001434559,0.0042650355,0.0008547915,0.0013036211,0.045721836],"category_scores_gemma":[0.0023115845,0.00038395333,0.00057952886,0.0029920707,0.003351398,0.0073698564,0.0013418096,0.0042086956,0.01456387],"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.00001472684,0.000012864582,0.000067528796,0.00014353442,0.0000045455204,0.000037260666,0.00030690327,0.00037468568,0.0003430985,0.66432947,0.29021364,0.044151764],"study_design_scores_gemma":[0.0000037305456,0.0000076276638,0.00017385054,0.00016346424,0.000002492468,0.00007675947,0.0001222916,0.00059300644,0.00016841688,0.29866862,0.7000124,0.000007478256],"about_ca_topic_score_codex":0.0031619938,"about_ca_topic_score_gemma":0.004491441,"teacher_disagreement_score":0.045721836,"about_ca_system_score_codex":0.0034471618,"about_ca_system_score_gemma":0.0014128946,"threshold_uncertainty_score":0.15295476},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27516115,0.0111224335,0.20800437,0.0039119874,0.00029623395,0.000034541383,0.00024576677,0.00053849496,0.50068504],"genre_scores_gemma":[0.93133605,0.0033505654,0.018418742,0.00029062186,0.00037697313,0.00006677848,0.00016426369,0.00024874424,0.045747407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996562,0.00010604468,0.000011336571,0.00007562253,0.000105189225,0.00004553962],"domain_scores_gemma":[0.9990785,0.000550716,0.000056085508,0.0001580525,0.000106549494,0.00005001381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000561418,0.000566651,0.0004351543,0.0010952689,0.0007059153,0.0025248227,0.00061549124,0.00063568057,0.0056920242],"category_scores_gemma":[0.003011271,0.00033932494,0.0004470013,0.0010668549,0.0037683449,0.005532816,0.001257961,0.0020485453,0.00070328143],"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.000013710649,0.000003992051,0.00016625579,0.00002373153,0.0000050675976,0.000029363164,0.00031493744,0.0013771902,0.000611751,0.98656845,0.0010445779,0.009840922],"study_design_scores_gemma":[0.0000052872065,0.000007640242,0.00027539048,0.000018061124,0.0000061014603,0.00005097492,0.000079533624,0.003097997,0.0002945253,0.99126315,0.004896412,0.0000049354144],"about_ca_topic_score_codex":0.0005312716,"about_ca_topic_score_gemma":0.00045364708,"teacher_disagreement_score":0.0056920242,"about_ca_system_score_codex":0.00090608903,"about_ca_system_score_gemma":0.00033598952,"threshold_uncertainty_score":0.019041777},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017427202,0.023105215,0.2951623,0.010780048,0.0015946912,0.00006693679,0.00017050024,0.00035475925,0.6513384],"genre_scores_gemma":[0.8181577,0.0155465575,0.071204975,0.00216538,0.0022117204,0.0002250312,0.00017305996,0.00018828257,0.09012739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993957,0.00024953444,0.000024400224,0.00010105668,0.00017100375,0.000058313573],"domain_scores_gemma":[0.9993617,0.00037067203,0.000029400793,0.00014611463,0.000054969154,0.00003721961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007067066,0.00056669256,0.000615757,0.000770556,0.0010231395,0.0053233104,0.001381389,0.0025330563,0.0071548447],"category_scores_gemma":[0.0026314124,0.00041890307,0.00056501036,0.00096887647,0.009065839,0.008666268,0.0017173634,0.0033724303,0.0014670003],"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.000002746862,0.0000025081688,0.000009185453,0.00001577779,8.525587e-7,0.0000070604447,0.000034640354,0.00030697777,0.000069489186,0.9973756,0.0006344993,0.0015406583],"study_design_scores_gemma":[0.0000026572773,0.000002583058,0.000011859809,0.000014533174,0.000001197258,0.00002521017,0.000013373746,0.0018154536,0.00007800432,0.9912047,0.0068276753,0.0000027519518],"about_ca_topic_score_codex":0.0006181608,"about_ca_topic_score_gemma":0.00045722787,"teacher_disagreement_score":0.0071548447,"about_ca_system_score_codex":0.0017449405,"about_ca_system_score_gemma":0.00081564963,"threshold_uncertainty_score":0.023935378},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029519345,0.008008082,0.1790464,0.0030818721,0.000841656,0.00006684315,0.00032860227,0.00036419832,0.8053104],"genre_scores_gemma":[0.21202028,0.017122403,0.096889965,0.001819131,0.0013332319,0.00040886048,0.0014804275,0.00067511055,0.6682506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957603,0.00010799728,0.000015811107,0.000072321076,0.00018297974,0.00004473339],"domain_scores_gemma":[0.9997904,0.00008979171,0.000010885857,0.000046061694,0.00004178176,0.000021130172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003791134,0.0010429765,0.0006871138,0.00085477025,0.0008056467,0.0032883687,0.0011787034,0.0009113651,0.029307483],"category_scores_gemma":[0.0012167773,0.00036977534,0.00068644056,0.0012638926,0.0016915608,0.003033797,0.0012362289,0.0025655474,0.009081244],"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.000005994526,0.00001527367,0.000037737318,0.00006071962,0.000008996404,0.00001569809,0.000056180037,0.0018522094,0.00016007043,0.9336453,0.026733449,0.037408367],"study_design_scores_gemma":[0.000004889536,0.000004382918,0.000054590197,0.0000411784,0.0000042528045,0.00003131878,0.0000261648,0.003128308,0.00008759711,0.89737743,0.09923598,0.000003854721],"about_ca_topic_score_codex":0.00118754,"about_ca_topic_score_gemma":0.0017039744,"teacher_disagreement_score":0.029307483,"about_ca_system_score_codex":0.0017454763,"about_ca_system_score_gemma":0.0011118253,"threshold_uncertainty_score":0.09804332},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01697414,0.06688845,0.08604578,0.008844421,0.0021962598,0.00003519131,0.00011964184,0.00025338467,0.8186426],"genre_scores_gemma":[0.5513741,0.04410885,0.045488693,0.0019520742,0.0039344877,0.00020691969,0.00032583074,0.000304219,0.3523049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977475,0.00006861664,0.000008464492,0.000038978123,0.00008718209,0.000021977761],"domain_scores_gemma":[0.99958795,0.0002550084,0.000018413753,0.000080411555,0.00004008195,0.000018076931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002785499,0.00043494656,0.0004289432,0.0007492697,0.000932843,0.0022376666,0.00069656316,0.00067716744,0.009935546],"category_scores_gemma":[0.0011798582,0.00023923663,0.00037064287,0.0010882522,0.0043898392,0.0044876006,0.0011409362,0.002197733,0.0014903913],"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.0000033194399,0.000003071257,0.000020959329,0.00004493072,0.0000015374228,0.000009599716,0.00006460221,0.00029290325,0.000091585,0.98599666,0.004292632,0.009178157],"study_design_scores_gemma":[0.0000013578651,0.000001400442,0.000036429494,0.000020988718,9.742428e-7,0.000028251383,0.000015256299,0.0005736101,0.000056496865,0.96943754,0.029825952,0.0000017805701],"about_ca_topic_score_codex":0.00063275534,"about_ca_topic_score_gemma":0.0010326791,"teacher_disagreement_score":0.009935546,"about_ca_system_score_codex":0.0014656857,"about_ca_system_score_gemma":0.00055904395,"threshold_uncertainty_score":0.033237755},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13758409,0.013623833,0.34231117,0.023104545,0.000942284,0.0001452728,0.0012365183,0.0008008249,0.48025152],"genre_scores_gemma":[0.92109656,0.008181751,0.025629606,0.0006880877,0.002142173,0.000268473,0.00075933663,0.00024395814,0.040990073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885297,0.00025668778,0.00004586577,0.00017042665,0.0005092152,0.00016475383],"domain_scores_gemma":[0.9929396,0.0054100887,0.00032933432,0.0007324043,0.00039764494,0.00019106272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009911597,0.0007209806,0.00094210333,0.0015815542,0.0013758235,0.00357892,0.0010347965,0.0014509582,0.015776845],"category_scores_gemma":[0.0074334303,0.0005528295,0.0006134833,0.003268984,0.0029451293,0.009234466,0.001522434,0.0032839132,0.001607517],"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.000019581053,0.000019118961,0.000106049694,0.000054005453,0.000007040331,0.000019568286,0.00006743706,0.004909318,0.00024751344,0.977398,0.004750865,0.012401577],"study_design_scores_gemma":[0.000004386797,0.0000048890774,0.000094619245,0.000008019084,0.000005143022,0.000030223071,0.000015298408,0.0073264483,0.0001755448,0.9894589,0.0028721648,0.0000044283142],"about_ca_topic_score_codex":0.0007710812,"about_ca_topic_score_gemma":0.00059826067,"teacher_disagreement_score":0.015776845,"about_ca_system_score_codex":0.002151548,"about_ca_system_score_gemma":0.0009778991,"threshold_uncertainty_score":0.05277878},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012392274,0.007238455,0.008112254,0.0037068115,0.0018980203,0.000044695476,0.001204425,0.0005889176,0.97596735],"genre_scores_gemma":[0.030245828,0.008626487,0.005582601,0.0009561495,0.002574938,0.00009811982,0.0011858237,0.00070701074,0.950023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868995,0.0002579262,0.00006649536,0.00027585492,0.0005638275,0.00014591229],"domain_scores_gemma":[0.9986094,0.0003503849,0.00009597086,0.00034623244,0.0003432533,0.00025481003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010438522,0.0012650447,0.0011342554,0.00316393,0.0021237996,0.009353804,0.0011850462,0.0016931696,0.23375675],"category_scores_gemma":[0.00466745,0.0004477638,0.0005806429,0.0050283447,0.0027773501,0.0050311536,0.0031586273,0.0037148953,0.10385531],"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.000022138733,0.000041792147,0.00028945055,0.00033245888,0.000016098269,0.000036649122,0.00013666002,0.00041361997,0.00024078981,0.47304177,0.36787498,0.15755358],"study_design_scores_gemma":[0.0000057044854,0.000009044113,0.00043207142,0.00015730571,0.000008082125,0.00006257828,0.00007393063,0.0007842292,0.00018522156,0.30214423,0.69613075,0.000006779957],"about_ca_topic_score_codex":0.0034811208,"about_ca_topic_score_gemma":0.007208518,"teacher_disagreement_score":0.23375675,"about_ca_system_score_codex":0.0034388553,"about_ca_system_score_gemma":0.0040911813,"threshold_uncertainty_score":0.7819942},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016370505,0.05614671,0.079527296,0.008338592,0.0021093339,0.000033299908,0.00012017309,0.00024225794,0.83711183],"genre_scores_gemma":[0.55362403,0.03938308,0.041218914,0.001845407,0.003645316,0.00019347604,0.0003318444,0.00030697414,0.35945094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977416,0.000067392386,0.00000855615,0.000039049835,0.00008848236,0.00002237161],"domain_scores_gemma":[0.99961346,0.0002295895,0.000018232282,0.00008013465,0.00003990181,0.000018745277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002743796,0.00043669538,0.0004087973,0.0007357667,0.00092576497,0.0022914,0.0006853492,0.0006740736,0.010709302],"category_scores_gemma":[0.0011877567,0.00022618644,0.00036485586,0.001035551,0.0042961943,0.004357218,0.0011840797,0.0021415285,0.0016425163],"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.000003462706,0.000002878497,0.000020682255,0.00004508425,0.0000014212475,0.000009541091,0.000065408785,0.00026421453,0.000092545604,0.9866766,0.004065071,0.008753165],"study_design_scores_gemma":[0.0000013238828,0.0000014115499,0.000034440003,0.000021259453,9.719136e-7,0.000028596183,0.000015685608,0.00055279833,0.000055299603,0.9687667,0.030519763,0.0000017029399],"about_ca_topic_score_codex":0.00061825773,"about_ca_topic_score_gemma":0.0010323977,"teacher_disagreement_score":0.010709302,"about_ca_system_score_codex":0.0014388805,"about_ca_system_score_gemma":0.0005976711,"threshold_uncertainty_score":0.035826206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041825064,0.010803489,0.05155096,0.0025645695,0.005606144,0.000040979106,0.00031204036,0.0006731429,0.9242662],"genre_scores_gemma":[0.10606165,0.010765123,0.03915419,0.00093518035,0.0040413626,0.0001227194,0.0007143147,0.00070258195,0.83750296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961156,0.00007496703,0.000022026206,0.00007278953,0.00018561631,0.000033072127],"domain_scores_gemma":[0.9996195,0.00012437864,0.00001796058,0.00007250115,0.00011943846,0.000046181543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050628785,0.00053124555,0.00031819486,0.0019698301,0.0010127318,0.0027015167,0.00061602355,0.00048111126,0.053482454],"category_scores_gemma":[0.0016263276,0.00024667132,0.00046639593,0.0014515056,0.0014865792,0.0027676723,0.00083769916,0.0017607304,0.015630996],"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.000016964326,0.000010003924,0.00006324218,0.00009735018,0.0000039971314,0.00003644252,0.00015142852,0.00041888063,0.0005107195,0.86384803,0.0536358,0.08120721],"study_design_scores_gemma":[0.000006355873,0.00001600172,0.00020478433,0.0000879343,0.0000047934664,0.00015865275,0.000053966633,0.001312578,0.00066993834,0.42731348,0.57016337,0.000008127527],"about_ca_topic_score_codex":0.00060413475,"about_ca_topic_score_gemma":0.0009660831,"teacher_disagreement_score":0.053482454,"about_ca_system_score_codex":0.0013166142,"about_ca_system_score_gemma":0.0007648651,"threshold_uncertainty_score":0.17891663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023830807,0.02761355,0.8032966,0.008824417,0.0020776952,0.00011772714,0.00078210316,0.0002124414,0.1332447],"genre_scores_gemma":[0.72160846,0.033023763,0.15703967,0.002201455,0.0045620254,0.0008090687,0.001282702,0.0001826283,0.07929022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932647,0.000264394,0.000045888955,0.00014039878,0.0001590241,0.0000638791],"domain_scores_gemma":[0.99905497,0.0005467927,0.00010774876,0.000079987745,0.0001510755,0.00005930821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070873095,0.00094387284,0.0006710815,0.0011880056,0.0010304208,0.0019246276,0.0005759477,0.0013016037,0.0075786826],"category_scores_gemma":[0.001970795,0.00022811462,0.00084700104,0.0012315572,0.0022024664,0.0026846142,0.0015383594,0.0018408658,0.0009844425],"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.0000043067516,0.0000046878154,0.00012993829,0.000042773037,0.000008065993,0.00007287362,0.000072271076,0.006861406,0.00015025155,0.9880294,0.0012717831,0.0033521291],"study_design_scores_gemma":[0.000009022569,0.000023389512,0.00021993744,0.000040762396,0.000008784335,0.0001209593,0.00007551314,0.042835418,0.00008591748,0.91774565,0.038819794,0.000014827516],"about_ca_topic_score_codex":0.0029135798,"about_ca_topic_score_gemma":0.0019919418,"teacher_disagreement_score":0.0075786826,"about_ca_system_score_codex":0.001768835,"about_ca_system_score_gemma":0.0007664396,"threshold_uncertainty_score":0.025353193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5792232,0.0004930261,0.35626101,0.0019256794,0.00009168657,0.000094118026,0.000386897,0.0010623385,0.06046198],"genre_scores_gemma":[0.97827965,0.00009672676,0.015919292,0.00016393382,0.00005878884,0.000050237784,0.00015537812,0.00014377733,0.0051322114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760395,0.00048463477,0.00016017263,0.00076474895,0.0006031133,0.00038340763],"domain_scores_gemma":[0.9884597,0.0057386304,0.00124625,0.0028249936,0.00094629946,0.00078411977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022307264,0.0006756484,0.0011597427,0.0009989638,0.0017061456,0.0030273527,0.0014873892,0.0012032539,0.0053201984],"category_scores_gemma":[0.0118501885,0.00072820135,0.0017210771,0.0006681561,0.0068679396,0.008858949,0.003834483,0.003518435,0.0007029655],"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.00008662396,0.000025311754,0.0016599117,0.000046710295,0.000022073556,0.00027420194,0.0011965221,0.0026534095,0.0012495568,0.9890627,0.00045305496,0.003269748],"study_design_scores_gemma":[0.000030812927,0.000038207854,0.0003629544,0.000017431881,0.00002808081,0.00021364987,0.0002893421,0.014270265,0.0016260019,0.98030937,0.0027925079,0.00002141816],"about_ca_topic_score_codex":0.0014856877,"about_ca_topic_score_gemma":0.0013624966,"teacher_disagreement_score":0.0053201984,"about_ca_system_score_codex":0.0014899443,"about_ca_system_score_gemma":0.0008596437,"threshold_uncertainty_score":0.017797828},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009657363,0.35922483,0.2989316,0.02846978,0.13462718,0.0002778354,0.0020339964,0.0034512326,0.16332622],"genre_scores_gemma":[0.101635166,0.22955601,0.17662564,0.0039365855,0.06547329,0.0008401381,0.0062602316,0.004705313,0.4109676],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978054,0.0005874312,0.00016456832,0.0006009965,0.00062380556,0.0002178044],"domain_scores_gemma":[0.9968792,0.0009136938,0.00009724305,0.0006630233,0.0010692367,0.00037772383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046750214,0.003043814,0.0025719714,0.0033966093,0.0017410698,0.0055356342,0.0019498253,0.0017403516,0.025289468],"category_scores_gemma":[0.0061955615,0.0009923257,0.0015708033,0.0039784512,0.0028790613,0.005729239,0.003797833,0.0053838296,0.008949776],"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.00029738282,0.0001433848,0.0007417231,0.00081328826,0.00013177407,0.00014181234,0.0002013458,0.00413962,0.0014241368,0.06691379,0.6282907,0.29676107],"study_design_scores_gemma":[0.00010438932,0.00021432825,0.002834148,0.00074748223,0.00015994605,0.00052227976,0.0001933805,0.030972403,0.002683417,0.08139188,0.88011175,0.00006464137],"about_ca_topic_score_codex":0.006434852,"about_ca_topic_score_gemma":0.008247304,"teacher_disagreement_score":0.025289468,"about_ca_system_score_codex":0.004368759,"about_ca_system_score_gemma":0.0031746693,"threshold_uncertainty_score":0.0846017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044350907,0.0043506934,0.9113161,0.0058897818,0.00025442726,0.000053617507,0.00050648436,0.0001796346,0.033098366],"genre_scores_gemma":[0.83101916,0.003469192,0.15353298,0.001138433,0.0013743064,0.00033490718,0.00067652116,0.00013657146,0.008317985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964462,0.0012615209,0.00017753341,0.0005758927,0.001215756,0.00032300618],"domain_scores_gemma":[0.9883448,0.007918061,0.0009599296,0.0015603009,0.0008267451,0.0003901876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029337339,0.0010544815,0.0009276549,0.0025670254,0.0011119044,0.004378591,0.0018848556,0.0013908168,0.0037013944],"category_scores_gemma":[0.0145305935,0.00030048343,0.0012877648,0.0028964793,0.005782582,0.010847185,0.0032822203,0.003920901,0.0006656836],"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.0000038485664,0.0000033395365,0.00008100105,0.000023355215,0.0000045398037,0.0000082213055,0.000052958152,0.003084224,0.00008649449,0.99467826,0.00034641605,0.0016274672],"study_design_scores_gemma":[0.0000019252223,0.000009203732,0.00010165829,0.000009200476,0.0000031804,0.000020070289,0.000018492916,0.014117423,0.00011994883,0.9828895,0.002704623,0.0000046818723],"about_ca_topic_score_codex":0.0009374597,"about_ca_topic_score_gemma":0.0005010042,"teacher_disagreement_score":0.004378591,"about_ca_system_score_codex":0.0036986507,"about_ca_system_score_gemma":0.0006807814,"threshold_uncertainty_score":0.02683568},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05952572,0.004157265,0.823827,0.013886159,0.0006214922,0.00008011822,0.00016083619,0.00027051815,0.09747081],"genre_scores_gemma":[0.9015791,0.0020702358,0.06688794,0.0010265494,0.00070414634,0.00021788944,0.00019714146,0.00009818967,0.027218882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974775,0.0014238268,0.00011153075,0.00031143072,0.00046632905,0.0002093291],"domain_scores_gemma":[0.98920816,0.008942726,0.0004500398,0.00051398855,0.00046546705,0.00041962825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030423747,0.0007585056,0.0009810616,0.0009477621,0.0013436088,0.004715844,0.0014324451,0.0018558415,0.00794447],"category_scores_gemma":[0.015772786,0.00047642255,0.00094417995,0.0013375329,0.0050336383,0.0049575926,0.0023299528,0.0034775662,0.0005810889],"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.000014804109,0.000017898903,0.00015505913,0.000023528875,0.000012243823,0.000010367392,0.00007517337,0.008849938,0.00006868938,0.9846897,0.00095025427,0.0051324884],"study_design_scores_gemma":[0.000006182399,0.0000048298543,0.000063654355,0.000006470633,0.0000035572957,0.000008980397,0.000020103485,0.038293023,0.00003694065,0.9598726,0.0016797332,0.000003963031],"about_ca_topic_score_codex":0.0034684269,"about_ca_topic_score_gemma":0.0027374574,"teacher_disagreement_score":0.00794447,"about_ca_system_score_codex":0.003033852,"about_ca_system_score_gemma":0.0017770369,"threshold_uncertainty_score":0.026576877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13234964,0.004605029,0.74354976,0.0038629367,0.00071550364,0.00018726218,0.0006843929,0.0006647181,0.11338076],"genre_scores_gemma":[0.70719177,0.0035021447,0.266411,0.0018125796,0.0015996811,0.00052467914,0.0007671278,0.00041803787,0.017773042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967649,0.0009044226,0.00023177064,0.00049210695,0.0011284617,0.00047828734],"domain_scores_gemma":[0.98374593,0.008520274,0.0015722268,0.0013584893,0.0033735526,0.0014294808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006232797,0.0012040209,0.0010876283,0.0051651774,0.0023458982,0.0029588805,0.0014772908,0.0017812016,0.007936725],"category_scores_gemma":[0.023002245,0.0005525221,0.0015477933,0.0024346889,0.005192532,0.007108699,0.0042456817,0.004655702,0.0012669867],"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.000028706543,0.00002053923,0.00043811824,0.000076952994,0.000013503127,0.000059572456,0.000118992575,0.0022546137,0.0014393249,0.9835224,0.0017673668,0.010259914],"study_design_scores_gemma":[0.000014504437,0.00012045656,0.0009641798,0.000076763456,0.00002804065,0.00021787417,0.00009482656,0.023912368,0.0025752992,0.96349925,0.008448468,0.00004785668],"about_ca_topic_score_codex":0.0010560508,"about_ca_topic_score_gemma":0.0007707598,"teacher_disagreement_score":0.007936725,"about_ca_system_score_codex":0.0017059084,"about_ca_system_score_gemma":0.0011126508,"threshold_uncertainty_score":0.03296256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00972975,0.0019536559,0.96029663,0.004370055,0.00020492985,0.000087408305,0.0003004281,0.00019357735,0.022863606],"genre_scores_gemma":[0.538418,0.004322264,0.4353035,0.0020563288,0.0020774684,0.0010391775,0.00101642,0.00035469627,0.015412226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940118,0.0021541317,0.0004188131,0.0009375902,0.0019842845,0.0004933716],"domain_scores_gemma":[0.9845882,0.011793741,0.00058323645,0.0016801849,0.0010450309,0.0003095053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046728295,0.0013819397,0.0013181644,0.0029887808,0.0019728146,0.005750876,0.002415966,0.0018799182,0.006051918],"category_scores_gemma":[0.012287723,0.0006095701,0.0039407583,0.00324199,0.007538635,0.016333569,0.0041543473,0.007466988,0.00089742953],"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.0000051006296,0.0000059024283,0.000057679183,0.000046718622,0.000007397968,0.000017303422,0.00007233335,0.0026928426,0.000114862116,0.99441874,0.0004171235,0.002143988],"study_design_scores_gemma":[0.000004347996,0.000006582299,0.000040714716,0.000011331198,0.000005235684,0.00001836273,0.000020900676,0.011536316,0.00011326007,0.9844826,0.0037549695,0.000005498836],"about_ca_topic_score_codex":0.0023085724,"about_ca_topic_score_gemma":0.0012633391,"teacher_disagreement_score":0.006051918,"about_ca_system_score_codex":0.005304294,"about_ca_system_score_gemma":0.0015497457,"threshold_uncertainty_score":0.038485527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35640806,0.002677373,0.29644468,0.008410587,0.0015648868,0.00022034782,0.0015421072,0.00078537624,0.33194658],"genre_scores_gemma":[0.9305745,0.0010302311,0.030463338,0.0011545697,0.00070649857,0.00017233513,0.0008929804,0.00034278884,0.034662735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893886,0.000217634,0.000072028015,0.00021664026,0.0003165098,0.00023824951],"domain_scores_gemma":[0.9936388,0.0040138825,0.00033632352,0.00061158155,0.0008551743,0.0005442684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014135703,0.0004767817,0.000798959,0.0017633314,0.0021226036,0.0031756868,0.0014838928,0.0016114133,0.025790988],"category_scores_gemma":[0.0153579125,0.0003679612,0.00078670954,0.0016341287,0.002954548,0.01125189,0.0030767007,0.0036619545,0.0023819574],"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.00006847658,0.000022688182,0.00037789502,0.0000742214,0.000006346764,0.00008981209,0.00013732792,0.0011640642,0.00064032205,0.98797286,0.0026115957,0.0068343296],"study_design_scores_gemma":[0.000014965866,0.000010409885,0.00019026257,0.000022250599,0.000009304294,0.00008881467,0.000068095076,0.0071335644,0.0006271089,0.98830146,0.0035207104,0.000013069629],"about_ca_topic_score_codex":0.0016474914,"about_ca_topic_score_gemma":0.0021048316,"teacher_disagreement_score":0.025790988,"about_ca_system_score_codex":0.0014470753,"about_ca_system_score_gemma":0.0011228358,"threshold_uncertainty_score":0.08627945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13558334,0.002533095,0.54000545,0.004657153,0.0007695124,0.0001546928,0.0013653956,0.0010804681,0.3138509],"genre_scores_gemma":[0.9086186,0.0013128684,0.048400648,0.0009959289,0.0006332982,0.00023632565,0.0012777606,0.0003030375,0.038221546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998401,0.00039402576,0.00013689561,0.0005183111,0.00033235401,0.00021748219],"domain_scores_gemma":[0.9956116,0.0025613336,0.00029935144,0.0009043191,0.00038804323,0.00023543467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153745,0.00062718685,0.0009443725,0.0017278419,0.0023809082,0.0042355135,0.001380884,0.0015507732,0.016438952],"category_scores_gemma":[0.007731517,0.00058808783,0.0017111925,0.0019574612,0.005728413,0.01195079,0.0036711486,0.0031216163,0.0024865367],"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.00003085567,0.000015013393,0.00029205304,0.00005227451,0.000009849179,0.00009103205,0.00017452045,0.0006509345,0.00040095358,0.98811454,0.0015371792,0.00863087],"study_design_scores_gemma":[0.000009561838,0.00001588451,0.00013887067,0.000017653487,0.000007895301,0.00013615376,0.000057773148,0.0011675195,0.00039617319,0.9939711,0.0040728115,0.000008670787],"about_ca_topic_score_codex":0.0016087819,"about_ca_topic_score_gemma":0.0016500242,"teacher_disagreement_score":0.016438952,"about_ca_system_score_codex":0.0011755499,"about_ca_system_score_gemma":0.00085792114,"threshold_uncertainty_score":0.05499381},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6117142,0.0012642831,0.36648315,0.0036618798,0.00011195284,0.00037146077,0.0011860988,0.0024107012,0.012796369],"genre_scores_gemma":[0.88010556,0.00056418916,0.11366944,0.00041709072,0.00014803297,0.00026004892,0.0011557603,0.000394095,0.0032857824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920129,0.0026858766,0.000703889,0.001212837,0.0022331413,0.0011513351],"domain_scores_gemma":[0.91330236,0.07733281,0.0025003178,0.003972124,0.002075371,0.0008171102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005062505,0.0011397348,0.0017421949,0.0011974609,0.0015995016,0.005358773,0.0028468692,0.0015938028,0.0060087736],"category_scores_gemma":[0.03693616,0.000804402,0.0023510419,0.0023847215,0.0026787757,0.013335045,0.0031642006,0.0030473932,0.00063116377],"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.005285994,0.00075959036,0.019111544,0.0016497724,0.0005126326,0.001614301,0.0022545068,0.48315996,0.02305288,0.16796163,0.010318091,0.2843191],"study_design_scores_gemma":[0.0001965877,0.00017978226,0.0015575731,0.000057813482,0.0001639628,0.00031633605,0.00025397696,0.7850527,0.007620871,0.2029607,0.0015818282,0.000057850273],"about_ca_topic_score_codex":0.0050720563,"about_ca_topic_score_gemma":0.0050332113,"teacher_disagreement_score":0.0060087736,"about_ca_system_score_codex":0.0032054116,"about_ca_system_score_gemma":0.003044439,"threshold_uncertainty_score":0.026773393},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045227896,0.002034182,0.058857534,0.08336059,0.006114791,0.00008753025,0.00014189282,0.00094813056,0.8032275],"genre_scores_gemma":[0.6292985,0.0012142155,0.017232427,0.012836226,0.0015779402,0.00014600041,0.00011477913,0.00066292594,0.33691686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987754,0.0007679424,0.00002350881,0.00012740148,0.00018615037,0.00011964267],"domain_scores_gemma":[0.998317,0.0009079879,0.00012153808,0.00019913043,0.00018244487,0.0002719292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012661568,0.00050913467,0.00020637704,0.00044098884,0.0032030025,0.0066578123,0.00064784207,0.0015847364,0.016050272],"category_scores_gemma":[0.007669423,0.00019772556,0.0002792056,0.00027197148,0.007562167,0.0064548207,0.002261029,0.0030327674,0.004027974],"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.000075723794,0.000045057855,0.0006384733,0.0000828119,0.000009465749,0.00017990069,0.029598502,0.00039139763,0.0006009347,0.75889504,0.1732832,0.036199473],"study_design_scores_gemma":[0.000011687495,0.000055026183,0.0004984159,0.00012694033,0.0000059117497,0.00026740663,0.011613986,0.0019167885,0.0006294076,0.097007886,0.887842,0.000024579938],"about_ca_topic_score_codex":0.0010391091,"about_ca_topic_score_gemma":0.0022852381,"teacher_disagreement_score":0.016050272,"about_ca_system_score_codex":0.0016363763,"about_ca_system_score_gemma":0.000693467,"threshold_uncertainty_score":0.053693533},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031724172,0.31349212,0.2093408,0.016558303,0.010466547,0.00011416346,0.0010917896,0.0010893423,0.44467452],"genre_scores_gemma":[0.101143666,0.36996204,0.19371456,0.012518158,0.03305439,0.0010000893,0.0015627529,0.0011478662,0.28589645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937123,0.00009830969,0.000053686475,0.000106527055,0.00032820532,0.000042015727],"domain_scores_gemma":[0.99763143,0.0018424252,0.000083277344,0.00012693519,0.00025596854,0.00006000439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008023565,0.0014040659,0.0015845621,0.0039289957,0.0010934783,0.0030711533,0.0011126694,0.0015392482,0.01877458],"category_scores_gemma":[0.0032757607,0.0007202183,0.0011514067,0.005063951,0.0031784803,0.007528353,0.0017250855,0.005691803,0.008553902],"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.000012309551,0.000040799237,0.00017304365,0.00072430127,0.000019626197,0.000074293035,0.0001965033,0.0016718133,0.00051015173,0.7771453,0.1034317,0.11600018],"study_design_scores_gemma":[0.0000042966526,0.000013806273,0.00025331453,0.00019580772,0.000008702925,0.00020276297,0.00003918377,0.0012207518,0.00016139932,0.76545566,0.2324248,0.000019531748],"about_ca_topic_score_codex":0.0007815731,"about_ca_topic_score_gemma":0.0009874216,"teacher_disagreement_score":0.01877458,"about_ca_system_score_codex":0.0017526429,"about_ca_system_score_gemma":0.0011867734,"threshold_uncertainty_score":0.0628072},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091244325,0.0017468558,0.8210772,0.0049164584,0.00033697946,0.00017488,0.0010796988,0.0036977127,0.075725846],"genre_scores_gemma":[0.8559287,0.0010638529,0.12334647,0.0022995058,0.0010975839,0.00033095095,0.001298658,0.0011068034,0.013527468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995274,0.0007959324,0.0002256396,0.0013192297,0.0017565148,0.000628669],"domain_scores_gemma":[0.9861677,0.0089928135,0.0004256944,0.003154961,0.0008716923,0.00038714713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030114027,0.0011310918,0.0011785474,0.0015786624,0.0012502363,0.0041849297,0.004092749,0.0013288403,0.010792475],"category_scores_gemma":[0.01400655,0.00075619324,0.0028446703,0.0021008113,0.0038957887,0.015703531,0.0055466103,0.008347115,0.0015401293],"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.00018328526,0.00015860701,0.001008597,0.00036020085,0.000055477747,0.00019988578,0.0004905637,0.017298723,0.008807624,0.9173258,0.005594458,0.048516843],"study_design_scores_gemma":[0.000032028107,0.000097699725,0.00070240576,0.000027460486,0.00005951887,0.00016272305,0.00005711921,0.057242736,0.0085950885,0.9250044,0.007985131,0.000033620883],"about_ca_topic_score_codex":0.0018580881,"about_ca_topic_score_gemma":0.0014670346,"teacher_disagreement_score":0.010792475,"about_ca_system_score_codex":0.0030899711,"about_ca_system_score_gemma":0.001379858,"threshold_uncertainty_score":0.03610438},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2264754,0.0026880954,0.41496927,0.013714264,0.0009207385,0.00018846159,0.002013151,0.0021660614,0.33686468],"genre_scores_gemma":[0.9113436,0.0007622591,0.05344949,0.0019472636,0.0005483774,0.00012764556,0.0012218854,0.00048706206,0.030112451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973484,0.0009692723,0.00022149771,0.00040712667,0.0006251942,0.00042854587],"domain_scores_gemma":[0.9962535,0.0020952935,0.00026902455,0.00031101596,0.0008322154,0.00023895182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030272233,0.00089275296,0.00071214634,0.0017696865,0.0024757204,0.0035178044,0.0010626429,0.0013735762,0.007931861],"category_scores_gemma":[0.007062257,0.0008603172,0.0017772212,0.0010593907,0.0040322845,0.008569614,0.0033143188,0.0027765394,0.0018405434],"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.000047328223,0.000022602073,0.0001679609,0.00006081609,0.00001043569,0.00009004114,0.0004758479,0.00068320375,0.00094580377,0.9920352,0.0020261847,0.0034346664],"study_design_scores_gemma":[0.000025972018,0.00003455057,0.00029081304,0.00003165795,0.00001902322,0.000063206666,0.0002495746,0.0032433616,0.0013971459,0.9876129,0.0070093567,0.000022582513],"about_ca_topic_score_codex":0.0018193308,"about_ca_topic_score_gemma":0.0027634902,"teacher_disagreement_score":0.007931861,"about_ca_system_score_codex":0.003958944,"about_ca_system_score_gemma":0.0010304565,"threshold_uncertainty_score":0.028724253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1095746,0.0042442167,0.36950395,0.043172613,0.00045790663,0.00013066732,0.0000623214,0.0002268118,0.47262698],"genre_scores_gemma":[0.97263736,0.00068499555,0.020542396,0.000701213,0.000121490164,0.00011113586,0.00002797316,0.00006086689,0.005112545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930569,0.0041425987,0.00027589354,0.00079159904,0.0012432669,0.00048966537],"domain_scores_gemma":[0.98726827,0.0073055336,0.00088193687,0.003185374,0.0008971647,0.0004616911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0102180205,0.00056244637,0.000703066,0.002207586,0.0047942707,0.013601022,0.0023168758,0.0036662123,0.004800973],"category_scores_gemma":[0.014078512,0.00049864996,0.00071818987,0.0013050479,0.04354165,0.02453832,0.012000858,0.0064979587,0.00064976385],"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.000004514169,0.0000041992143,0.000054287717,0.00001413531,0.0000021093722,0.000022461893,0.0021180816,0.00024659347,0.00005252716,0.9961796,0.00007655036,0.0012249594],"study_design_scores_gemma":[0.0000066648245,0.000011542424,0.00009637386,0.00003994991,0.00000431606,0.000046165558,0.0013280886,0.0018406998,0.00020223334,0.98789537,0.008521705,0.000006965392],"about_ca_topic_score_codex":0.0016651454,"about_ca_topic_score_gemma":0.0012494518,"teacher_disagreement_score":0.013601022,"about_ca_system_score_codex":0.0062213806,"about_ca_system_score_gemma":0.0034334084,"threshold_uncertainty_score":0.054038703},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26648015,0.00676766,0.18394041,0.008716781,0.00148279,0.00018679221,0.0048811845,0.0019053369,0.5256389],"genre_scores_gemma":[0.8953682,0.0016039147,0.040590674,0.00062668783,0.00037609538,0.00020479156,0.001123693,0.00024166063,0.059864324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889696,0.0002767496,0.000069277,0.00031258198,0.00025284901,0.00019158843],"domain_scores_gemma":[0.9972498,0.0010874699,0.00036099306,0.0005305098,0.00042011772,0.0003510831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011516041,0.0004891507,0.0004294358,0.00217165,0.0020099059,0.0040145866,0.00086619385,0.0010475203,0.016967444],"category_scores_gemma":[0.00639408,0.000351278,0.00050046033,0.0010346526,0.002565368,0.006228673,0.002399842,0.0019317386,0.003790555],"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.00012221845,0.000022297274,0.0006354384,0.00011551552,0.000014215394,0.000073321375,0.00023903779,0.00075866934,0.0013628817,0.96858853,0.010362456,0.017705455],"study_design_scores_gemma":[0.000018492594,0.00002409629,0.0013186255,0.00008607596,0.000019848798,0.0005014577,0.00025504243,0.004085034,0.0021942789,0.9475838,0.04387491,0.000038342838],"about_ca_topic_score_codex":0.0013673955,"about_ca_topic_score_gemma":0.0016900164,"teacher_disagreement_score":0.016967444,"about_ca_system_score_codex":0.0017645295,"about_ca_system_score_gemma":0.001146426,"threshold_uncertainty_score":0.05676174},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3014907,0.001339681,0.26644695,0.0051480583,0.0010299309,0.00018382874,0.0018380616,0.00058225036,0.42194057],"genre_scores_gemma":[0.9444602,0.00047114008,0.020848025,0.0005416504,0.00035532194,0.00011238696,0.0008473189,0.00016937329,0.032194555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928397,0.00014541698,0.000046940746,0.00013820398,0.0002286561,0.00015684821],"domain_scores_gemma":[0.9971107,0.0016825848,0.00017117127,0.00033470365,0.00042972455,0.00027106988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000742203,0.00034619865,0.00051673973,0.0011390125,0.0016033296,0.0027050634,0.0011376922,0.0011144902,0.027364392],"category_scores_gemma":[0.00808358,0.00033491338,0.0005326089,0.0011161813,0.0019439928,0.0074460357,0.0020004904,0.0025392093,0.0021787828],"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.000030862,0.00001677509,0.00018817344,0.000048698956,0.0000045884735,0.000052628562,0.00009299266,0.0007855772,0.0005194483,0.991405,0.0019309262,0.00492444],"study_design_scores_gemma":[0.000013332959,0.0000066265998,0.00014195088,0.000014049063,0.0000063871157,0.000072614406,0.0000567322,0.005437749,0.0006365219,0.98959816,0.004007817,0.000008004182],"about_ca_topic_score_codex":0.0011112991,"about_ca_topic_score_gemma":0.0019263009,"teacher_disagreement_score":0.027364392,"about_ca_system_score_codex":0.0010166193,"about_ca_system_score_gemma":0.00083088584,"threshold_uncertainty_score":0.09154302},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31233406,0.0019253505,0.28706905,0.0069952914,0.0013055981,0.00021969715,0.0021197658,0.0009652162,0.38706607],"genre_scores_gemma":[0.9253587,0.0007065183,0.025704037,0.0007924017,0.0005284548,0.00015749513,0.000996303,0.00033212395,0.0454239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989278,0.00019014796,0.00008348207,0.00022494614,0.00033929365,0.00023431754],"domain_scores_gemma":[0.9939312,0.003538165,0.000385401,0.00071192114,0.00091915263,0.0005142504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011547238,0.00043494883,0.00064863346,0.0014442523,0.0020329927,0.0036338367,0.0014153543,0.0014108509,0.029838895],"category_scores_gemma":[0.014417494,0.00042248695,0.00068931415,0.001518383,0.0024000541,0.011296805,0.0028740144,0.0031113012,0.003002948],"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.00005857892,0.000019759444,0.00033015016,0.00007179676,0.0000060940065,0.00008624851,0.00012710944,0.0008544424,0.00067984563,0.98869914,0.0022898577,0.006776865],"study_design_scores_gemma":[0.000017404323,0.000009321986,0.00018248388,0.000022710257,0.000010164233,0.00012355064,0.000073199095,0.005180213,0.0010028932,0.9865942,0.0067710876,0.000012723273],"about_ca_topic_score_codex":0.0013532586,"about_ca_topic_score_gemma":0.0020938634,"teacher_disagreement_score":0.029838895,"about_ca_system_score_codex":0.001290488,"about_ca_system_score_gemma":0.001137599,"threshold_uncertainty_score":0.09982103},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011997529,0.016630944,0.013111845,0.0029935655,0.0010683538,0.000014622241,0.000066827146,0.00010354755,0.96481055],"genre_scores_gemma":[0.064107135,0.020884234,0.009815511,0.0016686281,0.0016288586,0.00014882507,0.00019323731,0.00021877265,0.90133476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976414,0.00007522571,0.000007677246,0.0000345194,0.00009407448,0.000024435096],"domain_scores_gemma":[0.99981254,0.00009446761,0.000011795355,0.000022656166,0.000033105225,0.000025436162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025354477,0.00089127367,0.00047173406,0.0011009177,0.0010264169,0.0032616865,0.0006632901,0.0007877575,0.028663768],"category_scores_gemma":[0.0011258208,0.00025854446,0.0002813562,0.0012729423,0.0024962125,0.0031627421,0.0010450373,0.0021711094,0.008196589],"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.0000041964786,0.000008373678,0.0000414304,0.000055764733,0.0000022275726,0.000012126387,0.0001915291,0.0003356314,0.00008121633,0.9084954,0.05846768,0.032304343],"study_design_scores_gemma":[0.0000032489954,0.000004951793,0.00010950256,0.000101091224,0.0000022656784,0.000038719332,0.00008687773,0.0005908282,0.000057792404,0.63250667,0.36649466,0.0000034435368],"about_ca_topic_score_codex":0.002049563,"about_ca_topic_score_gemma":0.0042498,"teacher_disagreement_score":0.028663768,"about_ca_system_score_codex":0.0020801725,"about_ca_system_score_gemma":0.0012068765,"threshold_uncertainty_score":0.09588981},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07559379,0.0073765237,0.115079455,0.011700437,0.001290244,0.000060284605,0.002000373,0.0007704942,0.7861284],"genre_scores_gemma":[0.73595667,0.0034767573,0.047010627,0.0022882046,0.00086347293,0.00014725736,0.00099012,0.00031112222,0.20895572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968517,0.00008317816,0.000016559654,0.000076553384,0.00008862159,0.000049899445],"domain_scores_gemma":[0.9986749,0.00075985637,0.00009278785,0.00014781908,0.00019119709,0.0001334024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000520455,0.00033924697,0.00042716903,0.0011982488,0.0016932606,0.002868117,0.0005456749,0.00070051017,0.029608125],"category_scores_gemma":[0.0035105823,0.0003099597,0.00045389018,0.0014425967,0.0014143129,0.0057910834,0.001260254,0.0021599024,0.0046802163],"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.000019478064,0.0000072449375,0.000076419004,0.000036123023,0.0000045380743,0.000032138716,0.00007460293,0.00024407133,0.00016187996,0.982144,0.010692973,0.0065063783],"study_design_scores_gemma":[0.0000083860505,0.0000057419716,0.00014108824,0.000020701886,0.0000058563833,0.000112259775,0.000052192205,0.0011697386,0.00022127692,0.97435015,0.02390673,0.000005982105],"about_ca_topic_score_codex":0.0010378363,"about_ca_topic_score_gemma":0.002022596,"teacher_disagreement_score":0.029608125,"about_ca_system_score_codex":0.001255802,"about_ca_system_score_gemma":0.00053567614,"threshold_uncertainty_score":0.09904909},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012433018,0.50246,0.008525493,0.3023381,0.111070834,0.00014495286,0.0007872833,0.0003087698,0.061931662],"genre_scores_gemma":[0.25726497,0.34519538,0.019546859,0.084385075,0.09718821,0.00034690596,0.0017294466,0.0009585157,0.19338468],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935888,0.001982569,0.00046031838,0.00062524294,0.0022825478,0.0010605316],"domain_scores_gemma":[0.9801891,0.0036305613,0.0008315935,0.0013705189,0.0077518253,0.006226513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020101758,0.0017252325,0.0011709093,0.004635129,0.0037645428,0.010959479,0.0015043948,0.0039742417,0.026491016],"category_scores_gemma":[0.022479728,0.0004814365,0.0010346693,0.004041848,0.009773354,0.013447454,0.009080625,0.008923016,0.0077996394],"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.00027382246,0.0003373172,0.0018872402,0.0013210452,0.00009858417,0.0001964835,0.0018692313,0.00060671655,0.0007135995,0.29388383,0.4304529,0.26835936],"study_design_scores_gemma":[0.000020375566,0.00010730909,0.002518278,0.0007352538,0.000020347527,0.00013710637,0.0007155406,0.00023386949,0.00027201461,0.033163276,0.9620558,0.00002088288],"about_ca_topic_score_codex":0.004952648,"about_ca_topic_score_gemma":0.008846418,"teacher_disagreement_score":0.026491016,"about_ca_system_score_codex":0.011371816,"about_ca_system_score_gemma":0.0141744055,"threshold_uncertainty_score":0.10630953},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5348224,0.0010886427,0.39540595,0.0026174723,0.00019513535,0.00009947376,0.0004916022,0.0006679461,0.06461132],"genre_scores_gemma":[0.9359712,0.00028363813,0.053629342,0.00030826143,0.00011589818,0.00016513474,0.00033458415,0.00013839669,0.00905354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983546,0.00035054813,0.00012665887,0.00048418748,0.00046248222,0.00022146461],"domain_scores_gemma":[0.99568754,0.002435198,0.00042080221,0.0006889835,0.00034408705,0.00042343474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020139883,0.0007726527,0.001436138,0.0026094425,0.00395788,0.0046714637,0.001785999,0.0025947022,0.0067796204],"category_scores_gemma":[0.007656051,0.0007488735,0.001736788,0.0014184451,0.0050525526,0.008946593,0.003540708,0.0030402,0.0005803995],"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.000023760353,0.000007923839,0.00013390288,0.000022396696,0.000005859015,0.000050167724,0.00010659645,0.00069024554,0.00036461026,0.9973469,0.00018137683,0.0010661841],"study_design_scores_gemma":[0.000013233309,0.000011179659,0.0001839545,0.000017229442,0.000009209486,0.00011686382,0.00005452188,0.00986453,0.0006887641,0.9877828,0.0012393848,0.000018420544],"about_ca_topic_score_codex":0.00068943866,"about_ca_topic_score_gemma":0.0007434449,"teacher_disagreement_score":0.0067796204,"about_ca_system_score_codex":0.0029606647,"about_ca_system_score_gemma":0.00080894685,"threshold_uncertainty_score":0.022680044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8099624,0.00028939964,0.16233678,0.0012677604,0.00003613828,0.000093665876,0.00036371927,0.00033231007,0.02531791],"genre_scores_gemma":[0.98589605,0.00008042474,0.01175801,0.00007661122,0.000026990087,0.000031371575,0.00017716447,0.000024420418,0.0019288358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968912,0.0007233848,0.00021030607,0.0005936123,0.0009387767,0.0006426454],"domain_scores_gemma":[0.9870451,0.00834802,0.00095697516,0.0011795824,0.0010244476,0.0014459909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027635535,0.0003442895,0.0007560898,0.0017781969,0.0014587048,0.005426609,0.0012353332,0.000876643,0.0041990425],"category_scores_gemma":[0.0076258234,0.00045078478,0.0012656244,0.0010901314,0.0056083105,0.007816983,0.0032513523,0.0028451558,0.00023785833],"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.000114421266,0.000050045765,0.0026566926,0.00006391849,0.00001719162,0.00013833714,0.0005951422,0.0097480705,0.0022460474,0.9793068,0.00039248922,0.0046709036],"study_design_scores_gemma":[0.000039475734,0.00007756842,0.002094502,0.00003082235,0.000023929138,0.00016473481,0.00043196164,0.041197214,0.0037343635,0.9496726,0.0024902392,0.000042559634],"about_ca_topic_score_codex":0.0035230098,"about_ca_topic_score_gemma":0.0024763637,"teacher_disagreement_score":0.005426609,"about_ca_system_score_codex":0.0036747954,"about_ca_system_score_gemma":0.0010671548,"threshold_uncertainty_score":0.026662588},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06534918,0.00034641326,0.91631866,0.00030022013,0.0002859649,0.000107070264,0.000090872294,0.0005569269,0.01664475],"genre_scores_gemma":[0.48541903,0.00069089397,0.49323004,0.00039640305,0.00029354115,0.00039024604,0.00037430692,0.00035035683,0.018855186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992717,0.000121615216,0.000048412803,0.00018451105,0.00028443206,0.00008933797],"domain_scores_gemma":[0.9981667,0.0009739948,0.00011977346,0.00036920593,0.00023072874,0.00013958072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015919829,0.0004954587,0.00047432858,0.0009563627,0.0011005239,0.0009918124,0.00091485074,0.00047385498,0.006100742],"category_scores_gemma":[0.0043250904,0.00031885717,0.00085440016,0.00056675257,0.0012881155,0.0024656819,0.002111591,0.0015164115,0.0010558768],"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.00031689234,0.000109178756,0.0014691182,0.00020735449,0.000026097388,0.0005975179,0.0006575179,0.0073866225,0.026926205,0.791257,0.0034702977,0.16757624],"study_design_scores_gemma":[0.00013650981,0.0003954194,0.0012159599,0.00015178834,0.00008257399,0.0026637816,0.00021831876,0.08628184,0.054610766,0.7698337,0.08432459,0.00008482524],"about_ca_topic_score_codex":0.00018290454,"about_ca_topic_score_gemma":0.00020301135,"teacher_disagreement_score":0.006100742,"about_ca_system_score_codex":0.00058385584,"about_ca_system_score_gemma":0.00044722992,"threshold_uncertainty_score":0.020409048},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31341815,0.009836333,0.350234,0.014955372,0.00061152613,0.00007528406,0.00058603304,0.0006049281,0.30967835],"genre_scores_gemma":[0.9342475,0.0020012364,0.019522669,0.0009355121,0.00093759625,0.000111233094,0.0003436843,0.00035842165,0.041542187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992508,0.00026749086,0.000027236985,0.00019552588,0.00014715863,0.00011176613],"domain_scores_gemma":[0.9954579,0.0026515354,0.00039983972,0.0005641569,0.00042421528,0.0005024412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011981769,0.0008188175,0.0011987877,0.0019905458,0.0022025253,0.0032387867,0.0017020523,0.001323966,0.012294415],"category_scores_gemma":[0.007023299,0.0005392403,0.0009956971,0.002033302,0.00549286,0.015778376,0.0040258933,0.0049545234,0.0009048238],"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.000015494616,0.000008218235,0.000109869245,0.00003357274,0.000004096993,0.000021418124,0.00016960289,0.00043037132,0.00016768613,0.99674666,0.0006969749,0.0015960579],"study_design_scores_gemma":[0.000009823065,0.00001751827,0.00017011134,0.000013553037,0.000008870863,0.000051483465,0.00013085971,0.0022641711,0.00015039154,0.9932411,0.0039351047,0.00000697779],"about_ca_topic_score_codex":0.0013207009,"about_ca_topic_score_gemma":0.00085643906,"teacher_disagreement_score":0.012294415,"about_ca_system_score_codex":0.002322883,"about_ca_system_score_gemma":0.00046515098,"threshold_uncertainty_score":0.041128933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09546235,0.0068037976,0.6306411,0.0037310582,0.003445898,0.00007648074,0.00028172543,0.00046215198,0.25909552],"genre_scores_gemma":[0.7762873,0.0030179482,0.1503118,0.0017709442,0.0017335967,0.000119223885,0.00051655114,0.00073364086,0.06550904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846727,0.00040283724,0.000095294745,0.0003522197,0.0005024183,0.00017988919],"domain_scores_gemma":[0.99702543,0.001957484,0.00014840848,0.0003739777,0.00037164855,0.00012303542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022918535,0.00093842985,0.0011513765,0.0017880355,0.0009834826,0.0025075257,0.0023030064,0.0016223437,0.008616387],"category_scores_gemma":[0.008912807,0.0006948969,0.0011330016,0.0015234505,0.0055438173,0.010339681,0.0029551857,0.0057665776,0.001613486],"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.00008913147,0.000011678789,0.00012460857,0.00003667057,0.000005742493,0.00004632921,0.00013589436,0.0008219857,0.0008555739,0.98016125,0.0013060733,0.016405001],"study_design_scores_gemma":[0.000013200048,0.000029151332,0.00015504475,0.000020487865,0.000008039953,0.00008623222,0.000038288894,0.0044311164,0.00071387715,0.9885311,0.005963216,0.000010278903],"about_ca_topic_score_codex":0.00071970926,"about_ca_topic_score_gemma":0.000633123,"teacher_disagreement_score":0.008616387,"about_ca_system_score_codex":0.001458982,"about_ca_system_score_gemma":0.0006204705,"threshold_uncertainty_score":0.028824687},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001592879,0.06842047,0.0040905066,0.18191972,0.44600227,0.000097883974,0.0018556181,0.00055777316,0.29546285],"genre_scores_gemma":[0.0153595805,0.02638382,0.0011898864,0.011736111,0.24681602,0.00013405333,0.0012078183,0.00068696693,0.6964858],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984328,0.00030256255,0.00010653264,0.000401188,0.0005821438,0.00017477709],"domain_scores_gemma":[0.9963408,0.0009998773,0.00021423954,0.0005507983,0.0009916733,0.0009026086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016644393,0.0012816163,0.0019410611,0.0036497721,0.0036370768,0.008180552,0.0011156102,0.003560744,0.20559926],"category_scores_gemma":[0.008014674,0.00046812053,0.0008132344,0.0033467552,0.0019159566,0.0057519176,0.0034215315,0.0046974337,0.07289083],"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.0000343859,0.00001897543,0.000121956975,0.00019325355,0.000009939386,0.00003366452,0.00006508162,0.00006842614,0.00014778158,0.02682286,0.94997233,0.022511417],"study_design_scores_gemma":[0.000006667729,0.0000059627146,0.00027096283,0.00009477256,0.000005383567,0.000046066427,0.000038452697,0.00009804307,0.00006575862,0.00974905,0.9896143,0.0000045352854],"about_ca_topic_score_codex":0.0012283676,"about_ca_topic_score_gemma":0.0017521265,"teacher_disagreement_score":0.20559926,"about_ca_system_score_codex":0.0037038147,"about_ca_system_score_gemma":0.0025962563,"threshold_uncertainty_score":0.687798},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068607196,0.0028644698,0.8682357,0.010696869,0.00070549734,0.00025217756,0.0011596904,0.007085068,0.040393267],"genre_scores_gemma":[0.68264526,0.0022753906,0.27792057,0.0018119217,0.0006931688,0.0003108572,0.0020249065,0.0021845174,0.030133327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577576,0.0006908942,0.00019758086,0.0010710957,0.0013358367,0.0009290092],"domain_scores_gemma":[0.9866043,0.010239921,0.00038663892,0.0019288311,0.00049946783,0.00034085184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029414995,0.0010176775,0.0014677431,0.0007978072,0.0024069278,0.0056352327,0.0027187269,0.0019144727,0.011778836],"category_scores_gemma":[0.01163307,0.0013591826,0.0022697442,0.0015307151,0.0041466337,0.013432217,0.0046794787,0.0067910478,0.002187677],"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.0006763303,0.00022999285,0.0012172302,0.0005258474,0.00011450304,0.0002390348,0.00071291317,0.038768016,0.0064407475,0.833134,0.020919457,0.09702182],"study_design_scores_gemma":[0.00011479661,0.00004529899,0.0001720623,0.0000402966,0.00006962216,0.0001121902,0.00004955876,0.08476212,0.0052448343,0.89730954,0.012047904,0.000031778218],"about_ca_topic_score_codex":0.006334982,"about_ca_topic_score_gemma":0.012994956,"teacher_disagreement_score":0.011778836,"about_ca_system_score_codex":0.006037221,"about_ca_system_score_gemma":0.0049107107,"threshold_uncertainty_score":0.043803334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031142069,0.0018205069,0.9396521,0.0018326369,0.0004907701,0.00016405428,0.00091122626,0.0018085046,0.02217805],"genre_scores_gemma":[0.7865519,0.0036417418,0.18459328,0.0010706339,0.00072526187,0.0004911829,0.0012362631,0.0002475912,0.021442076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863356,0.00034866796,0.00011748365,0.000320551,0.00045582562,0.00012392497],"domain_scores_gemma":[0.9969036,0.0015416145,0.00023440049,0.0006406396,0.00056776573,0.00011190457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010962997,0.00068890146,0.0008175124,0.0019371823,0.00086461485,0.0031559065,0.0017104717,0.0011953043,0.008566285],"category_scores_gemma":[0.009017756,0.00040664015,0.0006370295,0.0024560099,0.0017522082,0.006074919,0.0025058673,0.001443639,0.0011949547],"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.0003124634,0.000058733032,0.0008295417,0.00025107738,0.000057397716,0.00058651343,0.0002797991,0.18551348,0.0039348626,0.68567014,0.008347564,0.11415834],"study_design_scores_gemma":[0.000033454864,0.000039328366,0.00020421071,0.000051966395,0.000027387787,0.00017639792,0.00006034546,0.51447654,0.002261349,0.46502936,0.01761864,0.00002106126],"about_ca_topic_score_codex":0.0032837603,"about_ca_topic_score_gemma":0.0021125195,"teacher_disagreement_score":0.008566285,"about_ca_system_score_codex":0.001571995,"about_ca_system_score_gemma":0.00069764606,"threshold_uncertainty_score":0.028657079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11080281,0.00032862095,0.8795491,0.0013574193,0.00023069698,0.00014108952,0.0002414085,0.00060857245,0.0067403154],"genre_scores_gemma":[0.94690174,0.00012600099,0.050942194,0.00021911765,0.000106036816,0.00010195983,0.00013420529,0.00007691988,0.0013919402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98972636,0.0023631079,0.0008155592,0.0025938717,0.0035154405,0.0009856584],"domain_scores_gemma":[0.97708637,0.014828173,0.002246092,0.004200176,0.0011735567,0.0004657665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054929303,0.00066695176,0.0015432457,0.0008507789,0.0013758616,0.0026796332,0.0020667177,0.0029524923,0.0034309763],"category_scores_gemma":[0.035064653,0.00076043,0.0008527499,0.0011031354,0.0045487816,0.01069282,0.0077331015,0.0036036049,0.0006891812],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012605789,0.00020117086,0.0061948947,0.00032664373,0.00014765804,0.0015879141,0.0005146343,0.039661128,0.078108326,0.8129295,0.0019406665,0.057126895],"study_design_scores_gemma":[0.0001420883,0.00017915556,0.00087608345,0.000047967995,0.000053396143,0.0007698936,0.00012056071,0.35724735,0.10016053,0.53740066,0.0028881144,0.00011406189],"about_ca_topic_score_codex":0.0002943694,"about_ca_topic_score_gemma":0.00018766586,"teacher_disagreement_score":0.0054929303,"about_ca_system_score_codex":0.0011030881,"about_ca_system_score_gemma":0.0014437223,"threshold_uncertainty_score":0.029049695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010013167,0.0021039513,0.96347106,0.0029595734,0.00039239382,0.00012706939,0.000088433546,0.00039959786,0.02945666],"genre_scores_gemma":[0.050546363,0.0037229196,0.91809404,0.0011868577,0.0006941404,0.0009907106,0.00021973344,0.00058775576,0.023957392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968887,0.0013063058,0.00024484092,0.0005323103,0.0008750898,0.00015271176],"domain_scores_gemma":[0.99703753,0.001332951,0.00018157199,0.00080791576,0.000436873,0.00020306029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005877253,0.0013855427,0.0013252212,0.0022727891,0.0022176101,0.0075955465,0.0035754372,0.0031365335,0.011611888],"category_scores_gemma":[0.009090246,0.0011217406,0.0026475403,0.002062868,0.010949333,0.0114682615,0.0076055955,0.007819802,0.0055306517],"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.0000036435315,0.000007566713,0.000057830595,0.00006490297,0.000008756747,0.000023281793,0.00024601838,0.0023743259,0.00010941869,0.983697,0.0027724598,0.010634777],"study_design_scores_gemma":[0.0000057916313,0.0000073504393,0.00002637211,0.00006022002,0.0000037561495,0.000033149943,0.00006874117,0.01302524,0.00013032307,0.94803584,0.038593955,0.000009329047],"about_ca_topic_score_codex":0.0014675718,"about_ca_topic_score_gemma":0.001119213,"teacher_disagreement_score":0.011611888,"about_ca_system_score_codex":0.0023600254,"about_ca_system_score_gemma":0.0028194566,"threshold_uncertainty_score":0.0388456},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025599378,0.2124019,0.15587623,0.01327968,0.006116502,0.000109199995,0.0006112274,0.0011228917,0.6079224],"genre_scores_gemma":[0.14878468,0.18610525,0.14368789,0.009127269,0.0142084,0.0010141728,0.0020944534,0.0017908394,0.49318713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990728,0.00024418795,0.000050503026,0.0002230707,0.00035360796,0.000055789278],"domain_scores_gemma":[0.9991297,0.00047188514,0.000032649175,0.0001893958,0.00013025141,0.000046039553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089138234,0.0019650587,0.0020601205,0.0020972167,0.001331625,0.005760129,0.0012318721,0.0014681574,0.023065517],"category_scores_gemma":[0.002944145,0.00071988965,0.0009607794,0.0046993895,0.0054938057,0.006942345,0.001975726,0.0052294196,0.0100770835],"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.000015918042,0.000018574188,0.00014690051,0.00043210443,0.000025693049,0.000030705654,0.00025908384,0.00089849066,0.00024367472,0.817719,0.08621106,0.09399873],"study_design_scores_gemma":[0.000013704782,0.000011671832,0.00020989924,0.00014601059,0.000014219017,0.00010209379,0.00006745292,0.0014734563,0.00014738413,0.7519008,0.24590546,0.000007930629],"about_ca_topic_score_codex":0.0019479777,"about_ca_topic_score_gemma":0.0019218378,"teacher_disagreement_score":0.023065517,"about_ca_system_score_codex":0.0029959395,"about_ca_system_score_gemma":0.001448614,"threshold_uncertainty_score":0.07716179},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051106216,0.84226704,0.0030289628,0.008257228,0.00589173,0.00003652656,0.0003509499,0.00013775952,0.13951881],"genre_scores_gemma":[0.006920723,0.8893019,0.0040658726,0.0068800244,0.0054197987,0.00007429855,0.0008677956,0.00014257616,0.086327],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991136,0.00016444217,0.00008284094,0.00015995963,0.0004083365,0.00007081586],"domain_scores_gemma":[0.998478,0.00079769205,0.00007196074,0.00011995362,0.0004367165,0.00009566136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093226193,0.00097325625,0.0009878742,0.0047590514,0.0010126545,0.0041656466,0.0017775741,0.0019000986,0.04924346],"category_scores_gemma":[0.0031068353,0.000378563,0.00070925325,0.006384747,0.0012766472,0.0037572088,0.0016654609,0.0025499687,0.027864274],"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.000024227169,0.000044095483,0.00019746079,0.0042113583,0.00004137523,0.00019408925,0.00027878722,0.0006704815,0.00039593282,0.079100296,0.420152,0.49468985],"study_design_scores_gemma":[0.0000012052391,0.000005505794,0.00011240226,0.0007645865,0.000004965132,0.00020369304,0.000034367695,0.000040422656,0.000042094165,0.006421411,0.9923649,0.000004445964],"about_ca_topic_score_codex":0.0019959793,"about_ca_topic_score_gemma":0.0028374349,"teacher_disagreement_score":0.04924346,"about_ca_system_score_codex":0.0025265815,"about_ca_system_score_gemma":0.0023608934,"threshold_uncertainty_score":0.1647358},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059800286,0.00064153154,0.8993454,0.0071757846,0.0001060984,0.0000854756,0.00042904788,0.00021649274,0.032199956],"genre_scores_gemma":[0.9104636,0.0010705438,0.0773231,0.00076007564,0.00018620344,0.00016881799,0.00033707602,0.00006997335,0.009620465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942572,0.002180956,0.0003179153,0.0010977733,0.0017522185,0.00039387564],"domain_scores_gemma":[0.96188647,0.028389094,0.0033087493,0.0033195936,0.0023364455,0.00075961143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062721428,0.0005340903,0.0011000768,0.0023036473,0.0007700733,0.0060036015,0.0021099206,0.0023784754,0.0058285687],"category_scores_gemma":[0.039374955,0.0005843672,0.0013814351,0.001794002,0.0056988345,0.011326269,0.003039547,0.0035669282,0.00063748646],"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.000017855125,0.00002152571,0.0009340828,0.000053650165,0.000043504202,0.00011826716,0.00026449276,0.02861891,0.00020810822,0.9637739,0.00040736716,0.0055384627],"study_design_scores_gemma":[0.000014960042,0.000029657911,0.00058493257,0.000054766562,0.000025461846,0.00013328693,0.00007724015,0.12009459,0.00021332061,0.8770205,0.0017246619,0.00002661014],"about_ca_topic_score_codex":0.0039490513,"about_ca_topic_score_gemma":0.002845712,"teacher_disagreement_score":0.0062721428,"about_ca_system_score_codex":0.003159683,"about_ca_system_score_gemma":0.0019958566,"threshold_uncertainty_score":0.03317064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1836886,0.00039314208,0.7651245,0.0021021988,0.000103394035,0.00030949703,0.0006487655,0.00026538686,0.047364496],"genre_scores_gemma":[0.9046795,0.00026602382,0.086581916,0.0002807698,0.000068436115,0.0002951509,0.00033760213,0.00004216621,0.007448428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997687,0.0009809923,0.0001223936,0.00039603087,0.000539561,0.0002740549],"domain_scores_gemma":[0.9964992,0.0024148002,0.00020689983,0.00023111983,0.00031187834,0.00033605713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017671755,0.00056772545,0.000645505,0.00057561096,0.001281599,0.0021962163,0.0010795164,0.0010378975,0.00517351],"category_scores_gemma":[0.007726338,0.0003377332,0.0006330419,0.0009552535,0.002069042,0.0038772284,0.0019264413,0.0017487262,0.00030011294],"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.00006016388,0.000022510198,0.00017484084,0.00003513782,0.000013266169,0.000075865195,0.0001445834,0.016683543,0.00072529534,0.97713304,0.00071287324,0.004218936],"study_design_scores_gemma":[0.000055575714,0.000023885133,0.0001662685,0.000011618059,0.00001276094,0.000056408175,0.000076050266,0.21209863,0.00072939636,0.7831561,0.003596227,0.000017171165],"about_ca_topic_score_codex":0.0054746773,"about_ca_topic_score_gemma":0.005085373,"teacher_disagreement_score":0.0054746773,"about_ca_system_score_codex":0.0024073492,"about_ca_system_score_gemma":0.0017791494,"threshold_uncertainty_score":0.017466545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88445413,0.00028001965,0.072477,0.00027752644,0.00004910752,0.000045084482,0.00013351596,0.00012044586,0.04216312],"genre_scores_gemma":[0.98992926,0.00010833927,0.004653701,0.00006891187,0.000039570754,0.000027521812,0.00011879262,0.000020276093,0.0050336556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994647,0.000073430565,0.00002527953,0.00008872972,0.00019316454,0.00015477868],"domain_scores_gemma":[0.9983883,0.0005369841,0.00024680176,0.00021527539,0.00024921776,0.00036334948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043073753,0.00029450585,0.0003838161,0.0008205692,0.0013019671,0.0013641755,0.000557407,0.00034615723,0.0033467887],"category_scores_gemma":[0.0025872188,0.00022573488,0.0006710709,0.0004514195,0.0018032796,0.0018993465,0.0015051857,0.0015933188,0.00022029002],"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.00009421782,0.000047522626,0.0032136703,0.00005748122,0.0000151284685,0.0005137407,0.0005772849,0.0091015445,0.007397242,0.9715118,0.00066070724,0.006809705],"study_design_scores_gemma":[0.00004393115,0.00015061631,0.005312206,0.000043509284,0.000029554825,0.00086424436,0.00048952125,0.04905703,0.009149257,0.92465717,0.010159376,0.000043612436],"about_ca_topic_score_codex":0.0011803511,"about_ca_topic_score_gemma":0.0009459412,"teacher_disagreement_score":0.0033467887,"about_ca_system_score_codex":0.0007009268,"about_ca_system_score_gemma":0.00039544792,"threshold_uncertainty_score":0.0111961365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028193943,0.012640595,0.528086,0.0074638785,0.0019300403,0.0001276138,0.00054784794,0.0054949233,0.41551515],"genre_scores_gemma":[0.5233156,0.0083628055,0.27728456,0.0014634082,0.0016481614,0.0002713935,0.0012066432,0.0008553823,0.1855921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996277,0.00007102428,0.000024790745,0.00010026541,0.00012172168,0.000054564174],"domain_scores_gemma":[0.99951375,0.00012563949,0.00002289641,0.0001998883,0.00010396131,0.000033798708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037536345,0.0006734472,0.00043170335,0.0007847549,0.0012608826,0.003829754,0.0011383465,0.001047698,0.034718435],"category_scores_gemma":[0.0017438228,0.0004825907,0.0004941937,0.0009112495,0.0016818919,0.0065900153,0.0019388922,0.002226783,0.008380351],"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.00002151425,0.000009420273,0.000071835326,0.0000691591,0.0000069215866,0.000016557931,0.00008405603,0.0013025342,0.001142628,0.9479724,0.0077674137,0.041535556],"study_design_scores_gemma":[0.000007983062,0.000011367804,0.000057111953,0.000042078394,0.0000129110385,0.000041487034,0.000044308767,0.005712661,0.0012869427,0.8879457,0.10483021,0.000007312819],"about_ca_topic_score_codex":0.00077709084,"about_ca_topic_score_gemma":0.0017054335,"teacher_disagreement_score":0.034718435,"about_ca_system_score_codex":0.0012221279,"about_ca_system_score_gemma":0.00081222696,"threshold_uncertainty_score":0.11614472},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003750969,0.80653286,0.0023206223,0.023148526,0.0151878325,0.000015989592,0.00027468792,0.00014562238,0.15199877],"genre_scores_gemma":[0.0103213275,0.78469473,0.0023253248,0.015547601,0.029409507,0.00006481672,0.0005539298,0.0001598301,0.15692289],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923515,0.00015083725,0.000046073357,0.00012965105,0.00036840746,0.00006980336],"domain_scores_gemma":[0.9990096,0.00039448185,0.00006124979,0.00009743413,0.0003471379,0.00009004268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008268475,0.0008354321,0.00078349735,0.00396599,0.0010294027,0.0035133176,0.0011369225,0.0013454189,0.03840885],"category_scores_gemma":[0.0046971617,0.00036315067,0.00036014532,0.004746517,0.0026232267,0.0049176407,0.0019796884,0.0027977563,0.021035692],"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.000022955664,0.000014853342,0.00012321024,0.00092790864,0.000011799212,0.000027554759,0.00015215218,0.00017624564,0.00014023868,0.13546945,0.6629363,0.19999743],"study_design_scores_gemma":[0.000001987391,0.0000032230007,0.000112506925,0.0003522883,0.0000031067682,0.00003505135,0.00002763695,0.000022886614,0.000015654616,0.018593153,0.9808296,0.0000030115734],"about_ca_topic_score_codex":0.002498549,"about_ca_topic_score_gemma":0.0036322365,"teacher_disagreement_score":0.03840885,"about_ca_system_score_codex":0.002462502,"about_ca_system_score_gemma":0.00333432,"threshold_uncertainty_score":0.12849039},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03988593,0.031362414,0.0502371,0.46169356,0.027913459,0.00006628759,0.0002953587,0.0009541841,0.38759166],"genre_scores_gemma":[0.7615259,0.0155152045,0.03705136,0.032071885,0.015743408,0.00012413233,0.00041700702,0.0013558987,0.13619517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817526,0.00081800914,0.000058241247,0.0003462998,0.0003601271,0.00024218498],"domain_scores_gemma":[0.9921319,0.003829845,0.00020540612,0.0014745912,0.0009450682,0.0014131945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00710775,0.0006629321,0.00055917766,0.0012051854,0.0054692873,0.010773366,0.0013390585,0.002592096,0.014259033],"category_scores_gemma":[0.016401125,0.00030290004,0.000548022,0.00079810986,0.020883428,0.010636642,0.005327703,0.0073425695,0.0021419015],"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.00010618749,0.000032455166,0.00047482486,0.00007312503,0.000019169542,0.00011689047,0.0034221476,0.0009346937,0.0002442758,0.85188276,0.100036,0.042657405],"study_design_scores_gemma":[0.000020182404,0.000038118484,0.00039057175,0.00014229059,0.0000067435753,0.00012291098,0.0014792196,0.0017275327,0.00019014273,0.4903851,0.50547075,0.000026408587],"about_ca_topic_score_codex":0.0017136111,"about_ca_topic_score_gemma":0.0027358998,"teacher_disagreement_score":0.014259033,"about_ca_system_score_codex":0.0029019061,"about_ca_system_score_gemma":0.0013139679,"threshold_uncertainty_score":0.04770124},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007921342,0.0045645116,0.027795052,0.12851822,0.16979477,0.00082051306,0.01148721,0.014658946,0.6344394],"genre_scores_gemma":[0.047455166,0.0033597823,0.0074468898,0.017556923,0.019179024,0.0005590915,0.017493658,0.0054097255,0.88153964],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9811065,0.0024852296,0.00081925694,0.0013262999,0.010662954,0.0035996635],"domain_scores_gemma":[0.90084857,0.006679882,0.0018187099,0.0050578625,0.047320466,0.03827454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019020671,0.0014007818,0.0025296623,0.003879192,0.0031873463,0.012888457,0.003507043,0.005393759,0.29866603],"category_scores_gemma":[0.044516854,0.00060574396,0.0017528054,0.0026384525,0.0023938015,0.0067855828,0.008195821,0.00712498,0.23782282],"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.00019308242,0.0001136919,0.0005475572,0.000093952985,0.00001898899,0.00018778193,0.000031421336,0.00036466008,0.00034958925,0.013097395,0.9420126,0.042989172],"study_design_scores_gemma":[0.0000977218,0.00020606501,0.0011348481,0.00012566792,0.000019579282,0.000232158,0.000130442,0.0020556028,0.0010789679,0.00796464,0.98690224,0.00005201898],"about_ca_topic_score_codex":0.004218862,"about_ca_topic_score_gemma":0.005399313,"teacher_disagreement_score":0.29866603,"about_ca_system_score_codex":0.008461295,"about_ca_system_score_gemma":0.015861506,"threshold_uncertainty_score":0.9991374},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012363125,0.0027630925,0.0006877261,0.11783517,0.86421543,0.00003816631,0.0009365678,0.00033797,0.013062285],"genre_scores_gemma":[0.010047843,0.012780672,0.0031336062,0.1664243,0.30639392,0.00025711695,0.003122412,0.001194179,0.496646],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961953,0.00064714235,0.0005313246,0.0006462915,0.0015637876,0.00041615785],"domain_scores_gemma":[0.980682,0.0040110806,0.0006326452,0.001063588,0.012811696,0.0007989598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029591674,0.0023532137,0.002420853,0.003944058,0.0049302736,0.0038986614,0.0039539495,0.006872013,0.09798762],"category_scores_gemma":[0.031935003,0.0012910235,0.0023973433,0.002504852,0.0031705133,0.004879917,0.0027249127,0.010209233,0.06464235],"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.000011244209,0.000004078594,0.000019936475,0.000044417247,0.0000049762534,0.000046940906,0.000011327689,0.000018364854,0.000019439929,0.0010975357,0.99719197,0.0015297369],"study_design_scores_gemma":[0.000026187814,0.000018018216,0.00069769827,0.00016453257,0.000028803383,0.0001581659,0.00006249396,0.00019904246,0.00021906952,0.0052400935,0.9931404,0.00004550419],"about_ca_topic_score_codex":0.03035968,"about_ca_topic_score_gemma":0.040004928,"teacher_disagreement_score":0.09798762,"about_ca_system_score_codex":0.0066016787,"about_ca_system_score_gemma":0.0043537463,"threshold_uncertainty_score":0.32780123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087129034,0.9522539,0.006293007,0.009031415,0.001686142,0.000012689742,0.00004719062,0.00006413984,0.029740177],"genre_scores_gemma":[0.014241003,0.9715584,0.0028700246,0.0027719461,0.0013065785,0.000027684811,0.000059674774,0.00002964323,0.0071351742],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997137,0.00007588886,0.000018545259,0.000051158437,0.00010175768,0.00003887819],"domain_scores_gemma":[0.9993368,0.00042007165,0.000037161793,0.00005727193,0.00010181919,0.000046848014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008876632,0.0006757826,0.0006090991,0.0013371037,0.00065045623,0.0020573519,0.0011061502,0.0012979686,0.00930566],"category_scores_gemma":[0.0016002145,0.00021649078,0.00032805558,0.0016291677,0.0027471583,0.0051260293,0.0016405422,0.003203065,0.002347878],"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.000067162124,0.000038943697,0.00014630925,0.003980082,0.000036350724,0.00015009101,0.0002864742,0.00067006785,0.0012584375,0.47036266,0.037270397,0.485733],"study_design_scores_gemma":[0.0000075843886,0.000020249101,0.00014259072,0.0013146689,0.000014590153,0.00028807524,0.00009524252,0.0001895703,0.0004804383,0.13444638,0.86299056,0.000010063918],"about_ca_topic_score_codex":0.0006075737,"about_ca_topic_score_gemma":0.001329313,"teacher_disagreement_score":0.00930566,"about_ca_system_score_codex":0.0009855302,"about_ca_system_score_gemma":0.0015280661,"threshold_uncertainty_score":0.031130493},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000571539,0.015498277,0.0027607924,0.016684895,0.07353791,0.00009600837,0.0026323008,0.002142594,0.8860757],"genre_scores_gemma":[0.0021978316,0.0054875254,0.0006845418,0.0019341335,0.0074460357,0.00004717662,0.0008886383,0.0005055403,0.9808085],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991742,0.00009559942,0.000039455714,0.00025976181,0.00034372412,0.000087253204],"domain_scores_gemma":[0.99867475,0.00015400154,0.00008876958,0.00025581557,0.0005100617,0.00031668574],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008881861,0.0014027521,0.00081232097,0.0037042333,0.0016598586,0.0060313526,0.0010346224,0.0019877204,0.58042896],"category_scores_gemma":[0.0027092693,0.00041604013,0.0006271406,0.0025512413,0.0014232574,0.0026860598,0.0026947164,0.00286299,0.45132363],"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.000030933123,0.0000152015655,0.00013286946,0.00010316461,0.000006300167,0.000039211463,0.000046645393,0.00003864429,0.00019435563,0.011279352,0.930884,0.057229444],"study_design_scores_gemma":[0.000003993484,0.0000044330486,0.00016865089,0.00004946185,0.0000017534811,0.000029520743,0.000016550888,0.000024783209,0.00005982225,0.0008440205,0.9987941,0.0000029234009],"about_ca_topic_score_codex":0.005060591,"about_ca_topic_score_gemma":0.0075516426,"teacher_disagreement_score":0.58042896,"about_ca_system_score_codex":0.0027583675,"about_ca_system_score_gemma":0.0017556204,"threshold_uncertainty_score":0.5984671},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042601004,0.0439245,0.72150105,0.017917695,0.002842851,0.00028256592,0.0012046456,0.0012104232,0.2068561],"genre_scores_gemma":[0.3163724,0.096050814,0.47140014,0.017927488,0.0080302805,0.0017694075,0.003551219,0.0019173218,0.082980916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993785,0.0024471504,0.00042253762,0.0009195597,0.0020498768,0.00037587294],"domain_scores_gemma":[0.9847675,0.011345022,0.0006958194,0.0020982558,0.0009319594,0.00016139027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005759392,0.001547192,0.0010319911,0.0023689081,0.0015583258,0.0052634156,0.0031673005,0.0033790218,0.024463966],"category_scores_gemma":[0.025574343,0.0007410308,0.0018783485,0.0031525777,0.0062500457,0.015727887,0.0043273275,0.005596534,0.008109498],"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.000012750154,0.000012826671,0.000050830426,0.0002812234,0.000009451952,0.00003391498,0.00007002234,0.00050759973,0.00011463928,0.96021056,0.007362315,0.031333942],"study_design_scores_gemma":[0.00001774242,0.0000142997915,0.00006934829,0.00042226916,0.000018455079,0.00029412136,0.00005175371,0.0016068132,0.0005767308,0.8797192,0.11719049,0.000018874574],"about_ca_topic_score_codex":0.00046468808,"about_ca_topic_score_gemma":0.00031390152,"teacher_disagreement_score":0.024463966,"about_ca_system_score_codex":0.00285178,"about_ca_system_score_gemma":0.0017346267,"threshold_uncertainty_score":0.08184016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18785965,0.0051239305,0.62507474,0.025860185,0.00054369407,0.00028718956,0.0010936524,0.00040375887,0.15375318],"genre_scores_gemma":[0.9185398,0.002204428,0.071861245,0.0009688052,0.00066694285,0.0004648449,0.00042496098,0.00011207335,0.004756944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593383,0.0013784674,0.00037271244,0.00052010367,0.0013876648,0.00040735182],"domain_scores_gemma":[0.982462,0.012292273,0.0014671147,0.0018473384,0.0013781334,0.0005532077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003711424,0.0006910955,0.0011925027,0.0018868822,0.0021727588,0.006446444,0.0017091191,0.0028440726,0.004856021],"category_scores_gemma":[0.028604204,0.0008891023,0.001412257,0.001407114,0.008174704,0.013262539,0.0038844158,0.0034112858,0.0007602858],"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.000020684538,0.000016237738,0.00039234132,0.00009134622,0.000016205238,0.00012884891,0.00024207031,0.018701348,0.0005445372,0.9764431,0.00066703174,0.0027362243],"study_design_scores_gemma":[0.000010650003,0.000014936607,0.00020328815,0.000023826578,0.0000075089647,0.00007514449,0.000074971336,0.03304521,0.00017091728,0.96445966,0.0018978018,0.00001604149],"about_ca_topic_score_codex":0.0015681545,"about_ca_topic_score_gemma":0.00077255256,"teacher_disagreement_score":0.006446444,"about_ca_system_score_codex":0.0027207397,"about_ca_system_score_gemma":0.0020804973,"threshold_uncertainty_score":0.019740462},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02675246,0.0012107496,0.91219735,0.007939999,0.0007021958,0.00039261463,0.0016983759,0.0033725302,0.04573378],"genre_scores_gemma":[0.5727255,0.001747341,0.39317304,0.0044813547,0.0014304788,0.0011891259,0.0030975374,0.0022317683,0.019923948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98784256,0.004769697,0.00067122077,0.001401867,0.0042245747,0.0010900763],"domain_scores_gemma":[0.8962344,0.08766724,0.0014977377,0.009514568,0.0040162965,0.0010696343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007570582,0.0032264981,0.002142134,0.0027505034,0.002454196,0.008648285,0.0062145917,0.0030052888,0.024454046],"category_scores_gemma":[0.05831847,0.003164476,0.0037550658,0.0032610684,0.005964531,0.017709171,0.011013867,0.013304638,0.004108591],"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.00041492327,0.00030696814,0.00052177114,0.0007510166,0.00017583976,0.0002379434,0.0006213732,0.019653903,0.0039553763,0.91424453,0.01305568,0.046060544],"study_design_scores_gemma":[0.000105281186,0.00003407753,0.00010798198,0.00010050084,0.000098192206,0.000075012525,0.00006872713,0.03328498,0.003829312,0.9566602,0.005604452,0.000031228836],"about_ca_topic_score_codex":0.0011735008,"about_ca_topic_score_gemma":0.0030173296,"teacher_disagreement_score":0.024454046,"about_ca_system_score_codex":0.0040002875,"about_ca_system_score_gemma":0.0033429705,"threshold_uncertainty_score":0.08180696},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15917338,0.0024583312,0.36533564,0.010743992,0.0004535396,0.00011712344,0.00009887711,0.0010063838,0.46061268],"genre_scores_gemma":[0.94907564,0.00062870356,0.021939568,0.00084945385,0.00015420683,0.000064028995,0.00005707455,0.00008821545,0.027143044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993864,0.00016303605,0.000022147742,0.00015802855,0.0001924285,0.00007797477],"domain_scores_gemma":[0.99888235,0.00032422168,0.00012795588,0.00040176022,0.00015039709,0.0001132765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008835272,0.00023793544,0.00024421976,0.00039401764,0.00062733603,0.0016754256,0.00070769497,0.0009616081,0.0044367844],"category_scores_gemma":[0.0029344524,0.00015904395,0.0004356839,0.00031323935,0.003892058,0.0028319964,0.00217103,0.0012685317,0.00060261966],"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.000009050269,0.000015437134,0.00021374214,0.000023019255,0.0000050149733,0.000041079835,0.00018705503,0.00317698,0.0011347783,0.9877774,0.00097424356,0.0064421026],"study_design_scores_gemma":[0.00001090448,0.000024013858,0.0002784569,0.00001457409,0.00000639674,0.00006130797,0.000086149616,0.01621868,0.0008176068,0.95863,0.02384439,0.0000075486682],"about_ca_topic_score_codex":0.0007985168,"about_ca_topic_score_gemma":0.00074114493,"teacher_disagreement_score":0.0044367844,"about_ca_system_score_codex":0.0013387959,"about_ca_system_score_gemma":0.00064583786,"threshold_uncertainty_score":0.01484257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004551942,0.0005293936,0.96988255,0.0011152355,0.00024155513,0.00012609277,0.0003387087,0.0017946172,0.021419844],"genre_scores_gemma":[0.13761137,0.001196467,0.8120853,0.000721713,0.0002514601,0.0005027099,0.0012809113,0.0009187136,0.045431428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977933,0.00042463493,0.00011882832,0.0005420842,0.0008980155,0.00022306715],"domain_scores_gemma":[0.99787164,0.0009695709,0.00007936749,0.0004360529,0.000555739,0.000087677545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015432466,0.0013172269,0.0011948113,0.001543478,0.0017077,0.0051607983,0.0020888268,0.002590265,0.026101844],"category_scores_gemma":[0.008794454,0.0007809596,0.001958516,0.0017619426,0.0022300782,0.0049236175,0.0030679447,0.003732527,0.009495279],"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.0002344227,0.0001236335,0.0010173054,0.00045607466,0.00014222776,0.00024788582,0.00036760652,0.092471875,0.0051522735,0.51053137,0.029893354,0.35936204],"study_design_scores_gemma":[0.00011746663,0.00012938691,0.00043431937,0.00009144927,0.00005110171,0.00040608764,0.00015241523,0.60173506,0.0047676116,0.2968712,0.09519332,0.000050586277],"about_ca_topic_score_codex":0.0097681815,"about_ca_topic_score_gemma":0.0094817225,"teacher_disagreement_score":0.026101844,"about_ca_system_score_codex":0.002107324,"about_ca_system_score_gemma":0.0032876595,"threshold_uncertainty_score":0.08731943},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1490847,0.025349485,0.10712402,0.25353405,0.002941687,0.00014469757,0.00036808418,0.00092080043,0.46053246],"genre_scores_gemma":[0.9670693,0.0051708026,0.009140819,0.007013541,0.00074237376,0.00008326479,0.000094256386,0.00014022573,0.010545313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791366,0.00063071935,0.00010090566,0.00048500075,0.0005495485,0.00032011562],"domain_scores_gemma":[0.993853,0.0030944683,0.00042938985,0.0012559961,0.0008470054,0.0005202278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024483488,0.00033707524,0.0006073577,0.0006906916,0.00234003,0.005364235,0.00092066044,0.0031073093,0.0067479103],"category_scores_gemma":[0.014736061,0.00035323782,0.000498626,0.0004727609,0.021834586,0.016227068,0.003152888,0.0038931132,0.0016673085],"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.000035240537,0.00001343963,0.00042998613,0.00012132937,0.000008992324,0.00019326316,0.0023118274,0.00021321788,0.0004981081,0.9787836,0.004397908,0.012993104],"study_design_scores_gemma":[0.000013140643,0.000017940158,0.00037094523,0.00006975513,0.0000059877934,0.00021853774,0.0006382328,0.000364049,0.00032917672,0.96421045,0.033748392,0.000013453803],"about_ca_topic_score_codex":0.0010060635,"about_ca_topic_score_gemma":0.0004607214,"teacher_disagreement_score":0.0067479103,"about_ca_system_score_codex":0.0013693171,"about_ca_system_score_gemma":0.0017231208,"threshold_uncertainty_score":0.022574008},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025028344,0.07456416,0.04791615,0.0042292085,0.0021020006,0.000052241186,0.00015779355,0.00028017533,0.8681954],"genre_scores_gemma":[0.16104616,0.12151023,0.083166346,0.0030161357,0.009569804,0.0004847611,0.00071063254,0.00047361475,0.6200223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967456,0.00006264207,0.000014973715,0.000057338075,0.00015946211,0.000031061634],"domain_scores_gemma":[0.9997471,0.00014403865,0.000012343183,0.000036465073,0.000047764468,0.000012232491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028205317,0.0009308675,0.0006085873,0.001784552,0.0010581157,0.0035586501,0.0010702932,0.00087197695,0.017893799],"category_scores_gemma":[0.0011919314,0.00037679158,0.00039438365,0.0027550443,0.0038160325,0.004720838,0.0010112099,0.0026024661,0.0056052264],"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.000003872296,0.000006940893,0.000022100498,0.00013385335,0.0000025818433,0.000009417871,0.000095240575,0.00035434577,0.00017384581,0.9483057,0.019462235,0.031429924],"study_design_scores_gemma":[0.0000035236956,0.000004222841,0.00007015914,0.00007866921,0.000002861514,0.00004932938,0.000039165316,0.00060611655,0.0001122125,0.7908506,0.20817892,0.0000043148607],"about_ca_topic_score_codex":0.0011537959,"about_ca_topic_score_gemma":0.0015991033,"teacher_disagreement_score":0.017893799,"about_ca_system_score_codex":0.0020843938,"about_ca_system_score_gemma":0.0011972996,"threshold_uncertainty_score":0.059860706},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004021804,0.1395018,0.028494706,0.038435366,0.22935978,0.00083168375,0.012694699,0.0021051234,0.54455507],"genre_scores_gemma":[0.012704744,0.07536224,0.0125175435,0.004587814,0.09215371,0.0007104488,0.014496501,0.0019663807,0.7855007],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965791,0.0004880374,0.00029512678,0.00045179835,0.0020100896,0.00017580272],"domain_scores_gemma":[0.9854638,0.0019059344,0.00058126944,0.0010289833,0.008044225,0.0029757759],"candidate_categories":["bibliometrics","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033295995,0.0017051899,0.0016916131,0.006423134,0.0020268885,0.006724273,0.0012241754,0.0012238823,0.30893123],"category_scores_gemma":[0.01455142,0.0006003272,0.0018382584,0.0061856834,0.0008089974,0.003752047,0.0026609835,0.0038470805,0.18514183],"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.000051351457,0.000040949813,0.00012095862,0.00056446774,0.000024236546,0.000036572364,0.00010640745,0.00016033679,0.0006865037,0.0069387266,0.9117873,0.07948223],"study_design_scores_gemma":[0.000013215998,0.000030350171,0.0004421706,0.00028182045,0.00001779698,0.000093324146,0.00008164234,0.00022149323,0.00028469006,0.0059735603,0.9925471,0.000012879291],"about_ca_topic_score_codex":0.00074564305,"about_ca_topic_score_gemma":0.0011401539,"teacher_disagreement_score":0.9935769,"about_ca_system_score_codex":0.0028189567,"about_ca_system_score_gemma":0.0034291688,"threshold_uncertainty_score":0.9857257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1852014,0.0015250685,0.7177353,0.0056534274,0.0009217234,0.00023192936,0.0023087617,0.006434387,0.079988025],"genre_scores_gemma":[0.90052915,0.0003913283,0.07215028,0.000862716,0.00028767475,0.000104030616,0.00081008935,0.0010347094,0.02383004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961739,0.00071961636,0.00022291401,0.0009142263,0.00081850967,0.0011507807],"domain_scores_gemma":[0.97948885,0.010327305,0.0010947038,0.0068773627,0.0013395738,0.000872281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026577688,0.00079824677,0.0013772361,0.0011091031,0.0020977235,0.004569993,0.0043984754,0.0019256439,0.0188514],"category_scores_gemma":[0.019799802,0.0010331731,0.0023298275,0.002145111,0.0035132875,0.013831039,0.0042708092,0.0060331477,0.0020190352],"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.0019205933,0.000195555,0.0020510696,0.00029810643,0.0000928111,0.00029551,0.00039152498,0.030636033,0.0033977018,0.90098137,0.014523929,0.045215804],"study_design_scores_gemma":[0.00008129346,0.000038087277,0.00017918646,0.000020455045,0.000064687134,0.00017455404,0.000066760455,0.050110605,0.0022740727,0.9441394,0.0028176482,0.00003328367],"about_ca_topic_score_codex":0.0038631656,"about_ca_topic_score_gemma":0.004076891,"teacher_disagreement_score":0.0188514,"about_ca_system_score_codex":0.003020303,"about_ca_system_score_gemma":0.0037586745,"threshold_uncertainty_score":0.06306422},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1635141,0.0007825573,0.80005586,0.0012336911,0.00011919079,0.00006361208,0.00031464192,0.0005748531,0.033341523],"genre_scores_gemma":[0.9123874,0.00050316966,0.078854986,0.0002584388,0.00014285461,0.00013721579,0.00031385018,0.00013234022,0.007269785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985965,0.00029923097,0.00006883985,0.0004275477,0.0004530485,0.00015484626],"domain_scores_gemma":[0.9964269,0.0021207777,0.00023621265,0.00059529406,0.00048273115,0.00013810433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012686375,0.00041379908,0.0007335022,0.0009425603,0.00069471286,0.0021670691,0.0010447262,0.0010829397,0.0038419743],"category_scores_gemma":[0.008694662,0.00030501373,0.0009728071,0.000551366,0.0031024858,0.0037679172,0.0022372378,0.0024907805,0.0005032351],"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.00003529281,0.00001286709,0.00049305195,0.000047552767,0.000017202983,0.00009133313,0.0001771963,0.048066236,0.0011875115,0.94208837,0.0006673793,0.007116],"study_design_scores_gemma":[0.000010754344,0.000027366803,0.00026249114,0.000019768233,0.000012146262,0.00010076219,0.000045046363,0.27458814,0.0007703232,0.72150224,0.002649396,0.000011509132],"about_ca_topic_score_codex":0.0019120459,"about_ca_topic_score_gemma":0.0007801741,"teacher_disagreement_score":0.0038419743,"about_ca_system_score_codex":0.0014478699,"about_ca_system_score_gemma":0.0008242045,"threshold_uncertainty_score":0.012852669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017011272,0.086377606,0.022175295,0.011641575,0.0062932107,0.0001473231,0.00025475936,0.0008720264,0.8705371],"genre_scores_gemma":[0.029148161,0.10766026,0.033309426,0.007161507,0.0041865,0.00050837436,0.0007251122,0.00186042,0.8154403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985279,0.00026324895,0.000081619255,0.00022253928,0.0007910942,0.00011360039],"domain_scores_gemma":[0.9989453,0.00038090826,0.000069238275,0.000143132,0.00027835116,0.00018322947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092341326,0.0012493493,0.0005441575,0.0019581646,0.0018078105,0.0077104196,0.0012249968,0.0011457807,0.020929515],"category_scores_gemma":[0.0038015565,0.000626753,0.00040488018,0.0028997546,0.0042919824,0.010476196,0.0032514744,0.0057723545,0.01594006],"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.000013391187,0.000029926965,0.00006488955,0.0003092715,0.0000043198743,0.000071005976,0.0015913246,0.00031004642,0.00033433433,0.6966489,0.19009952,0.110523075],"study_design_scores_gemma":[0.0000016158026,0.0000042611346,0.000028207778,0.00014318878,7.4300016e-7,0.00008081753,0.0001045356,0.000069916,0.000051745712,0.033369888,0.966142,0.0000030669007],"about_ca_topic_score_codex":0.0014146751,"about_ca_topic_score_gemma":0.0016185944,"teacher_disagreement_score":0.020929515,"about_ca_system_score_codex":0.0039399574,"about_ca_system_score_gemma":0.002872453,"threshold_uncertainty_score":0.070016205},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7394323,0.0011321666,0.05440027,0.0026486423,0.00041650634,0.000045284367,0.0002013659,0.00034311984,0.20138042],"genre_scores_gemma":[0.9662788,0.00040511036,0.007605982,0.00019112074,0.00023133155,0.000021959619,0.00012191757,0.000060771792,0.025083058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997003,0.00008177879,0.00001176083,0.00005276003,0.000084732266,0.0000686753],"domain_scores_gemma":[0.99966574,0.00010280977,0.00004157873,0.000067771565,0.000052099418,0.00006997063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042376516,0.00029871648,0.00025663938,0.0008675006,0.0009823537,0.0012178342,0.00037233302,0.00037830506,0.0067888773],"category_scores_gemma":[0.001367807,0.00017202202,0.00039506963,0.0005769737,0.0028133458,0.0026313812,0.0021755842,0.0013475425,0.00089014915],"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.000018641573,0.000007509456,0.00021995275,0.000015253398,0.0000017666216,0.00006376077,0.00018190849,0.0003926388,0.0003937994,0.9939866,0.0006098962,0.0041082692],"study_design_scores_gemma":[0.000011901786,0.000017236853,0.00027873978,0.000013265353,0.0000029818348,0.00011937645,0.00014392189,0.0012827852,0.00055460253,0.9898998,0.007666434,0.000008806864],"about_ca_topic_score_codex":0.00043530762,"about_ca_topic_score_gemma":0.0003955618,"teacher_disagreement_score":0.0067888773,"about_ca_system_score_codex":0.00069241796,"about_ca_system_score_gemma":0.00033657716,"threshold_uncertainty_score":0.022711039},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010510592,0.0117473835,0.45215788,0.009423595,0.0033838789,0.00012605615,0.0010196088,0.0016527455,0.50997835],"genre_scores_gemma":[0.45494288,0.010526196,0.2992553,0.008786323,0.007954148,0.00064855785,0.0023705845,0.0020330814,0.21348298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839514,0.00054578215,0.00009279548,0.00043335205,0.00041816288,0.000114736606],"domain_scores_gemma":[0.9983134,0.00084230234,0.00007565677,0.00034769002,0.0002956345,0.00012528485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014878801,0.0012637627,0.0009943765,0.003051481,0.0027921146,0.006257288,0.0009698019,0.0015373175,0.030835189],"category_scores_gemma":[0.005006468,0.00056068617,0.0012140782,0.0024503947,0.005299939,0.011927901,0.0036445963,0.0056111193,0.00666619],"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.000008595191,0.00000948311,0.00009370648,0.000056527093,0.000006007481,0.000020724694,0.00011060028,0.00010865333,0.00011003868,0.97399306,0.006245178,0.01923749],"study_design_scores_gemma":[0.000005987438,0.0000065346226,0.000095663345,0.000026271468,0.000007737156,0.00011974374,0.00003254595,0.00056665606,0.0001950107,0.93589664,0.06304026,0.0000069858193],"about_ca_topic_score_codex":0.0006848991,"about_ca_topic_score_gemma":0.0006662259,"teacher_disagreement_score":0.030835189,"about_ca_system_score_codex":0.0016069448,"about_ca_system_score_gemma":0.000762129,"threshold_uncertainty_score":0.103153944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09718162,0.002183777,0.6861071,0.012179644,0.0011575952,0.00022006614,0.0012416585,0.0016350003,0.19809361],"genre_scores_gemma":[0.6861572,0.0010991693,0.2644701,0.0051476704,0.0010931969,0.00048239416,0.0011564026,0.00070664973,0.039687224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543107,0.0009080437,0.00036415373,0.0016685576,0.0011297651,0.00049835804],"domain_scores_gemma":[0.9921014,0.00463209,0.00038450334,0.0017518844,0.0008650847,0.00026508715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033041604,0.000686525,0.0011021984,0.0008790194,0.0026578712,0.0039141877,0.001876215,0.0014528054,0.0075509166],"category_scores_gemma":[0.010392658,0.00077740377,0.0027916024,0.0010106484,0.00709832,0.014855656,0.004800176,0.0074518844,0.0014728535],"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.00004342545,0.0000130836515,0.00015048962,0.00007796621,0.000012187757,0.00003703146,0.00014669026,0.00065982796,0.0008076217,0.99081403,0.001709206,0.0055284165],"study_design_scores_gemma":[0.00002957412,0.000028802024,0.00017009661,0.000028467011,0.000019082216,0.00013969872,0.000046593446,0.004346762,0.0020823318,0.97777075,0.015315743,0.000022053393],"about_ca_topic_score_codex":0.0017577359,"about_ca_topic_score_gemma":0.0015994171,"teacher_disagreement_score":0.0075509166,"about_ca_system_score_codex":0.00245674,"about_ca_system_score_gemma":0.001833299,"threshold_uncertainty_score":0.025260389},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8542057,0.0010643679,0.09075476,0.0024008192,0.00010246284,0.000083684856,0.00048923254,0.00039135673,0.050507594],"genre_scores_gemma":[0.9900934,0.00015708388,0.0051913653,0.00009920989,0.00006043413,0.00003434653,0.00013470328,0.000027998089,0.0042013964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997145,0.0005628597,0.000237887,0.00072766317,0.00081199803,0.000514575],"domain_scores_gemma":[0.9872677,0.0065288725,0.0010237214,0.002259086,0.0013554522,0.0015652097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020103995,0.00040059866,0.0007072159,0.0019522634,0.0011899077,0.00373177,0.0009297791,0.0009512809,0.0035357936],"category_scores_gemma":[0.010479163,0.00055608276,0.0011272636,0.0011561381,0.0051159835,0.00823526,0.0048585767,0.0024975378,0.00034505758],"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.00017162603,0.00003255236,0.004971113,0.00009601198,0.00002793671,0.00016111584,0.0016260132,0.003382048,0.0041191503,0.9776497,0.000622082,0.007140679],"study_design_scores_gemma":[0.000033807275,0.00005577009,0.0034140933,0.000028022245,0.000028676324,0.00028874332,0.00046423296,0.0061686407,0.0034481578,0.977805,0.008222247,0.00004259253],"about_ca_topic_score_codex":0.0010849476,"about_ca_topic_score_gemma":0.000943839,"teacher_disagreement_score":0.00373177,"about_ca_system_score_codex":0.001881894,"about_ca_system_score_gemma":0.0005655934,"threshold_uncertainty_score":0.013654172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06389064,0.0037362387,0.85003245,0.004901654,0.000324244,0.0001666463,0.00018994435,0.0010425342,0.07571564],"genre_scores_gemma":[0.8338772,0.0015499383,0.1451728,0.0008195531,0.0005513123,0.0003267916,0.00013100373,0.00028143564,0.01729001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977512,0.00067324983,0.00009125158,0.00044691516,0.00075616065,0.00028127147],"domain_scores_gemma":[0.990803,0.0064778347,0.0004971682,0.001421294,0.0005502219,0.00025056113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023778963,0.00066963345,0.00059401296,0.00075291184,0.0015814111,0.0027351023,0.0017843692,0.0013514239,0.01054819],"category_scores_gemma":[0.013484684,0.00039816237,0.001019398,0.0006725172,0.0044639427,0.009734647,0.004207667,0.0045758574,0.0009895454],"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.000025447243,0.000014405486,0.000051092586,0.000055552373,0.0000084391295,0.000034105182,0.00017672044,0.0041324417,0.0008018885,0.98904,0.00069584826,0.0049640923],"study_design_scores_gemma":[0.000027155918,0.000017684433,0.000053529784,0.000026653972,0.000010717418,0.000048430837,0.000021863429,0.034625567,0.0012841825,0.9561383,0.0077330135,0.000012903139],"about_ca_topic_score_codex":0.0012101826,"about_ca_topic_score_gemma":0.0008581721,"teacher_disagreement_score":0.01054819,"about_ca_system_score_codex":0.002847324,"about_ca_system_score_gemma":0.0014625778,"threshold_uncertainty_score":0.03528726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115484424,0.0074306014,0.7260515,0.009132825,0.0007041572,0.0006802988,0.004982964,0.006841609,0.12869158],"genre_scores_gemma":[0.7548263,0.004427847,0.20666619,0.0020880878,0.0012619735,0.001457655,0.0038185518,0.003671348,0.021782003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9793636,0.0042971075,0.0013695476,0.004251263,0.007037373,0.0036809796],"domain_scores_gemma":[0.86727756,0.100034826,0.004187713,0.02060086,0.0047586896,0.003140253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011953054,0.0043051215,0.0046127196,0.004618709,0.0030401496,0.0107755475,0.007177361,0.0049635093,0.020642312],"category_scores_gemma":[0.090105936,0.002706327,0.0035003652,0.005093464,0.0072675343,0.02575796,0.0132434005,0.009751651,0.006955122],"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.0031382942,0.00050889485,0.0021016002,0.0013379385,0.0002829462,0.000355161,0.00069535756,0.19490013,0.018188402,0.66423386,0.018161938,0.09609554],"study_design_scores_gemma":[0.00019495346,0.0002369358,0.00060326274,0.00029277065,0.00019960463,0.00038267023,0.00014645395,0.2896532,0.017216748,0.68185157,0.009043131,0.00017862847],"about_ca_topic_score_codex":0.0010655356,"about_ca_topic_score_gemma":0.0017019412,"teacher_disagreement_score":0.020642312,"about_ca_system_score_codex":0.00737654,"about_ca_system_score_gemma":0.0050341715,"threshold_uncertainty_score":0.06905538},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020825462,0.11631877,0.35843807,0.13584615,0.0034866557,0.00013243138,0.0011155116,0.00080630265,0.3630306],"genre_scores_gemma":[0.7935415,0.04912452,0.08641236,0.019625302,0.010645139,0.00042910056,0.000917962,0.00077790464,0.038526174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949478,0.0018672845,0.00023536678,0.0010376711,0.0015713004,0.00034061668],"domain_scores_gemma":[0.96979123,0.023332335,0.0007383162,0.00321079,0.0022857285,0.0006416077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005293329,0.00094979466,0.0013013993,0.0028582243,0.002378859,0.008441582,0.0019243904,0.0029769668,0.014220308],"category_scores_gemma":[0.02311834,0.000588226,0.001226851,0.0016466039,0.014588341,0.022425892,0.004199493,0.009061231,0.0021477707],"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.000006043656,0.0000061861338,0.00004504272,0.000066519635,0.0000052764403,0.000015027196,0.00009066967,0.00037605668,0.000067678935,0.99244046,0.0027157618,0.0041652583],"study_design_scores_gemma":[0.0000030100075,0.0000024002818,0.000036521564,0.000034864875,0.000001740199,0.000019334586,0.00002261212,0.0006334738,0.00004476679,0.987317,0.011880427,0.0000038126484],"about_ca_topic_score_codex":0.0014602281,"about_ca_topic_score_gemma":0.0005663494,"teacher_disagreement_score":0.014220308,"about_ca_system_score_codex":0.0050119483,"about_ca_system_score_gemma":0.0018478374,"threshold_uncertainty_score":0.04757166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11493704,0.0053781546,0.7540029,0.013915716,0.00085529994,0.00011277816,0.0004908138,0.00082852755,0.10947875],"genre_scores_gemma":[0.83740205,0.0022555569,0.1429744,0.0015558349,0.0013364542,0.00025405645,0.00052900857,0.00029808425,0.01339461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957028,0.0014565306,0.00041751258,0.001159378,0.0008569788,0.0004068119],"domain_scores_gemma":[0.991529,0.0056970487,0.00048780325,0.0013825673,0.00052819995,0.00037539072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047764005,0.0005519228,0.000745442,0.001365277,0.0016475228,0.0058408524,0.0015903458,0.0014923492,0.006243158],"category_scores_gemma":[0.012819597,0.0005930965,0.0016332266,0.0012668015,0.013519462,0.016928557,0.0047627226,0.004947364,0.00072347006],"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.000022356377,0.0000096329895,0.00012110087,0.000026227492,0.0000043971754,0.000030470244,0.0002540048,0.0003520959,0.0002853174,0.9897975,0.0004172316,0.008679652],"study_design_scores_gemma":[0.000017073571,0.000017766577,0.00011852446,0.000014899731,0.000008134922,0.00005549549,0.00011287185,0.002434368,0.0006499708,0.9893973,0.0071608117,0.000012772461],"about_ca_topic_score_codex":0.0010866217,"about_ca_topic_score_gemma":0.0004785123,"teacher_disagreement_score":0.006243158,"about_ca_system_score_codex":0.0020539693,"about_ca_system_score_gemma":0.00075042585,"threshold_uncertainty_score":0.02526033},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02176742,0.0004936072,0.5319509,0.0046731764,0.00034452614,0.000091399146,0.00014282657,0.00037100946,0.44016513],"genre_scores_gemma":[0.82942986,0.00031187152,0.11559135,0.0005213783,0.00011882686,0.0002176222,0.00013105855,0.00034634816,0.053331655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988783,0.000497638,0.000054837663,0.00012404996,0.00031735955,0.00012776906],"domain_scores_gemma":[0.9989851,0.00044632165,0.00006672506,0.00026540874,0.0001674744,0.000069022615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017045764,0.00060581067,0.00038312303,0.0006514647,0.0018490447,0.004439125,0.0012138088,0.0017442246,0.012822524],"category_scores_gemma":[0.0044412646,0.0006040898,0.00087762,0.0007209002,0.009789855,0.005867157,0.003341368,0.0043381164,0.0020482673],"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.0000027742872,0.000003268311,0.000012445974,0.000006614686,0.0000011023908,0.0000058266937,0.0003242141,0.00033537793,0.00007918272,0.9974815,0.0002900693,0.0014577472],"study_design_scores_gemma":[0.000003442375,0.000002389713,0.000013234184,0.000006071406,0.0000012213552,0.0000066737844,0.00011567464,0.0012755764,0.000097296404,0.99466103,0.0038142467,0.000003248333],"about_ca_topic_score_codex":0.0011878207,"about_ca_topic_score_gemma":0.0017928999,"teacher_disagreement_score":0.012822524,"about_ca_system_score_codex":0.0025854167,"about_ca_system_score_gemma":0.0012866056,"threshold_uncertainty_score":0.042895675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05928335,0.00028995686,0.92721504,0.00025987352,0.000037118265,0.000057650093,0.00007067224,0.000994149,0.011792308],"genre_scores_gemma":[0.3644063,0.00016316207,0.63008285,0.00010152067,0.000035705245,0.00015272314,0.00017225905,0.00043162215,0.004453925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997595,0.00007919661,0.000014246996,0.000029237734,0.00007805939,0.000039756567],"domain_scores_gemma":[0.9994431,0.0003430869,0.000037910704,0.00005870213,0.00007812114,0.00003901878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006966747,0.00060861453,0.00082698424,0.001116981,0.0009333276,0.0013279066,0.0013544526,0.0006547325,0.005075831],"category_scores_gemma":[0.0029333143,0.00038628207,0.00073211256,0.00077679055,0.0008239666,0.0016439299,0.0017023926,0.0010848112,0.0010070201],"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.0001684829,0.000110826586,0.0014471436,0.00020607591,0.00006946544,0.00028559624,0.00050394266,0.3575393,0.0063689263,0.44943953,0.0031747718,0.18068594],"study_design_scores_gemma":[0.000013743342,0.000008541079,0.00006748105,0.000013378812,0.0000072799503,0.000021932285,0.00003195858,0.82996,0.00096094154,0.1676007,0.001307469,0.000006581053],"about_ca_topic_score_codex":0.0018562071,"about_ca_topic_score_gemma":0.0041479785,"teacher_disagreement_score":0.005075831,"about_ca_system_score_codex":0.0010500427,"about_ca_system_score_gemma":0.00092393695,"threshold_uncertainty_score":0.01698041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017459925,0.0014811857,0.9222807,0.0068683135,0.00027596147,0.000105613806,0.00022398842,0.00039260674,0.05091182],"genre_scores_gemma":[0.7285886,0.002538128,0.25332978,0.002151119,0.0010492549,0.00042437538,0.00047134137,0.00037242338,0.011074918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949561,0.0023878783,0.00023333539,0.00082404347,0.0012420326,0.000356606],"domain_scores_gemma":[0.98776233,0.008456411,0.00062818173,0.0021035867,0.0006968979,0.00035263234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063856305,0.00075001264,0.0011384826,0.0019629232,0.0017170928,0.0069557345,0.0022344645,0.0028147548,0.0049675265],"category_scores_gemma":[0.022569139,0.0007174299,0.0019691742,0.0012901385,0.012794234,0.016538333,0.0049596913,0.0058134687,0.00087060424],"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.0000037552707,0.0000050604062,0.00006117906,0.000016713706,0.000004306827,0.000020958705,0.00010859756,0.0013672567,0.000049630715,0.99656075,0.00029476415,0.0015069789],"study_design_scores_gemma":[0.000004264494,0.000004224461,0.000026059815,0.000009703634,0.000002680809,0.000011435745,0.000013425001,0.009377119,0.000049204733,0.9893867,0.0011100312,0.000005152376],"about_ca_topic_score_codex":0.0018058236,"about_ca_topic_score_gemma":0.0010996038,"teacher_disagreement_score":0.0069557345,"about_ca_system_score_codex":0.0025140236,"about_ca_system_score_gemma":0.0025501943,"threshold_uncertainty_score":0.0337708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76110697,0.00093582703,0.21637815,0.004491925,0.00028787577,0.00003746426,0.00019494796,0.0006088102,0.01595802],"genre_scores_gemma":[0.9944159,0.000067335466,0.0043941964,0.00012598027,0.00009023759,0.000016271766,0.000024242456,0.000045767967,0.00082005974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989786,0.0002763684,0.000032047083,0.00038156248,0.00022531893,0.00010612643],"domain_scores_gemma":[0.99022394,0.0058922092,0.00129017,0.0017164666,0.00046115534,0.00041595477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017741903,0.00024686,0.00064631755,0.0009965693,0.0011324595,0.0020193646,0.0010324946,0.000981832,0.0039197393],"category_scores_gemma":[0.026496742,0.00044643704,0.00045740657,0.00060812605,0.0046725306,0.0044255177,0.0014287736,0.0021788804,0.00038047583],"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.00020319346,0.000034061955,0.0041652373,0.0000790266,0.00003129074,0.00019559886,0.00066564995,0.010090695,0.0056024995,0.9677899,0.0015063803,0.009636559],"study_design_scores_gemma":[0.0000312508,0.0000904925,0.0028237258,0.000021000253,0.000011732145,0.00020492559,0.00012606883,0.061400052,0.002086032,0.9319239,0.0012393512,0.000041395688],"about_ca_topic_score_codex":0.00035877354,"about_ca_topic_score_gemma":0.0002599603,"teacher_disagreement_score":0.0039197393,"about_ca_system_score_codex":0.0008213092,"about_ca_system_score_gemma":0.0003822917,"threshold_uncertainty_score":0.013112843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93421197,0.0002749805,0.052146353,0.00082414225,0.000025528143,0.000046714664,0.0007572035,0.00026927414,0.011443845],"genre_scores_gemma":[0.9891803,0.00009894783,0.00783337,0.000070122434,0.000060621016,0.000039378097,0.0006725389,0.000049197795,0.0019954995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974139,0.00058226055,0.00020845814,0.00034573072,0.0010339123,0.00041572817],"domain_scores_gemma":[0.9865481,0.009503255,0.0013344665,0.000725878,0.0010925554,0.0007956446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016266559,0.00040672853,0.000749269,0.0019339168,0.0011956498,0.004371075,0.00088252773,0.0008628614,0.0069104456],"category_scores_gemma":[0.01072682,0.00047722613,0.0010070278,0.0011432045,0.0023178756,0.007841727,0.0016370612,0.001390928,0.00040207276],"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.0010054418,0.00026240473,0.015794374,0.00059449737,0.0001833735,0.0007683143,0.002952721,0.058982514,0.015883327,0.876832,0.003908602,0.022832548],"study_design_scores_gemma":[0.00007755084,0.00018268796,0.009376008,0.00005933544,0.00009631203,0.0003681373,0.0008365751,0.15531817,0.009856343,0.81984115,0.0038683359,0.00011937617],"about_ca_topic_score_codex":0.0017544215,"about_ca_topic_score_gemma":0.0021223703,"teacher_disagreement_score":0.0069104456,"about_ca_system_score_codex":0.0024820617,"about_ca_system_score_gemma":0.0008809067,"threshold_uncertainty_score":0.023117721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2838582,0.040310945,0.40022442,0.016425265,0.0013718774,0.00011454689,0.0008263091,0.00048487526,0.2563835],"genre_scores_gemma":[0.9505525,0.0046904166,0.03200347,0.0005764498,0.0014923656,0.00007777287,0.00025525558,0.000047651356,0.010304071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977349,0.0008735099,0.00015597294,0.00046079402,0.00056339335,0.0002113893],"domain_scores_gemma":[0.99436545,0.0039861132,0.000330703,0.0007145863,0.00035839455,0.00024481345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035409618,0.00066662324,0.0011247918,0.0025408694,0.0026558824,0.0060944157,0.0018946346,0.0013701845,0.0032176538],"category_scores_gemma":[0.007459136,0.0006504764,0.0014461916,0.0021614877,0.011217761,0.014613514,0.00283114,0.0048319544,0.00033253452],"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.000009065437,0.000006081779,0.00006340472,0.000022518718,0.0000038757657,0.000008153397,0.00007943865,0.0004090616,0.00007277461,0.99720544,0.00022748433,0.0018926329],"study_design_scores_gemma":[0.000006685267,0.000003986161,0.000071796865,0.000009487527,0.0000044813,0.00001475332,0.000015387344,0.0011582379,0.00007676126,0.9968913,0.0017422589,0.0000049152763],"about_ca_topic_score_codex":0.0014154656,"about_ca_topic_score_gemma":0.0008914193,"teacher_disagreement_score":0.0060944157,"about_ca_system_score_codex":0.002773887,"about_ca_system_score_gemma":0.0015540672,"threshold_uncertainty_score":0.020125985},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042415,0.008196457,0.31813267,0.018741632,0.0015341459,0.00015827896,0.0005994907,0.0010257626,0.60919654],"genre_scores_gemma":[0.91269034,0.0018785965,0.030026946,0.0021869882,0.0005229887,0.0003234293,0.00057131116,0.00047609626,0.051323283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697447,0.00077578676,0.00017639824,0.001128007,0.0005275855,0.0004177499],"domain_scores_gemma":[0.9958204,0.001600951,0.00022751006,0.0014923428,0.0006577897,0.00020088821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023884918,0.00059861,0.0006985974,0.001106068,0.0028130396,0.0044995476,0.0018765775,0.0018368197,0.013830493],"category_scores_gemma":[0.0077309166,0.00037781816,0.0010923679,0.0008234449,0.013697329,0.010955288,0.0053025363,0.004342984,0.0022911036],"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.0000074442382,0.0000031034185,0.00008800083,0.000020185058,0.0000025832437,0.000028218345,0.0002659816,0.00015570526,0.00009690427,0.9961831,0.0009883089,0.0021603375],"study_design_scores_gemma":[0.0000069067482,0.0000078955345,0.00015724784,0.00003610976,0.00000669342,0.00011187929,0.00010299365,0.0015621284,0.00054196623,0.9494821,0.04797441,0.000009662066],"about_ca_topic_score_codex":0.0016626164,"about_ca_topic_score_gemma":0.0009534677,"teacher_disagreement_score":0.013830493,"about_ca_system_score_codex":0.0032726077,"about_ca_system_score_gemma":0.0015682143,"threshold_uncertainty_score":0.04626757},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117051415,0.07254757,0.070239715,0.056125443,0.113966696,0.0008154489,0.003984231,0.0033798853,0.6672358],"genre_scores_gemma":[0.022043435,0.038446203,0.031667538,0.0061412454,0.017418368,0.00047083487,0.006293261,0.0014658443,0.8760532],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990872,0.00019213952,0.000052105926,0.0001522502,0.0003707703,0.00014558455],"domain_scores_gemma":[0.9982944,0.00035083768,0.000059553022,0.00021527773,0.00072574447,0.00035430698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020618467,0.0011444144,0.00093279814,0.001185027,0.0011239744,0.005569534,0.0013639976,0.0023199243,0.12694502],"category_scores_gemma":[0.0030216444,0.00036707267,0.00063048437,0.0014351474,0.0015347068,0.004299208,0.0017153731,0.003689623,0.08098367],"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.00013479272,0.000118199656,0.00042775454,0.00020815314,0.000020339461,0.00014661181,0.00013454742,0.00034001123,0.0016093729,0.009116349,0.8440136,0.14373042],"study_design_scores_gemma":[0.000019039264,0.000033795357,0.00053168245,0.00019751,0.000011347481,0.00014417696,0.00010623026,0.00080792536,0.0005594081,0.0044831284,0.99309266,0.000013147726],"about_ca_topic_score_codex":0.0034443522,"about_ca_topic_score_gemma":0.004403586,"teacher_disagreement_score":0.12694502,"about_ca_system_score_codex":0.001591967,"about_ca_system_score_gemma":0.002197207,"threshold_uncertainty_score":0.42467338},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018610384,0.062748745,0.22110507,0.027037578,0.07294948,0.00025616368,0.0012918374,0.0028490087,0.59315175],"genre_scores_gemma":[0.12749693,0.033014476,0.10206843,0.0036596952,0.014852627,0.00031959693,0.0041866917,0.002263299,0.7121383],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993771,0.00015722914,0.000030190038,0.00013594519,0.00020310128,0.000096465425],"domain_scores_gemma":[0.99900085,0.00025418724,0.000024584975,0.00028864233,0.0002563764,0.00017540099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010518915,0.0008943353,0.0011923874,0.00071061176,0.001233912,0.0044734417,0.0014107507,0.001034015,0.07913558],"category_scores_gemma":[0.0019644464,0.0003511981,0.00077319256,0.0010436872,0.0013537639,0.0035079697,0.0022619232,0.0025061474,0.020689826],"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.00040563697,0.00015671288,0.00045747994,0.00036494047,0.000075424,0.00014242754,0.00026161058,0.0025702836,0.003795182,0.14953738,0.59395695,0.24827613],"study_design_scores_gemma":[0.00003990021,0.00004643759,0.0005202733,0.00017897354,0.00003697846,0.00019465039,0.00009546092,0.0090940595,0.0023220722,0.09888512,0.88856256,0.000023500546],"about_ca_topic_score_codex":0.0014671604,"about_ca_topic_score_gemma":0.00274044,"teacher_disagreement_score":0.07913558,"about_ca_system_score_codex":0.0010550783,"about_ca_system_score_gemma":0.0012271736,"threshold_uncertainty_score":0.26473492},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012024192,0.11775279,0.10759678,0.04295041,0.11858098,0.000233019,0.0017617276,0.0016265556,0.59747356],"genre_scores_gemma":[0.08070451,0.06434643,0.054776475,0.0041487287,0.040460046,0.00031772553,0.00495208,0.0024494359,0.7478446],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988129,0.0003739234,0.00005567358,0.00028454093,0.00036801095,0.00010490562],"domain_scores_gemma":[0.9970874,0.0011312208,0.0000798201,0.00058956566,0.0006729502,0.00043897537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002157654,0.0010711484,0.0017626531,0.0020256052,0.0015310374,0.007059653,0.0012266471,0.0010035292,0.106150985],"category_scores_gemma":[0.0033789836,0.00041846806,0.0010827782,0.0025622365,0.0021152978,0.0053645247,0.0032429455,0.0040772683,0.02266404],"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.00019521276,0.00018268632,0.00078461703,0.00043428008,0.0000962123,0.00009492412,0.00023230468,0.0016925051,0.0011634969,0.14483537,0.651799,0.19848932],"study_design_scores_gemma":[0.00003365276,0.000045225435,0.000932206,0.00034389528,0.00005577879,0.00023123919,0.00013566227,0.0054607154,0.0009307532,0.12407722,0.86772794,0.000025787975],"about_ca_topic_score_codex":0.0025263124,"about_ca_topic_score_gemma":0.0048641735,"teacher_disagreement_score":0.106150985,"about_ca_system_score_codex":0.002627937,"about_ca_system_score_gemma":0.0021001736,"threshold_uncertainty_score":0.3551104},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011986738,0.07259522,0.111330956,0.10774655,0.08389567,0.00014468393,0.0018460656,0.0014760146,0.60897815],"genre_scores_gemma":[0.16707145,0.056769818,0.07045046,0.008084972,0.040608328,0.0005066513,0.004798834,0.0017258233,0.64998364],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847573,0.00067062036,0.00007715591,0.00025048727,0.00035266503,0.00017337382],"domain_scores_gemma":[0.9963463,0.0013461054,0.000121957455,0.0006694126,0.00087587326,0.0006403517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003411965,0.00075126666,0.0019469071,0.0020314723,0.0020467737,0.009238457,0.0014178718,0.0015083388,0.086709715],"category_scores_gemma":[0.005637721,0.00034949125,0.0010072859,0.002737352,0.0025252409,0.003861019,0.003865829,0.0043329233,0.018199556],"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.00022462395,0.00014344652,0.0014172483,0.00035843186,0.000089006244,0.000091490954,0.00030117185,0.0010193951,0.00068019197,0.2928884,0.5582968,0.14448974],"study_design_scores_gemma":[0.000038977152,0.000029634135,0.0010308322,0.00029050748,0.000056777008,0.00012641442,0.00024676952,0.0046065496,0.0004429974,0.11524964,0.8778631,0.000017838369],"about_ca_topic_score_codex":0.003532548,"about_ca_topic_score_gemma":0.00419196,"teacher_disagreement_score":0.086709715,"about_ca_system_score_codex":0.0041103824,"about_ca_system_score_gemma":0.0035050923,"threshold_uncertainty_score":0.29007286},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006186507,0.09492884,0.28229684,0.035111085,0.08823756,0.00076476956,0.005057304,0.0062372377,0.48117986],"genre_scores_gemma":[0.08025535,0.090306364,0.16967408,0.0065909247,0.03337747,0.00087150634,0.015452597,0.0035522731,0.5999195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99583435,0.0009355884,0.0004151124,0.00067052053,0.0018606752,0.000283736],"domain_scores_gemma":[0.9947466,0.0012527069,0.00016066438,0.0012662036,0.0020752,0.0004985638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035653692,0.0014809403,0.0020823574,0.0024485644,0.001625022,0.009856425,0.0019290383,0.0020675203,0.11566466],"category_scores_gemma":[0.009228394,0.0005963555,0.0018456365,0.0025709094,0.0024178317,0.0059492583,0.0038360823,0.0049305637,0.047519937],"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.00018928011,0.00007631921,0.00059550285,0.00070300064,0.00013298671,0.00022100002,0.00038615862,0.002572181,0.002827364,0.16460545,0.5469071,0.2807836],"study_design_scores_gemma":[0.000015728832,0.000035878886,0.00024558086,0.00019997786,0.00002576692,0.00017408794,0.00005937018,0.0032839403,0.00067230815,0.04232923,0.9529332,0.00002487971],"about_ca_topic_score_codex":0.0022926268,"about_ca_topic_score_gemma":0.0021370659,"teacher_disagreement_score":0.11566466,"about_ca_system_score_codex":0.0023287516,"about_ca_system_score_gemma":0.0045475448,"threshold_uncertainty_score":0.38693684},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011549065,0.017940816,0.01019725,0.3828588,0.005377469,0.000022403907,0.00021831549,0.0002571306,0.5715788],"genre_scores_gemma":[0.58281976,0.023659661,0.013830513,0.05816632,0.0023750155,0.00012623107,0.00027821082,0.0010639809,0.3176803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754107,0.0007426153,0.00004687291,0.0004150188,0.00061490334,0.0006395318],"domain_scores_gemma":[0.99695045,0.000991722,0.00009392502,0.00040237833,0.00068832585,0.00087320403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003183788,0.00045525993,0.0006393066,0.001054024,0.020093359,0.010972693,0.001566586,0.0027806328,0.021589795],"category_scores_gemma":[0.0056636776,0.0004164262,0.00042552644,0.0016265584,0.028924692,0.019296505,0.006596596,0.00755963,0.0043438976],"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.000025539155,0.000010285074,0.00018340835,0.000046091598,0.000004803936,0.00008205283,0.009430935,0.00019078364,0.00007717065,0.9200444,0.060037334,0.009867181],"study_design_scores_gemma":[0.0000088799525,0.0000072003118,0.0002295256,0.00014927698,0.0000031344466,0.000070177615,0.009852907,0.0002204814,0.00007645634,0.27377146,0.71559507,0.000015481095],"about_ca_topic_score_codex":0.1776645,"about_ca_topic_score_gemma":0.26713502,"teacher_disagreement_score":0.1776645,"about_ca_system_score_codex":0.018916259,"about_ca_system_score_gemma":0.025173655,"threshold_uncertainty_score":0.35326082},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032417797,0.016809747,0.0033611127,0.097135745,0.23448254,0.0002289529,0.0073587536,0.0014000804,0.6359813],"genre_scores_gemma":[0.009506009,0.0071181715,0.0012333682,0.0051425546,0.014148413,0.00010945889,0.0050843633,0.0004878505,0.95716995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968209,0.00024509945,0.00017662862,0.00040369702,0.0015397721,0.00081386],"domain_scores_gemma":[0.9942873,0.00016596608,0.00015743621,0.00026643366,0.0020009968,0.0031218692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032871407,0.0011442183,0.001266953,0.0030540715,0.0022969248,0.007340543,0.0018542627,0.0039135055,0.23189645],"category_scores_gemma":[0.008302921,0.00040930207,0.00096760475,0.0020485353,0.00082867313,0.0031482382,0.005049073,0.0030421184,0.21592623],"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.000037961898,0.000017866842,0.000101501835,0.00006269099,0.0000067367664,0.00003691949,0.000013017187,0.000083102925,0.00012213277,0.008742933,0.9555107,0.03526445],"study_design_scores_gemma":[0.000010864008,0.000017404118,0.000302192,0.000057506237,0.000004598308,0.000039022485,0.00001605477,0.000086702414,0.00008907012,0.0030182668,0.9963498,0.000008600648],"about_ca_topic_score_codex":0.003710481,"about_ca_topic_score_gemma":0.007420318,"teacher_disagreement_score":0.23189645,"about_ca_system_score_codex":0.004911997,"about_ca_system_score_gemma":0.00786359,"threshold_uncertainty_score":0.7757709},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022737654,0.15343429,0.015299682,0.019041944,0.06666502,0.0003313549,0.02130546,0.0020359715,0.71961254],"genre_scores_gemma":[0.018024577,0.085691005,0.0074736583,0.003322174,0.058833793,0.00068347575,0.039271552,0.002184142,0.7845156],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984434,0.0001795613,0.00013770502,0.0003197835,0.0008105006,0.000109004206],"domain_scores_gemma":[0.99730754,0.0005513067,0.00014833981,0.0003058494,0.0010338682,0.0006530302],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001817167,0.003205613,0.0024498794,0.008450292,0.0015387359,0.006643287,0.0021484934,0.0014306545,0.35474595],"category_scores_gemma":[0.0033621932,0.0006714506,0.0017847337,0.008860792,0.0012330278,0.0036391942,0.002462713,0.0035592539,0.12530601],"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.00004574841,0.000028595088,0.00008788223,0.00048873987,0.000031315176,0.000046857247,0.00003774962,0.00025746014,0.00040552532,0.015224658,0.9403694,0.04297599],"study_design_scores_gemma":[0.000017206701,0.000029518398,0.00071738637,0.00022386096,0.000022675362,0.000094502844,0.000033393808,0.00024338097,0.00018664959,0.010771998,0.9876481,0.000011294788],"about_ca_topic_score_codex":0.0040196194,"about_ca_topic_score_gemma":0.0051069628,"teacher_disagreement_score":0.645254,"about_ca_system_score_codex":0.0060844105,"about_ca_system_score_gemma":0.0024233656,"threshold_uncertainty_score":0.9203766},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009847323,0.0355395,0.036818463,0.8210734,0.0051815836,0.000030199028,0.000059894588,0.00011021943,0.091339454],"genre_scores_gemma":[0.7922516,0.035596576,0.030943157,0.1091682,0.010605137,0.00016527425,0.00009829769,0.00026869774,0.020902988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9896588,0.0053645307,0.0005128729,0.0012403054,0.002217303,0.0010062548],"domain_scores_gemma":[0.95962477,0.027879488,0.0026936717,0.0034942825,0.00326598,0.003041735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01579633,0.00063123624,0.0016560473,0.0026272521,0.0075140866,0.013977021,0.0024469877,0.008233286,0.010551295],"category_scores_gemma":[0.03334783,0.0004646272,0.0009806004,0.0023050385,0.066166066,0.04409677,0.011676099,0.015738757,0.0020730223],"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.000016339618,0.000011022965,0.0001633014,0.000062484265,0.000007200455,0.000059380483,0.0011354223,0.00005952898,0.000040522787,0.98598063,0.0067024324,0.005761763],"study_design_scores_gemma":[0.0000050470053,0.000009394061,0.00006857296,0.00010545053,0.0000037388165,0.00008664335,0.0011893731,0.0001629365,0.000049141854,0.96526575,0.033045776,0.000008134023],"about_ca_topic_score_codex":0.0016239021,"about_ca_topic_score_gemma":0.0016681444,"teacher_disagreement_score":0.01579633,"about_ca_system_score_codex":0.0039923694,"about_ca_system_score_gemma":0.004324419,"threshold_uncertainty_score":0.08354002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80822664,0.0004556457,0.17215617,0.00030656654,0.000035178087,0.000051621766,0.00030297006,0.00018744504,0.018277679],"genre_scores_gemma":[0.980053,0.00022464461,0.017243799,0.000055118668,0.000019035899,0.000037329813,0.00014738596,0.000023149625,0.00219654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961925,0.00008012983,0.000016618074,0.000072202834,0.00010193668,0.00010995695],"domain_scores_gemma":[0.9982199,0.0011189205,0.00022592125,0.00011171857,0.00020593507,0.0001174249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042361591,0.00035432217,0.0002476946,0.0009332022,0.000510328,0.00065479835,0.0004266825,0.00030021308,0.0019461467],"category_scores_gemma":[0.003375576,0.0001593875,0.00033380502,0.000568896,0.0006453441,0.0009423219,0.00051312434,0.00040116636,0.000109288056],"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.00033026742,0.000087895816,0.0069672633,0.00025533015,0.00007337557,0.000587137,0.000702501,0.43610963,0.0498605,0.4594259,0.0028059185,0.042794272],"study_design_scores_gemma":[0.0000493067,0.00014469742,0.00424097,0.000025188203,0.000025329748,0.00062106916,0.0002117675,0.6559583,0.014698027,0.31607237,0.007920886,0.000032083015],"about_ca_topic_score_codex":0.0016017281,"about_ca_topic_score_gemma":0.0016153367,"teacher_disagreement_score":0.0019461467,"about_ca_system_score_codex":0.00079528306,"about_ca_system_score_gemma":0.00029916078,"threshold_uncertainty_score":0.006510496},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00392314,0.13477294,0.026926562,0.03534497,0.21844395,0.0008370032,0.0131325545,0.0019839278,0.5646349],"genre_scores_gemma":[0.010770231,0.06712144,0.011352514,0.0039037985,0.079130694,0.0006491484,0.0135649955,0.0017042799,0.8118029],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968771,0.00045267752,0.0002753954,0.00041191958,0.0018206969,0.00016224793],"domain_scores_gemma":[0.9863578,0.0017748809,0.0005465477,0.0009551626,0.0076189507,0.0027467145],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031287265,0.0017347703,0.0016944265,0.0064250855,0.0019692858,0.0066108285,0.0011848294,0.0011627121,0.31992325],"category_scores_gemma":[0.0130923195,0.0005836939,0.0018459272,0.006439924,0.00077036076,0.0034731291,0.0025158932,0.003622751,0.19200279],"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.00005242793,0.000041642546,0.00011712827,0.0005345979,0.000022971202,0.00003597118,0.00009523505,0.00015623962,0.0007238619,0.006418326,0.91426885,0.077532694],"study_design_scores_gemma":[0.000013589541,0.000029858422,0.00046106608,0.00026291845,0.000017441462,0.00008908954,0.000078104094,0.0002333426,0.00028127304,0.0052639963,0.99325657,0.00001263133],"about_ca_topic_score_codex":0.00081420835,"about_ca_topic_score_gemma":0.0012272864,"teacher_disagreement_score":0.31992325,"about_ca_system_score_codex":0.0026990843,"about_ca_system_score_gemma":0.0033378524,"threshold_uncertainty_score":0.97004694},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010776874,0.00077211787,0.95603657,0.007170588,0.0007310059,0.00045657184,0.0010732192,0.0014780321,0.021505011],"genre_scores_gemma":[0.3258776,0.002358636,0.6338556,0.00743828,0.0030266198,0.003102779,0.0016713402,0.0014751966,0.021193938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902367,0.0019829585,0.0005387061,0.0023235576,0.003963521,0.0009544746],"domain_scores_gemma":[0.9635558,0.023349186,0.0017260228,0.005991615,0.0034987514,0.0018784903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063589835,0.0029514718,0.00257545,0.0024500766,0.0035129488,0.0048993435,0.005386018,0.0027284212,0.02601148],"category_scores_gemma":[0.0367177,0.0017041336,0.0054132454,0.003614735,0.008681028,0.019695442,0.01456771,0.020200467,0.004073005],"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.00042911488,0.00044976454,0.0010210143,0.0008493697,0.00017260567,0.0006087534,0.00081026397,0.029813122,0.014878546,0.87318456,0.02116211,0.05662081],"study_design_scores_gemma":[0.00017086977,0.00020840243,0.00049483846,0.00012628932,0.00007354164,0.00043937447,0.00014628065,0.08207352,0.008346268,0.8863983,0.021417186,0.00010512895],"about_ca_topic_score_codex":0.0016789784,"about_ca_topic_score_gemma":0.0013139666,"teacher_disagreement_score":0.02601148,"about_ca_system_score_codex":0.0030711622,"about_ca_system_score_gemma":0.0046410244,"threshold_uncertainty_score":0.087017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16884562,0.007203455,0.71825886,0.016167419,0.0005045618,0.00009957533,0.00023978013,0.0005148624,0.08816583],"genre_scores_gemma":[0.95713675,0.0014871106,0.031655215,0.0011743417,0.0003505647,0.00013101909,0.00008460874,0.000040828476,0.007939619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995876,0.00013463959,0.000014593378,0.000068256486,0.0001416363,0.000053252483],"domain_scores_gemma":[0.9982615,0.0011260555,0.00016452897,0.00020591774,0.00015785806,0.0000840008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008649634,0.00037954518,0.00033598294,0.00090884726,0.0006145088,0.0009835665,0.00055150007,0.00095157634,0.0023567954],"category_scores_gemma":[0.00551407,0.00018646616,0.00029911828,0.00051982584,0.0035398367,0.0028067785,0.0010908211,0.0015405539,0.00039339572],"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.00001232714,0.0000028025634,0.000106945576,0.000015201647,0.0000032489475,0.000026093618,0.000037852,0.0028802191,0.0004392576,0.99225956,0.00074589945,0.0034705151],"study_design_scores_gemma":[0.0000096313615,0.000010692274,0.0001330361,0.0000072519556,0.0000018053317,0.00003660748,0.000010508142,0.014523345,0.00040209803,0.98245335,0.0024050223,0.000006621703],"about_ca_topic_score_codex":0.0006907343,"about_ca_topic_score_gemma":0.0004942976,"teacher_disagreement_score":0.0023567954,"about_ca_system_score_codex":0.00076279126,"about_ca_system_score_gemma":0.00046127263,"threshold_uncertainty_score":0.007884264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018722504,0.00053521694,0.87507707,0.0026641905,0.00018343351,0.00009007186,0.0005567818,0.0006691316,0.10150165],"genre_scores_gemma":[0.5867983,0.0013358243,0.37827903,0.0010132038,0.000413233,0.00035706995,0.0010916803,0.0004591918,0.03025248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729604,0.0008825509,0.00011819013,0.0004929128,0.0009415344,0.000268685],"domain_scores_gemma":[0.99496704,0.0030298813,0.000349314,0.00078297453,0.000639083,0.00023169968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002410122,0.0009366562,0.00067956175,0.0015352514,0.0020092844,0.0049082674,0.0028062246,0.0013086774,0.018372647],"category_scores_gemma":[0.009833003,0.00084849505,0.0016536107,0.0015868691,0.00335433,0.007871964,0.0031223614,0.003632511,0.0033023453],"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.000008243357,0.000009365941,0.000070674534,0.00003685896,0.000005698163,0.000038287322,0.00006173014,0.0010337016,0.00023552093,0.99391454,0.0011299028,0.0034555641],"study_design_scores_gemma":[0.000005537108,0.000009524723,0.00004187071,0.000019726765,0.0000074093214,0.00007119086,0.00004191346,0.009720853,0.0008158139,0.9812393,0.008019317,0.0000075411026],"about_ca_topic_score_codex":0.0011979515,"about_ca_topic_score_gemma":0.0018188588,"teacher_disagreement_score":0.018372647,"about_ca_system_score_codex":0.002128913,"about_ca_system_score_gemma":0.0011880765,"threshold_uncertainty_score":0.06146264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3810099,0.0011153971,0.428229,0.005218397,0.0005274623,0.00017605338,0.00040916464,0.00052862294,0.18278596],"genre_scores_gemma":[0.9286534,0.0003873328,0.0407747,0.00034240924,0.00019461483,0.00014869885,0.00021539265,0.000122676,0.029160764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974324,0.00041063782,0.0001248312,0.00055326405,0.0009939767,0.00048481932],"domain_scores_gemma":[0.99327,0.0037595357,0.0004197961,0.0011391386,0.0008548377,0.00055678847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016277862,0.00054065173,0.00090415165,0.0010063003,0.0020059014,0.0052295364,0.0013472174,0.0008847071,0.008118425],"category_scores_gemma":[0.010906735,0.00041155142,0.0010521049,0.0008157495,0.0055416045,0.007937097,0.004503869,0.004766768,0.0009169648],"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.000016694154,0.000012974826,0.00013306904,0.000029710438,0.0000025556672,0.000032303968,0.00011787172,0.00079351885,0.0005851823,0.9966755,0.00033205753,0.001268541],"study_design_scores_gemma":[0.0000138090745,0.000015692909,0.00012601785,0.000014196789,0.0000054110646,0.00007681053,0.00009127437,0.0121645145,0.0021197696,0.9812608,0.004099704,0.000011963883],"about_ca_topic_score_codex":0.00075008586,"about_ca_topic_score_gemma":0.000658378,"teacher_disagreement_score":0.008118425,"about_ca_system_score_codex":0.0021495188,"about_ca_system_score_gemma":0.0012603285,"threshold_uncertainty_score":0.027158797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44628674,0.0018212976,0.4945063,0.0045407983,0.00018318441,0.00007196176,0.00027905314,0.0004280223,0.051882584],"genre_scores_gemma":[0.9688834,0.0004455458,0.026428776,0.00015629313,0.00012397619,0.00006900721,0.00015120476,0.000055989265,0.0036858171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808407,0.00048442572,0.000113790345,0.0004415081,0.0006444839,0.00023176575],"domain_scores_gemma":[0.9959728,0.0025768222,0.00027256212,0.0006555815,0.0003246438,0.0001975284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00227543,0.000537595,0.0010409396,0.0012098016,0.0011095739,0.0038247323,0.0013523806,0.0008187457,0.0024034863],"category_scores_gemma":[0.008513766,0.00031759386,0.0016159628,0.0010068134,0.0057348693,0.007852909,0.0029010163,0.0032498674,0.00029283547],"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.000012144745,0.000010806746,0.00018404779,0.000021472584,0.0000069974576,0.00003625544,0.00008309104,0.0030054778,0.00027255443,0.9946102,0.00014435017,0.0016126125],"study_design_scores_gemma":[0.000007722307,0.000012832951,0.00013677977,0.000008206833,0.0000062059944,0.00003862973,0.000024489396,0.0257142,0.0006073816,0.9725788,0.000857922,0.0000067420833],"about_ca_topic_score_codex":0.0011782623,"about_ca_topic_score_gemma":0.000621913,"teacher_disagreement_score":0.0038247323,"about_ca_system_score_codex":0.0027572,"about_ca_system_score_gemma":0.0011080666,"threshold_uncertainty_score":0.020005047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046431585,0.0038045929,0.9612054,0.0068430444,0.00044729724,0.000053822656,0.00019782779,0.00029253395,0.022512335],"genre_scores_gemma":[0.32715634,0.008855376,0.63768965,0.0039326497,0.0042566066,0.00060427736,0.0005024808,0.00067758875,0.01632496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942135,0.0022878882,0.0003909978,0.0008090713,0.0019365643,0.00036197127],"domain_scores_gemma":[0.9914101,0.0061025396,0.00038064603,0.0011231531,0.0007330328,0.00025057554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050741257,0.0011030356,0.0014281444,0.0040113525,0.002220071,0.0070832064,0.0022840176,0.0022678766,0.0048175943],"category_scores_gemma":[0.011518173,0.0008531461,0.0030972813,0.002718506,0.01239665,0.021447808,0.0059205783,0.007884543,0.0013732199],"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.0000028862441,0.000003863275,0.000038461643,0.000028523204,0.000005939513,0.000016844973,0.00009124319,0.0008708932,0.00011094519,0.9952532,0.0005946201,0.0029825093],"study_design_scores_gemma":[0.000004001839,0.000004434814,0.000021983851,0.0000148260715,0.0000032589219,0.000027181508,0.000015708736,0.0047394275,0.00011246026,0.9885667,0.0064805318,0.000009479315],"about_ca_topic_score_codex":0.0012211406,"about_ca_topic_score_gemma":0.0007693402,"teacher_disagreement_score":0.0070832064,"about_ca_system_score_codex":0.0037406073,"about_ca_system_score_gemma":0.0021075415,"threshold_uncertainty_score":0.02714014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42485657,0.004453006,0.44889766,0.003828907,0.0003471176,0.00010693785,0.00041477953,0.0005042631,0.11659081],"genre_scores_gemma":[0.97224987,0.0015803135,0.019966174,0.00022051942,0.00024162936,0.00018324573,0.00018721666,0.0001253694,0.0052457415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851364,0.0003994404,0.00005275674,0.00020532704,0.00050148665,0.00032741774],"domain_scores_gemma":[0.98570883,0.010873872,0.0010188977,0.00095496257,0.00087922893,0.0005642967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026862833,0.0015275307,0.000918013,0.002339499,0.0010150897,0.002269,0.001787005,0.0011172093,0.0037818232],"category_scores_gemma":[0.013667901,0.0004492433,0.00083687267,0.0014601474,0.0048742355,0.0048522684,0.0028891058,0.0042597475,0.00064077426],"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.000090131085,0.00004170551,0.00043373383,0.00007080699,0.000015913056,0.00005157089,0.00015272039,0.033592492,0.0027354197,0.9559826,0.0008352198,0.005997686],"study_design_scores_gemma":[0.000023723804,0.00007303461,0.00038530646,0.000065528635,0.000022451006,0.00007764431,0.000060230832,0.26674625,0.004543471,0.72585505,0.002094688,0.000052680556],"about_ca_topic_score_codex":0.0010406009,"about_ca_topic_score_gemma":0.00066598627,"teacher_disagreement_score":0.0037818232,"about_ca_system_score_codex":0.0027312269,"about_ca_system_score_gemma":0.0012668051,"threshold_uncertainty_score":0.019816577},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08894397,0.0012243153,0.7486078,0.010169663,0.0007848458,0.00010838502,0.00059511,0.0010660773,0.14849983],"genre_scores_gemma":[0.87227213,0.0006078218,0.09470006,0.0013433204,0.0003478977,0.00014375738,0.00036054282,0.0004216067,0.029802876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987024,0.0003287457,0.00006205152,0.00030302693,0.00036237287,0.00024136428],"domain_scores_gemma":[0.9973546,0.0016699726,0.00012413283,0.00040079394,0.0003381564,0.000112419315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020608364,0.0004671964,0.00051583326,0.0011202071,0.0017925672,0.0027044564,0.0012717049,0.0013837994,0.009874287],"category_scores_gemma":[0.005312913,0.00035852377,0.0009219847,0.0010137458,0.0067022503,0.008009917,0.0034603209,0.00397612,0.0015765392],"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.000009373578,0.0000040472933,0.00009149216,0.000018063254,0.000002070973,0.00003455281,0.00012845176,0.00041840316,0.00017909537,0.9962288,0.00068287563,0.0022029055],"study_design_scores_gemma":[0.00000906043,0.000007208768,0.00008652464,0.000013086285,0.0000040972445,0.000074778145,0.00008215233,0.004150251,0.0012546295,0.9827848,0.011523178,0.000010121627],"about_ca_topic_score_codex":0.0022572598,"about_ca_topic_score_gemma":0.0015459962,"teacher_disagreement_score":0.009874287,"about_ca_system_score_codex":0.002312821,"about_ca_system_score_gemma":0.0012367624,"threshold_uncertainty_score":0.033032775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87814224,0.0003820566,0.10488482,0.0006317795,0.0000359006,0.000056381192,0.000386174,0.00032245682,0.015158125],"genre_scores_gemma":[0.9881788,0.00008752832,0.009258955,0.00004264118,0.000019361616,0.000029694167,0.00020911961,0.000035235465,0.0021387252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844235,0.00019728963,0.00011163364,0.00043306287,0.00055277976,0.0002629436],"domain_scores_gemma":[0.993983,0.0027880752,0.0008297267,0.0009113148,0.00065958814,0.0008283036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009029175,0.00043306474,0.00047439078,0.0021169076,0.0010925443,0.0031189644,0.0009995165,0.00089106394,0.0057967175],"category_scores_gemma":[0.0065011242,0.00048543522,0.00074039237,0.0011437818,0.0032866565,0.008901904,0.0040467954,0.0022775647,0.0004841517],"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.00020672021,0.00007960666,0.008472817,0.00018551161,0.000045006727,0.000382966,0.0023002299,0.010771762,0.014130265,0.9493333,0.0007225525,0.013369244],"study_design_scores_gemma":[0.000037135538,0.00010013791,0.0048409654,0.000054047767,0.000046002657,0.00061843067,0.0013008479,0.03368416,0.01206055,0.94199437,0.0052024736,0.000060880353],"about_ca_topic_score_codex":0.0007065891,"about_ca_topic_score_gemma":0.0007476553,"teacher_disagreement_score":0.0057967175,"about_ca_system_score_codex":0.0013693261,"about_ca_system_score_gemma":0.0003518721,"threshold_uncertainty_score":0.019392014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1635141,0.0007825573,0.80005586,0.0012336911,0.00011919079,0.00006361208,0.00031464192,0.0005748531,0.033341523],"genre_scores_gemma":[0.9123874,0.00050316966,0.078854986,0.0002584388,0.00014285461,0.00013721579,0.00031385018,0.00013234022,0.007269785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985965,0.00029923097,0.00006883985,0.0004275477,0.0004530485,0.00015484626],"domain_scores_gemma":[0.9964269,0.0021207777,0.00023621265,0.00059529406,0.00048273115,0.00013810433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012686375,0.00041379908,0.0007335022,0.0009425603,0.00069471286,0.0021670691,0.0010447262,0.0010829397,0.0038419743],"category_scores_gemma":[0.008694662,0.00030501373,0.0009728071,0.000551366,0.0031024858,0.0037679172,0.0022372378,0.0024907805,0.0005032351],"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.00003529281,0.00001286709,0.00049305195,0.000047552767,0.000017202983,0.00009133313,0.0001771963,0.048066236,0.0011875115,0.94208837,0.0006673793,0.007116],"study_design_scores_gemma":[0.000010754344,0.000027366803,0.00026249114,0.000019768233,0.000012146262,0.00010076219,0.000045046363,0.27458814,0.0007703232,0.72150224,0.002649396,0.000011509132],"about_ca_topic_score_codex":0.0019120459,"about_ca_topic_score_gemma":0.0007801741,"teacher_disagreement_score":0.0038419743,"about_ca_system_score_codex":0.0014478699,"about_ca_system_score_gemma":0.0008242045,"threshold_uncertainty_score":0.012852669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8202966,0.0004836637,0.15775822,0.00074973336,0.000052441625,0.000028090331,0.00006805959,0.00009486782,0.020468304],"genre_scores_gemma":[0.98965985,0.000086086664,0.008924985,0.000042646643,0.000017393493,0.000016966833,0.000023578368,0.000009441736,0.0012191511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992449,0.00022820385,0.00005181087,0.00014247604,0.00022626908,0.00010629887],"domain_scores_gemma":[0.9983651,0.0006986737,0.00023464832,0.00020459501,0.00022949508,0.00026752456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013121114,0.00029563732,0.00030394405,0.0008770604,0.0009324578,0.0024064884,0.00053215574,0.0005316812,0.0019421978],"category_scores_gemma":[0.0027549095,0.00023098566,0.00042672743,0.00048265603,0.0036064668,0.0030921956,0.0017096001,0.0009134519,0.00015354775],"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.000015983213,0.00001059687,0.00046408037,0.00001545516,0.000007776413,0.000108396525,0.0004975132,0.002386801,0.0015764482,0.99330914,0.00010361257,0.0015042194],"study_design_scores_gemma":[0.000009363009,0.000022778457,0.00037680802,0.000008389002,0.0000069872885,0.00013846322,0.00025093477,0.02895738,0.0010142302,0.96826327,0.0009358385,0.000015474503],"about_ca_topic_score_codex":0.00067598454,"about_ca_topic_score_gemma":0.0004421074,"teacher_disagreement_score":0.0024064884,"about_ca_system_score_codex":0.00091431173,"about_ca_system_score_gemma":0.0005274487,"threshold_uncertainty_score":0.0069391727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2885624,0.002959899,0.5106143,0.015665699,0.0014643747,0.00020762971,0.00089210755,0.0014861294,0.17814754],"genre_scores_gemma":[0.88186854,0.0010059902,0.06348605,0.001137757,0.00050222623,0.0001133158,0.0006211892,0.00037394091,0.05089096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979995,0.0005675044,0.00013618935,0.00048113544,0.0005103593,0.00030526548],"domain_scores_gemma":[0.99663866,0.001949307,0.00019284314,0.00053686096,0.0004538326,0.00022853959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023497315,0.00057121087,0.00059192075,0.0008465472,0.0020750307,0.0038637782,0.00087456935,0.0013092402,0.012051769],"category_scores_gemma":[0.0065911487,0.0005002498,0.0016539438,0.0008022896,0.0049222982,0.018515907,0.0029880507,0.005046743,0.0017785718],"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.000066783774,0.000014883324,0.0002210507,0.000053396154,0.0000073226543,0.00006710824,0.00025383645,0.0005591334,0.00047395242,0.9888603,0.0018072043,0.007615137],"study_design_scores_gemma":[0.000013999732,0.000021299049,0.00012570797,0.000017018712,0.000008346318,0.00009187305,0.00018055258,0.0028184708,0.0013672671,0.9878807,0.0074610603,0.000013681181],"about_ca_topic_score_codex":0.0013240498,"about_ca_topic_score_gemma":0.0009616768,"teacher_disagreement_score":0.012051769,"about_ca_system_score_codex":0.0020798668,"about_ca_system_score_gemma":0.0013929417,"threshold_uncertainty_score":0.040317178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06216156,0.00041286484,0.9192051,0.0020567076,0.00007700091,0.00006956744,0.0002642433,0.0006390942,0.015113957],"genre_scores_gemma":[0.78390265,0.00061705173,0.20548244,0.00064345903,0.00023218912,0.000359053,0.0008146373,0.00040791515,0.0075405934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940521,0.0019046956,0.0004145989,0.0015499479,0.0014717042,0.0006068951],"domain_scores_gemma":[0.9631216,0.0265548,0.0014909615,0.0064926837,0.0017006574,0.0006393432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052012275,0.0007341008,0.001160229,0.0018936907,0.0017157642,0.006143837,0.003583875,0.0023761413,0.0068046725],"category_scores_gemma":[0.04143935,0.0009502012,0.0025199435,0.0021492692,0.006078525,0.01923309,0.0065920297,0.0065567098,0.000784731],"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.000022751326,0.000016773536,0.0002632226,0.00003574118,0.000008659064,0.00003481944,0.00015935063,0.008403518,0.0001864473,0.98616576,0.00037813652,0.0043248055],"study_design_scores_gemma":[0.0000069565117,0.000008220189,0.000072988456,0.000014904071,0.000009138696,0.00003395998,0.000029763503,0.054258138,0.0005098692,0.94371986,0.0013268541,0.000009258721],"about_ca_topic_score_codex":0.0024922856,"about_ca_topic_score_gemma":0.0015982753,"teacher_disagreement_score":0.0068046725,"about_ca_system_score_codex":0.0034044662,"about_ca_system_score_gemma":0.0017590199,"threshold_uncertainty_score":0.027507007},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010041054,0.023883538,0.2880672,0.048387595,0.0072796247,0.00025817595,0.0002939416,0.00039527653,0.6213935],"genre_scores_gemma":[0.29359624,0.04620339,0.36197144,0.022527326,0.016818823,0.00076508377,0.0005626687,0.0008648098,0.2566902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986895,0.00048109054,0.00010497602,0.00019467759,0.00042016484,0.00010964952],"domain_scores_gemma":[0.9966889,0.002395331,0.00012957831,0.00023903983,0.00046013691,0.000086995184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014844079,0.0007272866,0.0003819555,0.0022187615,0.0026938822,0.003478715,0.0011363908,0.0011243568,0.010298639],"category_scores_gemma":[0.0069944765,0.00031123537,0.0008914274,0.0024584536,0.008890549,0.007918337,0.0021015792,0.0045773694,0.003022383],"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.000013962555,0.000018629553,0.0002901449,0.0001123926,0.000004454766,0.00008997129,0.00065408985,0.00052542606,0.0003036806,0.94158286,0.029662821,0.026741583],"study_design_scores_gemma":[0.0000030040114,0.000027666298,0.0006813585,0.0001299177,0.0000031505529,0.00026203206,0.00036635867,0.0017097157,0.0002942684,0.54643255,0.4500725,0.00001753158],"about_ca_topic_score_codex":0.001857921,"about_ca_topic_score_gemma":0.002703168,"teacher_disagreement_score":0.010298639,"about_ca_system_score_codex":0.002218961,"about_ca_system_score_gemma":0.0012448748,"threshold_uncertainty_score":0.03445238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7651826,0.008852297,0.14180808,0.0029417197,0.00024035631,0.000056946566,0.0005024364,0.00022488997,0.08019069],"genre_scores_gemma":[0.96599627,0.0020221516,0.023876062,0.00035534112,0.00037852317,0.000062457846,0.00025471539,0.000043586555,0.007010909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993229,0.00019830775,0.000040130446,0.00016163102,0.00020183754,0.00007522601],"domain_scores_gemma":[0.9950736,0.0032614775,0.00046122793,0.00060171005,0.00037823623,0.00022369539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127256,0.0002909767,0.00062950206,0.0017057281,0.0014897742,0.0015941832,0.000426061,0.0005640026,0.0025027725],"category_scores_gemma":[0.007516381,0.00037681582,0.0006092028,0.0013156008,0.0021833293,0.0045341705,0.0012093931,0.0011159079,0.00022183161],"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.00009094609,0.000027369644,0.0019346164,0.00009772457,0.000025626163,0.00018891018,0.0005904992,0.0055942195,0.0016587997,0.9759513,0.0016656223,0.012174303],"study_design_scores_gemma":[0.00002105383,0.000066803725,0.0022138853,0.000034147677,0.000028635419,0.0004507152,0.00024091847,0.018246882,0.0010394227,0.9690011,0.00863188,0.000024597339],"about_ca_topic_score_codex":0.0014391312,"about_ca_topic_score_gemma":0.0009827357,"teacher_disagreement_score":0.0025027725,"about_ca_system_score_codex":0.0010931966,"about_ca_system_score_gemma":0.00036959758,"threshold_uncertainty_score":0.008529007},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009807351,0.11283533,0.7277579,0.0419733,0.0028210925,0.0001001978,0.00067241944,0.0006234279,0.10340903],"genre_scores_gemma":[0.57984895,0.08609799,0.2956537,0.0062290863,0.016528545,0.00045075393,0.00093273853,0.0004450133,0.013813185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972711,0.0008610818,0.00018839557,0.0005291528,0.00093565916,0.00021458708],"domain_scores_gemma":[0.98989105,0.0068975943,0.0004364905,0.0012495667,0.0010220807,0.00050327723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004961619,0.0011632623,0.002032534,0.0032758042,0.0027726463,0.010739645,0.0022274612,0.0040607294,0.004824831],"category_scores_gemma":[0.017331885,0.0009333387,0.0016800395,0.0054830774,0.013251933,0.019228177,0.00359328,0.009074942,0.0016976771],"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.0000059236895,0.000007708777,0.000053196094,0.000077024466,0.00000568189,0.000013965302,0.00006371275,0.0011802772,0.00006190961,0.9918315,0.0016720969,0.005027051],"study_design_scores_gemma":[0.0000028021884,0.0000014960348,0.00002520068,0.000018705456,0.0000018078766,0.000008435834,0.000011863171,0.002031169,0.00001953587,0.9919253,0.0059493408,0.000004267565],"about_ca_topic_score_codex":0.0034107263,"about_ca_topic_score_gemma":0.0016410062,"teacher_disagreement_score":0.010739645,"about_ca_system_score_codex":0.0035760847,"about_ca_system_score_gemma":0.0033024522,"threshold_uncertainty_score":0.026239872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001592996,0.054405186,0.01365081,0.010532565,0.0074203517,0.00003202145,0.0007029824,0.00090314716,0.91076005],"genre_scores_gemma":[0.01823235,0.015938055,0.0049344315,0.0030086108,0.002720023,0.00005601408,0.00067102734,0.0004474642,0.953992],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999521,0.00008133699,0.000019753526,0.00008785413,0.00022148115,0.00006854567],"domain_scores_gemma":[0.99946576,0.00016656307,0.000032515116,0.000061991865,0.000132706,0.00014041111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051900867,0.0010495621,0.00078269554,0.0011567931,0.0015546276,0.0038509034,0.0007101149,0.0008362174,0.12087454],"category_scores_gemma":[0.0015396827,0.0003528217,0.0006825081,0.0016089504,0.0011696239,0.0032723492,0.0015779359,0.0030194863,0.04512338],"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.000028410885,0.000043689357,0.00019066465,0.00021197017,0.000008487552,0.00008036224,0.0005505187,0.00036502295,0.00093512336,0.2446836,0.63341814,0.11948399],"study_design_scores_gemma":[0.0000031763598,0.000012574913,0.00025419483,0.00012417245,0.0000025480258,0.0000996413,0.000069296715,0.00013975111,0.000114352995,0.041933894,0.95724285,0.0000036062588],"about_ca_topic_score_codex":0.0014831094,"about_ca_topic_score_gemma":0.0027354236,"teacher_disagreement_score":0.12087454,"about_ca_system_score_codex":0.0028181751,"about_ca_system_score_gemma":0.0015321631,"threshold_uncertainty_score":0.4043656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84969914,0.00034798557,0.12776046,0.0018545712,0.000049860748,0.00007067278,0.0002311645,0.00022628838,0.019759951],"genre_scores_gemma":[0.9910157,0.000064428146,0.006640701,0.00007234028,0.00003175282,0.000028573653,0.00011209411,0.00001737649,0.002017006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966869,0.0012358978,0.00024717426,0.00056475296,0.00079868606,0.0004667126],"domain_scores_gemma":[0.9801444,0.013612069,0.0012293018,0.002104547,0.0015022128,0.0014074887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028184124,0.00024918857,0.0006032728,0.0015177722,0.0013157417,0.003189692,0.0007257277,0.000975725,0.0037003518],"category_scores_gemma":[0.010893286,0.0003842038,0.0008147652,0.00092663645,0.0045624697,0.0075541344,0.004006661,0.0022614023,0.000248312],"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.000090460286,0.000052085077,0.004324345,0.00008790653,0.00002041594,0.000150353,0.0010951338,0.0050334022,0.0030138365,0.97867364,0.0004710658,0.0069874404],"study_design_scores_gemma":[0.00003748542,0.00008376761,0.0028286013,0.000035708003,0.00002842555,0.00036122906,0.000911259,0.014619345,0.004094847,0.9714472,0.0055162837,0.000035975812],"about_ca_topic_score_codex":0.0007582783,"about_ca_topic_score_gemma":0.00091481936,"teacher_disagreement_score":0.0037003518,"about_ca_system_score_codex":0.0013623826,"about_ca_system_score_gemma":0.00082000124,"threshold_uncertainty_score":0.0149053335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1260103,0.007907404,0.7319364,0.010184029,0.0023703282,0.000077106204,0.00014490873,0.0003594723,0.121010035],"genre_scores_gemma":[0.8272536,0.0062510204,0.14130606,0.0020176223,0.002431856,0.0001236909,0.000085978914,0.0002986034,0.02023157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995097,0.00019438368,0.000031902702,0.00006426615,0.0001408059,0.00005886666],"domain_scores_gemma":[0.99888283,0.0006523585,0.000096617456,0.00011165531,0.00016808044,0.000088439236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021940353,0.0006769003,0.00062379363,0.0023840293,0.0019760656,0.0024974882,0.0010671939,0.001175448,0.0034754123],"category_scores_gemma":[0.0068363044,0.00026307473,0.00075573934,0.0019199053,0.0053286105,0.007614977,0.002740345,0.002574206,0.00047105877],"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.0000037737777,0.0000031986303,0.000045786317,0.000013379905,0.0000011468941,0.000053572934,0.00014852335,0.00021515116,0.00020751296,0.99667954,0.0002294356,0.0023990804],"study_design_scores_gemma":[0.0000031544253,0.000016020684,0.0000697115,0.000017205184,0.000002998396,0.000091134236,0.0000791317,0.0031082006,0.00032797738,0.9909999,0.005274518,0.000010067434],"about_ca_topic_score_codex":0.0012091479,"about_ca_topic_score_gemma":0.0007683043,"teacher_disagreement_score":0.0034754123,"about_ca_system_score_codex":0.0014082326,"about_ca_system_score_gemma":0.00067139236,"threshold_uncertainty_score":0.011626363},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009931687,0.82475966,0.008016174,0.011017178,0.00493135,0.00009019559,0.000605996,0.00023784275,0.14934844],"genre_scores_gemma":[0.012366068,0.9342178,0.0108659305,0.005890933,0.0069564837,0.00018643618,0.00097636954,0.00012807462,0.02841191],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982316,0.00046952598,0.00023594192,0.00027853853,0.0006267566,0.0001576588],"domain_scores_gemma":[0.99694484,0.0018631072,0.00021429175,0.00016076365,0.00063142803,0.0001855317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019691768,0.0009031426,0.00072710915,0.00850067,0.0023260533,0.006155973,0.0012620275,0.0024284313,0.017322695],"category_scores_gemma":[0.0038047002,0.000554038,0.000645608,0.014856375,0.0024563312,0.0057303174,0.0018019506,0.0036878968,0.012574033],"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.000085086154,0.00010860756,0.0015186854,0.0054617873,0.000040723677,0.00032539523,0.0014575584,0.0010567921,0.00057550793,0.28269628,0.22195973,0.4847139],"study_design_scores_gemma":[0.0000017149173,0.000020516409,0.0007123665,0.0013771479,0.0000046656533,0.00024018425,0.00017660068,0.00011523902,0.000064167085,0.018529037,0.978746,0.000012246024],"about_ca_topic_score_codex":0.004015006,"about_ca_topic_score_gemma":0.0033681039,"teacher_disagreement_score":0.017322695,"about_ca_system_score_codex":0.0033420331,"about_ca_system_score_gemma":0.0031498605,"threshold_uncertainty_score":0.05795014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3972505,0.0014131212,0.4172955,0.0027265747,0.00036183113,0.000058956273,0.0007476174,0.0007982495,0.17934754],"genre_scores_gemma":[0.98685247,0.00018678364,0.009542278,0.0001350744,0.00010063017,0.000021644059,0.00012381701,0.00003537343,0.003001981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981298,0.00039075446,0.00014148882,0.00038248443,0.000661689,0.00029381513],"domain_scores_gemma":[0.9950937,0.0026398455,0.00053268264,0.0011484486,0.00036133526,0.00022401265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013509857,0.00036056133,0.0005185849,0.0012134688,0.0013346112,0.003325475,0.0008566207,0.00071213883,0.007803031],"category_scores_gemma":[0.0058339513,0.0003781904,0.00066054316,0.0010527209,0.005730426,0.006165312,0.003009944,0.0012658691,0.00054805883],"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.000018256116,0.000008595694,0.00035152354,0.00002690961,0.000008005698,0.00006955435,0.000105163046,0.0013272294,0.0009614817,0.9927995,0.00064298284,0.003680794],"study_design_scores_gemma":[0.00000779563,0.000016607839,0.000531429,0.000016156435,0.000015594063,0.00015242907,0.0001032805,0.0066026878,0.0032666773,0.9842003,0.0050760647,0.0000108819995],"about_ca_topic_score_codex":0.00091012585,"about_ca_topic_score_gemma":0.0006905444,"teacher_disagreement_score":0.007803031,"about_ca_system_score_codex":0.001194532,"about_ca_system_score_gemma":0.00072818884,"threshold_uncertainty_score":0.026103735},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05846434,0.0038116537,0.8754511,0.0034531846,0.00034634367,0.00020965036,0.0005856727,0.0007991329,0.056878924],"genre_scores_gemma":[0.62299883,0.0027301507,0.3505503,0.0011782037,0.00073431904,0.00087753736,0.00078464445,0.00059321313,0.01955272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99548537,0.0011261423,0.0004241103,0.00070246396,0.0018478467,0.00041399393],"domain_scores_gemma":[0.99276155,0.00432256,0.00034368926,0.001126124,0.0011357624,0.00031028836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006054542,0.00090838014,0.0015108552,0.002986389,0.0038230813,0.006383658,0.0018649369,0.0018993537,0.0046176133],"category_scores_gemma":[0.012235026,0.0011259157,0.0033503645,0.0022197266,0.007958557,0.012969966,0.006214778,0.0065900343,0.0010442183],"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.000004495406,0.0000040828136,0.00004468199,0.000022843842,0.0000041470375,0.000017360639,0.00016315244,0.0005726521,0.000120688084,0.99739194,0.00022232851,0.0014315702],"study_design_scores_gemma":[0.000008726525,0.0000057801603,0.00005067839,0.000017968685,0.0000053999856,0.000023923167,0.000033689295,0.0052812,0.00030861676,0.99049723,0.003758743,0.000008064145],"about_ca_topic_score_codex":0.0030520775,"about_ca_topic_score_gemma":0.0018884481,"teacher_disagreement_score":0.006383658,"about_ca_system_score_codex":0.0032098484,"about_ca_system_score_gemma":0.0029025204,"threshold_uncertainty_score":0.032019854},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1434523,0.00462948,0.3366173,0.002583114,0.0030612377,0.00014161831,0.00077110034,0.0011330583,0.5076108],"genre_scores_gemma":[0.79694694,0.0032408189,0.08413929,0.0009841922,0.0010684611,0.00017282231,0.000935631,0.00064014766,0.11187162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994723,0.00008840842,0.000040719548,0.000085510255,0.00018329677,0.00012976768],"domain_scores_gemma":[0.9991812,0.0003535539,0.00008293889,0.00013281064,0.00015476608,0.00009479879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068479497,0.0009047795,0.00064336305,0.0027504037,0.0018847515,0.0027774929,0.00082018913,0.00087607565,0.027454296],"category_scores_gemma":[0.003166691,0.00034155007,0.0010361563,0.0022853732,0.0019852358,0.0051084575,0.002715112,0.0025143141,0.005502572],"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.00006052156,0.000013116433,0.000112242866,0.00007251922,0.0000052302694,0.00025527593,0.00016751433,0.0016927113,0.0009093758,0.9781861,0.0035087357,0.015016749],"study_design_scores_gemma":[0.000009806146,0.0000133003105,0.0001167908,0.000047576126,0.0000063081616,0.0001772323,0.000053544158,0.003071201,0.000785226,0.982524,0.01317952,0.000015536401],"about_ca_topic_score_codex":0.0011809696,"about_ca_topic_score_gemma":0.0015241962,"teacher_disagreement_score":0.027454296,"about_ca_system_score_codex":0.001166654,"about_ca_system_score_gemma":0.0005338577,"threshold_uncertainty_score":0.091843724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007685056,0.9941847,0.00089418254,0.001959564,0.00027499336,0.0000046707423,0.000007899505,0.000009012146,0.0025881892],"genre_scores_gemma":[0.0031695112,0.9931015,0.0013037622,0.00112352,0.0004979947,0.000018066134,0.00001789531,0.000008277403,0.0007595214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982179,0.000974783,0.00014945517,0.00016420374,0.00044377186,0.000049937473],"domain_scores_gemma":[0.9925014,0.0063696387,0.00033724465,0.00014733634,0.0005415228,0.0001029217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035447462,0.0008080027,0.0010148194,0.004052128,0.00051652675,0.0033849366,0.0015278689,0.0027802205,0.0032799044],"category_scores_gemma":[0.011166104,0.00041699625,0.00055885507,0.005055641,0.004401709,0.0077618547,0.0011970885,0.0032922237,0.002367029],"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.000041357373,0.000030158453,0.00023692522,0.0109639345,0.00006942569,0.000063911364,0.00047137402,0.0004984813,0.00016359186,0.08975746,0.035377353,0.8623261],"study_design_scores_gemma":[0.000018256564,0.000055651697,0.0010677353,0.013725063,0.000088573965,0.0007187267,0.00042973424,0.00044822082,0.00032209052,0.083149776,0.89993536,0.000040765884],"about_ca_topic_score_codex":0.0034860224,"about_ca_topic_score_gemma":0.0037963665,"teacher_disagreement_score":0.004052128,"about_ca_system_score_codex":0.001993847,"about_ca_system_score_gemma":0.0026993349,"threshold_uncertainty_score":0.018746614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087253556,0.06243651,0.7350874,0.011503098,0.0011346963,0.0001716712,0.0005075441,0.00040785232,0.10149768],"genre_scores_gemma":[0.72203517,0.03300652,0.21423139,0.0031405243,0.003272503,0.00048334256,0.00074980693,0.00018527583,0.022895535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691916,0.0009221554,0.00022842456,0.0006885153,0.0010280198,0.00021384527],"domain_scores_gemma":[0.9873466,0.00978144,0.0007371749,0.0010290613,0.0007819937,0.00032371955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027380732,0.000678797,0.0012648839,0.0030791732,0.0018388343,0.0041546593,0.0017104622,0.0033841468,0.003442981],"category_scores_gemma":[0.017929045,0.00053061673,0.0012600212,0.003936996,0.00637072,0.013949203,0.0030505077,0.0033359875,0.0007418529],"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.000007820741,0.0000050766776,0.00026523275,0.000072001305,0.000006376185,0.000058266298,0.0001942232,0.00064174214,0.00023712768,0.98510474,0.0011159062,0.012291586],"study_design_scores_gemma":[0.0000036854017,0.000013075556,0.00020621935,0.0000459337,0.000010867571,0.00047249685,0.00012271985,0.0043879906,0.00038291718,0.97896725,0.0153760705,0.000010807667],"about_ca_topic_score_codex":0.00088886556,"about_ca_topic_score_gemma":0.00046559857,"teacher_disagreement_score":0.0041546593,"about_ca_system_score_codex":0.0020114607,"about_ca_system_score_gemma":0.0007768684,"threshold_uncertainty_score":0.014594257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08438462,0.0041173142,0.758205,0.0069534667,0.00061946444,0.000051220824,0.0005610505,0.00075127743,0.14435664],"genre_scores_gemma":[0.8753047,0.001799171,0.09631967,0.0015037807,0.00085946283,0.00019092117,0.00049318525,0.00025380438,0.02327532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996425,0.0013069875,0.00019827955,0.00068146805,0.0010375273,0.00035068198],"domain_scores_gemma":[0.9927099,0.0042871363,0.0004800357,0.0010647686,0.000910797,0.0005474508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039613084,0.00047832413,0.000544453,0.0022815762,0.0025173116,0.004524607,0.0011799145,0.0014603928,0.0058936104],"category_scores_gemma":[0.008394247,0.0005154727,0.0013766263,0.0016321167,0.012324805,0.011533389,0.0036552472,0.0032762496,0.0010573409],"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.000002588228,0.0000018913464,0.00006400536,0.000007721835,0.0000011365867,0.00001629444,0.0001431011,0.00010129577,0.000042007337,0.99803084,0.00023573029,0.0013534154],"study_design_scores_gemma":[0.0000015653027,0.0000041004855,0.00008464122,0.00000796662,0.0000015500954,0.000029775656,0.00003263997,0.0008204217,0.000059095684,0.99604475,0.0029083549,0.0000050508593],"about_ca_topic_score_codex":0.0022878826,"about_ca_topic_score_gemma":0.0015259389,"teacher_disagreement_score":0.0058936104,"about_ca_system_score_codex":0.0023378036,"about_ca_system_score_gemma":0.0013697004,"threshold_uncertainty_score":0.020949662},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016036885,0.071342334,0.19937168,0.007348845,0.0037985323,0.00010373103,0.0009232705,0.0012035255,0.7143044],"genre_scores_gemma":[0.1255401,0.089797184,0.1647192,0.0047125276,0.009261177,0.00081359665,0.002104008,0.0011665308,0.6018857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994717,0.00009358494,0.000028287315,0.00012360024,0.00023215127,0.00005072345],"domain_scores_gemma":[0.99951255,0.00023322683,0.000020670843,0.00010670135,0.00008927995,0.000037709204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000498366,0.0012658433,0.0013730243,0.0016612903,0.0011418685,0.004554122,0.0013225243,0.0010885602,0.031735264],"category_scores_gemma":[0.0017806201,0.00065639254,0.00077540986,0.0030424122,0.0030564882,0.0044192867,0.0013112057,0.0039446126,0.01886747],"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.000007648681,0.000011456632,0.000066640976,0.0002009884,0.000008193247,0.000022595006,0.00013987029,0.00061686774,0.0003057794,0.87802917,0.05720833,0.0633825],"study_design_scores_gemma":[0.000005164706,0.000006300279,0.00014352107,0.00009855614,0.0000058021687,0.00006169757,0.00003215406,0.0009766038,0.00012902079,0.7078548,0.29068023,0.0000060903185],"about_ca_topic_score_codex":0.0014772648,"about_ca_topic_score_gemma":0.0014908683,"teacher_disagreement_score":0.031735264,"about_ca_system_score_codex":0.001933578,"about_ca_system_score_gemma":0.0016154536,"threshold_uncertainty_score":0.10616505},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061945718,0.008579612,0.8288734,0.011314378,0.0003584014,0.00007265744,0.00020367377,0.00035007365,0.08830219],"genre_scores_gemma":[0.7990671,0.0073537226,0.17148562,0.00084650714,0.0005588855,0.00019431359,0.0001858044,0.0002585177,0.020049497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793327,0.00068051275,0.00014322842,0.0003693196,0.0007119637,0.00016169962],"domain_scores_gemma":[0.9890799,0.00800004,0.0005425546,0.0012621968,0.0008863398,0.00022893115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031536599,0.0005014954,0.0010083431,0.0017334603,0.0012613372,0.007627416,0.0013005895,0.001740731,0.0061955345],"category_scores_gemma":[0.0132633,0.0004548721,0.0013864052,0.00199871,0.009659459,0.014599225,0.0031241162,0.003452498,0.0007933835],"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.000013066241,0.0000069154466,0.00045863807,0.00010263163,0.000014809395,0.000032816497,0.00044843004,0.0043737097,0.00049204874,0.98171943,0.00052076083,0.011816841],"study_design_scores_gemma":[0.000011294638,0.000022869997,0.0006035345,0.00006974067,0.000013863288,0.000112730144,0.00016229859,0.028956724,0.00067389273,0.9582608,0.011086247,0.000025958241],"about_ca_topic_score_codex":0.0025980189,"about_ca_topic_score_gemma":0.0015355971,"teacher_disagreement_score":0.007627416,"about_ca_system_score_codex":0.0026994876,"about_ca_system_score_gemma":0.0012834638,"threshold_uncertainty_score":0.020726144},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052744966,0.03879739,0.02281568,0.41890237,0.0029217354,0.000038964943,0.00023809653,0.00012646429,0.46341446],"genre_scores_gemma":[0.95476204,0.010503773,0.0059892605,0.008791339,0.0012206794,0.000031769916,0.00007637424,0.0001443031,0.018480547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976255,0.0016132904,0.000049223578,0.00016907066,0.00033172424,0.00021121319],"domain_scores_gemma":[0.9903977,0.0070350426,0.00022925605,0.0005357036,0.0009521468,0.00085009023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048667314,0.0005245541,0.00044706542,0.001243069,0.00592172,0.013458333,0.0010395255,0.003790008,0.006679683],"category_scores_gemma":[0.016839387,0.00030712583,0.00031503718,0.0010612007,0.037940957,0.02493863,0.002772985,0.008242047,0.00081599125],"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.000043695887,0.0000131959905,0.00030210926,0.00007689703,0.0000053478766,0.00007984489,0.033742618,0.0001630791,0.00023579597,0.9431584,0.014808523,0.007370592],"study_design_scores_gemma":[0.00001758977,0.00001333401,0.000252475,0.00014574765,0.0000056441613,0.00010035897,0.026458181,0.00057526183,0.00020268971,0.81160957,0.16060285,0.00001629398],"about_ca_topic_score_codex":0.012956865,"about_ca_topic_score_gemma":0.009225748,"teacher_disagreement_score":0.013458333,"about_ca_system_score_codex":0.004750265,"about_ca_system_score_gemma":0.0028156438,"threshold_uncertainty_score":0.03446573},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037426848,0.0030417715,0.45721102,0.005906311,0.0020509795,0.00028929775,0.0039048274,0.00504848,0.48512048],"genre_scores_gemma":[0.60160726,0.0028828618,0.12298309,0.0052838176,0.0015078763,0.0010304915,0.009299179,0.004357178,0.25104836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966785,0.00070004095,0.0002744615,0.001096203,0.0007185013,0.000532423],"domain_scores_gemma":[0.9954039,0.0019037441,0.00033838672,0.0010909775,0.0009157185,0.00034723725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001816402,0.0013143058,0.0015561412,0.0020823404,0.002824933,0.0050619002,0.0018945868,0.0020407662,0.06541228],"category_scores_gemma":[0.011695997,0.0007887746,0.0020059356,0.0017618261,0.0024576588,0.010940511,0.006566131,0.0032596532,0.021519238],"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.00009182603,0.000025900348,0.0002497533,0.00015746472,0.000020648198,0.00011564903,0.0001330116,0.0008992491,0.00045570792,0.9652736,0.01615547,0.016421609],"study_design_scores_gemma":[0.000028565077,0.000029071858,0.00013834453,0.00008401758,0.00002245004,0.0002564676,0.000116667885,0.0057917642,0.0011524869,0.92952806,0.06283326,0.000018750789],"about_ca_topic_score_codex":0.0009359724,"about_ca_topic_score_gemma":0.0009778896,"teacher_disagreement_score":0.06541228,"about_ca_system_score_codex":0.0025475684,"about_ca_system_score_gemma":0.0016442782,"threshold_uncertainty_score":0.21882588},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7422492,0.0014159669,0.20070417,0.014037678,0.00012571161,0.00022104585,0.0017624599,0.000916034,0.03856767],"genre_scores_gemma":[0.975368,0.0004149377,0.018264549,0.00058810116,0.0001945592,0.00017924198,0.00094618107,0.00017857451,0.0038658746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99464154,0.0014666652,0.00025167677,0.0011429406,0.0015086946,0.0009883633],"domain_scores_gemma":[0.94599515,0.047807787,0.0018341424,0.002183287,0.0010210755,0.0011586593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037499766,0.00066121964,0.0012152583,0.0014190131,0.0021630174,0.007300632,0.0024433334,0.0018963505,0.0068097273],"category_scores_gemma":[0.022279425,0.0007147538,0.0018572774,0.0014166894,0.0045043114,0.012304494,0.0050297976,0.0068908515,0.000466371],"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.0005969372,0.00021516994,0.0047328267,0.00036209388,0.000091974,0.00024084427,0.0012991955,0.040012445,0.002890557,0.9187706,0.0057994113,0.024987927],"study_design_scores_gemma":[0.00004654571,0.000035888483,0.0010159952,0.0000322664,0.000033373104,0.00011606686,0.0002208742,0.13392587,0.0018784014,0.86076254,0.0019031795,0.000029022389],"about_ca_topic_score_codex":0.0026054012,"about_ca_topic_score_gemma":0.0012812751,"teacher_disagreement_score":0.007300632,"about_ca_system_score_codex":0.0047993627,"about_ca_system_score_gemma":0.0024884853,"threshold_uncertainty_score":0.034821987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020776398,0.0039233146,0.777098,0.06219174,0.004508504,0.00026087408,0.00090474833,0.00086194224,0.12947442],"genre_scores_gemma":[0.64499855,0.0055838656,0.28800678,0.025914,0.0045282673,0.0015743647,0.0011054856,0.000684384,0.027604291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954509,0.0013882226,0.00028694488,0.0012708602,0.0012289907,0.00037401507],"domain_scores_gemma":[0.98449254,0.011404878,0.00054941844,0.0017441277,0.0014651229,0.00034389074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034563458,0.0008331736,0.0009595522,0.0011171087,0.0043685106,0.0029664866,0.0017684705,0.0029054459,0.010957334],"category_scores_gemma":[0.017183214,0.0005264058,0.0031168065,0.0010926994,0.007922568,0.0154273175,0.0042920313,0.01165541,0.0016869779],"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.000033737273,0.000017112256,0.00022068051,0.00023924117,0.000025440204,0.00015003617,0.00018303623,0.0008926878,0.0004437534,0.97401834,0.012481517,0.011294542],"study_design_scores_gemma":[0.0000219611,0.00002294543,0.00016775771,0.000040365496,0.000021103717,0.00023036501,0.00005961442,0.005302666,0.0012129154,0.97073597,0.022168692,0.00001563813],"about_ca_topic_score_codex":0.001873522,"about_ca_topic_score_gemma":0.0010508988,"teacher_disagreement_score":0.010957334,"about_ca_system_score_codex":0.0023382783,"about_ca_system_score_gemma":0.0026159624,"threshold_uncertainty_score":0.036655903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40200016,0.0010980491,0.5747521,0.0024381597,0.00006958002,0.00008229347,0.00068457465,0.00032515867,0.018549984],"genre_scores_gemma":[0.9510429,0.00028309345,0.044802397,0.00029239082,0.00008439209,0.00013833513,0.00043049676,0.00007010556,0.002855901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98985857,0.0032046053,0.00089539925,0.002409638,0.0027791052,0.00085265684],"domain_scores_gemma":[0.95113355,0.030185962,0.0051815007,0.0076526366,0.003079385,0.0027669636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006074311,0.0008004569,0.001576143,0.0025427712,0.002235446,0.007047192,0.0024391366,0.0020644914,0.0026586803],"category_scores_gemma":[0.035619948,0.0011881659,0.0018010795,0.0018457518,0.0076750536,0.014204674,0.0069190897,0.0046530026,0.00039056328],"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.00012541818,0.00003276781,0.0017237463,0.000084072606,0.000052420724,0.00023796876,0.0008623701,0.008104078,0.0013758629,0.98276883,0.00029998962,0.004332463],"study_design_scores_gemma":[0.000022067305,0.000051033472,0.00072236423,0.000035051216,0.000021775257,0.00023576808,0.00019985881,0.029823605,0.0010396224,0.9664414,0.0013862919,0.000021152515],"about_ca_topic_score_codex":0.000971796,"about_ca_topic_score_gemma":0.0005704584,"teacher_disagreement_score":0.007047192,"about_ca_system_score_codex":0.0028162892,"about_ca_system_score_gemma":0.0008654217,"threshold_uncertainty_score":0.0321244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075016716,0.19587167,0.09877463,0.0572732,0.009185964,0.00005295605,0.0016174284,0.0010323522,0.6286901],"genre_scores_gemma":[0.45454913,0.15740111,0.061283447,0.013328342,0.020133307,0.0002894505,0.0021370146,0.0008977522,0.2899805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957234,0.00011463167,0.000028155051,0.00006356928,0.00017562252,0.000045664307],"domain_scores_gemma":[0.9991223,0.00042121534,0.000091121234,0.00011371312,0.00017478273,0.0000769373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009477653,0.0004447291,0.00034425454,0.0027508263,0.0013492652,0.0027008615,0.0004924888,0.0011379318,0.019432036],"category_scores_gemma":[0.0024593838,0.00032447948,0.00035845884,0.0024169108,0.003354467,0.00717697,0.0014368726,0.003045224,0.0066389805],"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.000010156712,0.0000059753,0.000077652294,0.000045793582,0.000003875988,0.000026342395,0.00027088166,0.00015252245,0.00007992012,0.8523827,0.116400436,0.030543666],"study_design_scores_gemma":[0.0000055473233,0.00000568458,0.00022278827,0.00006346456,0.0000033797685,0.00010505813,0.000055687982,0.00026831243,0.0001685411,0.83133525,0.167758,0.000008368544],"about_ca_topic_score_codex":0.001249316,"about_ca_topic_score_gemma":0.0016723529,"teacher_disagreement_score":0.019432036,"about_ca_system_score_codex":0.001405308,"about_ca_system_score_gemma":0.0005815679,"threshold_uncertainty_score":0.065006614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8567441,0.00046783057,0.10159601,0.00051821617,0.00009078893,0.000121856385,0.0010550937,0.0003578491,0.0390482],"genre_scores_gemma":[0.98137295,0.0001357782,0.013836942,0.00009914534,0.0000679039,0.00011436398,0.0010488111,0.000067267036,0.0032568055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983688,0.0002027457,0.00016621768,0.00052162167,0.0004426853,0.00029782765],"domain_scores_gemma":[0.9919932,0.003692583,0.001402186,0.0011415783,0.00081734906,0.000953116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008670205,0.0003262441,0.0004532909,0.0021493174,0.0016469363,0.0035609773,0.0008213389,0.00082604587,0.0065724603],"category_scores_gemma":[0.0066923914,0.00042598328,0.0007779737,0.0013890736,0.0028339187,0.0042261216,0.0019065094,0.001421887,0.0005241675],"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.0003310863,0.000111912435,0.026907159,0.00015332164,0.000060863837,0.0014636731,0.001778295,0.0024491164,0.011175395,0.91174406,0.0027874669,0.04103754],"study_design_scores_gemma":[0.00008321701,0.000120278564,0.019344363,0.0000677321,0.0000611891,0.0018790903,0.0013141122,0.019220902,0.006886027,0.93801165,0.012932645,0.00007873819],"about_ca_topic_score_codex":0.000980828,"about_ca_topic_score_gemma":0.0011218068,"teacher_disagreement_score":0.0065724603,"about_ca_system_score_codex":0.0008441145,"about_ca_system_score_gemma":0.00054325577,"threshold_uncertainty_score":0.02198708},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021453463,0.013795993,0.2102687,0.5001205,0.02971779,0.0005170859,0.003859173,0.015597054,0.20467009],"genre_scores_gemma":[0.32952046,0.012928144,0.33110937,0.11804743,0.013469206,0.0024678772,0.009113978,0.014311509,0.169032],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9858576,0.0057392297,0.0007556164,0.002436464,0.003993981,0.0012171479],"domain_scores_gemma":[0.9410293,0.03246045,0.0011844895,0.0113745695,0.010954215,0.002997007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024069387,0.0015930071,0.0014546923,0.0013545771,0.0041588913,0.0076743523,0.0034087256,0.0048795394,0.027019568],"category_scores_gemma":[0.12705348,0.00069777603,0.0017776393,0.0012201518,0.007660642,0.017986394,0.0057341135,0.008590098,0.037452307],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031417806,0.00013185084,0.0016017396,0.00033549368,0.00009748532,0.00026039034,0.0007503344,0.0021727597,0.0005613537,0.21666816,0.5968908,0.18021545],"study_design_scores_gemma":[0.00013883234,0.0002251583,0.0008551439,0.0004568344,0.000055796958,0.00049347384,0.0004926056,0.009401583,0.0026238558,0.44084325,0.5442974,0.00011610645],"about_ca_topic_score_codex":0.0027952166,"about_ca_topic_score_gemma":0.002339252,"teacher_disagreement_score":0.027019568,"about_ca_system_score_codex":0.0024332416,"about_ca_system_score_gemma":0.0050029326,"threshold_uncertainty_score":0.12729257},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010731072,0.13363004,0.17741218,0.013423022,0.002337911,0.00005699066,0.00030699023,0.00039615156,0.66170573],"genre_scores_gemma":[0.5613521,0.07928231,0.08424175,0.0036583287,0.008151515,0.00041631382,0.0006723205,0.00044788184,0.26177746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993374,0.00023074196,0.000028104012,0.00010358317,0.00025519944,0.0000450394],"domain_scores_gemma":[0.99881786,0.00088114175,0.00005352581,0.00013047952,0.00008617362,0.000030695133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067809224,0.00075659616,0.000825689,0.0012981787,0.00092396245,0.0038743806,0.0009377515,0.0013345267,0.0073752026],"category_scores_gemma":[0.0029843452,0.00036001197,0.0005286832,0.0021828734,0.0066505377,0.005424787,0.0010043044,0.0033679488,0.0013625862],"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.0000012627378,0.0000020755074,0.000014820731,0.000026518575,0.0000014486088,0.0000041383523,0.000029914212,0.00033610908,0.000040615563,0.99357903,0.0025089965,0.0034551094],"study_design_scores_gemma":[0.000001504612,0.0000024182343,0.00005299678,0.000019887766,0.0000014336325,0.000019345016,0.000016989166,0.0006779271,0.000056521512,0.97307533,0.026072526,0.0000030255098],"about_ca_topic_score_codex":0.0011323419,"about_ca_topic_score_gemma":0.00092081836,"teacher_disagreement_score":0.0073752026,"about_ca_system_score_codex":0.002555753,"about_ca_system_score_gemma":0.0009774198,"threshold_uncertainty_score":0.024672508},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036302658,0.00040282027,0.9707609,0.0013563716,0.00006511626,0.00007344315,0.0002919728,0.0004265036,0.02299263],"genre_scores_gemma":[0.35634926,0.0011456325,0.61590374,0.0013720202,0.0002278297,0.0005226705,0.0011206677,0.00046204822,0.02289612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999046,0.00026301478,0.000058340218,0.00026275002,0.00026104588,0.0001087892],"domain_scores_gemma":[0.9985921,0.0006028221,0.00011545422,0.0003935374,0.00022613873,0.000069873495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017163425,0.0006988262,0.00034623346,0.0018556082,0.0015847312,0.0027665377,0.0020405215,0.002122248,0.011207636],"category_scores_gemma":[0.004141175,0.00038420342,0.001607068,0.0012618912,0.0045800866,0.0066992766,0.0021345182,0.0027437066,0.0013355362],"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.0000014671773,0.0000018179389,0.00003076286,0.000012474479,0.0000019448883,0.000019139185,0.000055471246,0.0012310555,0.00013982278,0.9958475,0.0003724419,0.0022861748],"study_design_scores_gemma":[0.000004116588,0.0000068234117,0.000050450075,0.000023724373,0.000007555696,0.00007820562,0.000042220967,0.014397297,0.0004790625,0.9581846,0.02671855,0.0000073351835],"about_ca_topic_score_codex":0.0063824607,"about_ca_topic_score_gemma":0.005673065,"teacher_disagreement_score":0.011207636,"about_ca_system_score_codex":0.0041441275,"about_ca_system_score_gemma":0.001656642,"threshold_uncertainty_score":0.03749329},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034897495,0.04007807,0.16275989,0.09690358,0.12439818,0.00008090475,0.001180616,0.0014036464,0.56970537],"genre_scores_gemma":[0.13119116,0.019010508,0.026379872,0.014774147,0.049078774,0.0001554954,0.0011955007,0.0012036335,0.7570109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992525,0.00015185498,0.000027669725,0.00020719448,0.00027701395,0.00008380895],"domain_scores_gemma":[0.9993567,0.00020441013,0.000021589074,0.000047812202,0.00028523913,0.00008429128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010804428,0.0010395423,0.0007821856,0.0015837423,0.0020829162,0.0035247079,0.0011030524,0.0018764195,0.053101167],"category_scores_gemma":[0.0028505994,0.0003925573,0.0008246275,0.0013756644,0.0018689246,0.0034161264,0.0014935433,0.0036199135,0.014207658],"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.000059050613,0.000016867649,0.00010207586,0.0001356456,0.000015176664,0.00012373156,0.00017018752,0.00035526833,0.0011989225,0.58790463,0.37775695,0.0321615],"study_design_scores_gemma":[0.000009791944,0.000022011733,0.000111640235,0.00005760975,0.000008646033,0.0001945097,0.00004241521,0.0010745935,0.0009829331,0.14318925,0.8542882,0.00001842207],"about_ca_topic_score_codex":0.0042804377,"about_ca_topic_score_gemma":0.004214765,"teacher_disagreement_score":0.053101167,"about_ca_system_score_codex":0.004222038,"about_ca_system_score_gemma":0.001373125,"threshold_uncertainty_score":0.1776411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1674468,0.0006144234,0.796116,0.0019742213,0.00016312694,0.00014056709,0.00026532792,0.00096016855,0.03231931],"genre_scores_gemma":[0.57875854,0.00033177235,0.40959823,0.0002866408,0.0002324234,0.00022108752,0.00034852073,0.0002097569,0.010013089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976114,0.0007522731,0.00019580733,0.00060229644,0.0006038018,0.0002345215],"domain_scores_gemma":[0.9899913,0.0073160417,0.0005040475,0.0013897469,0.0005350474,0.00026376508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659922,0.00074978004,0.0007290593,0.002159996,0.0017041715,0.004397469,0.0014958014,0.0012040765,0.009165603],"category_scores_gemma":[0.01839623,0.0006041794,0.0015835862,0.0018087942,0.00587444,0.010456611,0.0037489876,0.0022482793,0.0011549625],"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.00013549397,0.00003438186,0.0013012787,0.00013319401,0.000019162064,0.0000865018,0.0004547708,0.014847053,0.0011391118,0.94912106,0.0017819903,0.03094594],"study_design_scores_gemma":[0.000015580144,0.000024880597,0.00016044393,0.000032587337,0.000012106469,0.00011054295,0.00009305072,0.045927707,0.0020208077,0.94719833,0.004385388,0.000018657913],"about_ca_topic_score_codex":0.0007984366,"about_ca_topic_score_gemma":0.0011953544,"teacher_disagreement_score":0.009165603,"about_ca_system_score_codex":0.0018995273,"about_ca_system_score_gemma":0.000985418,"threshold_uncertainty_score":0.03066206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23501392,0.0017528735,0.5784575,0.037001085,0.00048136926,0.00015205855,0.0002834694,0.000799947,0.14605784],"genre_scores_gemma":[0.96823275,0.0004652645,0.021687124,0.0008868912,0.00015127653,0.000077239,0.000057686928,0.00010241545,0.008339323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917394,0.00023853022,0.000047627444,0.00020306697,0.00018640107,0.0001503994],"domain_scores_gemma":[0.99603707,0.002285415,0.0003403817,0.0003273731,0.00027857555,0.00073114457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001886145,0.00025699247,0.0012135573,0.0007552476,0.0011722116,0.0043486664,0.001791148,0.0025049066,0.010471062],"category_scores_gemma":[0.015698787,0.0003373501,0.00057293335,0.0005785501,0.007953544,0.0101635065,0.00296577,0.0028272914,0.0006799929],"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.000032813452,0.000018349368,0.0007313681,0.000034545454,0.000015627715,0.00007362749,0.0002997821,0.0022698198,0.00049306185,0.9857449,0.0016999807,0.0085860845],"study_design_scores_gemma":[0.000013790899,0.000012871128,0.00029052916,0.000014741321,0.0000068231107,0.0000584473,0.00015961201,0.015679566,0.00016527447,0.9820462,0.001543114,0.000009102293],"about_ca_topic_score_codex":0.002588218,"about_ca_topic_score_gemma":0.0017294027,"teacher_disagreement_score":0.010471062,"about_ca_system_score_codex":0.0013888871,"about_ca_system_score_gemma":0.0015092281,"threshold_uncertainty_score":0.035029233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016885366,0.0033717528,0.72807544,0.0037088238,0.0009172006,0.000054439595,0.00024554034,0.00034467573,0.2463968],"genre_scores_gemma":[0.7160951,0.0044341097,0.20241323,0.0026571734,0.0012069419,0.00019121906,0.0002778453,0.00029581416,0.072428495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991504,0.00017685627,0.000036961123,0.00019771085,0.00032531883,0.00011277629],"domain_scores_gemma":[0.99917054,0.0003084781,0.000060699225,0.0002107821,0.0001694,0.00008005088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008916049,0.00041602246,0.0005072037,0.0009862995,0.0012904733,0.0022221326,0.0011235378,0.00087993365,0.008068248],"category_scores_gemma":[0.002741556,0.00021551191,0.0008686789,0.00086472236,0.0037526924,0.004537167,0.0022619565,0.002295791,0.001599899],"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.0000012763146,0.0000016153712,0.00001822437,0.000004713291,6.45832e-7,0.000008685189,0.00003210333,0.00017510609,0.000093366136,0.9969637,0.00037392834,0.0023265816],"study_design_scores_gemma":[0.0000029244848,0.000007488202,0.00003379914,0.000009251229,0.000003450032,0.00007323348,0.00001737387,0.0044922833,0.00037119098,0.9614223,0.03356116,0.000005506215],"about_ca_topic_score_codex":0.0010587208,"about_ca_topic_score_gemma":0.0010201401,"teacher_disagreement_score":0.008068248,"about_ca_system_score_codex":0.0019978723,"about_ca_system_score_gemma":0.0007397936,"threshold_uncertainty_score":0.02699095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1785084,0.00062591623,0.77109754,0.0009199123,0.0000774554,0.00028614738,0.00021310934,0.00025885453,0.04801267],"genre_scores_gemma":[0.9264549,0.00035117523,0.063396856,0.00021388194,0.000093547234,0.0002939133,0.000172817,0.000060264287,0.008962657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978148,0.0006717355,0.00022268808,0.00050480437,0.0005336174,0.00025244552],"domain_scores_gemma":[0.9959794,0.0023471487,0.000378606,0.0005073379,0.00042615624,0.00036129958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001818131,0.0006077547,0.0006743801,0.0009972783,0.0010873113,0.0024910318,0.0013258493,0.00080857077,0.0052483208],"category_scores_gemma":[0.005886918,0.0003076806,0.0011372794,0.00077021203,0.0040714387,0.0056116623,0.0023260422,0.0019279345,0.00044889527],"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.000007805301,0.000011281892,0.0001166001,0.000028247838,0.000006123524,0.000029999806,0.0001502129,0.0020759949,0.00036478371,0.99491227,0.00011103291,0.0021856257],"study_design_scores_gemma":[0.00001180276,0.000026492873,0.0001534363,0.000015722995,0.000010276532,0.00004780711,0.00007940766,0.03187946,0.00077932223,0.9653464,0.0016365842,0.000013340765],"about_ca_topic_score_codex":0.0015954359,"about_ca_topic_score_gemma":0.0013759669,"teacher_disagreement_score":0.0052483208,"about_ca_system_score_codex":0.0020053345,"about_ca_system_score_gemma":0.0012542008,"threshold_uncertainty_score":0.017557323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109519295,0.004409865,0.81018466,0.012824258,0.00055893714,0.00016616537,0.00090864743,0.0019890233,0.059439152],"genre_scores_gemma":[0.9131209,0.0013030472,0.0667974,0.002593716,0.0012370752,0.0005012623,0.0007833711,0.00093319244,0.012730025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921846,0.0033304195,0.00025888465,0.0021417073,0.0011582158,0.00092619756],"domain_scores_gemma":[0.9011323,0.08309614,0.0029713947,0.00831332,0.0020108311,0.0024759697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010883206,0.0015233895,0.004500022,0.0023675573,0.0030444884,0.0053405627,0.003880886,0.0042165727,0.02684975],"category_scores_gemma":[0.0686702,0.0012585747,0.0028356453,0.002582681,0.01419198,0.012736281,0.007662897,0.0105674025,0.0027436542],"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.0003586789,0.00012183915,0.0013580304,0.00036353263,0.00014588985,0.00014154606,0.0001609216,0.06427019,0.00047320264,0.9096434,0.008958267,0.014004551],"study_design_scores_gemma":[0.000022834802,0.000025621344,0.00017606816,0.000038417762,0.000011764341,0.000031809923,0.000013036874,0.086554065,0.0002425453,0.9121545,0.00071478775,0.000014436231],"about_ca_topic_score_codex":0.0016238496,"about_ca_topic_score_gemma":0.0015210471,"teacher_disagreement_score":0.02684975,"about_ca_system_score_codex":0.0038151932,"about_ca_system_score_gemma":0.001998307,"threshold_uncertainty_score":0.08982134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021566586,0.04020594,0.011593111,0.022874836,0.0020489427,0.000032476135,0.00016786481,0.00009161979,0.92082846],"genre_scores_gemma":[0.22923505,0.02432781,0.012565191,0.010061825,0.0049993866,0.00022066743,0.0003735036,0.00029991343,0.71791667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991555,0.00041832737,0.000027476222,0.00015679364,0.00019103587,0.000050810275],"domain_scores_gemma":[0.9992841,0.00036384165,0.00004041054,0.00013951685,0.000117651696,0.000054454456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011702965,0.00056393276,0.0005530471,0.0010575308,0.0022301609,0.0057974206,0.00061534194,0.0018491924,0.020995587],"category_scores_gemma":[0.0023892587,0.00027116935,0.0002625598,0.0010080491,0.011716568,0.0063323895,0.0016858171,0.0038776004,0.00558785],"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.0000022190063,0.0000029759299,0.00002111439,0.00001762423,9.576706e-7,0.0000055698156,0.00030790732,0.000036094418,0.000029965762,0.981341,0.014442526,0.0037920757],"study_design_scores_gemma":[0.000003936049,0.00000520201,0.00010953543,0.00005766505,0.0000016356273,0.000034250334,0.00023410551,0.00010847396,0.000050173516,0.59599644,0.40339577,0.000002852873],"about_ca_topic_score_codex":0.0033174104,"about_ca_topic_score_gemma":0.003720224,"teacher_disagreement_score":0.020995587,"about_ca_system_score_codex":0.0033381537,"about_ca_system_score_gemma":0.0018589135,"threshold_uncertainty_score":0.07023722},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1143728,0.22837932,0.064966924,0.14780755,0.009613104,0.0003523886,0.005288978,0.0010526453,0.42816633],"genre_scores_gemma":[0.55272645,0.09912771,0.046049748,0.0092527,0.0014607813,0.00022698828,0.004350877,0.00043963816,0.28636512],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9968104,0.0007536969,0.00012286971,0.000449901,0.0014468792,0.00041625358],"domain_scores_gemma":[0.9938222,0.0012334167,0.00020649914,0.0004300341,0.0036662766,0.00064158166],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0039841942,0.0012105913,0.0009667404,0.003994524,0.0037620685,0.008610463,0.0016436419,0.0020779546,0.018162947],"category_scores_gemma":[0.0067116534,0.00051910814,0.00095579785,0.005852601,0.003077815,0.0038305416,0.001650241,0.002938817,0.0014743768],"study_design_candidate":"qualitative","study_design_consensus":null,"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.0003683531,0.0002476043,0.015294212,0.00096639805,0.00025105872,0.00075165246,0.002212529,0.01629818,0.002456239,0.26806957,0.1592665,0.5338177],"study_design_scores_gemma":[0.00006345096,0.00008660932,0.022869593,0.0009877102,0.00009866863,0.0002629781,0.0024334493,0.017097462,0.0015417371,0.01852983,0.93591845,0.000110067565],"about_ca_topic_score_codex":0.97778076,"about_ca_topic_score_gemma":0.9656397,"teacher_disagreement_score":0.99623793,"about_ca_system_score_codex":0.06088197,"about_ca_system_score_gemma":0.05041398,"threshold_uncertainty_score":0.4417317},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019231058,0.022423508,0.02551766,0.003354687,0.00094317505,0.00002740019,0.000277802,0.00032731483,0.9452054],"genre_scores_gemma":[0.0976245,0.02662933,0.022274029,0.0018981786,0.0031687142,0.00021082164,0.0012407242,0.000716279,0.84623736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960726,0.00009323762,0.000014833198,0.000065727865,0.00018427437,0.00003473558],"domain_scores_gemma":[0.99961334,0.00016303356,0.000019146264,0.00009793183,0.000080415215,0.000026115715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034021487,0.00093466195,0.00081345264,0.0019616438,0.0012710945,0.005053809,0.0007396001,0.0006514436,0.043522503],"category_scores_gemma":[0.0014717339,0.00040403195,0.00052210636,0.0028119055,0.003806676,0.005058258,0.0016256247,0.0026712525,0.014138555],"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.0000043893756,0.000008783696,0.000038130845,0.000082055056,0.000004606668,0.00001191389,0.00011804125,0.0003303612,0.00011416275,0.92339045,0.04205701,0.033839993],"study_design_scores_gemma":[0.0000031286218,0.000003091547,0.000088848254,0.000042871787,0.0000028909947,0.000033076973,0.000043293167,0.00043337763,0.000070321825,0.7522355,0.2470408,0.0000029198136],"about_ca_topic_score_codex":0.0018095692,"about_ca_topic_score_gemma":0.002226051,"teacher_disagreement_score":0.043522503,"about_ca_system_score_codex":0.0026859462,"about_ca_system_score_gemma":0.0015288491,"threshold_uncertainty_score":0.14559728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37272593,0.0007817188,0.5810553,0.0022825217,0.00011904379,0.00012939272,0.0013252707,0.00043564508,0.041145213],"genre_scores_gemma":[0.9476112,0.0003949566,0.03618337,0.0002337511,0.00008149123,0.00011841241,0.0006088528,0.00009133724,0.014676705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911386,0.00015605838,0.000046102836,0.00019038591,0.00034840018,0.00014522289],"domain_scores_gemma":[0.99671775,0.0022830851,0.00022823885,0.00024629573,0.00037928397,0.00014538725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079667,0.00043751203,0.0012530503,0.00055812416,0.00085790595,0.0028758706,0.00079864584,0.00087254756,0.005743623],"category_scores_gemma":[0.0054308567,0.00045031495,0.0013788556,0.0008945637,0.0024153006,0.004001492,0.0015290887,0.0035948595,0.0004450737],"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.00006110443,0.000016995878,0.00024957664,0.00005593398,0.000014944125,0.00006957917,0.00014732215,0.019816948,0.0010717572,0.9735563,0.0007713164,0.00416824],"study_design_scores_gemma":[0.000047779136,0.000019606014,0.00026457116,0.000012298604,0.000011180249,0.000045324126,0.000041226864,0.09172264,0.0015362499,0.90375376,0.0025287196,0.000016540334],"about_ca_topic_score_codex":0.0027230654,"about_ca_topic_score_gemma":0.0023719505,"teacher_disagreement_score":0.005743623,"about_ca_system_score_codex":0.0023839865,"about_ca_system_score_gemma":0.0012329879,"threshold_uncertainty_score":0.019214332},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19131058,0.0039780554,0.3346681,0.028610593,0.0026852197,0.00011947172,0.0006729997,0.00060468656,0.43735027],"genre_scores_gemma":[0.9159587,0.0012711145,0.051219467,0.002030228,0.0017522736,0.00012732261,0.00045017217,0.00015806087,0.027032726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972691,0.0008799042,0.00018985866,0.00053582236,0.0008394231,0.00028589362],"domain_scores_gemma":[0.9876896,0.008154692,0.0005805958,0.0020746677,0.0011799171,0.00032050372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026597816,0.0004789004,0.0011347936,0.0017336684,0.0020406612,0.0038420672,0.002038916,0.002160923,0.013321425],"category_scores_gemma":[0.022951912,0.00035522555,0.0014015143,0.0016554798,0.0053558634,0.010108034,0.003052514,0.0060190465,0.0011060844],"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.000018208228,0.0000075931566,0.00013522699,0.000019072979,0.0000037355421,0.000049628146,0.000052869058,0.00052331784,0.000092681425,0.9936386,0.001496187,0.003962834],"study_design_scores_gemma":[0.0000073561455,0.0000042894308,0.000061030936,0.000005750116,0.000004470501,0.00004205068,0.000012573083,0.0023603665,0.00007858995,0.9953365,0.0020829167,0.0000042525326],"about_ca_topic_score_codex":0.0013079876,"about_ca_topic_score_gemma":0.00082439336,"teacher_disagreement_score":0.013321425,"about_ca_system_score_codex":0.0018740587,"about_ca_system_score_gemma":0.0008613244,"threshold_uncertainty_score":0.044564605},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049633295,0.08734967,0.02266028,0.02160628,0.041711863,0.00026924012,0.0019241063,0.0020607645,0.81745446],"genre_scores_gemma":[0.004556611,0.008346609,0.0026773924,0.00048655353,0.0015012881,0.000046064753,0.00044813132,0.00028556946,0.9816518],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959224,0.00008230806,0.000012742465,0.000083294246,0.00017970313,0.000049761085],"domain_scores_gemma":[0.9994004,0.00014057585,0.000018568215,0.0000572183,0.0002407118,0.00014263635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011025933,0.0011156253,0.0008991037,0.0017687811,0.0017229632,0.0047790715,0.0007448693,0.0010883942,0.21097863],"category_scores_gemma":[0.0010360591,0.0003141455,0.00047774136,0.0013548958,0.00084858725,0.002093972,0.001629685,0.0017375041,0.052484907],"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.000060940805,0.00005303447,0.00013562228,0.00013275693,0.000007229797,0.000038743237,0.0001156719,0.00023231182,0.00052843936,0.013375198,0.8753703,0.10994976],"study_design_scores_gemma":[0.000007504137,0.00002293543,0.00043642594,0.00009195352,0.0000053449508,0.00006901828,0.00007003699,0.00023811543,0.00023795881,0.0019972597,0.9968183,0.000005126149],"about_ca_topic_score_codex":0.0075069703,"about_ca_topic_score_gemma":0.019010203,"teacher_disagreement_score":0.21097863,"about_ca_system_score_codex":0.0026201196,"about_ca_system_score_gemma":0.0023444323,"threshold_uncertainty_score":0.70579386},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063457116,0.1076248,0.027028559,0.33142352,0.014726567,0.000031202635,0.000332163,0.00053398527,0.5119534],"genre_scores_gemma":[0.44048697,0.07617798,0.028371854,0.031411663,0.014292567,0.00008325089,0.0003753176,0.0010341132,0.40776634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991283,0.00026114157,0.000028444749,0.00019299552,0.00027008736,0.00011895859],"domain_scores_gemma":[0.9984225,0.0006597249,0.00005486285,0.0002928792,0.00031543308,0.00025468704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013663729,0.00046190823,0.0005077493,0.0012009826,0.005685778,0.0073724696,0.0010112142,0.0021706396,0.016284274],"category_scores_gemma":[0.005707547,0.00043277873,0.00037002607,0.0019644005,0.013639703,0.016103767,0.003539867,0.0060539255,0.0021939748],"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.00001124165,0.000003321571,0.00007622518,0.00003774946,0.0000029447926,0.00002603902,0.00048531636,0.00015151195,0.00007056538,0.8940393,0.09170139,0.013394539],"study_design_scores_gemma":[0.0000035452022,0.0000020360985,0.00013032161,0.00005921086,0.0000023327827,0.000054509637,0.0002492938,0.00020377421,0.00008441773,0.42479187,0.57440835,0.000010264979],"about_ca_topic_score_codex":0.07503002,"about_ca_topic_score_gemma":0.08367271,"teacher_disagreement_score":0.07503002,"about_ca_system_score_codex":0.006173487,"about_ca_system_score_gemma":0.004369525,"threshold_uncertainty_score":0.14918661},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82078356,0.0004736483,0.1747896,0.0010317797,0.000044241475,0.00006424904,0.00070565485,0.0002020087,0.0019053153],"genre_scores_gemma":[0.9902518,0.000091110705,0.0090288855,0.000044261164,0.000018009328,0.000014143628,0.00014963694,0.000006981121,0.0003951404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997602,0.0000803041,0.000016155032,0.00005460842,0.00005484872,0.00003387973],"domain_scores_gemma":[0.99564654,0.003026766,0.00042195665,0.0002409948,0.00046871867,0.00019501432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014765391,0.00036002207,0.0003892478,0.0010764818,0.00016264767,0.001030034,0.0006043202,0.0007271113,0.0009841238],"category_scores_gemma":[0.01064831,0.00016610815,0.00036963457,0.0005202683,0.00058029353,0.0010237235,0.0006480038,0.00090516487,0.00014557564],"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.0015291977,0.0004841055,0.30287856,0.0001428127,0.00028655672,0.00043174342,0.00036750073,0.44125906,0.005940808,0.025767045,0.003322603,0.21759003],"study_design_scores_gemma":[0.000013963141,0.00006250909,0.015986737,0.000012117095,0.00001551122,0.000076068216,0.000038840615,0.9636324,0.00062654086,0.01940992,0.00011163946,0.000013897751],"about_ca_topic_score_codex":0.010977361,"about_ca_topic_score_gemma":0.008861478,"teacher_disagreement_score":0.010977361,"about_ca_system_score_codex":0.00079846015,"about_ca_system_score_gemma":0.00058865285,"threshold_uncertainty_score":0.021826923},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018036358,0.83794206,0.0020040935,0.12222499,0.02254005,0.000021325182,0.00015737039,0.00014049142,0.014789362],"genre_scores_gemma":[0.00637843,0.80302864,0.0025842462,0.119546495,0.038276494,0.00011080757,0.0002913547,0.0002075628,0.029576018],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988959,0.00033381605,0.000055772267,0.0001496086,0.0004732821,0.00009162213],"domain_scores_gemma":[0.99698335,0.0020238152,0.00011956144,0.000119779084,0.0005705769,0.00018292299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017098311,0.0012320558,0.0009031942,0.0028372083,0.001079597,0.0026443189,0.0020686453,0.0036246532,0.0070975306],"category_scores_gemma":[0.006993069,0.00049652817,0.00056013255,0.0031521583,0.0035424714,0.0062813717,0.0014930853,0.0067981817,0.007104224],"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.000021311953,0.000009580652,0.00009869539,0.0009616848,0.000017070353,0.000037323898,0.00023179743,0.00006835498,0.00007645253,0.039975755,0.9287452,0.029756788],"study_design_scores_gemma":[0.00001754139,0.000008207719,0.0005402724,0.0011186204,0.000019048646,0.0001464426,0.00010061388,0.000082142855,0.00018213174,0.030733144,0.96703815,0.000013629717],"about_ca_topic_score_codex":0.008331893,"about_ca_topic_score_gemma":0.0113896,"teacher_disagreement_score":0.008331893,"about_ca_system_score_codex":0.0019619984,"about_ca_system_score_gemma":0.0019953079,"threshold_uncertainty_score":0.02374363},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000334638,0.8668935,0.0025954556,0.110459976,0.008433909,0.000013926211,0.00010412585,0.000057398014,0.011107034],"genre_scores_gemma":[0.022597989,0.8787247,0.0027346122,0.06371943,0.019301726,0.000075878765,0.00020027324,0.00007811618,0.012567399],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976794,0.00087816326,0.00018740735,0.00022356345,0.0008947643,0.00013667984],"domain_scores_gemma":[0.99086386,0.0063711093,0.00036164737,0.00029804299,0.0018429465,0.0002624342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037474886,0.0010694942,0.0012117715,0.0028918805,0.0017496471,0.003101638,0.002159585,0.0066290097,0.003981283],"category_scores_gemma":[0.012404295,0.000675923,0.00064297405,0.0029305066,0.00906058,0.009993812,0.0013675308,0.008152669,0.0025965737],"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.00006031376,0.000026127705,0.00028267025,0.0013434814,0.000054860924,0.00011823296,0.0006543676,0.00025099286,0.00013363593,0.29428032,0.6521076,0.050687294],"study_design_scores_gemma":[0.00004489945,0.00002498995,0.0011491886,0.00190785,0.000044575158,0.00025747626,0.00032089307,0.00021179297,0.00049204053,0.274551,0.7209421,0.000053218777],"about_ca_topic_score_codex":0.01354198,"about_ca_topic_score_gemma":0.016786583,"teacher_disagreement_score":0.01354198,"about_ca_system_score_codex":0.0035767218,"about_ca_system_score_gemma":0.0031662337,"threshold_uncertainty_score":0.026926279},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003870589,0.021371793,0.0044901026,0.44361332,0.24253985,0.00058012945,0.0012128439,0.00210134,0.28022006],"genre_scores_gemma":[0.013434168,0.007229121,0.0032498334,0.12841836,0.014815721,0.00027407854,0.00072439347,0.0005679017,0.83128643],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945873,0.0006218411,0.00029399924,0.00057007757,0.0026802938,0.0012465005],"domain_scores_gemma":[0.99168736,0.00049265585,0.00022808314,0.0003906971,0.002713318,0.0044879355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059710033,0.0005777753,0.0006178946,0.0010031234,0.0047036577,0.0054353634,0.0009957337,0.004174322,0.09727055],"category_scores_gemma":[0.012337657,0.00054878514,0.0008477859,0.00077872694,0.0020539663,0.0039841975,0.005306678,0.009484521,0.045524906],"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.000015012703,0.00001580972,0.00015731521,0.00003694039,0.0000018425629,0.000042029547,0.000060352693,0.000009335166,0.000107430045,0.0035357345,0.9817141,0.014303989],"study_design_scores_gemma":[0.0000069400758,0.00001440327,0.00029550932,0.00004387242,0.0000013595819,0.000029999133,0.00013567234,0.000008305241,0.000083055376,0.000245654,0.9991315,0.0000037468049],"about_ca_topic_score_codex":0.009455332,"about_ca_topic_score_gemma":0.027714193,"teacher_disagreement_score":0.09727055,"about_ca_system_score_codex":0.0046049473,"about_ca_system_score_gemma":0.01881666,"threshold_uncertainty_score":0.32540238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3670167,0.0010424922,0.57779455,0.0031595102,0.00010904661,0.00015044356,0.0016847298,0.0005494486,0.048493203],"genre_scores_gemma":[0.92958105,0.0007966105,0.048180502,0.00031699263,0.00012401499,0.00018249758,0.0010675534,0.00012990426,0.019620908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907047,0.00013481014,0.00005000382,0.00020623834,0.00037375654,0.00016472937],"domain_scores_gemma":[0.99674076,0.0022341127,0.0002452467,0.0002676398,0.00036860857,0.00014371992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011383118,0.00056936144,0.0014365851,0.00065922085,0.0010390948,0.0033270482,0.0009128898,0.0010340218,0.0047393213],"category_scores_gemma":[0.0052117477,0.0005498189,0.0015616883,0.0010774692,0.002834699,0.005099281,0.0018845818,0.0043592993,0.00049377227],"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.000044870118,0.000013528187,0.0001986751,0.0000593585,0.000010913509,0.000047024645,0.00016409582,0.014082769,0.000871799,0.9789822,0.0007626716,0.0047620474],"study_design_scores_gemma":[0.00004359963,0.00001808257,0.00025179746,0.000010368628,0.000010412775,0.000035734618,0.00004066515,0.052865267,0.0012802209,0.94262475,0.0028016823,0.00001742199],"about_ca_topic_score_codex":0.0027712674,"about_ca_topic_score_gemma":0.0024397436,"teacher_disagreement_score":0.0047393213,"about_ca_system_score_codex":0.0022930175,"about_ca_system_score_gemma":0.0013809339,"threshold_uncertainty_score":0.016637087},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076763746,0.058470562,0.3532999,0.02059843,0.0026545532,0.000104387436,0.00030230865,0.00021674905,0.5566768],"genre_scores_gemma":[0.42917904,0.0852381,0.18876767,0.004222615,0.0102880085,0.00061324186,0.0010061023,0.0003720195,0.2803133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918324,0.00021919445,0.00005243762,0.000093501825,0.00038979982,0.000061806706],"domain_scores_gemma":[0.9990088,0.0005850276,0.00006582408,0.00016061049,0.00014041923,0.00003928542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008949805,0.00085438957,0.0006755785,0.0016319606,0.0010128466,0.0047971653,0.001234455,0.0013643443,0.010242993],"category_scores_gemma":[0.003103201,0.0004737202,0.0005971888,0.0033523187,0.003854395,0.008175103,0.0015286636,0.0031240347,0.0024038248],"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.000001443025,0.0000051346497,0.00002718235,0.000036164984,0.0000029969458,0.000009647458,0.000028961967,0.00063699257,0.00003772226,0.98588955,0.004445324,0.008878858],"study_design_scores_gemma":[0.0000012988432,0.0000018330729,0.00003697512,0.000021223002,0.0000024507456,0.000025954952,0.00001983502,0.0014849748,0.000037732087,0.9724912,0.025874628,0.0000018675236],"about_ca_topic_score_codex":0.0008979338,"about_ca_topic_score_gemma":0.0009105656,"teacher_disagreement_score":0.010242993,"about_ca_system_score_codex":0.002123166,"about_ca_system_score_gemma":0.0010314254,"threshold_uncertainty_score":0.034266233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0509107,0.0032110987,0.75138086,0.008590773,0.0010559765,0.00014144878,0.00031158925,0.0008702983,0.18352722],"genre_scores_gemma":[0.7921858,0.0021056933,0.18477546,0.00088968617,0.00047420163,0.00019312657,0.00057950907,0.00042232216,0.018374301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977144,0.0011922597,0.00018892488,0.00034545828,0.00040666075,0.00015242312],"domain_scores_gemma":[0.9959966,0.002193942,0.00025707562,0.00090680143,0.0005242697,0.000121289246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019646594,0.0004944642,0.00057514757,0.001454894,0.00091146445,0.0061443723,0.000972815,0.0012966822,0.007842462],"category_scores_gemma":[0.013990089,0.0004113384,0.00084081327,0.0011169901,0.009298321,0.009451281,0.0034240216,0.0019594484,0.0017208247],"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.00002641647,0.0000066383036,0.00010956206,0.00009476933,0.000010376308,0.00007076787,0.0012599084,0.0015466568,0.0016330017,0.975503,0.0010401742,0.01869864],"study_design_scores_gemma":[0.0000077677905,0.000009274493,0.00009312139,0.00004564256,0.000007449025,0.00004704419,0.00029046132,0.006151184,0.0012890293,0.9817616,0.010286295,0.000011209633],"about_ca_topic_score_codex":0.0008051555,"about_ca_topic_score_gemma":0.00037313145,"teacher_disagreement_score":0.007842462,"about_ca_system_score_codex":0.0014603267,"about_ca_system_score_gemma":0.0013778934,"threshold_uncertainty_score":0.02623564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009942092,0.0032236055,0.823585,0.013251931,0.0022484614,0.00034545935,0.0038126055,0.0065712743,0.13701957],"genre_scores_gemma":[0.32958093,0.0051804925,0.49558407,0.008993573,0.002749702,0.0015273923,0.009143413,0.0057576206,0.14148282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541533,0.0010937278,0.00033871012,0.0011352511,0.0013983109,0.00061874813],"domain_scores_gemma":[0.9920575,0.002921643,0.0003247893,0.003165298,0.0010493638,0.0004815133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040383,0.0015658544,0.0022419665,0.003089752,0.0054826587,0.008796204,0.0046251914,0.0028266136,0.077572435],"category_scores_gemma":[0.02052496,0.001204018,0.0035957373,0.0048527475,0.0052178157,0.020322677,0.012323424,0.00888029,0.024189612],"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.00017726421,0.000058698653,0.00028445097,0.00016674997,0.000036458085,0.00006270549,0.00016514461,0.0043907096,0.0003571867,0.9019954,0.048362035,0.043943174],"study_design_scores_gemma":[0.000045041994,0.000026354823,0.00009387163,0.000078818935,0.000026273114,0.00007536369,0.000089621826,0.024655577,0.0005093592,0.93040824,0.04396159,0.000029840296],"about_ca_topic_score_codex":0.004908204,"about_ca_topic_score_gemma":0.004788868,"teacher_disagreement_score":0.077572435,"about_ca_system_score_codex":0.0042387485,"about_ca_system_score_gemma":0.0047509167,"threshold_uncertainty_score":0.25950563},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023347951,0.025407065,0.08315363,0.25422603,0.005180051,0.00017765419,0.0006035564,0.0009891789,0.60691494],"genre_scores_gemma":[0.6267946,0.019972842,0.052538525,0.0583114,0.0027134975,0.0003637528,0.00065093103,0.0010689403,0.23758553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848664,0.00079900626,0.000046389716,0.000188276,0.0002493374,0.0002303238],"domain_scores_gemma":[0.9976568,0.0014267329,0.00016102337,0.0001753435,0.0002787727,0.00030129033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017611737,0.0008057277,0.0005098189,0.0007321652,0.0056250673,0.0076534534,0.0016510905,0.0035050155,0.021358714],"category_scores_gemma":[0.00845223,0.0003479321,0.00061057665,0.0008563971,0.009063788,0.013675141,0.0029610782,0.004724253,0.0054956065],"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.000032690725,0.00003009572,0.00032653584,0.00011330916,0.000012510924,0.00017616739,0.001889095,0.00036264482,0.00014621082,0.91456544,0.065150425,0.017194875],"study_design_scores_gemma":[0.000018525912,0.000049278584,0.0004888603,0.00023215238,0.000018496803,0.00037343142,0.0034042962,0.001769009,0.0006034915,0.4718519,0.52114433,0.00004625425],"about_ca_topic_score_codex":0.009083806,"about_ca_topic_score_gemma":0.009529455,"teacher_disagreement_score":0.021358714,"about_ca_system_score_codex":0.002973897,"about_ca_system_score_gemma":0.0014516355,"threshold_uncertainty_score":0.07145196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14845707,0.0015107106,0.7914755,0.003122437,0.00018587692,0.00012414341,0.00046406232,0.0003516033,0.05430859],"genre_scores_gemma":[0.8946357,0.0016265091,0.086789586,0.00088001107,0.00056201377,0.0006998581,0.0005176921,0.00030159054,0.013987049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844605,0.0005818184,0.00012711021,0.0003833222,0.00028937808,0.0001723198],"domain_scores_gemma":[0.9767402,0.017845895,0.0013678754,0.0016013463,0.0013073087,0.0011373323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005114358,0.0007809328,0.0013425044,0.0028296986,0.0024026986,0.0038064173,0.0025914626,0.002321173,0.008444948],"category_scores_gemma":[0.021328688,0.00090527657,0.0024100854,0.0018958839,0.006225663,0.010753439,0.0032796657,0.0057018455,0.00080046186],"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.000007517757,0.000013475723,0.00016706453,0.000017402912,0.0000061775895,0.000026680787,0.0001030337,0.0015559813,0.00017881629,0.99676645,0.00017977074,0.0009775966],"study_design_scores_gemma":[0.000006305304,0.000007356513,0.0000654105,0.000007910245,0.0000049677824,0.000038423957,0.000020710802,0.014045763,0.00010888143,0.9853426,0.0003458513,0.000005870865],"about_ca_topic_score_codex":0.0014021945,"about_ca_topic_score_gemma":0.001246996,"teacher_disagreement_score":0.008444948,"about_ca_system_score_codex":0.0021746857,"about_ca_system_score_gemma":0.0013015759,"threshold_uncertainty_score":0.028251112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16552432,0.012160434,0.69686747,0.007976544,0.0011189567,0.0001369172,0.00089967053,0.00068893883,0.1146268],"genre_scores_gemma":[0.79341274,0.0059356513,0.17038196,0.0007789932,0.0016654449,0.00021725731,0.0006670002,0.0002992652,0.026641734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978556,0.00077787985,0.00022830337,0.00053052994,0.0004656964,0.00014204164],"domain_scores_gemma":[0.9812237,0.014290593,0.0010137452,0.0015098567,0.0011352276,0.00082684256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038541607,0.00075471663,0.0013454657,0.0052920864,0.0034864428,0.0075952983,0.0017123456,0.0018137324,0.0058690514],"category_scores_gemma":[0.016815461,0.0008786894,0.002221752,0.0048651197,0.008103168,0.015119917,0.004659951,0.0049094106,0.00061338826],"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.000014231674,0.000014341954,0.00014164507,0.000029177168,0.000004703938,0.000029428284,0.00026637316,0.0007776184,0.00009518783,0.9930012,0.00045160454,0.005174436],"study_design_scores_gemma":[0.000005532236,0.0000053989306,0.000097930766,0.0000195356,0.0000055300893,0.000048194684,0.000100379315,0.0029744518,0.00016302125,0.9939067,0.00266613,0.0000071594645],"about_ca_topic_score_codex":0.0013954832,"about_ca_topic_score_gemma":0.0012676296,"teacher_disagreement_score":0.0075952983,"about_ca_system_score_codex":0.0032551512,"about_ca_system_score_gemma":0.001281853,"threshold_uncertainty_score":0.023617804},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10675391,0.04610781,0.14992774,0.08730035,0.0022960538,0.00011851385,0.00028167045,0.00041018156,0.6068038],"genre_scores_gemma":[0.952506,0.010776298,0.011394123,0.0029477219,0.000784124,0.000059372265,0.000055734192,0.00017219088,0.021304367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988574,0.0004348386,0.000046206933,0.00026364435,0.0002395695,0.00015832644],"domain_scores_gemma":[0.99614716,0.0022104545,0.0003599928,0.00044000588,0.0005870934,0.0002552345],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028877724,0.00042087844,0.0005090054,0.0012729724,0.003039063,0.006817679,0.0011587837,0.0033001408,0.006091525],"category_scores_gemma":[0.006039579,0.00036790577,0.00035163583,0.0013591213,0.02283563,0.012305039,0.0028286213,0.005027066,0.00093325955],"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.000034766184,0.000018185758,0.0004701476,0.0000662875,0.0000050217154,0.000065626664,0.0027850638,0.0008744032,0.000111838985,0.9761454,0.0024667531,0.016956609],"study_design_scores_gemma":[0.000013040446,0.00006556776,0.00067478325,0.00029147064,0.0000080646605,0.00023284595,0.0017778781,0.00296395,0.0006044647,0.8388166,0.1545163,0.00003503657],"about_ca_topic_score_codex":0.0044449344,"about_ca_topic_score_gemma":0.0026305302,"teacher_disagreement_score":0.99696094,"about_ca_system_score_codex":0.0042789704,"about_ca_system_score_gemma":0.0024553942,"threshold_uncertainty_score":0.031046271},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06514966,0.045099214,0.20668194,0.098429136,0.0024602388,0.0020200147,0.010057781,0.0023908925,0.5677111],"genre_scores_gemma":[0.5070217,0.045919113,0.211652,0.012596244,0.0019249344,0.0027899998,0.006750351,0.0015204225,0.2098252],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985415,0.0004899133,0.00008236437,0.00020237602,0.00046907616,0.00021475226],"domain_scores_gemma":[0.9986928,0.00034102754,0.0001013704,0.00021364527,0.0004190458,0.00023209935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030538887,0.00083551893,0.0003837422,0.0015927311,0.002161892,0.003737976,0.002620556,0.0015298176,0.02960341],"category_scores_gemma":[0.007916896,0.00034336053,0.000706584,0.0027727594,0.0017770774,0.0023982613,0.002136991,0.0023324934,0.003598819],"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.00027654116,0.00025836928,0.014158375,0.00033070554,0.00009241976,0.00043607072,0.0012004297,0.0052630254,0.00094609236,0.19867888,0.16630381,0.61205524],"study_design_scores_gemma":[0.00019417124,0.00033813916,0.021221615,0.0007151677,0.00013076581,0.0029075106,0.0014625614,0.0071138735,0.003039402,0.0759539,0.8867506,0.00017241806],"about_ca_topic_score_codex":0.2831345,"about_ca_topic_score_gemma":0.34520304,"teacher_disagreement_score":0.2831345,"about_ca_system_score_codex":0.016551478,"about_ca_system_score_gemma":0.017119842,"threshold_uncertainty_score":0.5629729},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09814557,0.0065727443,0.85815716,0.0035671957,0.0001829213,0.000050422906,0.00021657284,0.00020790753,0.032899477],"genre_scores_gemma":[0.88674647,0.0022250267,0.10511445,0.0002748339,0.00026284374,0.000046072106,0.00023082212,0.000056841403,0.0050427034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649894,0.0011152793,0.00018510083,0.00032186275,0.001546312,0.00033248446],"domain_scores_gemma":[0.9951565,0.0029206108,0.00037078533,0.00070722884,0.00062587723,0.00021885935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045246673,0.0005049177,0.0018969562,0.0022754788,0.0013306083,0.004162519,0.0018394224,0.0015856728,0.003089172],"category_scores_gemma":[0.017320568,0.000586955,0.0013436185,0.0022898111,0.003411451,0.007117788,0.0029123928,0.0032818005,0.00035979666],"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.00009119768,0.00002724643,0.00053383585,0.000120834586,0.0000543988,0.00005885392,0.00037237426,0.037840195,0.00055879477,0.93037045,0.0011735454,0.028798228],"study_design_scores_gemma":[0.00001267819,0.000016014603,0.00019016134,0.000027949494,0.000015147781,0.000028428998,0.00008659973,0.113917634,0.00019258262,0.88417655,0.0013263556,0.000009817635],"about_ca_topic_score_codex":0.0068012574,"about_ca_topic_score_gemma":0.004749638,"teacher_disagreement_score":0.0068012574,"about_ca_system_score_codex":0.0035970188,"about_ca_system_score_gemma":0.0012583325,"threshold_uncertainty_score":0.026098311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04970634,0.00026280613,0.93833953,0.0006251436,0.000060171173,0.00016550238,0.00006820805,0.00006825815,0.010703961],"genre_scores_gemma":[0.8763766,0.00045790384,0.11480422,0.00017977823,0.00004016697,0.00032764117,0.000057869398,0.000026751864,0.0077290186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999313,0.00029804994,0.000023652425,0.00010391486,0.00013185975,0.00012941359],"domain_scores_gemma":[0.9987356,0.00085252,0.00011830509,0.000058320424,0.00012551331,0.00010972059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011113617,0.00082214427,0.00080047175,0.00061335176,0.0006627082,0.0011656715,0.0017134283,0.00122279,0.0018971729],"category_scores_gemma":[0.0026070955,0.00034246565,0.0005856234,0.00067504693,0.0015789774,0.0011719386,0.0011114802,0.0010323024,0.00012010669],"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.00005083733,0.00005511697,0.0006062298,0.00006191716,0.0000452838,0.00020786928,0.00012755518,0.8703662,0.0017382852,0.114902526,0.0005958725,0.011242222],"study_design_scores_gemma":[0.000013079268,0.00002631438,0.00008575945,0.0000058056667,0.000009381222,0.000038157537,0.000029145756,0.97919846,0.00018664807,0.019613713,0.0007862644,0.0000072454245],"about_ca_topic_score_codex":0.0045713205,"about_ca_topic_score_gemma":0.0037032622,"teacher_disagreement_score":0.0045713205,"about_ca_system_score_codex":0.0014075474,"about_ca_system_score_gemma":0.0014971944,"threshold_uncertainty_score":0.010212541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033795228,0.03780238,0.048224818,0.0054608784,0.0021297904,0.00005794971,0.0004108786,0.0004721081,0.90206176],"genre_scores_gemma":[0.10828265,0.03018235,0.062259305,0.0039648763,0.0033187282,0.00033709806,0.0011120784,0.00067511137,0.78986776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940956,0.000117132644,0.000032685646,0.0001282325,0.00026728804,0.0000451649],"domain_scores_gemma":[0.99949336,0.00024372013,0.000034907218,0.00007280079,0.000118260235,0.000036896738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005396676,0.0008505207,0.0007914893,0.0018394146,0.0017861215,0.0062376135,0.00063334784,0.0009608123,0.018693818],"category_scores_gemma":[0.0012298761,0.00042806863,0.0006300693,0.0022494723,0.004016204,0.009097955,0.0011272293,0.0029932272,0.009088575],"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.0000034893462,0.0000059093145,0.000037299964,0.00007965305,0.0000024109243,0.000015127396,0.00021819015,0.000093635186,0.00027354705,0.95542306,0.02177119,0.022076387],"study_design_scores_gemma":[0.0000023439525,0.000010101315,0.00017091108,0.00009285108,0.0000045138495,0.0001583456,0.00011445007,0.0005310029,0.00034654382,0.5348904,0.46366876,0.00000984705],"about_ca_topic_score_codex":0.0011838897,"about_ca_topic_score_gemma":0.0013584503,"teacher_disagreement_score":0.018693818,"about_ca_system_score_codex":0.0018384972,"about_ca_system_score_gemma":0.0013795281,"threshold_uncertainty_score":0.062537014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20494662,0.004652046,0.7212285,0.0083271405,0.0003886457,0.00014990689,0.0007959631,0.0002920479,0.05921917],"genre_scores_gemma":[0.9399289,0.0021525824,0.051573616,0.0007355592,0.0009482412,0.00024355727,0.0004911914,0.0001286086,0.0037978038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510324,0.0017874528,0.00029929934,0.00062110875,0.0016076155,0.000581248],"domain_scores_gemma":[0.95632595,0.036633223,0.0018394281,0.00221056,0.0019914126,0.0009994894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004244206,0.00093584886,0.0013425996,0.0026046578,0.0019871376,0.004550935,0.0015368089,0.0017795069,0.003011152],"category_scores_gemma":[0.03229795,0.00048413992,0.001324302,0.0019141582,0.00892776,0.012604862,0.0046262494,0.0045947665,0.00045372924],"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.00003964322,0.000024303214,0.00043575512,0.000063436135,0.000014839804,0.00005529701,0.00018335244,0.012992445,0.00057063025,0.9818813,0.0006527456,0.0030861085],"study_design_scores_gemma":[0.0000060477114,0.000016207343,0.00017400873,0.000015253034,0.000004376423,0.000026047212,0.000025621486,0.026832076,0.00021659414,0.9720366,0.0006303799,0.000016722874],"about_ca_topic_score_codex":0.0011304741,"about_ca_topic_score_gemma":0.00058182486,"teacher_disagreement_score":0.004550935,"about_ca_system_score_codex":0.002828667,"about_ca_system_score_gemma":0.0015774657,"threshold_uncertainty_score":0.022445798},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028588285,0.050476626,0.029482076,0.039590113,0.008659291,0.00006170324,0.0007646099,0.00057058746,0.8675362],"genre_scores_gemma":[0.15913357,0.061537463,0.024459582,0.008247657,0.02252523,0.00040458966,0.0012820318,0.0012019421,0.721208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983405,0.00060229446,0.00009659843,0.00032952093,0.00053563254,0.00009540913],"domain_scores_gemma":[0.9979013,0.0010870015,0.00012329956,0.00028263254,0.0003898849,0.0002159596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012697895,0.0010693581,0.0012335188,0.002586548,0.0025406168,0.011730108,0.0009120183,0.0020638776,0.08585935],"category_scores_gemma":[0.0059566433,0.00042370963,0.00046197165,0.0043484927,0.0051932465,0.00796825,0.0024262469,0.0065570483,0.023470776],"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.0000085726815,0.000012665058,0.000098728415,0.00016152493,0.000005664224,0.000017262482,0.00020483104,0.00013852201,0.00011901632,0.8669472,0.1009316,0.031354375],"study_design_scores_gemma":[0.0000070639153,0.000008374195,0.00028031835,0.00013173271,0.0000067335027,0.00006273529,0.00010455159,0.0005116989,0.00007922434,0.5579001,0.4409013,0.000006128007],"about_ca_topic_score_codex":0.0022256316,"about_ca_topic_score_gemma":0.0030012738,"teacher_disagreement_score":0.08585935,"about_ca_system_score_codex":0.005534989,"about_ca_system_score_gemma":0.0030143505,"threshold_uncertainty_score":0.28722817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020068211,0.014795222,0.77470565,0.1523239,0.0013620001,0.000063040025,0.0002857607,0.00048334574,0.03591291],"genre_scores_gemma":[0.6519144,0.027496021,0.29581627,0.0066690324,0.0061144284,0.00047412893,0.00039367803,0.00036386232,0.010758136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726653,0.0014741177,0.00012633057,0.00030464964,0.0006878539,0.00014052744],"domain_scores_gemma":[0.9816042,0.0146731,0.0005201348,0.0019534666,0.0008558947,0.00039319095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066755307,0.00070322846,0.0018076882,0.0012688821,0.0018183162,0.0077407374,0.0030132355,0.004307698,0.005181738],"category_scores_gemma":[0.027009478,0.0009779101,0.0011078037,0.0008759738,0.011790609,0.020107076,0.0041836123,0.009422816,0.00095799967],"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.000008013752,0.000014361464,0.00019332071,0.00007596931,0.000010365781,0.000017805674,0.00013043438,0.0206592,0.00021132636,0.9721334,0.0016654101,0.0048803138],"study_design_scores_gemma":[0.0000030473864,0.0000030116018,0.00003487625,0.000019658066,0.0000013967781,0.0000076466395,0.000059168193,0.050786674,0.000055592485,0.94584966,0.0031730433,0.000006222534],"about_ca_topic_score_codex":0.0032112217,"about_ca_topic_score_gemma":0.0018844331,"teacher_disagreement_score":0.0077407374,"about_ca_system_score_codex":0.002300964,"about_ca_system_score_gemma":0.0026654012,"threshold_uncertainty_score":0.03530401},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6682635,0.00048440933,0.22492792,0.0012785145,0.00009781554,0.00008181926,0.000644918,0.00071039284,0.10351072],"genre_scores_gemma":[0.93491584,0.00029779668,0.030470347,0.00013881412,0.00010866704,0.00014691017,0.000721163,0.000112411355,0.03308812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993117,0.00011334249,0.00004569212,0.0001907375,0.0002220474,0.0001163823],"domain_scores_gemma":[0.9955923,0.0025643378,0.0003052037,0.0003666923,0.0005589617,0.0006124053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007995878,0.0005944553,0.00071377086,0.001736936,0.0026482139,0.0032291154,0.0010612482,0.0009151885,0.009934331],"category_scores_gemma":[0.005113656,0.0006652308,0.00066097954,0.0015275817,0.0033416634,0.003959482,0.0028971706,0.0024430335,0.00074096693],"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.00014122933,0.000077879566,0.0018625828,0.00009879238,0.000022844466,0.0004193228,0.0008209868,0.0027997661,0.003901342,0.9803734,0.00079431053,0.008687506],"study_design_scores_gemma":[0.000026734087,0.000030758016,0.0007618059,0.000028543252,0.000020594964,0.00021806799,0.0002802466,0.0145856105,0.0019855686,0.9781462,0.0039018132,0.000014057824],"about_ca_topic_score_codex":0.0011141517,"about_ca_topic_score_gemma":0.0019954466,"teacher_disagreement_score":0.009934331,"about_ca_system_score_codex":0.001430564,"about_ca_system_score_gemma":0.00073257316,"threshold_uncertainty_score":0.033233643},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011323621,0.0003758301,0.96750927,0.0020144219,0.0002952626,0.00012917632,0.00030371483,0.0010116261,0.017037177],"genre_scores_gemma":[0.33377528,0.00040739428,0.64537513,0.0016131743,0.000599431,0.0005807522,0.0013328841,0.0009285006,0.01538742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551636,0.0018358876,0.00025878768,0.00082413177,0.0012598799,0.0003049814],"domain_scores_gemma":[0.9815253,0.010519097,0.00047087265,0.0052991337,0.001619447,0.00056609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040289923,0.0010370718,0.0011570514,0.0013463174,0.0012387448,0.0025917138,0.0025771814,0.0017433704,0.016740283],"category_scores_gemma":[0.038895607,0.00087786507,0.0017213066,0.001064452,0.002819317,0.009746559,0.0054943007,0.004322241,0.0028300458],"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.0002491641,0.00009873092,0.00035911758,0.00023702279,0.000042610776,0.000060678612,0.0002592523,0.01856604,0.0018182435,0.86117285,0.01664772,0.10048856],"study_design_scores_gemma":[0.000028762504,0.000027547561,0.00006205465,0.000028280092,0.000013294758,0.00005027299,0.000028526643,0.103281744,0.0010605962,0.88936424,0.006043758,0.000010971099],"about_ca_topic_score_codex":0.0005454903,"about_ca_topic_score_gemma":0.0007384074,"teacher_disagreement_score":0.016740283,"about_ca_system_score_codex":0.0010466803,"about_ca_system_score_gemma":0.0012067436,"threshold_uncertainty_score":0.056001842},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15558694,0.006449406,0.6734153,0.008228778,0.00065969996,0.00014806836,0.00080163934,0.00026833586,0.15444186],"genre_scores_gemma":[0.9398767,0.0019980443,0.05053822,0.00086258526,0.0009549374,0.00019547092,0.00035637268,0.00009992384,0.005117706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968645,0.0011252209,0.0001628573,0.00046768298,0.0010657086,0.00031405577],"domain_scores_gemma":[0.988571,0.007999387,0.0009472787,0.0011121973,0.0008706125,0.0004994894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022630028,0.00055563374,0.0008072739,0.002865455,0.0017531519,0.004043036,0.0010531533,0.0016313018,0.0034474535],"category_scores_gemma":[0.013687811,0.00036429282,0.0012329809,0.0021793263,0.008196291,0.01091554,0.0033937437,0.004309717,0.00041047332],"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.00000639618,0.000008036116,0.00012224496,0.000018346409,0.000004331498,0.000014691663,0.000060839928,0.0006190113,0.00016158342,0.99712104,0.0003236398,0.001539687],"study_design_scores_gemma":[0.0000024559909,0.000004980594,0.00015068483,0.000008088174,0.000002380696,0.000029955012,0.000017147797,0.0037119265,0.00013726305,0.9949826,0.00094663736,0.000005856062],"about_ca_topic_score_codex":0.00083987194,"about_ca_topic_score_gemma":0.00049675064,"teacher_disagreement_score":0.004043036,"about_ca_system_score_codex":0.0024228757,"about_ca_system_score_gemma":0.00089908397,"threshold_uncertainty_score":0.017579257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47698933,0.0036974808,0.397741,0.022656411,0.0003706865,0.00015759293,0.00057741604,0.0005395366,0.09727061],"genre_scores_gemma":[0.9870204,0.00026112996,0.0073780366,0.0008191957,0.00035602108,0.00013519713,0.00012352587,0.0000722603,0.0038342385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986265,0.007062927,0.00069001,0.0024909275,0.0024137727,0.0010773956],"domain_scores_gemma":[0.93450826,0.052174225,0.002327051,0.0066314787,0.0031829593,0.0011759391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011053109,0.00036555727,0.0012513227,0.0011307854,0.0021617871,0.0033925117,0.0019787606,0.002496489,0.0058482857],"category_scores_gemma":[0.05253038,0.0005798518,0.0012744288,0.00090498896,0.010281851,0.008939906,0.0049331775,0.003717632,0.0004772503],"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.000088484434,0.00002390341,0.0013694,0.00004440155,0.000017813129,0.00007342462,0.00037806015,0.004372161,0.0003769619,0.98728675,0.00082848105,0.005140176],"study_design_scores_gemma":[0.00002826917,0.00004710129,0.00043845634,0.00001944441,0.000008920009,0.00007037843,0.000101434096,0.0155393295,0.00072061195,0.9812692,0.0017426808,0.000014176562],"about_ca_topic_score_codex":0.0008382154,"about_ca_topic_score_gemma":0.0003171772,"teacher_disagreement_score":0.011053109,"about_ca_system_score_codex":0.0019852633,"about_ca_system_score_gemma":0.00089453557,"threshold_uncertainty_score":0.05845517},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028790399,0.00050223153,0.028707752,0.007255131,0.007278926,0.000330375,0.00977981,0.008806838,0.93445987],"genre_scores_gemma":[0.048338678,0.0011350338,0.020294582,0.004826395,0.0021905878,0.00042311955,0.014441116,0.00931953,0.899031],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847656,0.00019418444,0.000101126876,0.0005430923,0.00037391248,0.0003111409],"domain_scores_gemma":[0.9985575,0.00019942703,0.000092252594,0.00049044983,0.00048695115,0.00017341728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009999474,0.0011712986,0.00097671,0.0010791955,0.00238147,0.005638745,0.0017505852,0.0017281587,0.5023199],"category_scores_gemma":[0.003718757,0.00064128864,0.0011400529,0.0013668493,0.001204361,0.009665167,0.0047659604,0.003215654,0.36377734],"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.00024901,0.000061418774,0.0004681779,0.00034297636,0.000027464037,0.00035786588,0.00021790863,0.00024510725,0.0013045275,0.17646933,0.71194744,0.10830884],"study_design_scores_gemma":[0.000015189151,0.00001586655,0.00018178108,0.000038850754,0.00000963443,0.00028740132,0.00010177622,0.0002410584,0.0012475991,0.020315792,0.97753,0.000015113005],"about_ca_topic_score_codex":0.0021038444,"about_ca_topic_score_gemma":0.0017570975,"teacher_disagreement_score":0.5023199,"about_ca_system_score_codex":0.0016857048,"about_ca_system_score_gemma":0.0014397242,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06752369,0.004064309,0.83741534,0.023055695,0.00043562893,0.000125973,0.00045056277,0.0003998593,0.06652895],"genre_scores_gemma":[0.77978784,0.0022832626,0.19676393,0.0023377016,0.001083618,0.0002741104,0.00053531013,0.0005839908,0.016350307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928445,0.0034192784,0.00034751004,0.0013586688,0.001549514,0.00048051286],"domain_scores_gemma":[0.94336486,0.046574727,0.0020117331,0.0048097973,0.0020071378,0.001231742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008922285,0.00093970116,0.001899852,0.0033919474,0.0037776935,0.008615821,0.003232351,0.004451808,0.010355561],"category_scores_gemma":[0.049746852,0.0008692755,0.0025366177,0.0029265566,0.02173119,0.027746532,0.008851299,0.007385948,0.0008337259],"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.000015975607,0.000008359288,0.00029293142,0.000050659135,0.000013319534,0.00003583938,0.00017406783,0.003025825,0.00007835846,0.990272,0.0008356307,0.0051969257],"study_design_scores_gemma":[0.000003723144,0.00000340595,0.00007613202,0.0000146651,0.0000040311334,0.000031276508,0.00004158356,0.007814083,0.00007012226,0.99093586,0.0009987586,0.000006239685],"about_ca_topic_score_codex":0.0028161807,"about_ca_topic_score_gemma":0.0020417792,"teacher_disagreement_score":0.010355561,"about_ca_system_score_codex":0.0035880136,"about_ca_system_score_gemma":0.0011751071,"threshold_uncertainty_score":0.047186077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24333881,0.00045694876,0.7010556,0.00045652932,0.00035919447,0.00009303272,0.0000735196,0.0010039633,0.053162392],"genre_scores_gemma":[0.8072026,0.00063308846,0.16596952,0.0003806792,0.00035197622,0.0002324806,0.0001844613,0.00049033243,0.024554849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989485,0.00026914355,0.00007794596,0.00020375162,0.0003325572,0.00016798252],"domain_scores_gemma":[0.99813783,0.0005785527,0.0002648887,0.0005029037,0.00032988383,0.0001859902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023839716,0.00061176316,0.00058947,0.0010439294,0.0010636329,0.0013134886,0.000830015,0.0004594399,0.0043673185],"category_scores_gemma":[0.0067204554,0.00022401405,0.0009405589,0.000847164,0.0030069393,0.0036500185,0.0023112053,0.00143641,0.0010517025],"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.000054845324,0.000025055648,0.00022390457,0.000048791466,0.000012145341,0.00023248576,0.00041137508,0.0037275478,0.007899082,0.9732612,0.0004297953,0.013673803],"study_design_scores_gemma":[0.00002639718,0.00025376832,0.00040297542,0.000053944823,0.00003155026,0.0005478187,0.00023319914,0.0346401,0.019250842,0.93148774,0.013030772,0.000041012216],"about_ca_topic_score_codex":0.0002478999,"about_ca_topic_score_gemma":0.00025420633,"teacher_disagreement_score":0.0043673185,"about_ca_system_score_codex":0.00053854176,"about_ca_system_score_gemma":0.00044741947,"threshold_uncertainty_score":0.014610171},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027655922,0.035306826,0.12676026,0.38463685,0.015726777,0.00011690063,0.0010548821,0.0009654314,0.40777615],"genre_scores_gemma":[0.67248523,0.036880717,0.06389998,0.06773337,0.03059476,0.0005570896,0.0022860775,0.0010050437,0.12455775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978225,0.00093193055,0.000094722986,0.0004016845,0.0005239581,0.00022519194],"domain_scores_gemma":[0.9819717,0.014176103,0.0003805669,0.0016664828,0.001350614,0.0004544749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052865343,0.0009776317,0.0011556008,0.0018808607,0.004040919,0.0045177955,0.0020865481,0.0039772424,0.018848572],"category_scores_gemma":[0.025343852,0.0006321405,0.0012282343,0.003322385,0.010218729,0.01965113,0.0043442356,0.009375343,0.0043502003],"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.000052343792,0.0000370983,0.00021740739,0.000098012344,0.000014612191,0.00007126553,0.00027719294,0.0009009821,0.00006579554,0.9303665,0.059606254,0.008292498],"study_design_scores_gemma":[0.000015004427,0.000006911288,0.00012098431,0.00004005862,0.0000056342265,0.000033769564,0.00006252113,0.00074399926,0.00006597845,0.97872263,0.020174677,0.000007969499],"about_ca_topic_score_codex":0.0030016848,"about_ca_topic_score_gemma":0.0024451518,"teacher_disagreement_score":0.018848572,"about_ca_system_score_codex":0.0028794678,"about_ca_system_score_gemma":0.0014299776,"threshold_uncertainty_score":0.06305474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8412229,0.0008599674,0.11311251,0.00054720824,0.000053603297,0.000026322581,0.00015287673,0.00022466303,0.043799996],"genre_scores_gemma":[0.99140924,0.00020143819,0.0059726243,0.0000390768,0.000012189022,0.000018005961,0.00004284558,0.000007920044,0.0022967393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996517,0.000059637405,0.000029304168,0.0001106527,0.00007703866,0.00007172134],"domain_scores_gemma":[0.9987581,0.00048725848,0.00015393995,0.0002659978,0.00015863685,0.00017608632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041593125,0.00025632224,0.0003568684,0.00055456604,0.00080589467,0.0022532844,0.00031921637,0.0004892838,0.0023186533],"category_scores_gemma":[0.0021936733,0.00013967084,0.00027335915,0.0004306402,0.0020544797,0.002702758,0.0015869183,0.0005697555,0.0002516228],"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.000041978663,0.00000833452,0.0009217739,0.000020539133,0.0000060113625,0.00008714588,0.00036023575,0.0037101854,0.0028842299,0.9873568,0.00017099672,0.0044317762],"study_design_scores_gemma":[0.000017198456,0.000036344052,0.0007934679,0.0000184582,0.000015193079,0.00017763874,0.00052424794,0.02200968,0.0047012405,0.96522886,0.0064627915,0.000014782623],"about_ca_topic_score_codex":0.0009679889,"about_ca_topic_score_gemma":0.0008743848,"teacher_disagreement_score":0.0023186533,"about_ca_system_score_codex":0.00066491705,"about_ca_system_score_gemma":0.00034920048,"threshold_uncertainty_score":0.0077566504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0481276,0.0056599793,0.086351104,0.0057840985,0.0041384343,0.000059845923,0.00026248064,0.0007408011,0.84887564],"genre_scores_gemma":[0.64217615,0.004814961,0.038712543,0.002148813,0.0011530224,0.00007597689,0.00023513872,0.0006378647,0.3100455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957925,0.00009232789,0.00002285807,0.00008465295,0.000152172,0.00006867268],"domain_scores_gemma":[0.9995252,0.00022101661,0.00003375062,0.00009323032,0.000093820694,0.00003302603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005411704,0.0005769012,0.00049440947,0.0009676357,0.0013857228,0.0025008556,0.00041881306,0.00054152415,0.013257766],"category_scores_gemma":[0.0029019448,0.00024203083,0.00035607096,0.0007919544,0.0028203053,0.0033043863,0.00093887566,0.002853602,0.005631886],"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.00008477693,0.000008969224,0.00012212875,0.00007074501,0.0000037353645,0.00021998212,0.00038078343,0.0005101723,0.0014319465,0.96235156,0.008865334,0.02594991],"study_design_scores_gemma":[0.000012937062,0.00006614291,0.00030963373,0.00009230403,0.000010825434,0.0009492782,0.00028889018,0.0014126726,0.0040584407,0.7921422,0.20063412,0.000022517603],"about_ca_topic_score_codex":0.00044575453,"about_ca_topic_score_gemma":0.0005008321,"teacher_disagreement_score":0.013257766,"about_ca_system_score_codex":0.000954037,"about_ca_system_score_gemma":0.0004580851,"threshold_uncertainty_score":0.044351637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017155051,0.03473435,0.27089134,0.014599324,0.02578522,0.0006676174,0.0077961334,0.014300253,0.6140708],"genre_scores_gemma":[0.022587119,0.019642387,0.04877934,0.00068320724,0.0016322981,0.00013913674,0.008659419,0.0016390579,0.896238],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993888,0.000093748495,0.000029817244,0.00008906243,0.0003235124,0.00007509592],"domain_scores_gemma":[0.9977768,0.00040775473,0.000038831844,0.0002928392,0.0011729428,0.00031094893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012818597,0.0011745626,0.0021403865,0.0008641338,0.0015672328,0.005076021,0.0013284936,0.0009854743,0.14727794],"category_scores_gemma":[0.002518332,0.0005148536,0.0006849637,0.0019843094,0.0013221955,0.0027033172,0.0017489044,0.0023719762,0.06773374],"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.00029389636,0.00009592841,0.00055814034,0.000254565,0.000032774737,0.000079365454,0.00027549622,0.0015713979,0.0015654657,0.013130843,0.8051741,0.17696805],"study_design_scores_gemma":[0.000078188445,0.00005984542,0.0016277768,0.00018628081,0.00006404711,0.00017795869,0.00020901754,0.0116224345,0.0018066729,0.011731153,0.9723994,0.000037210142],"about_ca_topic_score_codex":0.05422797,"about_ca_topic_score_gemma":0.15902402,"teacher_disagreement_score":0.14727794,"about_ca_system_score_codex":0.0025945702,"about_ca_system_score_gemma":0.005425845,"threshold_uncertainty_score":0.49269378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012373449,0.2343027,0.19021277,0.03621982,0.029780867,0.0002581681,0.0041600866,0.007833844,0.48485836],"genre_scores_gemma":[0.037677057,0.08088788,0.062787935,0.0019590114,0.0037186514,0.00020772388,0.0047625275,0.0027847588,0.8052145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908364,0.00015874216,0.000033163473,0.00015299868,0.00046636403,0.00010513991],"domain_scores_gemma":[0.9984316,0.00046532642,0.00003010432,0.0002462268,0.0005807972,0.0002458835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014656787,0.0008550623,0.0009796194,0.0013512399,0.0016529307,0.0047745225,0.0013684239,0.000818181,0.07522953],"category_scores_gemma":[0.002707734,0.00062445505,0.00056245114,0.0027229204,0.0020565463,0.0040998203,0.00273911,0.0026344252,0.013812684],"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.00008702919,0.00004091049,0.00030027665,0.00033199703,0.0000149663965,0.000040728035,0.00015692753,0.0015242371,0.0010415862,0.044180367,0.75874573,0.19353527],"study_design_scores_gemma":[0.000013751381,0.000016838905,0.0008306279,0.00028654776,0.000015413627,0.000119419325,0.00016454818,0.004755381,0.0013538367,0.03177311,0.96064836,0.000022220658],"about_ca_topic_score_codex":0.0466007,"about_ca_topic_score_gemma":0.10875076,"teacher_disagreement_score":0.07522953,"about_ca_system_score_codex":0.006546078,"about_ca_system_score_gemma":0.00792132,"threshold_uncertainty_score":0.25166786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016123825,0.040576212,0.0093956655,0.050834633,0.026537105,0.00028413298,0.009533747,0.0005695708,0.86065656],"genre_scores_gemma":[0.04523678,0.05638678,0.008926213,0.03188255,0.025098199,0.000847387,0.012506971,0.00055264577,0.8185625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833244,0.0003860429,0.00012015571,0.00037028533,0.00063515163,0.00015591118],"domain_scores_gemma":[0.99214655,0.0015994841,0.00028848898,0.0011840321,0.0042628916,0.00051857793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024569025,0.0011480089,0.00093939505,0.0037461875,0.0025133083,0.006912792,0.0019788304,0.0013079583,0.2428362],"category_scores_gemma":[0.014071127,0.0002712733,0.00091565,0.005704768,0.0012588786,0.0062418687,0.003180962,0.0021247023,0.08426126],"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.00010537228,0.000047447786,0.00036926116,0.00088136434,0.0000132932555,0.000033791286,0.00032228962,0.00026125158,0.00010121692,0.17159171,0.72385764,0.10241542],"study_design_scores_gemma":[0.00001222451,0.00002137789,0.0006887918,0.00059812196,0.000020743353,0.00004646727,0.0005887131,0.00012187233,0.00012684143,0.049464095,0.94830227,0.0000084393905],"about_ca_topic_score_codex":0.008592088,"about_ca_topic_score_gemma":0.0081891455,"teacher_disagreement_score":0.2428362,"about_ca_system_score_codex":0.0028110433,"about_ca_system_score_gemma":0.0036760161,"threshold_uncertainty_score":0.81236804},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074936956,0.0011847196,0.7464353,0.0022596854,0.00066965265,0.00009448287,0.00074065564,0.0009830695,0.17269537],"genre_scores_gemma":[0.81031674,0.0007006017,0.17159627,0.00049268204,0.00032027927,0.00017537626,0.00064679125,0.00017868401,0.0155724175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988606,0.0004073207,0.00008716911,0.0002760663,0.0002894364,0.000079439254],"domain_scores_gemma":[0.9979646,0.00071430317,0.0002430162,0.00045397633,0.0005256654,0.00009831945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011256883,0.00046053017,0.00039813848,0.0017523225,0.00077173254,0.0040085283,0.0008544942,0.00079235603,0.012798807],"category_scores_gemma":[0.007505919,0.00024431734,0.0005888018,0.0011747181,0.0035332895,0.0070981965,0.0015487425,0.0011177118,0.002001817],"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.000030766252,0.000005292402,0.0004540152,0.00003922478,0.000006637374,0.00003629419,0.00026715078,0.0014481557,0.000787415,0.9807726,0.0007363844,0.015416184],"study_design_scores_gemma":[0.000007679025,0.000024914018,0.0006095297,0.000025879639,0.000011244921,0.0001118356,0.00010717772,0.011338051,0.0005859968,0.9731452,0.014018896,0.000013523947],"about_ca_topic_score_codex":0.0013510757,"about_ca_topic_score_gemma":0.0008363776,"teacher_disagreement_score":0.012798807,"about_ca_system_score_codex":0.00085654925,"about_ca_system_score_gemma":0.0005662428,"threshold_uncertainty_score":0.04281628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024127606,0.0021490974,0.85617375,0.007479717,0.00030439158,0.000088849425,0.00013668952,0.00016021106,0.109379776],"genre_scores_gemma":[0.7575813,0.0019411055,0.2255697,0.0010642782,0.0011424063,0.00033530593,0.00016502086,0.00014412412,0.012056753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691004,0.0012887107,0.0001742672,0.00033669174,0.0010680793,0.00022233216],"domain_scores_gemma":[0.9892854,0.0071176994,0.00077951833,0.001826632,0.0006514784,0.00033930296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003982236,0.00084932573,0.00076616317,0.0033327404,0.0017627957,0.005644724,0.0018584534,0.0018266437,0.0062288526],"category_scores_gemma":[0.011876953,0.00043335275,0.0020806596,0.0023970536,0.013707201,0.011485816,0.0044949367,0.0040144436,0.0006364881],"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.0000021507985,0.0000039084007,0.000055725493,0.000021265836,0.0000036115337,0.000013073356,0.00005836441,0.001809765,0.000051315146,0.99602145,0.0001959621,0.001763474],"study_design_scores_gemma":[0.000002145474,0.000004011417,0.000044101962,0.000011236474,0.000002211886,0.000025185616,0.000024651348,0.005553996,0.00005611287,0.992673,0.0015988187,0.0000044368344],"about_ca_topic_score_codex":0.000418097,"about_ca_topic_score_gemma":0.00039123645,"teacher_disagreement_score":0.0062288526,"about_ca_system_score_codex":0.0021758378,"about_ca_system_score_gemma":0.0009476484,"threshold_uncertainty_score":0.021060288},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003006033,0.007995999,0.0060601123,0.030624218,0.022340242,0.0004161431,0.0113637615,0.0017122551,0.91648114],"genre_scores_gemma":[0.0141906915,0.004246505,0.0024806615,0.013117043,0.0028715301,0.0002757442,0.007655103,0.0005989102,0.95456386],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997755,0.00030107496,0.00011761448,0.00054925104,0.00091768225,0.00035941685],"domain_scores_gemma":[0.99720395,0.00037885824,0.00014037342,0.0003087192,0.0013754346,0.0005927479],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017990719,0.0009618793,0.0007401663,0.0015306532,0.002798954,0.0063491776,0.0021405616,0.003330972,0.4934808],"category_scores_gemma":[0.008156225,0.00039886238,0.00079005345,0.0015890751,0.0012096502,0.0043142824,0.0039546993,0.0030380115,0.31144866],"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.00010117447,0.00004031926,0.0006702218,0.00018049205,0.00000668511,0.00016630688,0.0005310149,0.00006901158,0.00022758722,0.036863603,0.8679419,0.09320176],"study_design_scores_gemma":[0.0000032143212,0.000011007438,0.00024200461,0.00007418052,0.0000012220403,0.0000652516,0.00010789745,0.000012870436,0.00004868103,0.002340058,0.99708945,0.0000041210437],"about_ca_topic_score_codex":0.0054517537,"about_ca_topic_score_gemma":0.0059475075,"teacher_disagreement_score":0.4934808,"about_ca_system_score_codex":0.0032259722,"about_ca_system_score_gemma":0.0033174513,"threshold_uncertainty_score":0.72248816},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032539705,0.047221642,0.14919066,0.009387862,0.0063354326,0.000058866855,0.00014585035,0.0004832819,0.7839225],"genre_scores_gemma":[0.0914356,0.041686837,0.08635734,0.0032195516,0.009113196,0.00031592883,0.0003802195,0.0007466274,0.76674473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995078,0.00012635828,0.00002435632,0.00006374176,0.00025072158,0.000027161828],"domain_scores_gemma":[0.9985343,0.000971196,0.00004968653,0.00020063257,0.00019551038,0.000048797396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060137524,0.0010489798,0.000859348,0.0016054147,0.0011975408,0.0034882824,0.0012547683,0.00071487913,0.014752034],"category_scores_gemma":[0.0033868558,0.0004004509,0.00049127376,0.0024898718,0.004620715,0.007847762,0.0012100294,0.0039840424,0.0054234215],"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.0000100968355,0.000008206743,0.000024086525,0.00007776768,0.0000037159732,0.000015718217,0.000110545225,0.0004683014,0.000112126516,0.9257487,0.040661775,0.03275909],"study_design_scores_gemma":[0.000005111588,0.000005709201,0.000060426704,0.000045706878,0.0000051097454,0.000073454736,0.000037698952,0.0016008621,0.00015334939,0.779438,0.21856968,0.000004945295],"about_ca_topic_score_codex":0.00063132617,"about_ca_topic_score_gemma":0.001077554,"teacher_disagreement_score":0.014752034,"about_ca_system_score_codex":0.0015162013,"about_ca_system_score_gemma":0.00066345226,"threshold_uncertainty_score":0.04935044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029512062,0.06900048,0.032684006,0.03845359,0.011924491,0.00007113034,0.00045946336,0.00044615738,0.8440094],"genre_scores_gemma":[0.06971476,0.105563276,0.02453409,0.016224448,0.011605982,0.00021853585,0.0004968446,0.0006532678,0.7709888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897087,0.00025450805,0.000029732664,0.00015893902,0.00051413657,0.000071816256],"domain_scores_gemma":[0.9989625,0.000534795,0.00005638085,0.0001152719,0.00023898862,0.00009212215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094810576,0.00094074523,0.00067475234,0.001096319,0.001989633,0.004399574,0.0005178657,0.00095309166,0.0118905995],"category_scores_gemma":[0.0037722925,0.0005641822,0.00051950983,0.00158821,0.0038738635,0.006278813,0.0022055842,0.00493505,0.008999656],"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.000019066782,0.000010663139,0.000057713303,0.00009719789,0.0000060270067,0.000050436713,0.0003221304,0.00042069514,0.00016118797,0.7643483,0.20694806,0.027558455],"study_design_scores_gemma":[0.0000059907347,0.000009472723,0.00006547552,0.00010876581,0.0000032511966,0.000104973704,0.00006915276,0.00042566928,0.00010013356,0.21487854,0.7842197,0.000008867793],"about_ca_topic_score_codex":0.0014729938,"about_ca_topic_score_gemma":0.0014457743,"teacher_disagreement_score":0.0118905995,"about_ca_system_score_codex":0.0029423146,"about_ca_system_score_gemma":0.002101734,"threshold_uncertainty_score":0.039777994},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038125522,0.00067749375,0.3542215,0.0097720185,0.00072148343,0.00015570725,0.0012764054,0.0018054202,0.5932445],"genre_scores_gemma":[0.8335911,0.0005797271,0.044094797,0.0013435192,0.00050183304,0.0003190225,0.0016399256,0.00052891683,0.11740123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978181,0.0008853098,0.0001091256,0.0004221054,0.0005560111,0.00020942255],"domain_scores_gemma":[0.9941204,0.0025080857,0.00020491454,0.0017746168,0.0009877946,0.00040420683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014570866,0.00054613955,0.00083436613,0.0017562773,0.0025390463,0.0041043847,0.0014971189,0.0017700958,0.057922468],"category_scores_gemma":[0.010759085,0.0004572272,0.0009821366,0.0014177901,0.0042857085,0.008908748,0.0039737113,0.0030505615,0.007957658],"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.0000053727604,0.0000053366507,0.000047721034,0.0000066903094,0.0000019383688,0.0000055591177,0.00003647586,0.00026155193,0.000048051854,0.99698895,0.0010796263,0.0015127616],"study_design_scores_gemma":[0.000005779264,0.0000027109093,0.000027471775,0.000004905303,0.0000023055004,0.000015730957,0.00003732977,0.0017286259,0.00013643545,0.9888393,0.009196222,0.000003213015],"about_ca_topic_score_codex":0.0011743925,"about_ca_topic_score_gemma":0.0009932375,"teacher_disagreement_score":0.057922468,"about_ca_system_score_codex":0.0019180677,"about_ca_system_score_gemma":0.0014430804,"threshold_uncertainty_score":0.19376993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064402886,0.014537812,0.23152527,0.039882146,0.0012836184,0.00007213295,0.00037690005,0.0014308806,0.6464884],"genre_scores_gemma":[0.90320075,0.0037245802,0.04019495,0.0022551694,0.00064512773,0.00013322826,0.00017764469,0.00028866468,0.04937987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867505,0.0004543182,0.000070954826,0.0002145912,0.0004288238,0.00015623473],"domain_scores_gemma":[0.9958489,0.0025217412,0.00022462632,0.00087284663,0.0004160976,0.00011579467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00189335,0.0005792922,0.0007639964,0.0021522534,0.00276867,0.004694106,0.0013392919,0.0021483644,0.011874569],"category_scores_gemma":[0.012116715,0.00049929175,0.00075121794,0.0019517165,0.01103854,0.012492011,0.0030923514,0.004266342,0.0021148971],"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.000006841227,0.0000045131924,0.000049990587,0.000017802355,0.00000273804,0.000019432588,0.000110192785,0.00030069222,0.000050372488,0.9902492,0.0034003279,0.0057878937],"study_design_scores_gemma":[0.000001997401,0.0000018279884,0.000021354776,0.000011045059,0.0000017035867,0.000031587388,0.000026802752,0.0007694772,0.00007145056,0.9934273,0.005633053,0.0000025539646],"about_ca_topic_score_codex":0.0010683048,"about_ca_topic_score_gemma":0.0008884845,"teacher_disagreement_score":0.011874569,"about_ca_system_score_codex":0.0026041104,"about_ca_system_score_gemma":0.0008086159,"threshold_uncertainty_score":0.03972435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002528429,0.15771939,0.062414654,0.018047767,0.002800243,0.00011365974,0.00046057464,0.0004990033,0.75541633],"genre_scores_gemma":[0.18543658,0.21818747,0.08689756,0.008178613,0.00386769,0.00056053424,0.0028100996,0.0005584118,0.49350315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900526,0.00027192626,0.00006243928,0.0001280196,0.00044256047,0.00008984004],"domain_scores_gemma":[0.99930775,0.00036623058,0.000040625997,0.00012680543,0.0001040603,0.000054434306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085656473,0.00085545424,0.0006441575,0.0017333695,0.0016374149,0.008059365,0.0012779386,0.002670964,0.014725839],"category_scores_gemma":[0.0021799703,0.00048546278,0.0005745244,0.0031909812,0.0050496096,0.009061205,0.0030070692,0.0032731271,0.0043657306],"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.000003444879,0.00000913683,0.00005036186,0.0001630539,0.0000073622145,0.0000473846,0.0004171794,0.00046088392,0.00007957495,0.9389896,0.027543716,0.032228347],"study_design_scores_gemma":[0.0000027020671,0.0000034380214,0.00008204446,0.00017860271,0.000003934913,0.000088398236,0.00020179056,0.0006061771,0.000053004886,0.49598438,0.5027907,0.0000047634567],"about_ca_topic_score_codex":0.003573294,"about_ca_topic_score_gemma":0.0027620317,"teacher_disagreement_score":0.014725839,"about_ca_system_score_codex":0.0029481663,"about_ca_system_score_gemma":0.0025479794,"threshold_uncertainty_score":0.04926282},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003513295,0.01823943,0.078979746,0.009797882,0.000985584,0.000050146475,0.00040740013,0.0003580126,0.88766855],"genre_scores_gemma":[0.27979222,0.03349956,0.08141277,0.0059976256,0.006538935,0.000557906,0.002292623,0.0009300997,0.58897835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917346,0.00018158533,0.00003194095,0.00016324384,0.00039195135,0.000057748905],"domain_scores_gemma":[0.99899,0.00055315945,0.000032964806,0.00022545885,0.0001515193,0.000046856458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070573273,0.00077193254,0.0007124396,0.0016157373,0.0011555761,0.004161246,0.0009384226,0.0010428851,0.030904148],"category_scores_gemma":[0.003306889,0.00039102786,0.00061246735,0.0018224751,0.0031516068,0.00556345,0.0017444072,0.003845796,0.0073089264],"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.0000036676906,0.000009754995,0.00006805477,0.000067792105,0.0000063186867,0.000010650796,0.000095471805,0.0004400824,0.00009548309,0.9455412,0.028497372,0.025164196],"study_design_scores_gemma":[0.0000029226205,0.000002550979,0.000109013374,0.00003077592,0.000002914721,0.000033605793,0.000024709012,0.00061087986,0.00008041294,0.88912225,0.109977156,0.0000028067325],"about_ca_topic_score_codex":0.0009711277,"about_ca_topic_score_gemma":0.0010209531,"teacher_disagreement_score":0.030904148,"about_ca_system_score_codex":0.0027552093,"about_ca_system_score_gemma":0.0010780955,"threshold_uncertainty_score":0.10338467},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029055488,0.23431484,0.2826184,0.1522117,0.024454579,0.00026129637,0.00075772573,0.0011095959,0.30136633],"genre_scores_gemma":[0.08538713,0.21635969,0.2046429,0.052955758,0.038592298,0.0009982524,0.0011644098,0.0015517693,0.39834785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983841,0.0006454986,0.00011335311,0.0003219419,0.000419238,0.00011585378],"domain_scores_gemma":[0.9938845,0.0044921734,0.0001404674,0.0005374843,0.0006764787,0.00026882262],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026495643,0.0009846607,0.00078298873,0.0019074307,0.0019701358,0.005982496,0.0018640806,0.0033416569,0.026326725],"category_scores_gemma":[0.0063022766,0.00075954024,0.0010771828,0.0024013699,0.008383644,0.011148371,0.0029189582,0.008273076,0.008169572],"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.000043858556,0.000054057982,0.00027387583,0.00057558715,0.000017942957,0.0000806793,0.0010091441,0.0006789821,0.0005696186,0.7284739,0.16708975,0.101132594],"study_design_scores_gemma":[0.0000068992313,0.000024781924,0.00024290054,0.00054655207,0.000007336248,0.00011794618,0.00018347809,0.00062110025,0.00033403953,0.25076813,0.74712586,0.000021095968],"about_ca_topic_score_codex":0.0029875478,"about_ca_topic_score_gemma":0.004824705,"teacher_disagreement_score":0.9980299,"about_ca_system_score_codex":0.0034340788,"about_ca_system_score_gemma":0.0020979063,"threshold_uncertainty_score":0.088071644},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003971974,0.011491764,0.2305073,0.0051643597,0.0019629702,0.00005265667,0.00030889336,0.00045299064,0.746087],"genre_scores_gemma":[0.3148821,0.018469213,0.20827752,0.004689802,0.0056441105,0.0006401155,0.0012171174,0.0022089873,0.44397104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984901,0.00050970033,0.00006970888,0.00037159992,0.0004466956,0.00011216414],"domain_scores_gemma":[0.9984848,0.0007859151,0.00006225706,0.00046300414,0.0001461823,0.000057896963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001373942,0.0011697782,0.0012991596,0.0026737207,0.0020684532,0.0035786442,0.0016700688,0.0017691929,0.036675606],"category_scores_gemma":[0.0058804606,0.0007845467,0.0014625995,0.0023628585,0.007626419,0.010294037,0.003756272,0.0070585497,0.009261837],"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.000007146344,0.000005512764,0.000014233198,0.000030248602,0.0000033830775,0.000011988001,0.000043104796,0.00013549581,0.00006513168,0.9828283,0.0051861014,0.011669393],"study_design_scores_gemma":[0.0000040250993,0.0000030582876,0.000022270651,0.000022941687,0.0000033528618,0.00003600746,0.000012195887,0.0006020719,0.00015957678,0.9634912,0.03563874,0.0000046004347],"about_ca_topic_score_codex":0.0005441998,"about_ca_topic_score_gemma":0.0004215554,"teacher_disagreement_score":0.036675606,"about_ca_system_score_codex":0.001385418,"about_ca_system_score_gemma":0.0009870953,"threshold_uncertainty_score":0.12269211},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036201107,0.006742893,0.0733566,0.0011389005,0.00094937667,0.00007456029,0.00038169787,0.0007840384,0.9129519],"genre_scores_gemma":[0.20076299,0.015505796,0.042388793,0.00084883923,0.0012634821,0.0002719375,0.0011600587,0.000981521,0.7368166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997594,0.000031416424,0.000008465896,0.000054532185,0.000118820164,0.000027405498],"domain_scores_gemma":[0.99985063,0.000043798023,0.000008112815,0.000059596223,0.000026989874,0.000010894791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017163699,0.00065120833,0.00053452625,0.00084455626,0.0008629029,0.0017130873,0.00080556603,0.00053850916,0.053747587],"category_scores_gemma":[0.0007036552,0.0003607465,0.00055057806,0.0011656783,0.0016226496,0.0022509594,0.0010465637,0.0014829506,0.013433063],"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.000015707104,0.000011137538,0.00002417117,0.00012529206,0.000008466022,0.00002366589,0.00004261807,0.0015268233,0.0011934662,0.8951984,0.025406957,0.07642331],"study_design_scores_gemma":[0.0000119515835,0.00001580963,0.0000790931,0.000066277076,0.0000115723215,0.00010466798,0.000022369932,0.0032120077,0.0033329448,0.6765354,0.3165932,0.000014571614],"about_ca_topic_score_codex":0.0006382646,"about_ca_topic_score_gemma":0.0009783328,"teacher_disagreement_score":0.053747587,"about_ca_system_score_codex":0.0011226048,"about_ca_system_score_gemma":0.00084837456,"threshold_uncertainty_score":0.17980361},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026552384,0.001436386,0.07828785,0.0016948305,0.001260827,0.00007822312,0.002727204,0.001682627,0.9101768],"genre_scores_gemma":[0.104109325,0.0028062514,0.041050334,0.0010957745,0.0012329785,0.00024645397,0.007511372,0.0017537844,0.8401937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994178,0.00008070592,0.000026004767,0.00022120815,0.00016639376,0.0000879547],"domain_scores_gemma":[0.9996841,0.000059184706,0.000020434441,0.00008624638,0.00011117354,0.000038876366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039054875,0.0011867994,0.00059811695,0.001672575,0.001856983,0.0047811815,0.0010645114,0.0010545654,0.185346],"category_scores_gemma":[0.0014748205,0.00043623894,0.000525516,0.0014895479,0.0014140105,0.005975706,0.0019604296,0.0017501819,0.06950352],"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.000023752236,0.0000072590433,0.000028285538,0.000039082803,0.000002751042,0.000018288627,0.000113011025,0.00010745194,0.0002901994,0.9319825,0.03895858,0.028428731],"study_design_scores_gemma":[0.000011154931,0.00000863118,0.000055338078,0.000039107945,0.0000067594224,0.000060739327,0.00012026478,0.0003521599,0.0005840066,0.42347807,0.57527584,0.00000788304],"about_ca_topic_score_codex":0.0023536044,"about_ca_topic_score_gemma":0.0020426102,"teacher_disagreement_score":0.185346,"about_ca_system_score_codex":0.0013061924,"about_ca_system_score_gemma":0.0008214191,"threshold_uncertainty_score":0},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10948378,0.08005628,0.1307117,0.36043394,0.0033317092,0.00004521914,0.00038451562,0.0002975141,0.3152554],"genre_scores_gemma":[0.95509905,0.012851611,0.008613057,0.0060744006,0.0019350016,0.00006241331,0.000095332434,0.00009243329,0.015176649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994234,0.00025511626,0.000018165021,0.000101373385,0.00012692064,0.00007519082],"domain_scores_gemma":[0.99843067,0.0009232321,0.0001196607,0.00021977845,0.00017322006,0.00013352909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017400178,0.0002582274,0.0005956662,0.00093691505,0.0016511847,0.006127971,0.00068940653,0.0040479484,0.0065329983],"category_scores_gemma":[0.004973965,0.0003268353,0.00040972524,0.0009146904,0.011487099,0.018019306,0.0020458924,0.004906006,0.00081375305],"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.000009839963,0.000009454249,0.0001205341,0.000026728056,0.000006188894,0.000014967736,0.00025882645,0.00021246792,0.00011508872,0.99229735,0.0019170345,0.0050113676],"study_design_scores_gemma":[0.0000027634771,0.0000026715911,0.00013539755,0.000016743417,0.000002275634,0.000017570865,0.00015166726,0.00042520263,0.000057287747,0.9938146,0.005369623,0.0000042351635],"about_ca_topic_score_codex":0.0017792926,"about_ca_topic_score_gemma":0.000954372,"teacher_disagreement_score":0.0065329983,"about_ca_system_score_codex":0.0024274231,"about_ca_system_score_gemma":0.0012875643,"threshold_uncertainty_score":0.021855056},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017109744,0.001882219,0.04257736,0.0019161163,0.000982826,0.000035850786,0.00023471363,0.0002792873,0.93498176],"genre_scores_gemma":[0.5646063,0.0040414687,0.016993092,0.0010896503,0.001420052,0.00012540894,0.0010661763,0.0005601833,0.41009763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995782,0.00005048388,0.00001927677,0.00009846048,0.00018510774,0.00006851083],"domain_scores_gemma":[0.99974114,0.000073989475,0.000014080352,0.00006246668,0.00007477887,0.000033612552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035274436,0.00051419117,0.0004707822,0.0011417549,0.0014052197,0.0022718043,0.00046778485,0.0005545848,0.028428826],"category_scores_gemma":[0.0008725866,0.0002473319,0.0005490792,0.00080106006,0.0022750264,0.004891311,0.0026439265,0.0024113778,0.0048388727],"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.000009505962,0.0000067125493,0.00002989132,0.000025578838,0.0000028328493,0.000011865456,0.00008836418,0.00011451544,0.00035188973,0.9807047,0.0052079065,0.013446304],"study_design_scores_gemma":[0.0000042251286,0.000009440252,0.00010699437,0.000017624307,0.0000047636,0.000046595553,0.000057662026,0.00043216755,0.0005222599,0.94582105,0.052973296,0.0000039618303],"about_ca_topic_score_codex":0.0006094461,"about_ca_topic_score_gemma":0.00055550534,"teacher_disagreement_score":0.028428826,"about_ca_system_score_codex":0.0012649327,"about_ca_system_score_gemma":0.00059466437,"threshold_uncertainty_score":0.09510386},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037202134,0.9344918,0.0051462003,0.013355359,0.004058054,0.000012163468,0.00033196056,0.00019311663,0.042039316],"genre_scores_gemma":[0.009948331,0.90731674,0.009791691,0.0024870767,0.0068330886,0.00006837389,0.00087686855,0.00027134965,0.062406495],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912506,0.0001666688,0.000064951455,0.00020527317,0.00038428901,0.00005381774],"domain_scores_gemma":[0.998669,0.0007423221,0.00012026214,0.00008961098,0.00024699172,0.00013181122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011975567,0.0017135817,0.0013049224,0.0042219423,0.0011428588,0.0036973928,0.0012620866,0.0017936603,0.035727687],"category_scores_gemma":[0.0026361998,0.0011418223,0.00088902185,0.0050432463,0.0028287207,0.0077567697,0.0017711021,0.0043779113,0.02194551],"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.000052701624,0.00002597014,0.00050114666,0.0013101937,0.000038251623,0.00012164632,0.0010214747,0.0008145476,0.0003374395,0.09131226,0.68467784,0.21978651],"study_design_scores_gemma":[0.000008412873,0.000008257678,0.000569081,0.000976496,0.00001845915,0.00037993892,0.00016545926,0.00027020855,0.00014459496,0.080544315,0.9168938,0.000020953812],"about_ca_topic_score_codex":0.007974132,"about_ca_topic_score_gemma":0.013403111,"teacher_disagreement_score":0.035727687,"about_ca_system_score_codex":0.0025204674,"about_ca_system_score_gemma":0.0032137565,"threshold_uncertainty_score":0.11952102},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10824177,0.03264748,0.52858925,0.014956617,0.0010051817,0.00008003074,0.0010211463,0.00023673664,0.31322187],"genre_scores_gemma":[0.9305963,0.017290294,0.026328307,0.0005517826,0.0020015943,0.00018556227,0.00052439247,0.00009056313,0.022431217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990765,0.0002040858,0.000040013292,0.00013268444,0.00047073612,0.00007608084],"domain_scores_gemma":[0.99661285,0.0027850566,0.00014601779,0.00017218773,0.00021315031,0.000070722665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062608137,0.0005822934,0.0007130533,0.0008746473,0.0006390297,0.0024268206,0.0008393955,0.0009805145,0.0058084573],"category_scores_gemma":[0.0051822243,0.00035643895,0.000491359,0.0010017538,0.0016565078,0.0034320347,0.0012209017,0.0022592098,0.00040325007],"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.000026727344,0.000025379428,0.00028460706,0.00014488405,0.00002090097,0.00007905966,0.000129845,0.06861758,0.0005283949,0.90071315,0.005177539,0.024252016],"study_design_scores_gemma":[0.000005140219,0.000006882901,0.00028109588,0.00002738376,0.0000073905862,0.000048711725,0.000027513415,0.11099582,0.00015791437,0.88389385,0.0045395014,0.000008788324],"about_ca_topic_score_codex":0.0019280647,"about_ca_topic_score_gemma":0.00097617594,"teacher_disagreement_score":0.0058084573,"about_ca_system_score_codex":0.0017132383,"about_ca_system_score_gemma":0.0009012926,"threshold_uncertainty_score":0.019431174},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035172277,0.008094512,0.21766241,0.0035399338,0.0017480045,0.000109805085,0.0012890102,0.0022806388,0.7617585],"genre_scores_gemma":[0.11663522,0.009917339,0.14974764,0.001614235,0.0019622487,0.00027871216,0.0049093827,0.0011825825,0.7137527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995028,0.00007369715,0.000018801098,0.0001887178,0.00014946298,0.000066519664],"domain_scores_gemma":[0.9996898,0.00009141328,0.00001293383,0.00010423459,0.0000719632,0.000029643405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035658648,0.0010770971,0.0007520947,0.0012200106,0.0016509938,0.0032433881,0.0011839551,0.001171453,0.10247627],"category_scores_gemma":[0.0015305206,0.00053258834,0.0007767336,0.001583823,0.0017191578,0.0069066505,0.0017601028,0.002280003,0.0475318],"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.00003136345,0.000020876627,0.000054059812,0.00018585463,0.000008805711,0.000027164919,0.00012473228,0.0009345243,0.0008466929,0.7638729,0.08934403,0.14454901],"study_design_scores_gemma":[0.0000070351284,0.000009257384,0.000094427385,0.00009122492,0.000007131993,0.00010729178,0.000048165082,0.0027087643,0.0009782467,0.63070107,0.3652364,0.000010956679],"about_ca_topic_score_codex":0.0010013493,"about_ca_topic_score_gemma":0.0014800294,"teacher_disagreement_score":0.10247627,"about_ca_system_score_codex":0.0013663865,"about_ca_system_score_gemma":0.00092268514,"threshold_uncertainty_score":0.34281725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005437345,0.015428476,0.014145744,0.014529313,0.0013942553,0.000015329351,0.00007482997,0.00006423404,0.94891053],"genre_scores_gemma":[0.66006243,0.01735039,0.007307653,0.0154951885,0.0028865894,0.00017083022,0.00019654469,0.0003707589,0.29615968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985519,0.00076632586,0.000039544382,0.00025176373,0.00025977867,0.00013078496],"domain_scores_gemma":[0.99823475,0.0012647216,0.00006051291,0.00016837924,0.00022194098,0.000049674654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018467077,0.00064336765,0.0004806508,0.0011482965,0.0034722926,0.005117678,0.00076155656,0.0015656399,0.011608491],"category_scores_gemma":[0.004548277,0.00030655242,0.00058590365,0.0008775431,0.017759243,0.010452901,0.0025904484,0.0036996242,0.0030491566],"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.0000055400255,0.0000019661043,0.000032691933,0.000021170013,0.0000013892037,0.000013907501,0.00061760884,0.00005255097,0.00004956142,0.9902068,0.005946713,0.0030500193],"study_design_scores_gemma":[0.0000039343367,0.000005548283,0.00007906065,0.000077420504,0.0000033190208,0.000073705705,0.00041022757,0.00023370028,0.00013570835,0.8488737,0.15009767,0.0000059719187],"about_ca_topic_score_codex":0.0021710384,"about_ca_topic_score_gemma":0.0018299111,"teacher_disagreement_score":0.011608491,"about_ca_system_score_codex":0.003666261,"about_ca_system_score_gemma":0.0011083425,"threshold_uncertainty_score":0.038834214},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00679733,0.0047335424,0.04003635,0.0042140502,0.00092599884,0.000014337569,0.00021851751,0.00028861398,0.9427714],"genre_scores_gemma":[0.423471,0.007745296,0.031796396,0.001925523,0.0021282854,0.00010299148,0.0008110806,0.00060667173,0.5314127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995388,0.00009254382,0.000022227341,0.000094007984,0.00019881118,0.00005358779],"domain_scores_gemma":[0.99945945,0.00022104383,0.000020886644,0.00015939998,0.00011106707,0.00002822386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039382422,0.0005339185,0.00047488595,0.00082245097,0.0012632061,0.003120026,0.0008705748,0.000858507,0.02988849],"category_scores_gemma":[0.0013092073,0.00041431378,0.00047296737,0.0014528455,0.0033155587,0.006756481,0.0016964136,0.0040722103,0.005486693],"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.000012046421,0.0000060821076,0.000020732015,0.0000377148,0.0000019080958,0.000013854428,0.00010704939,0.00019139679,0.00018544872,0.9706645,0.010967075,0.017792184],"study_design_scores_gemma":[0.0000051647985,0.000004159209,0.00006405846,0.000022669032,0.0000031810362,0.000055479126,0.00002901997,0.00059928204,0.00019547864,0.8851104,0.1139079,0.000003190302],"about_ca_topic_score_codex":0.00089729147,"about_ca_topic_score_gemma":0.0010718129,"teacher_disagreement_score":0.02988849,"about_ca_system_score_codex":0.0018237247,"about_ca_system_score_gemma":0.0006501739,"threshold_uncertainty_score":0.09998691},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056300405,0.0017753432,0.7483216,0.004093257,0.0012449884,0.00021878681,0.0007612654,0.0013598431,0.18592443],"genre_scores_gemma":[0.81027174,0.0008338509,0.14096867,0.002629358,0.0009214514,0.0006146643,0.0009339943,0.00092087773,0.04190545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9869888,0.0036430508,0.0009828046,0.0031896878,0.0038521022,0.0013436223],"domain_scores_gemma":[0.9855574,0.0065281875,0.0010682233,0.0041666124,0.0018031247,0.0008765255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005464315,0.0009927409,0.0013814843,0.0019730642,0.0027035908,0.0053757746,0.0025394342,0.00231531,0.013269854],"category_scores_gemma":[0.018794773,0.0007196955,0.0027257758,0.0013564916,0.011187833,0.012481657,0.0070580724,0.005612868,0.002867704],"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.000020369556,0.0000069973958,0.00018310918,0.000024208184,0.000007994661,0.00002634433,0.000090513444,0.0010578844,0.0002610672,0.99399924,0.00074202404,0.0035803015],"study_design_scores_gemma":[0.000023359682,0.000051244555,0.00019453902,0.00002950846,0.00001658253,0.00013525318,0.000068753456,0.0076847305,0.0010087818,0.96905243,0.021694727,0.000040018185],"about_ca_topic_score_codex":0.0014543877,"about_ca_topic_score_gemma":0.0009445907,"teacher_disagreement_score":0.013269854,"about_ca_system_score_codex":0.003801846,"about_ca_system_score_gemma":0.0016939185,"threshold_uncertainty_score":0.04439205},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001172407,0.030439233,0.018928979,0.010156767,0.0055294135,0.000039258037,0.00038385307,0.00044907496,0.932901],"genre_scores_gemma":[0.027068138,0.016856438,0.0053359703,0.00243549,0.007927397,0.00011856648,0.00060815696,0.00060883013,0.93904096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991352,0.00018628918,0.00002903506,0.00020950328,0.00037105184,0.00006891221],"domain_scores_gemma":[0.9989975,0.00044855333,0.000031887816,0.0002125377,0.00020897159,0.000100516896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008227305,0.0012743755,0.001237074,0.0019809052,0.0012007047,0.004603885,0.000939353,0.0012418902,0.1431817],"category_scores_gemma":[0.0036408666,0.00047043813,0.00082097546,0.002293494,0.0027234228,0.005553192,0.0023730292,0.0036219778,0.0447462],"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.000017899125,0.000016587996,0.00008919435,0.00023035677,0.0000132943105,0.0000231734,0.0001133693,0.00091351,0.00032217277,0.5735615,0.34004375,0.084655195],"study_design_scores_gemma":[0.000008947396,0.000011017499,0.0001907585,0.00016624975,0.000007254119,0.00005334815,0.00004137984,0.0008798803,0.00016693356,0.28559336,0.71287173,0.000009177248],"about_ca_topic_score_codex":0.00097399415,"about_ca_topic_score_gemma":0.0014385236,"teacher_disagreement_score":0.1431817,"about_ca_system_score_codex":0.0031740405,"about_ca_system_score_gemma":0.0012250247,"threshold_uncertainty_score":0.4789905},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004029072,0.13809901,0.027923288,0.03749376,0.22486465,0.0008396166,0.01281382,0.0020632958,0.55187345],"genre_scores_gemma":[0.012315434,0.072111376,0.011933432,0.0043867202,0.08786426,0.0006986377,0.014127527,0.0018662896,0.7946963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99665064,0.00047908572,0.00028756316,0.00043556796,0.0019747892,0.00017245884],"domain_scores_gemma":[0.98574847,0.0018583925,0.00057514565,0.0010041983,0.007889947,0.0029238542],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032608854,0.0017195998,0.0016869177,0.006480153,0.002008229,0.006665347,0.001212328,0.0012101491,0.30960426],"category_scores_gemma":[0.014147046,0.00059391785,0.0018645561,0.0062246597,0.00079613493,0.0036430832,0.002633774,0.0037615912,0.18504319],"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.00005266629,0.000041063286,0.00012029594,0.0005599082,0.000024077828,0.000037303955,0.000103709004,0.00015970551,0.0007038056,0.0068508815,0.9123044,0.07904212],"study_design_scores_gemma":[0.000013496895,0.00003080644,0.00045751076,0.00028240733,0.000017718949,0.00009274976,0.000080727455,0.0002224686,0.00028527036,0.005833624,0.9926704,0.000012908733],"about_ca_topic_score_codex":0.00076539145,"about_ca_topic_score_gemma":0.0011749689,"teacher_disagreement_score":0.30960426,"about_ca_system_score_codex":0.0028221325,"about_ca_system_score_gemma":0.0033907616,"threshold_uncertainty_score":0.9847657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005388455,0.014700588,0.007990376,0.005709718,0.0072786235,0.000098108554,0.0014182412,0.00080329366,0.96146226],"genre_scores_gemma":[0.0031169488,0.0077408245,0.00313434,0.002273478,0.0021651122,0.00006600043,0.0013683193,0.00047933683,0.97965574],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916327,0.00008993484,0.000035961122,0.0002103757,0.00042762252,0.00007290317],"domain_scores_gemma":[0.99912316,0.00022319687,0.000044039436,0.00013616831,0.0003414217,0.00013198942],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00050308974,0.0010379727,0.00087637245,0.0016804705,0.0015257006,0.0057047466,0.001743895,0.0020419455,0.34456104],"category_scores_gemma":[0.0027207783,0.00044498823,0.00068911846,0.0022575895,0.0012044442,0.005942348,0.0022870763,0.0029683472,0.21123631],"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.000027171729,0.000033824213,0.00012680361,0.00024690843,0.0000050861527,0.00006569971,0.00028452126,0.000258348,0.00039598535,0.08403031,0.7780205,0.13650481],"study_design_scores_gemma":[9.96236e-7,0.0000044590242,0.00005914505,0.000071799856,9.3361905e-7,0.000060901533,0.00003500718,0.000038315433,0.000038253587,0.0067303106,0.99295723,0.0000026022904],"about_ca_topic_score_codex":0.0015337017,"about_ca_topic_score_gemma":0.0023880554,"teacher_disagreement_score":0.65543896,"about_ca_system_score_codex":0.0017284992,"about_ca_system_score_gemma":0.0012571077,"threshold_uncertainty_score":0.9349041},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004786514,0.012077438,0.29419327,0.006051604,0.0020778084,0.000060382004,0.00031737602,0.0004990967,0.67993647],"genre_scores_gemma":[0.35351464,0.018289844,0.23826505,0.0050448105,0.005873998,0.0007048364,0.0011626929,0.0021511368,0.37499294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841106,0.0005535545,0.000074366886,0.0003829737,0.0004579455,0.00011996342],"domain_scores_gemma":[0.99839056,0.0008361999,0.000065347536,0.00049706834,0.00014984541,0.00006097732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015363415,0.001204887,0.0014301431,0.0026112152,0.0021909217,0.0035044276,0.0017532569,0.001888582,0.03126444],"category_scores_gemma":[0.006093737,0.00086683757,0.0016165044,0.0023267583,0.008457779,0.011241264,0.0038531208,0.0076724207,0.007811213],"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.0000070121073,0.0000050633535,0.00001500245,0.000027939077,0.0000035351409,0.000011569137,0.00004290241,0.00013454069,0.000058347214,0.9855504,0.0042835935,0.009860213],"study_design_scores_gemma":[0.000004028642,0.0000027649874,0.000019593135,0.00001885111,0.0000032749253,0.00003152682,0.00001050088,0.00054206856,0.00013669027,0.97415936,0.025067199,0.0000042186725],"about_ca_topic_score_codex":0.00055554695,"about_ca_topic_score_gemma":0.0004303747,"teacher_disagreement_score":0.03126444,"about_ca_system_score_codex":0.00141151,"about_ca_system_score_gemma":0.0010061729,"threshold_uncertainty_score":0.10459},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008423401,0.013059277,0.80862075,0.023048522,0.0010899941,0.00012514644,0.00025003654,0.0003947761,0.14498815],"genre_scores_gemma":[0.41467804,0.018390574,0.48082492,0.0074320594,0.002783013,0.0013820208,0.0009373649,0.00075251824,0.07281953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980281,0.00082350266,0.0001086453,0.0002882986,0.0006411586,0.00011029602],"domain_scores_gemma":[0.9977639,0.0011501047,0.00014535995,0.0005765371,0.00022933041,0.00013481588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160162,0.00081239955,0.0009061046,0.0012379758,0.0013978613,0.005873733,0.0021068607,0.0029014302,0.0073427567],"category_scores_gemma":[0.0060217604,0.00079845753,0.0014389922,0.0014087624,0.0074886354,0.015442796,0.0044480693,0.0069492,0.0020146922],"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.0000025986662,0.0000039913934,0.000024171157,0.0000389322,0.0000024386823,0.000015162348,0.00014705393,0.00085824647,0.00009149814,0.9954952,0.00107016,0.0022504327],"study_design_scores_gemma":[0.000002126064,0.0000056012136,0.000022355209,0.000054491455,0.0000018813694,0.0000345626,0.000059853268,0.0040413598,0.00011906966,0.9689774,0.026676912,0.000004471289],"about_ca_topic_score_codex":0.00168501,"about_ca_topic_score_gemma":0.0011597362,"teacher_disagreement_score":0.0073427567,"about_ca_system_score_codex":0.003259489,"about_ca_system_score_gemma":0.0015553323,"threshold_uncertainty_score":0.024563968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06959398,0.022654584,0.44813433,0.006566656,0.0033644272,0.00017144975,0.0018793689,0.001078197,0.4465569],"genre_scores_gemma":[0.5275428,0.01756876,0.19800077,0.0018827812,0.0040329373,0.000579763,0.0066819238,0.00064847973,0.24306172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989287,0.0001563594,0.000108382,0.00031799814,0.00034428394,0.00014422814],"domain_scores_gemma":[0.9985024,0.000600124,0.0001652383,0.00024637204,0.00029926983,0.00018673201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008338995,0.0011271235,0.0011492004,0.003139014,0.0016803625,0.005081047,0.0016621025,0.0018313759,0.01358792],"category_scores_gemma":[0.003243248,0.00059262576,0.0014663348,0.003007025,0.0041206074,0.0076926257,0.0019576382,0.0038422903,0.0043644705],"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.000017512399,0.000008247867,0.00020630447,0.00006188166,0.0000056553654,0.000016431855,0.00011631451,0.00039720215,0.00019527413,0.96292317,0.005260496,0.030791525],"study_design_scores_gemma":[0.0000036605009,0.00000989803,0.00019723848,0.00005256616,0.0000049759506,0.0000620038,0.000046719128,0.0023414788,0.00016566734,0.9718355,0.025271777,0.0000085615875],"about_ca_topic_score_codex":0.0016386143,"about_ca_topic_score_gemma":0.00094064086,"teacher_disagreement_score":0.01358792,"about_ca_system_score_codex":0.0022003842,"about_ca_system_score_gemma":0.0011487434,"threshold_uncertainty_score":0.04545611},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005311576,0.1633348,0.03294399,0.043783497,0.28393748,0.0009737797,0.012201482,0.0021119458,0.45540142],"genre_scores_gemma":[0.016092725,0.08306249,0.013219877,0.0050923396,0.11566002,0.00087568467,0.014006981,0.0021333299,0.74985665],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99612623,0.0005323508,0.00029809593,0.0004663569,0.0023698187,0.00020714612],"domain_scores_gemma":[0.9827172,0.0022541303,0.0006369264,0.0010962086,0.009540225,0.0037552253],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0034711952,0.0018278603,0.0019781515,0.0069584134,0.0021641375,0.0064160167,0.0012640993,0.00125161,0.26926],"category_scores_gemma":[0.016344981,0.00057531754,0.0021127185,0.0069339024,0.0008920519,0.0037541208,0.0029155628,0.0041138562,0.14892294],"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.000063324806,0.00005376064,0.00015881851,0.0006748927,0.000031307653,0.000045237422,0.00013168111,0.00021172884,0.0008855106,0.007649338,0.900507,0.08958745],"study_design_scores_gemma":[0.000018319948,0.00004738908,0.0006788965,0.0003545009,0.000024455418,0.00012748098,0.00010723208,0.00030325438,0.00040920664,0.0077406527,0.9901698,0.000018784876],"about_ca_topic_score_codex":0.0007875286,"about_ca_topic_score_gemma":0.0012807711,"teacher_disagreement_score":0.9930416,"about_ca_system_score_codex":0.0030980292,"about_ca_system_score_gemma":0.0038515453,"threshold_uncertainty_score":0.9007644},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21224084,0.007179374,0.10290975,0.14087172,0.0027455173,0.0000713681,0.00030810985,0.00047561427,0.53319776],"genre_scores_gemma":[0.96796316,0.0012900316,0.0061608176,0.0041163894,0.00050620816,0.000039315288,0.000097232616,0.00006783776,0.019758971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959785,0.00012425373,0.0000107384185,0.000081381804,0.000108163214,0.000077581484],"domain_scores_gemma":[0.99913955,0.00022345313,0.00007840159,0.00018410261,0.00021828247,0.00015617331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010436857,0.00012852029,0.00021610165,0.00033256307,0.00085936644,0.0031007754,0.00038543312,0.0012996237,0.0061061108],"category_scores_gemma":[0.0040905923,0.00013370019,0.00023365347,0.00021022678,0.004548203,0.004994032,0.0012315548,0.0019872806,0.0014168904],"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.00003098382,0.000020876914,0.00064922054,0.000034505734,0.000011041144,0.000059692582,0.0004252553,0.00037955132,0.001162442,0.97449255,0.005398745,0.01733511],"study_design_scores_gemma":[0.000007884102,0.00001753982,0.0009292782,0.000018991312,0.000005474925,0.00008824502,0.00030417004,0.0012150649,0.0006808715,0.9646775,0.032045662,0.000009346955],"about_ca_topic_score_codex":0.0006165477,"about_ca_topic_score_gemma":0.00042918455,"teacher_disagreement_score":0.0061061108,"about_ca_system_score_codex":0.0010652945,"about_ca_system_score_gemma":0.00087713683,"threshold_uncertainty_score":0.020426989},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10570179,0.0044196914,0.8509687,0.0027529513,0.00032258505,0.00015684265,0.00062521506,0.0014562029,0.033595968],"genre_scores_gemma":[0.73194265,0.0015003347,0.25480765,0.0006975607,0.0003592427,0.00033771456,0.00090412877,0.00066552503,0.008785275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665415,0.0013122509,0.000106516214,0.00060914154,0.00092096033,0.0003968431],"domain_scores_gemma":[0.9926743,0.0052769645,0.00047170097,0.00087812,0.0005056256,0.0001932579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034295372,0.0013402387,0.0014477699,0.0010510966,0.00064992334,0.0029178148,0.0019501314,0.0012367106,0.006717925],"category_scores_gemma":[0.016830793,0.00049129274,0.00093833817,0.0017639439,0.0017638374,0.0045503345,0.0015868812,0.002376391,0.00083415624],"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.00079660723,0.00013918222,0.001350134,0.00042092643,0.00012616573,0.00014062125,0.00013780464,0.526043,0.003000159,0.34536597,0.012588325,0.10989106],"study_design_scores_gemma":[0.000053589116,0.00010031213,0.0003199124,0.00004219351,0.000027337252,0.0001061358,0.000035490608,0.7696439,0.0017989188,0.2241038,0.0037524991,0.00001596261],"about_ca_topic_score_codex":0.0014531964,"about_ca_topic_score_gemma":0.0010527631,"teacher_disagreement_score":0.006717925,"about_ca_system_score_codex":0.0028643326,"about_ca_system_score_gemma":0.0014240023,"threshold_uncertainty_score":0.022473693},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064388267,0.01006512,0.09590897,0.0054377,0.0007810635,0.000042780306,0.00064881856,0.00057567086,0.880101],"genre_scores_gemma":[0.24877301,0.019082159,0.08630387,0.0024026474,0.0027675102,0.00030264084,0.0038630632,0.0012998178,0.6352052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993407,0.00012113293,0.000027608034,0.0001290542,0.00032238898,0.000059101887],"domain_scores_gemma":[0.9992267,0.00040333398,0.000026341142,0.00018004612,0.00012071239,0.000042914846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106783,0.00070379436,0.0006513678,0.0016948534,0.0013531748,0.0048593148,0.0009105929,0.00091475097,0.043652907],"category_scores_gemma":[0.0029441337,0.00039732162,0.0006176143,0.003539524,0.0023878794,0.0079191355,0.002226926,0.0037208386,0.010113399],"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.000008050645,0.000011723778,0.00006526009,0.00006350422,0.0000052976466,0.000012184906,0.00008776246,0.0005912994,0.0001483534,0.93425524,0.026013583,0.03873775],"study_design_scores_gemma":[0.0000026841315,0.000002995016,0.00008970391,0.000034227276,0.0000036643073,0.00003919883,0.00003168653,0.0012713587,0.00017717642,0.8900398,0.108303204,0.000004404085],"about_ca_topic_score_codex":0.0012090435,"about_ca_topic_score_gemma":0.0015600102,"teacher_disagreement_score":0.043652907,"about_ca_system_score_codex":0.0029060373,"about_ca_system_score_gemma":0.0012507079,"threshold_uncertainty_score":0.14603359},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083090406,0.01058409,0.014181438,0.0034457543,0.0008060444,0.000031416566,0.00011598414,0.00014746467,0.96985686],"genre_scores_gemma":[0.04821388,0.012461266,0.0080789095,0.0015860546,0.0009984026,0.000099334524,0.0003232057,0.0001822065,0.9280568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968934,0.0000830048,0.000008406173,0.00007415058,0.00011530166,0.00002974239],"domain_scores_gemma":[0.99978393,0.00007969945,0.000007806469,0.00006075468,0.000045045475,0.000022786307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003028322,0.00069507543,0.0003551216,0.0008902522,0.0010668697,0.003814503,0.00078810885,0.0010430311,0.07054602],"category_scores_gemma":[0.001097571,0.0002348309,0.0002514053,0.0008363954,0.0038629288,0.0036396526,0.0014774316,0.001464704,0.019081619],"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.000007877168,0.000012187373,0.00005804907,0.00013433697,0.000004866339,0.000020651145,0.00036020088,0.0003300132,0.00025061547,0.7949668,0.10575004,0.09810431],"study_design_scores_gemma":[0.0000025057195,0.000004313295,0.00009392776,0.00010836629,0.0000020331684,0.000045243374,0.00011569972,0.00026646603,0.00017978327,0.28106564,0.71811247,0.0000035609514],"about_ca_topic_score_codex":0.0020258364,"about_ca_topic_score_gemma":0.0028232425,"teacher_disagreement_score":0.07054602,"about_ca_system_score_codex":0.0019047091,"about_ca_system_score_gemma":0.0014635252,"threshold_uncertainty_score":0.236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007753113,0.020398576,0.008765046,0.07713736,0.0024626104,0.000009990358,0.00021737818,0.00017961487,0.88307637],"genre_scores_gemma":[0.55917424,0.020849012,0.0068083913,0.033124004,0.007956249,0.00011838834,0.00045302202,0.00075030816,0.37076643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938583,0.00018323932,0.000015194601,0.00013058085,0.00020526293,0.00007986314],"domain_scores_gemma":[0.9988663,0.00056970754,0.000043877175,0.00029632336,0.00013391874,0.00008992766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009969244,0.00035043745,0.00055615406,0.00096674456,0.0020394684,0.0044602146,0.000657025,0.0023162432,0.032808658],"category_scores_gemma":[0.005408385,0.00028603288,0.00023476753,0.0008165108,0.00866562,0.01231827,0.0021671474,0.0040706904,0.00710845],"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.0000057741904,0.0000025165211,0.000017001305,0.000012484056,9.581936e-7,0.000008727826,0.00009358517,0.000037275873,0.000033432145,0.9722201,0.021275047,0.0062930314],"study_design_scores_gemma":[0.0000032227483,0.0000010802681,0.000040858988,0.00001913131,7.119887e-7,0.000020973395,0.000054035903,0.000094730654,0.000033210992,0.93279713,0.06693276,0.0000021470835],"about_ca_topic_score_codex":0.0013717676,"about_ca_topic_score_gemma":0.001370221,"teacher_disagreement_score":0.032808658,"about_ca_system_score_codex":0.0017627556,"about_ca_system_score_gemma":0.0009082175,"threshold_uncertainty_score":0.10975593},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5628402,0.00038218126,0.39206767,0.0008806618,0.000098617544,0.000108081535,0.00020351764,0.0007280181,0.042691067],"genre_scores_gemma":[0.98254895,0.000106986656,0.014604096,0.0000755718,0.000036394755,0.000056109067,0.0000744747,0.000049774582,0.0024475446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986193,0.0002918369,0.00008157801,0.00030678572,0.000477677,0.00022279091],"domain_scores_gemma":[0.99438936,0.0034443818,0.00047554795,0.00084738893,0.0005698739,0.00027345587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014447015,0.00037905504,0.0005786276,0.0016836909,0.00096023444,0.00269244,0.0008749674,0.0012249751,0.0038134851],"category_scores_gemma":[0.013428653,0.0002661897,0.0008120775,0.0009314252,0.00429078,0.0047438284,0.002292737,0.0020843947,0.00032441886],"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.000028285269,0.00001435184,0.00042256791,0.000023429931,0.0000043560885,0.0001073275,0.00015897989,0.009645709,0.0012604274,0.98258483,0.00021574325,0.0055339662],"study_design_scores_gemma":[0.000009250132,0.000032026266,0.0002225431,0.00002138147,0.0000057424154,0.00014215143,0.00004953414,0.0881672,0.0024118598,0.9076158,0.0013106592,0.000011858074],"about_ca_topic_score_codex":0.00069313723,"about_ca_topic_score_gemma":0.00040718418,"teacher_disagreement_score":0.0038134851,"about_ca_system_score_codex":0.0018117883,"about_ca_system_score_gemma":0.00073763274,"threshold_uncertainty_score":0.013145506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004213651,0.01205792,0.22880243,0.006339115,0.003847305,0.00008531565,0.0004968032,0.00075225317,0.7434052],"genre_scores_gemma":[0.18666378,0.011082741,0.1152197,0.0039004385,0.002360568,0.0002845407,0.0006246796,0.000940855,0.67892265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948406,0.00009655122,0.00003353002,0.0001426544,0.00017682962,0.00006638355],"domain_scores_gemma":[0.9995571,0.00018632482,0.00001930985,0.000092217604,0.0001228924,0.00002226717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094049174,0.0007983639,0.0006890935,0.0015302692,0.0018193698,0.0035059233,0.0012096,0.0011352273,0.017762087],"category_scores_gemma":[0.0022184353,0.00062629924,0.001022453,0.0017495936,0.0038524803,0.008438801,0.0019770504,0.0040757875,0.0050962362],"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.0000075875155,0.0000038343524,0.0000273245,0.000056212986,0.000003969514,0.000010626618,0.00013604977,0.00014527988,0.00018174974,0.971873,0.010668744,0.016885517],"study_design_scores_gemma":[0.0000049170612,0.0000054635293,0.000063792,0.00006335112,0.000009239375,0.00005142469,0.000050000486,0.0005498208,0.00052868313,0.8412985,0.1573631,0.000011694666],"about_ca_topic_score_codex":0.0025911606,"about_ca_topic_score_gemma":0.0023887064,"teacher_disagreement_score":0.017762087,"about_ca_system_score_codex":0.0030889018,"about_ca_system_score_gemma":0.0015340713,"threshold_uncertainty_score":0.05942011},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013280012,0.06209407,0.06716586,0.00782993,0.00226985,0.000029771314,0.00012617666,0.00023233856,0.846972],"genre_scores_gemma":[0.46420065,0.04193021,0.040178843,0.0018827235,0.0042224224,0.00018538862,0.00033142013,0.00029282976,0.44677547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998161,0.000056419554,0.0000066322164,0.0000335821,0.00006928099,0.000017986536],"domain_scores_gemma":[0.99963546,0.00023124373,0.000015440562,0.00006775511,0.000034767087,0.000015290741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023654164,0.00041149312,0.0003880197,0.0007743506,0.00086587336,0.0022610119,0.0005896158,0.0006557182,0.011456888],"category_scores_gemma":[0.0010235232,0.00021454482,0.0003082117,0.0010919742,0.0037731417,0.0040328265,0.0009485342,0.0019271022,0.0016855963],"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.0000036961633,0.0000033088431,0.0000194916,0.000041975447,0.0000013642523,0.000009806779,0.000061218125,0.0002456329,0.000103474355,0.98439676,0.005036444,0.010076737],"study_design_scores_gemma":[0.0000015265153,0.000001738716,0.000045988643,0.00002061191,0.0000010616726,0.00003177412,0.000016413182,0.00062081486,0.00006461301,0.9576508,0.041542906,0.0000018356833],"about_ca_topic_score_codex":0.00073162635,"about_ca_topic_score_gemma":0.0010917312,"teacher_disagreement_score":0.011456888,"about_ca_system_score_codex":0.0013725889,"about_ca_system_score_gemma":0.000499481,"threshold_uncertainty_score":0.038327098},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013307555,0.0038341624,0.09010021,0.0032565289,0.0010637807,0.000034803732,0.00029483976,0.00036060225,0.88774765],"genre_scores_gemma":[0.3060014,0.007667589,0.039435074,0.0020731327,0.0019051923,0.0002775751,0.00068291,0.0005408206,0.64141625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996147,0.00006272704,0.00001733819,0.000117206975,0.00013531183,0.000052716136],"domain_scores_gemma":[0.99972016,0.000080188765,0.00002082452,0.000054401225,0.00008717641,0.0000373165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005396843,0.0010210337,0.0006898824,0.0021679385,0.0013499903,0.003334713,0.00061793166,0.00093509664,0.021762772],"category_scores_gemma":[0.0011769482,0.00036389765,0.00061723916,0.0015354458,0.0031710365,0.0053638224,0.0021179426,0.0034848333,0.0056051044],"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.0000032526905,0.0000021845008,0.000017234423,0.000014232825,0.0000020987413,0.0000058069263,0.000043077773,0.00007137824,0.000118366035,0.98650616,0.0044498844,0.0087662535],"study_design_scores_gemma":[0.0000042134216,0.0000059642857,0.00008286228,0.000017777309,0.0000054956895,0.000058860955,0.00003970001,0.00049429986,0.0002568309,0.9353715,0.06365683,0.0000057564894],"about_ca_topic_score_codex":0.0005034935,"about_ca_topic_score_gemma":0.0004731089,"teacher_disagreement_score":0.021762772,"about_ca_system_score_codex":0.0016324671,"about_ca_system_score_gemma":0.00057835324,"threshold_uncertainty_score":0.072803676},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021099467,0.010092583,0.0018543332,0.26914006,0.4824163,0.00026991364,0.0025897566,0.00095244206,0.23247363],"genre_scores_gemma":[0.0022144727,0.006961533,0.0009252506,0.09486467,0.08909194,0.00018445555,0.001846563,0.00063859706,0.80327255],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976363,0.00021775294,0.0001588151,0.0002888284,0.0014668294,0.0002315032],"domain_scores_gemma":[0.9828488,0.0021513542,0.00049581646,0.00073409954,0.0110094,0.002760483],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002273522,0.00094578665,0.0010765063,0.0020070625,0.002896194,0.0066160574,0.0016433009,0.005620375,0.3944334],"category_scores_gemma":[0.019996835,0.00040517384,0.00065831526,0.0015164814,0.0012663202,0.004257206,0.0022650708,0.0077838944,0.41471213],"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.0000055552905,0.0000027571298,0.000010631694,0.000030289217,5.8072686e-7,0.0000109269895,0.000009928086,0.0000065730374,0.000030055398,0.0009889861,0.9907568,0.00814696],"study_design_scores_gemma":[0.0000021182384,0.000004229539,0.000055669327,0.00007281771,9.2166334e-7,0.000033004635,0.00002650475,0.0000098745995,0.00002947415,0.00089948537,0.9988624,0.0000033802125],"about_ca_topic_score_codex":0.010877951,"about_ca_topic_score_gemma":0.011869351,"teacher_disagreement_score":0.6055666,"about_ca_system_score_codex":0.0027948802,"about_ca_system_score_gemma":0.00603747,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045796186,0.04641065,0.48534086,0.009442798,0.0018706772,0.00017199096,0.0009425483,0.00071899453,0.4505219],"genre_scores_gemma":[0.35015342,0.076408386,0.36023048,0.010859575,0.00793164,0.0011506763,0.002980916,0.0009663024,0.18931857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983695,0.00055298145,0.00013648902,0.00031575133,0.00049975864,0.000125511],"domain_scores_gemma":[0.9988601,0.00059085834,0.00006071846,0.00019557493,0.00023484866,0.000057925634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020089287,0.0010880486,0.000988611,0.0023796798,0.0021776792,0.004770821,0.0013864671,0.00148807,0.017957294],"category_scores_gemma":[0.0023144896,0.00043504464,0.001432858,0.00316651,0.0063626,0.01102151,0.0027496822,0.0042810147,0.006299214],"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.0000016893111,0.0000028957525,0.000018432196,0.00004090641,0.0000030370472,0.000020952572,0.000098388286,0.00040230143,0.000057159916,0.9914929,0.0032306216,0.004630806],"study_design_scores_gemma":[0.0000026567407,0.000005094736,0.00003105922,0.00003704183,0.0000023359219,0.00004899142,0.000034195135,0.0011792899,0.00006242366,0.93091303,0.06767903,0.0000049316486],"about_ca_topic_score_codex":0.0027868461,"about_ca_topic_score_gemma":0.0016769782,"teacher_disagreement_score":0.017957294,"about_ca_system_score_codex":0.0027611048,"about_ca_system_score_gemma":0.001498996,"threshold_uncertainty_score":0.060073137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006110405,0.007296242,0.009738807,0.007092938,0.01047842,0.00019023159,0.0043081404,0.0016135147,0.9586707],"genre_scores_gemma":[0.0025859156,0.004676323,0.0043834005,0.0021893273,0.002077164,0.0001082079,0.0035415827,0.00048802485,0.97994995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991486,0.000084097905,0.000046613666,0.00018214343,0.00045340083,0.00008515254],"domain_scores_gemma":[0.9990458,0.00016463027,0.0000429422,0.00014047184,0.00044512874,0.00016091097],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006608564,0.00092395005,0.00065482175,0.0014132014,0.0013778696,0.0049941153,0.0018674566,0.0021019923,0.54345214],"category_scores_gemma":[0.0029922556,0.00037205892,0.000588608,0.0016473996,0.00063101423,0.004494508,0.002654656,0.0018936782,0.40687937],"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.000021808055,0.00004252823,0.00017121446,0.00018706874,0.0000034755233,0.00006363169,0.00023257622,0.00015754899,0.00037817453,0.048733685,0.73874426,0.21126404],"study_design_scores_gemma":[0.0000010233342,0.0000039720435,0.00007120456,0.00006198306,7.76751e-7,0.000031505842,0.000034750217,0.000020325353,0.000044410404,0.002603836,0.9971239,0.0000022916297],"about_ca_topic_score_codex":0.0024607058,"about_ca_topic_score_gemma":0.0033824698,"teacher_disagreement_score":0.54345214,"about_ca_system_score_codex":0.0013984771,"about_ca_system_score_gemma":0.001700504,"threshold_uncertainty_score":0.65121007},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029143565,0.014132161,0.20187142,0.0051671136,0.0016621909,0.00012406507,0.0008567849,0.0016467245,0.7716252],"genre_scores_gemma":[0.12917045,0.015139744,0.10148684,0.0025035597,0.003564179,0.000302184,0.0026594438,0.0016392,0.7435344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986847,0.00026462163,0.000062409,0.00035995198,0.00054319674,0.000085059444],"domain_scores_gemma":[0.9989256,0.00043261002,0.00003932578,0.00030937724,0.0002358413,0.00005715045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010190688,0.0010617413,0.0008132678,0.0026556323,0.0012184944,0.0047800266,0.0012259562,0.0014943733,0.060498767],"category_scores_gemma":[0.0063720965,0.0005014259,0.00073097344,0.0026790677,0.0019838363,0.008297003,0.0019805762,0.0030830135,0.035010397],"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.000019871302,0.000020039326,0.000055645418,0.00019200095,0.000009011842,0.000023473029,0.00009047299,0.0005492639,0.0006517902,0.74939406,0.06784113,0.18115318],"study_design_scores_gemma":[0.0000066950074,0.000010400807,0.00012100011,0.00009045668,0.000011440189,0.00017482368,0.000031866985,0.0019199162,0.00091375486,0.65028685,0.34641847,0.00001440194],"about_ca_topic_score_codex":0.00065555633,"about_ca_topic_score_gemma":0.00073972344,"teacher_disagreement_score":0.060498767,"about_ca_system_score_codex":0.0018559679,"about_ca_system_score_gemma":0.0010370238,"threshold_uncertainty_score":0.20238858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010884216,0.3718808,0.0053535677,0.027818559,0.016936375,0.000052737105,0.0006858506,0.00040650633,0.57577723],"genre_scores_gemma":[0.027132135,0.17169404,0.0063783904,0.008042023,0.0067966054,0.000114739705,0.000606872,0.00047064526,0.77876455],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992932,0.00014737964,0.00003569401,0.00019943334,0.0002528579,0.00007131389],"domain_scores_gemma":[0.99955755,0.00017931889,0.00003860287,0.0000540744,0.000108633765,0.000061746076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006433884,0.0012218562,0.0006251822,0.0017953303,0.002051702,0.0039851307,0.0006595662,0.0018151754,0.034446348],"category_scores_gemma":[0.002352202,0.00056395587,0.00036722477,0.0020322294,0.0025103828,0.0075362655,0.0016218834,0.004059615,0.027180547],"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.000032292333,0.0000145267,0.00011017673,0.0002707823,0.000008309041,0.00010262483,0.00076418056,0.00023305514,0.00026208142,0.27546772,0.5966164,0.1261178],"study_design_scores_gemma":[9.452933e-7,0.0000027687486,0.00005594581,0.00010697081,0.0000010347024,0.00006810595,0.000036304125,0.000016417478,0.0000514461,0.014591117,0.9850659,0.0000031860443],"about_ca_topic_score_codex":0.0020160587,"about_ca_topic_score_gemma":0.0030444406,"teacher_disagreement_score":0.034446348,"about_ca_system_score_codex":0.0029870053,"about_ca_system_score_gemma":0.0018149363,"threshold_uncertainty_score":0.115234554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10570179,0.0044196914,0.8509687,0.0027529513,0.00032258505,0.00015684265,0.00062521506,0.0014562029,0.033595968],"genre_scores_gemma":[0.73194265,0.0015003347,0.25480765,0.0006975607,0.0003592427,0.00033771456,0.00090412877,0.00066552503,0.008785275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665415,0.0013122509,0.000106516214,0.00060914154,0.00092096033,0.0003968431],"domain_scores_gemma":[0.9926743,0.0052769645,0.00047170097,0.00087812,0.0005056256,0.0001932579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034295372,0.0013402387,0.0014477699,0.0010510966,0.00064992334,0.0029178148,0.0019501314,0.0012367106,0.006717925],"category_scores_gemma":[0.016830793,0.00049129274,0.00093833817,0.0017639439,0.0017638374,0.0045503345,0.0015868812,0.002376391,0.00083415624],"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.00079660723,0.00013918222,0.001350134,0.00042092643,0.00012616573,0.00014062125,0.00013780464,0.526043,0.003000159,0.34536597,0.012588325,0.10989106],"study_design_scores_gemma":[0.000053589116,0.00010031213,0.0003199124,0.00004219351,0.000027337252,0.0001061358,0.000035490608,0.7696439,0.0017989188,0.2241038,0.0037524991,0.00001596261],"about_ca_topic_score_codex":0.0014531964,"about_ca_topic_score_gemma":0.0010527631,"teacher_disagreement_score":0.006717925,"about_ca_system_score_codex":0.0028643326,"about_ca_system_score_gemma":0.0014240023,"threshold_uncertainty_score":0.022473693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048922807,0.0011291131,0.90649354,0.0056557506,0.00006633654,0.000074164134,0.00022306528,0.00038268339,0.03705257],"genre_scores_gemma":[0.8430818,0.00064074376,0.15144004,0.00053765037,0.00010942412,0.00008271124,0.0002454894,0.00010246646,0.00375969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998326,0.00070601475,0.000092087335,0.00036504358,0.0004066656,0.00010410549],"domain_scores_gemma":[0.990802,0.006865195,0.00049389416,0.0012651808,0.00038596895,0.00018767038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027865442,0.0004067518,0.00051020517,0.0014890096,0.0008347562,0.0036434378,0.0018024053,0.0018554361,0.0059308526],"category_scores_gemma":[0.012503122,0.00056311314,0.0014976049,0.0009388958,0.010256905,0.010841027,0.0033504507,0.0037469724,0.0005450815],"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.000015589985,0.000009869279,0.00030926766,0.000055469052,0.000012263111,0.00004936268,0.0002642107,0.0049130768,0.00030005712,0.98831314,0.00026912725,0.0054886276],"study_design_scores_gemma":[0.0000036127312,0.000004194304,0.00009099602,0.0000114340755,0.000003821464,0.000021401876,0.000029076891,0.013012297,0.00020132189,0.9858338,0.00078515214,0.0000028379918],"about_ca_topic_score_codex":0.0007966627,"about_ca_topic_score_gemma":0.0005933877,"teacher_disagreement_score":0.0059308526,"about_ca_system_score_codex":0.0019643435,"about_ca_system_score_gemma":0.00070632045,"threshold_uncertainty_score":0.019840658},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048274323,0.020529011,0.83069336,0.0065745995,0.0006831122,0.00012746925,0.00017384939,0.0003350092,0.13605611],"genre_scores_gemma":[0.37213552,0.033987995,0.51971304,0.0032653024,0.0018905728,0.0010058194,0.00063431606,0.00017028936,0.067197144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992442,0.00021127121,0.000047896494,0.00017945393,0.0002677732,0.000049452625],"domain_scores_gemma":[0.9995641,0.00023561672,0.000027795933,0.000087502296,0.000061000224,0.0000240236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007386671,0.0005838658,0.00062824157,0.0009847671,0.0005762618,0.0038573951,0.0016472766,0.0015570305,0.004955083],"category_scores_gemma":[0.0016189559,0.00022708536,0.0007800533,0.0020246655,0.0034879742,0.004799463,0.0016483599,0.00254743,0.0013725746],"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.0000069416,0.0000070132387,0.00004370689,0.00010238959,0.0000123446125,0.000051283852,0.00014620197,0.0036204546,0.0004661028,0.96531016,0.0028834888,0.027349856],"study_design_scores_gemma":[0.0000065185086,0.000011589907,0.000059414706,0.00004590004,0.000009341198,0.00010636436,0.000061929575,0.021344347,0.00032792226,0.94007957,0.03793912,0.000008172892],"about_ca_topic_score_codex":0.0013058747,"about_ca_topic_score_gemma":0.0009976788,"teacher_disagreement_score":0.004955083,"about_ca_system_score_codex":0.0015790518,"about_ca_system_score_gemma":0.0008942113,"threshold_uncertainty_score":0.01657641},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048274323,0.020529011,0.83069336,0.0065745995,0.0006831122,0.00012746925,0.00017384939,0.0003350092,0.13605611],"genre_scores_gemma":[0.37213552,0.033987995,0.51971304,0.0032653024,0.0018905728,0.0010058194,0.00063431606,0.00017028936,0.067197144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992442,0.00021127121,0.000047896494,0.00017945393,0.0002677732,0.000049452625],"domain_scores_gemma":[0.9995641,0.00023561672,0.000027795933,0.000087502296,0.000061000224,0.0000240236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007386671,0.0005838658,0.00062824157,0.0009847671,0.0005762618,0.0038573951,0.0016472766,0.0015570305,0.004955083],"category_scores_gemma":[0.0016189559,0.00022708536,0.0007800533,0.0020246655,0.0034879742,0.004799463,0.0016483599,0.00254743,0.0013725746],"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.0000069416,0.0000070132387,0.00004370689,0.00010238959,0.0000123446125,0.000051283852,0.00014620197,0.0036204546,0.0004661028,0.96531016,0.0028834888,0.027349856],"study_design_scores_gemma":[0.0000065185086,0.000011589907,0.000059414706,0.00004590004,0.000009341198,0.00010636436,0.000061929575,0.021344347,0.00032792226,0.94007957,0.03793912,0.000008172892],"about_ca_topic_score_codex":0.0013058747,"about_ca_topic_score_gemma":0.0009976788,"teacher_disagreement_score":0.004955083,"about_ca_system_score_codex":0.0015790518,"about_ca_system_score_gemma":0.0008942113,"threshold_uncertainty_score":0.01657641},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034092295,0.017309321,0.10815638,0.0077354177,0.004602783,0.0002897715,0.006945188,0.0013157434,0.8502362],"genre_scores_gemma":[0.121571384,0.031061688,0.11560578,0.0137557965,0.0076534217,0.0024660984,0.021422127,0.0024543004,0.68400943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988417,0.00025040805,0.00009510274,0.0003810344,0.0002911168,0.00014058386],"domain_scores_gemma":[0.99896276,0.00034211532,0.000080019425,0.00024036375,0.0002882124,0.000086499516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010574879,0.0016055217,0.0011648079,0.0025617944,0.0026873706,0.004592139,0.0022301748,0.0016174975,0.11600325],"category_scores_gemma":[0.004545613,0.0005528495,0.00087261363,0.002958678,0.0020456647,0.004604606,0.0027921905,0.0037853208,0.08675762],"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.000028965485,0.000052605064,0.00015158184,0.0003432961,0.0000058635255,0.00009496013,0.0003380818,0.00026331545,0.00042200118,0.8370236,0.12384986,0.03742576],"study_design_scores_gemma":[0.000008617102,0.000020107758,0.00016146201,0.00012184062,0.000007651707,0.00021258219,0.0001377472,0.0003095038,0.00020522729,0.35046342,0.6483404,0.000011473063],"about_ca_topic_score_codex":0.0018294915,"about_ca_topic_score_gemma":0.0017456972,"teacher_disagreement_score":0.11600325,"about_ca_system_score_codex":0.0013139623,"about_ca_system_score_gemma":0.0010299687,"threshold_uncertainty_score":0.3880695},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005050539,0.016515678,0.2511531,0.012061601,0.0017508359,0.0000585663,0.00059246854,0.000588855,0.71222836],"genre_scores_gemma":[0.3362538,0.025406376,0.080343306,0.004543658,0.008512371,0.00051744474,0.0017021033,0.00090092624,0.54182005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911696,0.00023196134,0.000031879707,0.00018640803,0.0003794039,0.000053419022],"domain_scores_gemma":[0.99853635,0.0008149041,0.00005533015,0.00031916914,0.00020486207,0.00006936329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010030245,0.0007980091,0.00084102876,0.0018982224,0.0010905577,0.0035702223,0.0008615202,0.0012617926,0.037585273],"category_scores_gemma":[0.005725234,0.00039810094,0.0005944119,0.0021392726,0.002805156,0.0053418423,0.0015369334,0.003490136,0.008078142],"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.0000028789557,0.000005079462,0.000054483786,0.000032053566,0.0000043475416,0.000008914452,0.000039343173,0.00043937328,0.000053549953,0.96988285,0.014586271,0.014890899],"study_design_scores_gemma":[0.0000026686218,0.0000025693837,0.0000842056,0.00001727,0.000002969387,0.000031210526,0.000011682681,0.0012895964,0.00006107188,0.95173454,0.04675913,0.0000031019028],"about_ca_topic_score_codex":0.00085999956,"about_ca_topic_score_gemma":0.00075245457,"teacher_disagreement_score":0.037585273,"about_ca_system_score_codex":0.0018555181,"about_ca_system_score_gemma":0.0009261219,"threshold_uncertainty_score":0.12573534},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40481484,0.0018801192,0.15073219,0.0021530997,0.0012328558,0.00015005414,0.00048137517,0.00076205085,0.43779337],"genre_scores_gemma":[0.79793084,0.00076661457,0.044000916,0.00062826334,0.0004390549,0.00014093496,0.00059206795,0.00036896922,0.15513225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999642,0.00006846224,0.000021335853,0.0000846309,0.00009328729,0.00009026309],"domain_scores_gemma":[0.9995055,0.00014994023,0.00009184054,0.00007916992,0.00007197835,0.00010147438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005707374,0.00085215206,0.00056293065,0.002199307,0.002125837,0.0023146537,0.00090918766,0.0008418498,0.02263057],"category_scores_gemma":[0.0015458349,0.00041254927,0.00079587474,0.00096768414,0.0019314804,0.0039915615,0.0018963342,0.0021572085,0.0019977791],"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.00004778873,0.00001626578,0.00014926525,0.000026412843,0.000008488893,0.00011906707,0.00034618287,0.000550898,0.0008086336,0.98603016,0.0030835618,0.008813334],"study_design_scores_gemma":[0.00003552346,0.000028078974,0.0003869516,0.000026325784,0.000012891757,0.00031107294,0.00030449583,0.0037341197,0.0024232126,0.97220886,0.020502768,0.000025736827],"about_ca_topic_score_codex":0.00075992616,"about_ca_topic_score_gemma":0.00087969087,"teacher_disagreement_score":0.02263057,"about_ca_system_score_codex":0.00088008743,"about_ca_system_score_gemma":0.00033434585,"threshold_uncertainty_score":0.07570678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15818125,0.00056389405,0.72952205,0.0018811012,0.00021499091,0.00028326386,0.00061262416,0.0004078805,0.108332954],"genre_scores_gemma":[0.885235,0.00049595366,0.095154926,0.0003689358,0.00016087481,0.00026300806,0.00048692094,0.00016315069,0.017671319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984861,0.0004922379,0.00006551092,0.00036942097,0.00031420446,0.0002725795],"domain_scores_gemma":[0.9969779,0.0016050067,0.00024245222,0.0004932807,0.00022388721,0.00045740552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090382784,0.00084627175,0.00067267264,0.000845082,0.0011155014,0.0026230097,0.0022781356,0.0012667925,0.0062692906],"category_scores_gemma":[0.0059989956,0.00032250813,0.00088403036,0.0010357582,0.003935198,0.0051139113,0.0016012501,0.0022989179,0.0005488503],"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.00005901355,0.000030247485,0.00035930242,0.000051375086,0.000016749087,0.00007727834,0.00018940138,0.011877689,0.0009679043,0.97737175,0.0022324314,0.0067667374],"study_design_scores_gemma":[0.000032246975,0.0000692972,0.00045828673,0.000029769186,0.000020946518,0.00021810418,0.00017777308,0.10803551,0.0010932579,0.8763131,0.013524844,0.000026893707],"about_ca_topic_score_codex":0.0058272313,"about_ca_topic_score_gemma":0.003546581,"teacher_disagreement_score":0.0062692906,"about_ca_system_score_codex":0.0019200194,"about_ca_system_score_gemma":0.0013957595,"threshold_uncertainty_score":0.020972788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008150162,0.0015272188,0.1060512,0.0020133762,0.00079261896,0.000075343334,0.0011157718,0.0019163297,0.88569313],"genre_scores_gemma":[0.01579427,0.0021608146,0.044379044,0.0009874569,0.00037186441,0.00014545805,0.0019640229,0.0011126644,0.9330844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994803,0.000080451384,0.000022454517,0.00014377285,0.00023178317,0.00004129773],"domain_scores_gemma":[0.9996543,0.000105421816,0.000013587626,0.00010024274,0.000094746676,0.00003175984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003703497,0.00076502975,0.00041720542,0.00088179816,0.00093926623,0.0038188219,0.0011331161,0.0006547736,0.19457659],"category_scores_gemma":[0.0015273133,0.0003879507,0.00048027546,0.0014061019,0.0008436245,0.0034621565,0.0016499456,0.0018169571,0.090207554],"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.000020231239,0.000027347112,0.00006818738,0.00016441099,0.000006883746,0.00002978457,0.00011772401,0.0007354678,0.0006653881,0.5592603,0.20927216,0.22963215],"study_design_scores_gemma":[0.0000045685774,0.0000048281504,0.00004333888,0.000049854258,0.0000033301894,0.000057327914,0.000032419448,0.0009501237,0.00047923095,0.12499801,0.8733724,0.000004654084],"about_ca_topic_score_codex":0.0013353372,"about_ca_topic_score_gemma":0.0018281387,"teacher_disagreement_score":0.19457659,"about_ca_system_score_codex":0.0009988967,"about_ca_system_score_gemma":0.0009386788,"threshold_uncertainty_score":0.65092355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032012214,0.0019109979,0.006068027,0.0023275584,0.0031010027,0.000084328756,0.0010227504,0.00066931907,0.9844959],"genre_scores_gemma":[0.0012848523,0.0012530334,0.0015584836,0.00084303506,0.0005760549,0.00005177715,0.00085235364,0.0002136257,0.99336666],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948055,0.00005381405,0.000016908458,0.00011183533,0.00028114917,0.00005574279],"domain_scores_gemma":[0.99929535,0.000111002875,0.000024292438,0.000118960896,0.0003142307,0.00013610283],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053586764,0.0008251389,0.00048989145,0.0016571538,0.0012365108,0.0041333498,0.0015445078,0.0015265908,0.52529067],"category_scores_gemma":[0.0021259554,0.00029883868,0.00042362118,0.0015578417,0.0006960247,0.0037014787,0.0020596774,0.001816529,0.40754214],"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.000022724636,0.00003696348,0.00009257423,0.00013672544,0.0000019893243,0.00003977378,0.00014200191,0.00013576291,0.00045706707,0.08078654,0.7337704,0.18437758],"study_design_scores_gemma":[0.0000011698586,0.0000039287897,0.00004349477,0.000037820966,6.701014e-7,0.00002428609,0.000026974318,0.000026283855,0.00007053317,0.005748597,0.99401444,0.0000017461336],"about_ca_topic_score_codex":0.0018025415,"about_ca_topic_score_gemma":0.0029799247,"teacher_disagreement_score":0.47470933,"about_ca_system_score_codex":0.0012709735,"about_ca_system_score_gemma":0.0015778338,"threshold_uncertainty_score":0.6771152},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012227241,0.014882639,0.019573277,0.003819463,0.00082699617,0.000019895208,0.00011936647,0.00021584217,0.9593197],"genre_scores_gemma":[0.10493582,0.027058894,0.0176,0.0028799544,0.004783129,0.00018092513,0.00056425796,0.0006923521,0.8413047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996282,0.000081134815,0.000014392686,0.00007935751,0.00016953902,0.000027305123],"domain_scores_gemma":[0.99936277,0.0003953106,0.000026510643,0.000097245465,0.00008551083,0.000032593165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004224815,0.0007001027,0.0005214993,0.0014952993,0.0010640301,0.0042152335,0.00079064385,0.00068360043,0.041502316],"category_scores_gemma":[0.0017486265,0.0004030777,0.00043297576,0.0018028979,0.0038340038,0.0063691568,0.0013041793,0.004060589,0.010127313],"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.0000055893315,0.000015458123,0.00004115641,0.00012754666,0.0000035017695,0.000013845291,0.00016277071,0.00021435817,0.000181321,0.9074222,0.050041903,0.041770384],"study_design_scores_gemma":[0.0000034658244,0.0000055787764,0.00012953139,0.00009369421,0.0000033317733,0.000050017105,0.000052588166,0.00037383867,0.00018444372,0.7101859,0.28891325,0.000004300309],"about_ca_topic_score_codex":0.00087428064,"about_ca_topic_score_gemma":0.0013784183,"teacher_disagreement_score":0.041502316,"about_ca_system_score_codex":0.002676359,"about_ca_system_score_gemma":0.0010209837,"threshold_uncertainty_score":0.13883913},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015334865,0.021242201,0.3053424,0.412957,0.012009314,0.00006086031,0.0006462826,0.00058735546,0.2318198],"genre_scores_gemma":[0.6623264,0.026278121,0.15467912,0.04760743,0.034617245,0.000330519,0.0009969042,0.0010513443,0.07211295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986254,0.000513134,0.000076994875,0.0002117445,0.0004561576,0.00011653353],"domain_scores_gemma":[0.9886629,0.0080315415,0.00042920347,0.0011610005,0.0012654255,0.00044992517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00431332,0.0010317124,0.0009150439,0.0024238268,0.002469176,0.0056482786,0.0016563548,0.0037833955,0.016385855],"category_scores_gemma":[0.019452408,0.0005040228,0.00076614704,0.0012657491,0.011857048,0.022323018,0.0026722471,0.009025639,0.002692244],"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.0000058424007,0.000007633477,0.000039118026,0.000046899833,0.0000045102547,0.0000107561955,0.000074665855,0.0001921421,0.00006827759,0.9883747,0.008267075,0.0029083886],"study_design_scores_gemma":[0.0000032239022,0.0000015245957,0.000028660404,0.000010625955,0.0000014375003,0.000007820262,0.000028208668,0.00027955018,0.0000438468,0.9918967,0.007694796,0.0000036195972],"about_ca_topic_score_codex":0.0007641664,"about_ca_topic_score_gemma":0.00071876677,"teacher_disagreement_score":0.016385855,"about_ca_system_score_codex":0.0023271434,"about_ca_system_score_gemma":0.0011242385,"threshold_uncertainty_score":0.054816127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07687514,0.01634837,0.5234631,0.031610772,0.00072888174,0.00034669868,0.0009631906,0.0006427603,0.3490211],"genre_scores_gemma":[0.8316015,0.004557017,0.098444924,0.0011573582,0.0010238372,0.00043852767,0.00077117194,0.00029736146,0.061708275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9878148,0.0055831308,0.00094833225,0.0010657035,0.0039977143,0.00059033075],"domain_scores_gemma":[0.9666853,0.022261372,0.0019963672,0.005463389,0.003014071,0.00057950354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007655844,0.00063429377,0.00082677073,0.004027517,0.002052321,0.00998761,0.0013105676,0.0018526794,0.03789651],"category_scores_gemma":[0.042847082,0.00055545056,0.0009827034,0.005047059,0.008410392,0.015167039,0.0050481004,0.0021284008,0.0031238045],"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.00006503278,0.000015915584,0.0004601852,0.00009846402,0.000010304371,0.00004565167,0.00022575038,0.0013918964,0.00027621188,0.965919,0.0027758067,0.028715814],"study_design_scores_gemma":[0.000026063073,0.000030790598,0.0007098661,0.000099671954,0.00002857769,0.00025380522,0.00037452418,0.013249498,0.0008799153,0.9548373,0.029486125,0.000023697998],"about_ca_topic_score_codex":0.0021533116,"about_ca_topic_score_gemma":0.0013482538,"teacher_disagreement_score":0.03789651,"about_ca_system_score_codex":0.005236494,"about_ca_system_score_gemma":0.0024270618,"threshold_uncertainty_score":0.12677646},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013710358,0.0031432204,0.03557559,0.0021659974,0.0010772597,0.000043298285,0.00032294143,0.00060746295,0.9556931],"genre_scores_gemma":[0.06464504,0.0051581142,0.024178375,0.001305319,0.0010916629,0.00019362076,0.00079757936,0.00050386577,0.9021265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956423,0.00008972895,0.000016834987,0.00010810421,0.00017310047,0.00004803064],"domain_scores_gemma":[0.9997253,0.0000890603,0.00001302322,0.000097288445,0.00004837421,0.000026943442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002749156,0.000702408,0.00048212238,0.0009395615,0.0011879157,0.0029577804,0.00096986745,0.0010474245,0.07798372],"category_scores_gemma":[0.0014905739,0.00042601838,0.00041483267,0.0008833324,0.0019079798,0.0047609196,0.0018201475,0.0022731384,0.041052166],"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.000008062537,0.00000791909,0.000025332629,0.00008847709,0.000003890253,0.000018043846,0.0001106925,0.00023332206,0.00045707606,0.90867376,0.051234573,0.039138794],"study_design_scores_gemma":[0.0000038955945,0.0000062698755,0.000071288116,0.00006403854,0.000003668077,0.00007982444,0.000034700268,0.0005384328,0.0009139671,0.42063284,0.5776459,0.0000051693705],"about_ca_topic_score_codex":0.0003430811,"about_ca_topic_score_gemma":0.0005505741,"teacher_disagreement_score":0.07798372,"about_ca_system_score_codex":0.001078988,"about_ca_system_score_gemma":0.0007052096,"threshold_uncertainty_score":0.26088154},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048529385,0.15790124,0.028491642,0.037831686,0.25608638,0.0009701462,0.012773565,0.0019616734,0.49913076],"genre_scores_gemma":[0.0121705625,0.07068423,0.010921358,0.0040143956,0.09191472,0.0007734309,0.012766024,0.001688763,0.7950666],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965861,0.00047838426,0.00026385084,0.0004002999,0.0020899817,0.00018136832],"domain_scores_gemma":[0.9845766,0.0019716294,0.0005613948,0.0009567021,0.008709539,0.003224228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031327086,0.0018781743,0.00195076,0.00683004,0.0021080272,0.00617447,0.0011978569,0.001169766,0.28490987],"category_scores_gemma":[0.014125567,0.00056198094,0.0020443352,0.0072160778,0.0007986732,0.003358241,0.0026209934,0.0037892358,0.16034234],"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.000060840255,0.00005174458,0.00014179063,0.00060512655,0.000026849317,0.000041727693,0.00011110949,0.00019342371,0.00085861864,0.0064751366,0.90838665,0.08304701],"study_design_scores_gemma":[0.000017850203,0.000043324384,0.000682465,0.00030922864,0.000021837408,0.00011100342,0.000096496835,0.00029276285,0.00035092182,0.0060325395,0.9920249,0.000016642694],"about_ca_topic_score_codex":0.0009163246,"about_ca_topic_score_gemma":0.001463754,"teacher_disagreement_score":0.28490987,"about_ca_system_score_codex":0.0028867961,"about_ca_system_score_gemma":0.0036935636,"threshold_uncertainty_score":0.9531185},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087809743,0.010239092,0.013946481,0.0038422437,0.0009677536,0.00003116775,0.00013518978,0.00016761973,0.96979237],"genre_scores_gemma":[0.04776895,0.011684581,0.0073939865,0.0016267718,0.0011451801,0.00009615447,0.00038031608,0.00020378044,0.9297003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996861,0.00008077873,0.000008303078,0.00007808821,0.00011607712,0.00003059148],"domain_scores_gemma":[0.999757,0.000089560206,0.000008650106,0.00006856793,0.00004906549,0.000027072436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031172417,0.00072300003,0.00035093355,0.0009006612,0.0010934507,0.0041128676,0.0007884593,0.0010853813,0.07822444],"category_scores_gemma":[0.0012038689,0.0002364688,0.00026603337,0.0008462427,0.0037781657,0.0037751065,0.0015319749,0.0014929802,0.023016507],"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.000009111611,0.0000129579685,0.00005986056,0.00015212763,0.0000050190024,0.000020109737,0.0003605089,0.0003276816,0.00026150802,0.7843926,0.11817214,0.09622638],"study_design_scores_gemma":[0.00000249749,0.000004312853,0.00009075682,0.00010389754,0.0000020769926,0.00004230046,0.00010518792,0.00024946494,0.0001713685,0.26892978,0.730295,0.000003388679],"about_ca_topic_score_codex":0.0017197251,"about_ca_topic_score_gemma":0.0023331605,"teacher_disagreement_score":0.07822444,"about_ca_system_score_codex":0.0018548206,"about_ca_system_score_gemma":0.0014497609,"threshold_uncertainty_score":0.26168686},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028874488,0.015769867,0.05729358,0.00791076,0.0008742954,0.000039021506,0.00039428935,0.00029529893,0.9145354],"genre_scores_gemma":[0.24922416,0.031814065,0.064862154,0.0051782937,0.006054336,0.00045449156,0.002385036,0.00086776685,0.6391597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991854,0.00018155233,0.000029685525,0.00016017813,0.00038400447,0.000059146376],"domain_scores_gemma":[0.99906546,0.0005077661,0.0000323164,0.00020508365,0.00014361618,0.000045801997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062906544,0.00074880075,0.0006240752,0.0016739364,0.0011087144,0.0044766306,0.0008730657,0.0010044953,0.03669105],"category_scores_gemma":[0.0032238632,0.00035011434,0.00056787103,0.0018282597,0.0029091227,0.0050365436,0.0018115529,0.003534034,0.008954777],"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.0000036949357,0.000009499634,0.00006337069,0.000067810564,0.0000056407116,0.000010230553,0.000087378256,0.00042071164,0.000096091164,0.9415724,0.030801283,0.026861802],"study_design_scores_gemma":[0.0000027323767,0.000002595812,0.000114245646,0.000035152152,0.0000025593824,0.000033351193,0.000026897884,0.00064662105,0.000078386336,0.8674874,0.13156727,0.0000028189963],"about_ca_topic_score_codex":0.0009959537,"about_ca_topic_score_gemma":0.0010114402,"teacher_disagreement_score":0.03669105,"about_ca_system_score_codex":0.0027606902,"about_ca_system_score_gemma":0.0010521921,"threshold_uncertainty_score":0.122743785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15818125,0.00056389405,0.72952205,0.0018811012,0.00021499091,0.00028326386,0.00061262416,0.0004078805,0.108332954],"genre_scores_gemma":[0.885235,0.00049595366,0.095154926,0.0003689358,0.00016087481,0.00026300806,0.00048692094,0.00016315069,0.017671319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984861,0.0004922379,0.00006551092,0.00036942097,0.00031420446,0.0002725795],"domain_scores_gemma":[0.9969779,0.0016050067,0.00024245222,0.0004932807,0.00022388721,0.00045740552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090382784,0.00084627175,0.00067267264,0.000845082,0.0011155014,0.0026230097,0.0022781356,0.0012667925,0.0062692906],"category_scores_gemma":[0.0059989956,0.00032250813,0.00088403036,0.0010357582,0.003935198,0.0051139113,0.0016012501,0.0022989179,0.0005488503],"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.00005901355,0.000030247485,0.00035930242,0.000051375086,0.000016749087,0.00007727834,0.00018940138,0.011877689,0.0009679043,0.97737175,0.0022324314,0.0067667374],"study_design_scores_gemma":[0.000032246975,0.0000692972,0.00045828673,0.000029769186,0.000020946518,0.00021810418,0.00017777308,0.10803551,0.0010932579,0.8763131,0.013524844,0.000026893707],"about_ca_topic_score_codex":0.0058272313,"about_ca_topic_score_gemma":0.003546581,"teacher_disagreement_score":0.0062692906,"about_ca_system_score_codex":0.0019200194,"about_ca_system_score_gemma":0.0013957595,"threshold_uncertainty_score":0.020972788},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18992427,0.011779473,0.5424132,0.01073133,0.0012640031,0.00013911328,0.000498191,0.00066808524,0.24258235],"genre_scores_gemma":[0.92396724,0.0020172205,0.052924972,0.00094819133,0.0009806277,0.000371094,0.00023850649,0.00015427858,0.018397951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973569,0.0010025856,0.00016036358,0.0006477443,0.00051581056,0.00031663268],"domain_scores_gemma":[0.9947943,0.0036209968,0.0002798147,0.00057610543,0.00033963163,0.00038905223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003191418,0.0010142076,0.0012697388,0.00420289,0.003691613,0.0080947755,0.001928262,0.0024130347,0.0065164547],"category_scores_gemma":[0.0062390827,0.0007758999,0.0014330586,0.0038722279,0.015507163,0.013175887,0.0060537932,0.005504187,0.0007082769],"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.00000707989,0.0000027106792,0.000021680049,0.0000073161686,0.0000013253548,0.000005508563,0.000060805924,0.00008009995,0.000047751426,0.99914443,0.000111244895,0.0005100524],"study_design_scores_gemma":[0.0000067190817,0.0000033483666,0.000027111828,0.0000053067974,0.0000026439834,0.000011880198,0.000033385855,0.00057571684,0.000066199194,0.99784577,0.0014191419,0.0000028071524],"about_ca_topic_score_codex":0.0013133055,"about_ca_topic_score_gemma":0.00082844653,"teacher_disagreement_score":0.0080947755,"about_ca_system_score_codex":0.003836496,"about_ca_system_score_gemma":0.0010853027,"threshold_uncertainty_score":0.027835846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33123955,0.0035007575,0.5143637,0.004059591,0.0006502661,0.00016452055,0.0019805774,0.0017172627,0.14232372],"genre_scores_gemma":[0.8016143,0.001628112,0.1402303,0.0015794958,0.00089021696,0.00026526616,0.0023475578,0.0011528198,0.05029199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707055,0.00046373627,0.0001727472,0.0010588736,0.000712361,0.0005217877],"domain_scores_gemma":[0.99122095,0.0030576696,0.00047765404,0.0035608208,0.000748702,0.00093419483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039146952,0.0011440804,0.0015450484,0.0020482272,0.003311881,0.0040070643,0.00274633,0.0014686434,0.012442873],"category_scores_gemma":[0.010203751,0.00073593535,0.0027611495,0.0026558128,0.0056704376,0.018083237,0.00839487,0.0034983766,0.0013075816],"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.00014608493,0.00005239149,0.0007099653,0.00010512655,0.000018442955,0.000103675615,0.00071608834,0.004169001,0.0007950431,0.9676257,0.0033288882,0.02222964],"study_design_scores_gemma":[0.00002044731,0.000051255814,0.00038538512,0.000036538004,0.000022824199,0.0001328286,0.0001535978,0.010075322,0.0006650433,0.9706631,0.017760722,0.00003291421],"about_ca_topic_score_codex":0.0037611858,"about_ca_topic_score_gemma":0.0032312586,"teacher_disagreement_score":0.012442873,"about_ca_system_score_codex":0.0022687474,"about_ca_system_score_gemma":0.0011761199,"threshold_uncertainty_score":0.04162562},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015852015,0.028632646,0.5574392,0.044770557,0.005022642,0.0002332134,0.0006319767,0.00040147023,0.34701633],"genre_scores_gemma":[0.7459704,0.020724233,0.15155093,0.022722047,0.009091181,0.00094638177,0.0005311911,0.0005437102,0.047919985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99054563,0.0036415642,0.00056874345,0.0015157239,0.0031465646,0.0005817094],"domain_scores_gemma":[0.98153025,0.0120378975,0.00072946545,0.0023150938,0.002816503,0.00057080924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010080218,0.0013242976,0.0030288512,0.00340258,0.0035700083,0.008454536,0.0035836108,0.0048102136,0.008719458],"category_scores_gemma":[0.02694306,0.0009823649,0.002206218,0.0024402565,0.022770952,0.022921324,0.0082507795,0.012402308,0.0022437847],"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.000008319491,0.000004763319,0.0000649319,0.00004491323,0.0000121394105,0.000019435869,0.000094546565,0.00024273428,0.000035499383,0.99608374,0.0009647576,0.0024241954],"study_design_scores_gemma":[0.0000055279074,0.0000056806207,0.00002753144,0.000022391912,0.0000046741998,0.0000204442,0.000019013269,0.00068451517,0.000050052317,0.99421966,0.00493336,0.0000072159614],"about_ca_topic_score_codex":0.0032430396,"about_ca_topic_score_gemma":0.00097353454,"teacher_disagreement_score":0.010080218,"about_ca_system_score_codex":0.0045093,"about_ca_system_score_gemma":0.003968553,"threshold_uncertainty_score":0.053309917},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12606783,0.009201682,0.008733773,0.14104512,0.0016899741,0.00006650386,0.00022424408,0.00019585178,0.7127751],"genre_scores_gemma":[0.93318313,0.0027521863,0.002252547,0.0047366247,0.00030477147,0.000088924266,0.00009303261,0.0001523829,0.056436367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978206,0.000982412,0.000050220522,0.00024986928,0.00026004133,0.0006369017],"domain_scores_gemma":[0.99776936,0.00042555147,0.0001728137,0.00032280493,0.00024231724,0.0010672356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028610644,0.0005979842,0.00030280245,0.0011985576,0.011902089,0.014367756,0.000940304,0.002538853,0.033795577],"category_scores_gemma":[0.0026989947,0.00032548702,0.00042493726,0.0013915773,0.032426525,0.016179774,0.016805097,0.0047687367,0.0021756452],"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.000037793365,0.000019844192,0.00075756037,0.000056160174,0.000005663522,0.00043005063,0.030449234,0.00020707742,0.00020692126,0.9322104,0.021576574,0.014042635],"study_design_scores_gemma":[0.0000105178715,0.00002409595,0.001163963,0.00015834486,0.000005039969,0.00045948126,0.05244499,0.0003033246,0.00017869376,0.23669231,0.70853573,0.000023493636],"about_ca_topic_score_codex":0.0072839656,"about_ca_topic_score_gemma":0.014362275,"teacher_disagreement_score":0.033795577,"about_ca_system_score_codex":0.009334767,"about_ca_system_score_gemma":0.005472551,"threshold_uncertainty_score":0.113057435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011387682,0.0012697668,0.84988534,0.014050387,0.00043331823,0.00009956349,0.00016769796,0.00017222908,0.12253402],"genre_scores_gemma":[0.70907015,0.0013894885,0.2585256,0.0021401148,0.0008130415,0.000523359,0.00022931008,0.00013936323,0.027169622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810386,0.0007726061,0.00010205791,0.00037988136,0.0005083556,0.00013318632],"domain_scores_gemma":[0.997157,0.0014169462,0.00024531188,0.0006338033,0.00037335922,0.00017359438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002376494,0.0005574857,0.00045001454,0.0016000347,0.0017502795,0.004596191,0.0014668187,0.0021196422,0.0067366],"category_scores_gemma":[0.0062636277,0.00033780886,0.0010253629,0.0008083355,0.0091091255,0.007491423,0.003606508,0.0038444716,0.00079756934],"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.0000011422537,0.0000018877839,0.00003445466,0.000008060803,0.0000016709358,0.000007713128,0.000037022597,0.00049446785,0.00004676137,0.9979644,0.0002088923,0.0011935824],"study_design_scores_gemma":[0.0000032965775,0.0000048180577,0.00003635073,0.0000108302975,0.0000019553233,0.000021424425,0.000029238037,0.004891423,0.000072451294,0.9899832,0.004941583,0.0000032812839],"about_ca_topic_score_codex":0.0006761289,"about_ca_topic_score_gemma":0.00083149294,"teacher_disagreement_score":0.0067366,"about_ca_system_score_codex":0.0021286043,"about_ca_system_score_gemma":0.001690495,"threshold_uncertainty_score":0.022536218},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7253863,0.00080075796,0.15259229,0.004188883,0.0003071645,0.0001787549,0.0010430723,0.0006095288,0.114893295],"genre_scores_gemma":[0.97446334,0.00021509468,0.013432538,0.00034308824,0.0001196737,0.000088054556,0.00034709438,0.00005152828,0.010939568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823207,0.00027348878,0.00015569002,0.0004725555,0.00046350894,0.0004028111],"domain_scores_gemma":[0.99288636,0.002487736,0.00066500576,0.0010463408,0.0015571329,0.0013574937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014378622,0.00047693212,0.0004982473,0.0013570194,0.0014315193,0.0022863636,0.0007227155,0.00078076246,0.006294082],"category_scores_gemma":[0.004569557,0.00042777698,0.0009318668,0.0008768143,0.0043423614,0.005953789,0.004095045,0.0014911565,0.00085028406],"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.0001579274,0.00005108873,0.004700443,0.00014555227,0.000028157965,0.000206906,0.0008455579,0.0014149562,0.008873967,0.97171175,0.0013918655,0.010471851],"study_design_scores_gemma":[0.000052377018,0.00016462897,0.005175526,0.000037866757,0.000040093455,0.00070699,0.0007647589,0.0031962197,0.0060258913,0.95302963,0.030746305,0.00005969152],"about_ca_topic_score_codex":0.0005121166,"about_ca_topic_score_gemma":0.0006780725,"teacher_disagreement_score":0.006294082,"about_ca_system_score_codex":0.0011958907,"about_ca_system_score_gemma":0.0006573297,"threshold_uncertainty_score":0.021055758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032973565,0.016549949,0.20995295,0.45342758,0.003506962,0.00008793149,0.00028484451,0.00059215236,0.28262413],"genre_scores_gemma":[0.82216084,0.0069564846,0.06933846,0.02805472,0.0023575625,0.0002134604,0.00017695545,0.0006257995,0.07011573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947187,0.0030042953,0.00017414485,0.0009433662,0.0008139428,0.0003455251],"domain_scores_gemma":[0.99338055,0.0034250761,0.00042088033,0.0015239649,0.00062882743,0.00062069576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057393247,0.0005814171,0.000713214,0.0012054334,0.007291662,0.0066771936,0.0013078152,0.003927266,0.008124364],"category_scores_gemma":[0.015272397,0.0006051268,0.00070124154,0.0012325388,0.048578538,0.022339165,0.0059616705,0.010430655,0.0023999105],"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.000015126654,0.0000068047743,0.00022436578,0.000031821106,0.000005144097,0.00003364269,0.0013835891,0.00011353889,0.00008161226,0.9870482,0.0070740893,0.0039820075],"study_design_scores_gemma":[0.000007299359,0.000008456252,0.00013909445,0.000046885838,0.0000031521174,0.000076381926,0.0008501158,0.00033980154,0.00010357838,0.93956405,0.058850713,0.0000106308],"about_ca_topic_score_codex":0.0019524288,"about_ca_topic_score_gemma":0.0018947248,"teacher_disagreement_score":0.008124364,"about_ca_system_score_codex":0.0025097425,"about_ca_system_score_gemma":0.002656016,"threshold_uncertainty_score":0.03035283},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004866294,0.15886267,0.028699199,0.038324773,0.25762767,0.0009638915,0.012687712,0.0019481359,0.49601966],"genre_scores_gemma":[0.012301951,0.071011916,0.010931089,0.0040417486,0.092699446,0.00077535276,0.012693594,0.0016903522,0.7938546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965551,0.0004854702,0.00026600837,0.00040597096,0.0021046877,0.00018290039],"domain_scores_gemma":[0.9843754,0.0019985985,0.00056674384,0.00096839096,0.0088561885,0.0032346137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031552163,0.0018808973,0.0019728285,0.0068266867,0.002127045,0.0062261294,0.0011955816,0.0011757548,0.28180492],"category_scores_gemma":[0.014199801,0.0005655257,0.002055882,0.007248953,0.0008052104,0.00337012,0.0026265786,0.0038298373,0.15830721],"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.00006081037,0.00005170787,0.00014352918,0.0006045043,0.00002712384,0.000041981308,0.00011248439,0.00019514123,0.0008593547,0.006582714,0.90844715,0.08287355],"study_design_scores_gemma":[0.000018000812,0.00004347616,0.0006902573,0.0003109916,0.000022142118,0.00011150072,0.00009814141,0.00029810442,0.00035416882,0.006158938,0.99187744,0.00001683552],"about_ca_topic_score_codex":0.00092415884,"about_ca_topic_score_gemma":0.0014743698,"teacher_disagreement_score":0.28180492,"about_ca_system_score_codex":0.0029177205,"about_ca_system_score_gemma":0.0036972698,"threshold_uncertainty_score":0.9427314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008765343,0.00079341873,0.9139671,0.008565549,0.00025513282,0.00009058569,0.00015624183,0.00014242392,0.06726433],"genre_scores_gemma":[0.5858606,0.0015592439,0.38827533,0.0017972531,0.00079327,0.00067233236,0.000291695,0.00018391518,0.020566393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757594,0.00095938577,0.00016612068,0.00042811947,0.0006895283,0.00018097939],"domain_scores_gemma":[0.99511105,0.0026299953,0.00038867662,0.00096651935,0.00064541725,0.00025838253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031191395,0.00063947175,0.00060282735,0.0023264296,0.0018469976,0.0053191865,0.0018999323,0.002045538,0.0068176268],"category_scores_gemma":[0.008292351,0.00039652453,0.0013532058,0.0012560807,0.009978802,0.00998802,0.0040702247,0.004013597,0.00080180314],"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.0000011174453,0.0000024181104,0.000037668335,0.000010824297,0.0000019091665,0.000007976656,0.000042058702,0.00080038444,0.000056624085,0.99788755,0.00016337275,0.0009881144],"study_design_scores_gemma":[0.0000025999304,0.0000046178952,0.000031299256,0.000009157534,0.0000017404242,0.000016858454,0.000028955083,0.0049559777,0.00006300352,0.9912698,0.003612334,0.0000036469812],"about_ca_topic_score_codex":0.00070948177,"about_ca_topic_score_gemma":0.0008431327,"teacher_disagreement_score":0.0068176268,"about_ca_system_score_codex":0.0022704676,"about_ca_system_score_gemma":0.0018313227,"threshold_uncertainty_score":0.0228073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28170952,0.0077438653,0.5605245,0.040210374,0.0009097754,0.00037172768,0.007839426,0.005886982,0.09480385],"genre_scores_gemma":[0.8085527,0.0027143264,0.14761083,0.0025035467,0.0010937583,0.00026087576,0.0036953047,0.0015875442,0.03198096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556655,0.0012277593,0.0002311721,0.0012035633,0.0010100593,0.00076077523],"domain_scores_gemma":[0.9760174,0.019192489,0.0009229107,0.0025144487,0.00058962614,0.0007631122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037958634,0.0015602293,0.002337462,0.0015537101,0.0021492734,0.007869567,0.0031244743,0.0021859955,0.018315045],"category_scores_gemma":[0.0195376,0.0010210599,0.0022132862,0.0044021583,0.0035038716,0.01759771,0.003985939,0.005820451,0.0027607332],"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.0027178843,0.0002668309,0.0018397404,0.0019511193,0.00027400182,0.0005251266,0.0008973415,0.08652504,0.0052827126,0.79383963,0.03286317,0.073017426],"study_design_scores_gemma":[0.00022166892,0.00004108225,0.00018388694,0.000038782884,0.0000765632,0.00014488644,0.000061186336,0.05648946,0.0008664589,0.9371011,0.004758347,0.000016451504],"about_ca_topic_score_codex":0.0029739,"about_ca_topic_score_gemma":0.006051157,"teacher_disagreement_score":0.018315045,"about_ca_system_score_codex":0.0051346645,"about_ca_system_score_gemma":0.003057959,"threshold_uncertainty_score":0.06126994},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004866294,0.15886267,0.028699199,0.038324773,0.25762767,0.0009638915,0.012687712,0.0019481359,0.49601966],"genre_scores_gemma":[0.012301951,0.071011916,0.010931089,0.0040417486,0.092699446,0.00077535276,0.012693594,0.0016903522,0.7938546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965551,0.0004854702,0.00026600837,0.00040597096,0.0021046877,0.00018290039],"domain_scores_gemma":[0.9843754,0.0019985985,0.00056674384,0.00096839096,0.0088561885,0.0032346137],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0031552163,0.0018808973,0.0019728285,0.0068266867,0.002127045,0.0062261294,0.0011955816,0.0011757548,0.28180492],"category_scores_gemma":[0.014199801,0.0005655257,0.002055882,0.007248953,0.0008052104,0.00337012,0.0026265786,0.0038298373,0.15830721],"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.00006081037,0.00005170787,0.00014352918,0.0006045043,0.00002712384,0.000041981308,0.00011248439,0.00019514123,0.0008593547,0.006582714,0.90844715,0.08287355],"study_design_scores_gemma":[0.000018000812,0.00004347616,0.0006902573,0.0003109916,0.000022142118,0.00011150072,0.00009814141,0.00029810442,0.00035416882,0.006158938,0.99187744,0.00001683552],"about_ca_topic_score_codex":0.00092415884,"about_ca_topic_score_gemma":0.0014743698,"teacher_disagreement_score":0.9931733,"about_ca_system_score_codex":0.0029177205,"about_ca_system_score_gemma":0.0036972698,"threshold_uncertainty_score":0.9427314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16415802,0.0026032226,0.5118164,0.006811425,0.00035253068,0.00037900315,0.0029072224,0.0020532198,0.30891898],"genre_scores_gemma":[0.88774306,0.0014998646,0.046176884,0.00074402423,0.00021144633,0.00038953478,0.0021395623,0.00040416344,0.060691446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998552,0.00034207889,0.00008451629,0.00030068625,0.0004727153,0.00024804426],"domain_scores_gemma":[0.9954656,0.0033524767,0.000104287465,0.0005686091,0.00037861898,0.00013038694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013080032,0.00069344544,0.001122399,0.0005616573,0.002098768,0.0031451555,0.0021988333,0.001367727,0.0119515],"category_scores_gemma":[0.0050084544,0.00090702024,0.0013991765,0.0011022268,0.003060664,0.005110436,0.0024057317,0.004796098,0.0013828415],"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.00013982557,0.000076539,0.00020930635,0.0003459881,0.000043090196,0.00011653154,0.0003806189,0.043439943,0.003200485,0.92362773,0.0050009633,0.023419],"study_design_scores_gemma":[0.000042232026,0.000013229768,0.00009083053,0.000017201735,0.000010365345,0.00003057672,0.000046153797,0.022790588,0.0021870255,0.9701569,0.0046064756,0.0000085943375],"about_ca_topic_score_codex":0.003973887,"about_ca_topic_score_gemma":0.004489205,"teacher_disagreement_score":0.0119515,"about_ca_system_score_codex":0.002488154,"about_ca_system_score_gemma":0.002699915,"threshold_uncertainty_score":0.039981782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12748039,0.0019713787,0.72010815,0.011022156,0.0003264116,0.00036991903,0.00072272203,0.0009329032,0.13706599],"genre_scores_gemma":[0.9100409,0.0007763711,0.07478537,0.00157605,0.0005068293,0.00043313633,0.00061943993,0.00022001921,0.011041863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944989,0.0015343887,0.00031716248,0.0014873699,0.0014281386,0.00073411566],"domain_scores_gemma":[0.9906605,0.006669901,0.00037376487,0.0009297109,0.0008795537,0.00048656817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040585664,0.0006096578,0.0011925498,0.001691465,0.0038766023,0.0053815986,0.0010939655,0.0019770486,0.0057271286],"category_scores_gemma":[0.0145165,0.00065797527,0.0025861594,0.0011793852,0.010513018,0.011601757,0.0045095743,0.007274249,0.00083506],"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.00001658237,0.000015625097,0.00017290864,0.000026369251,0.000007125815,0.00002874282,0.00027588857,0.0005825277,0.0002295509,0.9954834,0.00044844812,0.0027128165],"study_design_scores_gemma":[0.00001408636,0.000006741901,0.00009832237,0.000010242525,0.0000065304444,0.00002239863,0.00004426098,0.0021906286,0.00033251912,0.9946536,0.0026121517,0.000008516574],"about_ca_topic_score_codex":0.0037445433,"about_ca_topic_score_gemma":0.0034929414,"teacher_disagreement_score":0.0057271286,"about_ca_system_score_codex":0.0045617316,"about_ca_system_score_gemma":0.002710402,"threshold_uncertainty_score":0.033097863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019844707,0.0059650415,0.57044065,0.08656117,0.0014462746,0.00017608196,0.00022022592,0.0003806596,0.31496522],"genre_scores_gemma":[0.8348956,0.004969705,0.11677335,0.0066058114,0.0019379781,0.0006606189,0.000188749,0.000360501,0.033607565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653155,0.0019990685,0.00013879185,0.0005352469,0.00056916784,0.00022632019],"domain_scores_gemma":[0.9956541,0.002723197,0.0003313198,0.00077223795,0.0002582254,0.0002608527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003832032,0.000767273,0.0007976126,0.004337993,0.0038148453,0.0102780955,0.0027868925,0.0034728022,0.009145337],"category_scores_gemma":[0.0069488906,0.0005111887,0.0011047818,0.0030664282,0.03657255,0.024132976,0.0060836286,0.007053646,0.0012504719],"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.000002067196,0.0000017706775,0.000036188285,0.000008292697,8.3141765e-7,0.000009217646,0.00041228524,0.00014318136,0.000015638094,0.99842393,0.00024900236,0.0006976096],"study_design_scores_gemma":[0.0000036831127,0.0000039209262,0.000040781542,0.000021711277,0.0000014202318,0.000026556221,0.00031593686,0.0011312488,0.000030819247,0.9839557,0.014465113,0.000003271495],"about_ca_topic_score_codex":0.0032055308,"about_ca_topic_score_gemma":0.002208391,"teacher_disagreement_score":0.0102780955,"about_ca_system_score_codex":0.0047673965,"about_ca_system_score_gemma":0.0031515004,"threshold_uncertainty_score":0.034590065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2339506,0.00019834266,0.71527827,0.0011579663,0.00016390752,0.00042135883,0.0005253656,0.0005818784,0.047722403],"genre_scores_gemma":[0.88935083,0.00019064025,0.09495789,0.0004633696,0.00016487497,0.0006119922,0.0006670919,0.00014057787,0.013452707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956191,0.0012786988,0.00038382498,0.0011161665,0.00094652595,0.0006556397],"domain_scores_gemma":[0.9951007,0.0019396275,0.00053362607,0.00096620095,0.0007903588,0.0006695915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018379802,0.0005074503,0.0006699791,0.000898925,0.001279826,0.002687768,0.001609479,0.00074869726,0.011119737],"category_scores_gemma":[0.0068392325,0.0005169989,0.0017686582,0.00072424643,0.003505617,0.006221684,0.0035565642,0.0025381492,0.0008399564],"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.00006160562,0.000075588054,0.00029565315,0.000028919943,0.000018163515,0.00006032638,0.00039849145,0.0026395987,0.0012705744,0.9895363,0.000343158,0.0052716606],"study_design_scores_gemma":[0.000045721794,0.000039393715,0.00034997927,0.000009315239,0.000024800067,0.0000652026,0.00015076564,0.025281604,0.0019058471,0.9694826,0.0026241275,0.000020687861],"about_ca_topic_score_codex":0.002636502,"about_ca_topic_score_gemma":0.0018881471,"teacher_disagreement_score":0.011119737,"about_ca_system_score_codex":0.0016589456,"about_ca_system_score_gemma":0.0020630008,"threshold_uncertainty_score":0.0371992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008503549,0.018257797,0.11583203,0.0028634546,0.0019531609,0.000037897615,0.00032386655,0.0007604328,0.8514679],"genre_scores_gemma":[0.43376285,0.025139812,0.115841135,0.0017189364,0.003174336,0.00025442708,0.0012372736,0.00077631365,0.4180949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995664,0.000121997524,0.000030399691,0.00008461909,0.00014036849,0.000056207853],"domain_scores_gemma":[0.9996911,0.00014320867,0.000024427323,0.00006742504,0.00005561614,0.000018232135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044560182,0.00070358044,0.00044192496,0.0012592964,0.0011036857,0.004637314,0.00071144383,0.0008241302,0.020712566],"category_scores_gemma":[0.0016823994,0.00028446803,0.00042951215,0.0020895675,0.0029944172,0.006480863,0.0016884024,0.002146323,0.008100286],"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.000004113363,0.0000026061314,0.000010921038,0.000042814227,0.0000010646368,0.000016015543,0.00012586947,0.00024959235,0.0001727119,0.9787088,0.004909935,0.015755607],"study_design_scores_gemma":[0.0000034071447,0.0000065914314,0.000028929702,0.000042446234,0.0000017821737,0.00006451221,0.00004903101,0.0005680842,0.00027184054,0.86760783,0.13134925,0.0000062426657],"about_ca_topic_score_codex":0.00051705656,"about_ca_topic_score_gemma":0.0003815397,"teacher_disagreement_score":0.020712566,"about_ca_system_score_codex":0.001371714,"about_ca_system_score_gemma":0.00049227313,"threshold_uncertainty_score":0.0692904},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049678575,0.012738895,0.27458793,0.062073383,0.0030503192,0.000093591836,0.00033879458,0.00059872185,0.59683985],"genre_scores_gemma":[0.8604141,0.0045632073,0.034526072,0.004227921,0.0059756697,0.00019593007,0.00027534872,0.00028210407,0.08953963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777955,0.0009718113,0.000107945976,0.0005343003,0.00047056645,0.00013576075],"domain_scores_gemma":[0.995877,0.0025449153,0.00019604732,0.00044573782,0.00065984426,0.00027648895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022062936,0.0006550393,0.0008552428,0.002025712,0.003542913,0.010743724,0.0009169543,0.003246201,0.02404907],"category_scores_gemma":[0.0076864543,0.00040987195,0.00062929565,0.001992909,0.014996655,0.01201203,0.0036643404,0.0058646207,0.0038803513],"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.0000061640176,0.000004061199,0.000035524048,0.000031530966,0.0000012835068,0.000010285661,0.00023783384,0.000050669536,0.00010632084,0.9964355,0.0010420826,0.0020387298],"study_design_scores_gemma":[0.000004276633,0.0000020949615,0.000041848118,0.000011782806,0.0000017315367,0.000024823528,0.000056069566,0.00028160296,0.000054922504,0.9915371,0.0079817185,0.0000019735714],"about_ca_topic_score_codex":0.000885826,"about_ca_topic_score_gemma":0.00069616234,"teacher_disagreement_score":0.02404907,"about_ca_system_score_codex":0.0038807916,"about_ca_system_score_gemma":0.0015630539,"threshold_uncertainty_score":0.080452144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5411088,0.00045816932,0.42902127,0.0024665908,0.00011761488,0.00028655824,0.00014562416,0.0006576581,0.025737684],"genre_scores_gemma":[0.96235955,0.00019242939,0.032770496,0.00022722274,0.000078822224,0.00019923004,0.000051947587,0.00014431246,0.003975901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98611844,0.0058845445,0.0005333104,0.0020306169,0.0031669154,0.0022661628],"domain_scores_gemma":[0.93249714,0.047256615,0.008219112,0.00841472,0.0019775433,0.001634865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010363588,0.000903845,0.0019396095,0.0009926311,0.0017836025,0.0022893657,0.0034451692,0.002560682,0.007873663],"category_scores_gemma":[0.04795538,0.0011106848,0.0020312325,0.00063311757,0.0061645643,0.009187524,0.0043522376,0.0038077217,0.0006961195],"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.0020094956,0.00038045275,0.005675242,0.000323183,0.00028297066,0.0009948204,0.0012137574,0.37010688,0.022173198,0.5710306,0.0013741481,0.024435151],"study_design_scores_gemma":[0.00017481815,0.0004268075,0.0012465317,0.000054601245,0.00006613376,0.00044986058,0.0002102669,0.64199144,0.012156173,0.34176674,0.0013323387,0.00012433],"about_ca_topic_score_codex":0.0012612026,"about_ca_topic_score_gemma":0.000911289,"teacher_disagreement_score":0.010363588,"about_ca_system_score_codex":0.0024979678,"about_ca_system_score_gemma":0.0019235562,"threshold_uncertainty_score":0.054808557},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054139053,0.0060389154,0.1453451,0.0058361567,0.001836304,0.00005932055,0.00034218628,0.00044117292,0.8346869],"genre_scores_gemma":[0.43477002,0.008068651,0.05269183,0.004665913,0.0032580453,0.00040573446,0.0012816122,0.0007532807,0.49410486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875236,0.00024031977,0.00005521096,0.00033627776,0.0004995147,0.000116310395],"domain_scores_gemma":[0.998971,0.00044686432,0.000036455156,0.00032864505,0.00015145964,0.00006560576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008047693,0.000668934,0.0006825484,0.0010167612,0.0016767307,0.00358092,0.0010630727,0.0011951915,0.028045747],"category_scores_gemma":[0.0035432526,0.00039490263,0.00059086614,0.00090007746,0.004971325,0.00771224,0.0033560633,0.005366321,0.006508264],"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.000007244292,0.0000066271195,0.000021188285,0.000024108524,0.0000022792417,0.000008279129,0.000058624595,0.00016527195,0.00017758254,0.9805648,0.005813386,0.013150669],"study_design_scores_gemma":[0.0000038051448,0.000004225506,0.00004413719,0.000019303896,0.0000026820937,0.000037106678,0.00002016976,0.00053595885,0.00036677698,0.94934696,0.049614914,0.000004083321],"about_ca_topic_score_codex":0.00064863963,"about_ca_topic_score_gemma":0.00052306225,"teacher_disagreement_score":0.028045747,"about_ca_system_score_codex":0.0020621477,"about_ca_system_score_gemma":0.0010440054,"threshold_uncertainty_score":0.09382236},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010153998,0.013201585,0.17692877,0.5039081,0.017853888,0.00046492182,0.001554981,0.00079424406,0.2751396],"genre_scores_gemma":[0.37637222,0.013439841,0.22869664,0.1431616,0.023480123,0.004694239,0.00326783,0.0015730187,0.20531453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98345584,0.010238597,0.0005630047,0.0019108872,0.0032836222,0.00054816355],"domain_scores_gemma":[0.95846134,0.02579834,0.0013241586,0.007991859,0.004580735,0.0018436128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021375041,0.0013529247,0.0010263827,0.001999476,0.005555125,0.0061115646,0.0034140393,0.0051244316,0.030872498],"category_scores_gemma":[0.063009985,0.0007185863,0.0014555765,0.0017094584,0.020916015,0.015396178,0.009128005,0.01350473,0.00495979],"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.000103102626,0.00004871013,0.0002354654,0.00013025031,0.000015188825,0.000041292624,0.0005721637,0.0003936401,0.00020604809,0.8768369,0.100200735,0.021216547],"study_design_scores_gemma":[0.000041109,0.000040573144,0.00024874293,0.00012770091,0.000004903654,0.00007972905,0.0003302212,0.00095636904,0.00034322005,0.8261159,0.17169,0.000021438409],"about_ca_topic_score_codex":0.001527069,"about_ca_topic_score_gemma":0.0015402136,"teacher_disagreement_score":0.030872498,"about_ca_system_score_codex":0.0058410186,"about_ca_system_score_gemma":0.0053111953,"threshold_uncertainty_score":0.11304337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17152189,0.0062927813,0.724792,0.014288492,0.00049607165,0.000099810124,0.00021504528,0.0005172309,0.08177672],"genre_scores_gemma":[0.95794946,0.0013316936,0.031147353,0.0011252487,0.0003129922,0.00013180787,0.00008098005,0.00004091442,0.007879553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995981,0.0001333548,0.000013435475,0.00006280776,0.0001371471,0.000055173143],"domain_scores_gemma":[0.99831855,0.0010777499,0.00015964861,0.00020817082,0.00015082728,0.00008518361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008604271,0.00037792657,0.00033285044,0.0008172761,0.0005992525,0.0009333498,0.00057357916,0.000948478,0.0023507278],"category_scores_gemma":[0.00542561,0.00019136688,0.00029018242,0.00046903107,0.0033966643,0.002663939,0.0011173801,0.0015065251,0.00040244378],"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.000013913051,0.0000031950888,0.00012100769,0.000016167798,0.0000037502148,0.000029050792,0.000042377993,0.0033190625,0.0005109671,0.9912559,0.00084343157,0.0038412088],"study_design_scores_gemma":[0.000011302551,0.000013101165,0.0001562078,0.000007769796,0.0000020570074,0.000040574196,0.000012347565,0.019052872,0.0004791254,0.9775302,0.0026869762,0.000007526581],"about_ca_topic_score_codex":0.00066699623,"about_ca_topic_score_gemma":0.0004785248,"teacher_disagreement_score":0.0023507278,"about_ca_system_score_codex":0.0006991279,"about_ca_system_score_gemma":0.00045086388,"threshold_uncertainty_score":0.007863939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12982057,0.0013303529,0.84865993,0.0022125358,0.000091991395,0.00019477215,0.0003297862,0.00047989353,0.016880088],"genre_scores_gemma":[0.87551033,0.0006793255,0.11632921,0.00055552,0.00031785748,0.0005521871,0.00044668434,0.0001606432,0.005448179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931393,0.0022188807,0.00051370595,0.0014632914,0.0021957264,0.00046906754],"domain_scores_gemma":[0.9583109,0.029599657,0.00236953,0.0063633635,0.002163985,0.0011924579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007861213,0.00082585815,0.0012979432,0.0016136419,0.0015201212,0.0034369852,0.001813017,0.0019859807,0.005221389],"category_scores_gemma":[0.03578243,0.0007221127,0.0018214076,0.0013230602,0.009242623,0.012213918,0.007064662,0.004140424,0.00055388093],"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.00013375358,0.00004802183,0.0013555776,0.00016293768,0.000054740653,0.00011664771,0.00052764855,0.0076567354,0.0038389901,0.96798295,0.0007430847,0.01737899],"study_design_scores_gemma":[0.00006832617,0.00028008784,0.0022586288,0.000066635395,0.000041105373,0.00042558956,0.0001548008,0.086301915,0.010640379,0.8940765,0.005618265,0.00006772323],"about_ca_topic_score_codex":0.00050417444,"about_ca_topic_score_gemma":0.00026690404,"teacher_disagreement_score":0.007861213,"about_ca_system_score_codex":0.0022412552,"about_ca_system_score_gemma":0.00078524306,"threshold_uncertainty_score":0.041574538},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089508604,0.021985957,0.0318814,0.00584243,0.0071066613,0.000090118236,0.0012160661,0.0010237925,0.9299585],"genre_scores_gemma":[0.0049664686,0.010895541,0.0108149955,0.001673456,0.0022400792,0.000091425514,0.00097261224,0.00064357516,0.9677019],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965155,0.000037833688,0.00001806407,0.000050852417,0.00021394074,0.00002777192],"domain_scores_gemma":[0.9994862,0.00020083398,0.000023794726,0.000049664406,0.00017967446,0.000059746842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030280795,0.0010314411,0.00068885717,0.0021089811,0.00085088145,0.0029269713,0.00091123045,0.00078923703,0.15977313],"category_scores_gemma":[0.0014689183,0.00036146562,0.0005165548,0.002189147,0.0009595964,0.0036505784,0.0014334824,0.002482749,0.07464264],"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.000018070337,0.000060660932,0.000078537916,0.00031259836,0.000006116157,0.00006372726,0.00018229659,0.00065018237,0.0011362059,0.16929638,0.6094827,0.21871252],"study_design_scores_gemma":[0.0000024895562,0.00000868142,0.00010567162,0.00010908236,0.0000018909027,0.000079191566,0.000025917167,0.00016927149,0.00016292145,0.03890008,0.96042955,0.0000052574787],"about_ca_topic_score_codex":0.0008230311,"about_ca_topic_score_gemma":0.002686024,"teacher_disagreement_score":0.15977313,"about_ca_system_score_codex":0.0013446254,"about_ca_system_score_gemma":0.0012784067,"threshold_uncertainty_score":0.53449434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7493145,0.0013398142,0.10539312,0.00198644,0.0003860726,0.00013239415,0.00075303763,0.00028170203,0.14041297],"genre_scores_gemma":[0.970991,0.00044584993,0.019605564,0.0002318798,0.0000990208,0.000101608755,0.00040186962,0.00004893991,0.008074231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999361,0.00012800621,0.00004887269,0.00018534482,0.00012780276,0.00014902664],"domain_scores_gemma":[0.9983335,0.000479751,0.0003579191,0.0001930663,0.0002770111,0.00035877313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084875745,0.0005014333,0.00037961535,0.0010648952,0.0015665874,0.0015242558,0.00054484827,0.0007152587,0.006036076],"category_scores_gemma":[0.0029144806,0.0003286676,0.000559832,0.00061905873,0.0022744029,0.0027787967,0.0013605348,0.0018277394,0.00068931485],"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.00013691164,0.000035734956,0.0010134892,0.000081167134,0.000011477209,0.000095820666,0.00038146286,0.0013113382,0.004220275,0.97607577,0.0019025155,0.014734058],"study_design_scores_gemma":[0.000025703095,0.000051732233,0.0013149584,0.00002893964,0.000017211603,0.00026831866,0.00026726877,0.006510575,0.0038532973,0.9801301,0.0075044,0.000027481803],"about_ca_topic_score_codex":0.00080079486,"about_ca_topic_score_gemma":0.0014154648,"teacher_disagreement_score":0.006036076,"about_ca_system_score_codex":0.0007838551,"about_ca_system_score_gemma":0.0005798518,"threshold_uncertainty_score":0.020192683},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030800884,0.03861008,0.3347307,0.010106814,0.0022703852,0.00006541943,0.00059864105,0.0009343429,0.6096036],"genre_scores_gemma":[0.18804109,0.048258413,0.14238513,0.0043677273,0.0069208005,0.000434814,0.00255762,0.0011145121,0.6059201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937844,0.00015029224,0.000024831314,0.00012060115,0.00028773872,0.000038142003],"domain_scores_gemma":[0.9994462,0.00025918367,0.000024430541,0.00013911365,0.00009662623,0.000034422137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435924,0.00086568616,0.000818965,0.0011064474,0.00073412916,0.0031427583,0.0010415879,0.00095958,0.023270369],"category_scores_gemma":[0.0020979731,0.00036299246,0.0006089038,0.0015230748,0.001791737,0.0031896876,0.0014339227,0.0031719774,0.00995261],"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.000007694757,0.000023529457,0.00013221387,0.00017440651,0.000021301537,0.000020046928,0.0000760954,0.00227125,0.00020844424,0.7878381,0.07601004,0.13321686],"study_design_scores_gemma":[0.000003832586,0.0000046675827,0.00011578481,0.0000563928,0.000006136856,0.0000397217,0.00001825588,0.0030843723,0.00010521115,0.880648,0.115913466,0.0000042379675],"about_ca_topic_score_codex":0.00061494,"about_ca_topic_score_gemma":0.00085119647,"teacher_disagreement_score":0.023270369,"about_ca_system_score_codex":0.0014795081,"about_ca_system_score_gemma":0.0010500832,"threshold_uncertainty_score":0.07784712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057572518,0.00482695,0.7322411,0.004302158,0.00035800174,0.00011732453,0.00057378,0.00023154283,0.1997767],"genre_scores_gemma":[0.87904257,0.004504437,0.0695953,0.0005741648,0.000816586,0.00025527037,0.00035062173,0.00010530486,0.044755805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881506,0.0005483631,0.000059322247,0.0001814641,0.0002862358,0.000109632354],"domain_scores_gemma":[0.99742043,0.0018836772,0.00017647109,0.00024363556,0.00014462226,0.0001311762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019825234,0.0011468463,0.0013983726,0.0007301272,0.0007931987,0.003845217,0.0016851936,0.0022406494,0.008915571],"category_scores_gemma":[0.0067551173,0.00087009295,0.0009637443,0.0013763078,0.0030876058,0.0073327683,0.0015026834,0.0026060592,0.0008760005],"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.000012432442,0.000011867034,0.00005654506,0.000030667004,0.000010709384,0.000023357248,0.00004662964,0.012172831,0.000096235206,0.98149395,0.0015458665,0.004498979],"study_design_scores_gemma":[0.0000044866074,0.000004024654,0.000027564125,0.000007353206,0.000002760815,0.000013803234,0.0000056531944,0.016555393,0.000020491207,0.9826293,0.0007258558,0.0000033089111],"about_ca_topic_score_codex":0.001211277,"about_ca_topic_score_gemma":0.001420144,"teacher_disagreement_score":0.008915571,"about_ca_system_score_codex":0.0014228055,"about_ca_system_score_gemma":0.0011802702,"threshold_uncertainty_score":0.029825568},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25855386,0.001733285,0.6260012,0.0027666744,0.0007223388,0.00022345057,0.001745329,0.0009578076,0.10729608],"genre_scores_gemma":[0.93268543,0.00044328705,0.05517761,0.00034146543,0.00038877234,0.00022468917,0.00063390005,0.00013052367,0.0099742925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965886,0.0005270032,0.00040857118,0.0009216914,0.0011322876,0.00042183703],"domain_scores_gemma":[0.9909073,0.0037464695,0.0010543832,0.0026267597,0.0011543785,0.0005107166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023918003,0.00059457374,0.00079650304,0.0026282805,0.0017260154,0.005806189,0.0013273105,0.0016301373,0.004539147],"category_scores_gemma":[0.009263794,0.00042251294,0.001270795,0.0021707914,0.008553363,0.009961866,0.003290392,0.0024387876,0.0006302134],"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.000016100885,0.00000987115,0.0008811084,0.00005065153,0.000010295195,0.00008084726,0.00018622972,0.00061434513,0.00068358256,0.99347925,0.00037723518,0.0036105225],"study_design_scores_gemma":[0.000013412318,0.0000664678,0.0012302601,0.00006058221,0.000037023383,0.0007155693,0.00028913433,0.0066945013,0.003989869,0.9655527,0.02130794,0.00004249527],"about_ca_topic_score_codex":0.0005428386,"about_ca_topic_score_gemma":0.00043702516,"teacher_disagreement_score":0.005806189,"about_ca_system_score_codex":0.0020341605,"about_ca_system_score_gemma":0.0011300547,"threshold_uncertainty_score":0.0151849985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18101367,0.0013843528,0.745261,0.0101114595,0.00067435706,0.00030555984,0.0005417683,0.0016209221,0.059086926],"genre_scores_gemma":[0.9643668,0.00034465443,0.024301212,0.00056963053,0.0004425286,0.00010582893,0.0001594229,0.0001580351,0.009552002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874067,0.0032903522,0.00094784924,0.0022714206,0.004644696,0.0014390437],"domain_scores_gemma":[0.9412587,0.039423067,0.0039409273,0.008442893,0.0048958496,0.0020385208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006655277,0.0009750452,0.0018691133,0.0025783828,0.0037584158,0.011861467,0.0020701874,0.0034053074,0.0074657616],"category_scores_gemma":[0.06580686,0.0011496258,0.0016906584,0.0032608898,0.0086518265,0.018468212,0.009288052,0.0064502293,0.0009231723],"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.00012745123,0.000028786224,0.00067219656,0.0000914923,0.000023056471,0.00037344007,0.0005110033,0.0051837107,0.0008227486,0.9858462,0.001003572,0.005316268],"study_design_scores_gemma":[0.000030068424,0.000009410812,0.000068432186,0.000020477817,0.00002270855,0.0001525401,0.00006169634,0.030164607,0.00085313345,0.96704423,0.0015551168,0.000017568002],"about_ca_topic_score_codex":0.0015632072,"about_ca_topic_score_gemma":0.0011523833,"teacher_disagreement_score":0.011861467,"about_ca_system_score_codex":0.0051601077,"about_ca_system_score_gemma":0.0030682788,"threshold_uncertainty_score":0.037439406},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2252739,0.009565485,0.12424242,0.27033183,0.013519154,0.0004606959,0.0001648051,0.0005620824,0.35587963],"genre_scores_gemma":[0.94697356,0.0015178191,0.006380423,0.0056527387,0.00079967774,0.00025502092,0.00008314337,0.00030979223,0.03802791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99020255,0.006749793,0.00019611878,0.00069506676,0.00088699185,0.0012694974],"domain_scores_gemma":[0.9904835,0.005008929,0.0003942088,0.0012421525,0.00057169213,0.002299417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008887062,0.00048262934,0.000452921,0.0008822688,0.012047353,0.015029345,0.002021883,0.0025033334,0.0077429786],"category_scores_gemma":[0.01548811,0.00037513574,0.0007863138,0.001114295,0.023642944,0.011477224,0.015494117,0.0072023543,0.0012213844],"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.00010963455,0.00007631335,0.0009300912,0.0002292611,0.00002033743,0.00025348086,0.11273734,0.0019293353,0.0011488294,0.79570454,0.052380316,0.034480438],"study_design_scores_gemma":[0.000031935615,0.00008810536,0.00094526366,0.00043831998,0.000011248999,0.00023757364,0.14008154,0.0025404685,0.0014120182,0.29062527,0.5635239,0.00006432906],"about_ca_topic_score_codex":0.002499967,"about_ca_topic_score_gemma":0.002339331,"teacher_disagreement_score":0.015029345,"about_ca_system_score_codex":0.0054061925,"about_ca_system_score_gemma":0.0049802773,"threshold_uncertainty_score":0.04699987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032218304,0.00088613917,0.8725762,0.01499033,0.00014016988,0.00010294281,0.00031478007,0.0002787531,0.07849238],"genre_scores_gemma":[0.7831598,0.0010785254,0.20357014,0.0016981736,0.0005409174,0.00045760197,0.0005146795,0.00026777608,0.008712216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967102,0.00124136,0.00017565825,0.0006649009,0.0008021712,0.00040585312],"domain_scores_gemma":[0.97736645,0.016671589,0.0010029536,0.0033732387,0.0009653157,0.00062047347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041270577,0.00086874963,0.0009378162,0.0020852527,0.0018627031,0.0061466154,0.0033823524,0.002925317,0.01198802],"category_scores_gemma":[0.017826727,0.00064993236,0.0026709312,0.0018971422,0.01825868,0.019448254,0.0054662046,0.0065000704,0.0013261947],"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.000007645746,0.0000059473846,0.00012331172,0.000029372908,0.0000051246097,0.000018408675,0.0001148983,0.0037887578,0.00013387941,0.9937781,0.00033402906,0.0016605954],"study_design_scores_gemma":[0.0000026775792,0.0000055663836,0.000076880046,0.000008483529,0.0000027864014,0.000024364726,0.000034973524,0.008005715,0.00011459234,0.99038345,0.0013361985,0.000004394512],"about_ca_topic_score_codex":0.0016577228,"about_ca_topic_score_gemma":0.0012923719,"teacher_disagreement_score":0.01198802,"about_ca_system_score_codex":0.0025361255,"about_ca_system_score_gemma":0.0017726092,"threshold_uncertainty_score":0.040103912},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000575665,0.08265536,0.008005893,0.002835907,0.002496698,0.000028165545,0.00022561991,0.00024446682,0.9029322],"genre_scores_gemma":[0.012565155,0.057032887,0.00820671,0.0020351855,0.0025762657,0.00008977269,0.00033023482,0.0002696536,0.9168941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980766,0.000022729464,0.0000055819105,0.00003690475,0.00011309731,0.0000139993435],"domain_scores_gemma":[0.9998536,0.00008284334,0.000006138779,0.000020050307,0.000025516145,0.000011818124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021026366,0.0009980159,0.00080701744,0.0018373845,0.0011851935,0.0040181954,0.0008768394,0.001401385,0.05459128],"category_scores_gemma":[0.0005425704,0.00041238376,0.00038405185,0.003084349,0.0024005214,0.0037250975,0.0010076569,0.0025271333,0.019990532],"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.000011439611,0.000025081523,0.000056555462,0.0003200396,0.000006720884,0.000036820333,0.00015583627,0.00045331698,0.00061776617,0.6773615,0.22833551,0.092619404],"study_design_scores_gemma":[0.00000178851,0.000005265358,0.0000838305,0.00012301444,0.000002805961,0.00008659589,0.000051663024,0.00032661879,0.00017473826,0.17930873,0.81982976,0.0000051233483],"about_ca_topic_score_codex":0.0017007678,"about_ca_topic_score_gemma":0.004015178,"teacher_disagreement_score":0.05459128,"about_ca_system_score_codex":0.0012759404,"about_ca_system_score_gemma":0.0009762271,"threshold_uncertainty_score":0.18262601},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9262554,0.00077886385,0.058009055,0.002506963,0.00014841913,0.000028191378,0.00075996504,0.00027908853,0.011234105],"genre_scores_gemma":[0.98606676,0.00032607812,0.011015438,0.00013756257,0.00013426103,0.00006329799,0.0004893462,0.000088363384,0.0016789249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967237,0.0008066015,0.000315764,0.0007934207,0.0009239983,0.00043642425],"domain_scores_gemma":[0.94997036,0.03471489,0.0056772158,0.0042992206,0.0033471095,0.0019912685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032646053,0.00041154944,0.0009807345,0.0026845566,0.0014500142,0.0034352704,0.0015438756,0.0018487435,0.0028451912],"category_scores_gemma":[0.052135672,0.00058639137,0.00030498294,0.0016024946,0.0030675014,0.004598388,0.0028908192,0.0015315791,0.0009249578],"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.0038488316,0.000209023,0.1455749,0.0005996184,0.00013632995,0.0015512145,0.0017592472,0.034008533,0.034091435,0.6613759,0.012543569,0.1043014],"study_design_scores_gemma":[0.00028911658,0.00049861294,0.050939266,0.0003065842,0.0001640204,0.011838853,0.0019361017,0.23238218,0.032891937,0.6415492,0.02689663,0.00030740997],"about_ca_topic_score_codex":0.00037610758,"about_ca_topic_score_gemma":0.00021712254,"teacher_disagreement_score":0.0034352704,"about_ca_system_score_codex":0.0011009732,"about_ca_system_score_gemma":0.00050080946,"threshold_uncertainty_score":0.017265081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071023294,0.020523816,0.014332967,0.0033407495,0.0014590883,0.000027617712,0.00009479689,0.00017156743,0.9593392],"genre_scores_gemma":[0.028688516,0.016151631,0.008124487,0.001801368,0.001920729,0.00010788579,0.00019935341,0.00020197051,0.9428041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997398,0.00007461549,0.0000067738883,0.00004432647,0.00011071302,0.00002366088],"domain_scores_gemma":[0.9997873,0.00011476277,0.00000894328,0.000037926944,0.000032289696,0.000018807777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027970597,0.0008384363,0.00058495393,0.0011754665,0.0011632412,0.0038234973,0.00067571725,0.001094363,0.04047965],"category_scores_gemma":[0.00088979345,0.00030316235,0.00028440866,0.001322911,0.002993579,0.004700047,0.0013488213,0.002226266,0.014683143],"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.0000042838633,0.000009576188,0.000031363048,0.00009265407,0.0000032262033,0.000017102084,0.00025442295,0.00024108298,0.00015235278,0.8626877,0.09822659,0.038279656],"study_design_scores_gemma":[0.000002159072,0.000004609856,0.00007383209,0.00007950012,0.0000023052876,0.000038558563,0.00008105304,0.00040931941,0.000113218644,0.34592614,0.6532665,0.0000028248608],"about_ca_topic_score_codex":0.0012810206,"about_ca_topic_score_gemma":0.0023040145,"teacher_disagreement_score":0.04047965,"about_ca_system_score_codex":0.00152024,"about_ca_system_score_gemma":0.0008289496,"threshold_uncertainty_score":0.13541794},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006858747,0.08705396,0.52718526,0.0132587785,0.0026346492,0.00008928807,0.00046708935,0.00072981114,0.3617225],"genre_scores_gemma":[0.53605103,0.081666574,0.27273372,0.00420284,0.0076748454,0.0009008021,0.0010056995,0.00054785836,0.09521667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989108,0.00047888298,0.000067115194,0.00015913162,0.00031417506,0.000069906],"domain_scores_gemma":[0.9982968,0.00114734,0.00009421336,0.0002507918,0.00014450878,0.000066320266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011807875,0.0013186077,0.0013355388,0.0020509562,0.0011736506,0.0052515105,0.001572254,0.0019096968,0.01100556],"category_scores_gemma":[0.0041545173,0.000734224,0.0014276358,0.0031678108,0.0056052003,0.007925971,0.0018459967,0.0040245038,0.0020044195],"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.0000023702703,0.000002451853,0.000025098117,0.000037339174,0.000003701584,0.00000970776,0.000043586195,0.00060212536,0.000042511198,0.99297005,0.0022544092,0.004006656],"study_design_scores_gemma":[0.0000020827438,0.0000018249588,0.00001915988,0.000018023948,0.0000025513928,0.000025838805,0.00001585049,0.0018933103,0.000024856994,0.98251444,0.015479897,0.000002104607],"about_ca_topic_score_codex":0.0014412408,"about_ca_topic_score_gemma":0.0008959878,"teacher_disagreement_score":0.01100556,"about_ca_system_score_codex":0.0027384222,"about_ca_system_score_gemma":0.0012037216,"threshold_uncertainty_score":0.036817253},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009581894,0.026183197,0.015872998,0.0030158171,0.0017920842,0.000028803706,0.0002034325,0.00019348253,0.9517521],"genre_scores_gemma":[0.0457556,0.025950668,0.015717363,0.0021240055,0.003554244,0.00010638233,0.0005231388,0.00031876296,0.90594995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997224,0.000058532914,0.00001101807,0.000057990957,0.00013336654,0.000016741295],"domain_scores_gemma":[0.9997632,0.00010327272,0.000012822497,0.00004665764,0.000056919653,0.00001700624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039283396,0.0006506401,0.0005595792,0.0012821008,0.0008436201,0.0028395609,0.000518259,0.0005744518,0.035796087],"category_scores_gemma":[0.0012427178,0.00026227155,0.000314635,0.001523306,0.0019361547,0.0028526753,0.0009028362,0.0023604915,0.016193183],"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.000008442791,0.000011591703,0.000056141253,0.0001368267,0.0000043003897,0.000019990995,0.00013838519,0.00027817645,0.0003657964,0.8144408,0.12212125,0.06241835],"study_design_scores_gemma":[0.0000032996616,0.000006763219,0.00016646422,0.00007433942,0.0000029740588,0.000084066014,0.00003188222,0.0003708164,0.00016858715,0.36633605,0.6327508,0.000003889832],"about_ca_topic_score_codex":0.0008823049,"about_ca_topic_score_gemma":0.001371159,"teacher_disagreement_score":0.035796087,"about_ca_system_score_codex":0.001609925,"about_ca_system_score_gemma":0.0007268483,"threshold_uncertainty_score":0.119749784},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006206595,0.34541503,0.22209455,0.055671547,0.019365354,0.0001376808,0.0005507253,0.00042252804,0.35013598],"genre_scores_gemma":[0.20960438,0.3510259,0.17652838,0.03711391,0.043552198,0.00076936174,0.00112643,0.0005794211,0.17969996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980605,0.0005402084,0.00014960843,0.00036821506,0.0007372678,0.00014420891],"domain_scores_gemma":[0.99605054,0.0029871908,0.00018747628,0.00023215805,0.00044129277,0.000101284415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001790005,0.00080934435,0.0007700484,0.003049251,0.0011556669,0.006572355,0.0013638404,0.0030739885,0.012511213],"category_scores_gemma":[0.003910557,0.00042659912,0.001098458,0.0028669296,0.007138455,0.00952356,0.002035711,0.007517199,0.0026143007],"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.000021665108,0.000022921464,0.00020793792,0.0005911278,0.00001441947,0.000096515025,0.00040692455,0.00071578706,0.000760819,0.9353256,0.018980969,0.04285526],"study_design_scores_gemma":[0.0000054199704,0.000037567625,0.00056269165,0.0005723745,0.000012018997,0.000422662,0.00023868484,0.0013140305,0.0006171575,0.36768752,0.62850016,0.000029664805],"about_ca_topic_score_codex":0.0020384165,"about_ca_topic_score_gemma":0.0013994324,"teacher_disagreement_score":0.012511213,"about_ca_system_score_codex":0.0026327204,"about_ca_system_score_gemma":0.0014145687,"threshold_uncertainty_score":0.041854203},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048484476,0.15065461,0.13553858,0.008640844,0.007374741,0.00008915559,0.00061223115,0.00065120193,0.69159013],"genre_scores_gemma":[0.19036832,0.14751557,0.11890395,0.00584019,0.01602268,0.0008837008,0.001756189,0.0008877897,0.5178217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999485,0.00013740321,0.000027927324,0.0001061459,0.00020799508,0.00003554527],"domain_scores_gemma":[0.9994809,0.0003066378,0.00002638858,0.00008018793,0.00007343876,0.000032539185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005299404,0.0013795925,0.0018625516,0.0016842048,0.0010542043,0.0043436354,0.00083702616,0.0008733548,0.019643513],"category_scores_gemma":[0.0016932971,0.00044702238,0.00063991616,0.0037029139,0.0032868206,0.0035243512,0.0012080438,0.0046966374,0.007254672],"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.000014331963,0.000021948503,0.000097184486,0.00033529624,0.000017270182,0.000024448129,0.00013272946,0.00087011827,0.00034496118,0.86820614,0.049650703,0.080284834],"study_design_scores_gemma":[0.000014341435,0.000013382549,0.00024028875,0.00008847185,0.0000091160755,0.00009375651,0.000048544865,0.0019471725,0.00012149807,0.83380836,0.16360873,0.000006397795],"about_ca_topic_score_codex":0.00092071394,"about_ca_topic_score_gemma":0.0008782617,"teacher_disagreement_score":0.019643513,"about_ca_system_score_codex":0.00221244,"about_ca_system_score_gemma":0.0009991918,"threshold_uncertainty_score":0.06571412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037389514,0.011385899,0.3415319,0.04322671,0.0031317475,0.00008188566,0.00030595766,0.00063360727,0.5959634],"genre_scores_gemma":[0.481013,0.01342282,0.19002448,0.02929064,0.011426274,0.00055305194,0.000913461,0.0018604681,0.27149576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943551,0.0021877708,0.00016335989,0.0010060411,0.001899161,0.0003886022],"domain_scores_gemma":[0.994528,0.0037582496,0.00016520267,0.00086927233,0.000538829,0.0001405235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062736473,0.0006651915,0.00074790284,0.002170369,0.0035207826,0.005486219,0.0027226238,0.0030101284,0.01559753],"category_scores_gemma":[0.009381297,0.0007275282,0.0014157541,0.0011923255,0.023011714,0.013111106,0.005061352,0.009781607,0.0063380534],"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.0000022794823,0.0000019032295,0.000011454313,0.000010193128,0.0000010816078,0.000005902042,0.00009676497,0.000076771394,0.000024617562,0.9957202,0.0020903726,0.001958424],"study_design_scores_gemma":[0.000005180557,0.0000072105818,0.0000335886,0.00006016229,0.0000025409497,0.000033019358,0.000046134188,0.0005247118,0.00020234585,0.8990252,0.10005352,0.0000065508425],"about_ca_topic_score_codex":0.0016434477,"about_ca_topic_score_gemma":0.001487759,"teacher_disagreement_score":0.01559753,"about_ca_system_score_codex":0.005146843,"about_ca_system_score_gemma":0.0024131415,"threshold_uncertainty_score":0.05217892},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006450988,0.040725797,0.07029268,0.025058948,0.1381907,0.0006754503,0.018979032,0.0047123483,0.6949141],"genre_scores_gemma":[0.025649978,0.044610616,0.021052716,0.0029799363,0.014836216,0.000266824,0.025977645,0.0014989049,0.8631273],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879944,0.00011518957,0.000102997205,0.00010274919,0.0007744688,0.000105057086],"domain_scores_gemma":[0.99621767,0.0007535835,0.00012207354,0.00052038906,0.0020081222,0.00037816243],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016678767,0.00093861803,0.001722564,0.0034691424,0.0007346303,0.0043465625,0.000999238,0.0015645094,0.3654631],"category_scores_gemma":[0.0052619353,0.00040529724,0.0006101883,0.0037389142,0.00045012071,0.0029327841,0.0014831235,0.0018912554,0.19136092],"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.00010239616,0.000093731214,0.00040048908,0.00044626943,0.000020413267,0.00007069072,0.000021543463,0.00048610262,0.001337969,0.009179604,0.7214978,0.2663431],"study_design_scores_gemma":[0.00002705155,0.00004831842,0.0010026754,0.0002632935,0.000039777653,0.00019832782,0.00004553034,0.003405147,0.0009764644,0.008679233,0.9852909,0.000023241144],"about_ca_topic_score_codex":0.0011948028,"about_ca_topic_score_gemma":0.002239358,"teacher_disagreement_score":0.63453686,"about_ca_system_score_codex":0.00064436265,"about_ca_system_score_gemma":0.0020690372,"threshold_uncertainty_score":0.90508986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006208729,0.00025779216,0.98133135,0.00053434656,0.00013407746,0.00018428531,0.0001258152,0.00083586026,0.010387723],"genre_scores_gemma":[0.18676922,0.00034303614,0.7946444,0.00039459122,0.0001034924,0.0006698462,0.0004336263,0.00029792555,0.016343802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920803,0.00014646002,0.000044596316,0.00021975122,0.0002559587,0.00012526373],"domain_scores_gemma":[0.9995202,0.00021910574,0.000043504682,0.000057865655,0.00012547434,0.000033873952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080631213,0.00097430695,0.0012202099,0.0007681718,0.0010814535,0.0010921385,0.0016500854,0.0014500328,0.015600693],"category_scores_gemma":[0.0020993883,0.000514938,0.00090409606,0.0012454344,0.0009311984,0.00135495,0.0011384913,0.0016863092,0.0026882999],"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.00025787594,0.00018110612,0.0002975775,0.00022474628,0.00006979906,0.00013251156,0.00015105511,0.6413852,0.0050569847,0.095204376,0.019338608,0.23770006],"study_design_scores_gemma":[0.00008427984,0.00007596504,0.00008384845,0.000015525175,0.000010530516,0.000040904517,0.000018746267,0.9556546,0.0009727189,0.038756303,0.0042717834,0.000014770817],"about_ca_topic_score_codex":0.004316413,"about_ca_topic_score_gemma":0.0065704216,"teacher_disagreement_score":0.015600693,"about_ca_system_score_codex":0.0016236037,"about_ca_system_score_gemma":0.0026822062,"threshold_uncertainty_score":0.05218947},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06275329,0.013582581,0.053078797,0.107057914,0.0012936632,0.00002928819,0.00017412331,0.00030786532,0.7617224],"genre_scores_gemma":[0.9639199,0.0023223243,0.002890608,0.0066956524,0.000981194,0.000047090547,0.000064942265,0.00016860622,0.022909734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469227,0.0026376543,0.00016646016,0.00087130093,0.001011925,0.0006203929],"domain_scores_gemma":[0.9952743,0.0025824814,0.00039329592,0.00091496954,0.00045014435,0.0003847534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030270133,0.00037760445,0.00035930806,0.00084601896,0.0031188324,0.005295604,0.0009002168,0.0027279933,0.0049487017],"category_scores_gemma":[0.0069438154,0.00025112118,0.00048830075,0.0006933526,0.028762067,0.007403578,0.0044572614,0.005096776,0.0010240844],"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.000007516177,0.0000034442235,0.00013666625,0.00001784863,0.0000023362595,0.00004354606,0.0014141537,0.00010476585,0.000080365535,0.9941744,0.0020796936,0.0019353288],"study_design_scores_gemma":[0.0000071434392,0.000007250384,0.00030854833,0.000043787255,0.0000022105673,0.000067049696,0.00052229356,0.00035282195,0.00010237312,0.9514002,0.04717837,0.000007901155],"about_ca_topic_score_codex":0.0032330593,"about_ca_topic_score_gemma":0.0014654261,"teacher_disagreement_score":0.005295604,"about_ca_system_score_codex":0.003927869,"about_ca_system_score_gemma":0.002655863,"threshold_uncertainty_score":0.028498828},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030476253,0.00017217785,0.39061928,0.0006318814,0.0003575246,0.0002660755,0.012197702,0.5645267,0.02818113],"genre_scores_gemma":[0.14617886,0.00054238,0.47320879,0.0024414035,0.00027992326,0.0014785812,0.046726145,0.2375107,0.09163331],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992661,0.00010079392,0.00005352808,0.0001750304,0.0002639646,0.00014061408],"domain_scores_gemma":[0.9982134,0.00064704695,0.00011965303,0.00053993834,0.00035331558,0.00012666438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012242828,0.0014507745,0.0009058098,0.0010919606,0.0009769854,0.0013461706,0.0031533153,0.0018997261,0.23452798],"category_scores_gemma":[0.004743063,0.0014058803,0.0011932089,0.0007779641,0.0009272917,0.0038446742,0.0024381403,0.0034388897,0.07962977],"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.00097248505,0.00033675335,0.002143886,0.0010484749,0.00009752494,0.0003116429,0.00028386168,0.0062657623,0.0147863235,0.065520205,0.755711,0.152522],"study_design_scores_gemma":[0.00065751094,0.0001924903,0.003092511,0.00031000498,0.00006532704,0.00075972057,0.00011315933,0.10031849,0.060982842,0.10711497,0.7261383,0.00025470564],"about_ca_topic_score_codex":0.0018800666,"about_ca_topic_score_gemma":0.0024331005,"teacher_disagreement_score":0.23452798,"about_ca_system_score_codex":0.0010795755,"about_ca_system_score_gemma":0.001369137,"threshold_uncertainty_score":0.7845743},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33791342,0.0011039866,0.57513136,0.01684755,0.00059622555,0.00037720348,0.00043199517,0.0002678232,0.067330435],"genre_scores_gemma":[0.9641805,0.00040178664,0.013401384,0.0006434471,0.0004180483,0.0001532549,0.00007137708,0.000020818441,0.020709392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919442,0.005511623,0.0002664685,0.0008262098,0.0007811491,0.0006703798],"domain_scores_gemma":[0.9219209,0.06511778,0.004974941,0.00449014,0.0017680548,0.0017282148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014342024,0.0010030493,0.0021733018,0.0011781994,0.0012578382,0.004393999,0.002565096,0.004309367,0.010897788],"category_scores_gemma":[0.057774737,0.0008836338,0.0009804799,0.0011370314,0.0042418027,0.0048117046,0.0031326164,0.0034862293,0.0012694353],"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.00075356924,0.00016039556,0.0057824263,0.00013690097,0.00023030119,0.0011755317,0.0004333043,0.11845618,0.00048053436,0.84249,0.006015514,0.023885325],"study_design_scores_gemma":[0.00023456238,0.00009907928,0.0007300279,0.000015807636,0.00005330947,0.00026754112,0.00011823074,0.2089445,0.00020202134,0.78798264,0.0013220389,0.000030117328],"about_ca_topic_score_codex":0.0011549152,"about_ca_topic_score_gemma":0.00095009705,"teacher_disagreement_score":0.014342024,"about_ca_system_score_codex":0.0011754956,"about_ca_system_score_gemma":0.0007313755,"threshold_uncertainty_score":0.07584876},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064867903,0.03453466,0.21371916,0.014770798,0.0028033168,0.00012951532,0.0015262694,0.00049043633,0.72553897],"genre_scores_gemma":[0.55125326,0.033636708,0.15286578,0.009335356,0.0063627637,0.0005008587,0.0035085178,0.00046771468,0.24206902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979976,0.00049486477,0.00014516538,0.0005277964,0.0006918552,0.0001427685],"domain_scores_gemma":[0.9985499,0.0006144522,0.00007540137,0.00032032366,0.00033746916,0.000102470294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015768869,0.0007247463,0.000993494,0.002518205,0.0026304903,0.005630169,0.001315314,0.0013178593,0.023559112],"category_scores_gemma":[0.0035427106,0.0003647663,0.0010256979,0.0019517832,0.006475081,0.006501503,0.003055213,0.0035952283,0.0071571176],"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.000002740713,0.0000024525364,0.000041789906,0.00002895873,0.0000035750236,0.00001190063,0.000067590074,0.00012382733,0.00005222359,0.9898642,0.004153113,0.005647516],"study_design_scores_gemma":[0.000003446376,0.000005918366,0.0000829993,0.000037862716,0.0000032826797,0.00007487108,0.00004604073,0.0003779091,0.00012752783,0.8917921,0.10744311,0.000004944395],"about_ca_topic_score_codex":0.0015817145,"about_ca_topic_score_gemma":0.0010444665,"teacher_disagreement_score":0.023559112,"about_ca_system_score_codex":0.0029690738,"about_ca_system_score_gemma":0.0011511857,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06547382,0.048029117,0.68106,0.050719716,0.0020979191,0.0000863109,0.0005500869,0.0003250376,0.15165801],"genre_scores_gemma":[0.896193,0.015099125,0.07138194,0.0017389371,0.00183016,0.00012204168,0.00016502761,0.00008008622,0.01338954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998752,0.0005955626,0.00006307735,0.00018075645,0.00030450552,0.00010404747],"domain_scores_gemma":[0.9966425,0.0024804994,0.00016737495,0.00036966064,0.00022363864,0.00011635783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034851,0.00042547172,0.00089417084,0.001209668,0.0011557956,0.0059943665,0.0011372918,0.0023752046,0.004821588],"category_scores_gemma":[0.0072604506,0.00037684906,0.00063228933,0.0020302895,0.009431094,0.010675526,0.00222971,0.002478037,0.0005551724],"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.000022123271,0.000012430498,0.00010709328,0.000071408664,0.00001174287,0.000028699375,0.000128509,0.0023324373,0.00014605552,0.98760265,0.0009443093,0.008592551],"study_design_scores_gemma":[0.0000039150013,0.0000027099602,0.000030200741,0.000011994834,0.0000036610377,0.000009734402,0.00002317113,0.0060891653,0.00007567006,0.99240935,0.0013356974,0.000004817835],"about_ca_topic_score_codex":0.0027585104,"about_ca_topic_score_gemma":0.0018230686,"teacher_disagreement_score":0.0059943665,"about_ca_system_score_codex":0.0018255605,"about_ca_system_score_gemma":0.0013013211,"threshold_uncertainty_score":0.016129851},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013117465,0.37734097,0.105662845,0.109234,0.0058745407,0.000089517634,0.00038035345,0.0002733651,0.38802698],"genre_scores_gemma":[0.6696807,0.18748342,0.06618201,0.008714329,0.015825605,0.00047017616,0.00036801762,0.00015166916,0.05112414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910575,0.0004092377,0.000042905885,0.00013073625,0.00024075677,0.00007067626],"domain_scores_gemma":[0.996716,0.0024885763,0.00012521949,0.0001926752,0.00034556375,0.00013195489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020315226,0.0006535206,0.0011692017,0.001519303,0.0013566978,0.0063298605,0.00082664826,0.0023784935,0.0075284056],"category_scores_gemma":[0.004544045,0.00025519906,0.00040828084,0.0017175106,0.009983589,0.0072953845,0.0014537978,0.0043415762,0.00089804205],"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.000003288352,0.0000070658093,0.000045927154,0.00007068832,0.0000030048109,0.000012007456,0.00009255359,0.00020436037,0.00004421719,0.9906673,0.0032118207,0.005637749],"study_design_scores_gemma":[0.0000055077535,0.0000043463383,0.00010691767,0.000046601286,0.0000021265123,0.000019190482,0.000072116796,0.00061260734,0.000019150953,0.9638799,0.035227966,0.0000035812575],"about_ca_topic_score_codex":0.00277473,"about_ca_topic_score_gemma":0.0017479032,"teacher_disagreement_score":0.0075284056,"about_ca_system_score_codex":0.0035272914,"about_ca_system_score_gemma":0.002367741,"threshold_uncertainty_score":0.025592446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88907015,0.001089383,0.062553294,0.0004099926,0.00011815479,0.00005886232,0.0008759685,0.00040628345,0.04541784],"genre_scores_gemma":[0.97072035,0.0005108878,0.016947035,0.00011897517,0.00016676412,0.00011363099,0.0012227485,0.00006238863,0.010137232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993462,0.00006622631,0.00005295686,0.00022374076,0.00016588008,0.00014493577],"domain_scores_gemma":[0.9984835,0.0005287464,0.00037522803,0.00016983054,0.00015040157,0.00029230103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006148237,0.0007262141,0.00050676975,0.0020851893,0.0014898792,0.0017299084,0.0008071804,0.000611333,0.00617605],"category_scores_gemma":[0.0027334772,0.0003952139,0.00077250064,0.0014079175,0.0016835283,0.0019749205,0.0015885229,0.0012941043,0.00089867803],"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.000582205,0.00012482602,0.00782022,0.00027979215,0.000047653408,0.0014023016,0.0014618123,0.011962763,0.013220247,0.8845628,0.0046538864,0.07388159],"study_design_scores_gemma":[0.00029834936,0.0008077985,0.013749422,0.00036901815,0.000130373,0.0067885485,0.0014621868,0.05878174,0.016401784,0.832575,0.06840549,0.0002301893],"about_ca_topic_score_codex":0.00042898717,"about_ca_topic_score_gemma":0.00033225122,"teacher_disagreement_score":0.00617605,"about_ca_system_score_codex":0.000960378,"about_ca_system_score_gemma":0.00039800454,"threshold_uncertainty_score":0.020660937},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013644373,0.09669549,0.019054517,0.7692119,0.018055832,0.00003486978,0.0002647438,0.00030925308,0.09500894],"genre_scores_gemma":[0.20145954,0.19218282,0.032634813,0.43522072,0.056791663,0.0004346675,0.0005322403,0.0010801611,0.07966334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957743,0.0018488747,0.00023564925,0.000852715,0.0009935161,0.00029485952],"domain_scores_gemma":[0.9898537,0.006149761,0.00056925317,0.0009011142,0.0017085765,0.0008176477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064052413,0.0016479258,0.0011638575,0.0026322762,0.003722964,0.008745988,0.004441328,0.0076343054,0.022674577],"category_scores_gemma":[0.01731273,0.00040008745,0.00095635356,0.001892087,0.041011702,0.030960262,0.0036304991,0.017732901,0.011006353],"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.000050068895,0.00003434022,0.00023165981,0.00047491185,0.000022466678,0.00013320611,0.0020759406,0.00021365978,0.00014659646,0.8488627,0.12733604,0.02041852],"study_design_scores_gemma":[0.000012448399,0.000026588183,0.00022217559,0.000543807,0.000008916752,0.00032353913,0.0016426411,0.00022810795,0.00010858904,0.66604334,0.3308081,0.000031763433],"about_ca_topic_score_codex":0.004561976,"about_ca_topic_score_gemma":0.003265785,"teacher_disagreement_score":0.022674577,"about_ca_system_score_codex":0.0030842682,"about_ca_system_score_gemma":0.0034090253,"threshold_uncertainty_score":0.07585406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1861397,0.00049194955,0.7747847,0.0014973631,0.00028906766,0.00021901132,0.0002288151,0.00043007353,0.035919342],"genre_scores_gemma":[0.95159274,0.00018632467,0.043477632,0.00026752622,0.0001550949,0.00022261664,0.00019490936,0.00006310792,0.0038400362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99305433,0.0020590723,0.0005979968,0.0012344194,0.0023176852,0.0007365152],"domain_scores_gemma":[0.9896818,0.0053677363,0.0011679969,0.0010251238,0.001880472,0.00087690214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003917221,0.0005303409,0.0005787776,0.0016665102,0.0010817611,0.0026378552,0.0011302329,0.0013223075,0.0041135163],"category_scores_gemma":[0.014253667,0.00040185513,0.0015561337,0.00078908616,0.0043325284,0.0046012984,0.0033900847,0.0030786593,0.00035939572],"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.000022383989,0.00003422068,0.00028166312,0.000018483908,0.000009012927,0.000078325116,0.0003583705,0.0023993216,0.0005261587,0.99301237,0.00012678382,0.003132851],"study_design_scores_gemma":[0.000018907329,0.000036379028,0.00025731715,0.000017270573,0.000010460108,0.00006149101,0.00010816438,0.02880509,0.00070811267,0.9680882,0.001875344,0.000013343335],"about_ca_topic_score_codex":0.0017807836,"about_ca_topic_score_gemma":0.0007454079,"teacher_disagreement_score":0.0041135163,"about_ca_system_score_codex":0.0022088827,"about_ca_system_score_gemma":0.0010683679,"threshold_uncertainty_score":0.020716488},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03288594,0.01252113,0.085784614,0.010964155,0.0021732715,0.000061395425,0.0017654381,0.00070228096,0.8531418],"genre_scores_gemma":[0.7520674,0.015739065,0.03175198,0.0029096103,0.0049373074,0.00010252733,0.0026620708,0.0005942534,0.18923575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993655,0.00013643157,0.000025819581,0.00014756751,0.00022411133,0.00010055727],"domain_scores_gemma":[0.99938655,0.0001493023,0.000054833396,0.00010753821,0.0001772111,0.00012466348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005212166,0.00058250374,0.0005099599,0.0014635958,0.00192937,0.0035339042,0.0005822845,0.00057661696,0.024314992],"category_scores_gemma":[0.0012566204,0.0002178936,0.00043096463,0.0010166987,0.0027707245,0.004239213,0.0019990697,0.0019154898,0.005608776],"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.0000055906075,0.0000021789447,0.00006799955,0.000027250462,0.0000033854917,0.000024974612,0.00008363417,0.0002317416,0.00019378512,0.9824488,0.010864977,0.0060456553],"study_design_scores_gemma":[0.000004050113,0.000014375355,0.0004005514,0.000026945361,0.0000056681006,0.0001958636,0.00014472821,0.000930316,0.000349092,0.8265216,0.17139558,0.0000113266315],"about_ca_topic_score_codex":0.0014069579,"about_ca_topic_score_gemma":0.0010292395,"teacher_disagreement_score":0.024314992,"about_ca_system_score_codex":0.0016540792,"about_ca_system_score_gemma":0.0008146274,"threshold_uncertainty_score":0.0813418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9020773,0.00047246917,0.069741435,0.0007101398,0.000032341446,0.0000643843,0.000982362,0.0001884278,0.02573109],"genre_scores_gemma":[0.984539,0.00018508456,0.012064006,0.00006905408,0.000026498907,0.00006973267,0.00042059156,0.000036217363,0.0025898283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861383,0.00017024015,0.000075592834,0.0003462825,0.00033474565,0.00045933813],"domain_scores_gemma":[0.99478924,0.0031236524,0.0005595483,0.00057521457,0.0003427422,0.00060964405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012406376,0.00048536004,0.00089167967,0.0018599249,0.0024948877,0.0046800454,0.0009337843,0.00083978835,0.0047240513],"category_scores_gemma":[0.0059199072,0.00053009856,0.001076593,0.0016854024,0.00412058,0.0051102564,0.0021447784,0.002226855,0.00028948],"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.00019429922,0.000056204783,0.003428158,0.000079118334,0.000020506934,0.00015216622,0.0006057473,0.016733866,0.0035745006,0.96564054,0.0005809672,0.008933989],"study_design_scores_gemma":[0.000059461116,0.00007593539,0.003703548,0.00007890837,0.000041111383,0.00033681525,0.0005548208,0.040809926,0.0054342123,0.9418841,0.006950851,0.000070345595],"about_ca_topic_score_codex":0.0038866578,"about_ca_topic_score_gemma":0.003442317,"teacher_disagreement_score":0.0047240513,"about_ca_system_score_codex":0.0024091846,"about_ca_system_score_gemma":0.0011897559,"threshold_uncertainty_score":0.017479956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115809925,0.02670232,0.30350667,0.007462327,0.0010543764,0.000055213874,0.000120683784,0.00058898504,0.6489284],"genre_scores_gemma":[0.38437134,0.023704857,0.16899459,0.0026994878,0.0006389093,0.00025109784,0.00024407686,0.0004239732,0.4186717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99989593,0.000028206636,0.0000035493626,0.000019867586,0.000039625713,0.000012816179],"domain_scores_gemma":[0.9998228,0.00011621595,0.000008940561,0.000020442832,0.000017870494,0.000013796215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017138319,0.00049783924,0.00022336163,0.0006627249,0.0007157111,0.002381153,0.00057901954,0.00097000145,0.006034978],"category_scores_gemma":[0.000658458,0.00024339547,0.00028813136,0.0006706276,0.0035366658,0.004446298,0.0008595036,0.0015080343,0.0019002706],"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.000010904792,0.0000052145724,0.000048573213,0.00008942369,0.000003640643,0.000056278674,0.0005926623,0.0015859052,0.00069990166,0.9531949,0.010630797,0.033081807],"study_design_scores_gemma":[0.0000046508294,0.0000107863325,0.00013116017,0.00007969854,0.000003526519,0.00015476685,0.00021846138,0.004177795,0.0005415341,0.7590137,0.23565462,0.0000093745275],"about_ca_topic_score_codex":0.001221532,"about_ca_topic_score_gemma":0.0014833807,"teacher_disagreement_score":0.006034978,"about_ca_system_score_codex":0.0010373426,"about_ca_system_score_gemma":0.0004380911,"threshold_uncertainty_score":0.020188987},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69912374,0.002259593,0.24067906,0.0019204203,0.00020406157,0.000073273535,0.00016484705,0.00046443983,0.055110585],"genre_scores_gemma":[0.97914803,0.00037121456,0.015331493,0.00005506651,0.00006785024,0.00003662229,0.00003935426,0.000025954088,0.004924437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997538,0.000070954346,0.000009357623,0.000051424733,0.000045244662,0.00006916114],"domain_scores_gemma":[0.99914134,0.00044027978,0.00014600162,0.00010978632,0.000048091384,0.00011446058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044767096,0.00024032805,0.00029445585,0.0006064553,0.0007950421,0.0010388126,0.0006346923,0.0009281691,0.0048044897],"category_scores_gemma":[0.0020689908,0.00016567994,0.00051458075,0.00044160848,0.001922103,0.0040843287,0.0010074765,0.00058766146,0.00023036962],"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.000028856146,0.0000073804654,0.00022688719,0.000025567833,0.00000478778,0.00008563544,0.00009586096,0.010251425,0.0013926289,0.98591655,0.00026410774,0.001700191],"study_design_scores_gemma":[0.000029706329,0.000075088836,0.0003606341,0.000014456861,0.000012031779,0.00023547346,0.000114916875,0.11960499,0.00159298,0.87153953,0.0064037843,0.000016467511],"about_ca_topic_score_codex":0.00042954326,"about_ca_topic_score_gemma":0.00026521969,"teacher_disagreement_score":0.0048044897,"about_ca_system_score_codex":0.0006222545,"about_ca_system_score_gemma":0.00022292421,"threshold_uncertainty_score":0.01607263},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013639161,0.05728907,0.07260901,0.007978412,0.0020673082,0.000029756078,0.00012410127,0.000257329,0.8460059],"genre_scores_gemma":[0.48111624,0.036953412,0.04218143,0.00196724,0.0037954487,0.00019015078,0.0003184176,0.00030994363,0.43316776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99981993,0.00005875322,0.0000061813985,0.00003126511,0.00006647898,0.000017334276],"domain_scores_gemma":[0.99955076,0.00029911558,0.00001735483,0.000078370445,0.00003729093,0.000017080343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002612643,0.0004114994,0.00042354243,0.0006894663,0.0009145597,0.0023338876,0.0005985721,0.0006630502,0.011524999],"category_scores_gemma":[0.0011936448,0.00024294986,0.00033142488,0.0010780586,0.0040202015,0.0044518313,0.000964877,0.0021095031,0.0016165413],"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.000003988708,0.0000033025574,0.000020827867,0.000038010734,0.0000014046045,0.000010087241,0.00006996667,0.00027611724,0.00010112521,0.98527133,0.0052068103,0.008996965],"study_design_scores_gemma":[0.0000015887987,0.0000015897427,0.000041628984,0.000016415719,0.0000010095677,0.00002804578,0.000016787564,0.00059628836,0.000056596953,0.9654159,0.033822414,0.0000016346194],"about_ca_topic_score_codex":0.00083655806,"about_ca_topic_score_gemma":0.0012870872,"teacher_disagreement_score":0.011524999,"about_ca_system_score_codex":0.0013770125,"about_ca_system_score_gemma":0.0004901425,"threshold_uncertainty_score":0.038554966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046476785,0.0016462049,0.89857256,0.011071371,0.00024053488,0.00007993242,0.00011172787,0.00025734626,0.041543588],"genre_scores_gemma":[0.8953008,0.00064950844,0.09937632,0.00088300835,0.00028201306,0.00029836412,0.00010563223,0.000169988,0.0029343714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99431264,0.0025942829,0.0003785893,0.0012067788,0.00109319,0.00041452138],"domain_scores_gemma":[0.9861,0.008547047,0.0009875364,0.0030051281,0.0008209247,0.00053935114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073599536,0.0007408356,0.0012437245,0.0016643086,0.002117101,0.004946251,0.0022919048,0.003378778,0.0036670764],"category_scores_gemma":[0.016123535,0.00065283175,0.002046655,0.001117857,0.023577247,0.01893446,0.005022544,0.0062792236,0.000550328],"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.000006350274,0.000004391447,0.000086483364,0.00001411611,0.0000042413476,0.000011769506,0.00014769289,0.00053907576,0.00008067088,0.99788505,0.00006979459,0.0011503897],"study_design_scores_gemma":[0.000004834509,0.000008355378,0.000048762595,0.000011006572,0.000002803154,0.000017625829,0.000033323424,0.002135014,0.00014773036,0.9962857,0.00129904,0.0000058902083],"about_ca_topic_score_codex":0.00052743015,"about_ca_topic_score_gemma":0.00041440935,"teacher_disagreement_score":0.0073599536,"about_ca_system_score_codex":0.0018837363,"about_ca_system_score_gemma":0.0016668974,"threshold_uncertainty_score":0.03892362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05317648,0.0018561744,0.46931565,0.018900659,0.000830063,0.00026583718,0.00015756703,0.00173651,0.45376107],"genre_scores_gemma":[0.76457304,0.0011489323,0.20309196,0.0019114859,0.0002736417,0.0004767847,0.00018272537,0.00069010555,0.027651357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776816,0.0008149714,0.0001338514,0.0003968894,0.00061111606,0.00027502477],"domain_scores_gemma":[0.99412304,0.0017459034,0.00039621087,0.0027804924,0.0005353133,0.00041909533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003944922,0.0005192551,0.00064623746,0.0011465887,0.0024354127,0.0072071603,0.0014182094,0.0018525982,0.008101761],"category_scores_gemma":[0.0082800165,0.00045347222,0.0011122831,0.00071422267,0.016794942,0.012287937,0.006989301,0.0052601537,0.0023686285],"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.000011271391,0.0000128670545,0.00027081874,0.000055692035,0.000006578231,0.00010534188,0.0014054133,0.0003247904,0.00061979913,0.98703194,0.0007467486,0.009408771],"study_design_scores_gemma":[0.000011620425,0.00003768646,0.00047563898,0.00008578817,0.000013164186,0.00036708853,0.00092892273,0.0019076742,0.001974876,0.9300611,0.064113356,0.000023094131],"about_ca_topic_score_codex":0.0004520611,"about_ca_topic_score_gemma":0.000493228,"teacher_disagreement_score":0.008101761,"about_ca_system_score_codex":0.0014101295,"about_ca_system_score_gemma":0.0016167908,"threshold_uncertainty_score":0.027103066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50474215,0.0011829581,0.31738162,0.009637447,0.0002875057,0.00011950588,0.0018216295,0.0014469847,0.16338019],"genre_scores_gemma":[0.96329105,0.00024458562,0.012563244,0.00047046164,0.00008874311,0.000060323007,0.00043733697,0.00020712586,0.022637075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99862874,0.00035935373,0.00007447808,0.0002713001,0.0003700231,0.00029614073],"domain_scores_gemma":[0.9852335,0.009859218,0.0011430318,0.002118323,0.0010357548,0.0006102088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001876507,0.00025929516,0.0007839406,0.0012939736,0.0010855757,0.0031666742,0.0012084905,0.0012911642,0.031105408],"category_scores_gemma":[0.024297532,0.00029321763,0.00039376077,0.0017918881,0.0018951459,0.008156418,0.00274226,0.0021612048,0.0024594446],"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.0004658038,0.00012368991,0.0053901947,0.00017552306,0.000038810453,0.00015376702,0.000357629,0.011061827,0.0026050142,0.90682685,0.011265693,0.06153535],"study_design_scores_gemma":[0.00006802901,0.0001003729,0.002335599,0.00005581108,0.000030459118,0.0002463151,0.0002921401,0.13543242,0.0046750284,0.8492047,0.0075196982,0.000039411352],"about_ca_topic_score_codex":0.0021367732,"about_ca_topic_score_gemma":0.002842634,"teacher_disagreement_score":0.031105408,"about_ca_system_score_codex":0.0012825149,"about_ca_system_score_gemma":0.0013953927,"threshold_uncertainty_score":0.10405791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07862357,0.012388076,0.34027237,0.036088422,0.0015882654,0.00007429323,0.000587892,0.000555109,0.52982193],"genre_scores_gemma":[0.94941646,0.0017612957,0.019243466,0.001478206,0.0013687451,0.00012088185,0.00012215872,0.00013315341,0.026355635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998637,0.0004947528,0.000058375095,0.00035300653,0.000358142,0.000098813434],"domain_scores_gemma":[0.9950772,0.0036772392,0.00025008313,0.0004978083,0.0003038264,0.0001939111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019452308,0.0004011713,0.0005373606,0.0017122485,0.0020718214,0.0055712746,0.00089521037,0.0014617395,0.008253855],"category_scores_gemma":[0.010380116,0.00041656557,0.00047130304,0.001362873,0.016143456,0.015433267,0.0025423141,0.0032665983,0.0011441245],"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.0000074578215,0.0000018833609,0.000105860694,0.000010736928,0.0000022740235,0.00001656769,0.0001483723,0.00020572814,0.00004428905,0.99559104,0.0009157379,0.0029500423],"study_design_scores_gemma":[0.000003007079,0.0000026244597,0.00009863467,0.0000072127336,0.0000013271808,0.00003074322,0.000031309093,0.0008660442,0.00003806965,0.99556965,0.0033476194,0.000003819754],"about_ca_topic_score_codex":0.0011306066,"about_ca_topic_score_gemma":0.0007089934,"teacher_disagreement_score":0.008253855,"about_ca_system_score_codex":0.002099887,"about_ca_system_score_gemma":0.0007745008,"threshold_uncertainty_score":0.027611852},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55134475,0.0015202541,0.36580232,0.0025447924,0.00028983073,0.0001397583,0.0008682704,0.00062434224,0.076865606],"genre_scores_gemma":[0.9786249,0.00025613364,0.014470454,0.00017899847,0.00010517119,0.00006823163,0.00026443132,0.00005795274,0.005973667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979234,0.00043793282,0.00016436426,0.0005054406,0.00058604684,0.00038279925],"domain_scores_gemma":[0.9912684,0.0048030466,0.00070710114,0.0011500344,0.0011826925,0.0008885997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013743221,0.00036062615,0.00041750734,0.0015671804,0.0011240216,0.0024140326,0.00070002634,0.00067588984,0.0062907008],"category_scores_gemma":[0.0062464224,0.000382697,0.00097022136,0.001027681,0.004172261,0.007533859,0.0033669712,0.0023649333,0.00058416335],"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.00006248851,0.000013162114,0.0016465931,0.000084334984,0.0000123065465,0.00006508419,0.0007994471,0.0017744369,0.0023942336,0.9865687,0.00050584273,0.006073463],"study_design_scores_gemma":[0.000022557135,0.00006653105,0.0020326395,0.000038951453,0.000026382879,0.0001988206,0.00050626614,0.00426317,0.0028641063,0.9777689,0.0121750645,0.000036518573],"about_ca_topic_score_codex":0.00057456683,"about_ca_topic_score_gemma":0.0008574578,"teacher_disagreement_score":0.0062907008,"about_ca_system_score_codex":0.0011562158,"about_ca_system_score_gemma":0.0005305535,"threshold_uncertainty_score":0.021044493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3424093,0.0008391784,0.5363487,0.0013827593,0.0001970384,0.00011776943,0.00034324935,0.0011223431,0.11723977],"genre_scores_gemma":[0.9313222,0.0001766459,0.052582804,0.00024955196,0.000069504975,0.00006440881,0.00028706578,0.00016059515,0.015087115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984549,0.0003431624,0.000098734476,0.00030768447,0.00056144095,0.00023399164],"domain_scores_gemma":[0.9981029,0.0008005828,0.00011453982,0.00054842094,0.00028928308,0.0001442596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011835464,0.00040340194,0.00057367596,0.0010340194,0.0015501059,0.00219166,0.00091318216,0.00047425987,0.0036033753],"category_scores_gemma":[0.0031351831,0.0003977347,0.0011735931,0.00072821457,0.0032876625,0.0033031995,0.004463235,0.0033627527,0.0006330648],"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.000069177535,0.00002973502,0.00050527725,0.000058256108,0.000013102257,0.00013064033,0.00062625366,0.0030050888,0.0017389931,0.98304445,0.00066305295,0.010115955],"study_design_scores_gemma":[0.000027369919,0.00006980154,0.00041765976,0.000042484524,0.000021472531,0.00016507259,0.00039464512,0.011730903,0.007837269,0.96098596,0.018283816,0.000023656396],"about_ca_topic_score_codex":0.001391282,"about_ca_topic_score_gemma":0.0015346132,"teacher_disagreement_score":0.0036033753,"about_ca_system_score_codex":0.0017265963,"about_ca_system_score_gemma":0.00073330867,"threshold_uncertainty_score":0.012527406},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063124937,0.16021483,0.27966073,0.019059503,0.004585404,0.00007161982,0.0005528999,0.00079024973,0.5287522],"genre_scores_gemma":[0.24446118,0.095251665,0.1692179,0.00514266,0.012169192,0.00029347028,0.0012583329,0.0006266676,0.47157893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999684,0.00009243827,0.000010508711,0.00006816614,0.00012579099,0.000019064895],"domain_scores_gemma":[0.99942136,0.00037429325,0.000023371173,0.000085473126,0.00006714136,0.000028366609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005322603,0.0006324415,0.0006108874,0.0011087175,0.0009293841,0.002417114,0.00070554845,0.0008063625,0.012615549],"category_scores_gemma":[0.002005029,0.00040302525,0.00033231048,0.0017576881,0.0028120684,0.0033484655,0.0011033524,0.0026052126,0.0045191315],"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.0000101365,0.000017962846,0.00012945861,0.00014864233,0.000011076366,0.000022180393,0.0001349043,0.0018484471,0.0002523028,0.8526277,0.050784603,0.094012626],"study_design_scores_gemma":[0.0000031742209,0.0000069305247,0.000103044695,0.000060466435,0.0000036963393,0.000032699456,0.000020729534,0.002186821,0.00015531755,0.89799577,0.099426694,0.0000045601323],"about_ca_topic_score_codex":0.0010950597,"about_ca_topic_score_gemma":0.0017235711,"teacher_disagreement_score":0.012615549,"about_ca_system_score_codex":0.0013621093,"about_ca_system_score_gemma":0.00092499744,"threshold_uncertainty_score":0.042203248},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018311738,0.07894617,0.11386408,0.0071847825,0.0059044636,0.000082430124,0.0003046184,0.0007830891,0.7910992],"genre_scores_gemma":[0.07457176,0.070678696,0.07745312,0.0034326478,0.01052649,0.00036917746,0.0007841696,0.00076071767,0.7614233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996051,0.00011527391,0.000016584972,0.000055913886,0.00018432387,0.000022773585],"domain_scores_gemma":[0.9995449,0.00022293619,0.000021295096,0.000102386904,0.000073219315,0.000035215173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235825,0.00079037645,0.0010483384,0.0015833051,0.0010502597,0.0035279316,0.0007086155,0.00070219114,0.03320654],"category_scores_gemma":[0.0012946819,0.0004792561,0.0004977588,0.0028348863,0.0026278046,0.004332304,0.0012450017,0.0030431356,0.015729534],"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.000004925849,0.000011954807,0.000032995093,0.00014336134,0.000007791994,0.000014116275,0.00009245067,0.00058344007,0.00024327746,0.88403356,0.06954246,0.045289613],"study_design_scores_gemma":[0.000004166889,0.00000543945,0.00008129609,0.00005622603,0.000004080605,0.00005170018,0.000027990878,0.0013662529,0.00012897814,0.72762114,0.27064776,0.000004885918],"about_ca_topic_score_codex":0.00078241405,"about_ca_topic_score_gemma":0.00105874,"teacher_disagreement_score":0.03320654,"about_ca_system_score_codex":0.0013906778,"about_ca_system_score_gemma":0.0010749825,"threshold_uncertainty_score":0.111086965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60769534,0.00049961027,0.32972723,0.0022451063,0.00009267377,0.00012039103,0.0002991112,0.00032503845,0.058995526],"genre_scores_gemma":[0.9717541,0.0001517995,0.0203547,0.00017004741,0.00005337121,0.00010788233,0.00016378037,0.000047939793,0.0071962997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993144,0.00018634179,0.000035985504,0.00019355537,0.00014271236,0.00012704825],"domain_scores_gemma":[0.99816245,0.0009939888,0.00020179803,0.0002545748,0.00018409577,0.00020307994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007050753,0.0003948836,0.00056789943,0.00080261263,0.0011719664,0.0014267932,0.0010353309,0.00058888993,0.004030475],"category_scores_gemma":[0.0028541866,0.00020529816,0.000773438,0.0006084609,0.0035009426,0.0031964642,0.0017970153,0.0015475544,0.0004468232],"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.000020908234,0.00001896752,0.0003167648,0.0000239386,0.0000055613095,0.000038446226,0.0002749726,0.0014782257,0.00075567985,0.99371535,0.00040781774,0.002943242],"study_design_scores_gemma":[0.000019220588,0.000019307081,0.00019057131,0.000005308369,0.000004780902,0.00004556832,0.00009348969,0.008186934,0.00082332623,0.9890182,0.0015856753,0.000007680763],"about_ca_topic_score_codex":0.001519535,"about_ca_topic_score_gemma":0.000929628,"teacher_disagreement_score":0.004030475,"about_ca_system_score_codex":0.0013786553,"about_ca_system_score_gemma":0.0006361303,"threshold_uncertainty_score":0.013483226},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017376225,0.0044137165,0.13369407,0.0014100367,0.0012288932,0.00009715761,0.0013539417,0.0013982452,0.8390277],"genre_scores_gemma":[0.2812368,0.00572905,0.11456785,0.0012695753,0.0010595394,0.00014709917,0.003500215,0.001237531,0.5912523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979156,0.000024416433,0.0000115853945,0.000061177016,0.000075642296,0.00003560673],"domain_scores_gemma":[0.99966955,0.00009697567,0.00002031552,0.00008807458,0.00007587168,0.000049213962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026837588,0.00040756224,0.00047627636,0.0011861642,0.0012891496,0.002018062,0.00064371474,0.0004436399,0.049493026],"category_scores_gemma":[0.001167747,0.00032497512,0.0004640894,0.0016411351,0.00082856184,0.002908268,0.0011247076,0.0017254231,0.011101159],"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.00004178177,0.000022877932,0.0001668608,0.00009695134,0.000009132005,0.00005815891,0.000105736064,0.000997323,0.0013982946,0.8382459,0.037853595,0.12100335],"study_design_scores_gemma":[0.000009159401,0.000012206615,0.0002489488,0.000049560706,0.0000118640255,0.00025133215,0.000042598567,0.00273947,0.0010020526,0.7930663,0.20255835,0.000008110022],"about_ca_topic_score_codex":0.0011987534,"about_ca_topic_score_gemma":0.0024099273,"teacher_disagreement_score":0.049493026,"about_ca_system_score_codex":0.0008468533,"about_ca_system_score_gemma":0.0005095005,"threshold_uncertainty_score":0.16557068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000923756,0.0365003,0.023211233,0.025026336,0.0068588466,0.000031915642,0.00024028035,0.00035398136,0.9068533],"genre_scores_gemma":[0.033671692,0.025165446,0.021298982,0.008764975,0.009351875,0.00009788144,0.00031551046,0.0005372514,0.9007963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996854,0.00007914785,0.000011259562,0.000044531287,0.00015643548,0.000023215896],"domain_scores_gemma":[0.99932253,0.0003576698,0.000017793713,0.00008214527,0.00012494627,0.00009496133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020737,0.00063091115,0.00061469135,0.0017646537,0.0018887311,0.0054962914,0.0006958367,0.00092634995,0.04121759],"category_scores_gemma":[0.0019668674,0.00031342218,0.00039314094,0.0017235909,0.0043268837,0.0059405817,0.0014643798,0.0044983053,0.012524204],"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.000009872262,0.0000140127,0.000039324594,0.00005995758,0.0000033265499,0.0000144238375,0.00012009514,0.00020547041,0.00015487506,0.78193706,0.18031314,0.03712854],"study_design_scores_gemma":[0.000004942532,0.0000054105103,0.000070044625,0.000049976305,0.0000015030391,0.000032434375,0.00006781613,0.00041803563,0.000060630016,0.39090642,0.60837847,0.0000042868796],"about_ca_topic_score_codex":0.0019843243,"about_ca_topic_score_gemma":0.0032403849,"teacher_disagreement_score":0.04121759,"about_ca_system_score_codex":0.0025321445,"about_ca_system_score_gemma":0.001537592,"threshold_uncertainty_score":0.13788658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93242985,0.00014350317,0.045930848,0.0006689859,0.00004753219,0.000025403404,0.00011050954,0.00020154988,0.020441778],"genre_scores_gemma":[0.99433964,0.00005176237,0.0037644857,0.000069020665,0.000036431742,0.000026654412,0.00008852799,0.000013479179,0.0016100543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987118,0.0002291465,0.00010281055,0.00031880903,0.0003691727,0.0002681824],"domain_scores_gemma":[0.996591,0.0022608635,0.00024941788,0.0003552261,0.00026012637,0.00028335454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011840493,0.00024237909,0.00058574876,0.00082291156,0.0009096174,0.002631778,0.0006916361,0.00057298027,0.0031371969],"category_scores_gemma":[0.004410036,0.00030295088,0.00043516842,0.00046418383,0.0036311373,0.0059251487,0.0018773145,0.0017902137,0.00029429814],"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.00032308596,0.000094088944,0.0018646081,0.000051016716,0.000012089737,0.00039981757,0.0007621212,0.0019097164,0.008598941,0.9719758,0.0005376508,0.01347097],"study_design_scores_gemma":[0.00005335259,0.0001009501,0.0011198252,0.000025569036,0.000017872242,0.00030917962,0.00037882637,0.013136364,0.013185401,0.9687349,0.0029138904,0.00002396607],"about_ca_topic_score_codex":0.00045401722,"about_ca_topic_score_gemma":0.00031418924,"teacher_disagreement_score":0.0031371969,"about_ca_system_score_codex":0.0010297219,"about_ca_system_score_gemma":0.00051463494,"threshold_uncertainty_score":0.010495007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46936864,0.0021159307,0.40904248,0.0015467317,0.00059701724,0.000087245564,0.00020676761,0.00029679434,0.116738394],"genre_scores_gemma":[0.9452667,0.0005818814,0.04144091,0.00029326268,0.00032638578,0.00009911978,0.00014845977,0.00004949629,0.011793835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983998,0.00025132578,0.00013543844,0.00026938133,0.00064813136,0.0002958908],"domain_scores_gemma":[0.9961599,0.0017678938,0.00061930786,0.0004858681,0.000588352,0.00037877428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011801617,0.00071907166,0.00063574663,0.002787839,0.001179579,0.0031129525,0.0010640449,0.0006309713,0.0065246066],"category_scores_gemma":[0.0067466637,0.00029801755,0.0007966609,0.0015781583,0.0033754748,0.005122086,0.003254175,0.0020361391,0.0006056158],"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.000050137853,0.000023647966,0.0009948672,0.0000756325,0.000012602629,0.00014701775,0.0003940702,0.0014478677,0.0026591662,0.9778488,0.0005015504,0.015844692],"study_design_scores_gemma":[0.000011251884,0.00007414539,0.0012511064,0.00004810811,0.000039177245,0.0008116355,0.00034913703,0.010955597,0.0087841,0.96815497,0.009487837,0.00003304061],"about_ca_topic_score_codex":0.00022612046,"about_ca_topic_score_gemma":0.00027310362,"teacher_disagreement_score":0.0065246066,"about_ca_system_score_codex":0.00082051946,"about_ca_system_score_gemma":0.00044943558,"threshold_uncertainty_score":0.021826923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41708755,0.0010498025,0.5392922,0.0013426105,0.00008783914,0.00009141738,0.00085855386,0.0008280521,0.039361883],"genre_scores_gemma":[0.88412964,0.00043324684,0.09965181,0.000307697,0.00007363075,0.0003062128,0.0011498546,0.00020959611,0.013738257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658704,0.00090051506,0.0002804759,0.00092464633,0.00089219166,0.00041508776],"domain_scores_gemma":[0.98955053,0.0066731176,0.000695687,0.001691446,0.0010217831,0.0003674119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002581432,0.000386348,0.0006864831,0.0015649594,0.0023260168,0.0023207776,0.001141793,0.0008007926,0.004523544],"category_scores_gemma":[0.012613327,0.0006455548,0.0016620931,0.0013822028,0.003119056,0.00765704,0.0023953982,0.002422946,0.00052636815],"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.0000707628,0.00002744066,0.001272376,0.00007194723,0.000018932473,0.00015385382,0.00093029876,0.00560431,0.0023021812,0.97140235,0.00087278953,0.017272731],"study_design_scores_gemma":[0.00003698764,0.000040699135,0.00089638453,0.000069397676,0.000021253365,0.00032568158,0.00027907398,0.018165017,0.004848171,0.96235377,0.012919471,0.000044076358],"about_ca_topic_score_codex":0.0012982548,"about_ca_topic_score_gemma":0.00087038276,"teacher_disagreement_score":0.004523544,"about_ca_system_score_codex":0.0034335682,"about_ca_system_score_gemma":0.00094010914,"threshold_uncertainty_score":0.024912417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22800474,0.002298509,0.46418417,0.052601777,0.003809901,0.00016048513,0.0015684639,0.0013833405,0.24598859],"genre_scores_gemma":[0.89997107,0.00080793904,0.06064087,0.0015160773,0.0003279601,0.00008766365,0.00038485441,0.00032742196,0.035936177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986143,0.0004311202,0.000076445576,0.00037042273,0.0003191192,0.00018856226],"domain_scores_gemma":[0.9943234,0.0032062347,0.00050038303,0.0007489397,0.0009283025,0.00029276474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002875802,0.0005835195,0.00061090547,0.0009098411,0.00156998,0.0045277053,0.0009613841,0.0019692436,0.018524822],"category_scores_gemma":[0.034834106,0.00034620508,0.00058913435,0.00074580935,0.0024898078,0.007672719,0.0010592832,0.001956841,0.004861349],"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.00082123297,0.00014866913,0.008902807,0.00022626268,0.000089947185,0.00014793439,0.0005640011,0.016116554,0.0021776627,0.814754,0.03256333,0.12348747],"study_design_scores_gemma":[0.000073522155,0.00019347965,0.0028004814,0.00011775908,0.000056810488,0.00042616704,0.0011696415,0.07176254,0.0055923136,0.8745257,0.04313805,0.00014345905],"about_ca_topic_score_codex":0.0020790999,"about_ca_topic_score_gemma":0.0030003993,"teacher_disagreement_score":0.018524822,"about_ca_system_score_codex":0.0017166564,"about_ca_system_score_gemma":0.0008928967,"threshold_uncertainty_score":0.061971724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029808488,0.029410724,0.030017087,0.020925703,0.0018143888,0.000042632586,0.0001293952,0.00051863823,0.91416067],"genre_scores_gemma":[0.17734069,0.036382932,0.023839075,0.007131209,0.0027082458,0.00017596198,0.00032492055,0.0006100659,0.75148684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991843,0.00026829183,0.000033582968,0.00017227414,0.00026014206,0.00008137623],"domain_scores_gemma":[0.9991702,0.00040765258,0.000028133043,0.00019330939,0.00014538722,0.000055387292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005770928,0.00075214193,0.00043141638,0.0010812759,0.0017208862,0.0071755266,0.0009851594,0.0019836929,0.034981865],"category_scores_gemma":[0.0025278172,0.00042813746,0.00033696357,0.0013240398,0.0073131486,0.010521146,0.0027977484,0.0032851622,0.010048687],"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.000013209234,0.000008306105,0.000054294327,0.00010401784,0.000005434268,0.000039210405,0.0008983225,0.00047138834,0.0002563141,0.9141672,0.050329443,0.033652842],"study_design_scores_gemma":[0.0000057097673,0.0000064056585,0.000058699476,0.00014745301,0.0000038012406,0.00006756082,0.00025103922,0.00060363207,0.0001917972,0.26723158,0.73142695,0.0000053154126],"about_ca_topic_score_codex":0.0025053797,"about_ca_topic_score_gemma":0.0018770366,"teacher_disagreement_score":0.034981865,"about_ca_system_score_codex":0.0020555973,"about_ca_system_score_gemma":0.0012199112,"threshold_uncertainty_score":0.11702603},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010770555,0.017798318,0.0023714674,0.08277034,0.050605275,0.00006723862,0.002321596,0.0008561151,0.84213257],"genre_scores_gemma":[0.011457889,0.008236764,0.0016544187,0.006867689,0.009418175,0.00013759363,0.0017533964,0.0006764456,0.9597976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799675,0.0003266231,0.000110295085,0.00039249516,0.00074025075,0.0004336042],"domain_scores_gemma":[0.9972837,0.00026310526,0.000051983847,0.0003612333,0.0010118246,0.0010281996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023935486,0.0015032729,0.0010792906,0.0017598204,0.004886277,0.0072840764,0.001095559,0.0033472786,0.24413286],"category_scores_gemma":[0.006195784,0.00047599108,0.0012315313,0.0025059446,0.0014861539,0.004936889,0.003961354,0.0052191652,0.19060305],"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.000018708439,0.000013611847,0.00008731581,0.00004174909,0.000004920584,0.000030363752,0.000024627123,0.00009621232,0.00008082782,0.016492084,0.96148413,0.021625435],"study_design_scores_gemma":[0.000005110602,0.000009828581,0.0002397995,0.00007219565,0.0000036582494,0.000029414477,0.000027411581,0.00010152675,0.00008154862,0.004596817,0.9948258,0.0000068120858],"about_ca_topic_score_codex":0.010064077,"about_ca_topic_score_gemma":0.017296316,"teacher_disagreement_score":0.24413286,"about_ca_system_score_codex":0.006263227,"about_ca_system_score_gemma":0.0059763603,"threshold_uncertainty_score":0.81670576},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030567436,0.019023366,0.09402925,0.00691195,0.0015563396,0.000054767377,0.0009108257,0.00057823403,0.8738784],"genre_scores_gemma":[0.15069325,0.021921275,0.039787468,0.0024010043,0.0022122907,0.0003041791,0.0017725283,0.00054968416,0.78035825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930704,0.0001582967,0.000023342329,0.00015442123,0.00027847214,0.000078385194],"domain_scores_gemma":[0.99914265,0.00031483773,0.000026927482,0.00026144565,0.00021447394,0.00003959088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005880463,0.001045219,0.0010784633,0.0022529082,0.0017364806,0.0039465106,0.0011218687,0.001376174,0.0454433],"category_scores_gemma":[0.002388377,0.0006206763,0.0005564826,0.0033855555,0.0030693554,0.00351679,0.0015212456,0.0036004456,0.012688083],"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.0000046621553,0.000006156288,0.000047710702,0.000048441703,0.0000045784386,0.000014497669,0.000114064336,0.0005181682,0.00009696628,0.9176383,0.04387538,0.03763112],"study_design_scores_gemma":[0.000006317208,0.0000038422763,0.00010685868,0.00006229743,0.000005729191,0.000039712304,0.000053963115,0.0012254728,0.00019404158,0.8155177,0.18277681,0.0000073050637],"about_ca_topic_score_codex":0.011236315,"about_ca_topic_score_gemma":0.00984862,"teacher_disagreement_score":0.0454433,"about_ca_system_score_codex":0.0048566707,"about_ca_system_score_gemma":0.0019423788,"threshold_uncertainty_score":0.15202296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013507929,0.0012980324,0.0024396833,0.9700015,0.0072193425,0.000009938165,0.000068713365,0.00012071031,0.017491365],"genre_scores_gemma":[0.10514023,0.001864919,0.0047063767,0.82875586,0.034519948,0.00018341161,0.00018067453,0.00023131953,0.024417346],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99292445,0.0028749963,0.00046033665,0.00075804564,0.0022334363,0.00074872095],"domain_scores_gemma":[0.9483201,0.039453104,0.0013109243,0.0033556556,0.004218865,0.0033413414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011392693,0.0004906668,0.0012846012,0.0008949178,0.0036836069,0.004815958,0.0021412065,0.021914613,0.010279944],"category_scores_gemma":[0.07874684,0.00036854888,0.000845332,0.0004338337,0.011558351,0.010970715,0.0030966778,0.031192023,0.008311288],"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.0001704787,0.00005125973,0.00075054355,0.000114236005,0.00003945715,0.00057269935,0.00029744292,0.0002695692,0.00024388246,0.22896355,0.7261519,0.042375058],"study_design_scores_gemma":[0.00008058826,0.000052991327,0.0004908752,0.00020200462,0.000013536745,0.00033267855,0.0003062694,0.001312049,0.0004666945,0.71147394,0.2852169,0.000051492734],"about_ca_topic_score_codex":0.0020762042,"about_ca_topic_score_gemma":0.0029167775,"teacher_disagreement_score":0.021914613,"about_ca_system_score_codex":0.0046420335,"about_ca_system_score_gemma":0.002797368,"threshold_uncertainty_score":0.060251057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6832554,0.0018228743,0.09576487,0.004137037,0.0004568859,0.000093026356,0.00041676374,0.00031129466,0.21374188],"genre_scores_gemma":[0.96746975,0.0006073061,0.014515615,0.00033882426,0.00073830487,0.00008156916,0.0003058527,0.000083685525,0.015859155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883574,0.0003274172,0.00009331549,0.00021228919,0.00038987724,0.00014137651],"domain_scores_gemma":[0.9878583,0.008371555,0.0009698554,0.0006173274,0.0014711346,0.00071181153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024816687,0.0005990783,0.0008758807,0.0029217615,0.0022408776,0.004922999,0.0013120557,0.000980948,0.008438171],"category_scores_gemma":[0.014823464,0.00044084428,0.0011185356,0.0027720344,0.00511136,0.006394262,0.002135138,0.0029260695,0.00061829074],"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.000048859627,0.000025135529,0.00071361195,0.00004846211,0.000008389452,0.00012660878,0.00034329452,0.0008328604,0.0007445246,0.9921029,0.00070124445,0.00430397],"study_design_scores_gemma":[0.000020389512,0.000037075217,0.0008151991,0.000027090064,0.000014441861,0.00020596862,0.00019808696,0.004490106,0.0006618231,0.9914684,0.0020464982,0.000014837747],"about_ca_topic_score_codex":0.0010163835,"about_ca_topic_score_gemma":0.0010546553,"teacher_disagreement_score":0.008438171,"about_ca_system_score_codex":0.0021663052,"about_ca_system_score_gemma":0.000980863,"threshold_uncertainty_score":0.028228462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003933264,0.10685665,0.17209673,0.012192826,0.005620195,0.00006742019,0.0013259102,0.00071351475,0.69719344],"genre_scores_gemma":[0.13000938,0.11794982,0.105803736,0.0065639177,0.011461148,0.00029061546,0.0020252739,0.0025064128,0.6233897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925345,0.00011778719,0.00004524147,0.0001888012,0.0003362053,0.000058456375],"domain_scores_gemma":[0.99928254,0.00032372918,0.00003361027,0.00010078759,0.00021551218,0.000043837434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087528164,0.0011686728,0.0008763244,0.0014888708,0.0009419574,0.0035648933,0.0009629426,0.0011704346,0.02520448],"category_scores_gemma":[0.0026426355,0.00054103375,0.0012483752,0.001674016,0.0029712273,0.003860051,0.0014800421,0.003942606,0.009768804],"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.000016851365,0.000013760689,0.000117362186,0.0003095395,0.000020393265,0.000086479115,0.00024408322,0.0021026777,0.00085384154,0.83438027,0.103322946,0.058531933],"study_design_scores_gemma":[0.0000036065646,0.000013667537,0.0002821146,0.00019039384,0.0000132803125,0.00014222127,0.00006316605,0.0016022506,0.0005331879,0.51718825,0.47995174,0.000016131069],"about_ca_topic_score_codex":0.0036063623,"about_ca_topic_score_gemma":0.002193478,"teacher_disagreement_score":0.02520448,"about_ca_system_score_codex":0.002722145,"about_ca_system_score_gemma":0.0010324897,"threshold_uncertainty_score":0.084317386},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001774856,0.0010084697,0.078792945,0.002226163,0.0009130667,0.000105680425,0.0019177559,0.0015565447,0.91170466],"genre_scores_gemma":[0.0670553,0.001967867,0.044613745,0.0025532162,0.0009288371,0.0003009989,0.0069621345,0.0019426843,0.87367517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986811,0.00017143348,0.000056418427,0.0004722985,0.00043714998,0.00018150572],"domain_scores_gemma":[0.99876726,0.0003073988,0.000034648852,0.0003670394,0.00043862176,0.000085076215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076159067,0.0010856739,0.0009645788,0.0018125759,0.0026021777,0.0036561885,0.0020252785,0.0008844071,0.17910859],"category_scores_gemma":[0.0026236286,0.00071777427,0.0014441293,0.0015351037,0.0020518338,0.005779427,0.003783214,0.0053329817,0.11413288],"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.000038309932,0.00005007806,0.00017934018,0.000116806885,0.00001310442,0.000043678105,0.00016590954,0.0002002807,0.0008302568,0.8151466,0.11353884,0.0696769],"study_design_scores_gemma":[0.000017820888,0.000012235076,0.00023831808,0.000052147883,0.000015348507,0.0001079593,0.00009209825,0.0006492351,0.0015155819,0.58590484,0.41138467,0.000009721741],"about_ca_topic_score_codex":0.00161509,"about_ca_topic_score_gemma":0.001998755,"teacher_disagreement_score":0.17910859,"about_ca_system_score_codex":0.001780659,"about_ca_system_score_gemma":0.0011381296,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00249615,0.1917361,0.0068440316,0.050061166,0.0048070867,0.000024653882,0.00010114909,0.00014571637,0.74378395],"genre_scores_gemma":[0.18702291,0.10406041,0.009926961,0.020431243,0.0062355436,0.0001372036,0.0001906739,0.00030179368,0.6716932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994764,0.00025137133,0.000014207364,0.00007220905,0.00015008666,0.00003580544],"domain_scores_gemma":[0.99944645,0.0003087314,0.000029943352,0.000054050604,0.000110829686,0.000050081257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007772615,0.0006658927,0.0004803547,0.0013035131,0.0022865466,0.0041168677,0.00039954073,0.0015234374,0.00917608],"category_scores_gemma":[0.0026666983,0.00026405122,0.00017776055,0.0015059722,0.006566501,0.0041163964,0.0012460835,0.0036474075,0.0030011723],"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.000011006556,0.00000824103,0.000096009084,0.00005260307,0.0000033552544,0.000019596062,0.00052367424,0.00019878999,0.000045003875,0.8779869,0.10051237,0.02054246],"study_design_scores_gemma":[0.0000053337326,0.000008335158,0.00011939864,0.00007996179,0.0000022193315,0.00006258115,0.0003066456,0.00020171989,0.000059423233,0.42793837,0.5712106,0.0000054106167],"about_ca_topic_score_codex":0.0064420043,"about_ca_topic_score_gemma":0.008691855,"teacher_disagreement_score":0.00917608,"about_ca_system_score_codex":0.0027035498,"about_ca_system_score_gemma":0.0019266952,"threshold_uncertainty_score":0.030697048},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005020102,0.0132939685,0.10638095,0.0048652203,0.0008306433,0.000059524253,0.0005666835,0.000383903,0.8685991],"genre_scores_gemma":[0.35361257,0.015282771,0.06497473,0.0037268149,0.0025525286,0.0005311354,0.0020352958,0.0006227604,0.5566613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959534,0.00013589657,0.000019970064,0.00006945693,0.00013603455,0.000043267217],"domain_scores_gemma":[0.99968576,0.00016670684,0.000011369064,0.00006374716,0.00005456292,0.000017955743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068980054,0.0007355963,0.0006292645,0.0011544978,0.001686375,0.0037798225,0.00084336166,0.0007989248,0.025858471],"category_scores_gemma":[0.0015297572,0.00042803196,0.0006334613,0.0016719183,0.0037657516,0.0049590515,0.001437717,0.0026427524,0.0057938485],"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.0000021878516,0.0000047257276,0.000016508684,0.000025059991,9.993195e-7,0.0000059910185,0.00012820936,0.00011604035,0.00007540835,0.9855584,0.006826766,0.007239703],"study_design_scores_gemma":[0.0000019064208,0.0000030089734,0.00005166436,0.000018711073,0.0000015904062,0.000018522453,0.000045628523,0.00023177887,0.00007596994,0.9182044,0.08134452,0.0000023991686],"about_ca_topic_score_codex":0.0011955433,"about_ca_topic_score_gemma":0.0012057091,"teacher_disagreement_score":0.025858471,"about_ca_system_score_codex":0.00219844,"about_ca_system_score_gemma":0.00062934967,"threshold_uncertainty_score":0.086505175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020698745,0.0028506888,0.83839405,0.014295713,0.0005506615,0.00021828894,0.00015475876,0.0008847935,0.12195241],"genre_scores_gemma":[0.49490154,0.0033988785,0.47011048,0.0030260338,0.00037419648,0.0012269347,0.00034220115,0.000658103,0.025961554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979912,0.0009770696,0.00009874511,0.00032684562,0.00036676574,0.00023932432],"domain_scores_gemma":[0.9972216,0.0011643177,0.00016988433,0.0008938417,0.00022336772,0.00032696885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036166026,0.0009587905,0.0008162659,0.0010894903,0.0027262517,0.0097132595,0.00230434,0.0033752343,0.0065504108],"category_scores_gemma":[0.0062654265,0.0011062145,0.001554154,0.0006592602,0.010097076,0.013543458,0.009518767,0.004600552,0.0015276805],"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.000008628522,0.000012993798,0.00012510268,0.00007866011,0.000015315007,0.0000518101,0.000383022,0.0073961667,0.00034621014,0.98484135,0.0012795923,0.005461125],"study_design_scores_gemma":[0.000013721926,0.000018546192,0.000057156816,0.00007158147,0.00000991133,0.000046373156,0.00018173356,0.01513785,0.00036885953,0.9458998,0.03818046,0.000014100524],"about_ca_topic_score_codex":0.0012301977,"about_ca_topic_score_gemma":0.0016257532,"teacher_disagreement_score":0.0097132595,"about_ca_system_score_codex":0.0021491323,"about_ca_system_score_gemma":0.0019556382,"threshold_uncertainty_score":0.02191329},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3694367,0.0026834202,0.27393517,0.0018964502,0.00085563795,0.00004921607,0.00030856224,0.00047089715,0.35036397],"genre_scores_gemma":[0.94457054,0.00082499837,0.02402796,0.00045928673,0.0005037768,0.000036886584,0.00014149112,0.000113603615,0.02932148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995183,0.00008644649,0.000033785876,0.00010594514,0.00018128923,0.000074327196],"domain_scores_gemma":[0.99939096,0.00018502488,0.0000651844,0.000110670175,0.00014990075,0.00009824208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006178943,0.00038070095,0.00061969546,0.0016048318,0.0010471102,0.0023979235,0.0007422733,0.00048091362,0.0056795543],"category_scores_gemma":[0.0020325622,0.0001930421,0.00059568917,0.0009074052,0.0021116734,0.0037600836,0.0018302386,0.0010722884,0.0009611603],"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.0000068111694,0.0000043935256,0.00008528927,0.000017804152,0.0000027210986,0.00005634627,0.00005043348,0.0003636858,0.0005036047,0.9952024,0.00035246258,0.0033539934],"study_design_scores_gemma":[0.0000027753197,0.000010590217,0.00010343332,0.000008980174,0.000004407668,0.00013686923,0.000019829578,0.004438157,0.0005823054,0.9898107,0.004875646,0.000006316023],"about_ca_topic_score_codex":0.0003639596,"about_ca_topic_score_gemma":0.000361267,"teacher_disagreement_score":0.0056795543,"about_ca_system_score_codex":0.0010347822,"about_ca_system_score_gemma":0.00050244614,"threshold_uncertainty_score":0.018999994},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012293762,0.011495193,0.07155319,0.015014162,0.0006086625,0.000028304663,0.00013576422,0.00026164044,0.88860935],"genre_scores_gemma":[0.7123795,0.008469627,0.045810726,0.0038903183,0.0012965229,0.00013633061,0.00031413944,0.00039618454,0.22730666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991819,0.00026837538,0.000026284179,0.000107810454,0.00033843654,0.000077205324],"domain_scores_gemma":[0.99904174,0.0005442446,0.000042602238,0.00015324898,0.00015114366,0.00006699831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008211465,0.00040579578,0.00031036363,0.0007575268,0.0016849298,0.0031675175,0.00053139974,0.0007333299,0.007101362],"category_scores_gemma":[0.0024691042,0.00029744388,0.0003993747,0.00050701253,0.0072050076,0.00513596,0.0017248368,0.0021185745,0.0014487292],"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.0000027913818,0.0000020411671,0.000023482256,0.000016985421,0.0000015102355,0.000009925495,0.00016832333,0.00020915021,0.000059526796,0.9903245,0.004890973,0.0042908513],"study_design_scores_gemma":[0.0000022267386,0.0000037311775,0.00005832331,0.000018459317,0.0000017552638,0.000035555353,0.000059114056,0.0005311239,0.0001167396,0.93254375,0.066625014,0.000004160433],"about_ca_topic_score_codex":0.0015139898,"about_ca_topic_score_gemma":0.002170143,"teacher_disagreement_score":0.007101362,"about_ca_system_score_codex":0.0031548967,"about_ca_system_score_gemma":0.0011078328,"threshold_uncertainty_score":0.023756385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014207452,0.00030904176,0.9706449,0.0015239854,0.00004304286,0.000021659002,0.000031424916,0.0001671527,0.0130513795],"genre_scores_gemma":[0.7854761,0.0006622282,0.20713986,0.0005286364,0.00021187654,0.0001623775,0.00015740118,0.00019235912,0.005469204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973355,0.0011412842,0.000100217876,0.0006450519,0.00056113786,0.00021672923],"domain_scores_gemma":[0.9938121,0.0031805602,0.00040958222,0.0018918168,0.0003560498,0.00034991856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030203117,0.0008535258,0.0010636116,0.0015918586,0.0015173677,0.0047293613,0.0030850163,0.0021251019,0.0050523677],"category_scores_gemma":[0.009583868,0.0007253316,0.0018027794,0.00115768,0.008914497,0.014485843,0.008012354,0.0039529847,0.000592243],"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.000011479824,0.000007961402,0.000120441546,0.000018228819,0.000013315939,0.000041107538,0.00026823534,0.011374075,0.00019776924,0.9827802,0.00015986421,0.0050072717],"study_design_scores_gemma":[0.0000046768787,0.000006351226,0.000043690467,0.000006971347,0.000005227261,0.000028133058,0.000024096273,0.037513126,0.00011072632,0.96084267,0.0014090933,0.0000052168725],"about_ca_topic_score_codex":0.002734975,"about_ca_topic_score_gemma":0.0024885244,"teacher_disagreement_score":0.0050523677,"about_ca_system_score_codex":0.0027197744,"about_ca_system_score_gemma":0.0015772397,"threshold_uncertainty_score":0.019733429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038728028,0.050838143,0.005041782,0.0025704037,0.0029302363,0.000029444987,0.00013094822,0.00011211377,0.93795973],"genre_scores_gemma":[0.012535149,0.037230387,0.006556752,0.0028407543,0.00389878,0.00014494486,0.00027044912,0.00026695643,0.9362559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996269,0.00008328395,0.000014483074,0.00007069889,0.00017978426,0.000024750094],"domain_scores_gemma":[0.9996457,0.00018399187,0.0000209718,0.00005790991,0.00006353697,0.000027902104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039339665,0.0012324419,0.0007782013,0.0017360738,0.0011793032,0.0057216706,0.0008968479,0.0010838386,0.052475624],"category_scores_gemma":[0.0017607539,0.00036873654,0.00031101174,0.0026505133,0.0031985373,0.0051155617,0.0013858831,0.0037464155,0.023763508],"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.0000075983353,0.000015356583,0.000039242957,0.0001756384,0.0000035559465,0.000026028581,0.00027228415,0.00016394124,0.0002358697,0.75854963,0.19278555,0.04772527],"study_design_scores_gemma":[0.0000021905446,0.000005511421,0.000097942,0.000107913795,0.0000022360127,0.000053428794,0.00008389168,0.00014396226,0.000050905393,0.15934807,0.8401003,0.0000035616697],"about_ca_topic_score_codex":0.0020847982,"about_ca_topic_score_gemma":0.0035304485,"teacher_disagreement_score":0.052475624,"about_ca_system_score_codex":0.0016082994,"about_ca_system_score_gemma":0.00111918,"threshold_uncertainty_score":0.1755485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020337717,0.0027551872,0.017470347,0.0008131054,0.0004653357,0.000017077173,0.00012031556,0.0002402325,0.97608453],"genre_scores_gemma":[0.10865183,0.005402656,0.016938558,0.0008538299,0.0014337727,0.00007482198,0.00039985488,0.0003207815,0.8659239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998286,0.00002986814,0.0000054819757,0.00003294582,0.00008342159,0.000019653384],"domain_scores_gemma":[0.9998971,0.000031575273,0.0000072529338,0.000026513106,0.00002824958,0.000009222799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021415262,0.0006878711,0.00037421208,0.00096286956,0.000806766,0.0019960762,0.00050726824,0.0003821518,0.040910404],"category_scores_gemma":[0.0007421637,0.00024270352,0.0003079309,0.0009877426,0.001770389,0.0027460062,0.0010123405,0.0016394408,0.014771106],"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.000007005976,0.000006192134,0.000021555594,0.000042203115,0.0000023034768,0.000010937175,0.000086185864,0.00016196896,0.00030376218,0.9320854,0.028925795,0.038346812],"study_design_scores_gemma":[0.000005405328,0.000008319557,0.00013210007,0.00003177636,0.0000041245835,0.00008093835,0.00002844961,0.0004385023,0.00040640397,0.64966625,0.34919387,0.0000039362008],"about_ca_topic_score_codex":0.0004907374,"about_ca_topic_score_gemma":0.0007002165,"teacher_disagreement_score":0.040910404,"about_ca_system_score_codex":0.0009912825,"about_ca_system_score_gemma":0.0005276743,"threshold_uncertainty_score":0.13685888},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18571866,0.005552973,0.47312406,0.060097616,0.0006436873,0.00012433979,0.00042690514,0.00035734905,0.2739544],"genre_scores_gemma":[0.96873975,0.00083739735,0.022289129,0.001057073,0.0004153011,0.00006801046,0.00008246329,0.000052589297,0.0064583626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559563,0.002337969,0.00017561551,0.0008487431,0.0008141502,0.00022785322],"domain_scores_gemma":[0.9756132,0.017781803,0.0012006088,0.0025867731,0.0019498587,0.00086787593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057771564,0.00032786364,0.0008065046,0.0014839966,0.0023688416,0.005710237,0.0010248974,0.0019902901,0.006210647],"category_scores_gemma":[0.026292607,0.00046321275,0.0006191434,0.0010298849,0.013979806,0.00794497,0.0035183544,0.0043170135,0.00082910596],"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.000008680218,0.000005395893,0.00029912044,0.000015274582,0.0000073450724,0.000020324249,0.00014979654,0.0011763901,0.00006337131,0.9954223,0.00061262434,0.0022194968],"study_design_scores_gemma":[0.0000035971107,0.0000043568393,0.0001511284,0.000009221759,0.0000019640531,0.000023648216,0.000039216535,0.0031814962,0.00006441015,0.99456537,0.0019519189,0.0000036891167],"about_ca_topic_score_codex":0.0009017062,"about_ca_topic_score_gemma":0.0006823689,"teacher_disagreement_score":0.006210647,"about_ca_system_score_codex":0.002595091,"about_ca_system_score_gemma":0.0010029117,"threshold_uncertainty_score":0.030552864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43015417,0.00033692506,0.5056512,0.0008496541,0.0001390097,0.000090157526,0.0002940947,0.00071447983,0.06177037],"genre_scores_gemma":[0.9659457,0.000107100444,0.025290277,0.00009248559,0.000054489956,0.000055470005,0.0001234568,0.00009905172,0.008231886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989506,0.00016100139,0.000057534024,0.0002290872,0.00032731993,0.0002744389],"domain_scores_gemma":[0.9970579,0.0013479157,0.0002683341,0.0007165341,0.00034379194,0.00026554603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009437401,0.0003849649,0.0005226092,0.0008198082,0.00097066525,0.0017281931,0.0009206675,0.0006584605,0.005269181],"category_scores_gemma":[0.006293879,0.00027431472,0.0008592358,0.00046033572,0.0024371198,0.0029154783,0.0023231162,0.0015265732,0.00054731127],"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.000035309262,0.000015664684,0.00031475272,0.000017076854,0.000003937404,0.000066448076,0.00019660503,0.0052548945,0.0016518686,0.9885867,0.00025148518,0.0036052216],"study_design_scores_gemma":[0.000019740697,0.000028901586,0.00027576627,0.000014226094,0.000008200708,0.00008930487,0.00006667462,0.07752372,0.0034279237,0.91641706,0.0021097558,0.00001865934],"about_ca_topic_score_codex":0.0012998062,"about_ca_topic_score_gemma":0.0009830887,"teacher_disagreement_score":0.005269181,"about_ca_system_score_codex":0.0017973123,"about_ca_system_score_gemma":0.0008534522,"threshold_uncertainty_score":0.01762712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012066031,0.007556013,0.015967296,0.019537259,0.0020256217,0.000030507019,0.00009962805,0.00008122165,0.9426364],"genre_scores_gemma":[0.7958015,0.010821093,0.0077256383,0.006962816,0.0024958202,0.00017612505,0.00030979954,0.00025298668,0.17545417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980604,0.001060621,0.00006585209,0.0002858238,0.00030619118,0.00022111829],"domain_scores_gemma":[0.99849224,0.0008227801,0.00014762639,0.00017078414,0.00020126533,0.00016529337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015851385,0.00054295396,0.00029061988,0.0019411693,0.0040261555,0.006308458,0.00069938216,0.0010848095,0.010372419],"category_scores_gemma":[0.0030037744,0.00013861617,0.00041876917,0.0014523587,0.013988512,0.005579965,0.002967612,0.0026591064,0.0016518444],"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.000007512889,0.0000050151116,0.00019210619,0.0000448206,0.0000027946967,0.000057366786,0.013363477,0.000060407117,0.000068940986,0.963813,0.010662446,0.0117220925],"study_design_scores_gemma":[0.0000064088495,0.000015473568,0.00045741268,0.00023482079,0.0000055059327,0.00018273131,0.014083696,0.00012436758,0.00016710625,0.2394559,0.74525803,0.000008544419],"about_ca_topic_score_codex":0.0038488898,"about_ca_topic_score_gemma":0.00569928,"teacher_disagreement_score":0.010372419,"about_ca_system_score_codex":0.005075532,"about_ca_system_score_gemma":0.002405528,"threshold_uncertainty_score":0.036825716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095983455,0.0006677014,0.9821885,0.00067670725,0.00007161283,0.000025983092,0.00006081842,0.00007407868,0.0066362526],"genre_scores_gemma":[0.7629853,0.0035731778,0.22597596,0.0007427743,0.0006900817,0.00022835493,0.00033076789,0.0001264458,0.00534723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971021,0.0010845017,0.00018809078,0.00067812303,0.00080629694,0.00014102203],"domain_scores_gemma":[0.980835,0.014107908,0.0011439427,0.0024568834,0.0012275253,0.00022872395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004773831,0.0008005256,0.0007906492,0.0023307388,0.0005384771,0.0021063788,0.0012351325,0.0011908239,0.0029287476],"category_scores_gemma":[0.017480493,0.00037678317,0.0014296821,0.001194494,0.0039915065,0.0068202945,0.004108575,0.0040164003,0.00042459552],"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.000025623347,0.000041346393,0.0009608311,0.0001869712,0.00005497808,0.00019987757,0.00042487454,0.069339916,0.0012707894,0.8969934,0.0007996769,0.029701654],"study_design_scores_gemma":[0.000009288682,0.000042509597,0.00025536134,0.000054299875,0.000015326721,0.00009683876,0.00009499599,0.202455,0.00094880234,0.7930623,0.0029472425,0.000018018176],"about_ca_topic_score_codex":0.00077610504,"about_ca_topic_score_gemma":0.00027239422,"teacher_disagreement_score":0.004773831,"about_ca_system_score_codex":0.0011435508,"about_ca_system_score_gemma":0.00072350865,"threshold_uncertainty_score":0.02524668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025452436,0.06689739,0.025140189,0.06030902,0.022854753,0.000057722427,0.0008524929,0.0003062963,0.8210368],"genre_scores_gemma":[0.0421228,0.04578903,0.008371789,0.016366696,0.017329805,0.00011707357,0.0010519131,0.00045854086,0.8683924],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919134,0.00019588621,0.00003270395,0.00010689538,0.00039773688,0.000075420605],"domain_scores_gemma":[0.99748236,0.0016446556,0.000064510416,0.00012949583,0.0005789052,0.00010004144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082989165,0.0010007317,0.0005968661,0.0016210714,0.0024656,0.0030183569,0.0006283898,0.0012979822,0.027010405],"category_scores_gemma":[0.005224862,0.0003631145,0.0006826564,0.0018167564,0.0032643168,0.0037214577,0.0012554678,0.003633892,0.012499678],"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.000012517124,0.000011920595,0.00006484995,0.00010873027,0.000006216953,0.000065798544,0.00049496273,0.00058863265,0.00020717319,0.42572248,0.5444861,0.02823053],"study_design_scores_gemma":[0.0000041692697,0.000010301648,0.0001407696,0.00021585461,0.0000029379696,0.00011769795,0.00016943109,0.0004991103,0.00011574996,0.15735197,0.84136295,0.000009017879],"about_ca_topic_score_codex":0.0028769458,"about_ca_topic_score_gemma":0.0022523068,"teacher_disagreement_score":0.027010405,"about_ca_system_score_codex":0.0025777,"about_ca_system_score_gemma":0.0016303415,"threshold_uncertainty_score":0.09035885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10876022,0.0055049807,0.6767118,0.08129632,0.0003273717,0.000113175796,0.00019255065,0.00044337596,0.12665026],"genre_scores_gemma":[0.96806604,0.0008045192,0.027223332,0.0011450155,0.00021493544,0.0001128137,0.00006763347,0.00009827294,0.0022675644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926745,0.0034513797,0.0003354541,0.0013414255,0.0017881272,0.00040904124],"domain_scores_gemma":[0.9767379,0.015923737,0.0010089914,0.0048683505,0.0009251241,0.0005358695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010803074,0.0006592215,0.001440178,0.002059496,0.0019138213,0.0065712463,0.0034328164,0.0042150095,0.007211484],"category_scores_gemma":[0.026337348,0.0005925594,0.0016126396,0.0016875474,0.032580644,0.024016708,0.008160616,0.007705886,0.00051469065],"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.000006988185,0.000004270374,0.0000920734,0.000020327596,0.0000062226554,0.000019968082,0.00019084367,0.0008246806,0.00006295685,0.99633753,0.00017453493,0.0022595332],"study_design_scores_gemma":[0.0000043995224,0.0000023515308,0.000052567513,0.0000058794353,0.0000017095485,0.000015800511,0.000034859244,0.0013186597,0.000036090038,0.9979674,0.0005580475,0.0000021729031],"about_ca_topic_score_codex":0.00096016756,"about_ca_topic_score_gemma":0.0007465788,"teacher_disagreement_score":0.010803074,"about_ca_system_score_codex":0.0031175427,"about_ca_system_score_gemma":0.001667072,"threshold_uncertainty_score":0.05713278},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12689205,0.0003188788,0.79022425,0.006616825,0.0007844967,0.00081396016,0.0014196422,0.010081894,0.06284805],"genre_scores_gemma":[0.6472634,0.00015877571,0.338214,0.0013549753,0.00025146428,0.00029835192,0.0011932245,0.00046488608,0.010800883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575305,0.0015380961,0.00019363666,0.000814985,0.0011922984,0.0005080652],"domain_scores_gemma":[0.98723197,0.009328538,0.0004357354,0.0014020083,0.0012680738,0.00033367408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037582691,0.000541082,0.0006468879,0.00068138016,0.0015922195,0.0025838679,0.0019136729,0.0011435574,0.016498378],"category_scores_gemma":[0.014276658,0.0006680469,0.00209003,0.000665033,0.0026062676,0.0038252359,0.003271045,0.003261933,0.0016974556],"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.0009854519,0.0008845803,0.004268061,0.00078139093,0.00026348652,0.0013287028,0.0005995196,0.08215056,0.034300737,0.6926872,0.053795986,0.12795435],"study_design_scores_gemma":[0.0005332008,0.00043495532,0.0014138685,0.00010390755,0.00016249435,0.0004712223,0.00020877665,0.63392884,0.05688861,0.28120527,0.024558138,0.00009068528],"about_ca_topic_score_codex":0.006332401,"about_ca_topic_score_gemma":0.008772328,"teacher_disagreement_score":0.016498378,"about_ca_system_score_codex":0.002075096,"about_ca_system_score_gemma":0.0049897237,"threshold_uncertainty_score":0.05519259},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35131398,0.0008107682,0.49694103,0.024184521,0.0010072904,0.00043582378,0.00095630105,0.0040006274,0.12034972],"genre_scores_gemma":[0.8508706,0.00031865816,0.13171826,0.0017527769,0.00038847598,0.0002519558,0.00053398847,0.00028868974,0.0138766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641365,0.0014177316,0.00014434737,0.00049437094,0.0009910783,0.0005388854],"domain_scores_gemma":[0.9925045,0.0052069984,0.0002940805,0.0011660119,0.00052134925,0.00030710083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029731393,0.00047281635,0.0008768043,0.0007896579,0.0020240769,0.0025051176,0.0013647232,0.0015293594,0.010565453],"category_scores_gemma":[0.010110883,0.0004844661,0.002023218,0.00087245565,0.002712945,0.004616649,0.004196979,0.00533127,0.0011930094],"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.0005041563,0.00023971862,0.0008729748,0.00019319073,0.00009104665,0.00040508978,0.000405023,0.019690048,0.010219239,0.9005994,0.02241745,0.044362724],"study_design_scores_gemma":[0.00029849246,0.00020004282,0.00048614971,0.000048604004,0.000084181775,0.00023826824,0.00014018534,0.21587805,0.024327662,0.7414098,0.01682273,0.000065968256],"about_ca_topic_score_codex":0.0014685056,"about_ca_topic_score_gemma":0.0015372392,"teacher_disagreement_score":0.010565453,"about_ca_system_score_codex":0.0018566729,"about_ca_system_score_gemma":0.0027679973,"threshold_uncertainty_score":0.03534496},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090749585,0.0011978803,0.02180546,0.005391909,0.0067646913,0.00089265645,0.07421246,0.00789472,0.88093275],"genre_scores_gemma":[0.0069992486,0.0018464067,0.011039107,0.0023152523,0.0010204978,0.001036413,0.050998125,0.0068808002,0.91786414],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963691,0.0006379641,0.00030229098,0.00040975786,0.0019317797,0.0003491004],"domain_scores_gemma":[0.9750363,0.0063785836,0.00071177207,0.005841395,0.010947885,0.0010839461],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027845306,0.0010905167,0.0010154974,0.0092466585,0.00197236,0.0055467756,0.002878311,0.001584811,0.76056224],"category_scores_gemma":[0.034722924,0.00052364916,0.0011205411,0.013176836,0.0010794963,0.006134986,0.003045939,0.0021023354,0.5468044],"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.000040187722,0.000012017081,0.00008845056,0.00027143184,0.000002117723,0.000036339214,0.00018810699,0.00009020206,0.00015506438,0.0141719775,0.9215624,0.06338169],"study_design_scores_gemma":[0.00000871402,0.0000072372645,0.00020363613,0.00020804774,0.0000022911981,0.00005874847,0.00018446641,0.00013571096,0.00020703871,0.005559134,0.99341124,0.000013681024],"about_ca_topic_score_codex":0.010242249,"about_ca_topic_score_gemma":0.007965193,"teacher_disagreement_score":0.76056224,"about_ca_system_score_codex":0.0038870252,"about_ca_system_score_gemma":0.0038645808,"threshold_uncertainty_score":0.3415289},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052308574,0.027967922,0.19243723,0.31893474,0.059643835,0.000118975884,0.008357851,0.0025513857,0.33767948],"genre_scores_gemma":[0.6748016,0.019610574,0.041708097,0.025611049,0.090343595,0.00040042176,0.005763272,0.0025794916,0.13918191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984371,0.00033530235,0.00007137903,0.00048919464,0.0004548148,0.0002122239],"domain_scores_gemma":[0.98049647,0.01270356,0.0010936855,0.0016577701,0.0021275058,0.0019210307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016175915,0.0008036033,0.0011974479,0.0020312036,0.001720575,0.008449832,0.0014493142,0.0019262184,0.0658062],"category_scores_gemma":[0.013899909,0.000628044,0.0008407043,0.0029627387,0.003449533,0.009978368,0.002311876,0.008712237,0.011699024],"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.0001850132,0.00006073362,0.0014001735,0.00025987317,0.000028732393,0.000097135104,0.00018485288,0.002607021,0.00063206203,0.62372065,0.3438712,0.026952554],"study_design_scores_gemma":[0.000049931634,0.000053971056,0.0018742873,0.00025361535,0.000033339766,0.0002794674,0.00017997027,0.014499007,0.0015334954,0.8513771,0.12979457,0.000071064016],"about_ca_topic_score_codex":0.0016606062,"about_ca_topic_score_gemma":0.0013943147,"teacher_disagreement_score":0.0658062,"about_ca_system_score_codex":0.003300615,"about_ca_system_score_gemma":0.0016192549,"threshold_uncertainty_score":0.22014368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17208126,0.0035729497,0.74301606,0.0050039967,0.00015147451,0.00011504939,0.0008946996,0.00025051404,0.07491403],"genre_scores_gemma":[0.90741557,0.0014241292,0.08523478,0.0005443093,0.00023658223,0.00025526952,0.00040959768,0.000099668636,0.004380081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897407,0.004788335,0.00079827465,0.0013766508,0.002643187,0.00065286877],"domain_scores_gemma":[0.9013072,0.08460191,0.004728692,0.0043434156,0.0035925687,0.0014260967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013203021,0.0007374743,0.0014320421,0.004577526,0.001683437,0.0069928803,0.0015347089,0.0020911044,0.0078528905],"category_scores_gemma":[0.0605626,0.0005394428,0.00101187,0.0034867695,0.0095112305,0.017549567,0.004308365,0.0029891403,0.00051246665],"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.000022456492,0.000007279794,0.00014135086,0.000030746738,0.0000102995555,0.00001583066,0.00009113121,0.0021113786,0.000119257515,0.9929905,0.00014327343,0.0043165283],"study_design_scores_gemma":[0.000005444244,0.00001626297,0.00016218124,0.000022269454,0.000005517178,0.00002157841,0.000035210287,0.0046898206,0.00012292131,0.99441296,0.0004974224,0.00000844752],"about_ca_topic_score_codex":0.0010421531,"about_ca_topic_score_gemma":0.000632866,"teacher_disagreement_score":0.013203021,"about_ca_system_score_codex":0.004122467,"about_ca_system_score_gemma":0.0015994841,"threshold_uncertainty_score":0.06982511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44616303,0.0024704554,0.21796168,0.004371747,0.0009275642,0.00009178552,0.0005634477,0.00067354046,0.32677677],"genre_scores_gemma":[0.9395432,0.00097643683,0.031086313,0.00088402285,0.0004980488,0.000060029903,0.000481182,0.0002549193,0.026215784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890995,0.00024004547,0.000078084304,0.00027051396,0.00033060153,0.00017075687],"domain_scores_gemma":[0.9942334,0.0037112227,0.00031902237,0.0005192072,0.0005524266,0.0006646467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014200845,0.0004946433,0.0010094729,0.0014763928,0.0023666485,0.0038033035,0.0012063507,0.00080928346,0.0075958343],"category_scores_gemma":[0.004961727,0.00088218425,0.0012589811,0.0014191996,0.0041109133,0.007438241,0.003347807,0.0037624347,0.0009776838],"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.000054285152,0.000027520058,0.00033796526,0.000027749607,0.0000065045806,0.00005065954,0.0001682018,0.00024099357,0.00048933044,0.9940362,0.0007619783,0.0037985942],"study_design_scores_gemma":[0.000022703925,0.000016082598,0.00019176299,0.00001089097,0.000011425476,0.00009801368,0.00006315554,0.0011246882,0.0007554498,0.9937867,0.0039124927,0.0000066924194],"about_ca_topic_score_codex":0.0006333563,"about_ca_topic_score_gemma":0.00071621704,"teacher_disagreement_score":0.0075958343,"about_ca_system_score_codex":0.0010799334,"about_ca_system_score_gemma":0.00073990034,"threshold_uncertainty_score":0.025410593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02128884,0.002531607,0.69932824,0.019382115,0.000706677,0.00028660012,0.00011854532,0.0011442815,0.25521308],"genre_scores_gemma":[0.7050651,0.001974158,0.25967637,0.0026904512,0.00048402356,0.000323146,0.00029707677,0.0002795877,0.029210163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99283725,0.0039995485,0.00041894466,0.0011767972,0.0011978386,0.0003695499],"domain_scores_gemma":[0.98799944,0.0050632306,0.00088820775,0.0039967503,0.0014168296,0.0006355615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061869095,0.0008674138,0.00069762074,0.0014181108,0.0023382595,0.009068285,0.0021369562,0.0024325517,0.0073157735],"category_scores_gemma":[0.016087644,0.00053061574,0.0011407384,0.0009510833,0.014857031,0.010196259,0.0065638516,0.003433227,0.0016993717],"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.000015774798,0.00002388912,0.00032229436,0.00008694345,0.000021150827,0.000057462716,0.0010608232,0.0021225542,0.0005108703,0.9800081,0.002238056,0.013532121],"study_design_scores_gemma":[0.000012372759,0.000014722399,0.0000788763,0.00006519578,0.000011424786,0.0000757263,0.00035103454,0.0071849613,0.00057648495,0.95896435,0.032653272,0.000011631791],"about_ca_topic_score_codex":0.0011433618,"about_ca_topic_score_gemma":0.00092891045,"teacher_disagreement_score":0.009068285,"about_ca_system_score_codex":0.0024668374,"about_ca_system_score_gemma":0.0025307056,"threshold_uncertainty_score":0.03271985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01064122,0.0012481083,0.9276443,0.0009422924,0.00038742847,0.0002125388,0.0006905994,0.0051105283,0.053122927],"genre_scores_gemma":[0.14712372,0.0012502014,0.8120974,0.00052395446,0.0003490186,0.00063949963,0.0020355727,0.0021392473,0.03384142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983783,0.00034276335,0.00009881931,0.000305423,0.0006523643,0.0002223725],"domain_scores_gemma":[0.99665916,0.0018398319,0.00011791139,0.00092128123,0.00036538133,0.000096485885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012973888,0.0017824899,0.0016881775,0.0020695166,0.0019749864,0.004682971,0.0035610907,0.0017511044,0.041772544],"category_scores_gemma":[0.0071207206,0.0011070775,0.0021234723,0.004345346,0.002356856,0.008316903,0.0039631454,0.004704662,0.008550582],"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.00039653317,0.00017755452,0.00023665301,0.0005381553,0.00005410616,0.000045551136,0.00013125152,0.03265958,0.0040711025,0.58601665,0.03721683,0.3384561],"study_design_scores_gemma":[0.0001381682,0.00005250213,0.00017317715,0.000067394845,0.000038647864,0.000095827316,0.00007716025,0.14239985,0.0034112541,0.82563436,0.027875232,0.0000363775],"about_ca_topic_score_codex":0.0024994821,"about_ca_topic_score_gemma":0.0042581903,"teacher_disagreement_score":0.041772544,"about_ca_system_score_codex":0.003149874,"about_ca_system_score_gemma":0.0023640548,"threshold_uncertainty_score":0.13974309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007967787,0.00012045591,0.00010882233,0.0001892583,0.000057504043,0.000014175488,0.9949692,0.0022212681,0.0022398056],"genre_scores_gemma":[0.00035504217,0.0001552246,0.00031842515,0.00013629641,0.000020835914,0.000063396954,0.9969597,0.0004913758,0.0014997625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975879,0.0004373533,0.00030627075,0.0006648245,0.0006021016,0.0004016381],"domain_scores_gemma":[0.99555606,0.0009808787,0.00031173386,0.0017369054,0.0008454118,0.00056901504],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002253291,0.004355435,0.002484019,0.009201933,0.0016282527,0.009318919,0.0053708693,0.003556054,0.2891358],"category_scores_gemma":[0.014826089,0.0012058906,0.0016435581,0.0130812405,0.0009942818,0.0049474086,0.0057673105,0.0033929825,0.42898142],"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.000041819258,0.000016197691,0.00023923314,0.00055438647,0.0000189062,0.000010390595,0.000024036412,0.00008950016,0.00008434424,0.0010114532,0.9960139,0.0018959267],"study_design_scores_gemma":[0.0001979979,0.00001856441,0.00077597715,0.00039021802,0.00001685229,0.000040898827,0.00008347347,0.00029462238,0.0003791691,0.0034202603,0.99436074,0.000021367057],"about_ca_topic_score_codex":0.0122347325,"about_ca_topic_score_gemma":0.013867058,"teacher_disagreement_score":0.7108642,"about_ca_system_score_codex":0.0023523509,"about_ca_system_score_gemma":0.0035894013,"threshold_uncertainty_score":0.96725565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083820714,0.00031626454,0.0009686679,0.001079908,0.00022337954,0.00007504724,0.99409324,0.000930284,0.0014749786],"genre_scores_gemma":[0.0076304097,0.00020216538,0.003649231,0.00075777795,0.00013666545,0.00057475513,0.9834169,0.0004100165,0.0032220555],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99426806,0.0019618762,0.0008661476,0.0011323001,0.0013501071,0.00042139334],"domain_scores_gemma":[0.9588643,0.014973897,0.0028924567,0.015668515,0.0066081285,0.0009926173],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.010162115,0.0018008419,0.0014013501,0.0036426487,0.0013653388,0.0048136436,0.004427642,0.0036284213,0.083239116],"category_scores_gemma":[0.08451037,0.00073658966,0.0017761287,0.006293384,0.001037262,0.0023486386,0.0033872374,0.0025898693,0.06311445],"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.00013487342,0.000030221561,0.002902726,0.00055962685,0.0000601254,0.000022600825,0.000027089038,0.00033503323,0.000057610454,0.0012700951,0.9895201,0.005079879],"study_design_scores_gemma":[0.0011259067,0.00006054016,0.012077437,0.00077798334,0.0001811485,0.00022447175,0.00022889796,0.0024384973,0.00086488685,0.018255701,0.96368146,0.000083043145],"about_ca_topic_score_codex":0.015687613,"about_ca_topic_score_gemma":0.029497059,"teacher_disagreement_score":0.9955723,"about_ca_system_score_codex":0.0014693367,"about_ca_system_score_gemma":0.004219499,"threshold_uncertainty_score":0.27846253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018715685,0.024451917,0.7283573,0.15593164,0.002032252,0.00005086251,0.00038513396,0.0004407099,0.0696344],"genre_scores_gemma":[0.589333,0.019189809,0.3407249,0.01969986,0.009968271,0.00039061764,0.0003956626,0.00041191673,0.019886006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995869,0.0021759493,0.00022219915,0.00053938525,0.0010048484,0.000188583],"domain_scores_gemma":[0.97898906,0.017114544,0.00072949386,0.0017129901,0.0011041199,0.00034966113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074596764,0.00094659306,0.0008989542,0.0024197774,0.001526643,0.0052255243,0.0016747357,0.002822511,0.003290611],"category_scores_gemma":[0.020298133,0.0005692792,0.0012329508,0.001917971,0.014767019,0.016931128,0.0028050789,0.010975217,0.0011693727],"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.000006915689,0.000008187652,0.000060167436,0.000043899247,0.0000064832084,0.000011953035,0.00011157153,0.0010614509,0.00007504358,0.99226224,0.0024343552,0.003917706],"study_design_scores_gemma":[0.0000034022178,0.000005049854,0.000024753846,0.00001602644,0.0000020783066,0.000011374098,0.000022235192,0.0030675847,0.00007055569,0.99076426,0.0060093394,0.0000032106202],"about_ca_topic_score_codex":0.0006881796,"about_ca_topic_score_gemma":0.0003508108,"teacher_disagreement_score":0.0074596764,"about_ca_system_score_codex":0.0033986678,"about_ca_system_score_gemma":0.0014591599,"threshold_uncertainty_score":0.039451003},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37537804,0.005753129,0.38003877,0.1224126,0.0019271036,0.00022976912,0.0003706295,0.013492535,0.100397356],"genre_scores_gemma":[0.9280986,0.0009962071,0.047434278,0.010143605,0.0003760491,0.00011375225,0.0001465497,0.003727464,0.0089634545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875223,0.0031096754,0.00047447643,0.0012799008,0.006104306,0.0015093533],"domain_scores_gemma":[0.9670536,0.01532034,0.0031053184,0.008715362,0.0044304454,0.0013749287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00935403,0.00064343325,0.00079750427,0.0008731963,0.0019332174,0.006259376,0.002929111,0.002215017,0.0045742765],"category_scores_gemma":[0.05395869,0.0009819757,0.000784111,0.0007978733,0.013141571,0.021396168,0.0061783832,0.006227941,0.0014005103],"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.0011836679,0.00033255934,0.030571945,0.0012840033,0.00023694366,0.0024086281,0.014978575,0.010256012,0.025344023,0.57361436,0.054727003,0.28506234],"study_design_scores_gemma":[0.00015192378,0.0007295395,0.006858028,0.0009030545,0.00020193943,0.0037217676,0.008385281,0.031814378,0.03698515,0.7707374,0.13920164,0.0003099357],"about_ca_topic_score_codex":0.0018457518,"about_ca_topic_score_gemma":0.0018372874,"teacher_disagreement_score":0.00935403,"about_ca_system_score_codex":0.0019093314,"about_ca_system_score_gemma":0.0028491318,"threshold_uncertainty_score":0.04946941},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66064894,0.001425699,0.2860884,0.0015854634,0.00021919106,0.00017603261,0.0014337223,0.002458074,0.045964427],"genre_scores_gemma":[0.87046885,0.0007197686,0.1142967,0.00039530173,0.000048892376,0.00011747938,0.0015446063,0.00036667436,0.012041779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999246,0.00010378282,0.000054882235,0.00020643948,0.00015786898,0.00023105645],"domain_scores_gemma":[0.9977221,0.00093759707,0.0002237014,0.0007143625,0.00018915368,0.00021309045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042156785,0.00047205755,0.000941459,0.0007349811,0.00090508896,0.0020435979,0.0014708423,0.00072285044,0.009248231],"category_scores_gemma":[0.0044692243,0.0005348481,0.00049035397,0.0013915548,0.001047698,0.0037334808,0.002297573,0.0009830897,0.0010938967],"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.002119329,0.00041273792,0.007021498,0.0011009845,0.00019130035,0.0009955292,0.0013867131,0.16681477,0.060769293,0.43602717,0.0146652255,0.30849546],"study_design_scores_gemma":[0.00021461606,0.00030549715,0.0010958554,0.00015508302,0.00015611805,0.00065908395,0.00052113103,0.3130313,0.030227678,0.6109295,0.042657923,0.00004612632],"about_ca_topic_score_codex":0.0013792318,"about_ca_topic_score_gemma":0.0019629241,"teacher_disagreement_score":0.009248231,"about_ca_system_score_codex":0.0013145525,"about_ca_system_score_gemma":0.0007750493,"threshold_uncertainty_score":0.030938387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12530398,0.00072133326,0.86353964,0.0019500857,0.000099936835,0.00015445828,0.0006860595,0.0018983235,0.0056460868],"genre_scores_gemma":[0.82075316,0.00035121402,0.16931428,0.00066550233,0.00019817466,0.00020401683,0.0015142307,0.0004932664,0.00650619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754757,0.00087935035,0.00012385492,0.0006061271,0.0004456917,0.00039731702],"domain_scores_gemma":[0.9866981,0.010100299,0.00050512544,0.0014693522,0.00053201715,0.00069521717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050434014,0.0022375963,0.003001318,0.0012635214,0.0013487886,0.002820084,0.0028225724,0.0025622903,0.007670196],"category_scores_gemma":[0.021158427,0.0013520856,0.0015376176,0.0013044428,0.004587412,0.0070296763,0.0064336536,0.0030634329,0.001033817],"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.0027749685,0.00023647581,0.0027213567,0.0004898844,0.0002219348,0.00036866494,0.0005295971,0.5905056,0.0033821627,0.27837953,0.0066307974,0.11375907],"study_design_scores_gemma":[0.00006140205,0.00006832513,0.00016778008,0.000015670703,0.000017970902,0.000022120954,0.00004070137,0.84056103,0.00093225815,0.15768906,0.000400608,0.000023142069],"about_ca_topic_score_codex":0.006618737,"about_ca_topic_score_gemma":0.0057818773,"teacher_disagreement_score":0.007670196,"about_ca_system_score_codex":0.0032461856,"about_ca_system_score_gemma":0.0040694787,"threshold_uncertainty_score":0.026672363},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033659597,0.019173397,0.73376083,0.21627772,0.006089702,0.000123032,0.00027864057,0.00045208336,0.020478567],"genre_scores_gemma":[0.29598632,0.020490315,0.57416826,0.08414812,0.012766943,0.0010868316,0.0003474309,0.0009707814,0.010035028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96011233,0.023604555,0.0026490227,0.00513803,0.007651784,0.0008442753],"domain_scores_gemma":[0.77696747,0.18977559,0.006987816,0.010026075,0.014434887,0.0018081001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06250835,0.0013974758,0.0027075654,0.0038196777,0.0031974928,0.013836412,0.005652941,0.009592608,0.0051803566],"category_scores_gemma":[0.20992233,0.0011575309,0.0023676993,0.0035589817,0.02682777,0.036733545,0.0041869907,0.022911655,0.0029305138],"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.000021540105,0.000016635413,0.0003503128,0.0002165548,0.000042481435,0.00008871734,0.0006310437,0.001492234,0.000114999326,0.97720784,0.009113591,0.010703998],"study_design_scores_gemma":[0.0000106008465,0.000007917672,0.00007497055,0.00011069643,0.0000075476346,0.00006946728,0.00009412197,0.0023193464,0.00012757385,0.98339754,0.01375998,0.000020205143],"about_ca_topic_score_codex":0.004293081,"about_ca_topic_score_gemma":0.0013885398,"teacher_disagreement_score":0.06250835,"about_ca_system_score_codex":0.0057633063,"about_ca_system_score_gemma":0.006208231,"threshold_uncertainty_score":0.33057976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16358155,0.014715008,0.6245394,0.008157858,0.00033140177,0.00006877503,0.00081794086,0.00025221746,0.18753599],"genre_scores_gemma":[0.89340556,0.0057655065,0.08207821,0.00033254302,0.00067299325,0.00013228833,0.00040482232,0.000121723366,0.017086387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947864,0.00015026874,0.00003492069,0.00012255469,0.00016957703,0.000044068092],"domain_scores_gemma":[0.9976158,0.0016758668,0.00016790423,0.00021367942,0.00020995777,0.00011689298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011334502,0.00040314053,0.00055652764,0.0017409241,0.00086804887,0.0032037133,0.0007106311,0.0009008105,0.0029862358],"category_scores_gemma":[0.004332263,0.00040167206,0.0005865082,0.0016893817,0.0043145386,0.007099453,0.001468187,0.0024630304,0.00031958544],"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.000013622338,0.0000065974737,0.00013652649,0.000033661505,0.000005123321,0.00002237322,0.00007866352,0.0013553427,0.00041462705,0.99143827,0.00064726785,0.0058478788],"study_design_scores_gemma":[0.0000043532164,0.00001563667,0.00039315136,0.000014834717,0.0000048879037,0.0000915264,0.000042851683,0.008770105,0.00032834525,0.98750687,0.0028218844,0.0000056009853],"about_ca_topic_score_codex":0.0005804208,"about_ca_topic_score_gemma":0.00041912438,"teacher_disagreement_score":0.0032037133,"about_ca_system_score_codex":0.0009991232,"about_ca_system_score_gemma":0.00048212556,"threshold_uncertainty_score":0.009989917},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015917522,0.0058624092,0.054969765,0.0027369973,0.000749112,0.000035883826,0.00023611613,0.00018700566,0.9336309],"genre_scores_gemma":[0.1720986,0.009365922,0.0391406,0.0021244448,0.0018383593,0.00026603966,0.0010035929,0.00048301305,0.7736794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954623,0.00013408635,0.000018061806,0.0000809342,0.00018783609,0.00003277221],"domain_scores_gemma":[0.99970573,0.00013144627,0.000012357536,0.00008105055,0.0000511294,0.000018211791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055864337,0.0006291074,0.00067503017,0.0011078665,0.0015547763,0.003663451,0.00091417105,0.0011121379,0.030052446],"category_scores_gemma":[0.0013855551,0.0003837665,0.0005592635,0.0013887534,0.0038818151,0.0049642394,0.0013125796,0.002881322,0.007871934],"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.0000015943688,0.0000022641236,0.000006801209,0.000017523069,0.0000010898863,0.0000036304157,0.00003937535,0.0001220885,0.000050847193,0.9857392,0.008861661,0.005153909],"study_design_scores_gemma":[0.0000014752478,0.000002094853,0.000022290697,0.000015391695,0.00000136561,0.000017294096,0.00002260912,0.0003698958,0.00008269829,0.9166001,0.08286242,0.0000023515695],"about_ca_topic_score_codex":0.00091475045,"about_ca_topic_score_gemma":0.0011840251,"teacher_disagreement_score":0.030052446,"about_ca_system_score_codex":0.0020487683,"about_ca_system_score_gemma":0.0008437097,"threshold_uncertainty_score":0.10053545},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028145863,0.009638225,0.3006222,0.10768807,0.0020869365,0.00008039203,0.00082229316,0.00085218897,0.5500638],"genre_scores_gemma":[0.9029191,0.0057455236,0.03510671,0.007455115,0.0011592675,0.00018051051,0.0008609064,0.00066636683,0.045906514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987953,0.00043540576,0.000041490977,0.0003179942,0.00024121137,0.00016869679],"domain_scores_gemma":[0.9976599,0.0013269661,0.00009182392,0.00059299404,0.00024138844,0.000086830405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001634317,0.00046178716,0.00037893056,0.0011354322,0.0012381338,0.004546837,0.0009015932,0.0019638492,0.011737861],"category_scores_gemma":[0.0061542164,0.00029162018,0.0009659331,0.0006986108,0.010084339,0.00955669,0.0016264421,0.0028606674,0.0024190028],"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.0000048226507,0.0000029118146,0.000111339374,0.00002385843,0.000006409045,0.00002775556,0.00025161594,0.00045018588,0.000059006332,0.9937224,0.0025138475,0.0028257696],"study_design_scores_gemma":[0.000003030145,0.0000015485399,0.00009998459,0.00002386216,0.0000032491848,0.000037647358,0.00008153658,0.0007933471,0.00007884602,0.9744109,0.024462191,0.0000039476204],"about_ca_topic_score_codex":0.003145776,"about_ca_topic_score_gemma":0.00202537,"teacher_disagreement_score":0.011737861,"about_ca_system_score_codex":0.0018906451,"about_ca_system_score_gemma":0.0016944944,"threshold_uncertainty_score":0.039267004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042342823,0.014025951,0.6943905,0.022293754,0.0011150842,0.00014151006,0.0023837981,0.00072040304,0.22258615],"genre_scores_gemma":[0.8110836,0.00739513,0.15017454,0.00281652,0.0023548282,0.00056028547,0.0023171452,0.00021613095,0.023081696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785644,0.0007232984,0.00014358034,0.00040822072,0.0006515813,0.00021678516],"domain_scores_gemma":[0.99589854,0.0020795257,0.00032666646,0.00070105493,0.00074756803,0.00024658922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002500116,0.0004064272,0.00060780597,0.0028641762,0.0018626376,0.006074749,0.0012575638,0.0010775297,0.008709063],"category_scores_gemma":[0.0055483384,0.0003875694,0.00078655325,0.002238694,0.008113983,0.0072800154,0.0036806501,0.0037610766,0.0012321267],"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.0000015865386,0.0000025086763,0.000040989275,0.000016591564,0.0000019887434,0.00000917255,0.00007014208,0.0001278293,0.000053846456,0.99771047,0.00038472036,0.0015801877],"study_design_scores_gemma":[0.0000051454335,0.0000037080188,0.000082736224,0.000014953467,0.0000017273927,0.000022598815,0.000034059765,0.0007865092,0.00007904946,0.9850898,0.013876353,0.0000034478028],"about_ca_topic_score_codex":0.0019732595,"about_ca_topic_score_gemma":0.0013172633,"teacher_disagreement_score":0.008709063,"about_ca_system_score_codex":0.0038773904,"about_ca_system_score_gemma":0.0015697791,"threshold_uncertainty_score":0.02913475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087800376,0.0025403122,0.71154356,0.0030433626,0.0004865388,0.000098121665,0.0018344157,0.003050482,0.1896029],"genre_scores_gemma":[0.6638401,0.003006367,0.2131334,0.0012881798,0.00049915083,0.00030518323,0.0034997829,0.0017234018,0.11270443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998276,0.0004047384,0.00018430785,0.0004657178,0.00041005097,0.000259186],"domain_scores_gemma":[0.9979175,0.00092078414,0.00021665664,0.00031249892,0.00040197853,0.00023064387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014929624,0.0010500175,0.0008491024,0.0023420101,0.0019790763,0.005091838,0.0014971452,0.0009883299,0.012702514],"category_scores_gemma":[0.0036402475,0.0007187099,0.0016757062,0.0030368431,0.0029065001,0.009731871,0.0033650834,0.002363748,0.0042018527],"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.000010352811,0.000008149934,0.00007520666,0.000036402296,0.000005457005,0.000056761764,0.00018570617,0.0004929126,0.00024262264,0.99064845,0.0013178264,0.006920121],"study_design_scores_gemma":[0.0000069072744,0.000006448771,0.00006702339,0.000020081206,0.000006703078,0.000052364154,0.00007696643,0.0018558368,0.0003891053,0.98639596,0.011111716,0.0000109157245],"about_ca_topic_score_codex":0.0018835121,"about_ca_topic_score_gemma":0.0026423754,"teacher_disagreement_score":0.012702514,"about_ca_system_score_codex":0.0023963796,"about_ca_system_score_gemma":0.0010568257,"threshold_uncertainty_score":0.042494178},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3315651,0.019387469,0.12497145,0.35228252,0.0011462291,0.00020334717,0.00018710044,0.000103623956,0.17015308],"genre_scores_gemma":[0.9802713,0.0029507189,0.008652975,0.0049443855,0.00048353078,0.00014826616,0.00002942763,0.000017644046,0.0025016265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968016,0.0022715812,0.00010648688,0.00027018925,0.00035813448,0.00019193905],"domain_scores_gemma":[0.9654641,0.029544028,0.0022966533,0.00074308284,0.0009166971,0.0010353299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004220625,0.00040803998,0.000619927,0.001294913,0.0011331302,0.0035251833,0.001449591,0.0021715837,0.005089483],"category_scores_gemma":[0.020528233,0.0002418719,0.0006467106,0.0010043092,0.015654968,0.006443363,0.0029367788,0.0038443292,0.000231555],"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.000050133258,0.00008641284,0.0039689797,0.00009531557,0.000011042609,0.00015581734,0.0021366384,0.00087266514,0.00010328739,0.98216945,0.0008890685,0.009461098],"study_design_scores_gemma":[0.000013545555,0.00002760667,0.0038927079,0.000092805465,0.000008591189,0.00019018052,0.0014795089,0.0018079585,0.00006841101,0.9889876,0.0034179927,0.000013053133],"about_ca_topic_score_codex":0.001093285,"about_ca_topic_score_gemma":0.0010294155,"teacher_disagreement_score":0.005089483,"about_ca_system_score_codex":0.0017957808,"about_ca_system_score_gemma":0.0017597559,"threshold_uncertainty_score":0.022321045},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33967844,0.02175907,0.17034432,0.12666005,0.0006207325,0.00021264296,0.00049413776,0.00021750468,0.3400131],"genre_scores_gemma":[0.98381156,0.0021440415,0.008609014,0.0012199546,0.00027255894,0.000107891865,0.00007358014,0.000044775687,0.003716702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947272,0.0034396916,0.00020333419,0.0006448764,0.0006080421,0.00037683203],"domain_scores_gemma":[0.9638506,0.028981954,0.0030770102,0.0015157582,0.0012757581,0.001298943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059388364,0.0004933778,0.00092011987,0.0020530948,0.001901461,0.006225064,0.0019191626,0.0022135908,0.009215524],"category_scores_gemma":[0.024368297,0.00031408953,0.0012479519,0.0020067922,0.026688196,0.009126974,0.0039829924,0.0035800969,0.0006113196],"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.000028885279,0.000034063167,0.0037115228,0.000113351416,0.000018820081,0.00012685475,0.0028668544,0.0013638405,0.00004857627,0.98570514,0.0007873383,0.005194607],"study_design_scores_gemma":[0.000015084498,0.000012235713,0.0021655543,0.00007365538,0.00000606661,0.00016756718,0.0015372123,0.0028607638,0.000023207262,0.98784083,0.0052832407,0.000014546352],"about_ca_topic_score_codex":0.002996626,"about_ca_topic_score_gemma":0.0021762652,"teacher_disagreement_score":0.009215524,"about_ca_system_score_codex":0.0029641194,"about_ca_system_score_gemma":0.0022298286,"threshold_uncertainty_score":0.031407952},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032076128,0.08895142,0.017307607,0.059647415,0.1345614,0.00024997274,0.0061327554,0.0010076852,0.688934],"genre_scores_gemma":[0.055803042,0.062451992,0.017845774,0.030003227,0.11525827,0.00030673252,0.014595296,0.0016676664,0.702068],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998086,0.0003048093,0.00013130943,0.00043322716,0.00079831365,0.00024633322],"domain_scores_gemma":[0.9952247,0.0010492943,0.00024243453,0.00080789934,0.0021349525,0.00054075965],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013676644,0.0010390799,0.0010550182,0.0052839173,0.0024040684,0.006869381,0.0018811185,0.002252443,0.15140061],"category_scores_gemma":[0.009066447,0.00042279492,0.0012241615,0.0091858655,0.0009776293,0.0036013967,0.0021569273,0.0037150807,0.059092667],"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.00014343915,0.0001152799,0.00037619588,0.0007773661,0.00004073095,0.00015611998,0.000053000105,0.00079939864,0.00064886454,0.043778054,0.8413622,0.11174942],"study_design_scores_gemma":[0.000028707604,0.000027853834,0.0007808553,0.0003688526,0.000041506326,0.0001930405,0.00007733805,0.0008154831,0.0005545052,0.027048599,0.9700422,0.000020951518],"about_ca_topic_score_codex":0.00665464,"about_ca_topic_score_gemma":0.0052495827,"teacher_disagreement_score":0.8485994,"about_ca_system_score_codex":0.005145261,"about_ca_system_score_gemma":0.0029989248,"threshold_uncertainty_score":0.50648546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10725297,0.002248171,0.8778274,0.0016805675,0.00017103192,0.00023268661,0.0005653769,0.0015627226,0.008458995],"genre_scores_gemma":[0.80761904,0.00079097267,0.18704246,0.00026073962,0.00016555545,0.00026332322,0.00079951686,0.0001700916,0.002888224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596184,0.0015272314,0.00030343886,0.00050461636,0.0015206623,0.00018216085],"domain_scores_gemma":[0.98268914,0.01237538,0.0011767838,0.0013220481,0.0018760422,0.00056060933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058067837,0.0015855673,0.0013541244,0.0037236486,0.00079930364,0.0030984976,0.0013603326,0.0023112637,0.0030096895],"category_scores_gemma":[0.034581535,0.00046112738,0.0007219686,0.0016421683,0.001571882,0.0050473367,0.0030582268,0.0018966809,0.0006433872],"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.0005900692,0.00018509594,0.010293253,0.00047374278,0.00031743947,0.00018159446,0.00015101444,0.7007304,0.004092285,0.07076188,0.003513923,0.2087094],"study_design_scores_gemma":[0.00001746841,0.0001094885,0.0005891652,0.00002557504,0.000024542464,0.000046997953,0.000033368426,0.95725363,0.0015420709,0.039719295,0.00061805575,0.000020281286],"about_ca_topic_score_codex":0.0019297318,"about_ca_topic_score_gemma":0.002504822,"teacher_disagreement_score":0.0058067837,"about_ca_system_score_codex":0.0018058477,"about_ca_system_score_gemma":0.0018591674,"threshold_uncertainty_score":0.030709624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092001826,0.001216853,0.65711427,0.011331134,0.00038551085,0.00012201224,0.00044738894,0.000457898,0.23692311],"genre_scores_gemma":[0.9040519,0.00065953506,0.06484123,0.0013401108,0.0006515995,0.00012517924,0.0003951105,0.00017631332,0.027758997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976615,0.00081962644,0.00011613362,0.0004408677,0.0007620388,0.00019997222],"domain_scores_gemma":[0.9951708,0.0025178248,0.00029467183,0.0010115119,0.0007411542,0.0002640975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003254186,0.00034120248,0.00058150577,0.0016887987,0.0013288528,0.0023175506,0.0020043403,0.0012865829,0.009094305],"category_scores_gemma":[0.0068942397,0.00034067285,0.0013339606,0.0010238162,0.007520173,0.0063831196,0.003971904,0.0027089757,0.0012173535],"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.0000031185973,0.0000032595028,0.00008240756,0.000008184455,0.0000020496702,0.000012153806,0.000046734305,0.00042714053,0.000059877697,0.9980965,0.00033777754,0.0009207925],"study_design_scores_gemma":[0.000006724529,0.000006951069,0.00008412218,0.0000074291993,0.0000029567464,0.00002797031,0.00003061205,0.0058025513,0.00011466263,0.98942715,0.0044841743,0.0000046522055],"about_ca_topic_score_codex":0.0012477712,"about_ca_topic_score_gemma":0.0006804324,"teacher_disagreement_score":0.009094305,"about_ca_system_score_codex":0.0016434385,"about_ca_system_score_gemma":0.0007921544,"threshold_uncertainty_score":0.030423462},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018585589,0.005243306,0.88652986,0.0060508335,0.0005850954,0.00003472697,0.00013010665,0.00021892952,0.082621485],"genre_scores_gemma":[0.7379795,0.003966275,0.24376087,0.0014453495,0.0012128383,0.00012896204,0.00023071149,0.00016944097,0.011106088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596965,0.001836051,0.00016640424,0.0004724031,0.0013140248,0.00024144437],"domain_scores_gemma":[0.9968676,0.0015181326,0.00023118367,0.0006246581,0.00054414786,0.00021428168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041959514,0.0006786637,0.00092129497,0.0033458665,0.0018685013,0.0054530753,0.0021235137,0.0014819108,0.004765266],"category_scores_gemma":[0.0057479762,0.0004219462,0.0011496515,0.0014607281,0.011503952,0.011801771,0.0047220183,0.003467059,0.0008000767],"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.0000010817128,0.0000011939694,0.00001354572,0.0000075134035,0.0000011969702,0.000007663755,0.00004990804,0.00025077316,0.00003775306,0.9988262,0.00007962288,0.00072359265],"study_design_scores_gemma":[0.0000028720651,0.000005863808,0.000053271848,0.00002134477,0.0000026172802,0.00003368845,0.00006165885,0.0036748343,0.000097758755,0.9871587,0.008881204,0.0000062760623],"about_ca_topic_score_codex":0.002108645,"about_ca_topic_score_gemma":0.002088806,"teacher_disagreement_score":0.0054530753,"about_ca_system_score_codex":0.0040209484,"about_ca_system_score_gemma":0.002365154,"threshold_uncertainty_score":0.029174149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24148458,0.00045209008,0.6856766,0.0006942437,0.00048984116,0.000103187966,0.0004955486,0.0068932977,0.063710675],"genre_scores_gemma":[0.8076814,0.00011753587,0.18130392,0.00016345948,0.000084498846,0.000081446626,0.0005433585,0.0009324487,0.009091949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951327,0.00010609091,0.0000348924,0.00012915258,0.00013534623,0.00008126542],"domain_scores_gemma":[0.9983033,0.0010429989,0.00009387191,0.0002832187,0.00018857923,0.00008788394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007355946,0.0007639927,0.000907778,0.0013042246,0.0010241712,0.0031857858,0.0012444651,0.0009453768,0.011350125],"category_scores_gemma":[0.005765899,0.00044558058,0.0010209593,0.0013422027,0.0015354275,0.0047189826,0.0016798403,0.0018288376,0.002083858],"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.00054058986,0.0001711537,0.0022558242,0.00021992358,0.00005119151,0.00026551614,0.000501435,0.06807197,0.0087835975,0.7896371,0.009826567,0.11967506],"study_design_scores_gemma":[0.000039408213,0.000042818556,0.00021468468,0.00003247191,0.000018929648,0.000046495767,0.00009940471,0.24560519,0.0048379297,0.7457591,0.003275865,0.000027610062],"about_ca_topic_score_codex":0.0025854276,"about_ca_topic_score_gemma":0.0034201562,"teacher_disagreement_score":0.011350125,"about_ca_system_score_codex":0.001557485,"about_ca_system_score_gemma":0.000732459,"threshold_uncertainty_score":0.037969947},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030228458,0.7754,0.14278151,0.0038607814,0.0035709064,0.000033490276,0.00017662118,0.00022602973,0.070927866],"genre_scores_gemma":[0.05839009,0.8000584,0.098888844,0.002832894,0.015372792,0.00014633944,0.00048946915,0.000359758,0.02346139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896586,0.00032132532,0.00010253273,0.00020495313,0.00033436358,0.000070906615],"domain_scores_gemma":[0.99770784,0.0015799643,0.00010014836,0.00016742689,0.0003855544,0.000059022543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018704659,0.0011891434,0.0011982808,0.0046247346,0.00077635515,0.0027323177,0.0010987613,0.0015045804,0.0067372695],"category_scores_gemma":[0.003862793,0.0006234142,0.0011324222,0.0066571594,0.0018038558,0.005206601,0.0011181287,0.0036757381,0.0039527593],"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.000039934806,0.000063140826,0.00045536552,0.0028684451,0.00004702065,0.000231008,0.00033964237,0.0030500924,0.0012430168,0.6866592,0.026385287,0.2786179],"study_design_scores_gemma":[0.000006154522,0.00009251363,0.00075529463,0.00084155326,0.000033469456,0.0012412847,0.00014471545,0.0067499224,0.0007112507,0.39054325,0.5988136,0.00006704346],"about_ca_topic_score_codex":0.00091593317,"about_ca_topic_score_gemma":0.0005287774,"teacher_disagreement_score":0.0067372695,"about_ca_system_score_codex":0.001613353,"about_ca_system_score_gemma":0.0010072183,"threshold_uncertainty_score":0.022538364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05199934,0.0019122822,0.87048435,0.009165912,0.000267806,0.000113464346,0.0004979617,0.00027308124,0.06528579],"genre_scores_gemma":[0.80471784,0.0020555996,0.17891578,0.0022273227,0.00075867533,0.00046560093,0.0005413783,0.00011412316,0.010203589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944951,0.0016924037,0.00028925075,0.0011713231,0.0019841597,0.00036776336],"domain_scores_gemma":[0.9797561,0.013878075,0.0012813046,0.0029248353,0.0016855126,0.00047424308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005452708,0.00074072083,0.0011419007,0.0022888593,0.0019658005,0.0057810303,0.002698058,0.0024992824,0.0046199546],"category_scores_gemma":[0.019305639,0.00066672615,0.0013267442,0.0013563056,0.014395631,0.016266234,0.0027228943,0.005182665,0.00062882295],"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.0000064232645,0.0000060272946,0.00008093246,0.000028785344,0.0000057221196,0.000022964896,0.00006963886,0.0012986438,0.00016502634,0.99675,0.00027400543,0.0012918875],"study_design_scores_gemma":[0.0000051653155,0.000008596262,0.000039770326,0.000013344697,0.0000043232017,0.000032747797,0.00001809825,0.0067046387,0.00018791217,0.99143255,0.0015472138,0.000005625085],"about_ca_topic_score_codex":0.0008064397,"about_ca_topic_score_gemma":0.00037374825,"teacher_disagreement_score":0.0057810303,"about_ca_system_score_codex":0.0031504985,"about_ca_system_score_gemma":0.0020024457,"threshold_uncertainty_score":0.028837025},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12542048,0.0043768412,0.079110734,0.021130333,0.0030575711,0.0001304447,0.0005288125,0.0013745942,0.76487017],"genre_scores_gemma":[0.8120336,0.0019650124,0.02566511,0.0056792833,0.0028248157,0.00018442083,0.0008630217,0.00085590873,0.14992899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977412,0.00069627713,0.00011211861,0.000616264,0.00054375746,0.00029024473],"domain_scores_gemma":[0.99673176,0.0012596534,0.00031231757,0.0010228932,0.0004093671,0.00026399287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415742,0.0011222652,0.0009582644,0.0024542208,0.0022035295,0.006964758,0.0009069017,0.0017205446,0.04034136],"category_scores_gemma":[0.004886764,0.0005382185,0.00083425635,0.001340127,0.0076282457,0.017912269,0.0050933748,0.0045487494,0.008532725],"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.000025445312,0.000025769621,0.00011396687,0.00003964207,0.0000062815525,0.00002262596,0.00043796716,0.00006699013,0.0003080479,0.98889506,0.0037112676,0.006346921],"study_design_scores_gemma":[0.000025792564,0.000012575449,0.0001708884,0.0000099512245,0.000006272927,0.00006461342,0.0002344507,0.0001010285,0.00030559214,0.96849936,0.030561503,0.000007885795],"about_ca_topic_score_codex":0.00043493925,"about_ca_topic_score_gemma":0.00046373604,"teacher_disagreement_score":0.04034136,"about_ca_system_score_codex":0.0009021341,"about_ca_system_score_gemma":0.00046199962,"threshold_uncertainty_score":0.13495523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046668343,0.0005357861,0.93701154,0.0012376421,0.00008412832,0.00006207127,0.00026133502,0.0010260037,0.013113029],"genre_scores_gemma":[0.9337891,0.00063767016,0.05745056,0.00049119705,0.00010783295,0.00007814444,0.00031681237,0.00043049184,0.006698196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798226,0.000705983,0.00010812267,0.00050005503,0.0004784342,0.0002250326],"domain_scores_gemma":[0.9932521,0.0038055072,0.00048332225,0.0016369881,0.0005891868,0.00023286026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026743053,0.0007085709,0.0008949294,0.0009990594,0.0008571,0.0023537804,0.0017185647,0.0012759981,0.006750627],"category_scores_gemma":[0.016541483,0.0005625922,0.0012403422,0.0010390333,0.0041028666,0.0057972916,0.003436273,0.0036007876,0.0009944172],"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.00017620256,0.000053371215,0.0013520288,0.00008117195,0.000045407323,0.0002020288,0.00014303788,0.195125,0.0020922148,0.7567315,0.0024673142,0.041530583],"study_design_scores_gemma":[0.000011697228,0.00003598295,0.00010332966,0.000015459229,0.000014767782,0.00013351247,0.00002228202,0.45502687,0.0020684525,0.54052377,0.0020273332,0.000016536593],"about_ca_topic_score_codex":0.0024855966,"about_ca_topic_score_gemma":0.0017837443,"teacher_disagreement_score":0.006750627,"about_ca_system_score_codex":0.002000483,"about_ca_system_score_gemma":0.0018436067,"threshold_uncertainty_score":0.022583067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020969406,0.02203535,0.39111078,0.2830254,0.0064043924,0.000102518745,0.00019967418,0.00067720807,0.27547523],"genre_scores_gemma":[0.83263004,0.008672008,0.105564125,0.020742157,0.0056392876,0.00045541173,0.00018028817,0.00036058857,0.02575602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98780906,0.007501729,0.0006467021,0.0011843559,0.0024201297,0.0004380264],"domain_scores_gemma":[0.9798956,0.012966701,0.00085923495,0.002844519,0.002590852,0.0008430173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012944498,0.0008248106,0.00084086374,0.0032671557,0.0030990825,0.011401268,0.0032477782,0.005219133,0.0042260895],"category_scores_gemma":[0.015041061,0.000544046,0.0011978836,0.0015282363,0.058811132,0.01824464,0.0066500558,0.012517613,0.0013151072],"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.0000024181277,0.0000023495843,0.00001258331,0.000017149749,0.0000018681832,0.000010444942,0.00024975822,0.00020773405,0.000028342381,0.9981431,0.0006455237,0.0006787219],"study_design_scores_gemma":[0.0000049187897,0.0000044018684,0.00001526824,0.00003639686,0.00000233965,0.000019685687,0.000106170955,0.0013473327,0.00005145866,0.98129946,0.017107148,0.0000053794174],"about_ca_topic_score_codex":0.0032820392,"about_ca_topic_score_gemma":0.0017085155,"teacher_disagreement_score":0.012944498,"about_ca_system_score_codex":0.007946316,"about_ca_system_score_gemma":0.003749483,"threshold_uncertainty_score":0.0684579},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020672157,0.52158535,0.04745714,0.14006132,0.08289412,0.000043646294,0.0004871783,0.0005067875,0.20489721],"genre_scores_gemma":[0.06466464,0.22063467,0.041736834,0.011223308,0.07764028,0.00010587944,0.00055640045,0.0008751822,0.5825628],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993017,0.00015967162,0.000026613028,0.00020344244,0.00023739532,0.00007125291],"domain_scores_gemma":[0.999198,0.00032361105,0.000031999938,0.000054891323,0.00019589107,0.00019554317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011861478,0.0018471156,0.0011219238,0.0015813179,0.0009068288,0.0022650298,0.000993378,0.0021407043,0.01762],"category_scores_gemma":[0.0026495794,0.00045084496,0.00058958464,0.0015397158,0.0017527788,0.0032492606,0.0018440965,0.005210354,0.009303014],"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.00004364023,0.000052980122,0.00021392465,0.00041523922,0.000028535856,0.000072299445,0.00045024254,0.00097432395,0.00077885017,0.24572161,0.6424636,0.10878473],"study_design_scores_gemma":[0.000009545013,0.000016753555,0.00033387681,0.00023426446,0.000011132825,0.00013127267,0.00008695555,0.0006401134,0.00040539622,0.067178145,0.9309374,0.000015039173],"about_ca_topic_score_codex":0.002064738,"about_ca_topic_score_gemma":0.003988501,"teacher_disagreement_score":0.01762,"about_ca_system_score_codex":0.0029319853,"about_ca_system_score_gemma":0.0012742322,"threshold_uncertainty_score":0.05894476},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43578225,0.0029997006,0.2502515,0.004244829,0.00036156308,0.00008680658,0.0008735632,0.00065663893,0.30474317],"genre_scores_gemma":[0.96888775,0.0005207002,0.014485624,0.00027316128,0.00016276927,0.00004273634,0.0002613478,0.00006723555,0.01529875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946374,0.000076735225,0.00002651069,0.00011583028,0.0001982945,0.00011893284],"domain_scores_gemma":[0.99944335,0.0001390826,0.00006795076,0.000108479006,0.00014654355,0.000094633135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042890743,0.00024179628,0.0003478765,0.0010440715,0.0016503943,0.0023646995,0.0010246255,0.0005827789,0.009361089],"category_scores_gemma":[0.00096581795,0.00019143477,0.00043567026,0.00088738673,0.0032700128,0.00529626,0.0024823227,0.0009867187,0.0009361445],"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.000005101969,0.0000023795972,0.00019693063,0.000022985732,0.0000026610508,0.000033850534,0.00013875146,0.00026847748,0.00029443463,0.99596137,0.0004274072,0.0026456038],"study_design_scores_gemma":[0.000005596731,0.000016723676,0.0005507246,0.000015062801,0.000005494157,0.00016752463,0.00021675846,0.0025262043,0.00059339905,0.97905356,0.016839152,0.0000099779945],"about_ca_topic_score_codex":0.0013116329,"about_ca_topic_score_gemma":0.00075553375,"teacher_disagreement_score":0.009361089,"about_ca_system_score_codex":0.0011535381,"about_ca_system_score_gemma":0.00053659163,"threshold_uncertainty_score":0.031315982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00338105,0.015249503,0.28578323,0.008209472,0.0020132377,0.00008266697,0.00082759216,0.0023104239,0.68214285],"genre_scores_gemma":[0.1329802,0.024789467,0.20798416,0.006202749,0.0027947088,0.00072781235,0.0027745713,0.003873861,0.61787236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913764,0.00016289757,0.000040696825,0.0001916898,0.0003910181,0.000075950076],"domain_scores_gemma":[0.9986657,0.0005833979,0.000051970666,0.00029392692,0.00034370978,0.00006126077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010789257,0.0009113164,0.0007537801,0.0013522311,0.00078378856,0.003547201,0.0011080164,0.0011449766,0.049194273],"category_scores_gemma":[0.0071077133,0.00042159602,0.00088645803,0.0013977122,0.0015976247,0.0058332514,0.0023444,0.0038045663,0.027093206],"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.000014993572,0.000017017803,0.00020170893,0.00019293015,0.000012338777,0.00004775793,0.00015425833,0.0019950303,0.0005265632,0.7836213,0.11702727,0.096188895],"study_design_scores_gemma":[0.0000065260338,0.000014663258,0.00032532294,0.0001567152,0.000008595031,0.0002219986,0.000054608783,0.0060063913,0.0005961257,0.6830352,0.30955812,0.000015741869],"about_ca_topic_score_codex":0.0012202907,"about_ca_topic_score_gemma":0.0011858111,"teacher_disagreement_score":0.049194273,"about_ca_system_score_codex":0.0022329267,"about_ca_system_score_gemma":0.0010169031,"threshold_uncertainty_score":0.16457123},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033826018,0.0132599715,0.39967772,0.009763829,0.001984736,0.00016144339,0.0012939196,0.002096605,0.5683792],"genre_scores_gemma":[0.11123031,0.02006814,0.33706322,0.005437496,0.0024165567,0.00093004276,0.0038454891,0.0028809158,0.5161279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988199,0.00017183741,0.00007986405,0.00026906017,0.0005558969,0.00010338744],"domain_scores_gemma":[0.9989158,0.0005339778,0.00004321629,0.00022844765,0.00022910524,0.000049447266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075567164,0.0011420996,0.000675659,0.0009400844,0.0008870042,0.004312605,0.0012132752,0.001119011,0.05416883],"category_scores_gemma":[0.0047313995,0.00045856743,0.0011203618,0.0013743391,0.0013739008,0.0069903145,0.0020330583,0.004001785,0.02231356],"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.000024023597,0.000025351697,0.00013499384,0.00028722623,0.00001792637,0.00004229635,0.00022413039,0.0027827732,0.000720855,0.7462011,0.12002279,0.12951651],"study_design_scores_gemma":[0.0000087961325,0.000019297468,0.00023743206,0.00012987456,0.000008333556,0.00020411938,0.00005831272,0.004806897,0.00072344387,0.62559116,0.368197,0.000015371848],"about_ca_topic_score_codex":0.0011325257,"about_ca_topic_score_gemma":0.0011138131,"teacher_disagreement_score":0.05416883,"about_ca_system_score_codex":0.0025070952,"about_ca_system_score_gemma":0.0010458053,"threshold_uncertainty_score":0.18121278},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028318426,0.0018556071,0.8927828,0.00789229,0.0009180763,0.00079145393,0.0023516587,0.019037375,0.046052303],"genre_scores_gemma":[0.33760342,0.0018343476,0.6172154,0.00373781,0.00081204105,0.0011250471,0.005216702,0.00298279,0.029472496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99306595,0.0011685155,0.00054007425,0.002682733,0.0016821681,0.0008604458],"domain_scores_gemma":[0.98621935,0.0063853636,0.0005907707,0.005684408,0.0008501372,0.00026996786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003224145,0.0025922281,0.0020195213,0.0016656274,0.0022289506,0.004946169,0.005555873,0.0026355782,0.021076692],"category_scores_gemma":[0.0161407,0.0014875259,0.0041555255,0.0035252338,0.002968213,0.010967799,0.006541957,0.005472066,0.009868299],"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.0017413445,0.00040260513,0.0026828966,0.0015671569,0.00043984977,0.00032367263,0.00053319754,0.0631653,0.018941946,0.42372566,0.09257269,0.39390367],"study_design_scores_gemma":[0.00040448754,0.00016931629,0.00083994924,0.00008526832,0.00021799731,0.0003945291,0.00015500736,0.16525434,0.01053427,0.7775196,0.04432857,0.000096665244],"about_ca_topic_score_codex":0.0037676822,"about_ca_topic_score_gemma":0.0052834763,"teacher_disagreement_score":0.021076692,"about_ca_system_score_codex":0.0048391754,"about_ca_system_score_gemma":0.0055696713,"threshold_uncertainty_score":0.07050854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93272763,0.0003254669,0.05050427,0.00030626036,0.000026518313,0.00003750965,0.00010292107,0.00023450197,0.015734982],"genre_scores_gemma":[0.9935183,0.00008513829,0.003848225,0.00002158533,0.000022328855,0.000026570877,0.00006879346,0.000020096419,0.0023888182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905306,0.00015397646,0.00006859832,0.0003042811,0.00019178017,0.0002283333],"domain_scores_gemma":[0.9974669,0.0012732293,0.0003841902,0.00045479057,0.00019422577,0.00022669428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080932816,0.00036250523,0.0005146315,0.0014327324,0.00095069874,0.002881181,0.00082520244,0.00058503984,0.002983253],"category_scores_gemma":[0.0035149655,0.00033409157,0.0007747082,0.00055094104,0.0042215553,0.0049011013,0.0017772145,0.001344601,0.00022787965],"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.00012657604,0.00006596555,0.0027753671,0.00006635307,0.000018257297,0.00031567586,0.0017936077,0.004525806,0.004405663,0.975371,0.00016512549,0.010370626],"study_design_scores_gemma":[0.00004769676,0.0000896273,0.0015287146,0.000025570393,0.000026734213,0.00030720502,0.0005200579,0.020255858,0.010081202,0.96351874,0.0035643782,0.00003412263],"about_ca_topic_score_codex":0.0009428832,"about_ca_topic_score_gemma":0.000550667,"teacher_disagreement_score":0.002983253,"about_ca_system_score_codex":0.0013566912,"about_ca_system_score_gemma":0.00046936673,"threshold_uncertainty_score":0.009979963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17178558,0.0008332302,0.71533835,0.0019151752,0.00054468476,0.00022234372,0.0007194946,0.000945917,0.107695304],"genre_scores_gemma":[0.77145004,0.0010235858,0.18838832,0.0020365075,0.0005301392,0.00041496658,0.0010759853,0.0004909827,0.0345894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998312,0.00034637205,0.00007942523,0.0005704939,0.00040693555,0.000284895],"domain_scores_gemma":[0.99357104,0.0033351213,0.00054853165,0.0012102433,0.0006590388,0.00067611743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021547484,0.00086971873,0.001025189,0.0013460027,0.0016092523,0.0019646015,0.0018272436,0.0010226839,0.015310005],"category_scores_gemma":[0.008009387,0.00041705786,0.0012909004,0.0011910821,0.0021412605,0.006014766,0.0040724636,0.0030669342,0.0019843217],"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.00014938545,0.000048371425,0.0006677049,0.00013526597,0.000029349889,0.00022478602,0.00033335484,0.005177023,0.0038695168,0.9702232,0.003036748,0.016105268],"study_design_scores_gemma":[0.00005950485,0.00015166272,0.00070265704,0.000043107084,0.0000538892,0.00043740452,0.00011026324,0.037383314,0.0060147,0.9365689,0.018438114,0.000036529214],"about_ca_topic_score_codex":0.0004990113,"about_ca_topic_score_gemma":0.0005939592,"teacher_disagreement_score":0.015310005,"about_ca_system_score_codex":0.0010679613,"about_ca_system_score_gemma":0.0005856401,"threshold_uncertainty_score":0.05121714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6833472,0.004477903,0.18140641,0.010270599,0.00015397555,0.00007075783,0.00044658314,0.0002177282,0.11960889],"genre_scores_gemma":[0.9780402,0.000768136,0.01690136,0.00020119033,0.00018506948,0.000044901604,0.00011202339,0.000027552655,0.003719635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993506,0.00023376329,0.000040827184,0.00010331609,0.0002137383,0.00005773904],"domain_scores_gemma":[0.9977653,0.0014600948,0.00021549813,0.00025343234,0.00015228588,0.0001534469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011893389,0.000294274,0.00046181868,0.0014625047,0.0010031043,0.0027976886,0.0006565402,0.0008066726,0.0020692074],"category_scores_gemma":[0.003300513,0.0002037457,0.0006320974,0.0008892938,0.0043373876,0.005760503,0.0014962124,0.0016672696,0.00016117377],"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.0000057284155,0.0000049919167,0.00021540272,0.000017822473,0.0000022710196,0.000016474134,0.00007274346,0.0014895374,0.00015701189,0.99587786,0.00024766018,0.0018924887],"study_design_scores_gemma":[0.0000028397264,0.000004687341,0.0003201001,0.0000067705173,0.0000018363736,0.000024673678,0.00003017224,0.009479148,0.00016003867,0.9891834,0.0007803777,0.000005920875],"about_ca_topic_score_codex":0.0012870322,"about_ca_topic_score_gemma":0.0008740841,"teacher_disagreement_score":0.0027976886,"about_ca_system_score_codex":0.0025436939,"about_ca_system_score_gemma":0.00072372175,"threshold_uncertainty_score":0.018455863},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024722243,0.0012101642,0.9684765,0.0009707774,0.000064448075,0.00004262663,0.00015238566,0.00047171573,0.003889128],"genre_scores_gemma":[0.6800848,0.0017836794,0.30787465,0.001494686,0.00027700615,0.00032750863,0.0013070434,0.000829448,0.0060212016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981041,0.00079154613,0.00010549379,0.000435252,0.0004129363,0.00015058952],"domain_scores_gemma":[0.98901576,0.008353944,0.00043187058,0.0010677844,0.0007640891,0.00036652622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004534629,0.0015963262,0.0014064306,0.0009179167,0.00084375835,0.0024116323,0.0017519254,0.0018587267,0.002939841],"category_scores_gemma":[0.021805793,0.00074943324,0.0010203745,0.0008320303,0.002564963,0.0041799885,0.00461254,0.0051252143,0.00069849595],"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.00028787262,0.0001517626,0.0032240131,0.00028956807,0.00017027627,0.00017878697,0.00037648465,0.6859292,0.008722423,0.15598458,0.0053612185,0.13932383],"study_design_scores_gemma":[0.000015394176,0.00007125796,0.0002265742,0.000044329416,0.000014076894,0.000060200393,0.000031518677,0.95166475,0.0020111417,0.044598192,0.0012445773,0.000017959434],"about_ca_topic_score_codex":0.0038977042,"about_ca_topic_score_gemma":0.005471957,"teacher_disagreement_score":0.004534629,"about_ca_system_score_codex":0.0011893202,"about_ca_system_score_gemma":0.0017447028,"threshold_uncertainty_score":0.02398169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80104417,0.00073942833,0.15978234,0.00053724827,0.00006419864,0.000048891245,0.00048973307,0.00036013237,0.03693392],"genre_scores_gemma":[0.95360655,0.00027974826,0.03671849,0.000080841266,0.00007612665,0.000037428337,0.00045485597,0.000055024637,0.008690958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996637,0.000047333746,0.000022295002,0.00009537182,0.00010372258,0.000067660876],"domain_scores_gemma":[0.99850994,0.0005571474,0.00028900197,0.00018846292,0.00021032458,0.0002451077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034276483,0.00023456705,0.00025352207,0.0011982197,0.000887574,0.0018001092,0.00048608394,0.00030814705,0.0048397635],"category_scores_gemma":[0.0014525861,0.00027449548,0.000363592,0.0009135346,0.0014658875,0.0027843546,0.00076446676,0.0010235455,0.00047862154],"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.00006435887,0.000044232067,0.002561819,0.000074624564,0.000009709455,0.00020105849,0.000693932,0.0023833937,0.0062302183,0.97545314,0.0006942682,0.011589371],"study_design_scores_gemma":[0.000033518085,0.00011215162,0.0032583806,0.000038607126,0.00003795866,0.00036687314,0.00034609184,0.026758187,0.008380418,0.94369215,0.016945649,0.000030021703],"about_ca_topic_score_codex":0.0011078665,"about_ca_topic_score_gemma":0.0014357973,"teacher_disagreement_score":0.0048397635,"about_ca_system_score_codex":0.0007545933,"about_ca_system_score_gemma":0.00036521675,"threshold_uncertainty_score":0.016190648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33000612,0.00020566807,0.5399307,0.0009578123,0.00017823072,0.00034193465,0.0002694542,0.00042899422,0.12768109],"genre_scores_gemma":[0.9156684,0.00008822589,0.0643675,0.00017979331,0.00003225312,0.00023537902,0.00011394023,0.00004137597,0.019273212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968759,0.0014809126,0.00015490531,0.00036585485,0.000580378,0.0005419229],"domain_scores_gemma":[0.9960639,0.0020223125,0.0002947102,0.00053839816,0.00051663944,0.00056409946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022647714,0.0007227252,0.0005266462,0.00059698505,0.0008263836,0.0020384446,0.00069219235,0.0013853922,0.012222976],"category_scores_gemma":[0.006998766,0.00037366844,0.00054842175,0.00039382328,0.0019913977,0.002119254,0.0016815028,0.001339019,0.00093977415],"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.00063989195,0.00009868065,0.0015113705,0.00013276438,0.00004112123,0.00030526795,0.00039636332,0.038879763,0.007429772,0.9182852,0.0022585783,0.03002124],"study_design_scores_gemma":[0.00013667098,0.00069649203,0.0007959212,0.00006799637,0.000038026537,0.00030775438,0.0006520142,0.2386344,0.005609319,0.73129606,0.021720123,0.000045182012],"about_ca_topic_score_codex":0.001946445,"about_ca_topic_score_gemma":0.0024843107,"teacher_disagreement_score":0.012222976,"about_ca_system_score_codex":0.0014599729,"about_ca_system_score_gemma":0.0008462141,"threshold_uncertainty_score":0.04088992},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093043156,0.00080154435,0.6087838,0.012464964,0.0004906354,0.00009632728,0.00008952603,0.0008149161,0.2834151],"genre_scores_gemma":[0.9459109,0.00041342163,0.04530315,0.0010646053,0.00008290123,0.000109249326,0.000060304217,0.00008668814,0.006968884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988576,0.00045965693,0.000062864274,0.0001899271,0.0003085745,0.000121415585],"domain_scores_gemma":[0.99849916,0.0005390221,0.00012899152,0.00058016053,0.00018763253,0.00006510841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020236252,0.00022286703,0.0002524285,0.00034839564,0.0006847767,0.0026473235,0.0007592537,0.0009384481,0.0028949387],"category_scores_gemma":[0.004452546,0.00021612698,0.00046335932,0.00023022338,0.007203538,0.0045970655,0.0027437562,0.0020278553,0.00045761288],"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.0000043652635,0.0000055498867,0.0001022096,0.000016789872,0.0000042903584,0.000013135936,0.0001650661,0.00047623986,0.00041839678,0.99536186,0.00030016527,0.0031319803],"study_design_scores_gemma":[0.000013959436,0.000018514811,0.00019064272,0.000020432944,0.000008182853,0.000038419636,0.000111288646,0.0048210076,0.0015352305,0.9772719,0.01596219,0.000008161296],"about_ca_topic_score_codex":0.0004844167,"about_ca_topic_score_gemma":0.0004620789,"teacher_disagreement_score":0.0028949387,"about_ca_system_score_codex":0.0012200018,"about_ca_system_score_gemma":0.0015408106,"threshold_uncertainty_score":0.010702074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2520503,0.001981714,0.594765,0.008970051,0.0007519053,0.0005756443,0.0007236066,0.0017686996,0.13841307],"genre_scores_gemma":[0.83042,0.0010494983,0.14376067,0.002499744,0.00045156074,0.000556258,0.0010461581,0.00041963425,0.019796474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758756,0.00068424986,0.000081541846,0.00053208077,0.00056015,0.0005543616],"domain_scores_gemma":[0.9933745,0.004512426,0.00030296686,0.0011244094,0.00036740536,0.00031820554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021022581,0.000878609,0.0009213735,0.0008822936,0.0019570636,0.0023681046,0.0020650022,0.0015517975,0.0074938512],"category_scores_gemma":[0.01064821,0.00057997537,0.0027911512,0.00089356693,0.0043770946,0.007236702,0.0039618355,0.006472155,0.000795449],"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.00018007967,0.00014811607,0.00048047106,0.00021338704,0.00005849259,0.00015726539,0.00056663237,0.038232468,0.002138701,0.9337184,0.008021571,0.016084483],"study_design_scores_gemma":[0.00007587549,0.00009312858,0.00030471655,0.000037998016,0.000035306213,0.0001434762,0.00012074454,0.058525853,0.00159734,0.9288087,0.010221192,0.000035642428],"about_ca_topic_score_codex":0.0064638145,"about_ca_topic_score_gemma":0.00522208,"teacher_disagreement_score":0.0074938512,"about_ca_system_score_codex":0.0025141381,"about_ca_system_score_gemma":0.00233021,"threshold_uncertainty_score":0.025069416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13135739,0.0003225735,0.792177,0.0026108501,0.00020427539,0.00015648243,0.0005804271,0.00033516117,0.072255865],"genre_scores_gemma":[0.88477653,0.0003348531,0.10240516,0.00094967196,0.00022536358,0.00035718564,0.00034830038,0.00017053583,0.0104324045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950618,0.0010614274,0.00030534406,0.0010206815,0.0019639528,0.00058673625],"domain_scores_gemma":[0.9862336,0.00837782,0.000878618,0.0021834425,0.0018563305,0.0004702948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032581587,0.00058162835,0.0007416833,0.00095696194,0.001022376,0.0021867382,0.0015872462,0.0012501815,0.0075479946],"category_scores_gemma":[0.013703978,0.00030178681,0.0008964993,0.000796832,0.0049797813,0.007254542,0.0042247996,0.003892219,0.0010134744],"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.00006374377,0.000017326964,0.00020900558,0.000056922967,0.0000075967673,0.000098219185,0.00009277743,0.004797728,0.0060881344,0.9805299,0.0008190797,0.0072195795],"study_design_scores_gemma":[0.000029710867,0.00008360152,0.00039223678,0.00002406601,0.000013486219,0.00031745405,0.000057832644,0.10355534,0.011663068,0.87986183,0.0039636693,0.00003771757],"about_ca_topic_score_codex":0.0004126555,"about_ca_topic_score_gemma":0.0002289579,"teacher_disagreement_score":0.0075479946,"about_ca_system_score_codex":0.0011488156,"about_ca_system_score_gemma":0.001070822,"threshold_uncertainty_score":0.025250614},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027217225,0.0050840685,0.021346254,0.008132796,0.00094960135,0.00004578379,0.00024416402,0.00017870952,0.96129686],"genre_scores_gemma":[0.31376484,0.010024286,0.019983113,0.0077089006,0.0015409128,0.00025839638,0.0009804674,0.0005479861,0.645191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987197,0.0004008269,0.000059922226,0.00028209653,0.0004331716,0.00010439555],"domain_scores_gemma":[0.99761033,0.0011868302,0.0001398123,0.0004751332,0.00045868973,0.00012911721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016391253,0.0011483867,0.0007746019,0.0017181262,0.0021726722,0.006491165,0.0012772018,0.001983198,0.045206536],"category_scores_gemma":[0.006044648,0.00045295744,0.00074692204,0.0009551134,0.009002897,0.008112939,0.0026746374,0.0039478173,0.011035989],"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.000008453836,0.000005563764,0.00008537518,0.00006234915,0.0000072782295,0.000080525904,0.00029945778,0.00015415737,0.00008222095,0.9723077,0.018675383,0.008231469],"study_design_scores_gemma":[0.0000065082277,0.000008492378,0.00013660215,0.00013339004,0.000011960078,0.0002283392,0.0002385348,0.00053698546,0.00026246966,0.76838577,0.23004124,0.000009620289],"about_ca_topic_score_codex":0.0014404956,"about_ca_topic_score_gemma":0.0021936262,"teacher_disagreement_score":0.045206536,"about_ca_system_score_codex":0.0028731674,"about_ca_system_score_gemma":0.0014133764,"threshold_uncertainty_score":0.15123099},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014531554,0.0033687234,0.00035765217,0.032234944,0.9622532,0.0000127350895,0.000097519216,0.000053529664,0.0014762935],"genre_scores_gemma":[0.0013311646,0.00213401,0.00012205567,0.005947721,0.9872595,0.000009683075,0.000020631729,0.00002429758,0.0031509371],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99616724,0.00053826766,0.00044073124,0.0005887952,0.0019660548,0.00029890926],"domain_scores_gemma":[0.9573961,0.023916584,0.0017762989,0.0011087345,0.01143941,0.0043628467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052805147,0.0021909173,0.0024509542,0.0050729876,0.0029480192,0.00921202,0.002232539,0.0061993236,0.013490678],"category_scores_gemma":[0.029891973,0.00062407076,0.0014335607,0.0019150841,0.0030121943,0.004331202,0.0010438582,0.010909256,0.0045727203],"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.000065248714,0.000021033125,0.00009917534,0.00036490607,0.000024819645,0.00014463656,0.000045354802,0.00005241772,0.00010637101,0.0036861643,0.9867573,0.008632596],"study_design_scores_gemma":[0.00006571277,0.000059136277,0.0004974899,0.0005260868,0.00006771006,0.00040555664,0.00015721367,0.00044966288,0.00031933756,0.0090942355,0.9883283,0.000029628813],"about_ca_topic_score_codex":0.000875758,"about_ca_topic_score_gemma":0.0015122318,"teacher_disagreement_score":0.013490678,"about_ca_system_score_codex":0.0015449374,"about_ca_system_score_gemma":0.0023015868,"threshold_uncertainty_score":0.04513079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023098265,0.00045678468,0.0013692738,0.00037545818,0.00015757598,0.000048338068,0.0010033055,0.0011825403,0.9951757],"genre_scores_gemma":[0.0006444322,0.00027617317,0.0005224852,0.00013536055,0.000032906766,0.00003879173,0.0006120182,0.00030522275,0.99743265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994424,0.000032340493,0.000036372356,0.00020432688,0.0001785701,0.000105994084],"domain_scores_gemma":[0.9981026,0.0005716109,0.00014636524,0.00030208315,0.00034688937,0.00053052086],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010064773,0.002294521,0.001515722,0.0022120734,0.0015004878,0.0051323576,0.0033186532,0.0045503904,0.9830421],"category_scores_gemma":[0.0017805514,0.0009243865,0.0009269256,0.0026565378,0.0014133501,0.005708816,0.0034818735,0.0023707072,0.99092823],"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.00015333935,0.0001313337,0.0004426531,0.00046554912,0.000020272177,0.00012219438,0.00008305522,0.00045074438,0.0023902778,0.008684486,0.37449387,0.6125622],"study_design_scores_gemma":[0.000018988741,0.000046652443,0.00046575224,0.00027815194,0.0000087880235,0.00019289656,0.00009039543,0.00018147794,0.00041708234,0.0015211593,0.99676347,0.000015147245],"about_ca_topic_score_codex":0.0028439981,"about_ca_topic_score_gemma":0.0027854843,"teacher_disagreement_score":0.016957879,"about_ca_system_score_codex":0.0011680045,"about_ca_system_score_gemma":0.00084765133,"threshold_uncertainty_score":0.02418828},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31106347,0.0021458422,0.36822414,0.01020027,0.0046913885,0.0001890944,0.0004553997,0.00086890074,0.30216143],"genre_scores_gemma":[0.94660765,0.00084655156,0.032329492,0.0023356925,0.001194857,0.00011205193,0.000341974,0.00021465552,0.016017066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980888,0.00043206688,0.00011557952,0.00047804948,0.0005957555,0.0002898028],"domain_scores_gemma":[0.99776435,0.00092931144,0.00013178779,0.00040034344,0.00047653262,0.00029766097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014836893,0.0003624494,0.00062065653,0.0007042073,0.0018342441,0.0011451833,0.000910083,0.0010845523,0.0094431825],"category_scores_gemma":[0.0060751378,0.00020790768,0.00084352726,0.0005618987,0.0043341764,0.004071427,0.004035633,0.003244628,0.001158505],"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.000028620016,0.00001573809,0.00023417271,0.00003086875,0.000005141759,0.00018705324,0.00024347157,0.00049846765,0.0027456041,0.988405,0.0015308873,0.0060749166],"study_design_scores_gemma":[0.0000136984945,0.000049683236,0.0003472119,0.000016221802,0.0000061059077,0.00024731935,0.00011897175,0.0017085137,0.0021711476,0.9826303,0.0126768155,0.000014115847],"about_ca_topic_score_codex":0.0009525166,"about_ca_topic_score_gemma":0.00057862117,"teacher_disagreement_score":0.0094431825,"about_ca_system_score_codex":0.000808528,"about_ca_system_score_gemma":0.0008445776,"threshold_uncertainty_score":0.03159064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023697819,0.00048157782,0.0015657872,0.00039984524,0.0001723287,0.000046159636,0.000989391,0.0012641952,0.99484384],"genre_scores_gemma":[0.00077128364,0.00029674626,0.00067116873,0.00014354859,0.00003795741,0.000039154318,0.0006800802,0.00035695947,0.99700326],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994357,0.00003816086,0.00003763521,0.00019204897,0.00018977045,0.000106595115],"domain_scores_gemma":[0.99815065,0.00057417026,0.00014395342,0.00031572275,0.00034522687,0.00047026895],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000987449,0.002151805,0.0014722365,0.002047476,0.001337887,0.0049753883,0.0030007672,0.0041900696,0.9802215],"category_scores_gemma":[0.0017517597,0.00084843155,0.000923452,0.0024327857,0.0013592344,0.0052660326,0.0032070682,0.002282577,0.9894441],"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.00014560625,0.00012272049,0.00043865532,0.00043487494,0.000020038364,0.00011660937,0.00008041294,0.0004285033,0.002400095,0.010623359,0.34518072,0.6400084],"study_design_scores_gemma":[0.00001857435,0.000044592452,0.00048544913,0.0002486136,0.000008425846,0.00020521294,0.00007137109,0.00016960959,0.0003996668,0.001766183,0.9965683,0.000013994179],"about_ca_topic_score_codex":0.0025434182,"about_ca_topic_score_gemma":0.0025405793,"teacher_disagreement_score":0.01977849,"about_ca_system_score_codex":0.0011130489,"about_ca_system_score_gemma":0.0008793837,"threshold_uncertainty_score":0.028211534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023197921,0.00038608027,0.001352252,0.00040516854,0.00015635723,0.000044656208,0.00075589045,0.0010406685,0.9956269],"genre_scores_gemma":[0.0007094386,0.00026451814,0.0005691471,0.00015016797,0.00003647429,0.000035833513,0.00053726387,0.00033376165,0.9973634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946064,0.00003486489,0.000035186826,0.00018639003,0.0001818729,0.000101201265],"domain_scores_gemma":[0.99795216,0.00059503067,0.00015580723,0.00033292326,0.00037931377,0.0005848276],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001038678,0.0021006104,0.0013756165,0.0020380788,0.0014364668,0.0055179573,0.0029088792,0.004430077,0.9812711],"category_scores_gemma":[0.0018530223,0.00083819707,0.0009388323,0.0024308735,0.001440377,0.0056960145,0.0033969854,0.0022381947,0.9899003],"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.00014711783,0.0001227895,0.0004736511,0.00040813893,0.000018797635,0.000119513024,0.00009405776,0.00040238712,0.0023425294,0.010555329,0.35326204,0.6320537],"study_design_scores_gemma":[0.00001699075,0.00004145392,0.00047848327,0.0002539661,0.000007811537,0.00019276072,0.00008632121,0.00015735252,0.00035241444,0.0017348822,0.996664,0.00001351837],"about_ca_topic_score_codex":0.0027060888,"about_ca_topic_score_gemma":0.0026112688,"teacher_disagreement_score":0.018728912,"about_ca_system_score_codex":0.0011444837,"about_ca_system_score_gemma":0.00092111016,"threshold_uncertainty_score":0.026714504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054149497,0.00035556723,0.97693574,0.0023774367,0.0001375893,0.000044405206,0.00005516449,0.00020199263,0.014477192],"genre_scores_gemma":[0.6582749,0.0011807621,0.32715788,0.0017526651,0.00069703104,0.0006360652,0.00027752938,0.0005874484,0.0094358185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941094,0.002520796,0.00029240907,0.0007481475,0.0019505977,0.00037873542],"domain_scores_gemma":[0.97812325,0.015601262,0.0009662672,0.0022860388,0.0024761127,0.0005469749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007845568,0.0014126613,0.0012540366,0.0011787103,0.0014183309,0.0027788894,0.0036098764,0.0033988436,0.0071675377],"category_scores_gemma":[0.03889206,0.0008166754,0.0011158787,0.00097240537,0.005019299,0.006005349,0.0042717988,0.009424887,0.0015819834],"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.00003946964,0.000024132902,0.00012770505,0.000056876303,0.00001344308,0.0000432273,0.00006153607,0.04436367,0.0003958807,0.94527227,0.0011850575,0.008416714],"study_design_scores_gemma":[0.000031261574,0.000019642126,0.000033672288,0.00003116614,0.000006676081,0.000033441618,0.000013908469,0.32316524,0.0005301476,0.6740592,0.0020653114,0.000010386993],"about_ca_topic_score_codex":0.00093509257,"about_ca_topic_score_gemma":0.0007723078,"teacher_disagreement_score":0.007845568,"about_ca_system_score_codex":0.0023611719,"about_ca_system_score_gemma":0.001996958,"threshold_uncertainty_score":0.041491807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025268607,0.029580425,0.063024,0.011072308,0.0011115596,0.000044857108,0.0006778252,0.00055645994,0.8914057],"genre_scores_gemma":[0.19636174,0.048997983,0.06994652,0.004110409,0.005198792,0.00048698072,0.0026517923,0.0010078995,0.67123795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936765,0.00013221703,0.000028174934,0.00013576122,0.0002959004,0.000040369894],"domain_scores_gemma":[0.9991441,0.00041139367,0.000026723728,0.00023882106,0.00013870602,0.00004027957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004945999,0.00084002723,0.0008449902,0.0017552092,0.0010369794,0.0040347404,0.0008069786,0.00094378425,0.051489193],"category_scores_gemma":[0.0031685084,0.00049822306,0.0005250288,0.0021595478,0.002618874,0.005681719,0.0018350239,0.0030844645,0.013825765],"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.0000050105486,0.000012149703,0.00010367441,0.00013583536,0.0000096949525,0.0000177738,0.00012203476,0.0007439896,0.00015678331,0.85511464,0.07834038,0.06523801],"study_design_scores_gemma":[0.0000029830699,0.0000033959384,0.00015244707,0.000056816814,0.0000042100696,0.000049544833,0.000040238046,0.0010805958,0.000114128714,0.7723979,0.22609365,0.0000040566615],"about_ca_topic_score_codex":0.0015499368,"about_ca_topic_score_gemma":0.0018560879,"teacher_disagreement_score":0.051489193,"about_ca_system_score_codex":0.0024773746,"about_ca_system_score_gemma":0.0009798636,"threshold_uncertainty_score":0.17224848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82426155,0.002753931,0.08239721,0.008907577,0.00021740743,0.00006268085,0.0007480579,0.00042609684,0.080225445],"genre_scores_gemma":[0.98286843,0.0005370551,0.006500019,0.0003667906,0.00028779323,0.00005328353,0.00060148723,0.00008977256,0.008695473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968876,0.00078783504,0.00017448064,0.0007188009,0.00088562584,0.000545658],"domain_scores_gemma":[0.99170375,0.005490461,0.00056262116,0.0007445275,0.0007658845,0.00073280395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016709317,0.00061648135,0.0011053676,0.0023702742,0.0024692994,0.005695315,0.0010049696,0.00135253,0.007115743],"category_scores_gemma":[0.0082362965,0.0006201326,0.0015519313,0.0017497878,0.0056810435,0.012460721,0.0037844018,0.004003454,0.0006850704],"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.000075472664,0.00003444714,0.0014626666,0.000040265564,0.000016888462,0.000068044734,0.00071473466,0.0009855792,0.0005063348,0.99127626,0.000792594,0.004026592],"study_design_scores_gemma":[0.000016325886,0.000020327489,0.00094267965,0.000010598008,0.0000105510535,0.000051507795,0.00017910765,0.002776293,0.00053545565,0.9931003,0.0023412476,0.000015571884],"about_ca_topic_score_codex":0.003479699,"about_ca_topic_score_gemma":0.0022125798,"teacher_disagreement_score":0.007115743,"about_ca_system_score_codex":0.0039450414,"about_ca_system_score_gemma":0.0010728856,"threshold_uncertainty_score":0.028623402},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020361647,0.059195902,0.02574235,0.0043308586,0.0020741276,0.00003351716,0.00033693376,0.0004275325,0.90582263],"genre_scores_gemma":[0.08349627,0.05803309,0.023317756,0.0024296122,0.0045392904,0.00019345127,0.0009645454,0.00093592564,0.8260899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970824,0.000055687044,0.000010673512,0.000067190485,0.00013393056,0.000024125979],"domain_scores_gemma":[0.9996921,0.00012838551,0.000014638996,0.00008192682,0.00005238298,0.000030507319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027165093,0.0010915113,0.00093880313,0.0019367767,0.001332355,0.0052541066,0.0006091743,0.00062272267,0.03881239],"category_scores_gemma":[0.0011413933,0.00048714218,0.00046207057,0.0033446725,0.0034604806,0.0045979996,0.0013874308,0.0027861162,0.014110397],"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.000011446981,0.00001570149,0.000092426606,0.00017985176,0.000011024392,0.000021058257,0.00016880661,0.0005149889,0.00029187909,0.81976557,0.09982293,0.07910432],"study_design_scores_gemma":[0.0000049039504,0.00000539235,0.00016916938,0.00007848955,0.0000053287345,0.000063003026,0.00005722312,0.00039788734,0.00012635798,0.60055745,0.3985297,0.000005065867],"about_ca_topic_score_codex":0.0019765275,"about_ca_topic_score_gemma":0.0030726357,"teacher_disagreement_score":0.03881239,"about_ca_system_score_codex":0.002641016,"about_ca_system_score_gemma":0.0011256632,"threshold_uncertainty_score":0.12984043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019407464,0.08220907,0.09699111,0.009526578,0.002698674,0.000041269577,0.0006229536,0.00072888564,0.8052407],"genre_scores_gemma":[0.076869845,0.085669845,0.083316244,0.0034676427,0.007905355,0.00030168876,0.0014145324,0.0008117614,0.7402431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966383,0.00007141705,0.000018517965,0.00006822076,0.00015743694,0.000020680283],"domain_scores_gemma":[0.99953246,0.0002574193,0.000024356714,0.000084759005,0.000074166026,0.000026996213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046073654,0.0009898659,0.000802063,0.0015499428,0.0007400429,0.0031531474,0.00073590066,0.0009773844,0.04410828],"category_scores_gemma":[0.0017320103,0.0004324911,0.00039965365,0.0021053164,0.0020964693,0.003942932,0.0012929332,0.0031899165,0.017961027],"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.000007128775,0.000018621002,0.000104740095,0.00030429798,0.00000925011,0.000033403372,0.00013800676,0.0006259329,0.0004371148,0.7669655,0.10012267,0.13123325],"study_design_scores_gemma":[0.0000037144785,0.000005463076,0.00020154213,0.00014020255,0.0000041994326,0.00006772863,0.00003583157,0.0010919636,0.00014131954,0.68784195,0.3104604,0.000005660091],"about_ca_topic_score_codex":0.0011556036,"about_ca_topic_score_gemma":0.0017329728,"teacher_disagreement_score":0.04410828,"about_ca_system_score_codex":0.0015900537,"about_ca_system_score_gemma":0.0009912584,"threshold_uncertainty_score":0.14755684},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04597881,0.0012581832,0.18833786,0.00477811,0.0009187607,0.00009766418,0.0004809974,0.001995978,0.75615364],"genre_scores_gemma":[0.7185217,0.001533643,0.06917458,0.0012682399,0.00043561196,0.00020275773,0.0011412865,0.0006295489,0.20709264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982834,0.000036090707,0.000008436191,0.00005729846,0.000046710105,0.000023075418],"domain_scores_gemma":[0.9995982,0.000103888924,0.000023949022,0.00013654794,0.00007711863,0.000060380396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002288745,0.00036077228,0.0003247843,0.0007799043,0.0011022462,0.0012701367,0.00052750105,0.000580654,0.03837135],"category_scores_gemma":[0.0014265344,0.00019854281,0.00041985034,0.0005174966,0.0017214918,0.0022035514,0.001558447,0.0015603334,0.0038073598],"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.000012733606,0.000010311605,0.00020207741,0.000028160199,0.0000061078567,0.000026603606,0.00015430259,0.0028474473,0.00081409246,0.9615064,0.0068995953,0.02749214],"study_design_scores_gemma":[0.0000070195038,0.000019083573,0.00017404293,0.000016621003,0.000005236759,0.000047964662,0.000092651666,0.010138163,0.00033010554,0.93841153,0.050751757,0.0000057386555],"about_ca_topic_score_codex":0.0021530166,"about_ca_topic_score_gemma":0.0018989678,"teacher_disagreement_score":0.03837135,"about_ca_system_score_codex":0.0007191882,"about_ca_system_score_gemma":0.00060198363,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.539859,0.008240329,0.2980486,0.0012972006,0.00045892032,0.00012819869,0.0006046032,0.0005054904,0.15085761],"genre_scores_gemma":[0.9261371,0.0025275797,0.058643002,0.0003312685,0.0003175068,0.00015327249,0.00041118855,0.00012052866,0.01135864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991248,0.00028766488,0.000048330083,0.00019096353,0.00019059074,0.00015765846],"domain_scores_gemma":[0.99706024,0.0016394145,0.00038944668,0.00020734906,0.00034709135,0.00035638103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001468735,0.0007597223,0.00059864623,0.0022482504,0.0008365322,0.0017310334,0.00076155545,0.00059683627,0.004727411],"category_scores_gemma":[0.0065082423,0.00038669808,0.00056300976,0.0011636157,0.002147646,0.004741211,0.0016587599,0.0015086648,0.0008091469],"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.00011315728,0.000035699413,0.00051070156,0.00011424966,0.000010932456,0.00007476023,0.00022146208,0.0076467106,0.0029207373,0.97471446,0.0014670921,0.012170098],"study_design_scores_gemma":[0.00002484998,0.00007110278,0.00052691234,0.00006060662,0.000010852994,0.00018485253,0.00012629793,0.045075037,0.0018990557,0.946659,0.0053298464,0.000031540687],"about_ca_topic_score_codex":0.0006089334,"about_ca_topic_score_gemma":0.0007084591,"teacher_disagreement_score":0.004727411,"about_ca_system_score_codex":0.0012091461,"about_ca_system_score_gemma":0.000606113,"threshold_uncertainty_score":0.015814781},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012099509,0.026814634,0.012798101,0.0033501904,0.0011627304,0.00002813864,0.00012377283,0.00009995966,0.95441246],"genre_scores_gemma":[0.070338234,0.023803674,0.008866616,0.0023560787,0.0019309345,0.00016487695,0.0002871329,0.00020659152,0.8920458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999711,0.00009693817,0.000009286528,0.000044136134,0.00010896433,0.000029675743],"domain_scores_gemma":[0.999811,0.00010042918,0.000010055265,0.000025776877,0.000034202203,0.000018636494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032790517,0.00088625704,0.0006294529,0.0010193348,0.0013729616,0.004417795,0.0007085648,0.0010141525,0.035810575],"category_scores_gemma":[0.001177081,0.0003340874,0.00031636783,0.0017803413,0.0034887632,0.0052424734,0.00110417,0.0024852266,0.0077049565],"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.0000034272823,0.000009239244,0.00001964596,0.00004754865,0.0000020626749,0.000009561619,0.00016425598,0.00021718646,0.00007405348,0.9455116,0.040037133,0.01390427],"study_design_scores_gemma":[0.0000025567492,0.000003635433,0.00005538615,0.00005324494,0.0000015732534,0.000025094467,0.000100823585,0.00032639585,0.000044117238,0.7420172,0.25736687,0.000003000135],"about_ca_topic_score_codex":0.0040039504,"about_ca_topic_score_gemma":0.005192988,"teacher_disagreement_score":0.035810575,"about_ca_system_score_codex":0.002492435,"about_ca_system_score_gemma":0.0012736741,"threshold_uncertainty_score":0.11979824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00238724,0.00035058882,0.9934592,0.00034581468,0.00006860821,0.000027046912,0.0000114310715,0.00014925623,0.003200738],"genre_scores_gemma":[0.15571544,0.00071456336,0.83845675,0.000431327,0.00020681052,0.00021989769,0.000047191395,0.00010973269,0.004098312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917966,0.00034492064,0.0000375629,0.00012235364,0.00026448478,0.000051050614],"domain_scores_gemma":[0.99905103,0.0005727841,0.0000645267,0.00016522412,0.00010231084,0.00004405764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014628099,0.00050139264,0.0006432456,0.00095826853,0.0005098177,0.0016977248,0.0015385235,0.0010683032,0.0022975644],"category_scores_gemma":[0.0033533592,0.00022136974,0.00094598084,0.0007757021,0.0023220875,0.002104254,0.0015738058,0.0017698609,0.0006003401],"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.00005227162,0.000051359537,0.0007287236,0.00021011733,0.000081382066,0.00007707421,0.0002348725,0.068503946,0.0036644957,0.79803294,0.0020757613,0.12628704],"study_design_scores_gemma":[0.000023084911,0.00008092734,0.00017440626,0.00003832279,0.000018918816,0.0001530046,0.000027976464,0.5633054,0.0021387062,0.42041755,0.013596356,0.000025369922],"about_ca_topic_score_codex":0.0004386532,"about_ca_topic_score_gemma":0.0004917596,"teacher_disagreement_score":0.0022975644,"about_ca_system_score_codex":0.00065523747,"about_ca_system_score_gemma":0.0009236804,"threshold_uncertainty_score":0.007736206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016313909,0.0022288219,0.9064865,0.0062921694,0.0019747294,0.00007885467,0.00030507296,0.00030677737,0.066013195],"genre_scores_gemma":[0.6699315,0.0051578116,0.26842755,0.0062962626,0.0049405037,0.000572649,0.00044276295,0.0009208105,0.04331019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997811,0.00048887235,0.00011829244,0.00043390322,0.00097012974,0.00017780506],"domain_scores_gemma":[0.9970777,0.0017065553,0.0001775118,0.00028809492,0.00056424213,0.00018592045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029867569,0.00087006774,0.0013869632,0.0015951336,0.0013402432,0.0026282957,0.0023526351,0.0017776443,0.0118218465],"category_scores_gemma":[0.01021952,0.0005613153,0.0013506114,0.0009948409,0.004058281,0.0072688586,0.0047874344,0.0055485223,0.0015961948],"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.000009815877,0.000010471133,0.000045070647,0.0000481419,0.000015173318,0.00004621354,0.00004331047,0.0016849189,0.00075987115,0.9922956,0.0014250873,0.0036162583],"study_design_scores_gemma":[0.000012916029,0.000015082522,0.000072741794,0.000030115933,0.000008891418,0.000081638434,0.00001582834,0.014751223,0.0008113874,0.97639036,0.0077927136,0.000017122025],"about_ca_topic_score_codex":0.0004590621,"about_ca_topic_score_gemma":0.00042409028,"teacher_disagreement_score":0.0118218465,"about_ca_system_score_codex":0.0013663605,"about_ca_system_score_gemma":0.001234351,"threshold_uncertainty_score":0.03954798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8336605,0.001345663,0.060616355,0.006181988,0.00006436188,0.00007900121,0.00017074795,0.00033391823,0.097547434],"genre_scores_gemma":[0.9900057,0.00034886829,0.006091022,0.00016420714,0.00003105378,0.00002710851,0.000076478056,0.00007646464,0.0031791506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975611,0.00084876246,0.0001296096,0.0003532494,0.00056323316,0.0005441036],"domain_scores_gemma":[0.97096574,0.01655737,0.004736303,0.0037579818,0.0026193967,0.001363206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037990888,0.00035096233,0.00035470576,0.0013648026,0.0009377474,0.0037471608,0.0010488678,0.0010217198,0.007243022],"category_scores_gemma":[0.038732484,0.00032213295,0.00045033725,0.001648162,0.003908315,0.0075444486,0.0033183456,0.001974461,0.00079478644],"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.0009110527,0.00043459353,0.087425955,0.00027721646,0.00024484223,0.00048434004,0.0038595577,0.13191347,0.0095206825,0.63724506,0.005237667,0.12244558],"study_design_scores_gemma":[0.00033618408,0.00056933856,0.09367657,0.000272413,0.00021854708,0.00097365235,0.0035960919,0.22185682,0.020076185,0.59277016,0.06551596,0.00013802887],"about_ca_topic_score_codex":0.0049505243,"about_ca_topic_score_gemma":0.0032492743,"teacher_disagreement_score":0.007243022,"about_ca_system_score_codex":0.0017867754,"about_ca_system_score_gemma":0.0014547679,"threshold_uncertainty_score":0.024230301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042275388,0.0030378231,0.9371534,0.0042582788,0.0001982809,0.00025875014,0.00015122427,0.00068566966,0.011981144],"genre_scores_gemma":[0.6860329,0.0035621831,0.30186382,0.002274958,0.0008044915,0.0009861011,0.00024856356,0.00039648244,0.00383048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96626395,0.02430247,0.0010661719,0.0034264983,0.0034747766,0.0014661514],"domain_scores_gemma":[0.7856702,0.1769029,0.011818018,0.019703453,0.004285784,0.001619686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.038585927,0.002108368,0.0029741204,0.0022246335,0.00154265,0.0060016466,0.0046147383,0.004034748,0.005713579],"category_scores_gemma":[0.12849657,0.0015286213,0.0039412207,0.0021084084,0.007205741,0.017157786,0.0038985892,0.0066307466,0.0014032392],"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.00053450675,0.0002847708,0.0014894131,0.00045454153,0.0002279968,0.00010133317,0.00023720786,0.09291502,0.001768705,0.8528847,0.0022588407,0.046843003],"study_design_scores_gemma":[0.00029560068,0.00036601874,0.00028290585,0.00013732667,0.00009082471,0.00016103388,0.000036065474,0.20350282,0.0017082808,0.7895732,0.003782983,0.000062876636],"about_ca_topic_score_codex":0.0006369365,"about_ca_topic_score_gemma":0.00030502974,"teacher_disagreement_score":0.038585927,"about_ca_system_score_codex":0.002912904,"about_ca_system_score_gemma":0.0034802395,"threshold_uncertainty_score":0.20406437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032556036,0.008282627,0.02404954,0.0014973347,0.000586417,0.000029315283,0.00040535923,0.00026519652,0.96162856],"genre_scores_gemma":[0.18338476,0.016907293,0.02665102,0.0017645367,0.0015910922,0.00022127733,0.0014816135,0.00032866656,0.7676698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971086,0.000055931803,0.000011071767,0.000046274206,0.00014669703,0.000029181603],"domain_scores_gemma":[0.9998393,0.00004652629,0.00001057808,0.000034030338,0.000051057432,0.000018440602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032675616,0.0006206009,0.0005553002,0.001163433,0.0011321844,0.0032529428,0.0004991155,0.0005729648,0.030150604],"category_scores_gemma":[0.0008917213,0.00035332778,0.00032897326,0.0013235725,0.0018812589,0.0031588569,0.0009577364,0.0020537435,0.009796528],"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.0000030331958,0.0000050566596,0.000020693607,0.000022473496,0.0000020401137,0.000008727722,0.00009261795,0.00010754121,0.00019839195,0.9785589,0.011885476,0.0090949945],"study_design_scores_gemma":[0.0000023532484,0.000002976692,0.00008412873,0.000023312743,0.0000020505872,0.00004174823,0.000037897375,0.0003584131,0.00018289319,0.87517613,0.12408451,0.000003580946],"about_ca_topic_score_codex":0.0011460584,"about_ca_topic_score_gemma":0.0012308863,"teacher_disagreement_score":0.030150604,"about_ca_system_score_codex":0.00125147,"about_ca_system_score_gemma":0.0008475234,"threshold_uncertainty_score":0.100863755},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002072842,0.9409323,0.021513091,0.026309097,0.0013070296,0.000017788287,0.000059079346,0.00010792799,0.0076808254],"genre_scores_gemma":[0.027706355,0.93764496,0.019039944,0.003537943,0.009443448,0.000047182464,0.00012437944,0.00005967324,0.0023961335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987477,0.0003814697,0.00010057987,0.00018722123,0.00048823492,0.00009469506],"domain_scores_gemma":[0.982969,0.013704066,0.0004231853,0.000615301,0.0018851935,0.00040335878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043878015,0.00067663944,0.0011310035,0.002285733,0.0008371996,0.0041085985,0.0017915589,0.0027494347,0.006606678],"category_scores_gemma":[0.010055026,0.0004354095,0.0005169851,0.0040236856,0.0032182,0.011174164,0.0022684701,0.004411326,0.001882013],"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.00010446621,0.000085282925,0.0005821623,0.0029826781,0.00004529817,0.0001106649,0.0002603351,0.0028474422,0.000658618,0.15865286,0.027276395,0.8063938],"study_design_scores_gemma":[0.000041042982,0.00025202852,0.0011995055,0.00360706,0.00006843979,0.0011921782,0.0012387445,0.02429645,0.001766451,0.45668137,0.50954473,0.000112110356],"about_ca_topic_score_codex":0.00082043966,"about_ca_topic_score_gemma":0.0008173107,"teacher_disagreement_score":0.006606678,"about_ca_system_score_codex":0.0013489781,"about_ca_system_score_gemma":0.0016107507,"threshold_uncertainty_score":0.023205161},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6579895,0.0018619648,0.27748483,0.0017132297,0.00017346162,0.00012740004,0.0005484079,0.0008312972,0.059269894],"genre_scores_gemma":[0.97643596,0.00031696193,0.016833795,0.00025858777,0.00017044404,0.00010333932,0.00023712651,0.000055552286,0.005588256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970956,0.0006675573,0.00020685038,0.0005690092,0.0010501865,0.00041085927],"domain_scores_gemma":[0.9848477,0.010531246,0.0013727772,0.0015299895,0.0012135622,0.0005046573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016046582,0.0005386968,0.00064321497,0.0013415879,0.0010861182,0.0016525491,0.0011077198,0.0007243159,0.0049701524],"category_scores_gemma":[0.014741357,0.00053340575,0.0005764084,0.0008954019,0.0015639762,0.0026989935,0.0015736236,0.0016809866,0.0007935098],"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.0007398633,0.00018201997,0.006792236,0.00044920086,0.00007543802,0.00084732485,0.0010401689,0.023866829,0.042851213,0.8440558,0.004430987,0.074668944],"study_design_scores_gemma":[0.00009291475,0.0003412526,0.0033738243,0.00012213344,0.00017462469,0.0013121594,0.00015153002,0.18337624,0.040959973,0.7522602,0.017731613,0.00010353238],"about_ca_topic_score_codex":0.0005606234,"about_ca_topic_score_gemma":0.0008748969,"teacher_disagreement_score":0.0049701524,"about_ca_system_score_codex":0.0009622611,"about_ca_system_score_gemma":0.0006559304,"threshold_uncertainty_score":0.016626835},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009741473,0.026482524,0.01609621,0.0030648622,0.0017993381,0.000028540017,0.00020519517,0.00019024454,0.951159],"genre_scores_gemma":[0.046815127,0.026494905,0.01615855,0.0021250204,0.0036298602,0.0001039203,0.0005361573,0.00031857734,0.90381783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970955,0.00006195585,0.000011517315,0.000060670314,0.0001389221,0.000017316468],"domain_scores_gemma":[0.99975616,0.000107179934,0.000013015689,0.000047954727,0.000057953166,0.000017753557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040878713,0.0006673845,0.0005639771,0.0013221445,0.0008471406,0.0029055993,0.0005342415,0.00058975944,0.03695892],"category_scores_gemma":[0.0012789328,0.0002645015,0.00031822216,0.0015487191,0.001938814,0.002941555,0.00092896394,0.0023589872,0.016119087],"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.000007877402,0.000011163334,0.000052803345,0.00013351317,0.000004147356,0.000019181458,0.00013247013,0.00026315727,0.0003496683,0.8259311,0.11301949,0.060075454],"study_design_scores_gemma":[0.000003208746,0.000006634766,0.00016186158,0.00007695191,0.0000029889413,0.00008316115,0.000032185704,0.00037177975,0.00016944708,0.37104604,0.62804174,0.0000039422694],"about_ca_topic_score_codex":0.00086764357,"about_ca_topic_score_gemma":0.0013632014,"teacher_disagreement_score":0.03695892,"about_ca_system_score_codex":0.0016444651,"about_ca_system_score_gemma":0.00072116,"threshold_uncertainty_score":0.12363994},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001958405,0.02998426,0.049194872,0.0037087023,0.0016784066,0.00004734797,0.00022806929,0.00026331775,0.91293657],"genre_scores_gemma":[0.15702698,0.03301025,0.038668822,0.004277591,0.004502066,0.00034403152,0.0008885302,0.00055330544,0.76072836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994017,0.0001723762,0.000025096631,0.000118574615,0.00023478044,0.000047428057],"domain_scores_gemma":[0.99956304,0.00024343793,0.000019512428,0.000081398684,0.000067946385,0.000024662351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074383715,0.00079012755,0.0007060388,0.0018578493,0.0016516328,0.0048519,0.0012391743,0.0010719054,0.022687802],"category_scores_gemma":[0.0018761185,0.00055544765,0.00045747682,0.0020648462,0.0069639077,0.0076620816,0.0021722368,0.0038036827,0.007798237],"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.0000027363278,0.0000042780653,0.000025692787,0.000034888446,0.0000014264224,0.000006500665,0.00012694439,0.00008566591,0.000065888606,0.9785968,0.008908925,0.0121402275],"study_design_scores_gemma":[0.0000019486777,0.0000030024044,0.00004871834,0.00004077641,0.0000021504745,0.000032769516,0.0000576697,0.00013731244,0.00010321111,0.84366304,0.15590689,0.0000025749644],"about_ca_topic_score_codex":0.0012136579,"about_ca_topic_score_gemma":0.0014631957,"teacher_disagreement_score":0.022687802,"about_ca_system_score_codex":0.0022906947,"about_ca_system_score_gemma":0.0009716807,"threshold_uncertainty_score":0.07589823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16734725,0.009425709,0.66667616,0.015159931,0.0009541432,0.00007340706,0.0008106826,0.00053503853,0.13901772],"genre_scores_gemma":[0.903171,0.0032820345,0.055070497,0.0014553991,0.0011942469,0.00014891721,0.00052017823,0.0001601462,0.034997594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992975,0.0002702321,0.000031802323,0.00012444903,0.00020333938,0.00007268206],"domain_scores_gemma":[0.99815387,0.0011637207,0.000120016615,0.00022278202,0.00021081338,0.00012874024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094615936,0.0005374933,0.0007458005,0.0017077691,0.001286692,0.0029444795,0.00081392477,0.00158777,0.008440669],"category_scores_gemma":[0.00578123,0.0004554125,0.00049300666,0.0015524597,0.0033049516,0.0058223745,0.0020315042,0.0034656099,0.0007115395],"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.0000054638585,0.0000045886295,0.0000613183,0.000017252902,0.000002385463,0.00000515234,0.000036425812,0.0010607702,0.000084408966,0.9943646,0.0006243596,0.003733272],"study_design_scores_gemma":[0.0000013600178,0.0000014658841,0.00003424405,0.0000050609983,9.0424084e-7,0.0000046769014,0.00000635311,0.004153794,0.00004977408,0.99491477,0.00082590687,0.0000017984693],"about_ca_topic_score_codex":0.0018596028,"about_ca_topic_score_gemma":0.0013092377,"teacher_disagreement_score":0.008440669,"about_ca_system_score_codex":0.0019327916,"about_ca_system_score_gemma":0.0006697754,"threshold_uncertainty_score":0.028236866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8387556,0.0011289546,0.1242854,0.0014618079,0.000086604996,0.0000782246,0.0009833408,0.0003979818,0.0328221],"genre_scores_gemma":[0.98424697,0.00030460244,0.012727034,0.000102234255,0.000055866527,0.00006727725,0.00026222438,0.000033162887,0.0022007043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926823,0.00018168657,0.000036360467,0.0002583085,0.00012603076,0.00012943815],"domain_scores_gemma":[0.99643266,0.0019746954,0.00052340515,0.000426037,0.0003039633,0.00033924176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097646285,0.00038563763,0.0004973355,0.00090480444,0.0006664647,0.0012630589,0.0010124578,0.0007614851,0.004498914],"category_scores_gemma":[0.006875177,0.00033423427,0.00040326468,0.00088049384,0.001112281,0.0049132933,0.0011197638,0.00079005456,0.0002933541],"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.00074628514,0.00011032772,0.008860366,0.0004005972,0.00006414826,0.0004038556,0.0006976299,0.078826755,0.013018852,0.85623866,0.00845593,0.03217654],"study_design_scores_gemma":[0.00006990385,0.00013026832,0.0038908466,0.000040019666,0.000053546817,0.0007637789,0.00027031623,0.29574397,0.0048283315,0.6894058,0.0047603683,0.00004279188],"about_ca_topic_score_codex":0.0013336862,"about_ca_topic_score_gemma":0.0012536049,"teacher_disagreement_score":0.004498914,"about_ca_system_score_codex":0.000927563,"about_ca_system_score_gemma":0.00065794424,"threshold_uncertainty_score":0.015050411},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9040712,0.00038175745,0.08090527,0.00061995996,0.00006265967,0.000043187552,0.00013425385,0.00018390077,0.01359782],"genre_scores_gemma":[0.9941459,0.00007861161,0.00480107,0.0000506833,0.000015031787,0.000023716257,0.000027959615,0.000027270911,0.0008297661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996983,0.000080823316,0.000015862173,0.0000493386,0.00008064731,0.00007506804],"domain_scores_gemma":[0.9981997,0.00072562305,0.00033850488,0.00034935077,0.00021437964,0.00017227055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007052449,0.00026521488,0.00044342913,0.000868998,0.00069985824,0.0017185402,0.000614089,0.00062442326,0.0044937697],"category_scores_gemma":[0.0037442644,0.00030680533,0.00041376278,0.0005157145,0.0028058058,0.0035564848,0.0013089229,0.00092049554,0.00017418539],"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.00017125295,0.000045400368,0.0021237128,0.00010200978,0.000047303554,0.0004121436,0.0005798595,0.046278723,0.024508946,0.9176483,0.0006479627,0.0074343225],"study_design_scores_gemma":[0.000046956106,0.00012326852,0.0028682787,0.00004792444,0.000022466147,0.00038037766,0.00027544601,0.4094302,0.007997835,0.57665205,0.0020798212,0.00007552303],"about_ca_topic_score_codex":0.0006900454,"about_ca_topic_score_gemma":0.0003913864,"teacher_disagreement_score":0.0044937697,"about_ca_system_score_codex":0.0006293512,"about_ca_system_score_gemma":0.0003812772,"threshold_uncertainty_score":0.0150331855},"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":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040475624,0.15015948,0.004909335,0.7626554,0.009663137,0.000018165545,0.000049512375,0.000107116284,0.068390355],"genre_scores_gemma":[0.3661933,0.21461722,0.020670097,0.18388455,0.041659586,0.00023256043,0.00017462896,0.0008203818,0.17174765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978532,0.0011972026,0.000057658846,0.0002824602,0.00051627983,0.0000931478],"domain_scores_gemma":[0.99391866,0.004654375,0.00037873516,0.00014806123,0.00062902464,0.00027116056],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027454619,0.00068488665,0.0005012923,0.0022530227,0.004612864,0.006374168,0.0012803461,0.0028887582,0.0022161694],"category_scores_gemma":[0.00989271,0.00032452648,0.00033876154,0.0019217591,0.013017746,0.011447479,0.0022606645,0.007518095,0.001186718],"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.00004286578,0.000024486293,0.00046342044,0.00023246153,0.000010055548,0.00021253762,0.014803426,0.00028643696,0.00047026644,0.6317729,0.32211718,0.029564051],"study_design_scores_gemma":[0.0000081891,0.000014241921,0.0004912601,0.00044423933,0.00000625727,0.00026850862,0.0046254355,0.00035221624,0.00027259323,0.13839525,0.85509837,0.000023501369],"about_ca_topic_score_codex":0.005416833,"about_ca_topic_score_gemma":0.007354423,"teacher_disagreement_score":0.99538714,"about_ca_system_score_codex":0.0040944577,"about_ca_system_score_gemma":0.0025480993,"threshold_uncertainty_score":0.029707491},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94113815,0.000584292,0.04576909,0.0014245815,0.000027248614,0.000024994626,0.00007466423,0.00024871845,0.010708328],"genre_scores_gemma":[0.99766576,0.000045845176,0.0020619815,0.00007829982,0.00000710327,0.00000873963,0.000014351834,0.000011779541,0.000106235384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969313,0.0012694282,0.00021311129,0.00042390972,0.0009852371,0.00017706174],"domain_scores_gemma":[0.9610199,0.023653464,0.0061376644,0.0065146326,0.0016095417,0.0010648292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003272102,0.00032044336,0.00031679642,0.0009659426,0.00048571712,0.002767821,0.00053138885,0.0012079576,0.0013739883],"category_scores_gemma":[0.045773033,0.00035918696,0.00028573634,0.0004031305,0.005243264,0.004959995,0.00455676,0.0023350192,0.000096933785],"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.0031718116,0.00039804244,0.17667282,0.0009812253,0.00040077802,0.0011024767,0.049408134,0.023027357,0.16075493,0.35668883,0.0024046432,0.22498885],"study_design_scores_gemma":[0.00012221369,0.0007705837,0.22268467,0.00024527725,0.0001328492,0.0016400598,0.004842996,0.06490783,0.035435412,0.6625042,0.006380938,0.00033310428],"about_ca_topic_score_codex":0.00040366218,"about_ca_topic_score_gemma":0.00017680498,"teacher_disagreement_score":0.003272102,"about_ca_system_score_codex":0.00085029175,"about_ca_system_score_gemma":0.00019725929,"threshold_uncertainty_score":0.017304718},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9412695,0.0005812067,0.04564187,0.0014142144,0.000027284485,0.000025133319,0.00007485926,0.0002485853,0.010717379],"genre_scores_gemma":[0.99766797,0.00004560848,0.0020591633,0.000078385994,0.000007093125,0.000008760161,0.000014432158,0.000011835327,0.00010671673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969304,0.0012695324,0.00021344548,0.0004249121,0.0009845037,0.00017725554],"domain_scores_gemma":[0.9609993,0.023643868,0.006146685,0.0065312334,0.001609746,0.0010690729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032672784,0.00032025462,0.00031593954,0.00096444006,0.00048549235,0.0027575216,0.0005326576,0.0012043249,0.0013848335],"category_scores_gemma":[0.045727797,0.000358049,0.00028579327,0.0004009691,0.005214951,0.0049458873,0.004566428,0.0023366995,0.00009747744],"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.0032009964,0.00040023142,0.17726195,0.0009864479,0.00040249704,0.0011016415,0.049374897,0.023032047,0.16254762,0.35347262,0.0024062095,0.22581294],"study_design_scores_gemma":[0.00012313105,0.0007809258,0.2254364,0.00024766236,0.00013432375,0.0016475852,0.0048716646,0.06515285,0.036056254,0.65876335,0.006449619,0.000336297],"about_ca_topic_score_codex":0.00040352673,"about_ca_topic_score_gemma":0.0001767571,"teacher_disagreement_score":0.0032672784,"about_ca_system_score_codex":0.0008511215,"about_ca_system_score_gemma":0.0001971664,"threshold_uncertainty_score":0.017279208},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013606678,0.50443095,0.34660548,0.015629472,0.0010793016,0.00010257507,0.00022423692,0.00057712843,0.11774425],"genre_scores_gemma":[0.3488882,0.42418933,0.19950423,0.0045531634,0.0018154673,0.00033548436,0.0006474047,0.00021889998,0.019847743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990969,0.00026626245,0.00005695646,0.0001627279,0.00036569007,0.00005154025],"domain_scores_gemma":[0.9983369,0.0010861275,0.00009411001,0.00020555656,0.0002161736,0.00006116524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020346893,0.0005997316,0.00074412185,0.00090176286,0.0004909552,0.003942112,0.0017035868,0.0019652215,0.0035250543],"category_scores_gemma":[0.0024616974,0.00039417128,0.0009830503,0.0010450165,0.002345587,0.0048328945,0.0019577444,0.0029113863,0.0012989406],"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.00006413001,0.00005979045,0.0008099509,0.0020966416,0.00014567297,0.00011118038,0.00023537356,0.024984835,0.002239208,0.6018727,0.006990665,0.3603899],"study_design_scores_gemma":[0.000016391086,0.00013285133,0.00085859123,0.0014108213,0.00008219605,0.00025323572,0.00016904404,0.072379604,0.0024143183,0.5949736,0.32722214,0.0000872887],"about_ca_topic_score_codex":0.0014827966,"about_ca_topic_score_gemma":0.0010016956,"teacher_disagreement_score":0.003942112,"about_ca_system_score_codex":0.0017248326,"about_ca_system_score_gemma":0.0010137188,"threshold_uncertainty_score":0.012514651},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002479526,0.0057382374,0.10908345,0.0045987624,0.0008980895,0.000037280053,0.00033690245,0.0008395259,0.87598836],"genre_scores_gemma":[0.2153302,0.006136891,0.06180487,0.0027969934,0.000957467,0.00019481381,0.001225803,0.0011713378,0.7103816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996561,0.00011063029,0.000010883076,0.00008660414,0.00010585864,0.000030012821],"domain_scores_gemma":[0.9996203,0.00016223392,0.000011856656,0.00011977209,0.000056505633,0.0000293337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045874802,0.000630008,0.0004028643,0.00081388064,0.0010426566,0.0030553234,0.00082576525,0.0009807256,0.045588247],"category_scores_gemma":[0.0020310045,0.00043065601,0.0005108407,0.00070643215,0.0027332418,0.0028680856,0.0015003842,0.002313444,0.014273123],"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.00000549688,0.000008957238,0.000059595535,0.00003141614,0.000004185533,0.00001269959,0.00012343006,0.00060942164,0.00015446382,0.94848025,0.025731534,0.024778575],"study_design_scores_gemma":[0.0000048892734,0.0000040764003,0.00008354827,0.00003891968,0.0000041690637,0.000044332563,0.000045265962,0.001586134,0.00029853077,0.7888979,0.20898677,0.0000055788983],"about_ca_topic_score_codex":0.0019288944,"about_ca_topic_score_gemma":0.0028932667,"teacher_disagreement_score":0.045588247,"about_ca_system_score_codex":0.0017999662,"about_ca_system_score_gemma":0.0008130818,"threshold_uncertainty_score":0.1525079},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3361102,0.013778965,0.040029045,0.04904376,0.0008538572,0.00006831932,0.006018968,0.001168164,0.55292875],"genre_scores_gemma":[0.9494486,0.0052203634,0.006484365,0.0007731091,0.00069165137,0.00005311537,0.0019104574,0.00018216402,0.03523615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9972283,0.0006443205,0.000116219664,0.00062178785,0.0010690588,0.00032025197],"domain_scores_gemma":[0.95959866,0.0239905,0.0023657337,0.0044374154,0.007255604,0.0023520638],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.003361829,0.00039784733,0.00066489796,0.0052193087,0.0012416886,0.007404742,0.0011367216,0.0022608796,0.027321579],"category_scores_gemma":[0.04380195,0.00035531702,0.000463683,0.0077786264,0.0033156215,0.018455276,0.003252572,0.0031610439,0.0063400203],"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.00024912084,0.00010099372,0.014737853,0.00023063259,0.000036466605,0.0003745177,0.0021393455,0.0050277,0.001178745,0.8150116,0.029696792,0.13121632],"study_design_scores_gemma":[0.000036227688,0.00004413863,0.012915145,0.00015817207,0.000032598342,0.0008439694,0.0028843374,0.028534083,0.00177572,0.7811098,0.17163949,0.000026276972],"about_ca_topic_score_codex":0.004269639,"about_ca_topic_score_gemma":0.0024259444,"teacher_disagreement_score":0.9947807,"about_ca_system_score_codex":0.0034285027,"about_ca_system_score_gemma":0.0019357316,"threshold_uncertainty_score":0.09139979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8915822,0.000512945,0.08332382,0.0033869648,0.00006608712,0.000067459434,0.0009287866,0.00024436254,0.01988737],"genre_scores_gemma":[0.9811236,0.0002903069,0.012560093,0.00014249717,0.0001486435,0.000072156705,0.0007411607,0.000054827586,0.004866648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967583,0.00086891954,0.00023241986,0.0004544293,0.0011751151,0.00051083195],"domain_scores_gemma":[0.97811866,0.017646391,0.0014023714,0.0009765261,0.00058967056,0.0012663909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965762,0.0008415315,0.0015400575,0.0032477565,0.0019998148,0.010806209,0.0026261501,0.0021665124,0.0077162515],"category_scores_gemma":[0.010257883,0.0009950807,0.0016343871,0.0035248569,0.0046624443,0.017099144,0.003461518,0.0032368414,0.00050854514],"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.0002503046,0.0001345853,0.0026590617,0.00013478604,0.0000553384,0.00023157142,0.0013378006,0.022556266,0.0013669818,0.9652102,0.0010839839,0.004979086],"study_design_scores_gemma":[0.000027639946,0.000018572568,0.00045987655,0.000008748922,0.000014795487,0.00008306045,0.00020181775,0.029530305,0.00041711956,0.9687627,0.0004600634,0.00001535172],"about_ca_topic_score_codex":0.0022276859,"about_ca_topic_score_gemma":0.0020825923,"teacher_disagreement_score":0.010806209,"about_ca_system_score_codex":0.0035062565,"about_ca_system_score_gemma":0.0013400223,"threshold_uncertainty_score":0.0258134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000108794644,0.9936267,0.00041025048,0.00094332645,0.0007481538,0.0000031786797,0.000027278098,0.0000111210375,0.0041211825],"genre_scores_gemma":[0.0011913987,0.99528307,0.0004370683,0.0005117623,0.00076854695,0.000008100737,0.00005430268,0.00000537916,0.0017404107],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997509,0.0000562245,0.000032323154,0.000033682703,0.000103386956,0.000023497236],"domain_scores_gemma":[0.9989329,0.00070011185,0.000089070716,0.000027149934,0.0002000072,0.00005069746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005915358,0.00054845074,0.00079079455,0.003830076,0.00037344673,0.0014841859,0.00054647255,0.00070524897,0.007955361],"category_scores_gemma":[0.0022016473,0.000286148,0.00038180896,0.0055583105,0.00080857886,0.0028355103,0.00075782643,0.001521662,0.002556552],"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.000055929777,0.00004623221,0.00017420671,0.016555654,0.00007844716,0.000075430245,0.00020890294,0.0005691996,0.00068319123,0.07054101,0.24960387,0.6614078],"study_design_scores_gemma":[0.0000049158853,0.00002536554,0.00043232884,0.0043882285,0.000035440178,0.00020608953,0.00007340343,0.000060114337,0.00009707567,0.011880503,0.9827864,0.000010089032],"about_ca_topic_score_codex":0.001346962,"about_ca_topic_score_gemma":0.003376431,"teacher_disagreement_score":0.007955361,"about_ca_system_score_codex":0.0009243578,"about_ca_system_score_gemma":0.0018815635,"threshold_uncertainty_score":0.026613355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023940805,0.0026915437,0.9590359,0.0015804288,0.00042644725,0.0001640389,0.0017823607,0.0023179622,0.008060647],"genre_scores_gemma":[0.26224622,0.0020728626,0.72338605,0.00030468393,0.0004134593,0.00023001766,0.00550966,0.00065404346,0.0051829126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552923,0.0012956167,0.0006075987,0.0009581477,0.001295327,0.0003140248],"domain_scores_gemma":[0.99103045,0.005138765,0.00040648476,0.0021666777,0.0009939403,0.00026370623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028692684,0.00104418,0.00089286827,0.0066493973,0.0015331447,0.0061710444,0.0019551516,0.0018843282,0.006259237],"category_scores_gemma":[0.024899809,0.0010606444,0.0025671597,0.004294624,0.0027534517,0.015052388,0.0046891985,0.0034598177,0.0039215214],"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.00010330489,0.000053616728,0.0019611055,0.00061312603,0.000044565368,0.00028578998,0.0014338698,0.0066625862,0.004395119,0.78667927,0.01421888,0.18354887],"study_design_scores_gemma":[0.000012726347,0.000045940396,0.0009844768,0.00018303034,0.000027865055,0.0005487123,0.0005180674,0.047496006,0.0056661107,0.87466383,0.0698034,0.000049616363],"about_ca_topic_score_codex":0.0005353448,"about_ca_topic_score_gemma":0.00069209863,"teacher_disagreement_score":0.0066493973,"about_ca_system_score_codex":0.0017767872,"about_ca_system_score_gemma":0.0011569109,"threshold_uncertainty_score":0.02093923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112464964,0.0020477055,0.86008584,0.0017777703,0.00020073963,0.00005335959,0.00021262227,0.0008763036,0.022280723],"genre_scores_gemma":[0.90530133,0.0009882363,0.08831772,0.00029414732,0.00014147678,0.00008540604,0.00015029621,0.00006708803,0.0046542836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993623,0.00015779598,0.000033786535,0.000092567905,0.0002835494,0.00007003015],"domain_scores_gemma":[0.9982913,0.00090910576,0.00014834291,0.00036854492,0.00022049174,0.00006205735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077063416,0.0003230559,0.0007258215,0.00043069667,0.00052347896,0.0014251705,0.0008923405,0.0009704275,0.0025603632],"category_scores_gemma":[0.0060609765,0.00027823195,0.00038282783,0.0006492244,0.001125117,0.0021503628,0.0007425563,0.0009059544,0.00033456107],"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.00011674904,0.00003544501,0.00076405966,0.00010276689,0.000034040062,0.00006832309,0.000079818616,0.5526028,0.0034175701,0.4120353,0.0016570842,0.029085927],"study_design_scores_gemma":[0.000007112876,0.000016496348,0.00012674555,0.000007691513,0.0000058614874,0.000030038833,0.000009638067,0.88014656,0.0007759617,0.11747328,0.001394404,0.0000062840513],"about_ca_topic_score_codex":0.0016048737,"about_ca_topic_score_gemma":0.0015500571,"teacher_disagreement_score":0.0025603632,"about_ca_system_score_codex":0.0011233692,"about_ca_system_score_gemma":0.0007882448,"threshold_uncertainty_score":0.008565307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15571633,0.016249763,0.6166957,0.042410553,0.0016675675,0.00012079243,0.0007843396,0.0008238675,0.16553102],"genre_scores_gemma":[0.9604969,0.0025121996,0.023506166,0.0013791145,0.0016933165,0.0001527227,0.00028643102,0.000102280916,0.009870954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938299,0.0029810057,0.0003615819,0.0011627432,0.0011177685,0.0005469422],"domain_scores_gemma":[0.9839569,0.010932033,0.0008057744,0.0026937257,0.0010702809,0.0005412461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004642915,0.0006302975,0.0016832632,0.0021642798,0.0029247107,0.0068506976,0.0013871106,0.0021703814,0.0039359024],"category_scores_gemma":[0.016472671,0.00060470303,0.0016112837,0.0019287209,0.021421032,0.014322401,0.00454805,0.006079475,0.0005434955],"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.000008500812,0.0000041819385,0.00010465581,0.000010964064,0.0000040787345,0.00000753938,0.000081852035,0.0004429908,0.000033286313,0.9979189,0.00036827888,0.0010148567],"study_design_scores_gemma":[0.0000043105124,0.0000029970909,0.000046212226,0.0000035885123,0.0000027817441,0.000011395571,0.00001931915,0.0007764845,0.000035600176,0.99803585,0.0010572665,0.0000042266843],"about_ca_topic_score_codex":0.0037647055,"about_ca_topic_score_gemma":0.0016135682,"teacher_disagreement_score":0.0068506976,"about_ca_system_score_codex":0.0038553819,"about_ca_system_score_gemma":0.0022047302,"threshold_uncertainty_score":0.027972877},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08854976,0.022264322,0.26165634,0.06516225,0.0026860237,0.00006445236,0.00058245135,0.00042153033,0.5586129],"genre_scores_gemma":[0.93752676,0.004504705,0.0290374,0.002851588,0.0012208862,0.00010758086,0.00018723308,0.00013103451,0.024432873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883765,0.000475995,0.00005209013,0.00020197997,0.00032928947,0.000103100596],"domain_scores_gemma":[0.99760866,0.0015244657,0.00012483003,0.00037822273,0.00023059316,0.0001332038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017841291,0.00030994345,0.0004455487,0.0013694904,0.0027691203,0.0056724814,0.00087074906,0.0011980811,0.005249065],"category_scores_gemma":[0.0052460707,0.00027061228,0.0005797192,0.00095131213,0.014384701,0.008539872,0.002246515,0.003574887,0.00070746196],"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.0000015778324,8.3328035e-7,0.000023706285,0.0000050861313,7.3164796e-7,0.000007793853,0.00009646836,0.00008991591,0.000021781452,0.9984987,0.00043327836,0.00082024815],"study_design_scores_gemma":[0.0000020725831,0.0000020011908,0.000036697358,0.0000071890886,7.383316e-7,0.000017000651,0.000049970313,0.00044138115,0.0000328138,0.9880867,0.011320304,0.000003143422],"about_ca_topic_score_codex":0.0017374883,"about_ca_topic_score_gemma":0.00077478355,"teacher_disagreement_score":0.0056724814,"about_ca_system_score_codex":0.0021414878,"about_ca_system_score_gemma":0.00112816,"threshold_uncertainty_score":0.017559826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67868793,0.00074335706,0.25635245,0.0013417524,0.00011821442,0.00009322075,0.00050363864,0.001135932,0.06102351],"genre_scores_gemma":[0.9755263,0.00013961911,0.019663379,0.00014585925,0.000083660605,0.000048410548,0.00026178232,0.00007517275,0.0040557706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830085,0.0003534758,0.00011038953,0.0003542565,0.000677715,0.00020325051],"domain_scores_gemma":[0.9931652,0.0046801385,0.0005201475,0.0008889053,0.0005121093,0.00023357493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243313,0.0003469503,0.00056548044,0.0016884966,0.0013827151,0.0026196488,0.0010212745,0.00091764826,0.0053802156],"category_scores_gemma":[0.008485163,0.00036588724,0.00080923445,0.00092479924,0.0034895195,0.0064974665,0.0020024993,0.002980653,0.00042027424],"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.00004505939,0.000031075342,0.00044330992,0.000047989586,0.000008228447,0.00018091107,0.0003734472,0.002824821,0.0023308808,0.9876385,0.0003754808,0.0057002665],"study_design_scores_gemma":[0.000019270652,0.00003228335,0.0003591088,0.000027777643,0.000021092956,0.00018065273,0.00012806275,0.0147859305,0.0053241886,0.97565144,0.003452253,0.000018011435],"about_ca_topic_score_codex":0.0008704022,"about_ca_topic_score_gemma":0.0009203026,"teacher_disagreement_score":0.0053802156,"about_ca_system_score_codex":0.0012220744,"about_ca_system_score_gemma":0.00056105637,"threshold_uncertainty_score":0.017998636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6025715,0.0016229384,0.30236325,0.0037459705,0.00020476614,0.00010561366,0.00080689153,0.0005254135,0.08805369],"genre_scores_gemma":[0.9597438,0.00068769214,0.029521305,0.00042193095,0.00037395005,0.00010423762,0.0006586167,0.000110671645,0.008377834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988613,0.00024371452,0.00006389882,0.00028982165,0.0003306914,0.0002105654],"domain_scores_gemma":[0.99541485,0.003189099,0.0003574637,0.00039298364,0.00032636925,0.0003193165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021000877,0.00044657025,0.0007162914,0.0016229098,0.0012209865,0.0017069791,0.000979298,0.0005606517,0.0028245596],"category_scores_gemma":[0.0057088435,0.00037503205,0.0011647558,0.001325112,0.003837548,0.006513467,0.0031082397,0.0031660332,0.0003259687],"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.000056989327,0.000017070859,0.00094776007,0.000048694354,0.000007755371,0.00016533902,0.0003662942,0.0015640846,0.002149222,0.9884057,0.0007157085,0.005555303],"study_design_scores_gemma":[0.00004091584,0.00007754878,0.0021388151,0.000037004447,0.000028968332,0.00061808684,0.0002576326,0.021043863,0.0024483895,0.9647727,0.008500697,0.000035405857],"about_ca_topic_score_codex":0.0008276035,"about_ca_topic_score_gemma":0.00063994,"teacher_disagreement_score":0.0028245596,"about_ca_system_score_codex":0.0013329663,"about_ca_system_score_gemma":0.00049746165,"threshold_uncertainty_score":0.011106491},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0648998,0.0029984904,0.47723436,0.050908558,0.0028133711,0.00009843117,0.00012761139,0.0019816638,0.39893773],"genre_scores_gemma":[0.9049338,0.0008216547,0.054838996,0.003966456,0.0005518015,0.0000633277,0.00007100942,0.00055845047,0.034194436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915004,0.00049696234,0.000020836615,0.00009489198,0.00017331478,0.00006392192],"domain_scores_gemma":[0.996438,0.002254555,0.00017347849,0.00066164054,0.0002594471,0.00021291363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013883878,0.00049952127,0.0002545063,0.0004192856,0.001076534,0.00426258,0.0013387722,0.0019512799,0.008327536],"category_scores_gemma":[0.01204842,0.00022610881,0.00025494152,0.0002641857,0.008429569,0.008858246,0.0025703816,0.0040925625,0.0020462887],"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.000097698205,0.000033229146,0.00041448328,0.0000918796,0.000015690035,0.00033219435,0.009437416,0.001935233,0.0026906766,0.9127674,0.016709669,0.05547443],"study_design_scores_gemma":[0.00003129019,0.000028355353,0.00015058891,0.0000429119,0.000011292649,0.0003790183,0.0017510325,0.008727087,0.0014988229,0.9369552,0.05040071,0.000023622386],"about_ca_topic_score_codex":0.00045135603,"about_ca_topic_score_gemma":0.0005407337,"teacher_disagreement_score":0.008327536,"about_ca_system_score_codex":0.0006810637,"about_ca_system_score_gemma":0.00045564154,"threshold_uncertainty_score":0.027858436},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07505158,0.03226271,0.14572623,0.02953515,0.0009159078,0.00005620282,0.000314801,0.0005992172,0.71553814],"genre_scores_gemma":[0.78771836,0.015617532,0.0890104,0.002368678,0.0005985371,0.00013227247,0.0006400407,0.00026571576,0.10364843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994691,0.0002534273,0.000016250102,0.00009311873,0.00013352133,0.00003465178],"domain_scores_gemma":[0.9986216,0.00083563756,0.00005166239,0.00018790785,0.00023212044,0.00007108405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007264221,0.0002732724,0.00017317866,0.0007284342,0.0006857423,0.003457972,0.0006330485,0.00073200755,0.005208021],"category_scores_gemma":[0.0032600642,0.00020995374,0.00029232277,0.0007478031,0.0031021896,0.0037476933,0.0013902971,0.0013825801,0.00095236325],"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.000009597846,0.0000074430413,0.00040603575,0.000080142956,0.000013511233,0.000053709264,0.0006645359,0.0036730845,0.00041786057,0.9332752,0.013204725,0.04819412],"study_design_scores_gemma":[0.000005415372,0.000008848757,0.0007079398,0.00009484431,0.000009009371,0.00010770415,0.00039140615,0.011026256,0.0004601677,0.8690848,0.11809174,0.000011915551],"about_ca_topic_score_codex":0.0015825363,"about_ca_topic_score_gemma":0.0017178735,"teacher_disagreement_score":0.005208021,"about_ca_system_score_codex":0.0018157535,"about_ca_system_score_gemma":0.0006620192,"threshold_uncertainty_score":0.017422557},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07309751,0.02785041,0.29071575,0.030732667,0.0013061053,0.00006414071,0.0002350086,0.00018820458,0.57581025],"genre_scores_gemma":[0.96191436,0.004661278,0.015398195,0.0010442849,0.0013613394,0.00008094523,0.0000770974,0.000068708265,0.015393701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847084,0.0007391778,0.00007207067,0.00019674267,0.0003743981,0.00014691762],"domain_scores_gemma":[0.9963426,0.0027807257,0.00013850373,0.0004437087,0.00019138303,0.00010309602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027391359,0.00045265857,0.0008541649,0.0011979607,0.0013874051,0.0044437046,0.0009328271,0.0016163612,0.0028702002],"category_scores_gemma":[0.0068080444,0.0005522854,0.0005854872,0.001566612,0.01595832,0.0128926365,0.0022826707,0.0046511656,0.00032975135],"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.000004007882,0.0000020782213,0.00002586498,0.00001357482,0.0000029561572,0.000008949565,0.00009966509,0.00026238954,0.000025113155,0.9968888,0.00036366386,0.0023030418],"study_design_scores_gemma":[8.7787714e-7,8.575248e-7,0.00001153955,0.0000041630774,0.0000011785054,0.0000048515276,0.000009836472,0.00019230437,0.000013982138,0.99894553,0.0008141907,7.40372e-7],"about_ca_topic_score_codex":0.000896642,"about_ca_topic_score_gemma":0.0005969634,"teacher_disagreement_score":0.0044437046,"about_ca_system_score_codex":0.0029315378,"about_ca_system_score_gemma":0.0008017176,"threshold_uncertainty_score":0.021269858},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046788284,0.01800282,0.04724179,0.003967649,0.0019372716,0.00007173146,0.0010286975,0.0013384451,0.9259437],"genre_scores_gemma":[0.011997995,0.024262961,0.045890316,0.0032068498,0.0019276666,0.0002986014,0.0017417567,0.0016784419,0.90899545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995547,0.000076341756,0.00002369287,0.00010928133,0.00019926629,0.000036683676],"domain_scores_gemma":[0.9995969,0.00020182108,0.00001266855,0.000059494283,0.00009115069,0.00003801031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042124488,0.0011744904,0.0008242394,0.0015331644,0.0011245366,0.0035954965,0.0010366312,0.0007680543,0.13455267],"category_scores_gemma":[0.0014742329,0.00064627716,0.0006027794,0.002859003,0.0016656362,0.004060296,0.0015869492,0.0037364976,0.073368594],"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.000011514195,0.000035403627,0.00007361459,0.00029123065,0.000005064021,0.00004678568,0.0002924798,0.00037954433,0.00041569484,0.45824274,0.34901187,0.19119412],"study_design_scores_gemma":[0.0000025542604,0.0000046320147,0.00005929566,0.000094801566,0.0000018560942,0.000061140585,0.000030431935,0.00014219462,0.000074645366,0.09592552,0.90359944,0.000003413893],"about_ca_topic_score_codex":0.0012635732,"about_ca_topic_score_gemma":0.0020372556,"teacher_disagreement_score":0.13455267,"about_ca_system_score_codex":0.0014169295,"about_ca_system_score_gemma":0.0015014503,"threshold_uncertainty_score":0.45012355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014067024,0.00060253375,0.96181256,0.0011204301,0.00021858215,0.0001372038,0.00038546423,0.0030299453,0.01862624],"genre_scores_gemma":[0.21396188,0.00062158937,0.7682284,0.00044126218,0.00024196196,0.00040796347,0.001052286,0.0012321128,0.0138126295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809223,0.0005283165,0.0001069017,0.0003501819,0.000658607,0.0002638047],"domain_scores_gemma":[0.9942783,0.0033412566,0.00023017255,0.0013736952,0.00061764906,0.0001588873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018620179,0.0012465446,0.0014566206,0.0021083471,0.0020079154,0.0046636704,0.002787709,0.0016063467,0.024905825],"category_scores_gemma":[0.011879617,0.0008527337,0.002020951,0.0034791846,0.0021351662,0.008217105,0.003707635,0.0044327676,0.0045346827],"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.0004302959,0.00021880264,0.00056016416,0.00044074716,0.00007175751,0.00005386077,0.00017640372,0.055603903,0.003575025,0.6552279,0.02290296,0.26073822],"study_design_scores_gemma":[0.00010439421,0.000044884146,0.00016645325,0.000043507604,0.000034141496,0.00007143515,0.0000743931,0.2301549,0.0024977252,0.75445324,0.012328887,0.000026083819],"about_ca_topic_score_codex":0.0027879372,"about_ca_topic_score_gemma":0.005563793,"teacher_disagreement_score":0.024905825,"about_ca_system_score_codex":0.002967193,"about_ca_system_score_gemma":0.003092519,"threshold_uncertainty_score":0.08331829},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84778863,0.0012142608,0.03914997,0.007123793,0.000080782134,0.0001088503,0.00011478378,0.00007217767,0.10434672],"genre_scores_gemma":[0.9973628,0.00018967345,0.001418125,0.00011192099,0.000011050304,0.000019015293,0.0000132608075,0.00001055512,0.0008636316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9993511,0.00040922966,0.000015841913,0.00006725173,0.00009485561,0.00006178256],"domain_scores_gemma":[0.99466324,0.0044351094,0.00017731718,0.00033362966,0.0002105003,0.00018022294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635363,0.00014321016,0.0001558441,0.0007167185,0.001677154,0.0032481963,0.0006633543,0.00093955535,0.0025651813],"category_scores_gemma":[0.0065453425,0.00017615595,0.0002297331,0.00074744364,0.009841586,0.005193688,0.001746451,0.0016818494,0.00017295308],"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.00016055495,0.00008459797,0.005189788,0.00021611358,0.000019669644,0.00089799654,0.15236703,0.0011854805,0.0032391772,0.82253474,0.0014767189,0.012628115],"study_design_scores_gemma":[0.000080674006,0.0001164059,0.008710703,0.00012365867,0.000023818846,0.001522222,0.15174477,0.007970413,0.0015335005,0.7873399,0.040778536,0.000055437707],"about_ca_topic_score_codex":0.0006930316,"about_ca_topic_score_gemma":0.00064231263,"teacher_disagreement_score":0.0032481963,"about_ca_system_score_codex":0.00095600786,"about_ca_system_score_gemma":0.00058550393,"threshold_uncertainty_score":0.008648694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033112937,0.012515709,0.01989414,0.049644995,0.0014069167,0.000018196708,0.000096958865,0.00016467937,0.9129472],"genre_scores_gemma":[0.4269766,0.012401362,0.017103298,0.0122534055,0.0053061116,0.00017072295,0.00018845026,0.0008442268,0.5247559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991584,0.00042528863,0.000021950853,0.0001047863,0.00021367497,0.00007597766],"domain_scores_gemma":[0.9972287,0.0021383476,0.00007815953,0.00022053112,0.00021448445,0.00011983689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014381935,0.0004621692,0.00058482995,0.0007570277,0.0025203282,0.0063842325,0.00091411837,0.0026100124,0.025319317],"category_scores_gemma":[0.0057510505,0.00038746913,0.00037454077,0.001081351,0.011954703,0.013402954,0.0015463046,0.006905843,0.004512208],"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.0000045648317,0.0000028508368,0.000007640542,0.000012467237,0.0000011513976,0.000005785912,0.00024261748,0.00007659282,0.00003485214,0.9803326,0.016233947,0.003044889],"study_design_scores_gemma":[0.0000026570187,0.0000017235305,0.000017682918,0.00003275039,9.954675e-7,0.000011743985,0.00009752075,0.00016314202,0.00004764472,0.9683091,0.03131244,0.0000025319455],"about_ca_topic_score_codex":0.0018055642,"about_ca_topic_score_gemma":0.0027011505,"teacher_disagreement_score":0.025319317,"about_ca_system_score_codex":0.0034972397,"about_ca_system_score_gemma":0.0019902901,"threshold_uncertainty_score":0.08470154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018730126,0.022901516,0.9151105,0.019222539,0.0004487194,0.000069204994,0.00031044232,0.00026534323,0.022941535],"genre_scores_gemma":[0.7342884,0.028988047,0.22427607,0.0046185986,0.003828708,0.00040611532,0.00048612864,0.00025153582,0.0028564013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99122745,0.0051495037,0.00038609767,0.00092526525,0.0019610594,0.0003507807],"domain_scores_gemma":[0.93850625,0.05285438,0.0017303558,0.00445307,0.0018828766,0.00057310204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01589937,0.0015944723,0.002540653,0.0052035446,0.0014551184,0.007798466,0.0024064505,0.0033017744,0.0022048978],"category_scores_gemma":[0.038451143,0.00090520066,0.0016434204,0.0034979992,0.014655065,0.01622665,0.005847851,0.006597543,0.00046662227],"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.000026371761,0.000029877538,0.0009978749,0.00029736044,0.0000822783,0.00006959924,0.0001765267,0.016999576,0.00034124326,0.9503307,0.0010045706,0.029644033],"study_design_scores_gemma":[0.0000053713634,0.000026823389,0.00018322682,0.00008397924,0.000010927954,0.000033746834,0.000040544503,0.030258453,0.00020334386,0.96678895,0.0023441003,0.000020457364],"about_ca_topic_score_codex":0.0022233995,"about_ca_topic_score_gemma":0.001345893,"teacher_disagreement_score":0.01589937,"about_ca_system_score_codex":0.003952095,"about_ca_system_score_gemma":0.0030829944,"threshold_uncertainty_score":0.08408493},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009717699,0.2155002,0.025576577,0.20162946,0.0030388758,0.00009535004,0.00038927142,0.000100671125,0.5439519],"genre_scores_gemma":[0.6893264,0.17011385,0.013213422,0.023776457,0.009275528,0.0003925654,0.00027266814,0.00014274009,0.09348638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739313,0.0012870048,0.00008124306,0.00027535905,0.00077567,0.0001875917],"domain_scores_gemma":[0.9944918,0.0039703334,0.00025431562,0.0005687787,0.0004255313,0.00028931434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034521862,0.00071623066,0.00088657666,0.0016806953,0.0016886516,0.008906436,0.0006397354,0.0031978867,0.007259412],"category_scores_gemma":[0.007955184,0.00049424835,0.000446612,0.0017279496,0.015391211,0.009609017,0.0022755067,0.0039934465,0.0015507302],"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.0000111075105,0.000010321101,0.00020694929,0.000057197696,0.0000143032985,0.000025033738,0.00009555637,0.000680857,0.000040858056,0.9829348,0.0087221945,0.0072008353],"study_design_scores_gemma":[0.000008708829,0.0000073494907,0.00022351049,0.00011606281,0.0000033784272,0.000026524624,0.000114286966,0.00043233953,0.000030307736,0.93832743,0.060704358,0.000005729409],"about_ca_topic_score_codex":0.0021552192,"about_ca_topic_score_gemma":0.0019720963,"teacher_disagreement_score":0.008906436,"about_ca_system_score_codex":0.004272436,"about_ca_system_score_gemma":0.0026606824,"threshold_uncertainty_score":0.030998826},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006115186,0.043844145,0.19308737,0.016878974,0.0029888824,0.00015527982,0.0023206377,0.00061849126,0.7339911],"genre_scores_gemma":[0.5263543,0.041750237,0.16585203,0.010739147,0.0077277143,0.0006879726,0.005652676,0.0005840674,0.24065177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973354,0.00064243714,0.00022016717,0.0007742527,0.0008500714,0.00017769048],"domain_scores_gemma":[0.99842095,0.00068679213,0.00008805975,0.0003351933,0.0003646736,0.0001042549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017819375,0.00082787755,0.0011632113,0.0027570087,0.0030383926,0.006544028,0.0015239808,0.0014833311,0.025046827],"category_scores_gemma":[0.0033743412,0.00042444497,0.0010958955,0.0024271011,0.00692664,0.006830777,0.0036585757,0.0037984503,0.00868225],"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.0000037419572,0.000003532507,0.00005803901,0.000048048623,0.0000052018913,0.00001926416,0.00010265398,0.0001618335,0.000076536715,0.9826621,0.007072265,0.009786778],"study_design_scores_gemma":[0.0000042907254,0.0000067102906,0.00012185284,0.00006103689,0.0000044249523,0.000108270724,0.000056724093,0.0004399646,0.0001537957,0.82533324,0.17370209,0.000007689557],"about_ca_topic_score_codex":0.0018347977,"about_ca_topic_score_gemma":0.0012291342,"teacher_disagreement_score":0.025046827,"about_ca_system_score_codex":0.0035205248,"about_ca_system_score_gemma":0.0011199275,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50829744,0.0013386061,0.442906,0.0010284898,0.00023967498,0.00008620312,0.00028473808,0.00060096494,0.04521778],"genre_scores_gemma":[0.94953436,0.00028941833,0.04108271,0.00012657057,0.00017001164,0.000071474875,0.00018802982,0.0000739402,0.008463514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978441,0.00037535108,0.00016056054,0.0005097137,0.00067116803,0.00043909028],"domain_scores_gemma":[0.9963678,0.000964581,0.00053913175,0.00102831,0.00065048516,0.00044966958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016811002,0.00046242392,0.00043112758,0.0016068623,0.0020747455,0.0024859526,0.00072677905,0.00094949885,0.0032906672],"category_scores_gemma":[0.0037237299,0.0003943859,0.0009842002,0.0011403386,0.006404665,0.005543694,0.0049196826,0.0013992331,0.00053306675],"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.000028755516,0.000014499087,0.0011910519,0.000039916835,0.000008023638,0.00016755238,0.000557103,0.00047773402,0.0033365719,0.98244375,0.00043680755,0.011298139],"study_design_scores_gemma":[0.000011597674,0.000068963185,0.001365257,0.000026265945,0.0000224821,0.0009372461,0.00032885344,0.0066509685,0.008686278,0.9667796,0.015088724,0.000033780892],"about_ca_topic_score_codex":0.0004964018,"about_ca_topic_score_gemma":0.00041688833,"teacher_disagreement_score":0.0032906672,"about_ca_system_score_codex":0.0008496649,"about_ca_system_score_gemma":0.0006466077,"threshold_uncertainty_score":0.011008322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2800766,0.0010095178,0.6066288,0.00060363667,0.00050064485,0.00011156023,0.000266926,0.0007532356,0.11004907],"genre_scores_gemma":[0.9014216,0.0003410456,0.07492693,0.00031841404,0.0001651537,0.00012051291,0.00029658657,0.00031707104,0.022092707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987103,0.0002337169,0.000098002856,0.00034085335,0.00038236892,0.0002348114],"domain_scores_gemma":[0.99854577,0.00027953458,0.00013679825,0.0003931276,0.0004358549,0.00020897613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008184079,0.0004599581,0.00042900906,0.0015308369,0.0016881588,0.0025807507,0.00058180606,0.0008971517,0.004981003],"category_scores_gemma":[0.001843227,0.0003127288,0.00064510887,0.00076874223,0.0047812564,0.0051227813,0.004113436,0.001902906,0.0007163126],"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.000016539416,0.000005905741,0.0002673428,0.000029239094,0.0000026082598,0.00010487662,0.00041277581,0.00027906513,0.0025586388,0.9902305,0.00022213669,0.005870385],"study_design_scores_gemma":[0.000014693794,0.00006632844,0.0007484721,0.000054013937,0.000013681579,0.00092462054,0.00062251685,0.0057121734,0.015538221,0.90827006,0.06798205,0.00005311449],"about_ca_topic_score_codex":0.00085954415,"about_ca_topic_score_gemma":0.00056645606,"teacher_disagreement_score":0.004981003,"about_ca_system_score_codex":0.0009855813,"about_ca_system_score_gemma":0.00053572666,"threshold_uncertainty_score":0.016663134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40749064,0.009300363,0.46011174,0.010360211,0.0004540602,0.00017820662,0.00043789024,0.0010029398,0.11066399],"genre_scores_gemma":[0.95253706,0.001316323,0.042406246,0.00046571778,0.00018002086,0.000060199283,0.0001268988,0.00008896716,0.0028186545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989367,0.00037175784,0.000073886455,0.00019258806,0.00034489037,0.000080216676],"domain_scores_gemma":[0.9964664,0.0022557008,0.0003195974,0.00057102117,0.0002818896,0.000105391235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011364076,0.00040912337,0.00034017581,0.0010531092,0.00049537304,0.0023588312,0.00047529239,0.00082696846,0.0040940437],"category_scores_gemma":[0.007830449,0.00020646323,0.00033510147,0.00070332136,0.006049113,0.0058626253,0.0016987448,0.0013010064,0.00033511428],"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.00068003655,0.00005448769,0.0024138447,0.0004992521,0.000058039303,0.00019816426,0.0015568404,0.012713265,0.028172866,0.7452722,0.0016377725,0.20674329],"study_design_scores_gemma":[0.000059493144,0.00023308817,0.0056426977,0.00009875383,0.000037612674,0.00039948605,0.0005926072,0.021421116,0.01451766,0.94891524,0.008034922,0.00004724832],"about_ca_topic_score_codex":0.0009848755,"about_ca_topic_score_gemma":0.0006130534,"teacher_disagreement_score":0.0040940437,"about_ca_system_score_codex":0.0009518498,"about_ca_system_score_gemma":0.0006346899,"threshold_uncertainty_score":0.013695896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028062932,0.0062700175,0.0014125754,0.0036761218,0.013623793,0.00010347591,0.0035267267,0.00062791636,0.9704788],"genre_scores_gemma":[0.0013291673,0.003504876,0.0005664886,0.0007683135,0.001657599,0.000057946054,0.0021853342,0.0003133063,0.989617],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990476,0.000086947206,0.00007226196,0.00015602526,0.0005641263,0.00007299594],"domain_scores_gemma":[0.99871564,0.00018880526,0.00004911934,0.00015883871,0.0007636986,0.00012382954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005926283,0.001065535,0.00085780915,0.0029670068,0.0012145957,0.004739931,0.001131807,0.000923342,0.5119716],"category_scores_gemma":[0.0032511237,0.00034210455,0.0004434923,0.0035941505,0.0006808706,0.0037156157,0.0012624526,0.001823907,0.39699614],"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.000014341806,0.000007962588,0.00002682291,0.00013995217,0.0000014214619,0.000014377589,0.00002256825,0.000071874994,0.00016102774,0.01478267,0.921061,0.063696],"study_design_scores_gemma":[0.0000010158251,0.000003218222,0.000053673113,0.000049651866,5.565934e-7,0.0000102788135,0.0000073350297,0.000012867892,0.000028518924,0.0013539146,0.9984775,0.0000013934974],"about_ca_topic_score_codex":0.0033465263,"about_ca_topic_score_gemma":0.005214894,"teacher_disagreement_score":0.5119716,"about_ca_system_score_codex":0.002571296,"about_ca_system_score_gemma":0.001347336,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20762832,0.0024000746,0.3390817,0.042017493,0.0012238489,0.00012286694,0.00024627216,0.0005469871,0.4067324],"genre_scores_gemma":[0.9842486,0.00027798547,0.0062901787,0.0006783391,0.00033740661,0.000025706204,0.00002751324,0.00004396469,0.008070268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977055,0.0015355848,0.00005497098,0.00016741133,0.00032814892,0.00020845409],"domain_scores_gemma":[0.9893065,0.007416724,0.00061883556,0.0014807935,0.00059157645,0.00058559224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025934526,0.00031468208,0.0005210777,0.00068855355,0.0019075704,0.0032192343,0.00094560103,0.0018467121,0.011489049],"category_scores_gemma":[0.026315078,0.0002914862,0.00038411937,0.00067671685,0.0075881537,0.004364002,0.0023891986,0.0034965752,0.00064540835],"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.00004505048,0.000020196996,0.0005469217,0.000030493526,0.000007722444,0.00013661484,0.00074957334,0.0019324191,0.00015833548,0.98093134,0.0036188988,0.0118225105],"study_design_scores_gemma":[0.000012790153,0.000005918008,0.00015734026,0.0000066623293,0.0000031189727,0.00008243721,0.00018783775,0.007473451,0.00006951495,0.98981106,0.002184852,0.000004957562],"about_ca_topic_score_codex":0.0017791333,"about_ca_topic_score_gemma":0.0019409925,"teacher_disagreement_score":0.011489049,"about_ca_system_score_codex":0.0009179198,"about_ca_system_score_gemma":0.0007831484,"threshold_uncertainty_score":0.038434744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72202134,0.00046497377,0.22551073,0.0030341824,0.00008220035,0.00014847459,0.000657833,0.0008306162,0.047249667],"genre_scores_gemma":[0.97480327,0.00010162928,0.022071274,0.00023378133,0.00008601524,0.00006368762,0.00032704932,0.00008731539,0.0022260796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653035,0.000986994,0.00025095715,0.0006843518,0.0010310095,0.00051622174],"domain_scores_gemma":[0.98039055,0.014538972,0.0011618261,0.0018631732,0.0011841203,0.00086135213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035482885,0.00037074744,0.00082847144,0.0017336311,0.0020113564,0.0036773225,0.0011743775,0.0010924917,0.0056328876],"category_scores_gemma":[0.017185517,0.0006012374,0.0016238256,0.0008424581,0.0045236046,0.008543741,0.0033410266,0.0021030947,0.00032703884],"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.00025250358,0.00010442537,0.0023664765,0.00014148506,0.000053168536,0.00022360552,0.0009870963,0.012246813,0.0050999196,0.96869284,0.0015843732,0.008247378],"study_design_scores_gemma":[0.00005404413,0.00006409055,0.0012031399,0.00003180689,0.000036786525,0.00010263142,0.00021144186,0.04028764,0.004112943,0.95170635,0.0021567058,0.000032281903],"about_ca_topic_score_codex":0.0018288229,"about_ca_topic_score_gemma":0.0026787936,"teacher_disagreement_score":0.0056328876,"about_ca_system_score_codex":0.0028405127,"about_ca_system_score_gemma":0.0013260198,"threshold_uncertainty_score":0.020609498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05172388,0.00027367382,0.91993475,0.0012026739,0.00020744414,0.00039196844,0.0011042432,0.010317916,0.014843495],"genre_scores_gemma":[0.35855627,0.00026470728,0.6328329,0.00036189475,0.00009815481,0.00040585524,0.0023956678,0.0009556692,0.0041289264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956892,0.001567508,0.00026376027,0.00079147215,0.0012459634,0.0004421454],"domain_scores_gemma":[0.9896653,0.0070637283,0.0006710784,0.0014010798,0.0009911598,0.00020771442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00287345,0.00090191886,0.0009838861,0.0011974451,0.0011731471,0.0027468866,0.0018201882,0.0011356382,0.012167935],"category_scores_gemma":[0.016962267,0.00066718477,0.0022164267,0.0012281986,0.0022725414,0.0034021128,0.0030333877,0.0028616046,0.002012112],"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.0005077605,0.00039973017,0.002955253,0.00078431895,0.000117368974,0.00051644316,0.0005298439,0.4588436,0.011083502,0.36544922,0.018290907,0.14052203],"study_design_scores_gemma":[0.00015514862,0.00008006743,0.0002631549,0.00006660893,0.000035392066,0.0001121726,0.00012650367,0.8173522,0.012382327,0.16118634,0.008212095,0.000028093153],"about_ca_topic_score_codex":0.0041574677,"about_ca_topic_score_gemma":0.0068299915,"teacher_disagreement_score":0.012167935,"about_ca_system_score_codex":0.0018878469,"about_ca_system_score_gemma":0.0048486986,"threshold_uncertainty_score":0.0407058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032003444,0.0034689524,0.5224012,0.06381419,0.0009296045,0.00008394601,0.00032671067,0.00040719128,0.3765648],"genre_scores_gemma":[0.80763876,0.0016945583,0.15291129,0.0034688155,0.0012781746,0.00019366817,0.0003320992,0.00024329429,0.03223935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867237,0.0006662273,0.00007703727,0.00022452945,0.0002810947,0.0000788262],"domain_scores_gemma":[0.9965238,0.0023629547,0.00014355853,0.0006187205,0.00024857567,0.00010242615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029165028,0.00042534637,0.000667734,0.0020703892,0.0019529513,0.003618689,0.0022241487,0.0027607856,0.015834345],"category_scores_gemma":[0.012213464,0.00040485087,0.00091362983,0.0012249629,0.011814289,0.010395223,0.0026412397,0.0041351323,0.0013668205],"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.00000350855,0.000003682565,0.000024217401,0.000008207549,0.0000016743569,0.000012059049,0.000079687554,0.00037707412,0.00002510665,0.9974369,0.0005618163,0.0014660355],"study_design_scores_gemma":[0.0000043191994,0.0000013307846,0.00001611553,0.000004654379,8.5529325e-7,0.000010663138,0.000019279725,0.0011434446,0.000033749926,0.99647707,0.002286404,0.0000021262836],"about_ca_topic_score_codex":0.0009667943,"about_ca_topic_score_gemma":0.0010306927,"teacher_disagreement_score":0.015834345,"about_ca_system_score_codex":0.001954742,"about_ca_system_score_gemma":0.0013388864,"threshold_uncertainty_score":0.052971125},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052850303,0.011502799,0.010733378,0.0019462458,0.00084743346,0.000024773133,0.000083173356,0.0001097141,0.97422385],"genre_scores_gemma":[0.04288974,0.016355468,0.012728921,0.0021986251,0.0020961869,0.000120420904,0.00024325088,0.00019744308,0.92316985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959415,0.00010033962,0.00001187982,0.00006940539,0.00019564455,0.000028572716],"domain_scores_gemma":[0.99970067,0.00013765338,0.000012419441,0.00006563652,0.00006138154,0.000022248163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042130955,0.000906194,0.00061109214,0.0013754318,0.0012044619,0.0033552086,0.0008502744,0.0010170765,0.0447429],"category_scores_gemma":[0.0013879165,0.0003092115,0.00032594008,0.0015089816,0.0038819474,0.003415787,0.0012940858,0.0025189477,0.017013237],"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.0000042608235,0.000010373079,0.0000275145,0.00009434008,0.0000038584963,0.000012147905,0.0001302309,0.00023214576,0.00010725013,0.9002785,0.06669901,0.032400414],"study_design_scores_gemma":[0.0000029113378,0.000005431154,0.00007414264,0.000078797035,0.0000027053165,0.000036893405,0.000045543115,0.0004885345,0.00009864312,0.54783875,0.4513241,0.000003511419],"about_ca_topic_score_codex":0.001448845,"about_ca_topic_score_gemma":0.0026807955,"teacher_disagreement_score":0.0447429,"about_ca_system_score_codex":0.0023251527,"about_ca_system_score_gemma":0.0012584428,"threshold_uncertainty_score":0.14967996},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01906884,0.08518799,0.16319826,0.088395536,0.0012523757,0.000096711636,0.00014045731,0.00031457483,0.6423453],"genre_scores_gemma":[0.9077983,0.023724928,0.033010487,0.011355368,0.0010978321,0.00020548429,0.000128458,0.00017498649,0.022504166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99311733,0.00377748,0.000311739,0.0008337502,0.0014576544,0.0005020775],"domain_scores_gemma":[0.98902833,0.008479666,0.00048060945,0.0010493251,0.00072547374,0.00023662394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006870227,0.00039615558,0.00060701685,0.0024150985,0.0021154154,0.0044335863,0.0015250114,0.0029858765,0.0037965723],"category_scores_gemma":[0.01189766,0.00032834156,0.0010582977,0.001439753,0.020599082,0.0047984384,0.0021903452,0.005048503,0.00081110845],"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.0000022481795,0.0000018972038,0.000040137482,0.000018190633,0.0000028773418,0.000008199934,0.00007077599,0.0004864488,0.00001469749,0.9961133,0.0005424426,0.002698742],"study_design_scores_gemma":[0.000004715411,0.0000050415683,0.000094557414,0.000057670248,0.0000036995027,0.000024968513,0.000044106924,0.001009517,0.00007138031,0.9713428,0.02733566,0.0000058074493],"about_ca_topic_score_codex":0.010650049,"about_ca_topic_score_gemma":0.007853485,"teacher_disagreement_score":0.98934996,"about_ca_system_score_codex":0.009089674,"about_ca_system_score_gemma":0.0057171504,"threshold_uncertainty_score":0.06595051},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60074574,0.00037992361,0.31753916,0.0034498975,0.00011815724,0.0001412095,0.0005585605,0.0010656354,0.07600173],"genre_scores_gemma":[0.9661749,0.000097596334,0.028126836,0.00039194615,0.000049129256,0.00009281126,0.00020320232,0.00010381152,0.004759663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981072,0.0004010478,0.000095323085,0.0004690971,0.00047881503,0.00044856023],"domain_scores_gemma":[0.9921417,0.005090875,0.00043266782,0.00083675195,0.00074032356,0.0007577793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013829469,0.00038551103,0.0009936317,0.0006478152,0.0021840855,0.0026263813,0.0012484454,0.0012979351,0.0068991776],"category_scores_gemma":[0.008673177,0.0004404553,0.0012182902,0.00047664513,0.003511283,0.006496863,0.0024144815,0.004484619,0.00066694856],"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.00009598996,0.00005473481,0.0010022483,0.000110117806,0.000024415294,0.00018061377,0.00033046576,0.0028408396,0.004394703,0.98343474,0.0013162118,0.006214757],"study_design_scores_gemma":[0.00002628055,0.000029739263,0.00034952187,0.000015423024,0.00001499374,0.00011119245,0.00011051384,0.023174077,0.0025643278,0.97183967,0.0017483996,0.000015860123],"about_ca_topic_score_codex":0.0030809187,"about_ca_topic_score_gemma":0.0038185222,"teacher_disagreement_score":0.0068991776,"about_ca_system_score_codex":0.0019245005,"about_ca_system_score_gemma":0.0018420772,"threshold_uncertainty_score":0.023080051},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019786362,0.028510684,0.5641856,0.021771286,0.014611673,0.00046120983,0.0019860456,0.0026889937,0.34599808],"genre_scores_gemma":[0.48123437,0.027510216,0.2909598,0.018444527,0.010735572,0.0012955909,0.0019407758,0.0017294638,0.16614975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990638,0.00015308672,0.000059818154,0.00015237185,0.0004223777,0.00014863987],"domain_scores_gemma":[0.99884665,0.0005556155,0.00006207292,0.00009100526,0.00033999194,0.000104771294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013197183,0.0014611371,0.0009181442,0.0021363685,0.0016797371,0.0019528433,0.0010088542,0.0011899276,0.032067508],"category_scores_gemma":[0.0036489847,0.00054646604,0.001436666,0.001519705,0.0022793326,0.0032763989,0.0032450364,0.0038874003,0.005752466],"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.00009840127,0.000110638466,0.00026851596,0.0005862495,0.00008119084,0.0009973515,0.00041336843,0.0024954402,0.007264919,0.85111964,0.054285325,0.08227902],"study_design_scores_gemma":[0.00003439111,0.00008907877,0.0007537499,0.00023461411,0.000046384648,0.0004687803,0.00009200194,0.002870402,0.0039807674,0.75789106,0.23347208,0.00006660293],"about_ca_topic_score_codex":0.0018007741,"about_ca_topic_score_gemma":0.0016792095,"teacher_disagreement_score":0.032067508,"about_ca_system_score_codex":0.0017757346,"about_ca_system_score_gemma":0.0011271461,"threshold_uncertainty_score":0.1072765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019647725,0.0010159177,0.9646172,0.00085115054,0.0001920583,0.000102216894,0.0004170101,0.0065198927,0.0066368957],"genre_scores_gemma":[0.5198972,0.0009966496,0.46709403,0.0008195089,0.00027516385,0.00032805654,0.0015539264,0.0015230484,0.007512384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888664,0.00016001116,0.000060008766,0.00019321141,0.0005968632,0.0001033642],"domain_scores_gemma":[0.9980052,0.0007528981,0.00008793473,0.00066423765,0.000387456,0.00010225084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010886462,0.0010219666,0.00090878364,0.00045993135,0.00052673335,0.0016127287,0.0019666539,0.00078046863,0.0047004437],"category_scores_gemma":[0.0065440936,0.00043758607,0.0004022173,0.0011866778,0.0009912131,0.0029817414,0.0026992399,0.0023450449,0.0016240111],"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.0005131429,0.0002476743,0.0015248167,0.00039500566,0.000072423354,0.00020349423,0.00033034058,0.2688057,0.017885096,0.10043108,0.050592665,0.5589985],"study_design_scores_gemma":[0.00007629865,0.00005341022,0.00024531214,0.000029498175,0.0000118307335,0.000102885526,0.00006778924,0.8983478,0.009209301,0.08627411,0.005564597,0.000017170529],"about_ca_topic_score_codex":0.0028887608,"about_ca_topic_score_gemma":0.0063411025,"teacher_disagreement_score":0.0047004437,"about_ca_system_score_codex":0.0010735972,"about_ca_system_score_gemma":0.00202291,"threshold_uncertainty_score":0.0157246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06266241,0.00064595503,0.918707,0.0013332813,0.00011752356,0.00006234859,0.0001219666,0.0020295882,0.014319928],"genre_scores_gemma":[0.80764866,0.00068532245,0.1850114,0.00031445816,0.000046442026,0.000060310358,0.0001678363,0.00012514807,0.0059405384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981886,0.00003415273,0.00001039004,0.000035732206,0.00007525523,0.000025751526],"domain_scores_gemma":[0.9995664,0.00013010245,0.000033136173,0.0001407296,0.000083090345,0.000046580088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000432826,0.0003564206,0.0003826405,0.0003173121,0.00037405905,0.0011954557,0.0015184776,0.0005296988,0.003658612],"category_scores_gemma":[0.0011751149,0.00021308068,0.00044252252,0.00033304692,0.0015585419,0.0029444697,0.0011487347,0.0014296325,0.00060439453],"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.00021100118,0.0000957743,0.0008722102,0.00024494456,0.0000793962,0.0001686492,0.0002621341,0.15504427,0.032090683,0.6239672,0.0044286205,0.18253508],"study_design_scores_gemma":[0.000015210335,0.000087500644,0.00015967857,0.00001981701,0.000028132548,0.0000833764,0.00003965479,0.60402375,0.0107592745,0.37743077,0.0073346756,0.000018062996],"about_ca_topic_score_codex":0.0015926128,"about_ca_topic_score_gemma":0.002610454,"teacher_disagreement_score":0.003658612,"about_ca_system_score_codex":0.000796968,"about_ca_system_score_gemma":0.0009135641,"threshold_uncertainty_score":0.012239337},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055603357,0.027321927,0.011375323,0.004525508,0.0046870573,0.00006768522,0.00028364963,0.00039107562,0.9507917],"genre_scores_gemma":[0.012678675,0.03064806,0.013678527,0.0033503189,0.0017974272,0.00017433027,0.000864728,0.00034724775,0.9364607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964964,0.00006756655,0.000015257616,0.00006748303,0.00016749681,0.00003247941],"domain_scores_gemma":[0.9997147,0.000080460886,0.000016498616,0.0000819833,0.000052090887,0.000054286807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035043593,0.00087131176,0.0006471712,0.0014813211,0.0009451615,0.0050364025,0.00072489,0.0010355199,0.0651768],"category_scores_gemma":[0.00096213643,0.00036750195,0.00047277825,0.0020462722,0.0016075025,0.0047393576,0.002524871,0.002311523,0.038665034],"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.0000074976633,0.000014145967,0.000084047526,0.000258625,0.000010252461,0.000051154184,0.00021277637,0.00025758037,0.00052022515,0.5661287,0.31486344,0.11759157],"study_design_scores_gemma":[0.0000016558913,0.0000042122947,0.00006728914,0.00009989841,0.0000024970207,0.00006799181,0.00004955277,0.00016577891,0.00005553883,0.06669801,0.932785,0.0000025354389],"about_ca_topic_score_codex":0.0009953907,"about_ca_topic_score_gemma":0.0019979305,"teacher_disagreement_score":0.0651768,"about_ca_system_score_codex":0.0010988273,"about_ca_system_score_gemma":0.0015241839,"threshold_uncertainty_score":0.21803814},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111064015,0.18371943,0.00036468866,0.7298332,0.08312883,0.000011642578,0.00020617979,0.000059720245,0.0025652947],"genre_scores_gemma":[0.0013701267,0.08244988,0.00033940596,0.82930285,0.08239811,0.000053607462,0.000095661475,0.00004264754,0.0039477847],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951474,0.000977805,0.0005808471,0.0008353629,0.0021454822,0.00031312846],"domain_scores_gemma":[0.980547,0.012169928,0.0011870553,0.00046195753,0.004910476,0.00072361936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067999824,0.0012738269,0.002253323,0.002360359,0.0019377475,0.004604475,0.0044371425,0.019519234,0.0043164785],"category_scores_gemma":[0.021146784,0.0007100327,0.0015743566,0.00379897,0.0064999694,0.009919535,0.0039647007,0.028038066,0.006010836],"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.000016067072,0.0000043986797,0.00003627347,0.00039212842,0.000011718206,0.000049383743,0.000059767957,0.000024292778,0.000068273745,0.0072846934,0.9838372,0.008215815],"study_design_scores_gemma":[0.0000160107,0.000012338941,0.00019170022,0.00056429167,0.000018423723,0.00012299143,0.000056783705,0.000026162648,0.000080798796,0.0067911376,0.99209994,0.000019433402],"about_ca_topic_score_codex":0.007247124,"about_ca_topic_score_gemma":0.011286791,"teacher_disagreement_score":0.019519234,"about_ca_system_score_codex":0.0029294174,"about_ca_system_score_gemma":0.0057068784,"threshold_uncertainty_score":0.035962164},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73982906,0.00083140394,0.15463251,0.00073715544,0.00017112283,0.000049046357,0.0001258316,0.00038110415,0.10324281],"genre_scores_gemma":[0.9857862,0.00013164128,0.008109945,0.00007678071,0.00003062648,0.000029865594,0.0000661893,0.00003832354,0.005730411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993019,0.00015206987,0.000034411984,0.00012750705,0.00024706387,0.00013702255],"domain_scores_gemma":[0.99880123,0.0005233308,0.00009783304,0.00022741397,0.00021091106,0.00013932689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007614989,0.00021636656,0.0003496162,0.00081182254,0.0007614455,0.0016950301,0.0006774166,0.00046902633,0.00310036],"category_scores_gemma":[0.0029158748,0.00021505028,0.0004808226,0.00045863347,0.0024625033,0.0029713884,0.0014452381,0.0011283923,0.0003256618],"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.000035975572,0.00001329106,0.00044918185,0.000026169817,0.000003675634,0.00006652912,0.00017843345,0.0016816488,0.0025122869,0.99061394,0.00021123582,0.0042075072],"study_design_scores_gemma":[0.000020608071,0.00006639134,0.0011120604,0.000029681058,0.000010577183,0.00028335332,0.00016226516,0.029252252,0.0056674904,0.95481443,0.008553193,0.000027817116],"about_ca_topic_score_codex":0.0006127012,"about_ca_topic_score_gemma":0.0004773169,"teacher_disagreement_score":0.00310036,"about_ca_system_score_codex":0.0007234177,"about_ca_system_score_gemma":0.00044959562,"threshold_uncertainty_score":0.010371745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076818066,0.0006357264,0.973825,0.0016458207,0.00025200815,0.00006141215,0.0002599381,0.0008796578,0.0147587],"genre_scores_gemma":[0.4505549,0.0020437636,0.5289803,0.002371703,0.0007222498,0.0005238298,0.00089054665,0.0009672958,0.012945416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975473,0.0006930784,0.00022511695,0.00044273422,0.0008386674,0.00025301648],"domain_scores_gemma":[0.99801385,0.0011352714,0.00017214486,0.00021748414,0.000343624,0.00011767641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004486949,0.00075356965,0.0006695891,0.0020256476,0.0013364326,0.0034299607,0.0018155592,0.0011509779,0.006725104],"category_scores_gemma":[0.004887307,0.0005402,0.0016019272,0.0016909924,0.0057373256,0.008764071,0.0035605172,0.003939424,0.001604229],"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.000003500935,0.0000046599534,0.000034793185,0.000021072143,0.000002683922,0.000023417457,0.00009148722,0.00036386334,0.00025489795,0.99651426,0.00052021974,0.002165164],"study_design_scores_gemma":[0.000015833864,0.000018505942,0.00008676113,0.00004346067,0.000012618055,0.00011573904,0.00008129075,0.0085942205,0.0016806769,0.9558774,0.033457715,0.000015753823],"about_ca_topic_score_codex":0.00095164846,"about_ca_topic_score_gemma":0.0007290957,"teacher_disagreement_score":0.006725104,"about_ca_system_score_codex":0.0017392361,"about_ca_system_score_gemma":0.0014998242,"threshold_uncertainty_score":0.023729563},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06747567,0.0050747483,0.58466905,0.011905705,0.0010511859,0.0004322385,0.00043342484,0.002270553,0.32668734],"genre_scores_gemma":[0.8177647,0.0017437327,0.10992302,0.0017631048,0.0004173601,0.00065862876,0.00038914892,0.000464693,0.06687565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958912,0.0020713448,0.00025111015,0.0006399198,0.0007315333,0.00041481372],"domain_scores_gemma":[0.9940766,0.003294179,0.00037846676,0.0010388896,0.00069335575,0.00051843596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002785704,0.00054816174,0.0006476201,0.0011183098,0.0031744326,0.006936736,0.0015818689,0.0022255818,0.011216085],"category_scores_gemma":[0.010044978,0.0007428324,0.0011084793,0.0007790561,0.009775342,0.01194641,0.0043656477,0.003252734,0.00206379],"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.000011993217,0.0000057850466,0.00007095944,0.000049442668,0.000003978671,0.000049097547,0.0007190124,0.0011347795,0.00023239253,0.993826,0.001060373,0.0028361443],"study_design_scores_gemma":[0.000022072149,0.00002653029,0.00018942458,0.00009264247,0.000014035065,0.00011247787,0.00036517892,0.013049491,0.00082636246,0.9372121,0.048067242,0.000022515276],"about_ca_topic_score_codex":0.0026866319,"about_ca_topic_score_gemma":0.0016910197,"teacher_disagreement_score":0.011216085,"about_ca_system_score_codex":0.002429937,"about_ca_system_score_gemma":0.0018283126,"threshold_uncertainty_score":0.03752148},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10536475,0.0032315245,0.848439,0.009444196,0.0002566252,0.00005460033,0.0006201935,0.0005289822,0.032060098],"genre_scores_gemma":[0.8702398,0.0025490357,0.111542344,0.00095993903,0.0012982842,0.000128252,0.00063682813,0.00018629526,0.012459153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971566,0.001437147,0.00012809677,0.0004357814,0.00059509405,0.00024721952],"domain_scores_gemma":[0.98115647,0.013357711,0.001375716,0.0021015552,0.0011696581,0.0008389638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044905306,0.0006135579,0.0017281364,0.0033508453,0.0020017836,0.0042569954,0.001718928,0.0015267484,0.0073644137],"category_scores_gemma":[0.038436394,0.0008667178,0.0010721796,0.0030600037,0.0056885737,0.008729314,0.004315319,0.004175854,0.0010049964],"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.000039623104,0.0000154316,0.0006300448,0.00004130628,0.000011341756,0.000024092777,0.00009487845,0.008782194,0.00010928694,0.977408,0.0017148358,0.011128977],"study_design_scores_gemma":[0.0000070865094,0.0000048715783,0.000113300266,0.000011963487,0.0000037516938,0.000021583477,0.000018828012,0.018416157,0.000065671855,0.98047435,0.0008552243,0.0000071264544],"about_ca_topic_score_codex":0.0030254535,"about_ca_topic_score_gemma":0.0027932501,"teacher_disagreement_score":0.0073644137,"about_ca_system_score_codex":0.0022581469,"about_ca_system_score_gemma":0.0013013504,"threshold_uncertainty_score":0.024636447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16159992,0.00028332425,0.7823115,0.0077279615,0.0006066328,0.00017978092,0.000867303,0.0026172241,0.043806314],"genre_scores_gemma":[0.9147912,0.000092018265,0.07372414,0.00035128393,0.00014338664,0.000099294135,0.00018977573,0.00035690077,0.010252002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657625,0.0014901534,0.00019845078,0.0005487372,0.00081031263,0.0003760481],"domain_scores_gemma":[0.97999096,0.0105544785,0.0009231917,0.0066467337,0.0010103794,0.0008742688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036768715,0.0005175149,0.0014127889,0.0007558989,0.002127195,0.0045536123,0.0024166922,0.0027833553,0.017508885],"category_scores_gemma":[0.034433313,0.00084649917,0.0019033198,0.0009999607,0.005481172,0.012037783,0.007070551,0.00584342,0.0017119601],"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.00047175743,0.000100257974,0.0015360109,0.00009910051,0.000033503296,0.00020230602,0.00057528605,0.026315888,0.0010314807,0.94065714,0.005543653,0.023433609],"study_design_scores_gemma":[0.00003134253,0.000033370852,0.00017517089,0.000016969105,0.000017603998,0.00008042733,0.00008987037,0.14587563,0.00064890453,0.851578,0.0014264829,0.000026193906],"about_ca_topic_score_codex":0.003110491,"about_ca_topic_score_gemma":0.002596648,"teacher_disagreement_score":0.017508885,"about_ca_system_score_codex":0.0017071854,"about_ca_system_score_gemma":0.0026013302,"threshold_uncertainty_score":0.058573067},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4017607,0.0026249944,0.07456905,0.006674421,0.0005071189,0.00013331966,0.0035880858,0.0012605923,0.5088816],"genre_scores_gemma":[0.9452966,0.0007024367,0.0128221195,0.000580048,0.00014706865,0.000077525016,0.0010740729,0.000118113036,0.0391821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995753,0.000098565506,0.000023200368,0.000106396095,0.000097889824,0.000098497294],"domain_scores_gemma":[0.9985819,0.0007045569,0.00021633472,0.00020769342,0.00014408567,0.00014558544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048394292,0.0003439901,0.00031803473,0.0009402081,0.0014969029,0.0031037398,0.0005406499,0.00084203435,0.019736893],"category_scores_gemma":[0.0034499608,0.00032125428,0.00036646303,0.0008017817,0.0017387567,0.004639009,0.0018928006,0.0019247908,0.0031891116],"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.0002794047,0.000027457376,0.000539667,0.00013662079,0.000018733379,0.000118180535,0.00019539773,0.0013607413,0.001560312,0.9662437,0.01325042,0.016269341],"study_design_scores_gemma":[0.000055557684,0.000029973924,0.0011767795,0.000042030115,0.000027606691,0.00044552243,0.00028129248,0.0028968176,0.0028637894,0.9609622,0.031185973,0.000032417363],"about_ca_topic_score_codex":0.0007623368,"about_ca_topic_score_gemma":0.00087636156,"teacher_disagreement_score":0.019736893,"about_ca_system_score_codex":0.0008193475,"about_ca_system_score_gemma":0.00060429453,"threshold_uncertainty_score":0.06602645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25417572,0.003350135,0.6088992,0.0061939745,0.000628672,0.00015917084,0.000662763,0.0011677301,0.124762684],"genre_scores_gemma":[0.95858556,0.00057009334,0.033038083,0.0005188526,0.00026010003,0.00011139824,0.00044152638,0.00016750183,0.0063069738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995439,0.0013568128,0.00031221248,0.00078204187,0.0016027883,0.00050712476],"domain_scores_gemma":[0.99389994,0.0031539067,0.00030172535,0.0013731162,0.0009839853,0.00028721837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002982717,0.0006594889,0.0011283401,0.0027938904,0.0012783762,0.004791287,0.0014104579,0.0012568029,0.004896023],"category_scores_gemma":[0.009486027,0.0005655319,0.0016895185,0.0011804978,0.008135787,0.008236503,0.004837192,0.0048415298,0.00054837286],"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.00001587728,0.000015807056,0.00013849261,0.000037387246,0.000008923862,0.000054351716,0.00025379917,0.0010872635,0.00041053933,0.99478155,0.00028212645,0.002913986],"study_design_scores_gemma":[0.000009821685,0.000007709343,0.000089709225,0.000017508046,0.000008694099,0.000050020877,0.00006339486,0.0031445345,0.00066166115,0.9937809,0.0021591273,0.000006940351],"about_ca_topic_score_codex":0.0008538301,"about_ca_topic_score_gemma":0.0005687345,"teacher_disagreement_score":0.004896023,"about_ca_system_score_codex":0.0019103377,"about_ca_system_score_gemma":0.0009672204,"threshold_uncertainty_score":0.01637882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66041124,0.0028167625,0.10910469,0.002356386,0.0004626008,0.00008644145,0.0012559453,0.00046244665,0.2230435],"genre_scores_gemma":[0.96255773,0.00053980097,0.012842328,0.00020665576,0.00026402803,0.000092761875,0.0006398815,0.00007001586,0.022786757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933535,0.00018859873,0.0000659181,0.000114818045,0.00014810458,0.00014721628],"domain_scores_gemma":[0.99718285,0.0016361687,0.00029655555,0.00029748408,0.00023155271,0.00035532154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008624677,0.0003998524,0.00054848654,0.0028669594,0.0013123075,0.0032291582,0.00059441646,0.00055591343,0.010867925],"category_scores_gemma":[0.0039632223,0.00028225573,0.0003845233,0.0012951024,0.0024684537,0.0060211155,0.0023545544,0.0014203888,0.0014986785],"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.000121862955,0.000016517099,0.0012399185,0.000058923903,0.000009971632,0.000061354316,0.0002958206,0.0006288469,0.00097364787,0.9833197,0.0021761425,0.011097431],"study_design_scores_gemma":[0.000015742933,0.0000356088,0.0015095196,0.000042382748,0.000015162663,0.00021009844,0.00026394278,0.003629923,0.0014992931,0.9822123,0.010552889,0.000013148333],"about_ca_topic_score_codex":0.00027837735,"about_ca_topic_score_gemma":0.00033579336,"teacher_disagreement_score":0.010867925,"about_ca_system_score_codex":0.0008494132,"about_ca_system_score_gemma":0.00032268406,"threshold_uncertainty_score":0.036356807},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012912743,0.14124018,0.09308275,0.007347177,0.0029820497,0.000056062905,0.0003646231,0.00035454414,0.7416598],"genre_scores_gemma":[0.40920675,0.108901374,0.08142445,0.0034281085,0.011304449,0.00049985514,0.0012397867,0.00038176155,0.3836135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994573,0.00017163335,0.00003410208,0.000103011975,0.00019666567,0.00003727923],"domain_scores_gemma":[0.99940145,0.00038573256,0.00003770235,0.00006852839,0.00007158137,0.000034987526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005867665,0.0007811092,0.0006875074,0.0021128021,0.0014926881,0.003946468,0.0009506815,0.000976395,0.010961211],"category_scores_gemma":[0.0028394973,0.00039868217,0.0003972773,0.0039219833,0.0043719546,0.0066587836,0.001043983,0.0022179235,0.0020488014],"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.0000053510034,0.000005903858,0.000070603644,0.00006645508,0.0000021770506,0.000008713047,0.00013378402,0.00041213096,0.000061120496,0.96824944,0.010242987,0.020741338],"study_design_scores_gemma":[0.000002103685,0.000004274843,0.00009537228,0.00005275941,0.0000022706313,0.000033684006,0.000068336456,0.00055130373,0.00004248262,0.94421774,0.05492647,0.0000032067546],"about_ca_topic_score_codex":0.0018320287,"about_ca_topic_score_gemma":0.002578818,"teacher_disagreement_score":0.010961211,"about_ca_system_score_codex":0.002054778,"about_ca_system_score_gemma":0.0009934746,"threshold_uncertainty_score":0.036668897},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004552808,0.005071411,0.019398136,0.006517079,0.0015301319,0.000037162652,0.0005847153,0.00015134775,0.9621572],"genre_scores_gemma":[0.32239133,0.014373378,0.032281984,0.009658981,0.0045470046,0.00034154922,0.0018052184,0.00041554903,0.6141851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955374,0.00009968262,0.000033638506,0.000081602346,0.0001881247,0.000043221913],"domain_scores_gemma":[0.99924964,0.00044977677,0.000021721986,0.000108115746,0.0001381589,0.00003260564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010513719,0.00040851816,0.0005333064,0.0012572316,0.0019300514,0.0020699922,0.0006417879,0.0009955415,0.030967737],"category_scores_gemma":[0.0021779817,0.00032878044,0.0007003887,0.0012706533,0.0040473645,0.0062336954,0.0015017443,0.003106076,0.005173478],"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.0000028391623,0.0000022689333,0.000013298026,0.000017280496,7.765903e-7,0.000012374512,0.00008011892,0.000077980454,0.000067598674,0.98861724,0.007863353,0.0032448864],"study_design_scores_gemma":[0.0000040086834,0.000004793732,0.00013866911,0.000046145673,0.000001690205,0.000055356904,0.000074778625,0.00018553322,0.00012011448,0.842001,0.15736169,0.0000061283304],"about_ca_topic_score_codex":0.0026261515,"about_ca_topic_score_gemma":0.002820017,"teacher_disagreement_score":0.030967737,"about_ca_system_score_codex":0.0028700912,"about_ca_system_score_gemma":0.001156147,"threshold_uncertainty_score":0.1035974},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027622528,0.037826393,0.5956401,0.024974626,0.03248724,0.0010419936,0.0067665935,0.019468993,0.2541716],"genre_scores_gemma":[0.09764528,0.03710068,0.32972428,0.0024633012,0.007551631,0.0005216012,0.021422815,0.006221691,0.49734867],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984004,0.00030668746,0.00010061837,0.00020698165,0.00084028195,0.00014509524],"domain_scores_gemma":[0.99400157,0.0013127134,0.000107968954,0.0011775095,0.0028395604,0.00056068366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037536067,0.0015508448,0.003022337,0.0015445902,0.002227497,0.008033572,0.0019316135,0.0014068607,0.100954466],"category_scores_gemma":[0.0073806997,0.000856755,0.0014070905,0.0021742077,0.002331556,0.0053750225,0.003282679,0.0037613823,0.0299734],"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.0005491445,0.00025567567,0.0012633469,0.00035403724,0.00012383629,0.00012669273,0.00040054097,0.0060466565,0.002036785,0.051817134,0.7171471,0.21987906],"study_design_scores_gemma":[0.00017189635,0.000177609,0.0019990697,0.0003626127,0.0001380986,0.0002692723,0.0004664003,0.06405996,0.0038896082,0.06050931,0.86787456,0.00008173657],"about_ca_topic_score_codex":0.03161904,"about_ca_topic_score_gemma":0.06821073,"teacher_disagreement_score":0.100954466,"about_ca_system_score_codex":0.003155684,"about_ca_system_score_gemma":0.0086225355,"threshold_uncertainty_score":0.33772635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008630744,0.02124698,0.33868438,0.009358967,0.0217055,0.0005071989,0.012511931,0.025742585,0.5616117],"genre_scores_gemma":[0.020704634,0.01509095,0.09888302,0.001215811,0.0014514922,0.0002056915,0.02990021,0.0060674427,0.8264808],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993001,0.00010131671,0.000030074381,0.0000828651,0.00041853214,0.00006713923],"domain_scores_gemma":[0.99848795,0.00026750186,0.00001925332,0.00025033916,0.0008157394,0.00015917019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010694528,0.001449903,0.00183663,0.0013476755,0.0013760148,0.0046653706,0.0019196285,0.0007943636,0.1188669],"category_scores_gemma":[0.0027217139,0.0005944765,0.0008244889,0.0021926954,0.0012453212,0.0027095398,0.0017755048,0.0019702232,0.06634317],"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.00009741651,0.00004570839,0.00021859765,0.00017336123,0.000014408787,0.000049716404,0.000082052575,0.0012139435,0.0012142699,0.014210571,0.8291559,0.15352398],"study_design_scores_gemma":[0.000029560488,0.000022613987,0.0005971002,0.00014290382,0.00002524792,0.00015450304,0.00010196078,0.012403865,0.0026797587,0.020479606,0.9633388,0.000024117688],"about_ca_topic_score_codex":0.04961338,"about_ca_topic_score_gemma":0.16445553,"teacher_disagreement_score":0.1188669,"about_ca_system_score_codex":0.003541736,"about_ca_system_score_gemma":0.00575023,"threshold_uncertainty_score":0.39764935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72907585,0.0033225992,0.120619334,0.0011097771,0.0005759008,0.00010928525,0.0010013178,0.0006990005,0.14348695],"genre_scores_gemma":[0.9512015,0.0010186315,0.02087733,0.000315737,0.00009566798,0.000119514174,0.0006559316,0.00014822901,0.025567422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978846,0.000047036523,0.000014777934,0.000046904737,0.00003962459,0.00006323097],"domain_scores_gemma":[0.9992872,0.00025223187,0.00012303119,0.00010396848,0.00006839273,0.00016520283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001791967,0.00024127257,0.0003179277,0.00077317347,0.0010790125,0.0013753788,0.00048120136,0.00058943575,0.0072851935],"category_scores_gemma":[0.0013161466,0.00026657878,0.0003156225,0.0005868325,0.0010184194,0.0022529534,0.0013365136,0.00054369454,0.0010330938],"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.0002129844,0.000025041152,0.0013067772,0.00011944688,0.00001771298,0.00028412184,0.0003375086,0.003538978,0.006396199,0.959093,0.0042275414,0.024440661],"study_design_scores_gemma":[0.000023703951,0.00006214966,0.0008267349,0.000057461108,0.000022705175,0.00036412323,0.00034448516,0.006640303,0.004815902,0.95837563,0.02844806,0.00001880723],"about_ca_topic_score_codex":0.00060332025,"about_ca_topic_score_gemma":0.001184338,"teacher_disagreement_score":0.0072851935,"about_ca_system_score_codex":0.00043730816,"about_ca_system_score_gemma":0.00032088725,"threshold_uncertainty_score":0.024371445},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021841677,0.0011835446,0.0076464373,0.0024136805,0.0011943231,0.0026929195,0.8697869,0.0014465925,0.11145132],"genre_scores_gemma":[0.043708153,0.003375175,0.035978075,0.004607293,0.00074936665,0.03130908,0.8009022,0.0032420254,0.076128684],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946726,0.0016865713,0.00063150894,0.0013119443,0.0010502493,0.00064722373],"domain_scores_gemma":[0.9871776,0.0041528954,0.000916138,0.0019139708,0.0051571536,0.00068227947],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0050256923,0.0010349719,0.0012060358,0.0051670987,0.0014906824,0.0024547623,0.0023190791,0.0012556794,0.24104574],"category_scores_gemma":[0.034858514,0.000505941,0.00085292954,0.011230441,0.0006324979,0.0013717245,0.0025784736,0.0017692542,0.083618104],"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.00014310093,0.000033588207,0.0030510167,0.0016283825,0.000059991995,0.00010713156,0.0008130991,0.00030566947,0.00020671744,0.013678144,0.94911784,0.030855332],"study_design_scores_gemma":[0.000060333743,0.00002015536,0.008365617,0.00093352137,0.000030536048,0.000099146106,0.00077978283,0.00026899867,0.00016626777,0.0037416872,0.9855158,0.000018211475],"about_ca_topic_score_codex":0.08097817,"about_ca_topic_score_gemma":0.07986098,"teacher_disagreement_score":0.7589543,"about_ca_system_score_codex":0.0021485945,"about_ca_system_score_gemma":0.014940733,"threshold_uncertainty_score":0.80637836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.679937,0.00103303,0.26096907,0.0007272295,0.00016402418,0.00006951549,0.00017491766,0.00057996577,0.056345154],"genre_scores_gemma":[0.95746386,0.00023698041,0.036719758,0.000052554118,0.000051578634,0.000041040897,0.00011669586,0.000087901695,0.0052296785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993771,0.00013318348,0.00003356076,0.00015700395,0.00020261298,0.00009657937],"domain_scores_gemma":[0.9993875,0.00023620634,0.0000857487,0.00012290505,0.00007441598,0.00009310065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005181872,0.0007665999,0.00059258344,0.0014148423,0.001170132,0.0028997394,0.00068711175,0.00079473795,0.0044292086],"category_scores_gemma":[0.002715551,0.0003075489,0.00061117107,0.0006451077,0.0035296485,0.005749748,0.0030800516,0.0019574035,0.00051874906],"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.00002871687,0.000017095113,0.00069709367,0.00005747409,0.000007282293,0.00019236332,0.00059527456,0.0026036305,0.0030319318,0.98715067,0.00035745694,0.005260958],"study_design_scores_gemma":[0.000021566597,0.000054171178,0.0010516044,0.00003662156,0.000016166074,0.0005756401,0.0003775988,0.024868887,0.0085596,0.95110583,0.013293735,0.00003861204],"about_ca_topic_score_codex":0.0003710917,"about_ca_topic_score_gemma":0.0003379638,"teacher_disagreement_score":0.0044292086,"about_ca_system_score_codex":0.0010185145,"about_ca_system_score_gemma":0.00023106474,"threshold_uncertainty_score":0.014817238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076566904,0.0022784069,0.0012970518,0.002161489,0.0027709533,0.00012446567,0.0026406955,0.0035462568,0.98441505],"genre_scores_gemma":[0.001555323,0.0012297994,0.00062574015,0.0005913356,0.00028860927,0.000025800879,0.0009148414,0.000637572,0.9941309],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952054,0.00003049301,0.000021390362,0.000062564905,0.0003070374,0.00005791879],"domain_scores_gemma":[0.99907374,0.000094448675,0.000035818328,0.00010185123,0.0004698992,0.00022427441],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00066626247,0.0011412835,0.0007496779,0.0019399852,0.0017454978,0.00557049,0.0010445118,0.0018889253,0.8356596],"category_scores_gemma":[0.0017413965,0.00054378447,0.0006166747,0.0015410945,0.0006701812,0.00413962,0.0025105188,0.001866854,0.7586498],"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.00006697237,0.00003636387,0.00007043816,0.00023430846,0.0000030091026,0.00014291143,0.0000878728,0.00006641767,0.000976568,0.0029342605,0.8824948,0.11288608],"study_design_scores_gemma":[0.0000053464078,0.000009969714,0.00014353725,0.00005056462,0.0000014858437,0.000105255735,0.00005521956,0.000027854563,0.00031544894,0.0003614278,0.99891937,0.000004578633],"about_ca_topic_score_codex":0.0031173711,"about_ca_topic_score_gemma":0.0057098013,"teacher_disagreement_score":0.16434038,"about_ca_system_score_codex":0.001019211,"about_ca_system_score_gemma":0.0016653746,"threshold_uncertainty_score":0.23441154},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9679938,0.00070233125,0.023981778,0.00027950958,0.000051008657,0.00014255899,0.0008432244,0.0014586211,0.004547174],"genre_scores_gemma":[0.9442793,0.0002418113,0.049780294,0.00007178395,0.000014619612,0.00010555615,0.0031379433,0.0004808265,0.001887911],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9934772,0.001583329,0.0003786372,0.000993887,0.0028832364,0.00068371085],"domain_scores_gemma":[0.94669443,0.032744583,0.0032330474,0.00686978,0.009507767,0.00095039094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063086553,0.0005311207,0.0005348351,0.003186778,0.0007671246,0.0017091305,0.0017760795,0.000984792,0.0019000337],"category_scores_gemma":[0.047186635,0.0005242202,0.0010896007,0.0032455917,0.0008207459,0.002013816,0.0010072821,0.0016730019,0.00032898455],"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.002319415,0.0015568008,0.19333051,0.0013230729,0.0009665423,0.002337951,0.0028696195,0.23745103,0.06821658,0.030641314,0.0061627533,0.45282447],"study_design_scores_gemma":[0.00011205407,0.0006234278,0.058685575,0.00012249287,0.0005716723,0.00077613705,0.0010441089,0.88200396,0.030786192,0.015346235,0.009856387,0.000071791656],"about_ca_topic_score_codex":0.007426823,"about_ca_topic_score_gemma":0.006660686,"teacher_disagreement_score":0.007426823,"about_ca_system_score_codex":0.001636603,"about_ca_system_score_gemma":0.0020707578,"threshold_uncertainty_score":0.03336376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056829577,0.0015863036,0.0025897352,0.0020409503,0.0038108502,0.00043567555,0.0060311765,0.0069316835,0.9760054],"genre_scores_gemma":[0.0019918976,0.001271997,0.0014657268,0.0011367992,0.0006753776,0.00012294443,0.0031572396,0.002404585,0.9877735],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855894,0.00011619541,0.00008003759,0.00018528652,0.00090108695,0.0001584498],"domain_scores_gemma":[0.9953276,0.00066858856,0.00020279345,0.0004950743,0.0022610864,0.0010448898],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00087766524,0.0016131067,0.001455045,0.0031978532,0.0018655724,0.0065706056,0.0018533962,0.0026589495,0.8836578],"category_scores_gemma":[0.0061175223,0.0008172359,0.0010695242,0.002421628,0.0007623258,0.0060139624,0.003406625,0.0030289434,0.8398832],"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.0000645557,0.000063803054,0.000057336696,0.00033547252,0.0000030824863,0.00007572372,0.000044873377,0.00005267265,0.0012159179,0.0016261651,0.9271799,0.06928046],"study_design_scores_gemma":[0.000011842935,0.000024471663,0.00014969624,0.00006422925,0.000002496869,0.0000736392,0.000032585773,0.000029013383,0.0004917921,0.00036711732,0.99874544,0.0000076260344],"about_ca_topic_score_codex":0.0019496842,"about_ca_topic_score_gemma":0.0037719682,"teacher_disagreement_score":0.11634219,"about_ca_system_score_codex":0.0013338539,"about_ca_system_score_gemma":0.0018777399,"threshold_uncertainty_score":0.16594791},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015510709,0.031929888,0.06463508,0.08319087,0.081931345,0.00033778002,0.003991289,0.0032736496,0.7151994],"genre_scores_gemma":[0.046786714,0.00717187,0.01686184,0.0068382337,0.0052551674,0.00013147005,0.0025880462,0.0014766732,0.9128901],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854124,0.00027539514,0.000065338885,0.0003692758,0.0005524645,0.00019626928],"domain_scores_gemma":[0.998343,0.00038061867,0.00006360103,0.00023328586,0.0007258158,0.0002537092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015326316,0.00060554565,0.00067766005,0.001753489,0.0030183066,0.007306111,0.0012246945,0.0019623262,0.1001109],"category_scores_gemma":[0.004090144,0.0003276024,0.0007707598,0.0018035175,0.0012482028,0.004925251,0.0035775192,0.0033359334,0.031356826],"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.0002928037,0.000090264715,0.00087052496,0.00032895763,0.000022506409,0.0003781359,0.0013492884,0.00052284973,0.0027801888,0.122395344,0.6559144,0.21505478],"study_design_scores_gemma":[0.000005701367,0.000019272804,0.00034046514,0.000095075826,0.0000052484907,0.000108478256,0.0003169185,0.0004620403,0.0011998189,0.009783157,0.98765415,0.000009575642],"about_ca_topic_score_codex":0.006000068,"about_ca_topic_score_gemma":0.0137415975,"teacher_disagreement_score":0.1001109,"about_ca_system_score_codex":0.002977223,"about_ca_system_score_gemma":0.0021870648,"threshold_uncertainty_score":0.3349043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007731267,0.00004294538,0.000052868676,0.000048459253,0.000014146172,0.0000073651736,0.9986436,0.00040428998,0.0007090078],"genre_scores_gemma":[0.00020482666,0.000036589085,0.0001879104,0.000039696817,0.0000036501206,0.000043341443,0.9989961,0.00008472072,0.00040321876],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909747,0.00012487573,0.000113630726,0.00029341475,0.00022273311,0.00014795244],"domain_scores_gemma":[0.9980444,0.00051560695,0.0001807347,0.0005353307,0.00048246776,0.00024149918],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00088095287,0.0018938405,0.0014626302,0.0046399822,0.000901165,0.0024226292,0.0029629485,0.00208772,0.1149603],"category_scores_gemma":[0.0055598635,0.0006974908,0.0010771655,0.009172282,0.0004319925,0.0020000346,0.0021889035,0.001997094,0.16201079],"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.00003124514,0.000015949161,0.0004022842,0.0004796851,0.000014802858,0.000014548033,0.00001790374,0.00017312146,0.00009418619,0.0004813835,0.9967296,0.0015452355],"study_design_scores_gemma":[0.00010639356,0.0000099556555,0.0018789836,0.00017570816,0.00001450245,0.000044888275,0.00006807188,0.00031095676,0.0002081661,0.0010542034,0.9961133,0.000014796556],"about_ca_topic_score_codex":0.015411016,"about_ca_topic_score_gemma":0.027347645,"teacher_disagreement_score":0.8850397,"about_ca_system_score_codex":0.0016229731,"about_ca_system_score_gemma":0.0021702358,"threshold_uncertainty_score":0.3845805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063724285,0.0000392409,0.000062917155,0.000046885634,0.000012390174,0.0000071545496,0.99848586,0.00050070765,0.00078112143],"genre_scores_gemma":[0.00019709593,0.000036213565,0.00023204513,0.000047094345,0.0000031071243,0.000043977037,0.9989071,0.00012270933,0.00041064766],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989868,0.00014403994,0.00012805924,0.00034366277,0.00023849965,0.00015897733],"domain_scores_gemma":[0.99784255,0.00061574293,0.00018225906,0.0005978884,0.0005107576,0.0002508164],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001053487,0.00208613,0.0015408259,0.004640099,0.0010043331,0.0026129358,0.0032542588,0.0022085588,0.12689023],"category_scores_gemma":[0.0060726358,0.0008284343,0.0011623784,0.009172335,0.0004950367,0.0021594781,0.0023877034,0.0020878222,0.18374309],"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.000030574978,0.000014386744,0.00037860993,0.000520872,0.000015068611,0.00001633176,0.00002048688,0.00016562965,0.00010056261,0.00047786575,0.9968322,0.0014275583],"study_design_scores_gemma":[0.000096290256,0.000009055606,0.001631443,0.00018047022,0.000014500906,0.000048111964,0.00007145238,0.0002594133,0.00021739923,0.0011038664,0.9963511,0.000016738244],"about_ca_topic_score_codex":0.0187901,"about_ca_topic_score_gemma":0.033609238,"teacher_disagreement_score":0.87310976,"about_ca_system_score_codex":0.0017049344,"about_ca_system_score_gemma":0.0022887178,"threshold_uncertainty_score":0.4244901},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2495191,0.24543308,0.04423806,0.34515932,0.010865498,0.0008447009,0.0029925117,0.00047053007,0.1004772],"genre_scores_gemma":[0.72215635,0.165638,0.034853097,0.027841114,0.0031444202,0.0011756654,0.002344033,0.00027252227,0.042574808],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9917732,0.0034406707,0.0009114488,0.00085398514,0.0024355059,0.0005851999],"domain_scores_gemma":[0.9752,0.008746505,0.0034687743,0.00083026313,0.009307384,0.0024470668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015026833,0.0004708657,0.0004137795,0.0018546865,0.0021726019,0.0047489824,0.0009893252,0.0016686877,0.0069413595],"category_scores_gemma":[0.028911136,0.00040965437,0.00060166616,0.0029536253,0.003530024,0.005770338,0.0033217159,0.004692801,0.0014524098],"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.00051384215,0.00032312938,0.07015153,0.0052844286,0.00010445173,0.0006430615,0.08022273,0.0010672929,0.0030392373,0.1684618,0.09286853,0.57732],"study_design_scores_gemma":[0.000022086193,0.000502935,0.07679145,0.006298117,0.00006038689,0.0010314343,0.032141156,0.0005668494,0.0020688795,0.019722722,0.8606939,0.00010019093],"about_ca_topic_score_codex":0.01731707,"about_ca_topic_score_gemma":0.019461757,"teacher_disagreement_score":0.01731707,"about_ca_system_score_codex":0.010548618,"about_ca_system_score_gemma":0.017042818,"threshold_uncertainty_score":0.079470456},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016066505,0.016029147,0.013819535,0.058266412,0.013544307,0.002267128,0.3764691,0.0049479282,0.5130497],"genre_scores_gemma":[0.0250352,0.02807512,0.041046184,0.05376927,0.015395196,0.0030883723,0.47392565,0.0044461,0.35521892],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981187,0.000375677,0.00032616805,0.00014174548,0.0008764002,0.00016131329],"domain_scores_gemma":[0.9709645,0.010498012,0.0017288235,0.0008080824,0.014237021,0.0017636252],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017427308,0.0008585982,0.0011617884,0.004678326,0.00096068735,0.0020354968,0.0016503361,0.0023441436,0.6158857],"category_scores_gemma":[0.02837117,0.00052552996,0.00083365,0.0049049654,0.0005819155,0.0015794903,0.0011517534,0.0020479816,0.20186087],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017779712,0.000012523783,0.0001450112,0.00019761716,0.0000028455377,0.000026312293,0.000008960875,0.000039143113,0.000019664325,0.00046639278,0.98671174,0.012351916],"study_design_scores_gemma":[0.0000671885,0.000025477791,0.0029241147,0.0015094393,0.000019108316,0.0008446726,0.000071590985,0.00021694528,0.0001094739,0.003955129,0.9902282,0.000028812468],"about_ca_topic_score_codex":0.028363964,"about_ca_topic_score_gemma":0.050785013,"teacher_disagreement_score":0.99750966,"about_ca_system_score_codex":0.0024903137,"about_ca_system_score_gemma":0.005590959,"threshold_uncertainty_score":0.54789245},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034034231,0.027663186,0.13064185,0.028786177,0.0030145845,0.0009477013,0.018279593,0.006623392,0.78064007],"genre_scores_gemma":[0.034222424,0.06770341,0.17626722,0.0036497742,0.0026051034,0.001436188,0.046398345,0.0035000227,0.6642175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983499,0.00027119537,0.0001547292,0.00014545239,0.00091818086,0.00016050565],"domain_scores_gemma":[0.99785304,0.000498428,0.00017510675,0.00031846593,0.0009929418,0.000162065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022800365,0.0010041862,0.0004685232,0.0043999436,0.0012922433,0.0075470344,0.0018796525,0.0013382152,0.056592997],"category_scores_gemma":[0.004705149,0.0008111688,0.0004943058,0.00960962,0.00068851915,0.0057897,0.0022567948,0.0018901917,0.03135671],"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.00000902562,0.000060317507,0.0006504259,0.00017970818,0.000007301311,0.00009084596,0.0002939223,0.0020343827,0.00020595492,0.06500901,0.7344377,0.19702138],"study_design_scores_gemma":[8.5264713e-7,0.0000033625863,0.00030176918,0.00006916006,0.0000015850488,0.00007131128,0.000095477204,0.0004951438,0.00012408628,0.0048781545,0.99395424,0.000004788401],"about_ca_topic_score_codex":0.020544102,"about_ca_topic_score_gemma":0.02492337,"teacher_disagreement_score":0.056592997,"about_ca_system_score_codex":0.003571023,"about_ca_system_score_gemma":0.0037808623,"threshold_uncertainty_score":0.18932247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015590772,0.00045670234,0.000145922,0.0005458385,0.0005021487,0.00024236206,0.98145366,0.00009626347,0.014998062],"genre_scores_gemma":[0.007536451,0.0012014507,0.0004327923,0.0007802652,0.00021718655,0.0015209923,0.94292843,0.00007744224,0.045305017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986557,0.00017424054,0.00023728031,0.00022822028,0.00049872,0.00020590103],"domain_scores_gemma":[0.9973283,0.00024962073,0.00021915401,0.00013836786,0.0018702301,0.00019429436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014163784,0.0007943571,0.000840627,0.0024459893,0.00064446364,0.001521431,0.0011857417,0.0009271627,0.061532106],"category_scores_gemma":[0.0061115297,0.0004798577,0.00049415557,0.0055754213,0.00015243673,0.0011815142,0.0009056911,0.0013423209,0.089236565],"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.00010944325,0.000045479166,0.009619624,0.0003785724,0.000020064004,0.00002315437,0.000054659537,0.00007156003,0.00005678594,0.00033036206,0.9748905,0.014399799],"study_design_scores_gemma":[0.00024498557,0.00009377174,0.27065295,0.00066379475,0.000036040554,0.00007609627,0.00042873796,0.00022358005,0.00011184585,0.00029084794,0.72714704,0.000030330786],"about_ca_topic_score_codex":0.09731751,"about_ca_topic_score_gemma":0.12068492,"teacher_disagreement_score":0.09731751,"about_ca_system_score_codex":0.0019709931,"about_ca_system_score_gemma":0.0029595515,"threshold_uncertainty_score":0.20584542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059257634,0.0014733064,0.0029143912,0.0011224734,0.0020866487,0.00018222851,0.016339315,0.011080808,0.96420825],"genre_scores_gemma":[0.0019819378,0.0010513803,0.0012707023,0.0004983969,0.00023488938,0.00007092608,0.010225612,0.004951236,0.97971493],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993339,0.0000370197,0.000028912502,0.00009739542,0.0004026931,0.00010002127],"domain_scores_gemma":[0.99869615,0.00016977797,0.000041292653,0.00024544698,0.00061960815,0.00022775205],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006021524,0.0014714825,0.001008102,0.0030525052,0.0015146638,0.0066462453,0.0018773495,0.0018427926,0.8816628],"category_scores_gemma":[0.0029832586,0.00076334213,0.00088370155,0.0029338482,0.0006449162,0.0053108446,0.003629411,0.0024667825,0.8634676],"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.000055801724,0.00003541795,0.000059428563,0.00023056849,0.0000038028422,0.000100781035,0.00005610219,0.00008304416,0.0010089439,0.0021619021,0.9045034,0.091700844],"study_design_scores_gemma":[0.0000062154886,0.000007606086,0.00013157834,0.00005176925,0.0000018076549,0.000087260814,0.00002761345,0.000029028619,0.00048669317,0.0005803034,0.99858403,0.000006123143],"about_ca_topic_score_codex":0.003330054,"about_ca_topic_score_gemma":0.0045746155,"teacher_disagreement_score":0.118337214,"about_ca_system_score_codex":0.001384302,"about_ca_system_score_gemma":0.0011227304,"threshold_uncertainty_score":0.16879368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002700766,0.00055233634,0.00050519616,0.00092622166,0.0014374033,0.0001551878,0.006040386,0.0052396497,0.98487353],"genre_scores_gemma":[0.0006994585,0.00027686727,0.00039275413,0.00052862085,0.00021121828,0.000046028857,0.0025683478,0.0009667378,0.9943099],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960643,0.000020792602,0.000014281895,0.00005701171,0.00024764144,0.000053911546],"domain_scores_gemma":[0.9982186,0.00015433278,0.00006049687,0.00018891421,0.0009199664,0.00045769353],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005329263,0.0009938456,0.0008208127,0.0021360433,0.0013295119,0.00447923,0.0017608511,0.0020912746,0.92676145],"category_scores_gemma":[0.0028457972,0.00056508335,0.0006479785,0.0015028021,0.00039335052,0.0025142662,0.0017246661,0.0017391068,0.90013254],"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.000020556909,0.000017254548,0.000019175257,0.00006107033,0.0000010409733,0.000022761129,0.000008102189,0.000016456965,0.0002612588,0.00043460348,0.9760483,0.023089387],"study_design_scores_gemma":[0.000008541421,0.000011848336,0.00018319317,0.00003891739,0.0000013149258,0.000036670022,0.000017829989,0.00002100383,0.00016196494,0.00015447213,0.99936,0.0000042376914],"about_ca_topic_score_codex":0.0069341613,"about_ca_topic_score_gemma":0.014162901,"teacher_disagreement_score":0.07323855,"about_ca_system_score_codex":0.0014820189,"about_ca_system_score_gemma":0.0012561746,"threshold_uncertainty_score":0.1044659},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008457092,0.00025982887,0.0024607645,0.0016617363,0.0011762333,0.0013765803,0.028276457,0.012362297,0.95158046],"genre_scores_gemma":[0.0030690501,0.00033633132,0.0019092793,0.0012891219,0.0003616018,0.00061306707,0.017626224,0.0026907083,0.97210467],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903667,0.0000914702,0.00005586648,0.000086763364,0.0005810483,0.00014823451],"domain_scores_gemma":[0.99601525,0.00058939465,0.00016346636,0.00042086403,0.0021913399,0.0006196087],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00108004,0.0010647409,0.0007041898,0.0020009761,0.0014843576,0.0021262143,0.0014512145,0.0013712803,0.9069333],"category_scores_gemma":[0.0060751466,0.00057924254,0.0004753828,0.0013334043,0.00032571953,0.0021658249,0.002040308,0.0014778472,0.8208878],"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.000012926665,0.000027759053,0.000048643073,0.00003521148,3.9261656e-7,0.000008358164,0.00001679092,0.000016727661,0.000072348346,0.0002550305,0.97849715,0.021008719],"study_design_scores_gemma":[0.00001837083,0.000028126207,0.0007861761,0.000056711695,8.831497e-7,0.000037207836,0.000052729698,0.000052530984,0.00009411531,0.00025846378,0.99860734,0.000007450315],"about_ca_topic_score_codex":0.00820783,"about_ca_topic_score_gemma":0.0117964335,"teacher_disagreement_score":0.09306669,"about_ca_system_score_codex":0.0009779306,"about_ca_system_score_gemma":0.0018524315,"threshold_uncertainty_score":0.13274825},"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":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8528623,0.00027157643,0.0007801365,0.00054204266,0.000056856283,0.00016384784,0.13535737,0.00014727454,0.009818565],"genre_scores_gemma":[0.8881059,0.00030556932,0.0029775607,0.00020503886,0.000041626106,0.00032895675,0.10382979,0.000044480796,0.0041611204],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99957937,0.00009454633,0.000039830877,0.00008489566,0.000121572404,0.0000797988],"domain_scores_gemma":[0.9985795,0.00016694183,0.00039795798,0.00012745011,0.00051367324,0.00021449578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005571441,0.00021569322,0.00014524093,0.0015705295,0.0004279783,0.00086094206,0.00030042382,0.00031197953,0.0029599438],"category_scores_gemma":[0.0018021642,0.00011673363,0.00018772027,0.0015472244,0.00016379173,0.00060426234,0.0012412907,0.00036085004,0.0010968188],"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.0001821172,0.00007697889,0.94845456,0.00015668075,0.000042369473,0.00016577012,0.0019841364,0.000947268,0.00089811947,0.0004303571,0.025020089,0.021641573],"study_design_scores_gemma":[0.0000058754845,0.00008882956,0.9716225,0.00010310229,0.000012757133,0.00008973158,0.0074151047,0.0016243658,0.0005459338,0.00006601989,0.018407192,0.000018622033],"about_ca_topic_score_codex":0.08326056,"about_ca_topic_score_gemma":0.12919009,"teacher_disagreement_score":0.08326056,"about_ca_system_score_codex":0.0007898979,"about_ca_system_score_gemma":0.000640123,"threshold_uncertainty_score":0.1655519},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02498758,0.09090716,0.048815846,0.0066021616,0.015202905,0.00065726327,0.013597832,0.0030819313,0.79614735],"genre_scores_gemma":[0.27568984,0.11914472,0.07759909,0.0067287292,0.008211909,0.0012595155,0.026616156,0.0019531904,0.48279685],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998636,0.000027017832,0.00001565282,0.000045077435,0.00003492335,0.0000137090865],"domain_scores_gemma":[0.9998869,0.000029540362,0.000017582723,0.00002088976,0.00003095694,0.00001401988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018188574,0.0008256009,0.00033603117,0.0023848417,0.0009226552,0.0008870249,0.0007266053,0.000624957,0.041638143],"category_scores_gemma":[0.0007326824,0.00021095284,0.00029945554,0.0019770449,0.0014452987,0.0015928904,0.0009064357,0.0013547622,0.014534786],"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.00009355541,0.000022876899,0.0015468572,0.0018783044,0.000042467538,0.0009233174,0.00074561185,0.00044375207,0.0022599683,0.030380117,0.302441,0.6592222],"study_design_scores_gemma":[0.000003841553,0.000010258629,0.0031709638,0.00015104431,0.000013612696,0.0015472485,0.00010000859,0.000095932366,0.0001557231,0.0020015133,0.99274445,0.0000055625455],"about_ca_topic_score_codex":0.003272091,"about_ca_topic_score_gemma":0.005072234,"teacher_disagreement_score":0.041638143,"about_ca_system_score_codex":0.00056678033,"about_ca_system_score_gemma":0.00042029706,"threshold_uncertainty_score":0.13929343},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14669956,0.014854068,0.099265896,0.059496675,0.0045019244,0.0004840145,0.000118416305,0.0009051632,0.6736743],"genre_scores_gemma":[0.6526783,0.011143647,0.043589372,0.0057572313,0.00081553234,0.0005975411,0.00015722307,0.0005477361,0.28471342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99557674,0.0021925655,0.00014086821,0.00049291714,0.0010174384,0.00057948893],"domain_scores_gemma":[0.99615246,0.0015433013,0.00019495717,0.0003011015,0.0007315864,0.0010765465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044139256,0.0007786434,0.0003812087,0.0013872861,0.0073481216,0.008717748,0.0014656933,0.0034621863,0.014631514],"category_scores_gemma":[0.0058416585,0.00046632462,0.0007633072,0.0007507077,0.010104486,0.0070947353,0.009135572,0.0059746467,0.0031090232],"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.000079782374,0.00016478005,0.0040259887,0.0008012615,0.000022493976,0.00090504094,0.37743345,0.00040997405,0.005785019,0.4585316,0.024446165,0.1273945],"study_design_scores_gemma":[0.000017085025,0.00014904533,0.00528309,0.0013383904,0.000028068074,0.0008701106,0.09563955,0.0006201853,0.0021983306,0.03237802,0.8614015,0.00007662689],"about_ca_topic_score_codex":0.009759732,"about_ca_topic_score_gemma":0.021049423,"teacher_disagreement_score":0.014631514,"about_ca_system_score_codex":0.004329419,"about_ca_system_score_gemma":0.010494007,"threshold_uncertainty_score":0.048947275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17000104,0.036433406,0.012067625,0.0017314394,0.0019426389,0.00079080794,0.030617924,0.0023670928,0.744048],"genre_scores_gemma":[0.6652753,0.016318409,0.01782307,0.0003962881,0.000185235,0.00019935683,0.020156542,0.00032054645,0.27932516],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999225,0.0000046458395,0.000004200201,0.00002306061,0.000030257894,0.000015375688],"domain_scores_gemma":[0.9998945,0.000010612919,0.000017194743,0.000007356642,0.00005512007,0.000015297886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006785555,0.00050219405,0.0001841052,0.0025146848,0.0014307329,0.0004857021,0.0005116791,0.00024110058,0.025477538],"category_scores_gemma":[0.00024928316,0.00015341662,0.00014169764,0.0025872188,0.00089003716,0.00043066446,0.00044326726,0.00033040743,0.004621415],"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.0004323037,0.000034196262,0.046227,0.0030087375,0.00006806929,0.0032563729,0.002802842,0.0014458621,0.025150962,0.0058909873,0.15800637,0.75367624],"study_design_scores_gemma":[0.000013062096,0.000037001668,0.18990573,0.00058139116,0.000045719724,0.0029230728,0.0017385759,0.00032950053,0.0025011308,0.0009147862,0.8009904,0.000019652634],"about_ca_topic_score_codex":0.28912812,"about_ca_topic_score_gemma":0.61379486,"teacher_disagreement_score":0.7108719,"about_ca_system_score_codex":0.0013726654,"about_ca_system_score_gemma":0.0013757509,"threshold_uncertainty_score":0.57489043},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03778128,0.0060949223,0.07195259,0.019455958,0.03604492,0.00054246106,0.7161447,0.010388364,0.10159485],"genre_scores_gemma":[0.24215241,0.0066704825,0.04006793,0.006696079,0.0012624094,0.0019163868,0.60280555,0.0045806044,0.093848184],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99271107,0.000284884,0.00032979497,0.0008458918,0.0045099277,0.0013184543],"domain_scores_gemma":[0.99313027,0.0026277234,0.0005302776,0.0010151241,0.0021903084,0.00050627923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032543098,0.0021805863,0.002972526,0.0017562873,0.0027826102,0.0018585798,0.0043953424,0.004510043,0.2895685],"category_scores_gemma":[0.011627255,0.0012524674,0.0015717257,0.005774602,0.0015857319,0.0030157808,0.0022886742,0.0048038308,0.0400702],"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.0019220925,0.0003763036,0.0010615259,0.0030253588,0.0002913231,0.0005023013,0.00024711282,0.002245982,0.06584119,0.009878374,0.8876444,0.026964048],"study_design_scores_gemma":[0.0007033662,0.0006300931,0.006752834,0.00019021839,0.00015991526,0.0007417806,0.0002684459,0.0064897407,0.22589149,0.008217074,0.7496423,0.00031277328],"about_ca_topic_score_codex":0.01259285,"about_ca_topic_score_gemma":0.018299328,"teacher_disagreement_score":0.2895685,"about_ca_system_score_codex":0.0024645398,"about_ca_system_score_gemma":0.0031836305,"threshold_uncertainty_score":0.96870315},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018320893,0.0001534463,0.04592096,0.00036705317,0.00047439206,0.00011194576,0.015259682,0.91342735,0.02410195],"genre_scores_gemma":[0.0035840906,0.00021665539,0.014988258,0.0009300384,0.00016189301,0.0004382346,0.027397038,0.9124323,0.03985149],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99531364,0.00084151106,0.00037470335,0.00092675217,0.0019190796,0.00062429666],"domain_scores_gemma":[0.99136,0.0018158533,0.00028855758,0.0035088568,0.0023610194,0.0006657307],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0055660647,0.0046561197,0.0028374472,0.002347267,0.0018868409,0.009259041,0.00914653,0.004653027,0.5506396],"category_scores_gemma":[0.028368462,0.006789485,0.0052278917,0.0017110117,0.0018799468,0.012064403,0.012398407,0.008627783,0.70261955],"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.00016971478,0.000029093842,0.00025020223,0.00037828388,0.000029726687,0.00005578562,0.00013840439,0.0004775619,0.00058991695,0.0063435533,0.9689934,0.02254431],"study_design_scores_gemma":[0.00006690269,0.000023515197,0.000342275,0.00020115485,0.000020710353,0.00012216621,0.00003730378,0.0016439582,0.0034500093,0.0079666255,0.98599327,0.00013220406],"about_ca_topic_score_codex":0.008093742,"about_ca_topic_score_gemma":0.004533344,"teacher_disagreement_score":0.5506396,"about_ca_system_score_codex":0.003788055,"about_ca_system_score_gemma":0.0027160393,"threshold_uncertainty_score":0.640958},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07103126,0.009350502,0.014156716,0.46106413,0.0047517386,0.0004691222,0.0043363427,0.0017943984,0.4330458],"genre_scores_gemma":[0.46672323,0.009304231,0.016434819,0.033193838,0.0016064425,0.000486516,0.0024160768,0.0019812207,0.46785364],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9905956,0.002298568,0.00022595472,0.00092124526,0.0049084867,0.0010502615],"domain_scores_gemma":[0.9772584,0.0067076935,0.0007789156,0.0024796145,0.006774065,0.006001441],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007776985,0.0003678702,0.00044113578,0.0016021972,0.02542313,0.013671675,0.002114868,0.0018978891,0.01818202],"category_scores_gemma":[0.020698668,0.000500914,0.00025477094,0.0049271537,0.015017182,0.0077008596,0.007277724,0.004243934,0.0032788415],"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.0001404433,0.00004779692,0.0032982407,0.00017391857,0.000009956695,0.0008134079,0.12227974,0.00033431573,0.0018198139,0.05053364,0.7400872,0.08046158],"study_design_scores_gemma":[0.0000030308383,0.0000043030705,0.0006241523,0.000027540767,0.0000010826469,0.00004154853,0.009506187,0.000067263034,0.0001761348,0.0011248904,0.9884095,0.000014276644],"about_ca_topic_score_codex":0.7224292,"about_ca_topic_score_gemma":0.86173505,"teacher_disagreement_score":0.9863283,"about_ca_system_score_codex":0.063779496,"about_ca_system_score_gemma":0.04583484,"threshold_uncertainty_score":0.5584109},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91929555,0.0013872265,0.012143244,0.00037918607,0.00008067818,0.00019365616,0.003462544,0.00064559444,0.06241238],"genre_scores_gemma":[0.9706188,0.00037906857,0.016327607,0.00018817242,0.00002113563,0.00007229581,0.001734139,0.000071047194,0.010587723],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99994135,0.000006272214,0.000003699142,0.00002919568,0.000009391548,0.000010077218],"domain_scores_gemma":[0.999879,0.000033604905,0.000026666574,0.000018843111,0.000019394907,0.000022418875],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000069987196,0.00025158608,0.00020337188,0.001157708,0.00069491414,0.00027427103,0.0002642401,0.00032621645,0.005904499],"category_scores_gemma":[0.00021619232,0.00011490883,0.0001647739,0.00055082183,0.00036362855,0.00023564664,0.00044507012,0.00029021758,0.0013120145],"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.00040281538,0.00007269436,0.05801528,0.0008179989,0.000040904506,0.0069649457,0.003903785,0.00021518754,0.75858986,0.003958849,0.002286673,0.16473113],"study_design_scores_gemma":[0.000040532395,0.00019379496,0.6345037,0.00022879573,0.00014158439,0.03200301,0.003333214,0.0008481027,0.038107377,0.0020213628,0.28852263,0.000055931127],"about_ca_topic_score_codex":0.00321432,"about_ca_topic_score_gemma":0.0103757875,"teacher_disagreement_score":0.9940955,"about_ca_system_score_codex":0.00018080021,"about_ca_system_score_gemma":0.00017286124,"threshold_uncertainty_score":0.019752502},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007023376,0.00034175365,0.00015458591,0.0010672411,0.00042988305,0.00008183901,0.0015876993,0.000568395,0.99506617],"genre_scores_gemma":[0.0007575632,0.00006643767,0.000049320617,0.00027525338,0.000012826676,0.000011074762,0.0002556514,0.00010476743,0.998467],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993679,0.000035375273,0.000012106282,0.00013567506,0.00023382598,0.0002150721],"domain_scores_gemma":[0.9985078,0.0000792026,0.000036252983,0.00008607328,0.0005929397,0.00069773075],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039355626,0.0011902868,0.00077897584,0.0007002422,0.005256931,0.0029622952,0.0016771571,0.0026965006,0.9463014],"category_scores_gemma":[0.0010254699,0.00071520044,0.0006175646,0.00087599095,0.0006880996,0.0011867032,0.002331798,0.0019871756,0.8087273],"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.000060729093,0.000039757666,0.00039583124,0.000058355163,0.000003800737,0.00009886943,0.00004866424,0.000054164506,0.00035111676,0.0005753508,0.96863425,0.029679118],"study_design_scores_gemma":[0.000020580663,0.00002016457,0.0021036498,0.000085373824,0.000004506474,0.000047606314,0.0002285454,0.00008087318,0.00012203301,0.0000732204,0.9972012,0.00001216089],"about_ca_topic_score_codex":0.5691716,"about_ca_topic_score_gemma":0.861558,"teacher_disagreement_score":0.5691716,"about_ca_system_score_codex":0.0073944977,"about_ca_system_score_gemma":0.008131736,"threshold_uncertainty_score":0.8667313},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7825941,0.0049685077,0.0028016134,0.0006522537,0.0004677217,0.0003103982,0.0024903726,0.0002878475,0.20542723],"genre_scores_gemma":[0.9732555,0.0015003575,0.0020372504,0.00029530778,0.00009460547,0.00007488599,0.0012546948,0.00001718553,0.0214702],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999448,0.0000056142626,0.0000047552567,0.000020885152,0.000015899668,0.000008080283],"domain_scores_gemma":[0.99993515,0.000010164136,0.000028254535,0.00000549011,0.000011784894,0.00000917868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051963314,0.00047689237,0.00019010765,0.0009377871,0.00082481885,0.00019845783,0.0002441725,0.00031349895,0.0077608847],"category_scores_gemma":[0.00014240999,0.00015246173,0.000095020034,0.0005000093,0.0003520175,0.0005185903,0.00048150145,0.0003494764,0.0022747316],"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.0017903628,0.00027587128,0.07120704,0.00076005445,0.00008924242,0.012660033,0.004227427,0.00072022475,0.19404018,0.0048021143,0.02518318,0.6842443],"study_design_scores_gemma":[0.0001271025,0.00079657213,0.7147288,0.00026390757,0.00009091926,0.020704465,0.003229965,0.00032250248,0.0070448685,0.001112372,0.25153735,0.000041252493],"about_ca_topic_score_codex":0.0040305173,"about_ca_topic_score_gemma":0.009893887,"teacher_disagreement_score":0.0077608847,"about_ca_system_score_codex":0.0003085548,"about_ca_system_score_gemma":0.00010862893,"threshold_uncertainty_score":0.02596271},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6265934,0.023988832,0.010928012,0.0021054444,0.00080684107,0.0005838977,0.0036486546,0.001337109,0.3300078],"genre_scores_gemma":[0.9616771,0.004098086,0.0044405805,0.0008122569,0.00022846894,0.00021391864,0.0015923312,0.000043091906,0.026894258],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99989724,0.000015000737,0.000007811569,0.000035404373,0.000026759128,0.000017770937],"domain_scores_gemma":[0.99990284,0.000012427118,0.000047747904,0.000011265942,0.000013646059,0.00001208733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008516837,0.0004406483,0.00024039912,0.001248742,0.001025207,0.00037129232,0.00036387754,0.0003784618,0.008605807],"category_scores_gemma":[0.00037829115,0.00017393046,0.00012610163,0.00038607058,0.00061559887,0.0010819482,0.00114987,0.0005681945,0.0018205981],"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.0010434138,0.00017375185,0.029008867,0.0013842755,0.00008482578,0.0062799645,0.0028364859,0.0009889556,0.12598118,0.013600682,0.03077834,0.7878393],"study_design_scores_gemma":[0.00020701943,0.00079823495,0.33942255,0.0011527748,0.00022409747,0.021252956,0.0023199178,0.0012608498,0.013350788,0.0037808595,0.6161666,0.00006339487],"about_ca_topic_score_codex":0.0019049123,"about_ca_topic_score_gemma":0.0023283716,"teacher_disagreement_score":0.008605807,"about_ca_system_score_codex":0.0007144102,"about_ca_system_score_gemma":0.00027622134,"threshold_uncertainty_score":0.028789282},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86134535,0.001513893,0.0011362056,0.00014980567,0.00011756363,0.00016296771,0.006488859,0.0001551859,0.12893014],"genre_scores_gemma":[0.97774,0.00085885625,0.0015705717,0.00019475096,0.000029171872,0.00007175229,0.003296505,0.000016577653,0.01622191],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999702,0.0000018647543,0.0000020267696,0.000011695713,0.000007985417,0.000006196825],"domain_scores_gemma":[0.9999558,0.0000029903647,0.000013560096,0.000003900703,0.000011553753,0.000012155133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000025004523,0.0003162713,0.00010109725,0.0006321513,0.0004012417,0.00013362653,0.00013001186,0.000115041046,0.013412907],"category_scores_gemma":[0.00009176364,0.00008740776,0.000094476214,0.00029172085,0.00010652116,0.00015928494,0.00030622323,0.0001243715,0.002594273],"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.0015471684,0.000121933364,0.28881156,0.0017105719,0.00013641464,0.0023262813,0.001252495,0.0009828517,0.32112476,0.0016277235,0.014198239,0.36615998],"study_design_scores_gemma":[0.000028175175,0.0002615586,0.915638,0.0001172388,0.000031787145,0.002638252,0.0007166996,0.00049207197,0.005810294,0.0002057095,0.074044146,0.000016027327],"about_ca_topic_score_codex":0.010129044,"about_ca_topic_score_gemma":0.021511795,"teacher_disagreement_score":0.013412907,"about_ca_system_score_codex":0.00035676616,"about_ca_system_score_gemma":0.0002678245,"threshold_uncertainty_score":0.044870615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53392506,0.011375353,0.0070328237,0.0059982585,0.0011216626,0.0008825832,0.071737945,0.0007998516,0.36712646],"genre_scores_gemma":[0.3370326,0.0038097575,0.0100962445,0.0006063359,0.0001731209,0.00027750948,0.009815615,0.00026928735,0.63791955],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921143,0.00011142276,0.000044121567,0.00031231678,0.00023366566,0.00008700311],"domain_scores_gemma":[0.99850637,0.00019954941,0.00020574365,0.00020462884,0.0005928071,0.00029095053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046919295,0.0003485609,0.00023132973,0.001627907,0.0019132603,0.0011184531,0.0007471207,0.0004922567,0.070666835],"category_scores_gemma":[0.001318217,0.00047925793,0.00013045856,0.0017335932,0.000763389,0.00061157864,0.0012486712,0.0004900659,0.012011814],"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.0009762767,0.00020472752,0.14680041,0.001769271,0.000099735225,0.01059222,0.028372606,0.00076270493,0.022297675,0.0053462884,0.33335614,0.44942194],"study_design_scores_gemma":[0.00001621784,0.00011423987,0.31605524,0.00035540928,0.000019524223,0.0014090722,0.008386357,0.00033188186,0.0035122596,0.0004283327,0.66933167,0.000039784805],"about_ca_topic_score_codex":0.086817995,"about_ca_topic_score_gemma":0.3343081,"teacher_disagreement_score":0.086817995,"about_ca_system_score_codex":0.0021119255,"about_ca_system_score_gemma":0.0017440002,"threshold_uncertainty_score":0.23640412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024154922,0.0011607395,0.00049260294,0.0028961867,0.0008614711,0.0000482561,0.0064268373,0.0023598098,0.98551244],"genre_scores_gemma":[0.0017004329,0.0007818937,0.00032634486,0.0004962228,0.00021778226,0.00001963842,0.0028955047,0.0010567324,0.9925054],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984397,0.000076051496,0.000044067983,0.00026951186,0.0010108068,0.0001597603],"domain_scores_gemma":[0.99609995,0.00039215662,0.00014211488,0.00052654697,0.0017584293,0.0010807101],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008959831,0.0013759964,0.0009543147,0.0033805624,0.0027287183,0.010074434,0.0014460606,0.002468469,0.8113437],"category_scores_gemma":[0.0045673363,0.0007379253,0.0006968759,0.004844757,0.0011782382,0.0056154258,0.0020091906,0.0019961635,0.72304654],"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.0000119399165,0.000006492499,0.000038193415,0.000051676918,0.0000011877798,0.000022854838,0.00002284257,0.00002702802,0.00007421795,0.0034083829,0.9784726,0.017862542],"study_design_scores_gemma":[0.0000033514318,0.0000021036506,0.00010927759,0.000019331346,0.0000010475761,0.000016319444,0.00002827551,0.00006067933,0.00006562595,0.00042843682,0.9992623,0.000003346692],"about_ca_topic_score_codex":0.082754456,"about_ca_topic_score_gemma":0.20908327,"teacher_disagreement_score":0.18865627,"about_ca_system_score_codex":0.006379032,"about_ca_system_score_gemma":0.00620929,"threshold_uncertainty_score":0.2690953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004696836,0.0017200642,0.00031055327,0.0013584986,0.003587483,0.00007968353,0.0024510797,0.0011933635,0.98882955],"genre_scores_gemma":[0.0013576739,0.0008856705,0.00031429628,0.0002794042,0.0004697901,0.000029381656,0.0009998189,0.00048856385,0.99517536],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937207,0.000057376947,0.000018183224,0.000101994214,0.00033641167,0.00011394881],"domain_scores_gemma":[0.9987159,0.00009980092,0.000033265595,0.000098899305,0.0008025545,0.00024972289],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007448132,0.0011562285,0.0009345877,0.001605845,0.002400711,0.0062733404,0.0012021053,0.0016999656,0.8510103],"category_scores_gemma":[0.001986107,0.00041542805,0.00067311,0.001374165,0.0005441393,0.002567361,0.0016357274,0.0024508552,0.6958366],"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.000042555035,0.00003678223,0.000070694485,0.00013559127,0.0000023273012,0.00005835068,0.000042748856,0.000036476325,0.00032039423,0.0038763469,0.9386709,0.05670682],"study_design_scores_gemma":[0.0000048475763,0.0000066552043,0.0001659725,0.00004956557,6.939631e-7,0.000022567168,0.000032538588,0.000011353048,0.00007917142,0.00014751429,0.9994759,0.0000032411867],"about_ca_topic_score_codex":0.019869652,"about_ca_topic_score_gemma":0.037865143,"teacher_disagreement_score":0.14898968,"about_ca_system_score_codex":0.0024640488,"about_ca_system_score_gemma":0.002406161,"threshold_uncertainty_score":0.2125156},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024753923,0.00059645734,0.3520974,0.0013460404,0.0011810182,0.0006888996,0.12853484,0.20346539,0.28733596],"genre_scores_gemma":[0.24545372,0.0006929399,0.29845402,0.001111988,0.0002581148,0.0020801972,0.17410329,0.13654481,0.14130096],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951184,0.00007913199,0.000023684082,0.00006261169,0.00022810922,0.0000946583],"domain_scores_gemma":[0.99932563,0.00014174172,0.00003977446,0.00017604498,0.00025193384,0.000064874715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088913616,0.0013437388,0.00072279334,0.0007105437,0.0007296945,0.0015170057,0.0038553304,0.0012951067,0.1096743],"category_scores_gemma":[0.0020718302,0.00085341156,0.00086493994,0.0011747915,0.0004998594,0.0020478657,0.0015077629,0.0022744213,0.032857966],"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.0006709364,0.00019459387,0.0020951345,0.00058826804,0.00009072736,0.00030029664,0.00020508216,0.11499013,0.004616088,0.07925121,0.74798894,0.049008504],"study_design_scores_gemma":[0.00040090803,0.000045947305,0.0006973866,0.00010270407,0.000021434238,0.00011854831,0.000047333593,0.47153738,0.015801948,0.015109499,0.49606892,0.000048062393],"about_ca_topic_score_codex":0.013762318,"about_ca_topic_score_gemma":0.0122273415,"teacher_disagreement_score":0.1096743,"about_ca_system_score_codex":0.0016328807,"about_ca_system_score_gemma":0.001691287,"threshold_uncertainty_score":0.3668971},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002817172,0.00014714363,0.9369473,0.00024308909,0.00049032486,0.00010059445,0.0020149853,0.013205526,0.044033896],"genre_scores_gemma":[0.2021256,0.00058596546,0.6969122,0.00033187817,0.0004227532,0.0007288557,0.013974652,0.014449477,0.07046858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990578,0.00023190625,0.000053162978,0.0001062887,0.00048746608,0.00006345783],"domain_scores_gemma":[0.999113,0.00034550272,0.000039776165,0.00027253275,0.00020215304,0.000027087606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095202844,0.0012910523,0.0006606174,0.0011058631,0.0004622406,0.0014863267,0.0012438595,0.000663815,0.060674187],"category_scores_gemma":[0.0027501448,0.0003778538,0.00080531236,0.00060626987,0.00073242583,0.00096357346,0.0014688504,0.00112199,0.015435576],"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.00031398484,0.00014752195,0.0002598741,0.0009774155,0.00007884768,0.00028147822,0.00021400188,0.08329207,0.03600377,0.41772866,0.123025455,0.33767697],"study_design_scores_gemma":[0.000250855,0.00017824215,0.00028309846,0.00017943415,0.000050786122,0.0002566731,0.000059926686,0.39222708,0.05941582,0.19933821,0.34769547,0.000064323474],"about_ca_topic_score_codex":0.0010467496,"about_ca_topic_score_gemma":0.0011106356,"teacher_disagreement_score":0.060674187,"about_ca_system_score_codex":0.0006543186,"about_ca_system_score_gemma":0.00095724966,"threshold_uncertainty_score":0.20297539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011984269,0.0006693838,0.000603024,0.0011401811,0.0014912474,0.00010360904,0.016253538,0.0048123347,0.9737283],"genre_scores_gemma":[0.0056226845,0.00050380325,0.0006746275,0.0004991723,0.0002527307,0.00006587488,0.011132519,0.0034835204,0.97776514],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979526,0.000022040847,0.0000067041524,0.000034512865,0.00008388455,0.00005763723],"domain_scores_gemma":[0.9993463,0.000060548176,0.000022966049,0.00009082876,0.00031008487,0.00016922293],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00030003395,0.00084505416,0.00029456313,0.0010140449,0.0023216312,0.0043018484,0.00077236816,0.0011922681,0.780881],"category_scores_gemma":[0.0012618995,0.0004529868,0.00032751934,0.001258938,0.0003161188,0.003208654,0.0022928917,0.0013321552,0.45960256],"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.000035814635,0.000008556687,0.00007476244,0.00006193168,0.0000016815504,0.00005034616,0.00015009058,0.0000186162,0.00025164968,0.0011333517,0.98202765,0.016185509],"study_design_scores_gemma":[0.0000063308516,0.0000044912754,0.00053107407,0.000049478134,0.000001100709,0.00004489484,0.00016385727,0.00004992077,0.00018291475,0.00014598918,0.9988133,0.0000067385326],"about_ca_topic_score_codex":0.036979444,"about_ca_topic_score_gemma":0.08644219,"teacher_disagreement_score":0.21911901,"about_ca_system_score_codex":0.0012963031,"about_ca_system_score_gemma":0.0008946881,"threshold_uncertainty_score":0.31254667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946473,0.00005580779,0.0001449203,0.00025430907,0.00003415277,0.00015766859,0.00036343388,0.000038773564,0.004303634],"genre_scores_gemma":[0.99336326,0.000114368755,0.0005214255,0.00007673392,0.000019960546,0.00017433682,0.00047671335,0.000024023253,0.005229165],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99851483,0.00045582617,0.000049189755,0.00015269952,0.00026367666,0.00056378456],"domain_scores_gemma":[0.9912883,0.0010077584,0.0007922764,0.00040889758,0.0014549447,0.005047772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040804744,0.00077872904,0.0004627125,0.0009625426,0.0027754533,0.0014212494,0.00071796274,0.00070406066,0.005626833],"category_scores_gemma":[0.008504762,0.00022237375,0.000553902,0.0007273586,0.00063891156,0.000543514,0.0027992094,0.0014563084,0.0012120024],"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.01318564,0.040888973,0.27015758,0.00094082847,0.0003266027,0.0022433328,0.06268234,0.0036472382,0.013532669,0.0010178555,0.03544414,0.5559328],"study_design_scores_gemma":[0.0003573824,0.014211006,0.90023357,0.0002583689,0.0001343897,0.00027395424,0.05160269,0.0009290265,0.011694903,0.0009237002,0.019179378,0.00020161281],"about_ca_topic_score_codex":0.008621965,"about_ca_topic_score_gemma":0.024059542,"teacher_disagreement_score":0.008621965,"about_ca_system_score_codex":0.0014912927,"about_ca_system_score_gemma":0.0026469233,"threshold_uncertainty_score":0.021579862},"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":"other","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006664579,0.00064600917,0.00061607634,0.001475198,0.0019870694,0.0000697484,0.0026673563,0.003158724,0.9887134],"genre_scores_gemma":[0.0019692215,0.00044441447,0.00033410886,0.0005297696,0.0003083717,0.000016087206,0.0012952695,0.0008454499,0.99425733],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992378,0.00003139626,0.000024981488,0.00014831274,0.0004930207,0.00006446937],"domain_scores_gemma":[0.99877685,0.0000964934,0.00003849617,0.00016913054,0.00059178576,0.000327342],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00032417985,0.0011835413,0.0006856472,0.001829313,0.0018937087,0.0061037987,0.0014094388,0.0022376229,0.89276904],"category_scores_gemma":[0.0019218515,0.0005429964,0.0008388766,0.0017141389,0.0005613383,0.004690734,0.0023916091,0.0019231123,0.82595867],"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.00005416059,0.00005367181,0.00015492937,0.00013269327,0.0000050448975,0.000106943226,0.00004143056,0.00006971409,0.00073247094,0.004239878,0.9137131,0.080696106],"study_design_scores_gemma":[0.0000074070267,0.000013572965,0.00022195412,0.00002912068,0.0000024012284,0.000078337536,0.00003567304,0.00004758808,0.00023757534,0.0005067005,0.99881375,0.0000058384953],"about_ca_topic_score_codex":0.0054348633,"about_ca_topic_score_gemma":0.00934419,"teacher_disagreement_score":0.10723096,"about_ca_system_score_codex":0.001337887,"about_ca_system_score_gemma":0.0013839053,"threshold_uncertainty_score":0.15295196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7509575,0.0026375994,0.17443882,0.018359195,0.004845397,0.0007853123,0.004594796,0.008895691,0.034485664],"genre_scores_gemma":[0.93720037,0.0003969381,0.048171144,0.000650544,0.00062505255,0.00026151762,0.0018000113,0.0003539512,0.010540351],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98744106,0.00543934,0.0011928243,0.0016314714,0.00343516,0.0008602052],"domain_scores_gemma":[0.94735396,0.023251345,0.0066707577,0.003872468,0.013570126,0.0052813934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008114774,0.0005647698,0.00086436066,0.003511959,0.0010781063,0.005350877,0.0010919861,0.0013761714,0.005252736],"category_scores_gemma":[0.07428597,0.00033455342,0.0005476862,0.0025200057,0.0009959185,0.003673378,0.0021754785,0.002047697,0.004074783],"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.0012830448,0.0008934122,0.28037986,0.0005004209,0.00025181627,0.0003996661,0.0017891971,0.0073962333,0.008277386,0.014730319,0.056854494,0.62724406],"study_design_scores_gemma":[0.00028656542,0.0013198961,0.2402745,0.0005809664,0.00035026652,0.0012365803,0.00825022,0.4216333,0.037967317,0.13509306,0.15249026,0.0005171314],"about_ca_topic_score_codex":0.002123746,"about_ca_topic_score_gemma":0.0023263355,"teacher_disagreement_score":0.008114774,"about_ca_system_score_codex":0.0006577511,"about_ca_system_score_gemma":0.001860635,"threshold_uncertainty_score":0.042915523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011265601,0.00020738403,0.00011426128,0.00009472168,0.000046580688,0.000014573829,0.99751955,0.0004943514,0.00038201117],"genre_scores_gemma":[0.0014455523,0.00006525738,0.00038121387,0.000060349874,0.000008436734,0.000050555853,0.99757344,0.00003820573,0.00037693718],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989305,0.00015026414,0.0001117205,0.00033624924,0.00028944755,0.00018178856],"domain_scores_gemma":[0.9987098,0.00036933937,0.00012545813,0.00034986378,0.0002952049,0.00015027965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010685917,0.0033592896,0.0021583522,0.0024897512,0.0010345663,0.0020052018,0.0037800167,0.004016051,0.024457606],"category_scores_gemma":[0.0039059082,0.0007416366,0.0024378528,0.004218816,0.00066302874,0.00082632457,0.0016854457,0.0019336904,0.0368271],"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.00037347752,0.00016719465,0.0032411036,0.0018650375,0.00020417382,0.000112074726,0.000048799968,0.002226929,0.0009442941,0.0005130803,0.9849043,0.005399489],"study_design_scores_gemma":[0.0021060877,0.00017571071,0.03070585,0.00065481703,0.00039810158,0.0005753201,0.00026283288,0.0060512563,0.0043913582,0.004610418,0.9498883,0.0001799009],"about_ca_topic_score_codex":0.031211346,"about_ca_topic_score_gemma":0.05303725,"teacher_disagreement_score":0.031211346,"about_ca_system_score_codex":0.0014010812,"about_ca_system_score_gemma":0.001990023,"threshold_uncertainty_score":0.08181882},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27112034,0.023837533,0.012907321,0.0023856922,0.0015723705,0.0005497345,0.0051480997,0.0008016444,0.6816773],"genre_scores_gemma":[0.9061019,0.009857126,0.0069534513,0.0009547155,0.0003273629,0.00017295027,0.0035122172,0.000062237275,0.07205805],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99987686,0.000010365711,0.000007929217,0.000032379186,0.00004743902,0.000024978735],"domain_scores_gemma":[0.9998691,0.00002608473,0.000032048254,0.000009531516,0.000042066655,0.00002108441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012637753,0.00044379663,0.00032415698,0.001137954,0.0019136746,0.000633608,0.00034672068,0.00033709852,0.01314533],"category_scores_gemma":[0.00042672417,0.00014227956,0.000116988485,0.0010072273,0.00061228493,0.001174965,0.0008623514,0.0007837027,0.0023178912],"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.0007003591,0.00023811756,0.023462955,0.0023123857,0.000046584508,0.0034839879,0.0020526615,0.0016428614,0.046599653,0.018234817,0.049717955,0.85150766],"study_design_scores_gemma":[0.000099668134,0.00017089442,0.11818679,0.0003710081,0.000047568214,0.0030467215,0.0008090064,0.00064661773,0.0047433316,0.003146959,0.8687112,0.000020272151],"about_ca_topic_score_codex":0.012094539,"about_ca_topic_score_gemma":0.013123224,"teacher_disagreement_score":0.01314533,"about_ca_system_score_codex":0.0009307168,"about_ca_system_score_gemma":0.00073577964,"threshold_uncertainty_score":0.043975472},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6645844,0.014755265,0.008402366,0.0004982909,0.0009735085,0.0007930835,0.011436763,0.0007817252,0.2977747],"genre_scores_gemma":[0.9353444,0.007455558,0.0056591486,0.0005253803,0.00027890233,0.00033959848,0.0066940263,0.00006299452,0.0436401],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9999174,0.000005199748,0.00001398604,0.000028205464,0.000025250925,0.000009936445],"domain_scores_gemma":[0.99988174,0.000013065505,0.00004984067,0.000010502334,0.00003144263,0.0000133627855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010278299,0.00057897647,0.00027842037,0.0015867264,0.0007746716,0.00022569204,0.00031803714,0.00032142707,0.01265263],"category_scores_gemma":[0.00021735762,0.00023522977,0.00018290716,0.0007022989,0.00048965967,0.00087462226,0.0006690023,0.00027474973,0.007105166],"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.0009971596,0.00016272643,0.1652548,0.0015251195,0.00024712298,0.0022519093,0.0031514685,0.0009304203,0.045324985,0.0024686693,0.050341308,0.7273442],"study_design_scores_gemma":[0.00007411672,0.00035474013,0.77435803,0.00058416935,0.0001862285,0.007963299,0.0016174944,0.00041990218,0.0022730902,0.00068769476,0.21144089,0.000040328236],"about_ca_topic_score_codex":0.0053109056,"about_ca_topic_score_gemma":0.014674123,"teacher_disagreement_score":0.01265263,"about_ca_system_score_codex":0.00025785295,"about_ca_system_score_gemma":0.00026103895,"threshold_uncertainty_score":0.042327285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026680361,0.00397306,0.096135706,0.0028271964,0.0021792923,0.0000463077,0.0008786096,0.0024384407,0.8888533],"genre_scores_gemma":[0.06723126,0.0038820668,0.0622005,0.0017045643,0.0012245559,0.00015277205,0.0009941953,0.002760469,0.8598496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969804,0.00005156418,0.000015158641,0.00006757936,0.0001350641,0.000032636824],"domain_scores_gemma":[0.9998492,0.00005486375,0.000007803726,0.000027212105,0.000052675277,0.000008313418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029620354,0.0011578033,0.0006105126,0.0010115159,0.0012792953,0.0033358685,0.0011121687,0.0006439108,0.11140853],"category_scores_gemma":[0.000958484,0.00039771042,0.0005439542,0.0015285085,0.0017730228,0.003524574,0.0010974584,0.0027699077,0.04884601],"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.000023753842,0.000012960775,0.00003299955,0.00014099406,0.000005496569,0.000019733554,0.000110457135,0.00038245227,0.00092815177,0.7615939,0.12183642,0.114912674],"study_design_scores_gemma":[0.000009736859,0.000009619256,0.00012999192,0.000077105935,0.0000072189673,0.00008398066,0.00003544379,0.0012629692,0.0021159027,0.36807612,0.62817156,0.000020347836],"about_ca_topic_score_codex":0.0021467928,"about_ca_topic_score_gemma":0.0036512585,"teacher_disagreement_score":0.11140853,"about_ca_system_score_codex":0.00144367,"about_ca_system_score_gemma":0.00068850996,"threshold_uncertainty_score":0.37269866},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015510709,0.031929888,0.06463508,0.08319087,0.081931345,0.00033778002,0.003991289,0.0032736496,0.7151994],"genre_scores_gemma":[0.046786714,0.00717187,0.01686184,0.0068382337,0.0052551674,0.00013147005,0.0025880462,0.0014766732,0.9128901],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854124,0.00027539514,0.000065338885,0.0003692758,0.0005524645,0.00019626928],"domain_scores_gemma":[0.998343,0.00038061867,0.00006360103,0.00023328586,0.0007258158,0.0002537092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015326316,0.00060554565,0.00067766005,0.001753489,0.0030183066,0.007306111,0.0012246945,0.0019623262,0.1001109],"category_scores_gemma":[0.004090144,0.0003276024,0.0007707598,0.0018035175,0.0012482028,0.004925251,0.0035775192,0.0033359334,0.031356826],"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.0002928037,0.000090264715,0.00087052496,0.00032895763,0.000022506409,0.0003781359,0.0013492884,0.00052284973,0.0027801888,0.122395344,0.6559144,0.21505478],"study_design_scores_gemma":[0.000005701367,0.000019272804,0.00034046514,0.000095075826,0.0000052484907,0.000108478256,0.0003169185,0.0004620403,0.0011998189,0.009783157,0.98765415,0.000009575642],"about_ca_topic_score_codex":0.006000068,"about_ca_topic_score_gemma":0.0137415975,"teacher_disagreement_score":0.1001109,"about_ca_system_score_codex":0.002977223,"about_ca_system_score_gemma":0.0021870648,"threshold_uncertainty_score":0.3349043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2683,0.0022439584,0.010360509,0.0027457515,0.0008363633,0.00062002835,0.6515705,0.0016533586,0.061669488],"genre_scores_gemma":[0.2930968,0.00056086003,0.017011687,0.00044191375,0.000210669,0.0032435753,0.6677541,0.00070619234,0.016974157],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971654,0.0010899741,0.0003158286,0.00048658537,0.00076549896,0.0001766455],"domain_scores_gemma":[0.98619604,0.008178365,0.00062664965,0.0018561466,0.0027931384,0.0003496478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017329999,0.00040686465,0.00047231367,0.00610143,0.0019721386,0.0023661251,0.0008045228,0.0012447082,0.026555315],"category_scores_gemma":[0.01905319,0.000241395,0.00034280177,0.008317415,0.0011227711,0.0015198331,0.003033689,0.0012284613,0.016588198],"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.00093360816,0.00034154038,0.01550826,0.0028642802,0.00006134198,0.0013375743,0.01952153,0.0016675157,0.0053068534,0.039562393,0.7380771,0.17481798],"study_design_scores_gemma":[0.000198436,0.00010240965,0.082088776,0.0008465129,0.000028734687,0.0013240781,0.01455954,0.004782691,0.0045970483,0.014390739,0.87696105,0.0001199791],"about_ca_topic_score_codex":0.0058395816,"about_ca_topic_score_gemma":0.007422374,"teacher_disagreement_score":0.026555315,"about_ca_system_score_codex":0.0013684416,"about_ca_system_score_gemma":0.001174834,"threshold_uncertainty_score":0.08883643},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014214466,0.00032868152,0.8870341,0.00031721528,0.00030983565,0.00013827297,0.0045082257,0.032911673,0.06023745],"genre_scores_gemma":[0.15044945,0.00040615146,0.7786063,0.0004616106,0.00011309729,0.0006297628,0.008292145,0.014454342,0.046587102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997861,0.000031906136,0.000012158797,0.000044280943,0.00009350828,0.000032083757],"domain_scores_gemma":[0.99975497,0.00008223546,0.000015230975,0.000046505287,0.00008134998,0.000019627287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042436586,0.0009480362,0.00070838386,0.0004938591,0.0005624134,0.0011927235,0.0024237263,0.0007856506,0.037226565],"category_scores_gemma":[0.0012491001,0.00051256386,0.00076465047,0.00062836794,0.00035060066,0.0018678727,0.0010982606,0.0014211553,0.007564834],"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.00045291294,0.0002537311,0.0022127603,0.00083491136,0.00018389398,0.00053730345,0.00027516467,0.3276554,0.022345683,0.2235381,0.16216019,0.25954998],"study_design_scores_gemma":[0.00017959817,0.000033931537,0.00030114173,0.00003444702,0.000025509826,0.00016766065,0.00003508421,0.84987533,0.013928796,0.033449877,0.10193541,0.000033256143],"about_ca_topic_score_codex":0.003498202,"about_ca_topic_score_gemma":0.004679887,"teacher_disagreement_score":0.037226565,"about_ca_system_score_codex":0.0006729054,"about_ca_system_score_gemma":0.0014583535,"threshold_uncertainty_score":0.12453526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009187523,0.008668101,0.0018429318,0.0076162047,0.0011978556,0.00026409756,0.9284794,0.0003808729,0.042363126],"genre_scores_gemma":[0.11495991,0.02058185,0.008399362,0.0069325613,0.0005249371,0.0009979747,0.76013494,0.0002514302,0.08721705],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981414,0.00011639288,0.000113096125,0.00020023504,0.00106257,0.00036631472],"domain_scores_gemma":[0.99272573,0.00015711176,0.00019320396,0.00009201476,0.006240276,0.0005915927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023821974,0.00081217656,0.0006181004,0.0035821402,0.0018525196,0.0025428026,0.0016581267,0.00072147755,0.010542248],"category_scores_gemma":[0.0053382963,0.0004048499,0.00096104766,0.008660784,0.0004625736,0.000669838,0.0011667056,0.0016620284,0.0028599873],"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.00016641928,0.000027017913,0.046325777,0.0011034331,0.00020209728,0.00007285048,0.0005144136,0.0012879081,0.00018855349,0.004765581,0.89306825,0.052277613],"study_design_scores_gemma":[0.00006741096,0.000038594302,0.3256595,0.0009251301,0.00014535752,0.00004976511,0.0009941539,0.0011015615,0.0003475081,0.0005179055,0.67007303,0.00008003364],"about_ca_topic_score_codex":0.99551576,"about_ca_topic_score_gemma":0.9946942,"teacher_disagreement_score":0.039671265,"about_ca_system_score_codex":0.039671265,"about_ca_system_score_gemma":0.0841359,"threshold_uncertainty_score":0.2878365},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016347496,0.000013131066,0.00021383548,0.00006225929,0.000016629612,0.000034534143,0.99848145,0.00022199225,0.00079260435],"genre_scores_gemma":[0.007929458,0.000113842056,0.0033448194,0.00050405104,0.0000728414,0.0008388514,0.97758955,0.0010606301,0.00854594],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993911,0.000083409184,0.00010833935,0.00016607367,0.00015259003,0.0000985014],"domain_scores_gemma":[0.9819344,0.013766014,0.0008142901,0.0009432688,0.0021119607,0.0004300583],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012166515,0.0011419284,0.0013801076,0.0022705616,0.0012067575,0.0017719571,0.0020716034,0.0013285935,0.8898504],"category_scores_gemma":[0.02220218,0.00069778436,0.00089935213,0.0039586397,0.000345026,0.0019174753,0.0010212935,0.0010705899,0.19214553],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043657282,0.00012248606,0.0029752424,0.0032135255,0.000050172155,0.00012816906,0.00010810296,0.0005264773,0.000351666,0.0009526115,0.9821968,0.008938091],"study_design_scores_gemma":[0.0069811624,0.00036364418,0.03941065,0.0037035362,0.00025341488,0.00088161626,0.0007660382,0.0024124964,0.00190191,0.019556329,0.92353624,0.0002329883],"about_ca_topic_score_codex":0.012835767,"about_ca_topic_score_gemma":0.020278133,"teacher_disagreement_score":0.8898504,"about_ca_system_score_codex":0.0013007201,"about_ca_system_score_gemma":0.0015844406,"threshold_uncertainty_score":0.15711498},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99935836,0.00004101115,0.000042040716,0.000011603436,0.0000010612949,0.0000020380119,0.00005028372,7.435436e-7,0.0004927974],"genre_scores_gemma":[0.99980384,0.00001533291,0.000024806868,0.000002799236,5.5346675e-7,0.0000017997322,0.000034975423,5.3993455e-7,0.0001153075],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995579,0.00010039944,0.000022868007,0.000101386446,0.00012067459,0.00009674159],"domain_scores_gemma":[0.9985045,0.0004579495,0.00046147613,0.000105678126,0.00020355039,0.00026686318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006923454,0.00016444255,0.00018712215,0.00088370277,0.0004477907,0.00064669247,0.0002641736,0.0001885652,0.0021875885],"category_scores_gemma":[0.0033213084,0.00009733365,0.00016314875,0.00047007954,0.0007963083,0.00024664827,0.0005828878,0.00023756325,0.00009504649],"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.000023005023,0.000017508577,0.9950192,0.0000055687556,0.000019657336,0.000046615056,0.002147003,0.000027229478,0.00048176333,0.00011730542,0.000028994256,0.0020661925],"study_design_scores_gemma":[2.82117e-7,0.000011079779,0.99880314,0.0000022127797,0.0000018915142,0.0000162117,0.0010301536,0.00002630538,0.000037249745,0.00002250235,0.00004780222,0.0000011861066],"about_ca_topic_score_codex":0.088449225,"about_ca_topic_score_gemma":0.2090984,"teacher_disagreement_score":0.088449225,"about_ca_system_score_codex":0.000727861,"about_ca_system_score_gemma":0.00066070654,"threshold_uncertainty_score":0.17586881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023580145,0.000021235835,0.00011874257,0.00007376206,0.000013881373,0.000035667847,0.99885976,0.00016298713,0.00047818586],"genre_scores_gemma":[0.0091141835,0.00015365459,0.0021203745,0.00045406286,0.000090949165,0.0010234611,0.9793184,0.00053501246,0.007189908],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995092,0.00006127125,0.00009456719,0.00014545461,0.000114113005,0.000075308875],"domain_scores_gemma":[0.98563796,0.010836052,0.00091477984,0.0007108852,0.0015779275,0.0003224141],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010442084,0.001051948,0.0014299327,0.0018338024,0.0008181012,0.0018071317,0.0015583216,0.0011342387,0.8463473],"category_scores_gemma":[0.021287065,0.0004841584,0.0010850701,0.0028643708,0.00021277799,0.0017438434,0.0008899184,0.00079608185,0.14106299],"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.00073309994,0.00012130205,0.005059294,0.0037028957,0.00010806828,0.00013623628,0.00007182708,0.00041516108,0.00024312302,0.00064468663,0.978691,0.010073287],"study_design_scores_gemma":[0.010565074,0.000614757,0.08045867,0.006481661,0.00060003647,0.0017319137,0.0006080551,0.0038976555,0.0020622448,0.019276887,0.8734257,0.00027727298],"about_ca_topic_score_codex":0.0054128473,"about_ca_topic_score_gemma":0.009283267,"teacher_disagreement_score":0.15365273,"about_ca_system_score_codex":0.0008056198,"about_ca_system_score_gemma":0.0011567004,"threshold_uncertainty_score":0.219167},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938508,0.0010436489,0.00020190039,0.0024996856,0.000020123862,0.0000362319,0.00025331954,0.000008319646,0.0020858452],"genre_scores_gemma":[0.9978927,0.0009284989,0.0002647739,0.00061449036,0.000014661055,0.000022585484,0.00011362247,0.000001935897,0.00014678999],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99657106,0.0016370467,0.00046249988,0.0002578728,0.000714797,0.00035673295],"domain_scores_gemma":[0.9859001,0.0060484097,0.003956051,0.00033839687,0.0021596423,0.0015974839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043536075,0.00016155027,0.00026877198,0.0013778743,0.000428615,0.0010535376,0.00030465948,0.00085837784,0.0014660927],"category_scores_gemma":[0.017508425,0.00020680288,0.00035982204,0.0016107069,0.00062880886,0.0010200532,0.00090602954,0.0005852454,0.00027912788],"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.000027957327,0.00007411582,0.98425204,0.00010372123,0.000030747226,0.000097062206,0.0031955321,0.00008897912,0.00012281614,0.000088673645,0.0012226525,0.010695738],"study_design_scores_gemma":[0.000015386971,0.00034558296,0.9768928,0.00019655377,0.000026485232,0.00065375556,0.016183522,0.0010063327,0.00010375728,0.00013771259,0.0044214376,0.000016613281],"about_ca_topic_score_codex":0.0038038509,"about_ca_topic_score_gemma":0.0027272177,"teacher_disagreement_score":0.0043536075,"about_ca_system_score_codex":0.0005192118,"about_ca_system_score_gemma":0.0008955051,"threshold_uncertainty_score":0.02302438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030926499,0.0005314831,0.00026535618,0.0016545223,0.0008315352,0.000115403906,0.0017936528,0.0013204884,0.9903949],"genre_scores_gemma":[0.002506033,0.00013396452,0.00015953563,0.00028238143,0.000033227967,0.000015976988,0.000475732,0.00015684521,0.99623626],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982613,0.000010877643,0.0000036093122,0.000060486847,0.000045775192,0.000053174746],"domain_scores_gemma":[0.9996196,0.000021076334,0.000015501975,0.000020883419,0.00008642475,0.00023655451],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001861164,0.00073073,0.00043001916,0.0005785291,0.0022362468,0.0017979223,0.0007541965,0.0009919183,0.8955695],"category_scores_gemma":[0.00033219103,0.0002057681,0.00023985741,0.0005194182,0.00029911657,0.0008281316,0.0017530074,0.00079077086,0.839546],"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.00008171449,0.00008016907,0.0010686611,0.00014175258,0.0000037801046,0.00017386202,0.00015701179,0.00005898654,0.0015759002,0.001110408,0.87256247,0.12298537],"study_design_scores_gemma":[0.000009714785,0.000057921046,0.003891952,0.00007819151,0.0000031717434,0.00013375314,0.0003128818,0.00007192872,0.0002041027,0.00010946116,0.9951206,0.000006284096],"about_ca_topic_score_codex":0.005636329,"about_ca_topic_score_gemma":0.015555327,"teacher_disagreement_score":0.1044305,"about_ca_system_score_codex":0.00059226016,"about_ca_system_score_gemma":0.0006962333,"threshold_uncertainty_score":0.14895743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94693613,0.0058011315,0.0075553716,0.00044433962,0.00014056067,0.00009258775,0.000703429,0.000109850575,0.038216654],"genre_scores_gemma":[0.9384885,0.004810746,0.014540778,0.00021181395,0.000056618574,0.00009273582,0.000517226,0.00014020344,0.041141406],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99977845,0.00001893763,0.000008416468,0.00007819723,0.00008028512,0.000035686015],"domain_scores_gemma":[0.9996927,0.00008272281,0.000049028702,0.000026498614,0.0001003387,0.00004875105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004808497,0.00033139583,0.0003980582,0.0009110651,0.0009318029,0.0014016625,0.0002623501,0.00040468242,0.0057814936],"category_scores_gemma":[0.00040839435,0.0003284305,0.00043284518,0.00096483715,0.00064359145,0.00065354886,0.0006354892,0.0006306514,0.0007249394],"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.00088494486,0.000115166724,0.033215776,0.0014987397,0.00007340569,0.001997585,0.0048885844,0.0017672577,0.82196224,0.0075941933,0.0015521642,0.12445004],"study_design_scores_gemma":[0.00005316605,0.0018801669,0.35815227,0.0009136483,0.00023607993,0.0018898834,0.009476776,0.0039088647,0.32832918,0.0032617222,0.29178017,0.00011812719],"about_ca_topic_score_codex":0.00953905,"about_ca_topic_score_gemma":0.04312405,"teacher_disagreement_score":0.00953905,"about_ca_system_score_codex":0.0009340134,"about_ca_system_score_gemma":0.0009798009,"threshold_uncertainty_score":0.019341052},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111265644,0.019492548,0.002251289,0.0103177605,0.00061312865,0.00009825202,0.0076939953,0.00017451591,0.8480929],"genre_scores_gemma":[0.5707619,0.0069486154,0.0016051261,0.00038242305,0.00024924168,0.000053418957,0.0013821094,0.00007971016,0.41853747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994929,0.000053574448,0.000012501531,0.000095223935,0.00014899629,0.000196743],"domain_scores_gemma":[0.9996705,0.000054078242,0.00005357794,0.000023922083,0.000083291874,0.00011456763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035546554,0.0005494349,0.00023092907,0.0015876029,0.0061123814,0.0042035608,0.0010203404,0.0007711242,0.0409349],"category_scores_gemma":[0.0013122782,0.00029919043,0.00028381057,0.004565403,0.0042198678,0.0014802268,0.0016548084,0.0014955677,0.0012585435],"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.00014439644,0.00003933359,0.00893924,0.0003421361,0.000058554753,0.00064172706,0.03761718,0.00094388647,0.0008870046,0.73235494,0.10580864,0.11222286],"study_design_scores_gemma":[0.00001129822,0.00001130309,0.03135003,0.00014076379,0.000012713012,0.00009569065,0.004861406,0.00016193949,0.00032085678,0.004834053,0.95817155,0.000028376862],"about_ca_topic_score_codex":0.95648164,"about_ca_topic_score_gemma":0.98364174,"teacher_disagreement_score":0.04930535,"about_ca_system_score_codex":0.04930535,"about_ca_system_score_gemma":0.027593916,"threshold_uncertainty_score":0.357737},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15539655,0.007298243,0.035408087,0.026350673,0.002135119,0.0001171204,0.00035578938,0.0003021464,0.7726363],"genre_scores_gemma":[0.628515,0.0039711506,0.013808003,0.0019392403,0.00050372933,0.000097032724,0.00035471033,0.0005160773,0.35029507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807125,0.0008390502,0.000050691135,0.0004154935,0.0003710268,0.0002525405],"domain_scores_gemma":[0.9983486,0.00048214078,0.00023094295,0.0002975519,0.00039638433,0.0002444064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033742383,0.00040604983,0.0003461173,0.000919718,0.0035369783,0.01447605,0.00091349456,0.0012340583,0.021155318],"category_scores_gemma":[0.004388168,0.00030900256,0.00033002245,0.0011061481,0.0058734547,0.005028533,0.004025339,0.002386233,0.0023789373],"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.00012832579,0.000049500242,0.0034194526,0.00020734456,0.000025842462,0.000321402,0.036929246,0.00047204035,0.0014001281,0.84639454,0.032440886,0.07821131],"study_design_scores_gemma":[0.00001679024,0.000035905807,0.005168115,0.0002755102,0.00001802588,0.00037886517,0.028453099,0.0007446107,0.0014610155,0.050813004,0.91261256,0.00002246007],"about_ca_topic_score_codex":0.009671966,"about_ca_topic_score_gemma":0.018106591,"teacher_disagreement_score":0.021155318,"about_ca_system_score_codex":0.005220522,"about_ca_system_score_gemma":0.0037007334,"threshold_uncertainty_score":0.070771635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98276824,0.00050681183,0.00006907143,0.00035448192,0.000025392881,0.000020507026,0.009688151,0.000012505031,0.006554756],"genre_scores_gemma":[0.9942836,0.00041623396,0.00010325777,0.00005504676,0.000016987762,0.000012592286,0.003713779,0.000009048336,0.0013893587],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996586,0.00002429647,0.00002344153,0.000053039585,0.00013146203,0.00010922037],"domain_scores_gemma":[0.99808854,0.00011664518,0.00022927752,0.000057837355,0.0010718699,0.00043579034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048428212,0.00023901367,0.00028239837,0.0017608209,0.0022198693,0.0011894379,0.0005575991,0.00035729358,0.0018762061],"category_scores_gemma":[0.001929102,0.00014060717,0.00022480228,0.005051699,0.00038108314,0.00036121346,0.00057631946,0.0003295527,0.00022551136],"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.00017344844,0.00002594666,0.98807985,0.0000286112,0.000060406554,0.00014400817,0.0014005172,0.00069369614,0.0005237078,0.00028517045,0.0034297332,0.005154884],"study_design_scores_gemma":[0.0000010928825,0.0000031493075,0.9975049,0.000006318622,0.0000065414674,0.000015381622,0.0006107518,0.00013006378,0.000029354032,0.000007921082,0.0016804326,0.0000041486937],"about_ca_topic_score_codex":0.9865498,"about_ca_topic_score_gemma":0.99418277,"teacher_disagreement_score":0.013450205,"about_ca_system_score_codex":0.010595064,"about_ca_system_score_gemma":0.0135627305,"threshold_uncertainty_score":0.076872945},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2752691,0.025232825,0.010049464,0.015128471,0.004341696,0.000084326566,0.0162463,0.00027877267,0.65336895],"genre_scores_gemma":[0.9172235,0.0080778655,0.0036597915,0.007038584,0.0010525554,0.00018972585,0.01509436,0.00035886027,0.04730472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99687994,0.00089611695,0.00037061897,0.0004675885,0.00073068653,0.00065498723],"domain_scores_gemma":[0.99024045,0.0046426365,0.0018034752,0.0014540612,0.0011077413,0.0007516311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023418851,0.00020229255,0.0005558205,0.0020345787,0.0020959477,0.003758096,0.0014184592,0.0009755405,0.01736527],"category_scores_gemma":[0.011525107,0.00020692933,0.0006180769,0.0047443984,0.0021647317,0.0039619766,0.0025808515,0.0019125164,0.0024956698],"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.00034818595,0.000096354524,0.07257652,0.001081653,0.000085301406,0.0008977868,0.006346294,0.00063599146,0.00026126238,0.5891316,0.1708477,0.15769127],"study_design_scores_gemma":[0.000022923827,0.0000935852,0.083724335,0.00061202014,0.000048241618,0.0015713196,0.006514346,0.00063182693,0.00048562384,0.0406931,0.86554736,0.00005540664],"about_ca_topic_score_codex":0.0068267086,"about_ca_topic_score_gemma":0.010057086,"teacher_disagreement_score":0.01736527,"about_ca_system_score_codex":0.0011799729,"about_ca_system_score_gemma":0.0014433593,"threshold_uncertainty_score":0.058092654},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017547905,0.015648566,0.0010985493,0.004883021,0.002060396,0.000018975285,0.00022227693,0.000118395736,0.9741951],"genre_scores_gemma":[0.022249062,0.015561097,0.0013876075,0.0015897691,0.00095806934,0.000053654094,0.00022865369,0.00018997409,0.9577822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999607,0.00005533087,0.000010652278,0.0001367659,0.00012729639,0.00006302806],"domain_scores_gemma":[0.9998204,0.000054262942,0.000019499834,0.000033762615,0.000039380233,0.00003266863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030149924,0.00076147786,0.0004236113,0.0011412797,0.0022714282,0.0048304345,0.00081130216,0.0019423612,0.15636642],"category_scores_gemma":[0.0008263568,0.0003642779,0.0003389295,0.0016956086,0.0016944008,0.0032319669,0.002546271,0.0024221153,0.055726334],"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.00009014914,0.00003670001,0.00046298906,0.0004063954,0.000007783954,0.00058603263,0.0010631628,0.0002103387,0.00094614335,0.5356397,0.21434522,0.24620526],"study_design_scores_gemma":[0.0000019200104,0.0000035436253,0.00014924207,0.0000910159,0.0000011442295,0.00022537632,0.000068799054,0.000024125004,0.000095690346,0.0044740103,0.994863,0.000002137784],"about_ca_topic_score_codex":0.003472088,"about_ca_topic_score_gemma":0.0069471993,"teacher_disagreement_score":0.15636642,"about_ca_system_score_codex":0.0019075613,"about_ca_system_score_gemma":0.0012790991,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011671752,0.052657623,0.2035322,0.06471494,0.065447316,0.0010674442,0.018573085,0.012528968,0.56980664],"genre_scores_gemma":[0.032525226,0.0212517,0.028308539,0.0027952166,0.0033464083,0.00021834204,0.01558129,0.0023202295,0.8936531],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989537,0.00020040106,0.000034996472,0.00013069478,0.00047868254,0.00020148128],"domain_scores_gemma":[0.99544215,0.00054600625,0.00007571753,0.0005840124,0.0023886892,0.00096335495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025071704,0.001741752,0.002972885,0.0013667132,0.003537135,0.00891138,0.0030072993,0.0013329389,0.22420503],"category_scores_gemma":[0.0053466987,0.00091540057,0.0010457713,0.0022625066,0.001899088,0.0034088986,0.0020581998,0.004144167,0.07163409],"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.00012994175,0.0001062237,0.0006864223,0.00011125313,0.00004593982,0.00006866275,0.00015449886,0.00050862774,0.00057454803,0.009810394,0.9351887,0.05261486],"study_design_scores_gemma":[0.00009143498,0.000034819575,0.002169068,0.00018447488,0.00014437159,0.00010707595,0.00033111055,0.009933412,0.001105867,0.0145779895,0.9712657,0.000054627486],"about_ca_topic_score_codex":0.41439083,"about_ca_topic_score_gemma":0.7052726,"teacher_disagreement_score":0.41439083,"about_ca_system_score_codex":0.011877658,"about_ca_system_score_gemma":0.015174654,"threshold_uncertainty_score":0.8239576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18763846,0.05965152,0.0692542,0.024343638,0.0042987065,0.00026880845,0.0035845211,0.0017800014,0.6491802],"genre_scores_gemma":[0.79755646,0.0275727,0.027671712,0.0012837066,0.0005682361,0.0001199078,0.0016041925,0.00042163857,0.1432014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99974424,0.00004357216,0.00001824594,0.00008183075,0.00006479695,0.000047246547],"domain_scores_gemma":[0.99985635,0.000041714484,0.000027589896,0.000022336331,0.000031948606,0.000020083547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031751787,0.0003877834,0.00065463263,0.0009120518,0.0016759527,0.0044760588,0.0005371044,0.0006391104,0.021110598],"category_scores_gemma":[0.00066123443,0.00024702906,0.00054132106,0.0012921023,0.002106151,0.0019660888,0.0017808184,0.0015137424,0.0043752333],"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.0003054494,0.00011874235,0.005594434,0.0014027958,0.00008558809,0.0016348304,0.0022463382,0.00949677,0.004372653,0.66607165,0.052467335,0.25620347],"study_design_scores_gemma":[0.000032759453,0.000084013736,0.011498016,0.00073576596,0.000064566986,0.0020585544,0.002689741,0.008020245,0.0023921626,0.17412555,0.7982318,0.00006683725],"about_ca_topic_score_codex":0.006351567,"about_ca_topic_score_gemma":0.0073019895,"teacher_disagreement_score":0.021110598,"about_ca_system_score_codex":0.0020378772,"about_ca_system_score_gemma":0.0018815043,"threshold_uncertainty_score":0.07062197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8795206,0.0015717526,0.0010838769,0.00017882495,0.00015174273,0.00010241561,0.103546195,0.00029692534,0.013547719],"genre_scores_gemma":[0.81667054,0.0009314015,0.0012762526,0.00012712665,0.00012885564,0.00007548689,0.17798889,0.000089997004,0.002711354],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99968696,0.0000316908,0.00003128353,0.000104705745,0.00008137191,0.00006397281],"domain_scores_gemma":[0.99754214,0.00019409598,0.0008914729,0.00019490917,0.00047476916,0.00070261216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009972288,0.00046721046,0.0002775807,0.0040823603,0.00024922373,0.001030037,0.0004822598,0.00035677108,0.0016745827],"category_scores_gemma":[0.002078557,0.0002023757,0.000678677,0.0018932797,0.00020422456,0.00040590798,0.0008907121,0.00048681957,0.0010531568],"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.00013106549,0.00002174587,0.9822,0.00007719955,0.00018135727,0.00007717945,0.000087117725,0.00040925774,0.00075998256,0.00033785283,0.0075477306,0.0081695495],"study_design_scores_gemma":[0.0000074366317,0.000018920542,0.99499434,0.000014084643,0.000045208268,0.00011750738,0.000034439243,0.000327872,0.00014456715,0.000051541992,0.0042389,0.0000052066835],"about_ca_topic_score_codex":0.039647233,"about_ca_topic_score_gemma":0.05213182,"teacher_disagreement_score":0.039647233,"about_ca_system_score_codex":0.000561414,"about_ca_system_score_gemma":0.00049886387,"threshold_uncertainty_score":0.078832924},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32839403,0.011472097,0.020164028,0.056163102,0.004248353,0.00012218973,0.00016166328,0.000773274,0.57850116],"genre_scores_gemma":[0.7931171,0.0027818386,0.0035478421,0.0017051661,0.00040301547,0.000033707467,0.000117892894,0.00018781539,0.19810545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991622,0.00014479883,0.000016552947,0.00010083131,0.00033435944,0.00024129929],"domain_scores_gemma":[0.9994653,0.00015365558,0.000043653235,0.000058533933,0.0000811141,0.00019783371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095600286,0.00032863565,0.00029789342,0.00044986143,0.0043414272,0.00462585,0.00068828656,0.00064126635,0.0073347706],"category_scores_gemma":[0.0031660781,0.00015729372,0.00032381507,0.0004786494,0.0065197437,0.0022350566,0.0025390051,0.0029839622,0.0010361904],"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.0006210789,0.000066901055,0.0030647009,0.0002378939,0.00002428381,0.0014297591,0.09102333,0.0010298322,0.0067614825,0.5535477,0.1629749,0.1792182],"study_design_scores_gemma":[0.000025761208,0.000117150135,0.0047998745,0.00027050596,0.000011649308,0.0011076198,0.028871156,0.002101349,0.0019271671,0.053050198,0.9076686,0.00004899278],"about_ca_topic_score_codex":0.022746518,"about_ca_topic_score_gemma":0.037392054,"teacher_disagreement_score":0.022746518,"about_ca_system_score_codex":0.0048326836,"about_ca_system_score_gemma":0.0020280126,"threshold_uncertainty_score":0.045228183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24818484,0.0067527504,0.0027492556,0.12235986,0.00028587953,0.00006586431,0.0001650083,0.00009620737,0.6193403],"genre_scores_gemma":[0.9818252,0.0013163391,0.0003680715,0.002784931,0.000051249666,0.000018863788,0.000023386045,0.000029769484,0.013582253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9833003,0.0028715257,0.00032314062,0.0012411096,0.0063136104,0.0059501724],"domain_scores_gemma":[0.98362654,0.006553308,0.0011456229,0.0007591961,0.0049240896,0.0029912833],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008567872,0.00040396227,0.000620768,0.0052346163,0.06031699,0.041135386,0.002759909,0.0040997113,0.007368947],"category_scores_gemma":[0.022156209,0.0006025562,0.0005093868,0.007531884,0.0600596,0.009618323,0.011619339,0.0057216273,0.00042726492],"study_design_candidate":"qualitative","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.00008639857,0.000023844206,0.003955536,0.0001194081,0.000012181333,0.0002632399,0.10562584,0.00045628732,0.00033048048,0.8396909,0.011736586,0.037699368],"study_design_scores_gemma":[0.00006173126,0.000054057826,0.026240882,0.0008778674,0.00010626711,0.0002442636,0.37236908,0.0015992759,0.0011248641,0.18155111,0.41539547,0.0003751756],"about_ca_topic_score_codex":0.98540777,"about_ca_topic_score_gemma":0.9873065,"teacher_disagreement_score":0.9588646,"about_ca_system_score_codex":0.25751448,"about_ca_system_score_gemma":0.25865507,"threshold_uncertainty_score":0.861178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044924514,0.0014751569,0.0005769827,0.013868637,0.008448293,0.00016676316,0.0053198533,0.0014858167,0.96416605],"genre_scores_gemma":[0.003766546,0.0001944556,0.00008261651,0.00070170744,0.00017880413,0.000014970429,0.0007237177,0.000116332645,0.99422085],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978269,0.00006163399,0.00006118077,0.00020149657,0.001477104,0.00037166473],"domain_scores_gemma":[0.99480325,0.00053961383,0.00014676305,0.00059472094,0.0029331597,0.0009823585],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001494071,0.00088361994,0.0009235933,0.003077641,0.006201859,0.010716119,0.0018096113,0.0063466905,0.37101522],"category_scores_gemma":[0.008389889,0.0007281452,0.001139536,0.001819988,0.0010967896,0.0024340833,0.0013294106,0.0042584813,0.180474],"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.00009137825,0.00003274615,0.0004899055,0.000039457263,0.0000062956296,0.00014679442,0.00003401701,0.00007511217,0.00024148363,0.005370345,0.97928053,0.014191935],"study_design_scores_gemma":[0.000032093714,0.000040871768,0.003698275,0.00006561888,0.000012310553,0.00007423605,0.00010792591,0.00030882904,0.00036813825,0.001045435,0.99422234,0.000023735005],"about_ca_topic_score_codex":0.2581093,"about_ca_topic_score_gemma":0.54379857,"teacher_disagreement_score":0.74189067,"about_ca_system_score_codex":0.011153328,"about_ca_system_score_gemma":0.011621891,"threshold_uncertainty_score":0.8971704},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00706522,0.0068993694,0.00078539056,0.1526521,0.09973219,0.0002063076,0.007881101,0.0012386768,0.72353965],"genre_scores_gemma":[0.0061190836,0.0013732788,0.0003254937,0.0016336475,0.001790838,0.00002219925,0.0014625868,0.00018134741,0.9870914],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980876,0.00009528977,0.00006632255,0.00024265496,0.0011170978,0.00039104922],"domain_scores_gemma":[0.9943581,0.00012056587,0.00010989055,0.00029225246,0.0035448773,0.0015742896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183721,0.00075301545,0.0009963063,0.00327605,0.0052532717,0.0062915143,0.0011191986,0.0023465322,0.2189404],"category_scores_gemma":[0.0039841733,0.00033338426,0.00054443895,0.0025959734,0.0010933981,0.002655271,0.0035732414,0.0028919203,0.08624342],"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.000028990486,0.000020839525,0.00032873513,0.000022358676,0.0000015695321,0.000031940912,0.00007144603,0.000029952931,0.00012777607,0.0018325881,0.9796149,0.017888801],"study_design_scores_gemma":[0.000004600206,0.000015791229,0.0012625764,0.00004772319,0.0000018080293,0.000018076958,0.00030316212,0.000074950636,0.00011710569,0.00048279707,0.9976675,0.0000038804583],"about_ca_topic_score_codex":0.08220848,"about_ca_topic_score_gemma":0.17415997,"teacher_disagreement_score":0.2189404,"about_ca_system_score_codex":0.007656058,"about_ca_system_score_gemma":0.01652214,"threshold_uncertainty_score":0.73242867},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911231,0.00069762877,0.00095971953,0.000023127375,0.0000074219174,0.000059519654,0.0010123766,0.00003788679,0.0060792402],"genre_scores_gemma":[0.9801161,0.00068597606,0.0021221242,0.000031002022,0.0000042911483,0.00008546278,0.001683801,0.000015371897,0.015255874],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9996902,0.00002874158,0.000011806212,0.000107791464,0.000091335765,0.00007027409],"domain_scores_gemma":[0.99927026,0.00012631305,0.0001521605,0.000046422447,0.00030862368,0.0000962412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003809444,0.00034686716,0.0002574393,0.0006823773,0.0008315246,0.00060721615,0.00033015996,0.00020821259,0.003676856],"category_scores_gemma":[0.00035551164,0.00016966747,0.00025971132,0.0004976559,0.00030404693,0.00031800804,0.00031961288,0.00045284157,0.00059949985],"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.0005095471,0.00011289276,0.29777038,0.00047225956,0.00008164074,0.001247834,0.005463317,0.0006135629,0.6496113,0.0006040968,0.00056185527,0.042951312],"study_design_scores_gemma":[0.0000022325248,0.00023181355,0.9709664,0.000022133361,0.000038690123,0.00027458376,0.0011169418,0.00024973258,0.017679937,0.000038213744,0.009363685,0.000015588366],"about_ca_topic_score_codex":0.08916024,"about_ca_topic_score_gemma":0.23631404,"teacher_disagreement_score":0.08916024,"about_ca_system_score_codex":0.0019389358,"about_ca_system_score_gemma":0.0009752723,"threshold_uncertainty_score":0.17728251},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002452888,0.09125943,0.001432626,0.28278616,0.034545865,0.00013186477,0.0014443133,0.00026606442,0.5856808],"genre_scores_gemma":[0.0490422,0.063461676,0.0022280104,0.0629824,0.009998038,0.00015999905,0.0007486867,0.00028793814,0.81109107],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9924217,0.0006309457,0.00018000172,0.0006171148,0.0043915096,0.0017588072],"domain_scores_gemma":[0.98633575,0.0017991409,0.00032010043,0.00048761218,0.008052855,0.003004643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004958607,0.0010863732,0.0008157989,0.008854245,0.02395264,0.01676674,0.0025859196,0.00912982,0.044064514],"category_scores_gemma":[0.013898647,0.00085649494,0.00062131346,0.014739924,0.0116467625,0.0064263577,0.0036566956,0.009673304,0.0060632494],"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.000010712555,0.000027492668,0.00031193558,0.000053963726,0.000004335762,0.000036552112,0.0004580436,0.00006264327,0.000030960873,0.14521156,0.82493246,0.028859284],"study_design_scores_gemma":[0.0000020355258,0.0000019855909,0.00068486005,0.000061760744,0.0000018966581,0.000009825672,0.00019782178,0.000031643758,0.000013005484,0.0031600813,0.9958221,0.0000129993605],"about_ca_topic_score_codex":0.94377446,"about_ca_topic_score_gemma":0.97054994,"teacher_disagreement_score":0.8990599,"about_ca_system_score_codex":0.10094008,"about_ca_system_score_gemma":0.19020149,"threshold_uncertainty_score":0.73237497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007968715,0.0009293672,0.0007767787,0.025940869,0.04576934,0.000295313,0.012621934,0.0019343675,0.91093516],"genre_scores_gemma":[0.0008904732,0.00019993186,0.00015194067,0.0029248756,0.0020900045,0.000047757574,0.0023178174,0.00024076608,0.99113643],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985728,0.000090136295,0.00003551276,0.00011566435,0.00090064935,0.00028527103],"domain_scores_gemma":[0.99549073,0.00042648407,0.00014923858,0.00022382778,0.0020147546,0.0016948413],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019714227,0.001135057,0.00085460045,0.0020249411,0.0024592467,0.008735015,0.001510228,0.0068127657,0.6880071],"category_scores_gemma":[0.00563824,0.0005009006,0.001189995,0.0014226482,0.0005065869,0.0026108874,0.0020888457,0.0044916417,0.5932223],"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.000019971025,0.000015975633,0.000025716554,0.000010695072,7.604717e-7,0.000008872591,0.0000019206689,0.000011845718,0.000020766183,0.00027041172,0.9958905,0.003722485],"study_design_scores_gemma":[0.000037000867,0.000022397686,0.0004845198,0.000037269132,0.0000038760363,0.000009689643,0.000038269445,0.00015258325,0.00008837101,0.0008587607,0.99825794,0.000009217379],"about_ca_topic_score_codex":0.016225554,"about_ca_topic_score_gemma":0.043107428,"teacher_disagreement_score":0.6880071,"about_ca_system_score_codex":0.0021962046,"about_ca_system_score_gemma":0.0042880084,"threshold_uncertainty_score":0.44501996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004161196,0.0008324368,0.0016502994,0.020973412,0.0027111964,0.00011722888,0.015371131,0.001525969,0.9526572],"genre_scores_gemma":[0.01184734,0.00030376035,0.0011470602,0.0013846809,0.000180668,0.000027173348,0.0027801092,0.0003202507,0.98200905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903286,0.000032267915,0.000011720574,0.00009418128,0.0005316069,0.00029736938],"domain_scores_gemma":[0.99681324,0.00018686609,0.00007129937,0.0001325132,0.0015931199,0.001202979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00092386827,0.0005905227,0.0005883401,0.0011759183,0.0034266,0.0052079745,0.0010368692,0.0034990066,0.3337027],"category_scores_gemma":[0.0025141467,0.00026875097,0.0005498742,0.0008983698,0.0008615148,0.0011452793,0.0017722144,0.0030946073,0.09169318],"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.000104918334,0.00005883814,0.000727802,0.000031110016,0.0000058493856,0.00010262748,0.000017719209,0.00029841572,0.00030015392,0.018328246,0.9486243,0.0313999],"study_design_scores_gemma":[0.00003833681,0.000038319708,0.0029889762,0.000063500476,0.00000563033,0.00007480108,0.000072571005,0.0018432284,0.00075219024,0.006016641,0.9880838,0.000022033524],"about_ca_topic_score_codex":0.38417208,"about_ca_topic_score_gemma":0.6134078,"teacher_disagreement_score":0.6158279,"about_ca_system_score_codex":0.010869037,"about_ca_system_score_gemma":0.028703328,"threshold_uncertainty_score":0.9503922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003183619,0.0008751972,0.060808077,0.008482921,0.003329284,0.0001344431,0.005982159,0.013639003,0.9035653],"genre_scores_gemma":[0.22509292,0.003760243,0.055248268,0.00495852,0.0027333428,0.0007126288,0.0153589,0.034276165,0.65785897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886143,0.0003829483,0.000077173056,0.00022903268,0.00034180228,0.000107581174],"domain_scores_gemma":[0.998028,0.0005721828,0.0000818456,0.00072193716,0.00045937044,0.00013668092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012270006,0.0005418797,0.00034704508,0.0008699789,0.0018661851,0.00736241,0.0010779564,0.0016549653,0.20629102],"category_scores_gemma":[0.006016919,0.0003459014,0.00044820816,0.0010212692,0.0021085106,0.007839338,0.0037140697,0.0021458084,0.093093485],"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.00006721244,0.000020818066,0.00023489041,0.00020940896,0.000004210604,0.00007614685,0.0012982207,0.00015979243,0.00075540115,0.6565172,0.28394312,0.056713488],"study_design_scores_gemma":[0.000007945137,0.000007647193,0.00014043634,0.00008640909,0.000001775805,0.00007276645,0.00021716698,0.00023930143,0.00067823497,0.0355969,0.96294063,0.000010850026],"about_ca_topic_score_codex":0.0025541708,"about_ca_topic_score_gemma":0.0019012368,"teacher_disagreement_score":0.20629102,"about_ca_system_score_codex":0.0014424052,"about_ca_system_score_gemma":0.00129581,"threshold_uncertainty_score":0.69011223},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010634174,0.0037505045,0.0055118096,0.0068141287,0.012506953,0.0022785803,0.26056752,0.005908441,0.70159864],"genre_scores_gemma":[0.011498894,0.005509908,0.01058152,0.008290392,0.003490029,0.0032512764,0.20744085,0.004680365,0.7452567],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990526,0.0001570735,0.00012080825,0.00022585518,0.00031540918,0.00012832331],"domain_scores_gemma":[0.99295336,0.0013858494,0.00025427892,0.0007026017,0.003530771,0.0011732692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010993272,0.0015349619,0.0016111947,0.0034583057,0.0028662346,0.0053434866,0.0024176512,0.002191202,0.9100973],"category_scores_gemma":[0.016827328,0.0006474587,0.0006060982,0.0037545164,0.00045459857,0.0036794876,0.0030567197,0.0014592049,0.72307795],"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.00017064875,0.000028967117,0.00012002278,0.0006478447,0.0000024888063,0.00006724339,0.000044589386,0.00002612652,0.0002780638,0.0019258813,0.95804757,0.03864056],"study_design_scores_gemma":[0.000025339894,0.000029448018,0.00018304188,0.00021088113,0.00000344745,0.00007981422,0.000072406445,0.000019933166,0.00019968662,0.0013076997,0.9978598,0.000008367838],"about_ca_topic_score_codex":0.004567924,"about_ca_topic_score_gemma":0.0076481034,"teacher_disagreement_score":0.9100973,"about_ca_system_score_codex":0.0014826913,"about_ca_system_score_gemma":0.003518662,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9157557,0.0011287094,0.0017737923,0.0020863868,0.000025163183,0.000057349265,0.00037002497,0.000023228615,0.0787796],"genre_scores_gemma":[0.99865353,0.00028008883,0.00014383446,0.000034851557,0.000010052785,0.000013380106,0.000056285688,0.0000014644938,0.0008065298],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985464,0.0005888987,0.00006126759,0.00010471104,0.0003193934,0.00037925618],"domain_scores_gemma":[0.99068767,0.004473603,0.002740325,0.00028696252,0.0003669638,0.0014444616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009153028,0.0002650546,0.00024245188,0.0019234429,0.001186718,0.0033829743,0.00041729465,0.0006408518,0.0056857723],"category_scores_gemma":[0.0070635914,0.00009040151,0.00023668015,0.002905055,0.002248444,0.0022813138,0.002338708,0.00084249146,0.00032629824],"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.00015518533,0.0010221747,0.81273526,0.00024740602,0.00023054222,0.00047172152,0.010072788,0.004860402,0.0003531271,0.09521023,0.0028479774,0.071793206],"study_design_scores_gemma":[0.000031903564,0.00030853698,0.89361936,0.00028607924,0.000092526236,0.00033199444,0.017721267,0.0065046665,0.00047822023,0.054263238,0.026300421,0.00006174648],"about_ca_topic_score_codex":0.016511466,"about_ca_topic_score_gemma":0.01523865,"teacher_disagreement_score":0.016511466,"about_ca_system_score_codex":0.002490226,"about_ca_system_score_gemma":0.0010835165,"threshold_uncertainty_score":0.032830715},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008426158,0.4244874,0.07267241,0.1383345,0.019585356,0.00016894378,0.0017880586,0.0013719258,0.33316526],"genre_scores_gemma":[0.16150573,0.23366922,0.033570446,0.02012423,0.008562959,0.0004893339,0.0023335689,0.0006490134,0.5390955],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928087,0.00015673466,0.000033362016,0.0002040528,0.00025170232,0.000073245574],"domain_scores_gemma":[0.99932635,0.00024986672,0.00003407359,0.00007840017,0.00022917164,0.000082074956],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012433715,0.0007007899,0.00051022554,0.0007628756,0.0011768355,0.002151289,0.0005036497,0.0008741153,0.019474987],"category_scores_gemma":[0.0021783756,0.0002792381,0.0002667247,0.0022122073,0.0014249289,0.0033680995,0.00095556205,0.002630688,0.0064349766],"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.00005444273,0.000017888808,0.00046020752,0.00047194617,0.000023233173,0.0000869028,0.00058953906,0.00077439373,0.00084326614,0.4306872,0.44347325,0.12251777],"study_design_scores_gemma":[0.000008982276,0.000010991123,0.0006722938,0.000063957465,0.000009003339,0.000069405454,0.0001362929,0.0010074074,0.00041053307,0.08521575,0.91237855,0.000016863272],"about_ca_topic_score_codex":0.010848413,"about_ca_topic_score_gemma":0.012258637,"teacher_disagreement_score":0.980525,"about_ca_system_score_codex":0.003699891,"about_ca_system_score_gemma":0.0024405539,"threshold_uncertainty_score":0.06515032},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025610726,0.003819834,0.0031615212,0.7317514,0.19183253,0.00015121386,0.00096870266,0.00074559584,0.065008216],"genre_scores_gemma":[0.025633134,0.002497345,0.003368525,0.27941304,0.027557882,0.00027371058,0.0009854845,0.0011765877,0.6590943],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933161,0.0019271648,0.00016789812,0.0007900927,0.002550139,0.0012486135],"domain_scores_gemma":[0.94686806,0.0025783535,0.0011871482,0.0025943017,0.024157327,0.02261483],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008579866,0.0010943067,0.0012814825,0.0010261402,0.006778944,0.009700984,0.0016145748,0.004838294,0.11496573],"category_scores_gemma":[0.04206336,0.00038082912,0.0010023845,0.0008276717,0.0032084407,0.005044143,0.007579475,0.016492011,0.10890273],"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.00005293064,0.000028118224,0.00036553835,0.000033315635,0.0000086930095,0.00009922698,0.00028872496,0.00002798313,0.00023180108,0.0061780796,0.9806536,0.012031935],"study_design_scores_gemma":[0.0000136937815,0.000034604436,0.0005192662,0.00007762785,0.000005807427,0.000118525466,0.0007023028,0.00006299819,0.00012473985,0.002565684,0.99575824,0.000016683689],"about_ca_topic_score_codex":0.0035600353,"about_ca_topic_score_gemma":0.007473787,"teacher_disagreement_score":0.88503426,"about_ca_system_score_codex":0.003683225,"about_ca_system_score_gemma":0.005911296,"threshold_uncertainty_score":0.38459873},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09586099,0.01111356,0.020388754,0.044903804,0.00265838,0.0010250234,0.072982386,0.0018197213,0.7492474],"genre_scores_gemma":[0.26896298,0.0027348262,0.012173687,0.00264762,0.00019232281,0.0003521953,0.014017073,0.0002897013,0.69862956],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9987399,0.00027175757,0.0000204203,0.0001555083,0.0004692058,0.00034319027],"domain_scores_gemma":[0.9962627,0.00033270376,0.00016965528,0.00022765846,0.0021311375,0.0008760762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016661738,0.00064736063,0.00037924552,0.0018683233,0.00412912,0.0030331756,0.0011062977,0.0009837839,0.07769575],"category_scores_gemma":[0.00299913,0.00024244863,0.0003990337,0.0022816467,0.00094227336,0.0008396863,0.0014234328,0.0011426972,0.0052133678],"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.0006364023,0.0002397752,0.03554323,0.0002479328,0.000105477906,0.0007510221,0.0009204751,0.0033365807,0.0014402932,0.060724434,0.60953444,0.28651989],"study_design_scores_gemma":[0.00017489803,0.00010311557,0.08836499,0.0002530005,0.000056330715,0.00032331893,0.0017756802,0.00514446,0.0012111061,0.004186683,0.89835805,0.000048301],"about_ca_topic_score_codex":0.96244323,"about_ca_topic_score_gemma":0.9718736,"teacher_disagreement_score":0.07769575,"about_ca_system_score_codex":0.035861533,"about_ca_system_score_gemma":0.058474332,"threshold_uncertainty_score":0.2601949},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046247835,0.0016040399,0.18349268,0.002552021,0.0014649694,0.0010287764,0.022162175,0.09441659,0.68865395],"genre_scores_gemma":[0.060848046,0.003124164,0.11571358,0.0027601798,0.00094352325,0.0009898309,0.052175764,0.037041802,0.7264031],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996498,0.00034149308,0.00027296683,0.0009937931,0.001361814,0.00053191144],"domain_scores_gemma":[0.9960674,0.00055126037,0.00022453486,0.0014828661,0.0013441433,0.00032976613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002413757,0.0023066993,0.0011555111,0.0036635902,0.0032881673,0.0071378807,0.0036797132,0.0021751989,0.21485306],"category_scores_gemma":[0.009227361,0.0017863724,0.002267004,0.0025930603,0.0011423684,0.010210799,0.0054954863,0.0030266247,0.15695506],"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.000103210274,0.00013900254,0.0021818872,0.00034292677,0.000051287338,0.00043868448,0.00084027566,0.000463111,0.0016235051,0.114222735,0.5990103,0.2805832],"study_design_scores_gemma":[0.000014632232,0.000008061781,0.0004804276,0.000112481306,0.000014519498,0.00033258798,0.00008345201,0.0004336086,0.0004805612,0.013525049,0.9844875,0.00002716467],"about_ca_topic_score_codex":0.018099576,"about_ca_topic_score_gemma":0.0129215,"teacher_disagreement_score":0.21485306,"about_ca_system_score_codex":0.0029121756,"about_ca_system_score_gemma":0.0034029505,"threshold_uncertainty_score":0.7187551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8235233,0.066390835,0.033287317,0.0068502687,0.00023995424,0.00071453396,0.025518944,0.00038177046,0.04309313],"genre_scores_gemma":[0.908902,0.030314988,0.03645875,0.0011782261,0.000033565768,0.00016429748,0.008509658,0.00008099397,0.0143575305],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982712,0.00011062147,0.00008390411,0.00015835733,0.0012727178,0.000103169856],"domain_scores_gemma":[0.9948401,0.00040661235,0.0006033675,0.00016342383,0.0038367775,0.00014967179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029227328,0.0007717777,0.0005153394,0.0021393052,0.0017741254,0.0014202123,0.0013128695,0.00052296254,0.0009004419],"category_scores_gemma":[0.003731187,0.00037961104,0.00050765957,0.0047800173,0.0010115914,0.0010623919,0.00075227534,0.0005721773,0.0002733852],"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.0001692777,0.00008455523,0.70258313,0.00097050954,0.00041417958,0.00014137018,0.0008083084,0.00431267,0.007928584,0.0008829715,0.009167247,0.2725371],"study_design_scores_gemma":[0.000008745805,0.000051016967,0.98018336,0.00010357301,0.00018010095,0.0000574434,0.0010219447,0.0019690678,0.0041734967,0.00045679772,0.011765827,0.00002861244],"about_ca_topic_score_codex":0.9774571,"about_ca_topic_score_gemma":0.9928717,"teacher_disagreement_score":0.022542894,"about_ca_system_score_codex":0.017632723,"about_ca_system_score_gemma":0.016595956,"threshold_uncertainty_score":0.12793493},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27618447,0.057200782,0.010139741,0.07688227,0.00092557166,0.00042465125,0.32595417,0.0007104628,0.25157788],"genre_scores_gemma":[0.85176605,0.03752247,0.012204737,0.0020866795,0.00025222,0.00014500084,0.051632244,0.00016983158,0.04422071],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9981482,0.00012566424,0.000048553986,0.00027966322,0.0009752682,0.00042268983],"domain_scores_gemma":[0.99401975,0.0006589229,0.00049173454,0.00016088187,0.0043188906,0.00034981914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018001513,0.00049455516,0.0004276561,0.0052003046,0.002993788,0.002642481,0.0013631061,0.00042675895,0.011711511],"category_scores_gemma":[0.008219848,0.00023171336,0.0005034047,0.016348837,0.0013623436,0.0009289786,0.0013157881,0.00091226905,0.00053482974],"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.00019931055,0.000053096766,0.392504,0.001285963,0.00030072904,0.00028298795,0.0030762418,0.0051517435,0.0007002807,0.07031724,0.2661727,0.25995567],"study_design_scores_gemma":[0.000018836789,0.000013732994,0.8129773,0.0005425764,0.00012474766,0.00006907851,0.002789054,0.0029239657,0.00047723917,0.0047875145,0.17521292,0.00006298926],"about_ca_topic_score_codex":0.9979511,"about_ca_topic_score_gemma":0.99885356,"teacher_disagreement_score":0.06768225,"about_ca_system_score_codex":0.06768225,"about_ca_system_score_gemma":0.072581634,"threshold_uncertainty_score":0.4910714},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006988128,0.0118931625,0.02857744,0.11393609,0.2782525,0.0006233814,0.025013484,0.0055173067,0.5291985],"genre_scores_gemma":[0.019686539,0.007593817,0.009798666,0.005547631,0.010509984,0.0001269082,0.006468193,0.0024507449,0.9378174],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.998386,0.00019340357,0.00009974855,0.00043537683,0.0005647315,0.00032078067],"domain_scores_gemma":[0.99036014,0.0014583952,0.00018615529,0.0010095874,0.0055704727,0.001415238],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025973273,0.0009393221,0.001739192,0.0020308981,0.0030820873,0.01027518,0.0015196247,0.0025141875,0.44790894],"category_scores_gemma":[0.014063879,0.000834926,0.00062205235,0.0038657628,0.0013015474,0.0036171183,0.0016796364,0.0022448942,0.2128946],"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.000114612536,0.000043480613,0.0006490828,0.00014885586,0.000022318512,0.00006844637,0.00005393485,0.00044002655,0.00044542408,0.0037554158,0.9396948,0.054563615],"study_design_scores_gemma":[0.000043946584,0.000048802653,0.0014484924,0.00017237318,0.000020185942,0.00007391257,0.00015822136,0.0022928116,0.00086523127,0.002691966,0.99215454,0.000029497956],"about_ca_topic_score_codex":0.04052582,"about_ca_topic_score_gemma":0.077937245,"teacher_disagreement_score":0.44790894,"about_ca_system_score_codex":0.0038819641,"about_ca_system_score_gemma":0.0045814887,"threshold_uncertainty_score":0.7874909},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19071366,0.012160364,0.00026098924,0.6893785,0.0018256217,0.00008863569,0.002905353,0.000042901287,0.10262396],"genre_scores_gemma":[0.9096971,0.0039605037,0.0002795135,0.06165248,0.001166564,0.000066038934,0.00058762997,0.00007356952,0.022516606],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9820672,0.002123399,0.0006838005,0.0010595234,0.008492593,0.0055734036],"domain_scores_gemma":[0.92620486,0.039580334,0.00792384,0.0010582043,0.019914612,0.005318087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017664915,0.00038509083,0.001034516,0.0026530116,0.016840825,0.022934644,0.002334888,0.01818152,0.013926213],"category_scores_gemma":[0.08762394,0.000756537,0.00075211405,0.006077387,0.008401895,0.005571203,0.0036653674,0.01177443,0.0006264977],"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.0014562183,0.00037891875,0.051189672,0.00079572276,0.00042495187,0.000936428,0.067160256,0.0018141691,0.0008540752,0.238685,0.6106372,0.025667423],"study_design_scores_gemma":[0.0010536279,0.00012371306,0.25078398,0.0014456069,0.0007070763,0.00010118171,0.09383382,0.0024812603,0.0021544215,0.050245315,0.59645605,0.00061393896],"about_ca_topic_score_codex":0.9751315,"about_ca_topic_score_gemma":0.97997355,"teacher_disagreement_score":0.11843127,"about_ca_system_score_codex":0.11843127,"about_ca_system_score_gemma":0.1822784,"threshold_uncertainty_score":0.85928303},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048256047,0.00303857,0.0020360346,0.0025367283,0.0025199451,0.0008273573,0.01610195,0.0009904839,0.9236928],"genre_scores_gemma":[0.024837425,0.0010955207,0.0016307324,0.00016520955,0.00021615367,0.000095137686,0.005727508,0.00017545036,0.9660569],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9996475,0.000016597163,0.000007906861,0.000069338836,0.00017299574,0.00008561852],"domain_scores_gemma":[0.9994326,0.000031461313,0.00002589369,0.00006489924,0.00025735653,0.00018783678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003075533,0.00066855864,0.00027099464,0.0012925238,0.0030325192,0.001418547,0.0006521527,0.0002984711,0.23246625],"category_scores_gemma":[0.00061785075,0.0002170749,0.00018454019,0.001145282,0.000328693,0.0005239801,0.0014133643,0.000647893,0.05269201],"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.00025181606,0.00007216385,0.0053439084,0.00015521633,0.000010622345,0.0005387652,0.00066606264,0.00015975536,0.005845637,0.0016092866,0.67664564,0.3087012],"study_design_scores_gemma":[0.000008440197,0.000031365984,0.012669652,0.000029839515,0.0000025133131,0.000106421285,0.00029477043,0.000055493314,0.0005344665,0.000093130424,0.98616797,0.00000606156],"about_ca_topic_score_codex":0.099559195,"about_ca_topic_score_gemma":0.37314367,"teacher_disagreement_score":0.9004408,"about_ca_system_score_codex":0.0017707859,"about_ca_system_score_gemma":0.0025586807,"threshold_uncertainty_score":0.77767706},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012078222,0.004480582,0.0028649087,0.018854413,0.0012704888,0.000355427,0.7906168,0.0011432328,0.16833599],"genre_scores_gemma":[0.13089992,0.0073165307,0.017849373,0.0070742066,0.0005387778,0.0008585633,0.52474326,0.00066280947,0.31005654],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9977654,0.00018012416,0.00016625527,0.00028302934,0.0012116232,0.00039352864],"domain_scores_gemma":[0.99157,0.00036402768,0.0004054815,0.0003992743,0.0063070077,0.00095417694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015668373,0.0003908702,0.0005081335,0.0043225493,0.0022666717,0.0025549084,0.0011678243,0.000541946,0.034410823],"category_scores_gemma":[0.0063283495,0.00037742432,0.0004766058,0.010101052,0.0003403995,0.0008295718,0.0011998592,0.0009498024,0.008965702],"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.000047457637,0.000015682139,0.021345839,0.00012033267,0.000031581934,0.000041933854,0.000120563906,0.00029132218,0.000048671915,0.0053409426,0.92073745,0.051858187],"study_design_scores_gemma":[0.000031075844,0.0000109389,0.10759775,0.00019846886,0.00003961673,0.00006727205,0.0003257946,0.000916293,0.0002151066,0.0008866718,0.88967985,0.000031154417],"about_ca_topic_score_codex":0.9855318,"about_ca_topic_score_gemma":0.9912141,"teacher_disagreement_score":0.034410823,"about_ca_system_score_codex":0.028569886,"about_ca_system_score_gemma":0.094479576,"threshold_uncertainty_score":0.20729},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8157918,0.029268207,0.031552948,0.00321087,0.001274048,0.0003133427,0.021985866,0.0021580856,0.09444492],"genre_scores_gemma":[0.9174144,0.005732191,0.011141961,0.0005936864,0.00049072056,0.00014507594,0.01987417,0.00012716693,0.044480596],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998789,0.000012220552,0.0000063462003,0.000048307375,0.000031687094,0.000022603454],"domain_scores_gemma":[0.9998417,0.00002281215,0.000068968635,0.0000071168147,0.000014061827,0.000045323526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012296668,0.0009845898,0.00041832047,0.0012396643,0.0004844661,0.00057705515,0.0007027348,0.00041222517,0.016744114],"category_scores_gemma":[0.0002974819,0.00020104423,0.0003468865,0.000763917,0.00033087275,0.0002075753,0.00044837626,0.0004014512,0.0037074625],"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.0018216582,0.00019994985,0.087303475,0.0011870748,0.00040511685,0.03667851,0.00091801176,0.0012490812,0.4407113,0.014674125,0.030969653,0.38388208],"study_design_scores_gemma":[0.00026549146,0.0004844534,0.18381909,0.00030885523,0.0003295689,0.057560068,0.00049086614,0.001281893,0.05077785,0.0031697566,0.70140713,0.00010489286],"about_ca_topic_score_codex":0.0010609557,"about_ca_topic_score_gemma":0.001751396,"teacher_disagreement_score":0.016744114,"about_ca_system_score_codex":0.0003916335,"about_ca_system_score_gemma":0.00026105263,"threshold_uncertainty_score":0.056014597},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01654614,0.0022606316,0.0073347357,0.0058247186,0.0015159731,0.0001061722,0.0037266412,0.00050850195,0.9621765],"genre_scores_gemma":[0.094002664,0.0023578529,0.0055572568,0.001646403,0.000277134,0.0001517673,0.004881831,0.00022858988,0.89089656],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992481,0.000096455085,0.000038738373,0.00019811335,0.00024706728,0.00017150023],"domain_scores_gemma":[0.9990293,0.00010007217,0.000067637404,0.00013799743,0.00056379434,0.00010121095],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00097524957,0.00034625115,0.00021157728,0.00088673754,0.0013063666,0.003928744,0.00063072384,0.000974657,0.33471018],"category_scores_gemma":[0.0020318716,0.00013156791,0.000276459,0.0008938799,0.0006508485,0.0017318308,0.001871026,0.000738564,0.15940996],"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.00034889687,0.00021139598,0.014101794,0.00031966236,0.000035111774,0.00025008517,0.0006970126,0.00062492496,0.0069928733,0.15450412,0.33059424,0.49131995],"study_design_scores_gemma":[0.000012276091,0.000042270018,0.008339712,0.000096533244,0.0000068628838,0.00023049074,0.00031059876,0.00048499412,0.0013015141,0.0044439863,0.9847186,0.000012222447],"about_ca_topic_score_codex":0.015297229,"about_ca_topic_score_gemma":0.023187013,"teacher_disagreement_score":0.6652898,"about_ca_system_score_codex":0.0019651514,"about_ca_system_score_gemma":0.0013286701,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022545427,0.0031521146,0.00040397307,0.01352438,0.000926781,0.000022198526,0.0038203367,0.00011950924,0.9554852],"genre_scores_gemma":[0.21136181,0.009455136,0.0012925431,0.0012859063,0.0002886205,0.000024229636,0.0025634347,0.00010141016,0.77362686],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972814,0.00002243628,0.000015183404,0.000045468423,0.0001282861,0.000060560164],"domain_scores_gemma":[0.99886346,0.00012999089,0.00006788342,0.00008547577,0.00068186165,0.00017145547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039239004,0.00023326415,0.00029139008,0.0014022613,0.0028101145,0.0059930393,0.0004004183,0.00044065627,0.15161094],"category_scores_gemma":[0.0015918261,0.00009919548,0.00018390763,0.0037117095,0.0018781786,0.0009080674,0.0008593758,0.0004930407,0.009244326],"study_design_candidate":"theoretical_or_conceptual","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.00007828337,0.000038711114,0.02348677,0.00022184612,0.000031077412,0.0002987482,0.0026232125,0.0005514806,0.0003879588,0.23596062,0.5806619,0.15565938],"study_design_scores_gemma":[0.000007912147,0.0000069021503,0.037192896,0.00015970704,0.0000137387715,0.0000993297,0.0032877657,0.00019060384,0.000120842335,0.0052516353,0.9536526,0.000016002468],"about_ca_topic_score_codex":0.7878976,"about_ca_topic_score_gemma":0.86431307,"teacher_disagreement_score":0.7878976,"about_ca_system_score_codex":0.008575588,"about_ca_system_score_gemma":0.013417741,"threshold_uncertainty_score":0.50718915},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066531864,0.0056273295,0.0125187915,0.19594373,0.1097479,0.0008022833,0.024341134,0.003529343,0.64083624],"genre_scores_gemma":[0.019319361,0.0011795731,0.0032212771,0.011179035,0.0070773778,0.00026336455,0.0045485767,0.00061343046,0.952598],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966485,0.00061342755,0.00015379685,0.0004028089,0.0019134233,0.0002681436],"domain_scores_gemma":[0.97662807,0.0021824478,0.0007255841,0.0010874134,0.015070528,0.0043060095],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002644958,0.00072117546,0.00085638,0.0020642695,0.001990165,0.002839951,0.0015400831,0.0011147048,0.50465345],"category_scores_gemma":[0.018136693,0.00024514407,0.00051747734,0.001120823,0.0006574384,0.0016821394,0.0037196602,0.0022026908,0.23788004],"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.000059635717,0.000024479023,0.0006446277,0.00006057715,0.000004840567,0.00010559837,0.00021500277,0.00007024138,0.0004681104,0.007229533,0.96363044,0.027486918],"study_design_scores_gemma":[0.000010824849,0.0000076979295,0.0007502649,0.000056556863,0.0000037685863,0.0000892872,0.0002565716,0.00011607902,0.00017476518,0.0013556558,0.9971716,0.000006992627],"about_ca_topic_score_codex":0.008029225,"about_ca_topic_score_gemma":0.010621244,"teacher_disagreement_score":0.49534655,"about_ca_system_score_codex":0.0036947867,"about_ca_system_score_gemma":0.004933931,"threshold_uncertainty_score":0.70655173},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011330702,0.28422192,0.10588015,0.007026123,0.00307461,0.0001159045,0.0007475358,0.000980727,0.59682],"genre_scores_gemma":[0.025963183,0.41105694,0.15204695,0.0056342348,0.0065424866,0.00039082402,0.0018416037,0.00087138085,0.39565235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996294,0.00007247428,0.000025603746,0.00006659538,0.00016848363,0.00003736738],"domain_scores_gemma":[0.9995258,0.00031148596,0.000019913601,0.000039794642,0.00007390006,0.000029170358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004863655,0.00084919634,0.0005604198,0.0022993663,0.00089295546,0.003513835,0.0010895794,0.0011052602,0.037549354],"category_scores_gemma":[0.0011103902,0.00050270674,0.000517028,0.0051457854,0.0012949773,0.0054224054,0.00121656,0.0031538757,0.017728144],"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.000018915414,0.00004865338,0.00010143668,0.0010858065,0.000009129736,0.000064707216,0.000196809,0.0008923615,0.0009252763,0.61131734,0.12609237,0.25924718],"study_design_scores_gemma":[0.0000018137488,0.000010639436,0.000111669804,0.0002780449,0.000003286471,0.0001735759,0.000042002204,0.0006777504,0.0001950958,0.15254097,0.8459577,0.0000075275857],"about_ca_topic_score_codex":0.0012381509,"about_ca_topic_score_gemma":0.002190216,"teacher_disagreement_score":0.037549354,"about_ca_system_score_codex":0.0012501891,"about_ca_system_score_gemma":0.0012295106,"threshold_uncertainty_score":0.12561506},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015194446,0.0033179226,0.0036825307,0.70480853,0.004110878,0.000056276953,0.00057295687,0.00035258976,0.26790377],"genre_scores_gemma":[0.48667264,0.0109959785,0.011871926,0.15752704,0.0018284611,0.00012469241,0.0009891606,0.0005064183,0.32948366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99488175,0.0006127946,0.00007434176,0.0003511052,0.001485914,0.002594117],"domain_scores_gemma":[0.9755779,0.0018555572,0.00037940987,0.0008946451,0.008618447,0.012674012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055898083,0.00066314376,0.00063491345,0.0020426803,0.011973874,0.0175674,0.001910074,0.005179145,0.044962473],"category_scores_gemma":[0.015967863,0.00035339157,0.00082967465,0.0028661813,0.010351124,0.013495813,0.0064800894,0.0076392842,0.005289825],"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":false,"study_design_scores_codex":[0.0001368819,0.00007959574,0.002474603,0.000081418424,0.00004380306,0.00012885909,0.0007536526,0.000649076,0.00023978157,0.57614416,0.37340584,0.04586235],"study_design_scores_gemma":[0.00007647721,0.0000447928,0.0024735825,0.00019108121,0.00003594407,0.000050066523,0.0033944312,0.0006879642,0.0003368822,0.093705334,0.8989513,0.000052142736],"about_ca_topic_score_codex":0.89037484,"about_ca_topic_score_gemma":0.9142306,"teacher_disagreement_score":0.94485056,"about_ca_system_score_codex":0.05514942,"about_ca_system_score_gemma":0.22408526,"threshold_uncertainty_score":0.4001389},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015333034,0.0042387857,0.009777923,0.0015149659,0.0024216718,0.00036571804,0.014816194,0.016800158,0.9485313],"genre_scores_gemma":[0.004268725,0.0022566568,0.0020456929,0.00093582534,0.00013901194,0.00024000976,0.0091024535,0.0025706731,0.9784409],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992766,0.000052279578,0.00006714719,0.00021724321,0.00023546179,0.00015125303],"domain_scores_gemma":[0.99888426,0.0002318852,0.000050478,0.00036597956,0.00027413978,0.0001932666],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014155289,0.0031988532,0.001986476,0.0024049664,0.0026682662,0.004937369,0.0027188384,0.004954658,0.95084345],"category_scores_gemma":[0.0028094908,0.0015135579,0.0012212303,0.007914129,0.0016668863,0.010542856,0.0060330704,0.0028654456,0.96924376],"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.00018686535,0.0001331307,0.00035553394,0.0004927251,0.000026752974,0.00017342484,0.00008924286,0.0003577203,0.0011044915,0.005797173,0.759198,0.23208493],"study_design_scores_gemma":[0.000028758908,0.000021157919,0.00058769644,0.00019090857,0.000022865253,0.000108927576,0.000080857906,0.0006034847,0.00040719705,0.0017588438,0.9961604,0.000028811395],"about_ca_topic_score_codex":0.015296626,"about_ca_topic_score_gemma":0.012709801,"teacher_disagreement_score":0.049156547,"about_ca_system_score_codex":0.0026643074,"about_ca_system_score_gemma":0.0011468482,"threshold_uncertainty_score":0.070115745},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029904531,0.0014069412,0.40508866,0.0135868415,0.0064509604,0.00062488543,0.002924912,0.011801225,0.528211],"genre_scores_gemma":[0.48403203,0.0025788818,0.16204976,0.005857731,0.0029850262,0.0008260634,0.0052306144,0.01148915,0.32495078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99042284,0.002304789,0.00076888927,0.0023572594,0.0030385316,0.001107696],"domain_scores_gemma":[0.9817098,0.008733192,0.00075393927,0.0058176937,0.002451073,0.0005343868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006385319,0.0009302217,0.0011119113,0.002416127,0.0022153922,0.012342614,0.0029416657,0.003831719,0.07013881],"category_scores_gemma":[0.058937863,0.0010582217,0.0016581647,0.002236561,0.0040428266,0.022073152,0.0045252517,0.0043613487,0.028150573],"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.00032195987,0.00015183177,0.0028954635,0.00034476185,0.00007385498,0.00046076943,0.0013168216,0.0012806172,0.0020850766,0.80622965,0.057752077,0.12708719],"study_design_scores_gemma":[0.00009276943,0.000060989376,0.0007463035,0.00019498516,0.00009002512,0.00035261558,0.0006712864,0.006149197,0.00847564,0.6850228,0.298077,0.00006634707],"about_ca_topic_score_codex":0.0032571647,"about_ca_topic_score_gemma":0.0037342813,"teacher_disagreement_score":0.07013881,"about_ca_system_score_codex":0.0015819526,"about_ca_system_score_gemma":0.0025757356,"threshold_uncertainty_score":0.23463768},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09313151,0.0024466505,0.14863099,0.028428731,0.0016448403,0.00017902406,0.0011623612,0.00088610797,0.72348976],"genre_scores_gemma":[0.9475743,0.0005528672,0.026494233,0.0056190197,0.00046081387,0.00018070107,0.0003223822,0.0007780989,0.018017575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934156,0.0023882864,0.0003491747,0.0021781917,0.0011467957,0.0005218211],"domain_scores_gemma":[0.9929142,0.0031250026,0.00051629957,0.0018266219,0.0013590778,0.0002588177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053794985,0.0009007916,0.0013312681,0.0016543263,0.0044082943,0.005860105,0.0016930915,0.0035689417,0.027744701],"category_scores_gemma":[0.014900973,0.00081296876,0.0010184728,0.0012670459,0.01446366,0.026960643,0.0052378923,0.006239538,0.003296537],"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.00008163298,0.000016437674,0.0003117302,0.000110684654,0.000023988128,0.00010631444,0.0019880137,0.00006154991,0.0012887735,0.9852887,0.0027789827,0.007943217],"study_design_scores_gemma":[0.000032634587,0.00007281126,0.0013773636,0.00013537669,0.00006069266,0.0007798568,0.0025272241,0.00068047567,0.0024844923,0.9136727,0.07811242,0.000063944004],"about_ca_topic_score_codex":0.0015586651,"about_ca_topic_score_gemma":0.0016014125,"teacher_disagreement_score":0.027744701,"about_ca_system_score_codex":0.0024130691,"about_ca_system_score_gemma":0.0009918512,"threshold_uncertainty_score":0.09281528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77742803,0.0015809687,0.16732018,0.007639723,0.00020370662,0.00017611272,0.004398221,0.001297156,0.039955866],"genre_scores_gemma":[0.96339834,0.0003764127,0.02812651,0.00022997888,0.000247913,0.00008316471,0.001857499,0.00018236983,0.0054977722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978283,0.00060216,0.00011609656,0.0005067621,0.0004975874,0.00044914705],"domain_scores_gemma":[0.97541374,0.02053291,0.0011766766,0.0015216301,0.0005985353,0.000756561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019905781,0.000548911,0.0011336553,0.0016013195,0.0015093825,0.0063383416,0.0024715224,0.0013974081,0.013480497],"category_scores_gemma":[0.021284949,0.0005213142,0.0013066658,0.002095127,0.002540474,0.010253416,0.002031308,0.0023413731,0.0006981083],"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.0015040007,0.00039551384,0.023227729,0.00082904805,0.00031568226,0.00043844405,0.0010328202,0.1395615,0.0048960415,0.705335,0.02231122,0.100153014],"study_design_scores_gemma":[0.00007274405,0.000035415986,0.0027851323,0.000036284353,0.000061611914,0.00021941299,0.00020666269,0.2098204,0.001992251,0.7825883,0.002154203,0.000027552842],"about_ca_topic_score_codex":0.0054327166,"about_ca_topic_score_gemma":0.008456627,"teacher_disagreement_score":0.013480497,"about_ca_system_score_codex":0.003871601,"about_ca_system_score_gemma":0.0022523263,"threshold_uncertainty_score":0.045096695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27392304,0.0018992155,0.51915485,0.013140445,0.0005238249,0.00067809154,0.0025974663,0.0023568268,0.18572627],"genre_scores_gemma":[0.8746204,0.0020015284,0.07776812,0.002511322,0.00033669162,0.0004941371,0.0031130677,0.00047332566,0.03868152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973236,0.00038851038,0.00013830468,0.0006821796,0.00075821043,0.00070932537],"domain_scores_gemma":[0.99038976,0.0073945015,0.00051912,0.00055828365,0.00065250054,0.00048582396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182272,0.0011745817,0.0017284901,0.0006343821,0.0025810834,0.005760697,0.0016195709,0.0029163945,0.011087897],"category_scores_gemma":[0.008331487,0.000848594,0.0016626179,0.0014340114,0.0039516143,0.007130048,0.003480246,0.0053262855,0.0020131357],"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.00072399696,0.00054786983,0.0014720995,0.0011297844,0.00019349228,0.0011009041,0.00084859785,0.111703776,0.015053161,0.79447114,0.025648963,0.04710615],"study_design_scores_gemma":[0.00012691187,0.00004979096,0.00020834923,0.000028111377,0.000025870706,0.00023553804,0.00012864493,0.06689877,0.004000353,0.9219548,0.0063166064,0.000026312115],"about_ca_topic_score_codex":0.004269189,"about_ca_topic_score_gemma":0.005100895,"teacher_disagreement_score":0.011087897,"about_ca_system_score_codex":0.0022085547,"about_ca_system_score_gemma":0.0036891233,"threshold_uncertainty_score":0.037092686},"labels":[],"label_agreement":null}]}