{"meta":{"query_hash":"5ae1aa9a649f","filters":{"venue":"Computability"},"cohort_total":9,"direct_labels_cover":0,"predictions_cover":9,"exported":9,"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/5ae1aa9a649f","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Research Foundation of The City University of New York; Isaac Newton Institute for Mathematical Sciences; City University of New York; Simons Foundation; National Science Foundation","keywords":"Mathematics; Equivalence relation; Computable analysis; Hierarchy; Borel hierarchy; Equivalence (formal languages); Natural number; Isomorphism (crystallography); Computable function; Discrete mathematics; Pure mathematics; Algebra over a field; Borel measure","score_opus":0.03527172603760496,"score_gpt":0.2774204450242962,"score_spread":0.24214871898669124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636748716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6486561,0.0010027881,0.3307816,0.010486019,0.003672619,0.0012899867,0.000012134249,0.00041367294,0.0036850842],"genre_scores_gemma":[0.984874,0.000006964977,0.014394189,0.00035018026,0.0002085176,0.000034116463,0.0000030618185,0.000016833495,0.000112153364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9945852,0.0014943441,0.0009329664,0.000978104,0.0009804446,0.0010289113],"domain_scores_gemma":[0.9868578,0.008198997,0.00035895073,0.0038683112,0.00045484686,0.000261141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062242113,0.00039825126,0.00045905577,0.00007203529,0.0011333998,0.00022125435,0.0031792729,0.00012964192,0.000052809],"category_scores_gemma":[0.0012227996,0.00023869917,0.0003539963,0.0012983623,0.001400927,0.00068687316,0.0017668213,0.0009108739,0.00009866742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009141574,0.002557365,0.06658769,0.000101748854,0.00016119807,0.0000017017011,0.003981337,0.033448942,0.0002618583,0.81648386,0.0043585724,0.071964316],"study_design_scores_gemma":[0.00044647587,0.000204368,0.40571487,0.000043002583,0.000025482579,0.00003172381,0.00024402379,0.37606433,0.00091343164,0.21193062,0.0037833212,0.00059833564],"about_ca_topic_score_codex":0.00013037544,"about_ca_topic_score_gemma":0.000022936172,"teacher_disagreement_score":0.6045532,"about_ca_system_score_codex":0.0004411922,"about_ca_system_score_gemma":0.00027553263,"threshold_uncertainty_score":0.97338694},"labels":[],"label_agreement":null},{"id":"W2193061249","doi":"10.3233/com-180087","title":"Notions of semicomputability in topological algebras over the reals","year":2018,"lang":"en","type":"article","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Topology (electrical circuits); Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.026022149103863683,"score_gpt":0.29359695994168933,"score_spread":0.26757481083782564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193061249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70508075,0.00007761255,0.2905868,0.0013889882,0.0007945384,0.000637851,0.000009251361,0.000235516,0.0011886994],"genre_scores_gemma":[0.9692721,0.000003237037,0.030095406,0.00033894298,0.00024494276,0.000021328735,0.0000026104533,0.000011875747,0.000009561598],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9949235,0.001149772,0.0012165612,0.0013459424,0.000637882,0.0007263933],"domain_scores_gemma":[0.9940721,0.002067482,0.00028428886,0.0028938379,0.00049839786,0.00018388676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035123257,0.00038459024,0.00071879185,0.00016001517,0.00024848685,0.00011423323,0.0029313988,0.00022663246,0.00020954122],"category_scores_gemma":[0.0008904217,0.0002746245,0.0003021006,0.0017807592,0.0019466147,0.00039477233,0.0022795731,0.0005534767,0.00006031792],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010263772,0.004692575,0.6943557,0.00018678664,0.00007948034,0.000020443535,0.0057978667,0.0034846393,0.0012831708,0.18028271,0.0008012932,0.108912684],"study_design_scores_gemma":[0.00037323288,0.00025040464,0.70564204,0.000014330901,0.000005705327,0.000016221775,0.00002872046,0.13683318,0.0005242745,0.15557341,0.00049023406,0.00024822427],"about_ca_topic_score_codex":0.00048603694,"about_ca_topic_score_gemma":0.00026407177,"teacher_disagreement_score":0.26419136,"about_ca_system_score_codex":0.0002970574,"about_ca_system_score_gemma":0.00023787846,"threshold_uncertainty_score":0.9999706},"labels":[],"label_agreement":null},{"id":"W2624980959","doi":"10.3233/com-170077","title":"Analog networks on function data streams","year":2017,"lang":"en","type":"article","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"STREAMS; Computer science; Function (biology); Computer network; Biology","score_opus":0.09265075167930224,"score_gpt":0.318223643316189,"score_spread":0.22557289163688676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624980959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060486153,0.000092536204,0.93021375,0.0012815882,0.0034551504,0.0004542337,0.000021433456,0.0005892612,0.003405921],"genre_scores_gemma":[0.98097014,0.0000058413884,0.018006125,0.00030251127,0.0006074537,0.000010012137,0.000046948597,0.000016253964,0.000034696925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603677,0.00030410514,0.00050949916,0.0019755322,0.000549874,0.00062423415],"domain_scores_gemma":[0.98620194,0.0005196257,0.00033730586,0.012454847,0.00021191793,0.0002743678],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019101244,0.00037072194,0.00046220684,0.00007948974,0.0010674888,0.0010658728,0.007974058,0.00017594104,0.000048566784],"category_scores_gemma":[0.0005809686,0.00033921035,0.00014109671,0.0002411496,0.00037417372,0.0013198255,0.0060490295,0.0005118826,0.00012068418],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043791242,0.0007251599,0.040116325,0.000026838577,0.0000483298,0.00001959861,0.00006439688,0.019365309,0.000007342838,0.009799968,0.0025201465,0.9272628],"study_design_scores_gemma":[0.00030068774,0.00020156428,0.30397412,0.000011268647,0.000009873058,0.0000061714,0.0000029867815,0.67562073,0.000010831091,0.017158788,0.002444567,0.00025838581],"about_ca_topic_score_codex":0.00020639806,"about_ca_topic_score_gemma":0.00012132452,"teacher_disagreement_score":0.9270044,"about_ca_system_score_codex":0.00016665184,"about_ca_system_score_gemma":0.00012237442,"threshold_uncertainty_score":0.9999711},"labels":[],"label_agreement":null},{"id":"W2799054834","doi":"10.3233/com-180094","title":"The reverse mathematics of Hindman’s Theorem for sums of exactly two elements","year":2018,"lang":"en","type":"preprint","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Reverse mathematics; Combinatorics; Computability; Ramsey's theorem; Discrete mathematics; Diagonal; Function (biology); Axiom","score_opus":0.04319915243120117,"score_gpt":0.3186231787592454,"score_spread":0.27542402632804425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799054834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21624419,0.00020759371,0.77700585,0.0003737373,0.0025423865,0.0028210317,0.00013163305,0.0001833467,0.00049024186],"genre_scores_gemma":[0.6103521,0.000016131888,0.38914958,0.000039865685,0.00024271035,0.000114478,0.00001797419,0.000034466775,0.000032712254],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940574,0.0005736668,0.0022593597,0.0014454129,0.00096980063,0.0006943241],"domain_scores_gemma":[0.9874045,0.0035735127,0.001860576,0.005311267,0.0016811377,0.00016897416],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.006995123,0.00062141824,0.0013203066,0.00013007138,0.00026401228,0.00017821987,0.0057836883,0.00029998965,0.000024786696],"category_scores_gemma":[0.0012606216,0.00046731453,0.00077794655,0.00038821198,0.0011763646,0.00016409757,0.0075654276,0.0005702606,0.00000936446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056612294,0.009825309,0.036307618,0.019769287,0.0022936168,0.000012275228,0.0230359,0.017325602,0.0013961733,0.40625557,0.0105968015,0.47261575],"study_design_scores_gemma":[0.0006533589,0.00027704638,0.0033723712,0.00016066487,0.000060434657,0.000004258114,0.00006258108,0.41216347,0.0025901992,0.579317,0.00091854617,0.00042006455],"about_ca_topic_score_codex":0.00010386873,"about_ca_topic_score_gemma":0.000049878818,"teacher_disagreement_score":0.47219568,"about_ca_system_score_codex":0.00030742105,"about_ca_system_score_gemma":0.00058573956,"threshold_uncertainty_score":0.99977785},"labels":[],"label_agreement":null},{"id":"W2803334365","doi":"10.3233/com-190254","title":"Degrees of categoricity above limit ordinals","year":2019,"lang":"en","type":"preprint","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Mathematics; Omega; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.04016338934134797,"score_gpt":0.2745719021321681,"score_spread":0.23440851279082012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803334365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25814903,0.0008811067,0.73223716,0.00074671936,0.0043711145,0.0015791687,0.000073219024,0.00062448793,0.0013379706],"genre_scores_gemma":[0.8578763,0.00002597795,0.14154644,0.00007884436,0.00028187482,0.000047556703,0.00002845499,0.00004007297,0.000074495045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99183553,0.0009550862,0.001860644,0.0030727675,0.0013006129,0.0009753321],"domain_scores_gemma":[0.9886573,0.0016832441,0.0011703068,0.0067252284,0.0014079738,0.00035597794],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002806336,0.0010214949,0.0022129777,0.0003506809,0.00014270066,0.00034748364,0.006743902,0.0008197298,0.00008859342],"category_scores_gemma":[0.00066374795,0.0009909043,0.0009763372,0.00096546556,0.0005111647,0.00039185508,0.015079562,0.001710511,0.00014041585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008198328,0.003439804,0.1421054,0.0042297808,0.0004399811,0.00004059856,0.0029905865,0.72503275,0.00013391476,0.022256438,0.0022059313,0.097042836],"study_design_scores_gemma":[0.00044997782,0.00026897137,0.20156811,0.00011879544,0.000052607855,0.000019202864,0.000024730638,0.7284974,0.0005135138,0.06684737,0.00058548246,0.0010538155],"about_ca_topic_score_codex":0.0011862672,"about_ca_topic_score_gemma":0.00007140231,"teacher_disagreement_score":0.5997273,"about_ca_system_score_codex":0.0006328699,"about_ca_system_score_gemma":0.0011664366,"threshold_uncertainty_score":0.99925417},"labels":[],"label_agreement":null},{"id":"W2955383720","doi":"10.3233/com-190289","title":"Degrees of bi-embeddable categoricity","year":2020,"lang":"en","type":"article","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Successor cardinal; Spectrum (functional analysis); Limit (mathematics); Turing; Set (abstract data type)","score_opus":0.04294599199195734,"score_gpt":0.2437251270631677,"score_spread":0.20077913507121037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955383720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21565455,0.00021569751,0.7797096,0.0018567422,0.00046449326,0.00039687697,0.000008768324,0.00054877804,0.0011445339],"genre_scores_gemma":[0.8728063,0.000003327687,0.12675865,0.00026297432,0.00013658634,0.000008960362,0.000002936981,0.000012494889,0.00000775402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966495,0.0003313634,0.0007654241,0.0011432274,0.00058917864,0.0005212956],"domain_scores_gemma":[0.997012,0.00053688436,0.00023756309,0.0014160231,0.00040915818,0.00038834705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080651534,0.00032581805,0.00067511917,0.0000746599,0.00013008501,0.00010610079,0.0023367365,0.00012584949,0.00008303337],"category_scores_gemma":[0.00048053593,0.00030408942,0.00026145126,0.0013507984,0.00028374727,0.0004695447,0.0017663023,0.0003297486,0.000085919906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017202678,0.0041112727,0.28253394,0.0017498718,0.0002564613,0.000090486596,0.012352575,0.21414182,0.0041910796,0.10870756,0.005953658,0.36573923],"study_design_scores_gemma":[0.000443394,0.00033176714,0.0794947,0.00000771082,0.000010819827,0.000009875005,0.00003053561,0.90141195,0.0024770761,0.013815968,0.001577662,0.00038852086],"about_ca_topic_score_codex":0.00024241621,"about_ca_topic_score_gemma":0.00001754926,"teacher_disagreement_score":0.68727016,"about_ca_system_score_codex":0.000114985814,"about_ca_system_score_gemma":0.0002317351,"threshold_uncertainty_score":0.9999411},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.21469796193972465,"score_gpt":0.3506742310641226,"score_spread":0.13597626912439795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289539466","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001686008,0.0004970086,0.09910042,0.00015499287,0.00068223116,0.0007019754,0.0003454856,0.0003378588,0.89649403],"genre_scores_gemma":[0.023474146,0.00003067868,0.09638711,0.000036501286,0.00039919082,0.000025197574,0.00014446348,0.00020074606,0.87930197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765575,0.00005529916,0.0010003538,0.00053417473,0.00050986104,0.00024456144],"domain_scores_gemma":[0.9963593,0.0012809195,0.00045496828,0.001265403,0.0005151358,0.00012425684],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035601118,0.00040190035,0.0012252112,0.000080448124,0.0000946372,0.000025809546,0.00031297913,0.00032874834,0.0037477736],"category_scores_gemma":[0.0007610468,0.00040300228,0.00051710074,0.000049109487,0.0012091992,0.00007770189,0.0004918546,0.0005438861,0.00011871941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007642863,0.00017005527,0.000009911066,0.0014943713,0.0000985642,0.000007673739,0.000070299895,0.0000059656068,0.000011816558,0.99568814,0.002015639,0.00041994185],"study_design_scores_gemma":[0.0001509855,0.000037001126,0.000043683813,0.00033172796,0.00014384986,0.000017575761,0.00003578068,0.00018072726,0.00007157105,0.99064416,0.008034454,0.00030850226],"about_ca_topic_score_codex":0.0000054718134,"about_ca_topic_score_gemma":0.000042777483,"teacher_disagreement_score":0.021788139,"about_ca_system_score_codex":0.0001648832,"about_ca_system_score_gemma":0.00013900187,"threshold_uncertainty_score":0.99984217},"labels":[],"label_agreement":null},{"id":"W4304207945","doi":"10.3233/com-220430","title":"Strong computable type","year":2023,"lang":"en","type":"preprint","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Type (biology); Computable general equilibrium; Economics; Mathematics; Mathematical economics; Geology; Microeconomics","score_opus":0.11515124556131903,"score_gpt":0.3219876803719497,"score_spread":0.20683643481063066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304207945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04882957,0.0005726046,0.9240305,0.0019169842,0.015708722,0.0017169977,0.000063322586,0.00565723,0.0015040826],"genre_scores_gemma":[0.77468354,0.000033128497,0.2231352,0.00025578256,0.0011024999,0.00009649379,0.00015092701,0.00013806325,0.00040434813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910068,0.00085204194,0.0015017169,0.0038499255,0.0013114933,0.0014780145],"domain_scores_gemma":[0.9902623,0.0012894392,0.00056255545,0.006272368,0.0010422316,0.0005710691],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0027588117,0.001134132,0.0016426927,0.00041180887,0.00038424422,0.0011289169,0.006914496,0.0008098005,0.00008585218],"category_scores_gemma":[0.0005756549,0.0011887209,0.00065970654,0.0016778655,0.00041398095,0.00043062947,0.023086753,0.002357081,0.0011131502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005821725,0.0021281068,0.028342336,0.002091215,0.00049767847,0.00024679225,0.0018026329,0.7719208,0.000045389694,0.031681444,0.020777822,0.14040753],"study_design_scores_gemma":[0.00033777524,0.00015596424,0.028578289,0.000100315265,0.000029467456,0.000018822235,0.000014861027,0.7980303,0.00005278827,0.1684329,0.0031703229,0.0010781526],"about_ca_topic_score_codex":0.0004907516,"about_ca_topic_score_gemma":0.000062133,"teacher_disagreement_score":0.725854,"about_ca_system_score_codex":0.0008785472,"about_ca_system_score_gemma":0.0011823627,"threshold_uncertainty_score":0.9999445},"labels":[],"label_agreement":null},{"id":"W4387975997","doi":"10.3233/com-210349","title":"Enumerations of families closed under finite differences","year":2023,"lang":"en","type":"article","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Enumeration; Degree (music); Set (abstract data type); Finite set; Discrete mathematics; Family of sets; Combinatorics; Computer science","score_opus":0.04640201935667268,"score_gpt":0.272476377633765,"score_spread":0.2260743582770923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387975997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48512697,0.000048477545,0.51179034,0.0008788481,0.00068206125,0.00027873807,0.000016013937,0.00065853435,0.0005200337],"genre_scores_gemma":[0.97889096,0.000013746369,0.020824974,0.00009524534,0.00007686325,0.000024884988,0.000012029425,0.000010220689,0.00005105046],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9972005,0.00035491234,0.00064832915,0.00081656454,0.0005281402,0.00045154977],"domain_scores_gemma":[0.99597895,0.0020082581,0.000158533,0.0014119846,0.00030313813,0.00013916042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087836006,0.00026057745,0.0004817844,0.00024261721,0.00022472454,0.00013127658,0.0014369509,0.000108192085,0.0000443077],"category_scores_gemma":[0.0003669817,0.00023695565,0.00020538928,0.0019031567,0.00036282185,0.00034165755,0.0010865143,0.00021958552,0.00012651984],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039249244,0.0023229832,0.30037037,0.0005581164,0.00023132522,0.00002734705,0.010216273,0.1313109,0.0021284819,0.18128286,0.0017891787,0.36972293],"study_design_scores_gemma":[0.00022153674,0.0000963146,0.4622932,0.000010180881,0.0000057211228,0.0000018825264,0.00008477146,0.4456547,0.00036896463,0.09084627,0.00020794786,0.00020853415],"about_ca_topic_score_codex":0.000101481295,"about_ca_topic_score_gemma":0.000050803486,"teacher_disagreement_score":0.493764,"about_ca_system_score_codex":0.00007292904,"about_ca_system_score_gemma":0.00018559449,"threshold_uncertainty_score":0.96627706},"labels":[],"label_agreement":null}]}