{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":9,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":9,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"5ae1aa9a649f","filters":{"venue":"Computability"}},"results":[{"id":"W1636748716","doi":"10.3233/com-2012-004","title":"The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility","year":2012,"lang":"en","type":"article","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Research Foundation of The City University of New York; Isaac Newton Institute for Mathematical Sciences; City University of New York; Simons Foundation; National Science Foundation","keywords":"Mathematics; Equivalence relation; Computable analysis; Hierarchy; Borel hierarchy; Equivalence (formal languages); Natural number; Isomorphism (crystallography); Computable function; Discrete mathematics; Pure mathematics; Algebra over a field; Borel measure","retraction":null,"screen_n_in":null,"score":{"opus":0.03527172603760496,"gpt":0.2774204450242962,"spread":0.2421487189866912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006224211,0.0003982513,0.0004590558,0.00007203529,0.0011334,0.0002212543,0.003179273,0.0001296419,0.000052809],"category_scores_gemma":[0.0012228,0.0002386992,0.0003539963,0.001298362,0.001400927,0.0006868732,0.001766821,0.0009108739,0.00009866742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004411922,"about_ca_system_score_gemma":0.0002755326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001303754,"about_ca_topic_score_gemma":0.00002293617,"domain_scores_codex":[0.9945852,0.001494344,0.0009329664,0.000978104,0.0009804446,0.001028911],"domain_scores_gemma":[0.9868578,0.008198997,0.0003589507,0.003868311,0.0004548469,0.000261141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00009141574,0.002557365,0.06658769,0.0001017489,0.0001611981,0.000001701701,0.003981337,0.03344894,0.0002618583,0.8164839,0.004358572,0.07196432],"study_design_scores_gemma":[0.0004464759,0.000204368,0.4057149,0.00004300258,0.00002548258,0.00003172381,0.0002440238,0.3760643,0.0009134316,0.2119306,0.003783321,0.0005983356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6486561,0.001002788,0.3307816,0.01048602,0.003672619,0.001289987,0.00001213425,0.0004136729,0.003685084],"genre_scores_gemma":[0.984874,0.000006964977,0.01439419,0.0003501803,0.0002085176,0.00003411646,0.000003061818,0.0000168335,0.0001121534],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6045532,"threshold_uncertainty_score":0.9733869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Successor cardinal; Spectrum (functional analysis); Limit (mathematics); Turing; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.04294599199195734,"gpt":0.2437251270631677,"spread":0.2007791350712104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008065153,0.0003258181,0.0006751192,0.0000746599,0.000130085,0.0001061008,0.002336737,0.0001258495,0.00008303337],"category_scores_gemma":[0.0004805359,0.0003040894,0.0002614513,0.001350798,0.0002837473,0.0004695447,0.001766302,0.0003297486,0.00008591991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001149858,"about_ca_system_score_gemma":0.0002317351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002424162,"about_ca_topic_score_gemma":0.00001754926,"domain_scores_codex":[0.9966495,0.0003313634,0.0007654241,0.001143227,0.0005891786,0.0005212956],"domain_scores_gemma":[0.997012,0.0005368844,0.0002375631,0.001416023,0.0004091582,0.000388347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001720268,0.004111273,0.2825339,0.001749872,0.0002564613,0.0000904866,0.01235257,0.2141418,0.00419108,0.1087076,0.005953658,0.3657392],"study_design_scores_gemma":[0.000443394,0.0003317671,0.0794947,0.00000771082,0.00001081983,0.000009875005,0.00003053561,0.901412,0.002477076,0.01381597,0.001577662,0.0003885209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2156546,0.0002156975,0.7797096,0.001856742,0.0004644933,0.000396877,0.000008768324,0.000548778,0.001144534],"genre_scores_gemma":[0.8728063,0.000003327687,0.1267586,0.0002629743,0.0001365863,0.000008960362,0.000002936981,0.00001249489,0.00000775402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6872702,"threshold_uncertainty_score":0.9999411,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"STREAMS; Computer science; Function (biology); Computer network; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.09265075167930224,"gpt":0.318223643316189,"spread":0.2255728916368868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001910124,0.0003707219,0.0004622068,0.00007948974,0.001067489,0.001065873,0.007974058,0.000175941,0.00004856678],"category_scores_gemma":[0.0005809686,0.0003392104,0.0001410967,0.0002411496,0.0003741737,0.001319826,0.00604903,0.0005118826,0.0001206842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001666518,"about_ca_system_score_gemma":0.0001223744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002063981,"about_ca_topic_score_gemma":0.0001213245,"domain_scores_codex":[0.9960368,0.0003041051,0.0005094992,0.001975532,0.000549874,0.0006242341],"domain_scores_gemma":[0.9862019,0.0005196257,0.0003373059,0.01245485,0.0002119179,0.0002743678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004379124,0.0007251599,0.04011633,0.00002683858,0.0000483298,0.00001959861,0.00006439688,0.01936531,0.000007342838,0.009799968,0.002520147,0.9272628],"study_design_scores_gemma":[0.0003006877,0.0002015643,0.3039741,0.00001126865,0.000009873058,0.0000061714,0.000002986782,0.6756207,0.00001083109,0.01715879,0.002444567,0.0002583858],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06048615,0.0000925362,0.9302137,0.001281588,0.00345515,0.0004542337,0.00002143346,0.0005892612,0.003405921],"genre_scores_gemma":[0.9809701,0.000005841388,0.01800613,0.0003025113,0.0006074537,0.00001001214,0.0000469486,0.00001625396,0.00003469692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9270044,"threshold_uncertainty_score":0.9999711,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02602214910386368,"gpt":0.2935969599416893,"spread":0.2675748108378256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003512326,0.0003845902,0.0007187919,0.0001600152,0.0002484868,0.0001142332,0.002931399,0.0002266325,0.0002095412],"category_scores_gemma":[0.0008904217,0.0002746245,0.0003021006,0.001780759,0.001946615,0.0003947723,0.002279573,0.0005534767,0.00006031792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002970574,"about_ca_system_score_gemma":0.0002378785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004860369,"about_ca_topic_score_gemma":0.0002640718,"domain_scores_codex":[0.9949235,0.001149772,0.001216561,0.001345942,0.000637882,0.0007263933],"domain_scores_gemma":[0.9940721,0.002067482,0.0002842889,0.002893838,0.0004983979,0.0001838868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001026377,0.004692575,0.6943557,0.0001867866,0.00007948034,0.00002044353,0.005797867,0.003484639,0.001283171,0.1802827,0.0008012932,0.1089127],"study_design_scores_gemma":[0.0003732329,0.0002504046,0.705642,0.0000143309,0.000005705327,0.00001622177,0.00002872046,0.1368332,0.0005242745,0.1555734,0.0004902341,0.0002482243],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7050807,0.00007761255,0.2905868,0.001388988,0.0007945384,0.000637851,0.000009251361,0.000235516,0.001188699],"genre_scores_gemma":[0.9692721,0.000003237037,0.03009541,0.000338943,0.0002449428,0.00002132873,0.000002610453,0.00001187575,0.000009561598],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2641914,"threshold_uncertainty_score":0.9999706,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04640201935667268,"gpt":0.272476377633765,"spread":0.2260743582770923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008783601,0.0002605774,0.0004817844,0.0002426172,0.0002247245,0.0001312766,0.001436951,0.0001081921,0.0000443077],"category_scores_gemma":[0.0003669817,0.0002369556,0.0002053893,0.001903157,0.0003628219,0.0003416575,0.001086514,0.0002195855,0.0001265198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007292904,"about_ca_system_score_gemma":0.0001855945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001014813,"about_ca_topic_score_gemma":0.00005080349,"domain_scores_codex":[0.9972005,0.0003549123,0.0006483292,0.0008165645,0.0005281402,0.0004515498],"domain_scores_gemma":[0.995979,0.002008258,0.000158533,0.001411985,0.0003031381,0.0001391604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00003924924,0.002322983,0.3003704,0.0005581164,0.0002313252,0.00002734705,0.01021627,0.1313109,0.002128482,0.1812829,0.001789179,0.3697229],"study_design_scores_gemma":[0.0002215367,0.0000963146,0.4622932,0.00001018088,0.000005721123,0.000001882526,0.00008477146,0.4456547,0.0003689646,0.09084627,0.0002079479,0.0002085342],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.485127,0.00004847754,0.5117903,0.0008788481,0.0006820612,0.0002787381,0.00001601394,0.0006585344,0.0005200337],"genre_scores_gemma":[0.978891,0.00001374637,0.02082497,0.00009524534,0.00007686325,0.00002488499,0.00001202943,0.00001022069,0.00005105046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.493764,"threshold_uncertainty_score":0.9662771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289539466","doi":"10.1007/978-3-030-83202-5_14","title":"Complexity of $${\\mathcal {P}}$$ Functions","year":2021,"lang":"en","type":"book-chapter","venue":"Computability","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Undecidable problem; Computer science; Decidability; Computable function; Theoretical computer science; Programmer; Programming language; Task (project management); Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2146979619397247,"gpt":0.3506742310641226,"spread":0.1359762691243979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003560112,0.0004019004,0.001225211,0.00008044812,0.0000946372,0.00002580955,0.0003129791,0.0003287483,0.003747774],"category_scores_gemma":[0.0007610468,0.0004030023,0.0005171007,0.00004910949,0.001209199,0.00007770189,0.0004918546,0.0005438861,0.0001187194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001648832,"about_ca_system_score_gemma":0.0001390019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005471813,"about_ca_topic_score_gemma":0.00004277748,"domain_scores_codex":[0.9976557,0.00005529916,0.001000354,0.0005341747,0.000509861,0.0002445614],"domain_scores_gemma":[0.9963593,0.00128092,0.0004549683,0.001265403,0.0005151358,0.0001242568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007642863,0.0001700553,0.000009911066,0.001494371,0.0000985642,0.000007673739,0.0000702999,0.000005965607,0.00001181656,0.9956881,0.002015639,0.0004199418],"study_design_scores_gemma":[0.0001509855,0.00003700113,0.00004368381,0.000331728,0.0001438499,0.00001757576,0.00003578068,0.0001807273,0.00007157105,0.9906442,0.008034454,0.0003085023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001686008,0.0004970086,0.09910042,0.0001549929,0.0006822312,0.0007019754,0.0003454856,0.0003378588,0.896494],"genre_scores_gemma":[0.02347415,0.00003067868,0.09638711,0.00003650129,0.0003991908,0.00002519757,0.0001444635,0.0002007461,0.879302],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02178814,"threshold_uncertainty_score":0.9998422,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Mathematics; Omega; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.04016338934134797,"gpt":0.2745719021321681,"spread":0.2344085127908201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002806336,0.001021495,0.002212978,0.0003506809,0.0001427007,0.0003474836,0.006743902,0.0008197298,0.00008859342],"category_scores_gemma":[0.000663748,0.0009909043,0.0009763372,0.0009654656,0.0005111647,0.0003918551,0.01507956,0.001710511,0.0001404159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006328699,"about_ca_system_score_gemma":0.001166437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001186267,"about_ca_topic_score_gemma":0.00007140231,"domain_scores_codex":[0.9918355,0.0009550862,0.001860644,0.003072768,0.001300613,0.0009753321],"domain_scores_gemma":[0.9886573,0.001683244,0.001170307,0.006725228,0.001407974,0.0003559779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008198328,0.003439804,0.1421054,0.004229781,0.0004399811,0.00004059856,0.002990586,0.7250327,0.0001339148,0.02225644,0.002205931,0.09704284],"study_design_scores_gemma":[0.0004499778,0.0002689714,0.2015681,0.0001187954,0.00005260785,0.00001920286,0.00002473064,0.7284974,0.0005135138,0.06684737,0.0005854825,0.001053815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.258149,0.0008811067,0.7322372,0.0007467194,0.004371115,0.001579169,0.00007321902,0.0006244879,0.001337971],"genre_scores_gemma":[0.8578763,0.00002597795,0.1415464,0.00007884436,0.0002818748,0.0000475567,0.00002845499,0.00004007297,0.00007449504],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5997273,"threshold_uncertainty_score":0.9992542,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Future Earth","funders":"","keywords":"Type (biology); Computable general equilibrium; Economics; Mathematics; Mathematical economics; Geology; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.115151245561319,"gpt":0.3219876803719497,"spread":0.2068364348106307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.002758812,0.001134132,0.001642693,0.0004118089,0.0003842442,0.001128917,0.006914496,0.0008098005,0.00008585218],"category_scores_gemma":[0.0005756549,0.001188721,0.0006597065,0.001677866,0.0004139809,0.0004306295,0.02308675,0.002357081,0.00111315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008785472,"about_ca_system_score_gemma":0.001182363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004907516,"about_ca_topic_score_gemma":0.000062133,"domain_scores_codex":[0.9910068,0.0008520419,0.001501717,0.003849925,0.001311493,0.001478015],"domain_scores_gemma":[0.9902623,0.001289439,0.0005625554,0.006272368,0.001042232,0.0005710691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005821725,0.002128107,0.02834234,0.002091215,0.0004976785,0.0002467922,0.001802633,0.7719208,0.00004538969,0.03168144,0.02077782,0.1404075],"study_design_scores_gemma":[0.0003377752,0.0001559642,0.02857829,0.0001003153,0.00002946746,0.00001882223,0.00001486103,0.7980303,0.00005278827,0.1684329,0.003170323,0.001078153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04882957,0.0005726046,0.9240305,0.001916984,0.01570872,0.001716998,0.00006332259,0.00565723,0.001504083],"genre_scores_gemma":[0.7746835,0.0000331285,0.2231352,0.0002557826,0.0011025,0.00009649379,0.000150927,0.0001380632,0.0004043481],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.725854,"threshold_uncertainty_score":0.9999445,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Reverse mathematics; Combinatorics; Computability; Ramsey's theorem; Discrete mathematics; Diagonal; Function (biology); Axiom","retraction":null,"screen_n_in":null,"score":{"opus":0.04319915243120117,"gpt":0.3186231787592454,"spread":0.2754240263280442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.006995123,0.0006214182,0.001320307,0.0001300714,0.0002640123,0.0001782199,0.005783688,0.0002999897,0.0000247867],"category_scores_gemma":[0.001260622,0.0004673145,0.0007779466,0.000388212,0.001176365,0.0001640976,0.007565428,0.0005702606,0.00000936446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003074211,"about_ca_system_score_gemma":0.0005857396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001038687,"about_ca_topic_score_gemma":0.00004987882,"domain_scores_codex":[0.9940574,0.0005736668,0.00225936,0.001445413,0.0009698006,0.0006943241],"domain_scores_gemma":[0.9874045,0.003573513,0.001860576,0.005311267,0.001681138,0.0001689742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005661229,0.009825309,0.03630762,0.01976929,0.002293617,0.00001227523,0.0230359,0.0173256,0.001396173,0.4062556,0.0105968,0.4726157],"study_design_scores_gemma":[0.0006533589,0.0002770464,0.003372371,0.0001606649,0.00006043466,0.000004258114,0.00006258108,0.4121635,0.002590199,0.579317,0.0009185462,0.0004200645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2162442,0.0002075937,0.7770059,0.0003737373,0.002542387,0.002821032,0.000131633,0.0001833467,0.0004902419],"genre_scores_gemma":[0.6103521,0.00001613189,0.3891496,0.00003986568,0.0002427103,0.000114478,0.00001797419,0.00003446678,0.00003271225],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4721957,"threshold_uncertainty_score":0.9997779,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}