{"meta":{"query_hash":"62857203da34","filters":{"venue":"Journal of Symbolic Logic"},"cohort_total":102,"direct_labels_cover":0,"predictions_cover":102,"exported":102,"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/62857203da34","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Symbolic+Logic"},"results":[{"id":"W1504640313","doi":"10.2178/jsl/1174668397","title":"Bounding homogenous models","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Decidability; Bounding overwatch; Homogeneous; Mathematics; Peano axioms; Extension (predicate logic); Discrete mathematics; Combinatorics; Computer science; Physics; Artificial intelligence","score_opus":0.031414162483599004,"score_gpt":0.2687297140358942,"score_spread":0.23731555155229517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504640313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13855216,0.00092126033,0.8531438,0.0006790047,0.0013652378,0.0000998685,4.3394152e-7,0.00007482077,0.005163377],"genre_scores_gemma":[0.8916911,0.00004497444,0.107125014,0.00047204352,0.00059696485,6.138782e-7,1.3930357e-7,0.00001029082,0.00005886259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755996,0.00008764877,0.00082378584,0.00027408215,0.0006879475,0.0005666008],"domain_scores_gemma":[0.9980449,0.00028480857,0.00049557956,0.00050768285,0.00038343342,0.0002835838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002838134,0.00019854434,0.00043122348,0.00038112327,0.0001692485,0.000214114,0.0016477698,0.00010913429,0.000017650778],"category_scores_gemma":[0.00011454809,0.00015496729,0.00024964564,0.000652662,0.00008094174,0.00083267095,0.0003340221,0.00041905363,0.000026747746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008615601,0.0016900881,0.0035620038,0.000098440774,0.00027208021,0.0036073714,0.012695964,0.03242441,0.0073341224,0.5263402,0.0014732366,0.41041595],"study_design_scores_gemma":[0.0011217808,0.0009819474,0.010774421,0.000064762855,0.000037496,0.006273782,0.00025940445,0.07826738,0.001401924,0.89784694,0.0023908978,0.0005792942],"about_ca_topic_score_codex":0.000015206168,"about_ca_topic_score_gemma":0.000005605085,"teacher_disagreement_score":0.75313896,"about_ca_system_score_codex":0.000250211,"about_ca_system_score_gemma":0.00018321609,"threshold_uncertainty_score":0.6319383},"labels":[],"label_agreement":null},{"id":"W1563463685","doi":"10.1017/jsl.2014.86","title":"AN ALGEBRA WHOSE SUBALGEBRAS ARE CHARACTERIZED BY DENSITY","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Operator Algebra Research","field":"Mathematics","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":"Separable space; Bounded function; Algebra over a field; Operator (biology); Operator algebra; Group (periodic table)","score_opus":0.08715145666248021,"score_gpt":0.3704591595032994,"score_spread":0.2833077028408192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563463685","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.99349886,0.00047650427,0.004503706,0.00067016506,0.00024397252,0.0002745714,0.000011653389,0.000058684735,0.00026188782],"genre_scores_gemma":[0.99158454,0.00008238141,0.0068467436,0.00052022777,0.000627673,0.00000874442,0.0000044243957,0.00005608982,0.00026918246],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971032,0.00036417448,0.0007802781,0.00024701515,0.001000351,0.000504938],"domain_scores_gemma":[0.9967707,0.00020665303,0.0007507621,0.0004945678,0.0009992799,0.0007780431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001621156,0.00027392159,0.00078140997,0.00020252158,0.00010476522,0.00012860667,0.0006950453,0.00018244574,0.00014263396],"category_scores_gemma":[0.0010507022,0.00020573346,0.00016730868,0.00032206773,0.00012428309,0.0008215275,0.000103919585,0.00068500673,0.00009364948],"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.004882871,0.011288954,0.11537797,0.0010039738,0.0015844001,0.0063372357,0.012166051,0.00004254196,0.53546053,0.151224,0.1302745,0.030356947],"study_design_scores_gemma":[0.008740439,0.0027757091,0.013993457,0.00026832827,0.00022855203,0.0025340766,0.004057444,0.00017535576,0.04434212,0.91226864,0.009307546,0.0013083273],"about_ca_topic_score_codex":0.0000046069044,"about_ca_topic_score_gemma":0.0000050822373,"teacher_disagreement_score":0.7610446,"about_ca_system_score_codex":0.00024618837,"about_ca_system_score_gemma":0.0002550031,"threshold_uncertainty_score":0.8389567},"labels":[],"label_agreement":null},{"id":"W1625990916","doi":"10.2178/jsl.7803120","title":"Failure of Interpolation in Constant Domain Intuitionistic Logic","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","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":"Interpolation (computer graphics); Constant (computer programming); Intuitionistic logic; Domain (mathematical analysis); Property (philosophy); Algebra over a field","score_opus":0.012990061448293426,"score_gpt":0.23976073363406117,"score_spread":0.22677067218576774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625990916","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.42586228,0.0009898352,0.5403551,0.0031754586,0.00091697695,0.00039729,0.0000021546527,0.000048405913,0.028252486],"genre_scores_gemma":[0.9792448,0.000039646922,0.020350356,0.0002071136,0.00010574258,0.0000042520837,6.0237585e-7,0.0000049976575,0.0000424865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841815,0.0001564938,0.0007409488,0.00016265333,0.0002739051,0.00024786138],"domain_scores_gemma":[0.99850714,0.00016721994,0.000636193,0.00022938388,0.00035214593,0.00010790897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006066242,0.0001432402,0.00039901058,0.00032574456,0.00004878914,0.000104388586,0.00067445997,0.000105127125,0.00016854706],"category_scores_gemma":[0.000207507,0.00010052582,0.0001294168,0.00043222687,0.00012076026,0.0005545863,0.00012500335,0.00028832757,0.00006521142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019022387,0.00037426903,0.008162182,0.00006343134,0.000038650676,0.00015039473,0.003646474,0.000090825095,0.012708227,0.9676051,0.001928063,0.0052133603],"study_design_scores_gemma":[0.0012364873,0.00070054876,0.021410372,0.0002453886,0.00001503327,0.00086894043,0.00085000746,0.0050428677,0.0004969782,0.9684569,0.00042802823,0.00024843978],"about_ca_topic_score_codex":0.000028800541,"about_ca_topic_score_gemma":0.000019935655,"teacher_disagreement_score":0.5533825,"about_ca_system_score_codex":0.00009553418,"about_ca_system_score_gemma":0.00014241955,"threshold_uncertainty_score":0.40993237},"labels":[],"label_agreement":null},{"id":"W1731243857","doi":"10.1017/jsl.2015.76","title":"THE MODEL COMPANION OF DIFFERENTIAL FIELDS WITH FREE OPERATORS","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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; McMaster University","funders":"","keywords":"Lemma (botany); Mathematics; Differential algebra; Differential (mechanical device); Zero (linguistics); Algebra over a field; Model theory; Operator theory; Pure mathematics; Differential operator; Discrete mathematics; Physics","score_opus":0.02916451065974832,"score_gpt":0.2676404700721348,"score_spread":0.2384759594123865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1731243857","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.95701915,0.00007740698,0.040469125,0.0009654076,0.00014387831,0.00005622826,0.0000027926537,0.000006954582,0.0012590673],"genre_scores_gemma":[0.9985332,0.00005378923,0.0007707422,0.000044284287,0.00014041443,9.882424e-7,6.646746e-8,0.000009349822,0.00044716086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990245,0.000078920784,0.00039534314,0.00006313405,0.00028849952,0.00014957225],"domain_scores_gemma":[0.9986275,0.00050158065,0.00038024655,0.00026955528,0.00015983639,0.00006128998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044634537,0.00010175083,0.00027802534,0.000053526623,0.000080987265,0.000014073611,0.00041464006,0.00006816757,0.00009185196],"category_scores_gemma":[0.00025102688,0.000037978723,0.00010342246,0.0000831289,0.00012130452,0.00009349259,0.000061298415,0.00014975457,0.000003041687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005825451,0.00042083554,0.0029593427,0.00008081976,0.00042324315,0.000021953267,0.0013993949,0.00010755942,0.008894934,0.97436243,0.006561154,0.004185778],"study_design_scores_gemma":[0.0014337621,0.00036011182,0.0015524344,0.00015948461,0.00008691478,0.00013362519,0.00028698627,0.00014400444,0.0062844106,0.9893696,0.00007864938,0.00011002915],"about_ca_topic_score_codex":0.0000012250355,"about_ca_topic_score_gemma":0.0000030347405,"teacher_disagreement_score":0.041514065,"about_ca_system_score_codex":0.000018790439,"about_ca_system_score_gemma":0.0000507333,"threshold_uncertainty_score":0.15487275},"labels":[],"label_agreement":null},{"id":"W1847150082","doi":"10.1017/jsl.2016.14","title":"FRAÏSSÉ LIMITS OF C*-ALGEBRAS","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Operator Algebra Research","field":"Mathematics","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":"McMaster University; York University; University of Toronto","funders":"","keywords":"Homogeneity (statistics); Class (philosophy); Mathematics; Pure mathematics; Ultra high frequency; Algebra over a field; Matrix (chemical analysis); Computer science; Chemistry; Statistics; Telecommunications; Artificial intelligence","score_opus":0.09231600380510294,"score_gpt":0.3797142543628975,"score_spread":0.28739825055779455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847150082","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.9860998,0.00045256087,0.008615356,0.0014061768,0.00020367732,0.000133897,0.000005190001,0.00001854015,0.0030648264],"genre_scores_gemma":[0.986326,0.00023195082,0.01241285,0.000088175766,0.00026522417,0.000002085639,7.183997e-8,0.000026908712,0.0006467261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980838,0.000113603426,0.00074425,0.00011902209,0.0006379072,0.00030146822],"domain_scores_gemma":[0.99763477,0.0007955512,0.00054111687,0.00030578574,0.00055498065,0.00016777765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007753334,0.0001420297,0.0004962449,0.00022256446,0.000038712307,0.0000121279845,0.00046228606,0.00010362697,0.0004798229],"category_scores_gemma":[0.0021668868,0.0000754214,0.00018541816,0.0002386975,0.00013630623,0.0002650175,0.000067903144,0.0002390444,0.000055334745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030619846,0.0008249454,0.008365321,0.00026529154,0.00036760574,0.00027641893,0.0010164551,0.000009701282,0.342056,0.5978248,0.008854089,0.03983314],"study_design_scores_gemma":[0.0017024773,0.00073630817,0.00346906,0.00035565012,0.00004806977,0.00031606716,0.0002004519,0.000004505452,0.085115284,0.9064858,0.0013706557,0.00019565623],"about_ca_topic_score_codex":8.967906e-7,"about_ca_topic_score_gemma":0.0000014447864,"teacher_disagreement_score":0.30866098,"about_ca_system_score_codex":0.00008552807,"about_ca_system_score_gemma":0.00014664118,"threshold_uncertainty_score":0.5253724},"labels":[],"label_agreement":null},{"id":"W1953187029","doi":"10.1017/jsl.2015.35","title":"DIFFERENTIAL-ALGEBRAIC JET SPACES PRESERVE INTERNALITY TO THE CONSTANTS","year":2015,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Polynomial and algebraic computation","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":"Agence Nationale de la Recherche","keywords":"Jet (fluid); Differential (mechanical device); Mathematics; Variety (cybernetics); Counterexample; Algebraic number; Pure mathematics; Tangent; Space (punctuation); Differential algebraic geometry; Tangent space; Abstraction; Algebra over a field; Field (mathematics); Differential geometry; Constant (computer programming); Algebraic variety; Real algebraic geometry; Mathematical analysis; Geometry; Discrete mathematics; Differential equation; Computer science; Physics; Differential algebraic equation; Ordinary differential equation","score_opus":0.04827301547641893,"score_gpt":0.2961488694067869,"score_spread":0.24787585393036798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953187029","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.7316429,0.0009727805,0.24392833,0.016323373,0.0056887357,0.00038136815,0.000019417168,0.000060745428,0.0009823517],"genre_scores_gemma":[0.995376,0.000055695138,0.0024085953,0.00076041353,0.0012130195,0.000007050406,0.000002289705,0.000011710077,0.00016520693],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971498,0.00038605824,0.0008751242,0.00038730656,0.00084064656,0.0003610175],"domain_scores_gemma":[0.9968385,0.00019646426,0.0011555433,0.00075076893,0.0007017283,0.00035700685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011358146,0.00033966778,0.0006956874,0.0002485073,0.00009659907,0.00073755905,0.0036379048,0.00016908276,0.000040582505],"category_scores_gemma":[0.00039277915,0.00019236564,0.00030057784,0.00033560093,0.00008387267,0.00028065068,0.00298977,0.00095533626,0.00005304878],"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.0009383596,0.0025698112,0.016737228,0.0009638874,0.0037455633,0.0014133602,0.05178633,0.036219135,0.0028222436,0.24603537,0.3789254,0.2578433],"study_design_scores_gemma":[0.0019328156,0.0010990785,0.04785426,0.0013099172,0.00023333576,0.0008854927,0.00032811708,0.026075454,0.0015943763,0.9050057,0.012378663,0.0013027703],"about_ca_topic_score_codex":0.00011993973,"about_ca_topic_score_gemma":0.000037273214,"teacher_disagreement_score":0.65897036,"about_ca_system_score_codex":0.0001739195,"about_ca_system_score_gemma":0.0006776571,"threshold_uncertainty_score":0.78444433},"labels":[],"label_agreement":null},{"id":"W195377547","doi":"10.1017/jsl.2015.42","title":"SEPARABLY CLOSED FIELDS AND CONTRACTIVE ORE MODULES","year":2015,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Rings, Modules, and Algebras","field":"Mathematics","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":"Fonds De La Recherche Scientifique - FNRS","keywords":"Quantifier elimination; Valuation (finance); Mathematics; Pure mathematics; Group (periodic table); Field (mathematics); Algebra over a field; Discrete mathematics; Chemistry; Business; Accounting","score_opus":0.06938221709197587,"score_gpt":0.3261828666549754,"score_spread":0.25680064956299953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195377547","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.986753,0.0030238894,0.0016742762,0.001136613,0.0009744257,0.0002927649,0.000021245116,0.00003744005,0.006086386],"genre_scores_gemma":[0.991106,0.000951346,0.0058404314,0.0002656831,0.0013073419,0.0000063080774,0.0000038441094,0.000039742055,0.00047935412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787736,0.00014949792,0.0008805779,0.00028697684,0.00049667043,0.00030892776],"domain_scores_gemma":[0.9970047,0.00037546543,0.0014111804,0.000373266,0.00058028504,0.00025512752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010386612,0.0003727513,0.0011510578,0.00021397708,0.000067166184,0.00013091585,0.00043531103,0.0005565304,0.000042966487],"category_scores_gemma":[0.00086680916,0.00027410034,0.00028573695,0.00006193449,0.00012361698,0.00016325318,0.00028881108,0.0014497961,0.000012168632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023044797,0.004552922,0.0076800603,0.0066942605,0.008648466,0.00452746,0.047992356,0.0024421855,0.0033929038,0.5516766,0.3107235,0.049364798],"study_design_scores_gemma":[0.0010215215,0.00022330608,0.0027045046,0.00047055705,0.0002821571,0.00047199635,0.00051425194,0.00020329861,0.00033520575,0.9924838,0.00095064443,0.00033877415],"about_ca_topic_score_codex":0.000021338283,"about_ca_topic_score_gemma":0.000012429453,"teacher_disagreement_score":0.4408072,"about_ca_system_score_codex":0.00012067302,"about_ca_system_score_gemma":0.00026842122,"threshold_uncertainty_score":0.9999711},"labels":[],"label_agreement":null},{"id":"W1966379018","doi":"10.2178/jsl/1190150288","title":"A uniqueness theorem for iterations","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Functional Equations Stability Results","field":"Mathematics","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":"","keywords":"Uniqueness; Countable set; Transitive relation; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.14418527123896488,"score_gpt":0.3401671201379032,"score_spread":0.1959818488989383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966379018","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.577141,0.00071873295,0.3654918,0.018651579,0.0014438395,0.0013169565,0.000088996596,0.00012414248,0.03502299],"genre_scores_gemma":[0.9657378,0.000022800392,0.032496944,0.00024657155,0.00035302318,0.000017813602,0.0000017888359,0.00001444414,0.0011088124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898714,0.000068340334,0.0005115687,0.00008214623,0.0002204575,0.00013037866],"domain_scores_gemma":[0.99782234,0.0011024156,0.00030676872,0.00016749409,0.00053876225,0.00006224042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061187975,0.00008896584,0.00021685183,0.00012805828,0.000103374,0.00003698327,0.0001534334,0.000060756647,0.00032935134],"category_scores_gemma":[0.0021477547,0.000064522945,0.00016726714,0.00016964386,0.000046014342,0.00016944525,0.00001300846,0.00012293871,0.00001689103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057424517,0.00045593976,0.00012593064,0.00006626925,0.00007208842,0.0000050660824,0.0012369201,0.00019574948,0.0009513315,0.9850179,0.010134407,0.0016810013],"study_design_scores_gemma":[0.00080516323,0.00024517046,0.00019869031,0.00003812503,0.00005625388,0.0001671992,0.00015399355,0.002172237,0.0003264384,0.99093425,0.004809589,0.00009288666],"about_ca_topic_score_codex":7.7850416e-7,"about_ca_topic_score_gemma":0.000002685676,"teacher_disagreement_score":0.38859683,"about_ca_system_score_codex":0.00007991987,"about_ca_system_score_gemma":0.00003936161,"threshold_uncertainty_score":0.36061662},"labels":[],"label_agreement":null},{"id":"W1974655024","doi":"10.2178/jsl/1203350778","title":"Stable definability and generic relations","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Base (topology); Mathematics; Simple (philosophy); Set (abstract data type); Canonical form; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.0500061341841212,"score_gpt":0.3326570201686403,"score_spread":0.2826508859845191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974655024","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.9316572,0.00080285454,0.059142098,0.0003541733,0.00013952689,0.00005309648,8.6723264e-7,0.000012941694,0.007837256],"genre_scores_gemma":[0.9682911,0.000062254054,0.030858848,0.0001432293,0.00010568801,4.1163412e-7,1.7598866e-7,0.0000063372468,0.0005319735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926174,0.000055738874,0.00036107947,0.0000675664,0.000094666284,0.00015922352],"domain_scores_gemma":[0.9989136,0.00055468275,0.0002457128,0.00011181796,0.000100209414,0.000074012205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012960108,0.00006998944,0.00020439713,0.00008037162,0.00009433722,0.000005464077,0.00007639125,0.00008377229,0.00010577653],"category_scores_gemma":[0.0006625788,0.000051401865,0.000052696018,0.000099770776,0.00011932264,0.000115542134,0.00002397294,0.00022642485,0.000006394988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007967622,0.00015792149,0.013263941,0.000029356874,0.000044009375,0.000065118686,0.00086835964,0.000033253193,0.00085074623,0.9809371,0.0007665169,0.002903999],"study_design_scores_gemma":[0.0002587204,0.00008467418,0.01688783,0.00000843954,0.000032095573,0.0003756701,0.00036417617,0.0000068632326,0.000246485,0.9804973,0.001180186,0.000057586047],"about_ca_topic_score_codex":0.0000011276866,"about_ca_topic_score_gemma":0.0000046436676,"teacher_disagreement_score":0.036633898,"about_ca_system_score_codex":0.00004490559,"about_ca_system_score_gemma":0.000035083976,"threshold_uncertainty_score":0.20961072},"labels":[],"label_agreement":null},{"id":"W1975072530","doi":"10.1017/jsl.2013.6","title":"THE NON-AXIOMATIZABILITY OF O-MINIMALITY","year":2014,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Ultraproduct; Predicate (mathematical logic); Mathematics; Discrete mathematics; Field (mathematics); Lambda; Function (biology); Pure mathematics; Computer science; Programming language; Physics","score_opus":0.04777648843684087,"score_gpt":0.36554435307776717,"score_spread":0.3177678646409263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975072530","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.9536483,0.00084297353,0.033879478,0.0012443191,0.0016672263,0.00036018112,0.000015749314,0.000022546154,0.008319203],"genre_scores_gemma":[0.9915372,0.00022307466,0.007537895,0.00008556501,0.00041370688,0.000005846535,9.3891924e-7,0.000019070601,0.00017667362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971423,0.0005709619,0.0014792577,0.00018580559,0.000362031,0.00025963757],"domain_scores_gemma":[0.99316055,0.0026693908,0.0028073054,0.0008040354,0.00046723676,0.00009149095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045259586,0.0002574006,0.0010643011,0.000086941895,0.00013249204,0.00001807888,0.0009429442,0.00042848266,0.00006404467],"category_scores_gemma":[0.0030243436,0.00014637753,0.0005183741,0.00007255736,0.00062909693,0.000049660637,0.00041499364,0.0011715328,0.0000068713703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000824825,0.000982225,0.00342274,0.0026603977,0.0011641388,0.000059213027,0.0040916195,0.0005302554,0.0009602539,0.97261727,0.004672949,0.008014135],"study_design_scores_gemma":[0.00029853612,0.00014974744,0.0029908426,0.00016951254,0.0001365575,0.000091351256,0.00024814878,0.00008184224,0.00068231294,0.99464655,0.0003701569,0.00013443037],"about_ca_topic_score_codex":0.0000035618505,"about_ca_topic_score_gemma":0.00000388921,"teacher_disagreement_score":0.037888903,"about_ca_system_score_codex":0.00007869045,"about_ca_system_score_gemma":0.00020404873,"threshold_uncertainty_score":0.59691024},"labels":[],"label_agreement":null},{"id":"W1984336238","doi":"10.2178/jsl/1264433915","title":"Schnorr triviality and genericity","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Triviality; Corollary; Turing; Connection (principal bundle); Computer science; Mathematics; Pure mathematics; Programming language","score_opus":0.010843327650220754,"score_gpt":0.24386712989320267,"score_spread":0.23302380224298191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984336238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7273367,0.00022286318,0.26788035,0.0021172184,0.0015226973,0.00009097116,9.318094e-7,0.000056319306,0.0007719336],"genre_scores_gemma":[0.90857315,0.000034752098,0.090389065,0.00044004616,0.00052984356,0.0000011129978,1.0379503e-7,0.0000053393287,0.000026586651],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837136,0.00011665183,0.00054023514,0.00027326166,0.00041222599,0.00028623643],"domain_scores_gemma":[0.998397,0.0001774803,0.00039012555,0.0004966828,0.0002966037,0.00024212811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014723669,0.00016482694,0.00039316356,0.0001620788,0.00011544015,0.00019049722,0.0010966099,0.00012364813,0.000029790815],"category_scores_gemma":[0.0003378543,0.000120789155,0.00013742736,0.0003821609,0.00026709016,0.0004822451,0.00042975243,0.0006429181,0.000009442426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050133374,0.0012973471,0.06612915,0.000092582275,0.00014806139,0.00043942677,0.0020813171,0.00025600588,0.054406278,0.32545146,0.0020174729,0.5476308],"study_design_scores_gemma":[0.0023067882,0.0010776321,0.42933145,0.000029115783,0.000057577075,0.005081862,0.00006687412,0.036084168,0.0051614805,0.507913,0.012063103,0.0008269803],"about_ca_topic_score_codex":0.000015344962,"about_ca_topic_score_gemma":0.000007681983,"teacher_disagreement_score":0.5468038,"about_ca_system_score_codex":0.000036669087,"about_ca_system_score_gemma":0.00013931691,"threshold_uncertainty_score":0.49256387},"labels":[],"label_agreement":null},{"id":"W1984508128","doi":"10.2178/jsl/1146620159","title":"Morley degree in unidimensional compact complex spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Mathematics; Morphism; Degree (music); Dimension (graph theory); Rank (graph theory); Noetherian; Extension (predicate logic); Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Computer science","score_opus":0.11296977983110237,"score_gpt":0.35134482038173503,"score_spread":0.23837504055063266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984508128","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.9831142,0.000432929,0.0018153526,0.0013620091,0.00017720014,0.00007459952,0.0000032071114,0.00001732213,0.013003197],"genre_scores_gemma":[0.9902347,0.00001930507,0.008908315,0.00024025589,0.00021386762,3.797565e-7,0.0000016208215,0.000011406216,0.00037015587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987956,0.00014879853,0.00052402355,0.00009076477,0.00020673801,0.00023406517],"domain_scores_gemma":[0.9988123,0.0005175428,0.00038971927,0.00013003338,0.0000917406,0.000058656507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005399771,0.0001351622,0.00043455433,0.00019737291,0.000060026243,0.000010269512,0.00019022237,0.00009441262,0.00034033455],"category_scores_gemma":[0.00015817654,0.0000974513,0.000108655615,0.00014615327,0.00015270569,0.00011653887,0.00002499761,0.00033835552,0.000018380575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014138539,0.0005042988,0.013295475,0.000029369363,0.0000473682,0.00044974042,0.0002610655,0.0010290793,0.0059092743,0.9682886,0.009626284,0.0004180334],"study_design_scores_gemma":[0.0008852973,0.00011876121,0.046368666,0.000047238926,0.000021366719,0.0005939587,0.00029550536,0.000061657745,0.00047000425,0.9500191,0.0010030405,0.00011540289],"about_ca_topic_score_codex":0.000028886785,"about_ca_topic_score_gemma":0.00005285321,"teacher_disagreement_score":0.03307319,"about_ca_system_score_codex":0.000066874934,"about_ca_system_score_gemma":0.000048648908,"threshold_uncertainty_score":0.39739487},"labels":[],"label_agreement":null},{"id":"W1987301999","doi":"10.2307/2586526","title":"Pure-projective modules and positive constructibility","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Rings, Modules, and Algebras","field":"Mathematics","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 Manitoba","funders":"","keywords":"Countable set; Mathematics; Converse; Projective cover; Model theory; Pure mathematics; Algebraic number; Discrete mathematics; Quantifier elimination; Projective test; Algebra over a field; Projective space; Collineation; Mathematical analysis","score_opus":0.02901196460314802,"score_gpt":0.284749259398748,"score_spread":0.2557372947956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987301999","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.9924248,0.0003888849,0.0001777643,0.00034080035,0.0001116199,0.00013680987,0.00000933272,0.000019121138,0.0063909017],"genre_scores_gemma":[0.9934883,0.00023371234,0.005617811,0.00015388713,0.00029460163,0.0000011887623,5.251343e-7,0.000013487336,0.00019648163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878925,0.000109704546,0.0004686066,0.00017438782,0.00024622396,0.00021180429],"domain_scores_gemma":[0.9990069,0.0002354245,0.00029235598,0.00016808831,0.00017993948,0.00011728254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004949359,0.00016257576,0.00043968754,0.00009808108,0.00009847505,0.00004884168,0.00014973088,0.000093636256,0.0002118342],"category_scores_gemma":[0.00023301359,0.000116498704,0.00012579172,0.00010654685,0.00022906956,0.00023478619,0.0000263476,0.00029632685,0.000014280222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011596448,0.001997818,0.028937113,0.0005120752,0.0014666977,0.0010150713,0.026683552,0.00004887112,0.0074368217,0.6428514,0.0054560774,0.28243482],"study_design_scores_gemma":[0.00083306624,0.00030071367,0.040060878,0.00011285945,0.000086759144,0.0021115837,0.0009302739,0.00002977917,0.0018440312,0.95337266,0.00012474704,0.00019266165],"about_ca_topic_score_codex":0.000013812566,"about_ca_topic_score_gemma":0.000005281646,"teacher_disagreement_score":0.31052122,"about_ca_system_score_codex":0.000059945225,"about_ca_system_score_gemma":0.00005424964,"threshold_uncertainty_score":0.47506794},"labels":[],"label_agreement":null},{"id":"W1991083015","doi":"10.2307/2586561","title":"The real line in elementary submodels of set theory","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cardinality (data modeling); Mathematics; Topological space; Transitive closure; Transitive relation; Simple (philosophy); Closure (psychology); Axiom; Reachability; Real line; Discrete mathematics; Elementary theory; Set (abstract data type); Cardinal number (linguistics); Space (punctuation); Combinatorics; Computer science","score_opus":0.021729688863343078,"score_gpt":0.27613476911184864,"score_spread":0.25440508024850556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991083015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95806706,0.0010581375,0.033634838,0.0027513453,0.00044351522,0.00021265807,0.0000038213298,0.00002831964,0.003800336],"genre_scores_gemma":[0.9892203,0.00084446766,0.009271426,0.00032436487,0.00021802277,0.0000022484671,4.985231e-7,0.000006740848,0.00011188933],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976498,0.00041605023,0.0009228842,0.00019578393,0.00048546787,0.0003300373],"domain_scores_gemma":[0.9983143,0.00056522025,0.0003652319,0.0005015201,0.00015875502,0.00009496289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031113068,0.00014949168,0.00036954973,0.00014304805,0.000077880686,0.000059061902,0.0015756427,0.00006300345,0.000100949765],"category_scores_gemma":[0.000063980355,0.00009071252,0.00016676546,0.00047081348,0.0001323884,0.0003240239,0.00018731497,0.00034888572,0.000009719313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003180703,0.0009632592,0.009764587,0.000044185137,0.00014741284,0.0002904517,0.0054369336,0.022428574,0.0008035447,0.1350522,0.0007973834,0.8239534],"study_design_scores_gemma":[0.0015857017,0.0011637412,0.056706343,0.00007162871,0.000026057827,0.00040410282,0.00030426917,0.051317263,0.0007573392,0.88586694,0.0014970789,0.00029951494],"about_ca_topic_score_codex":0.000060768485,"about_ca_topic_score_gemma":0.00002799925,"teacher_disagreement_score":0.8236539,"about_ca_system_score_codex":0.000102549086,"about_ca_system_score_gemma":0.00014930405,"threshold_uncertainty_score":0.36991495},"labels":[],"label_agreement":null},{"id":"W1993915007","doi":"10.2178/jsl/1191333856","title":"The settling-time reducibility ordering","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Countable set; Mathematics; Combinatorics; Settling; Enumeration; Sequence (biology); Invariant (physics); Isomorphism (crystallography); Function (biology); Discrete mathematics; Physics; Crystallography; Chemistry; Mathematical physics","score_opus":0.014190568153691853,"score_gpt":0.26542623838567236,"score_spread":0.2512356702319805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993915007","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5381312,0.001379824,0.44717863,0.0065346328,0.0024780042,0.00024607277,7.0946254e-7,0.0001463551,0.003904627],"genre_scores_gemma":[0.95065856,0.000048748774,0.048027195,0.00036784387,0.0007416861,9.828982e-7,1.4105424e-7,0.000010802504,0.00014401131],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997352,0.00016879066,0.000946386,0.0003360194,0.0006478641,0.00054894935],"domain_scores_gemma":[0.99687374,0.0009788678,0.0005466413,0.0009073667,0.00047549343,0.00021790917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073950216,0.00019136231,0.00035781073,0.00013833644,0.00032028405,0.00025930683,0.0020478212,0.000093162365,0.000019552359],"category_scores_gemma":[0.0008240622,0.00011682533,0.00024039714,0.00063621375,0.00016309055,0.0003963272,0.00047142073,0.0004932403,0.000049605234],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017182517,0.0011340193,0.00873811,0.0000725783,0.00028901498,0.000756039,0.0049726125,0.0057442407,0.0141535895,0.052359395,0.0039581666,0.9076504],"study_design_scores_gemma":[0.0024723469,0.002054617,0.22844927,0.00015650495,0.000083410305,0.0059914878,0.0005869447,0.09995445,0.0072776144,0.61539036,0.036176275,0.0014067556],"about_ca_topic_score_codex":0.000010218265,"about_ca_topic_score_gemma":0.000005377417,"teacher_disagreement_score":0.9062437,"about_ca_system_score_codex":0.00020106645,"about_ca_system_score_gemma":0.0001890027,"threshold_uncertainty_score":0.47639987},"labels":[],"label_agreement":null},{"id":"W2003556994","doi":"10.2178/jsl/1129642120","title":"Elimination of imaginaries in expansions of o-minimal structures by generic sets","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Predicate (mathematical logic); Mathematics; Pure mathematics; Combinatorics; Algebra over a field; Computer science; Programming language","score_opus":0.032330397809530835,"score_gpt":0.3377230769247467,"score_spread":0.30539267911521584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003556994","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.99526674,0.0011215134,0.0021616833,0.000719038,0.00007845701,0.000055184788,0.000008394237,0.0000044168273,0.00058456254],"genre_scores_gemma":[0.98061395,0.00014402188,0.019048782,0.00007539151,0.000056408124,9.082315e-7,0.0000012007221,0.000007526202,0.000051825136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989553,0.00009371091,0.0005972027,0.00006606905,0.00016060386,0.00012710533],"domain_scores_gemma":[0.99884033,0.00026732028,0.0006138466,0.00010921416,0.000135432,0.00003386966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032811664,0.00009294934,0.00036513142,0.00017320261,0.000025410165,0.0000024588421,0.00015379941,0.000087180095,0.000098062636],"category_scores_gemma":[0.00035768002,0.000069717826,0.00007674971,0.00011898915,0.00018884573,0.00015645279,0.000025685682,0.00018741375,8.010133e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000565372,0.0011291006,0.0042920248,0.00026434896,0.00015843661,0.00005666204,0.012146397,0.0013707824,0.21947792,0.7322274,0.0042783255,0.024033254],"study_design_scores_gemma":[0.0008657939,0.00029362916,0.010809046,0.000056002988,0.000053579668,0.00018993099,0.0015494663,0.00008786348,0.04290071,0.9428791,0.00020838642,0.00010653626],"about_ca_topic_score_codex":0.0000019883437,"about_ca_topic_score_gemma":0.0000044561602,"teacher_disagreement_score":0.21065168,"about_ca_system_score_codex":0.000031605257,"about_ca_system_score_gemma":0.00004699286,"threshold_uncertainty_score":0.28430104},"labels":[],"label_agreement":null},{"id":"W2006341276","doi":"10.2178/jsl/1203350794","title":"An untyped higher order logic with Y combinator","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatory logic; Curry–Howard correspondence; sort; Type theory; Consistency (knowledge bases); Mathematics; Calculus (dental); Computer science; Programming language; Lambda calculus; Type (biology); Algebra over a field; Discrete mathematics; Arithmetic; Pure mathematics","score_opus":0.0223894031981917,"score_gpt":0.27143734407518133,"score_spread":0.24904794087698962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006341276","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.12459055,0.0011400458,0.84833276,0.0013973687,0.0026040121,0.00034153383,3.282911e-7,0.00021286483,0.021380521],"genre_scores_gemma":[0.9877836,0.000013760513,0.010514388,0.0008452575,0.00038057106,0.0000015371625,5.954826e-7,0.000013728292,0.00044654682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981173,0.00010628205,0.0005330105,0.0002467572,0.00054192985,0.0004547103],"domain_scores_gemma":[0.9981383,0.00007472344,0.0005464991,0.00044796718,0.0005084257,0.00028409358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013162639,0.00020407088,0.00039509908,0.0002157526,0.00012424613,0.00019065554,0.0010752289,0.00013417058,0.00005636702],"category_scores_gemma":[0.000028355946,0.00012100093,0.000091299225,0.0006455928,0.000080645346,0.00056551263,0.000066479515,0.0003173625,0.00006275043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000646149,0.0005185614,0.011268922,0.0000257351,0.00008463161,0.0007994437,0.00068154646,0.000057306283,0.000712067,0.9774673,0.00061348453,0.0077063804],"study_design_scores_gemma":[0.0083525,0.013651825,0.20163153,0.000074331474,0.0001727717,0.0060707387,0.00090218213,0.0008211256,0.0026044261,0.67657816,0.08728528,0.0018551028],"about_ca_topic_score_codex":0.000028555822,"about_ca_topic_score_gemma":0.000011288731,"teacher_disagreement_score":0.8631931,"about_ca_system_score_codex":0.000073548676,"about_ca_system_score_gemma":0.00013772084,"threshold_uncertainty_score":0.4934275},"labels":[],"label_agreement":null},{"id":"W2008731436","doi":"10.2178/jsl/1230396765","title":"Examining Fragments of the Quantified Propositional Calculus","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":27,"is_retracted":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; Axiom; Mathematical proof; Hierarchy; Calculus (dental); Propositional calculus; Propositional variable; Proof complexity; Connection (principal bundle); Propositional formula; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Intermediate logic; Theoretical computer science","score_opus":0.0541860406085994,"score_gpt":0.2498554769199531,"score_spread":0.1956694363113537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008731436","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.94773984,0.0006328444,0.03989581,0.00046210364,0.0011031195,0.00010677895,0.0000010454303,0.00001866696,0.010039788],"genre_scores_gemma":[0.99559647,0.000046261328,0.0036009839,0.0002080564,0.00019284654,0.0000012829275,1.8613147e-7,0.0000046389246,0.00034926133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985777,0.00012304707,0.00045498356,0.0001375155,0.0005061964,0.0002005282],"domain_scores_gemma":[0.99873155,0.00008990447,0.0005416094,0.0002726683,0.00028086413,0.00008340401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044065286,0.00011171567,0.00026322497,0.000094419636,0.00018336778,0.000027857917,0.0009992038,0.00006589404,0.000025410201],"category_scores_gemma":[0.00013205959,0.00006206572,0.00016059406,0.00032291608,0.00013529231,0.0002517078,0.00018434413,0.00023115224,0.000015359059],"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.00015713062,0.002865265,0.18229416,0.00019331154,0.00066719076,0.0011343413,0.03142737,0.0014538894,0.07340049,0.6716806,0.0155190015,0.019207228],"study_design_scores_gemma":[0.0034177203,0.0015133744,0.90740794,0.00043606886,0.0000892959,0.008294296,0.00038066224,0.006623406,0.032994423,0.03535335,0.002851436,0.00063800183],"about_ca_topic_score_codex":0.0000068418763,"about_ca_topic_score_gemma":8.766149e-7,"teacher_disagreement_score":0.7251138,"about_ca_system_score_codex":0.000048645667,"about_ca_system_score_gemma":0.00021002346,"threshold_uncertainty_score":0.25309667},"labels":[],"label_agreement":null},{"id":"W2009212476","doi":"10.2178/jsl/1294170990","title":"Computability of Fraïssé limits","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Countable set; Limit (mathematics); Mathematics; Computability; Pure mathematics; Quantifier (linguistics); Finitely-generated abelian group; Focus (optics); Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.06807033090625696,"score_gpt":0.25830321598898537,"score_spread":0.1902328850827284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009212476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5069215,0.0006229681,0.48397812,0.00061256974,0.0014777953,0.00020795777,0.0000022041327,0.000081491395,0.0060953433],"genre_scores_gemma":[0.85798514,0.000026674232,0.14155266,0.00023839375,0.00017400247,0.0000011307286,1.4283727e-7,0.000007982734,0.000013891385],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99710387,0.00029010908,0.0012448295,0.00033032076,0.0006598943,0.00037095885],"domain_scores_gemma":[0.9968936,0.0003440673,0.0009790977,0.00078432064,0.00076034723,0.00023857104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017770701,0.00022819822,0.000727016,0.00026175953,0.00006461751,0.000043096734,0.0020992996,0.00013030547,0.000097982695],"category_scores_gemma":[0.00033538876,0.00017269075,0.00035730505,0.00063774595,0.00020979857,0.0005196101,0.0004069485,0.00040758352,0.000023468741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032915303,0.010903039,0.18424913,0.00061043655,0.00078194175,0.0008873173,0.032820977,0.0027025726,0.008061343,0.29993123,0.0032030938,0.45551977],"study_design_scores_gemma":[0.0015300397,0.0026112036,0.53658384,0.00010654568,0.000064364154,0.0011516059,0.00020508145,0.0144936405,0.008862435,0.43301916,0.0007787586,0.00059330714],"about_ca_topic_score_codex":0.000034566194,"about_ca_topic_score_gemma":0.0000031393158,"teacher_disagreement_score":0.45492646,"about_ca_system_score_codex":0.000093639836,"about_ca_system_score_gemma":0.00021676428,"threshold_uncertainty_score":0.7042124},"labels":[],"label_agreement":null},{"id":"W2014032276","doi":"10.2178/jsl/1268917492","title":"Schnorr trivial sets and truth-table reducibility","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Table (database); Triviality; Ideal (ethics); Truth table; Mathematics; Computer science; Discrete mathematics; Pure mathematics; Algorithm; Epistemology; Data mining; Philosophy","score_opus":0.014138392930325094,"score_gpt":0.2619920865501573,"score_spread":0.24785369361983223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014032276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960694,0.00032012074,0.031651635,0.002259769,0.0033756217,0.00016957673,0.0000026373314,0.000085067906,0.0014415361],"genre_scores_gemma":[0.9302163,0.000028180006,0.06896233,0.00019154033,0.0005490412,0.000002041783,2.7184242e-7,0.000008604082,0.00004170964],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976787,0.00015435711,0.000738172,0.0004859606,0.0005185263,0.00042429994],"domain_scores_gemma":[0.99758786,0.0003916855,0.00046478317,0.00084214297,0.0003859884,0.0003275537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024399199,0.0002246582,0.00052598957,0.00022082141,0.00015876054,0.00027574535,0.0013075741,0.00017560222,0.00006067872],"category_scores_gemma":[0.0009626533,0.00016904579,0.00015904408,0.0005266386,0.00021546303,0.000773702,0.00048593924,0.00089888513,0.000016079915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019545069,0.002836567,0.049339104,0.00020614851,0.0002509453,0.0006660771,0.004286269,0.00046946396,0.044941813,0.1703675,0.0044047474,0.72203594],"study_design_scores_gemma":[0.0036409416,0.0016502136,0.24985373,0.00005994941,0.00007729657,0.006601914,0.0001478719,0.03646525,0.004080253,0.6897732,0.006672678,0.0009767051],"about_ca_topic_score_codex":0.000023198681,"about_ca_topic_score_gemma":0.000009516354,"teacher_disagreement_score":0.7210592,"about_ca_system_score_codex":0.00006145287,"about_ca_system_score_gemma":0.00028246536,"threshold_uncertainty_score":0.6893487},"labels":[],"label_agreement":null},{"id":"W2015878287","doi":"10.2178/jsl/1203350790","title":"The complexity of resolution refinements","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","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; Simon Fraser University","funders":"","keywords":"Resolution (logic); Computer science; Algorithm; Tree (set theory); Mathematics; Artificial intelligence; Combinatorics","score_opus":0.07207676306605637,"score_gpt":0.2981267113148954,"score_spread":0.226049948248839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015878287","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.03891532,0.002475575,0.9275208,0.0023515944,0.002360405,0.00021658855,3.8046957e-7,0.000042575135,0.026116768],"genre_scores_gemma":[0.9952252,0.000053338037,0.0042633903,0.00009507436,0.00020579502,4.5561183e-7,1.652771e-7,0.0000027887859,0.00015378947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985644,0.0000844813,0.00059877185,0.00009061177,0.00042299085,0.00023869323],"domain_scores_gemma":[0.9985884,0.000095491174,0.0006981337,0.00027163888,0.0002721663,0.000074170166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025909848,0.000077904304,0.00019524472,0.000085219915,0.00014742701,0.000055236073,0.0007931574,0.000048895843,0.0000046487194],"category_scores_gemma":[0.00010105731,0.00004288161,0.0001118489,0.0002636254,0.00017462032,0.00015331602,0.00010274141,0.0001541619,0.000010274838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002294774,0.00008404256,0.001592945,0.0000126972345,0.000034721925,0.000023754536,0.0004228584,0.00001088637,0.0007321701,0.97556543,0.0010233562,0.02047419],"study_design_scores_gemma":[0.0014370742,0.00129688,0.11026759,0.000031595442,0.00003310892,0.00067642424,0.0004862061,0.0009986773,0.0029389316,0.79087895,0.09068833,0.00026624516],"about_ca_topic_score_codex":0.000038185975,"about_ca_topic_score_gemma":0.00002355674,"teacher_disagreement_score":0.95630985,"about_ca_system_score_codex":0.00005043751,"about_ca_system_score_gemma":0.00005384974,"threshold_uncertainty_score":0.17486612},"labels":[],"label_agreement":null},{"id":"W2020046292","doi":"10.2178/jsl/1164060461","title":"Every 1-generic computes a properly 1-generic","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Algorithm","score_opus":0.022602612792350076,"score_gpt":0.22841434701812988,"score_spread":0.2058117342257798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020046292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3830142,0.004096388,0.6032061,0.0031002152,0.0025883734,0.00034135114,0.0000025311542,0.00025150093,0.0033993223],"genre_scores_gemma":[0.85320646,0.00005013325,0.14435504,0.0007024489,0.0014226533,0.000005467675,0.0000013103041,0.000020310894,0.00023620744],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967556,0.00023281868,0.0010834185,0.0004684504,0.00086342794,0.0005962617],"domain_scores_gemma":[0.99759775,0.00018754619,0.0007277893,0.00068777066,0.0005779242,0.00022121784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092966907,0.0003492485,0.00069276954,0.00038146545,0.00016356516,0.00031881,0.0021399232,0.00013490024,0.000031329586],"category_scores_gemma":[0.00007705146,0.0002534385,0.000365223,0.0011838904,0.00013992624,0.00072046893,0.00048130142,0.00041617392,0.000068868045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001611055,0.0074875425,0.03484639,0.00045441976,0.00065615517,0.004234448,0.0030742588,0.093034744,0.06566379,0.12723783,0.07200933,0.59114],"study_design_scores_gemma":[0.005507377,0.0051124287,0.31553718,0.00028341933,0.00020768816,0.014879465,0.00016971432,0.24071307,0.010787375,0.3577575,0.045868363,0.003176392],"about_ca_topic_score_codex":0.00006201701,"about_ca_topic_score_gemma":0.0000057635407,"teacher_disagreement_score":0.5879636,"about_ca_system_score_codex":0.00021991313,"about_ca_system_score_gemma":0.00034822003,"threshold_uncertainty_score":0.9999918},"labels":[],"label_agreement":null},{"id":"W2023468778","doi":"10.2307/2586525","title":"The anatytic conception of truth and the foundations of arithmetic","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Philosophy and Theoretical Science","field":"Psychology","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":"Mathematics; Cardinality (data modeling); Simple (philosophy); Axiom; Epistemology; Statement (logic); Operator (biology); Peano axioms; Infinity; Discrete mathematics; Philosophy; Computer science","score_opus":0.020551148357920223,"score_gpt":0.3135710641695807,"score_spread":0.2930199158116605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023468778","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.83220035,0.0011485906,0.00029971983,0.0048197373,0.00031057844,0.00010691683,0.0000027964065,0.0000028937466,0.1611084],"genre_scores_gemma":[0.99939567,0.00022527897,0.000043830514,0.00011854921,0.00009903384,0.000001377144,9.015519e-8,0.0000019639008,0.000114183924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991081,0.0002133729,0.0003521547,0.000057119418,0.00016655316,0.000102726575],"domain_scores_gemma":[0.9986613,0.0008359757,0.00025279855,0.0001331539,0.00007719431,0.000039623807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009863958,0.000049038095,0.00017033899,0.000031028907,0.000096254385,0.000013165618,0.00023141032,0.000034689223,0.0005474022],"category_scores_gemma":[0.00018731308,0.000021408732,0.00007753748,0.0001741232,0.0015157876,0.000049761835,0.000011730465,0.00013395923,0.000009686529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013879185,0.000045536042,0.00008781402,0.0000023126174,0.00002889762,0.000001498447,0.00087847986,0.000009988401,0.00008040018,0.9837338,0.000024095054,0.014968388],"study_design_scores_gemma":[0.0009827896,0.00023486938,0.021126574,0.000017620721,0.00005309919,0.000106315194,0.00040482616,0.000076213175,0.000049172613,0.9764783,0.00043798186,0.00003223745],"about_ca_topic_score_codex":0.000010482891,"about_ca_topic_score_gemma":8.290146e-7,"teacher_disagreement_score":0.16719534,"about_ca_system_score_codex":0.000007806149,"about_ca_system_score_gemma":0.000020682572,"threshold_uncertainty_score":0.599367},"labels":[],"label_agreement":null},{"id":"W2037065522","doi":"10.2178/jsl/1146620157","title":"Strongly minimal groups in the theory of compact complex spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Pure mathematics; Mathematics; Algebra over a field","score_opus":0.061570651158995515,"score_gpt":0.32794517579358484,"score_spread":0.2663745246345893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037065522","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.98459107,0.00041777876,0.002144883,0.0006895309,0.000088220186,0.00009604186,0.000004827131,0.0000068133104,0.011960828],"genre_scores_gemma":[0.99754816,0.000014947296,0.0020046576,0.0001165108,0.00020621365,6.2076896e-7,9.837145e-7,0.000008665727,0.000099225916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998463,0.0004519121,0.00058798795,0.0000729615,0.0002199727,0.00020419981],"domain_scores_gemma":[0.99773896,0.0013962282,0.0005960816,0.00017299432,0.00006925395,0.000026502734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015320323,0.00012499007,0.00043942517,0.0001302018,0.000051356856,0.0000100426005,0.0003726254,0.000079026926,0.00015234128],"category_scores_gemma":[0.00020607485,0.000070784445,0.00014664554,0.00013307511,0.00029794642,0.00010139515,0.00001960557,0.0003306892,0.000003980752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020469031,0.00035691154,0.004679081,0.000029103901,0.000034761077,0.00006506951,0.0012721806,0.0001878341,0.0011320239,0.99062264,0.0012665679,0.00014914185],"study_design_scores_gemma":[0.00066473766,0.0002407092,0.056397628,0.000033469885,0.000040169212,0.00028949315,0.0042016166,0.000017754304,0.00018628513,0.937617,0.00023786152,0.00007325403],"about_ca_topic_score_codex":0.000006501906,"about_ca_topic_score_gemma":0.00001488769,"teacher_disagreement_score":0.053005613,"about_ca_system_score_codex":0.000026694803,"about_ca_system_score_gemma":0.00003194565,"threshold_uncertainty_score":0.2886506},"labels":[],"label_agreement":null},{"id":"W2045810234","doi":"10.2178/jsl/1333566632","title":"A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Packing dimension; Hausdorff dimension; Effective dimension; Dimension (graph theory); Mathematics; Dimension function; Minkowski–Bouligand dimension; Combinatorics; Mathematical analysis; Fractal dimension; Fractal","score_opus":0.020407418884620655,"score_gpt":0.268995094939475,"score_spread":0.24858767605485432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045810234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91542053,0.00032017435,0.08130151,0.0002255107,0.001304444,0.0008952263,0.000011824335,0.0000647998,0.0004559477],"genre_scores_gemma":[0.973372,0.00015954797,0.025871383,0.0001000225,0.00045495614,0.000008884313,0.0000020642244,0.00002695375,0.0000041922594],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99490225,0.0012625643,0.0011965643,0.00053605257,0.0013459214,0.0007566399],"domain_scores_gemma":[0.99280953,0.0028442044,0.0022588652,0.00065578206,0.0010882244,0.00034336824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029420466,0.00048067246,0.0015021691,0.00060605013,0.00018626873,0.00007556295,0.00091291737,0.000251098,0.000005996757],"category_scores_gemma":[0.00030384053,0.00033277765,0.0005240653,0.00088660425,0.0002622393,0.0011331614,0.0009717738,0.00070139655,0.0000047204153],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016822553,0.006376719,0.18413225,0.0008291508,0.0019283746,0.00039126162,0.04628268,0.0027982194,0.47538918,0.035271965,0.000090767,0.24482717],"study_design_scores_gemma":[0.0021581713,0.003281806,0.818216,0.00091992225,0.00021962078,0.00035233708,0.0003293293,0.008370935,0.15704866,0.008600134,0.0000043779073,0.0004986998],"about_ca_topic_score_codex":0.00037187408,"about_ca_topic_score_gemma":0.000009170228,"teacher_disagreement_score":0.63408375,"about_ca_system_score_codex":0.00048300275,"about_ca_system_score_gemma":0.00013631074,"threshold_uncertainty_score":0.99991244},"labels":[],"label_agreement":null},{"id":"W2046430714","doi":"10.2178/jsl.7801100","title":"P-ideal dichotomy and weak squares","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Ideal (ethics); Uncountable set; Mathematics; Pure mathematics; Epistemology; Philosophy","score_opus":0.027925082784160733,"score_gpt":0.31015008418684115,"score_spread":0.2822250014026804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046430714","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.98608905,0.0008309095,0.0029864544,0.0011255055,0.00019104789,0.00011608388,9.540781e-7,0.000018639757,0.008641354],"genre_scores_gemma":[0.99210864,0.00015457835,0.0066265585,0.00029094095,0.00021657452,0.0000036046506,1.862832e-7,0.000010198592,0.00058872113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920464,0.000078325014,0.00035255973,0.00007425627,0.000119853874,0.00017036205],"domain_scores_gemma":[0.9990324,0.00037656128,0.0002824389,0.00010943135,0.000100446974,0.000098724115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031405163,0.00009980517,0.00029356466,0.00008513645,0.00006736674,0.000017510836,0.00013056908,0.000090143745,0.00048213758],"category_scores_gemma":[0.000303361,0.00006623164,0.00006671736,0.00005224894,0.00013883165,0.00019623023,0.00003424396,0.0002571469,0.0000379581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008140058,0.00028879667,0.0025244553,0.00007534913,0.00013517041,0.00007618466,0.0014437273,0.000004777697,0.002942607,0.96700853,0.012128991,0.013290008],"study_design_scores_gemma":[0.00077342056,0.00023434886,0.0029809747,0.00002750892,0.000029376688,0.00051645434,0.0006106415,0.000017751609,0.00019238045,0.99249357,0.0020427192,0.000080877646],"about_ca_topic_score_codex":0.0000034494744,"about_ca_topic_score_gemma":0.0000010430666,"teacher_disagreement_score":0.025485013,"about_ca_system_score_codex":0.00001565571,"about_ca_system_score_gemma":0.00002133248,"threshold_uncertainty_score":0.52790684},"labels":[],"label_agreement":null},{"id":"W2047577730","doi":"10.2307/2586538","title":"Coordinatisation and canonical bases in simple theories","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":76,"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; McMaster University","funders":"","keywords":"Simple (philosophy); Mathematics; Section (typography); Generalization; Pure mathematics; Categorical variable; Type (biology); Equivalence (formal languages); Canonical form; Algebra over a field; Computer science; Mathematical analysis","score_opus":0.025245975118682523,"score_gpt":0.33024766099047415,"score_spread":0.3050016858717916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047577730","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.99289876,0.000387106,0.00082949246,0.00062062277,0.000044310047,0.000047397607,0.0000017016719,0.000007485055,0.005163127],"genre_scores_gemma":[0.99749637,0.0002127235,0.0016661084,0.00024333013,0.000079904254,0.0000011136274,3.996782e-7,0.000005421079,0.0002946406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993191,0.00012268758,0.00029982906,0.000060546125,0.000080918675,0.00011696772],"domain_scores_gemma":[0.9991417,0.0005961855,0.000119070566,0.00006879104,0.000033748995,0.00004052182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047669123,0.00006906239,0.00022692513,0.00006619233,0.00004288376,0.0000074170753,0.000071727554,0.00006613537,0.00041837734],"category_scores_gemma":[0.00037898927,0.000049552236,0.00003358454,0.00006983633,0.0001276458,0.00012643784,0.00001054523,0.0001784117,0.000003081749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014280052,0.00010609834,0.005062437,0.000019369756,0.000019053809,0.00008364611,0.0010069672,0.00004991837,0.000114955714,0.9730906,0.00031189783,0.019992294],"study_design_scores_gemma":[0.000479309,0.00011310433,0.006521319,0.000019689776,0.000013749831,0.00026046578,0.00031555982,0.000021595759,0.00012291773,0.9910993,0.0009772778,0.00005570967],"about_ca_topic_score_codex":0.0000058441756,"about_ca_topic_score_gemma":0.000030381407,"teacher_disagreement_score":0.019936584,"about_ca_system_score_codex":0.000026102942,"about_ca_system_score_gemma":0.000035636695,"threshold_uncertainty_score":0.45809385},"labels":[],"label_agreement":null},{"id":"W2063169574","doi":"10.2307/2694928","title":"An intensional type theory: motivation and cut-elimination","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","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 British Columbia","funders":"","keywords":"Axiom; Type theory; Type (biology); Mathematics; Completeness (order theory); Interpretation (philosophy); Syntax; Discrete mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.02827150745272364,"score_gpt":0.2724352146138546,"score_spread":0.24416370716113098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063169574","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.85097003,0.0005880316,0.14155419,0.0013646883,0.00072124635,0.00006451756,2.05068e-7,0.000039192742,0.0046979147],"genre_scores_gemma":[0.99569035,0.0001988,0.003219074,0.0004533044,0.0002796721,4.2849592e-7,8.2293275e-7,0.0000043574923,0.00015319239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991626,0.000115181596,0.00023442924,0.00013411851,0.0002136935,0.00013996598],"domain_scores_gemma":[0.9988916,0.00012508355,0.00022974482,0.0001481027,0.0004995738,0.00010589192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072913204,0.000090807116,0.00015876252,0.00015820854,0.00008700368,0.00009341681,0.00033312725,0.000062929095,0.000029102408],"category_scores_gemma":[0.00036829943,0.00006203248,0.000040686384,0.00026821485,0.000043413336,0.00067657203,0.000055696935,0.00014849471,0.000013769521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008487988,0.00026929833,0.0131137455,0.000009372387,0.000034210596,0.00010280835,0.0028053343,0.00008518771,0.0043829107,0.89655936,0.00089184556,0.08166105],"study_design_scores_gemma":[0.0010857865,0.001829908,0.47741923,0.00008317797,0.000038218233,0.0028808585,0.00044754817,0.016228093,0.00084815,0.49537885,0.0034421205,0.00031805015],"about_ca_topic_score_codex":0.000001857662,"about_ca_topic_score_gemma":0.0000013465035,"teacher_disagreement_score":0.4643055,"about_ca_system_score_codex":0.000036033984,"about_ca_system_score_gemma":0.00005968927,"threshold_uncertainty_score":0.2529611},"labels":[],"label_agreement":null},{"id":"W2063729301","doi":"10.2178/jsl/1286198148","title":"Expansions of the real field by open sets: definability versus interpretability","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Mathematics; Open set; Projective test; Bounded function; Borel set; Discrete mathematics; Hausdorff space; Set (abstract data type); Hierarchy; Measure (data warehouse); Field (mathematics); Hausdorff measure; Combinatorics; Pure mathematics; Hausdorff dimension; Computer science; Mathematical analysis","score_opus":0.04491493955108227,"score_gpt":0.3819997416435831,"score_spread":0.3370848020925008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063729301","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.987612,0.00003931954,0.0005989643,0.0016228318,0.00097233633,0.000176019,0.0000103413,0.0000072427606,0.008960965],"genre_scores_gemma":[0.99645287,0.00002466904,0.0031999706,0.00017557529,0.00004544456,0.000003188861,3.0301382e-7,0.0000067826286,0.00009118345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988052,0.00023000533,0.00054640474,0.00011403931,0.0001513593,0.00015298402],"domain_scores_gemma":[0.9969635,0.0017879381,0.00050537847,0.0005186041,0.00015923874,0.000065313434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011746848,0.00010716717,0.00037252274,0.000025819958,0.000100198566,0.000010467756,0.0008724415,0.00016587188,0.000361157],"category_scores_gemma":[0.003917812,0.000061515035,0.00018010847,0.000092494105,0.00029778958,0.00015535383,0.0002752906,0.00072607497,0.000002261462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031187327,0.0019696367,0.03729563,0.0001720696,0.0003075508,0.000017160144,0.0061391895,0.000010540201,0.033716153,0.8939614,0.014319169,0.008972765],"study_design_scores_gemma":[0.000848574,0.00031796133,0.0035452466,0.000027959166,0.000064456006,0.00004421752,0.0006922723,0.000006570574,0.0062898765,0.98757696,0.0005018018,0.00008411007],"about_ca_topic_score_codex":0.000031508345,"about_ca_topic_score_gemma":0.000086381995,"teacher_disagreement_score":0.09361555,"about_ca_system_score_codex":0.0000311806,"about_ca_system_score_gemma":0.00011311736,"threshold_uncertainty_score":0.46902698},"labels":[],"label_agreement":null},{"id":"W2065498341","doi":"10.2178/jsl/1185803624","title":"Simplicial structures in MV-algebras and logic","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","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":"Mathematics; Algebra over a field; Axiom; Completeness (order theory); Algebraic structure; Intermediate logic; Peano axioms; Łukasiewicz logic; Relation algebra; Interior algebra; Discrete mathematics; Pure mathematics; Subalgebra; Division algebra; Two-element Boolean algebra; Algebra representation; Substructural logic; Computer science; Description logic; Theoretical computer science","score_opus":0.0161204057250458,"score_gpt":0.2802801720625293,"score_spread":0.2641597663374835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065498341","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.8118614,0.0014413135,0.18299975,0.0010005437,0.0005020876,0.000096728,4.3614642e-7,0.0000322166,0.0020655512],"genre_scores_gemma":[0.9780887,0.0001043969,0.019930385,0.0015281877,0.00032300508,4.5937816e-7,1.6342433e-7,0.000006181897,0.000018522149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847186,0.000054818094,0.00056904415,0.00021296246,0.00029749435,0.00039381778],"domain_scores_gemma":[0.9990214,0.00018253208,0.00034095327,0.00019948701,0.00009049434,0.0001651161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007390586,0.00016695773,0.0003510049,0.00033992043,0.000072730036,0.00007232513,0.0006275306,0.00011219916,0.00001792799],"category_scores_gemma":[0.000137872,0.00011723613,0.000079576756,0.0004410294,0.00008419443,0.00046033002,0.00015468789,0.00038442021,0.0000055657833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004795226,0.00009403767,0.009371108,0.00001633378,0.000019464196,0.00076875306,0.0009624602,0.00030015828,0.0037169142,0.9190254,0.00013756924,0.0655398],"study_design_scores_gemma":[0.00061120675,0.00028764657,0.19456898,0.000016765547,0.0000057935667,0.00089357945,0.00012281805,0.00012924864,0.0006641762,0.80201596,0.0005154718,0.00016836092],"about_ca_topic_score_codex":0.0000064446376,"about_ca_topic_score_gemma":0.000016990556,"teacher_disagreement_score":0.18519786,"about_ca_system_score_codex":0.000057977326,"about_ca_system_score_gemma":0.000057542315,"threshold_uncertainty_score":0.47807506},"labels":[],"label_agreement":null},{"id":"W2072020033","doi":"10.2307/2695059","title":"Definability in low simple theories","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Simple (philosophy); Mathematics; Bounded function; Context (archaeology); Model theory; Equivalence relation; Class (philosophy); Equivalence (formal languages); Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Epistemology","score_opus":0.023239949677205756,"score_gpt":0.32321810494544145,"score_spread":0.2999781552682357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072020033","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.9865123,0.00024081756,0.0009187492,0.00045120006,0.00008275868,0.00006651883,0.0000016281557,0.000013645013,0.011712382],"genre_scores_gemma":[0.99711686,0.00009611266,0.0020217153,0.00027249526,0.00010558536,0.0000016654369,2.938079e-7,0.000008161944,0.0003771092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893475,0.00017782506,0.0004756882,0.00008762034,0.000118937176,0.00020517936],"domain_scores_gemma":[0.9990015,0.0005380561,0.00017345254,0.00017600555,0.00005864364,0.000052326664],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00089077745,0.00010248527,0.0003439723,0.00007479864,0.000049626597,0.0000070608176,0.00019030501,0.000099648285,0.0015797362],"category_scores_gemma":[0.0005905113,0.00007237065,0.0001033115,0.00012698596,0.0001713627,0.00014038567,0.000015937445,0.00031808787,0.00003028394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002573123,0.00034921762,0.0052868873,0.000051465584,0.000024769643,0.00013048416,0.0014820923,0.00019936758,0.00006555866,0.98256016,0.00025182558,0.009340887],"study_design_scores_gemma":[0.0004405751,0.00010568228,0.005301672,0.000024831144,0.000011673011,0.0001833389,0.00030845086,0.000008748288,0.00018443675,0.9927445,0.00060995127,0.00007610618],"about_ca_topic_score_codex":0.000002997518,"about_ca_topic_score_gemma":0.000010765876,"teacher_disagreement_score":0.011335272,"about_ca_system_score_codex":0.000053064083,"about_ca_system_score_gemma":0.000048627633,"threshold_uncertainty_score":0.99933296},"labels":[],"label_agreement":null},{"id":"W2074194362","doi":"10.1017/jsl.2014.53","title":"ALGEBRAIC GEOMETRY FOR MV-ALGEBRAS","year":2014,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","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 British Columbia","funders":"","keywords":"Mathematics; Real algebraic geometry; Algebra over a field; Function field of an algebraic variety; Polynomial; Algebraic number; Dimension of an algebraic variety; Singular point of an algebraic variety; Algebraic structure; Pure mathematics; Mathematical analysis","score_opus":0.015202689092916234,"score_gpt":0.2576290290568988,"score_spread":0.24242633996398255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074194362","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.087817535,0.0006193258,0.9065568,0.0020703655,0.0010172889,0.000132821,9.129996e-7,0.00006332731,0.0017216675],"genre_scores_gemma":[0.91994876,0.000049045317,0.07651359,0.0025000304,0.00076491723,0.000005679742,6.245261e-7,0.000013884372,0.00020345516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830586,0.00008168354,0.00058094127,0.00025080767,0.00035950827,0.00042117314],"domain_scores_gemma":[0.99816054,0.0004128263,0.0005447336,0.00040465005,0.0002670694,0.0002101805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091375335,0.00019299114,0.0004460131,0.0003117743,0.00013670835,0.00010903489,0.0012921651,0.000105200466,0.000029743169],"category_scores_gemma":[0.00048260897,0.00013846246,0.00028216836,0.00047156037,0.00006085667,0.00062471535,0.00013408341,0.0002575012,0.000047863447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019831594,0.000120497396,0.0005269181,0.00003325136,0.00004724253,0.00001979957,0.00022123427,0.0002624187,0.001786616,0.93175656,0.0022751119,0.0629305],"study_design_scores_gemma":[0.0012906801,0.0010632179,0.005906265,0.000039970582,0.00002853536,0.0004967621,0.000042583568,0.0028264592,0.0018001689,0.9606576,0.025527563,0.00032019505],"about_ca_topic_score_codex":8.4906856e-7,"about_ca_topic_score_gemma":5.2328573e-7,"teacher_disagreement_score":0.83213127,"about_ca_system_score_codex":0.000049288843,"about_ca_system_score_gemma":0.00007677852,"threshold_uncertainty_score":0.56463355},"labels":[],"label_agreement":null},{"id":"W2081858636","doi":"10.2178/jsl/1140641175","title":"Computable trees of Scott rank <i>ω</i><sub>1</sub><sup><i>CK</i></sup>, and computable approximation","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Rank (graph theory); Homogeneous; Tuple; Arithmetic function; Combinatorics; Homogeneity (statistics); Discrete mathematics; Statistics","score_opus":0.010974821138814869,"score_gpt":0.2141956998777218,"score_spread":0.20322087873890693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081858636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5894572,0.0016951727,0.40638283,0.0007060083,0.00034776292,0.0003050121,0.000005227221,0.000085534215,0.0010152184],"genre_scores_gemma":[0.9282071,0.00012575359,0.070896804,0.00024258139,0.00047333975,0.0000043069185,0.000003831167,0.000023584296,0.000022679023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958919,0.00033463797,0.0015946783,0.00056053925,0.00097520655,0.0006429893],"domain_scores_gemma":[0.996783,0.0005012436,0.0011561344,0.00062762114,0.0006917486,0.00024024902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017404078,0.00043086696,0.0011355942,0.0005230406,0.00020201576,0.00030512564,0.001263572,0.00020421967,0.000010790118],"category_scores_gemma":[0.00009871602,0.00036202828,0.00030647512,0.0010441131,0.00028801683,0.0011188796,0.0005319702,0.00048500905,0.000014893011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019449972,0.003462888,0.019053096,0.0007374851,0.00036067967,0.00027938688,0.0029062144,0.7271589,0.05466051,0.061535735,0.008305005,0.12134558],"study_design_scores_gemma":[0.0037822442,0.00117177,0.025372827,0.00026035667,0.00011065594,0.0018689992,0.00014235273,0.80520177,0.024282243,0.13602911,0.0009663766,0.00081131374],"about_ca_topic_score_codex":0.00008640101,"about_ca_topic_score_gemma":0.000008462694,"teacher_disagreement_score":0.3387499,"about_ca_system_score_codex":0.00014610711,"about_ca_system_score_gemma":0.00022726177,"threshold_uncertainty_score":0.9998832},"labels":[],"label_agreement":null},{"id":"W2087012565","doi":"10.2178/jsl/1203350791","title":"Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Hierarchy; Polynomial hierarchy; Mathematics; Combinatorics; Time complexity; P versus NP problem; Polynomial; Discrete mathematics; Computational complexity theory; Algorithm","score_opus":0.02375080234186978,"score_gpt":0.2625584848825566,"score_spread":0.23880768254068685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087012565","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.84838426,0.002847986,0.13158035,0.00505474,0.0023242661,0.00034473347,0.000009663257,0.00003433465,0.009419691],"genre_scores_gemma":[0.9792139,0.00003357126,0.020161351,0.0004775358,0.0000887865,4.5817316e-7,4.7903697e-8,0.000003109114,0.000021256159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980303,0.00012743485,0.00089047384,0.00014069355,0.00058213656,0.00022896573],"domain_scores_gemma":[0.99766284,0.00035421315,0.0010200986,0.00049225305,0.00039133462,0.00007927986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022652948,0.00011767475,0.00037859633,0.00012285766,0.00007516644,0.000021824288,0.0016991099,0.000063990105,0.000010294302],"category_scores_gemma":[0.00021296216,0.00006933483,0.00030931976,0.0007311548,0.00070056494,0.0002485157,0.00022980807,0.00028433738,9.838288e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014920472,0.0015366576,0.063765705,0.00033781907,0.00024275825,0.00008995833,0.004382393,0.0002134574,0.19006,0.6483621,0.0017752677,0.089084655],"study_design_scores_gemma":[0.0010064478,0.0007950436,0.04791941,0.00022228542,0.00005128641,0.00087365834,0.00029757895,0.00022546496,0.47771963,0.4670812,0.0035229633,0.0002850569],"about_ca_topic_score_codex":0.000035263736,"about_ca_topic_score_gemma":0.0000092835235,"teacher_disagreement_score":0.28765962,"about_ca_system_score_codex":0.000024640856,"about_ca_system_score_gemma":0.00022392998,"threshold_uncertainty_score":0.31573972},"labels":[],"label_agreement":null},{"id":"W2088093428","doi":"10.2178/jsl/1140641163","title":"The generalised type-theoretic interpretation of constructive set theory","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":30,"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":"Florida Agricultural and Mechanical University","keywords":"Type theory; Interpretation (philosophy); Negation; Type (biology); Constructive; Universal set; Mathematics; Intuitionistic logic; Set theory; Set (abstract data type); Computer science; Algebra over a field; Linear logic; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.012200209156815016,"score_gpt":0.24639312955623738,"score_spread":0.23419292039942236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088093428","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.16543789,0.0035752312,0.80557406,0.00062902813,0.0028397047,0.00030017798,0.0000012564257,0.000049071394,0.021593574],"genre_scores_gemma":[0.99808997,0.00004092772,0.0014501857,0.00007711457,0.00019579867,0.0000014559345,5.142243e-7,0.000004799028,0.00013924125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867,0.00030453646,0.00049066346,0.00010435762,0.00026487975,0.0001655614],"domain_scores_gemma":[0.99843305,0.0002624277,0.0006619664,0.00022721881,0.00037578476,0.00003957771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011357381,0.00009839279,0.00022615673,0.000084999265,0.00008965114,0.00009161533,0.00062899897,0.000056023684,0.000008872765],"category_scores_gemma":[0.000112378126,0.000053651736,0.00011933046,0.0002360749,0.00022190792,0.00018236184,0.000058893613,0.00013780336,0.000009229998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033609445,0.00002239198,0.0005036817,0.000009267834,0.00003434821,0.000010724007,0.0007686067,0.00012656208,0.0006553352,0.9894798,0.0002590595,0.00809664],"study_design_scores_gemma":[0.00035907974,0.0002851802,0.0015063728,0.000010927255,0.00002390915,0.00030469502,0.00032211575,0.0019432106,0.001438323,0.992839,0.0008778595,0.000089320514],"about_ca_topic_score_codex":0.000015840897,"about_ca_topic_score_gemma":0.0000028924806,"teacher_disagreement_score":0.8326521,"about_ca_system_score_codex":0.000036429126,"about_ca_system_score_gemma":0.00009498809,"threshold_uncertainty_score":0.21878543},"labels":[],"label_agreement":null},{"id":"W2088134129","doi":"10.2178/jsl/1268917489","title":"Strongly and co-strongly minimal abelian structures","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Rings, Modules, and Algebras","field":"Mathematics","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":"McGill University","funders":"","keywords":"Algebraic structure; Abelian group; Mathematics; Linear subspace; Subspace topology; Combinatorics; Vector space; Division ring; Pure mathematics; Elementary abelian group; Discrete mathematics; Division (mathematics); Mathematical analysis; Arithmetic","score_opus":0.030045790282780354,"score_gpt":0.29862693300985216,"score_spread":0.2685811427270718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088134129","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.9964887,0.00021179677,0.000117927484,0.00041913934,0.00046457665,0.00008390979,0.000007116132,0.00002183715,0.0021849943],"genre_scores_gemma":[0.98618937,0.000043123186,0.012457067,0.00007918553,0.0009968192,0.0000010075876,9.222002e-7,0.000024211176,0.00020831756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862945,0.000039360733,0.00053608173,0.00015337192,0.00033884562,0.00030288883],"domain_scores_gemma":[0.99880505,0.00015562735,0.00048736826,0.00021408893,0.00012974595,0.0002080968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042749132,0.0001981417,0.00043190995,0.0001612643,0.000101899,0.000094470364,0.0002894712,0.00014456882,0.00019555741],"category_scores_gemma":[0.00028662724,0.00013941819,0.00012950259,0.0000696849,0.00016335453,0.00020111064,0.000041684776,0.00063876313,0.000012866279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003147407,0.00068424316,0.056183472,0.00043104356,0.0006186073,0.0004589381,0.0047643757,0.000024337633,0.14417431,0.74729735,0.02880434,0.016244221],"study_design_scores_gemma":[0.003240577,0.0010026741,0.1938041,0.00011366134,0.0002627179,0.0029207827,0.0015090061,0.00007366319,0.008435367,0.7780134,0.009957463,0.0006665875],"about_ca_topic_score_codex":0.000005528803,"about_ca_topic_score_gemma":0.000014339641,"teacher_disagreement_score":0.13762063,"about_ca_system_score_codex":0.000018810346,"about_ca_system_score_gemma":0.000076945464,"threshold_uncertainty_score":0.56853086},"labels":[],"label_agreement":null},{"id":"W2103381492","doi":"10.2178/jsl/1333566629","title":"Weakly one-based geometric theories","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Rings, Modules, and Algebras","field":"Mathematics","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":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Generalization; Rank (graph theory); Modularity (biology); Pure mathematics; Vector space; Categorical variable; Modular design; Class (philosophy); Space (punctuation); Field (mathematics); Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.060838623609095664,"score_gpt":0.29881590766209126,"score_spread":0.2379772840529956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103381492","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.98067206,0.0020326455,0.008214097,0.0007185425,0.0007658226,0.00010152061,0.000002370674,0.0000403593,0.0074525587],"genre_scores_gemma":[0.989372,0.000083476836,0.008463351,0.00039848563,0.001311431,0.0000020652583,5.6341645e-7,0.000024903191,0.00034373076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838114,0.000090404676,0.0005701663,0.00008779127,0.00046977776,0.0004007391],"domain_scores_gemma":[0.99828875,0.0005141339,0.0005772036,0.00023427245,0.00018200626,0.00020361337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001319708,0.0001665036,0.000453531,0.0004472461,0.00008896195,0.000049701477,0.00030777222,0.00010029924,0.00026975462],"category_scores_gemma":[0.001022338,0.00011680838,0.00022912178,0.00043537244,0.00008093765,0.00031553733,0.000035284185,0.00030866108,0.0001021294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010948496,0.001749734,0.026213016,0.00029067407,0.00028525668,0.00003941184,0.0016180723,0.000023056293,0.003243448,0.9510096,0.008831914,0.006586362],"study_design_scores_gemma":[0.0011651646,0.0003694901,0.03892024,0.000172391,0.00023132453,0.00025983705,0.0005065083,0.000012593984,0.009621887,0.9428808,0.0054832087,0.0003765471],"about_ca_topic_score_codex":0.0000028841698,"about_ca_topic_score_gemma":6.428344e-7,"teacher_disagreement_score":0.012707222,"about_ca_system_score_codex":0.00007279753,"about_ca_system_score_gemma":0.00007641412,"threshold_uncertainty_score":0.47633076},"labels":[],"label_agreement":null},{"id":"W2104329043","doi":"10.2178/jsl/1318338849","title":"Limits on jump inversion for strong reducibilities","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Jump; Inversion (geology); Set (abstract data type); Mathematics; Algorithm; Computer science; Discrete mathematics; Combinatorics; Physics; Biology","score_opus":0.1159473559644005,"score_gpt":0.28514799890236,"score_spread":0.16920064293795947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104329043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6362824,0.00048857817,0.34569505,0.0022284754,0.004113543,0.0005914958,0.000005440396,0.00014897181,0.01044604],"genre_scores_gemma":[0.921277,0.00002754977,0.07767605,0.00042863123,0.00041385277,0.000004834574,3.5759393e-7,0.000010314094,0.00016139598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981664,0.00012066182,0.00058443256,0.00035292076,0.0004121471,0.00036342847],"domain_scores_gemma":[0.9980864,0.00031461334,0.0004304897,0.00058638817,0.00039755562,0.00018458332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011158593,0.0001932697,0.00038457938,0.0002735649,0.00011887298,0.00007509966,0.0012636563,0.000101029225,0.000037504396],"category_scores_gemma":[0.00033424265,0.00014362633,0.00028029602,0.00025791797,0.00009082137,0.00050949876,0.00017809239,0.000274936,0.000023670962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071298913,0.003855611,0.008322195,0.00034375562,0.00038734268,0.00027543723,0.028852884,0.0017872966,0.0030020317,0.6192811,0.020186512,0.31299284],"study_design_scores_gemma":[0.004146855,0.013464289,0.059812054,0.00033262145,0.000115641844,0.00072959333,0.0018516193,0.044794697,0.020046,0.84749365,0.0059901387,0.0012228471],"about_ca_topic_score_codex":0.00001299332,"about_ca_topic_score_gemma":0.0000020008242,"teacher_disagreement_score":0.31177,"about_ca_system_score_codex":0.00015357122,"about_ca_system_score_gemma":0.00015142624,"threshold_uncertainty_score":0.58569115},"labels":[],"label_agreement":null},{"id":"W2107810016","doi":"10.2178/jsl/1120224718","title":"On the type-definability of the binding group in simple theories","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Type (biology); Combinatorics; Simple (philosophy); Mathematics; Set (abstract data type); Action (physics); Group (periodic table); Discrete mathematics; Physics; Computer science; Biology; Philosophy; Programming language","score_opus":0.035999156350358455,"score_gpt":0.3206802138314298,"score_spread":0.28468105748107136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107810016","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.9941629,0.000113400674,0.00024925105,0.0020220832,0.0001476053,0.00009645723,0.0000015249826,0.0000048970624,0.0032018786],"genre_scores_gemma":[0.99898493,0.000025193916,0.00043659372,0.00035599596,0.0000886709,0.0000012388801,8.877617e-8,0.000006755044,0.000100536745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894357,0.0002891507,0.00040472602,0.00006472572,0.00015293967,0.00014489824],"domain_scores_gemma":[0.9976017,0.0016908488,0.00037538048,0.00024895425,0.00006358982,0.000019564568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014451417,0.00008724189,0.0002448408,0.00005476267,0.000085969834,0.000004858767,0.00032492634,0.000071941635,0.00016149353],"category_scores_gemma":[0.002026867,0.00003856405,0.00011017798,0.00018385563,0.0002476872,0.00006921761,0.000050477145,0.00039062888,0.0000067183028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090618974,0.00012851838,0.0025603452,0.000012045382,0.00001639509,0.0000024675885,0.0009981486,0.00009487825,0.00044221472,0.9950166,0.00019547757,0.00044230995],"study_design_scores_gemma":[0.00023159842,0.00010750967,0.003663949,0.00003331075,0.000014516375,0.000034718963,0.00078057824,0.00000989011,0.00093327364,0.99383706,0.0003107432,0.000042874337],"about_ca_topic_score_codex":0.0000015922352,"about_ca_topic_score_gemma":0.000015032124,"teacher_disagreement_score":0.004822024,"about_ca_system_score_codex":0.000060989558,"about_ca_system_score_gemma":0.000035613666,"threshold_uncertainty_score":0.24264953},"labels":[],"label_agreement":null},{"id":"W2108070451","doi":"10.2178/jsl/1230396911","title":"Analytic and coanalytic families of almost disjoint functions","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"York University","funders":"","keywords":"Countable set; Mathematics; Disjoint sets; Pairwise comparison; Combinatorics; Discrete mathematics; Existential quantification; Statistics","score_opus":0.06064661469918653,"score_gpt":0.31317541817748784,"score_spread":0.2525288034783013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108070451","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.98713183,0.00080470106,0.007365655,0.0003389785,0.00014649713,0.000061457715,0.000004735933,0.000011346975,0.0041348194],"genre_scores_gemma":[0.9962366,0.0006000295,0.0020719476,0.000092184055,0.00008766272,7.6700877e-7,4.9049856e-7,0.000009072579,0.00090120634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989938,0.00007246059,0.00053799123,0.00008751223,0.0001610837,0.00014715857],"domain_scores_gemma":[0.9987004,0.0004578415,0.0004523394,0.00015859371,0.00014993962,0.00008089221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033001142,0.000113035414,0.0004819533,0.00019694777,0.0001087581,0.0000031345057,0.00011104133,0.00007540313,0.00010464724],"category_scores_gemma":[0.00050570775,0.000079581456,0.00013872253,0.0001662646,0.00040803148,0.00011118556,0.000033786695,0.00022750608,0.0000063067373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009823011,0.002243951,0.067917734,0.0007544846,0.0025863692,0.0013793155,0.015594011,0.0008954629,0.008192054,0.8802852,0.012281875,0.0068872143],"study_design_scores_gemma":[0.0011888726,0.00060482806,0.018792236,0.00009783068,0.00042689618,0.0041063884,0.0038975505,0.00020129744,0.00057691644,0.96927154,0.00062548195,0.00021018414],"about_ca_topic_score_codex":0.0000031572056,"about_ca_topic_score_gemma":0.0000040692616,"teacher_disagreement_score":0.08898629,"about_ca_system_score_codex":0.000025800853,"about_ca_system_score_gemma":0.000058041507,"threshold_uncertainty_score":0.32452375},"labels":[],"label_agreement":null},{"id":"W2113017687","doi":"10.2178/jsl/1190150145","title":"On the binding group in simple theories","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Simple (philosophy); Type (biology); Group (periodic table); Tuple; Mathematics; Classification of finite simple groups; Simple group; Combinatorics; Pure mathematics; Algebra over a field; Group theory; Discrete mathematics; Physics; Group of Lie type; Quantum mechanics; Philosophy; Epistemology","score_opus":0.06131086100222974,"score_gpt":0.31288371532782955,"score_spread":0.25157285432559984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113017687","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.98146623,0.0002450157,0.0013794528,0.0017403956,0.00019534626,0.00007863628,0.0000012731712,0.00001228452,0.014881383],"genre_scores_gemma":[0.99840176,0.000086518776,0.00046218306,0.0005985091,0.0001224437,0.0000019228808,1.2170297e-7,0.000009059285,0.0003174798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991106,0.00017913498,0.00032764702,0.00006497859,0.00013669938,0.000180963],"domain_scores_gemma":[0.99775964,0.00178712,0.00024765535,0.00014654855,0.000027047146,0.000031981395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081213,0.00009420369,0.00023030073,0.0001114707,0.00009553247,0.00001096035,0.00022551084,0.000070704,0.00080740143],"category_scores_gemma":[0.0010172345,0.000049753762,0.000083929895,0.00013811109,0.00012056771,0.00008809262,0.0000243135,0.00039990185,0.00004474541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029634411,0.00010115816,0.0002380432,0.000005826513,0.000016980084,0.00005743881,0.001102802,0.00001732482,0.00017235967,0.99668044,0.0010450701,0.00053289795],"study_design_scores_gemma":[0.00030769702,0.00014458268,0.00017856531,0.000031119314,0.000010172003,0.00011864454,0.00094175333,0.00002806351,0.00015139465,0.99762076,0.00040814432,0.000059079317],"about_ca_topic_score_codex":5.1127e-7,"about_ca_topic_score_gemma":0.0000030728052,"teacher_disagreement_score":0.016935548,"about_ca_system_score_codex":0.00003803087,"about_ca_system_score_gemma":0.000005228339,"threshold_uncertainty_score":0.884048},"labels":[],"label_agreement":null},{"id":"W2114226999","doi":"10.2178/jsl/1154698576","title":"The complexity of analytic tableaux","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","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":"Mathematical proof; Resolution (logic); Matching (statistics); Polynomial; Tree (set theory); Young tableau; Binary tree; Mathematics; Computer science; Combinatorics; Discrete mathematics; Artificial intelligence","score_opus":0.04642661743926695,"score_gpt":0.26768155588808984,"score_spread":0.22125493844882288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114226999","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.07350339,0.009984351,0.8284427,0.007432709,0.0036920612,0.00050532183,0.0000016600711,0.00012293497,0.0763149],"genre_scores_gemma":[0.9973141,0.00003945992,0.0019041831,0.00007224354,0.00028893657,9.0032654e-7,2.2411722e-7,0.0000040084574,0.00037594064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984931,0.00011108521,0.00062456465,0.000111971334,0.00040906583,0.0002502296],"domain_scores_gemma":[0.9984651,0.00011336567,0.0007324333,0.00033779422,0.00028964947,0.00006165224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010346663,0.00010379545,0.0003128106,0.00009217966,0.00014683067,0.00012764099,0.0010453777,0.0000497788,0.000008467527],"category_scores_gemma":[0.000056856243,0.00005561841,0.00017993133,0.0003807138,0.00024387996,0.00019873685,0.00009862766,0.00016745534,0.00001557209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056294325,0.0000799058,0.0023100425,0.000014151582,0.000032407046,0.000024234057,0.00011661766,0.000107888256,0.000297993,0.99197894,0.001811935,0.0032202671],"study_design_scores_gemma":[0.0005177998,0.0003548396,0.02623449,0.000010712033,0.000029416078,0.00043715772,0.000115454444,0.0024722477,0.00070834416,0.94698846,0.02198367,0.00014740716],"about_ca_topic_score_codex":0.00016238309,"about_ca_topic_score_gemma":0.000033226155,"teacher_disagreement_score":0.9238107,"about_ca_system_score_codex":0.000041067193,"about_ca_system_score_gemma":0.00010232605,"threshold_uncertainty_score":0.22680528},"labels":[],"label_agreement":null},{"id":"W2116942026","doi":"10.2307/2695054","title":"Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Philosophy and Theoretical Science","field":"Psychology","cited_by":30,"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":"Indigenous and Northern Affairs Canada","keywords":"Mathematics; Set (abstract data type); Set theory; Discrete mathematics; Calculus (dental); Computer science","score_opus":0.06064039954745797,"score_gpt":0.36038946937629135,"score_spread":0.29974906982883337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116942026","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.8134048,0.0018450496,0.015606803,0.00446118,0.00038236286,0.00031290954,0.000014352207,0.000016502423,0.16395603],"genre_scores_gemma":[0.99655896,0.00011127469,0.0020190212,0.0007267004,0.00017461966,0.000013549398,4.5528168e-7,0.000008458916,0.0003869598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989161,0.00009814083,0.00040696768,0.00014392247,0.0001657369,0.0002691672],"domain_scores_gemma":[0.9988438,0.0005327062,0.00023562483,0.00015081231,0.00006371948,0.00017336482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015348532,0.00011099482,0.0003099927,0.00014641263,0.000056871115,0.0000259827,0.00027561907,0.00009543656,0.0006294666],"category_scores_gemma":[0.00027609066,0.0000729413,0.0000911888,0.00022365944,0.00019391195,0.0001255755,0.000034545803,0.00020629627,0.000019033905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015051158,0.00019844114,0.00060415786,0.000011824189,0.000043277432,0.000040257975,0.00358979,0.0000010187069,0.0003651111,0.9927808,0.00017665446,0.002038145],"study_design_scores_gemma":[0.0007523173,0.00034334662,0.0043307273,0.000043108477,0.00003859188,0.00045447558,0.0015383969,0.00006879656,0.00011334625,0.9910643,0.0011620019,0.000090593174],"about_ca_topic_score_codex":0.0000022041588,"about_ca_topic_score_gemma":6.8801154e-7,"teacher_disagreement_score":0.18315415,"about_ca_system_score_codex":0.000027571601,"about_ca_system_score_gemma":0.000032870576,"threshold_uncertainty_score":0.6892218},"labels":[],"label_agreement":null},{"id":"W2118388414","doi":"10.2178/jsl/1190150029","title":"Unique decomposition in classifiable theories","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","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":"Countable set; Mathematics; Notation; Prime (order theory); Decomposition; Property (philosophy); Model theory; Order (exchange); Stability (learning theory); Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Arithmetic","score_opus":0.045493672295532576,"score_gpt":0.32656739510958216,"score_spread":0.2810737228140496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118388414","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.95128334,0.00046569746,0.0023003032,0.003296073,0.0004079264,0.00009710597,9.1817094e-7,0.000022965824,0.042125676],"genre_scores_gemma":[0.99520344,0.00016401346,0.0034956539,0.00042982705,0.00014541684,0.0000034735176,2.3671912e-7,0.000009063204,0.000548903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883854,0.00023136228,0.00050775794,0.00008588414,0.00012272595,0.0002137066],"domain_scores_gemma":[0.99904096,0.00039567126,0.0002962754,0.00013901823,0.000072000475,0.00005608098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059404847,0.00010460821,0.00034649056,0.0001872885,0.000048541,0.000012808546,0.00020939401,0.00016908502,0.00081113476],"category_scores_gemma":[0.0002586841,0.00007882873,0.00008842795,0.0001642092,0.00012976932,0.00012355913,0.000025476851,0.0003737086,0.000032482338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028262783,0.00028559452,0.002566713,0.000020630541,0.00003460567,0.0002674266,0.0011517726,0.000008783278,0.0008169799,0.9915792,0.0021871333,0.0010529176],"study_design_scores_gemma":[0.00050577667,0.00024126162,0.0011554365,0.000041265714,0.000020797177,0.0012123361,0.00025862572,0.00005722462,0.0007137829,0.9951925,0.0005163712,0.00008458345],"about_ca_topic_score_codex":0.0000040724685,"about_ca_topic_score_gemma":0.0000109554,"teacher_disagreement_score":0.043920077,"about_ca_system_score_codex":0.00006497911,"about_ca_system_score_gemma":0.000024191977,"threshold_uncertainty_score":0.8881357},"labels":[],"label_agreement":null},{"id":"W2120230527","doi":"10.2178/jsl/1208359065","title":"Generic complexity of undecidable problems","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","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":"McGill University","funders":"","keywords":"Undecidable problem; Construct (python library); Decidability; Word problem (mathematics education); Mathematics; Halting problem; Discrete mathematics; Computational complexity theory; Computer science; Algorithm; Turing machine; Arithmetic; Programming language","score_opus":0.0957049011215074,"score_gpt":0.2547248305775202,"score_spread":0.15901992945601282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120230527","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.8038255,0.0016056307,0.18820235,0.00094615115,0.00051618094,0.00010587196,0.0000016282933,0.000047572255,0.004749129],"genre_scores_gemma":[0.9701329,0.00017932807,0.029150639,0.0003094271,0.00011364348,8.239768e-7,2.1118069e-7,0.00000512532,0.00010793518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877685,0.00007231987,0.0004944059,0.000116082636,0.00034344502,0.000196864],"domain_scores_gemma":[0.9988649,0.00006349067,0.00051596895,0.0002905584,0.00017131928,0.000093765935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046906772,0.000099917605,0.00033450712,0.00014067916,0.000079644204,0.00002258908,0.0009091055,0.000046483252,0.000042285377],"category_scores_gemma":[0.000033793593,0.00007061166,0.0001382131,0.0003776617,0.00017440964,0.00033754332,0.00013007494,0.00014487814,0.00001491281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045914567,0.0014434224,0.010344682,0.0001762381,0.00025311855,0.0006075805,0.0051875366,0.004631308,0.066886745,0.87976116,0.013382961,0.01727933],"study_design_scores_gemma":[0.002074842,0.0013470872,0.103386596,0.00018855366,0.000036068188,0.007488539,0.00016811864,0.018758003,0.016451072,0.84418213,0.005385057,0.00053395063],"about_ca_topic_score_codex":0.0000154919,"about_ca_topic_score_gemma":9.076315e-7,"teacher_disagreement_score":0.16630739,"about_ca_system_score_codex":0.000035660138,"about_ca_system_score_gemma":0.000120850826,"threshold_uncertainty_score":0.28794602},"labels":[],"label_agreement":null},{"id":"W2123017773","doi":"10.2178/jsl/1190150053","title":"Pfaffian differential equations over exponential o-minimal structures","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Pfaffian; Mathematics; Unary operation; Differentiable function; Combinatorics; Function (biology); Zero (linguistics); Sequence (biology); Discrete mathematics; Pure mathematics","score_opus":0.06992720322201543,"score_gpt":0.32590139667980766,"score_spread":0.25597419345779227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123017773","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.93853813,0.00043839638,0.05543907,0.00041004206,0.0010551227,0.00010500172,0.000007963455,0.00003574732,0.003970498],"genre_scores_gemma":[0.9947885,0.000044739176,0.0032294085,0.00014273173,0.00086765556,0.0000016157559,9.014515e-7,0.000016634092,0.00090779905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872583,0.00012518928,0.00052395975,0.000112896734,0.00026429654,0.0002478212],"domain_scores_gemma":[0.99881226,0.00038248653,0.00044177196,0.00017558162,0.0000822308,0.000105645115],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015706594,0.00015652741,0.0003562257,0.00015538392,0.00013939789,0.000022280494,0.0002484118,0.00014559837,0.006233734],"category_scores_gemma":[0.00043487872,0.00011416611,0.00020486131,0.000088012835,0.00014517568,0.00017293268,0.00004398457,0.00037356696,0.00002822889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012304155,0.00040457255,0.00024542544,0.000030052974,0.00020840067,0.00013546861,0.0021204124,0.00005795619,0.0055603916,0.9825354,0.0060249325,0.002553926],"study_design_scores_gemma":[0.001268957,0.00024077875,0.0022473463,0.000022057991,0.00013454937,0.00031543407,0.00026963145,0.00034289082,0.00074334024,0.99366724,0.00056358025,0.00018419765],"about_ca_topic_score_codex":0.0000010332024,"about_ca_topic_score_gemma":0.0000025554018,"teacher_disagreement_score":0.056250356,"about_ca_system_score_codex":0.00003639844,"about_ca_system_score_gemma":0.000016176142,"threshold_uncertainty_score":0.9946747},"labels":[],"label_agreement":null},{"id":"W2123528468","doi":"10.2307/2695039","title":"The covering numbers of Mycielski ideals are all equal","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"York University","funders":"","keywords":"Mathematics; Ideal (ethics); Combinatorics; Discrete mathematics; Philosophy; Epistemology","score_opus":0.07546392514603789,"score_gpt":0.3675730739033885,"score_spread":0.2921091487573506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123528468","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.9695714,0.0011792376,0.009979765,0.0014152504,0.00053752,0.00010755855,0.0000030377698,0.000019349758,0.017186854],"genre_scores_gemma":[0.99646825,0.0006789117,0.001533401,0.00038804222,0.00020390036,0.0000010384201,1.4051899e-7,0.000012197054,0.0007141249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877864,0.00012543848,0.0005763159,0.000070449685,0.0002160698,0.00023306318],"domain_scores_gemma":[0.99760824,0.0011376652,0.0008676922,0.00019043253,0.00012805343,0.00006788894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009849473,0.00010919998,0.00035948705,0.000052434018,0.000102487735,0.000010402941,0.00031092882,0.00009474794,0.000098013144],"category_scores_gemma":[0.00082107284,0.00006514149,0.00016269785,0.00009447718,0.00016866735,0.00010868876,0.000046013312,0.0003015784,0.0000097006805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003690379,0.00020954902,0.0040662666,0.00006232564,0.00033292768,0.00031892926,0.0018684487,0.00037949168,0.0022360254,0.98427206,0.0034470342,0.0024379147],"study_design_scores_gemma":[0.0004783161,0.00012864004,0.0008539195,0.00006180714,0.000053596257,0.0007260883,0.0015910899,0.000013582231,0.0005799525,0.98994625,0.005481397,0.00008536419],"about_ca_topic_score_codex":0.0000022099223,"about_ca_topic_score_gemma":0.0000071693566,"teacher_disagreement_score":0.026896816,"about_ca_system_score_codex":0.000038410206,"about_ca_system_score_gemma":0.000035813664,"threshold_uncertainty_score":0.26563928},"labels":[],"label_agreement":null},{"id":"W2125293664","doi":"10.2178/jsl/1164060462","title":"Computability Results Used in Differential Geometry","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Mathematics; Computability; Modulo; Maxima and minima; Computability theory; Differential geometry; Recursively enumerable language; Function (biology); Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.01754326544855362,"score_gpt":0.2507667551692935,"score_spread":0.23322348972073986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125293664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79638946,0.00018094522,0.19967225,0.0014706741,0.0011535063,0.0001706577,0.0000042506767,0.00006824575,0.0008899761],"genre_scores_gemma":[0.97827244,0.00000801603,0.020973077,0.0001063298,0.0005906969,0.00000177549,0.0000018547928,0.000009653356,0.000036180383],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99624825,0.00036763586,0.0015505564,0.0004882431,0.00081001734,0.0005352821],"domain_scores_gemma":[0.9975722,0.0005688246,0.00068942696,0.0007012847,0.00030349265,0.00016480194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001704792,0.00027613365,0.0007298869,0.00058122823,0.00007972668,0.00020508007,0.0016605582,0.00016160228,0.000025791991],"category_scores_gemma":[0.0002735459,0.00021672604,0.00029678908,0.0011804951,0.00013402382,0.0005071642,0.00047803283,0.00061539945,0.000020261048],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094295485,0.017839583,0.5483577,0.00040995338,0.00030147788,0.0032803307,0.0052899825,0.08452581,0.012733574,0.13700674,0.0079208715,0.18139102],"study_design_scores_gemma":[0.0030920561,0.0004804431,0.838786,0.000045427565,0.000013435512,0.00037044068,0.00003220473,0.037274256,0.0005537444,0.11850781,0.00047298722,0.0003712128],"about_ca_topic_score_codex":0.00017047167,"about_ca_topic_score_gemma":0.0000509301,"teacher_disagreement_score":0.29042828,"about_ca_system_score_codex":0.00030083847,"about_ca_system_score_gemma":0.00017394018,"threshold_uncertainty_score":0.88378316},"labels":[],"label_agreement":null},{"id":"W2127314485","doi":"10.2178/jsl/1154698593","title":"Universal spaces for classes of scattered eberlein compact spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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 Manitoba","funders":"","keywords":"Uncountable set; Mathematics; Retract; Space (punctuation); Class (philosophy); Pure mathematics; Compact space; Combinatorics; Discrete mathematics; Computer science; Countable set","score_opus":0.04099297337689255,"score_gpt":0.3262864976740784,"score_spread":0.28529352429718585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127314485","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.98176575,0.0004971059,0.011615234,0.001585689,0.00023767525,0.00014195197,0.000013895593,0.000017538308,0.004125189],"genre_scores_gemma":[0.98911005,0.000032743137,0.009687101,0.000059960345,0.00026348987,5.5613606e-7,0.0000014383387,0.000013735,0.00083095266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990262,0.000086515895,0.00044799678,0.00008759452,0.00014832354,0.00020338634],"domain_scores_gemma":[0.9980464,0.00082526327,0.0007675184,0.00013371654,0.00017780544,0.00004928953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038560378,0.00013355353,0.0005003058,0.00015880732,0.0000654091,0.000012904728,0.00021405076,0.00010621607,0.00007561517],"category_scores_gemma":[0.00018932532,0.000097410455,0.00019796408,0.00009564734,0.00021677828,0.00016072334,0.000016738448,0.00016003259,0.0000029114335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005163587,0.0004955567,0.005923642,0.00022715089,0.00021899806,0.00005203272,0.0006954677,0.000486071,0.011921537,0.9647151,0.014430175,0.00031789351],"study_design_scores_gemma":[0.0012685432,0.00041055327,0.0024890117,0.00009325759,0.00012717445,0.00015167875,0.0015619404,0.000033252854,0.0076092556,0.9838585,0.0022628445,0.00013393993],"about_ca_topic_score_codex":0.0000123562195,"about_ca_topic_score_gemma":0.000018282068,"teacher_disagreement_score":0.01914343,"about_ca_system_score_codex":0.000041541905,"about_ca_system_score_gemma":0.00006286974,"threshold_uncertainty_score":0.3972283},"labels":[],"label_agreement":null},{"id":"W2131834026","doi":"10.2178/jsl/1190150048","title":"Open questions in the theory of spaces of orderings","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Polynomial and algebraic computation","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 Saskatchewan","funders":"","keywords":"Mathematics; Ideal (ethics); Bounded function; Isotropy; Combinatorics; Space (punctuation); Finite set; Subspace topology; Linear subspace; Chain (unit); Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science; Physics","score_opus":0.03957285186282869,"score_gpt":0.2706639565630444,"score_spread":0.23109110470021574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131834026","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.9355301,0.001052982,0.0490473,0.006659975,0.0002496099,0.00014565875,7.926705e-7,0.0000067578817,0.0073067946],"genre_scores_gemma":[0.9964226,0.00006181878,0.0032215724,0.00020131584,0.00003948355,8.166662e-7,3.57002e-8,0.0000014566688,0.00005092576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923724,0.00013483787,0.00032630653,0.00005891371,0.00016203063,0.000080656544],"domain_scores_gemma":[0.99921626,0.00019729625,0.00035388744,0.00013751192,0.000072757,0.000022318667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008248591,0.000049268496,0.00017141756,0.00011252543,0.000024948351,0.00004918756,0.0012163921,0.000020988398,0.000024141973],"category_scores_gemma":[0.00009562501,0.00002870447,0.000051115443,0.00032381545,0.00004716663,0.00031832053,0.00014376771,0.00010353899,0.0000026465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018918205,0.0004758951,0.0016957232,0.000027550992,0.00003390513,0.00003007968,0.013138422,0.0014396664,0.0023369933,0.8811863,0.0010083766,0.098608136],"study_design_scores_gemma":[0.0013062797,0.0008777859,0.11003746,0.00027811396,0.000026026264,0.00041821922,0.0010615994,0.009664818,0.0016984631,0.8726615,0.0017748001,0.00019497782],"about_ca_topic_score_codex":0.000034779147,"about_ca_topic_score_gemma":0.000004714648,"teacher_disagreement_score":0.10834174,"about_ca_system_score_codex":0.000010404379,"about_ca_system_score_gemma":0.0000324561,"threshold_uncertainty_score":0.22603796},"labels":[],"label_agreement":null},{"id":"W2132277994","doi":"10.2178/jsl/1245158092","title":"A geometric zero-one law","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Graph Theory Research","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":"Mathematics; Zero (linguistics); Substructure; Combinatorics; Disjoint sets; Bounded function; Ball (mathematics); Graph; Order (exchange); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.03829468688421236,"score_gpt":0.30721491616127056,"score_spread":0.2689202292770582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132277994","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.046089076,0.0021031955,0.9273917,0.004629967,0.00034725873,0.00014105128,7.2304863e-7,0.000074435404,0.019222578],"genre_scores_gemma":[0.95949155,0.00013838106,0.038525496,0.0015422901,0.00014875391,6.498105e-7,9.55087e-8,0.000004991782,0.00014779148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825543,0.00012177816,0.0004086095,0.00016976745,0.00066249457,0.00038194127],"domain_scores_gemma":[0.99863625,0.0001819856,0.0002778325,0.00039495758,0.00029195283,0.00021704855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010832112,0.00011703686,0.00030414274,0.0006653997,0.00010198875,0.000116253745,0.0014408118,0.00006092328,0.00002545479],"category_scores_gemma":[0.00020665018,0.0000892941,0.00015434125,0.0017411974,0.00007576349,0.0007504704,0.000108991444,0.00040791,0.00006237085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022175562,0.0002062418,0.00011587792,0.0000047095323,0.000023237235,0.00016391031,0.00013559307,0.00016727496,0.004816855,0.9493928,0.00039951215,0.044551823],"study_design_scores_gemma":[0.0005751185,0.00092035905,0.0050801025,0.000027167467,0.000007059938,0.00055535045,0.0000119511415,0.00018136026,0.002728864,0.98760605,0.0021676458,0.00013895951],"about_ca_topic_score_codex":0.000001867626,"about_ca_topic_score_gemma":2.6546985e-7,"teacher_disagreement_score":0.9134025,"about_ca_system_score_codex":0.000065038235,"about_ca_system_score_gemma":0.000064657914,"threshold_uncertainty_score":0.36413077},"labels":[],"label_agreement":null},{"id":"W2136273143","doi":"10.2178/jsl.7801130","title":"Random reals, the rainbow Ramsey theorem, and arithmetic conservation","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rainbow; Ramsey's theorem; Mathematics; Ramsey theory; Section (typography); Discrete mathematics; Base (topology); Order (exchange); Combinatorics; Ran; Arithmetic; Computer science","score_opus":0.014036435300935724,"score_gpt":0.22707625445158258,"score_spread":0.21303981915064685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136273143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48856324,0.0023648052,0.43656212,0.06752932,0.0013883708,0.0009678455,0.0000013163746,0.00011396465,0.0025090333],"genre_scores_gemma":[0.9685496,0.00019193285,0.027989646,0.0028476054,0.00030911408,0.000010858093,3.249681e-7,0.000008762628,0.00009216558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792385,0.00044709,0.00064229436,0.00023813189,0.00045455946,0.00029408804],"domain_scores_gemma":[0.99729973,0.0010877369,0.0005044583,0.00048355805,0.0004744121,0.0001501309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002240595,0.00018479921,0.00042132073,0.00013911302,0.00018216035,0.00042236265,0.0010548563,0.0000871256,0.000048034624],"category_scores_gemma":[0.00055373454,0.0001013414,0.00013932004,0.00039535106,0.000244475,0.0005926597,0.0002831381,0.00036951632,0.000025858246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017425008,0.00094493537,0.020863162,0.00014458678,0.00046891192,0.0002046714,0.010956509,0.0014350835,0.004571101,0.38719073,0.022092005,0.55095404],"study_design_scores_gemma":[0.0028625978,0.00047820897,0.14185353,0.000053840628,0.00004494045,0.0017384249,0.00025680024,0.07810865,0.00019671228,0.7716517,0.0024486226,0.00030601033],"about_ca_topic_score_codex":0.00008810585,"about_ca_topic_score_gemma":0.0000032907042,"teacher_disagreement_score":0.55064803,"about_ca_system_score_codex":0.000054631262,"about_ca_system_score_gemma":0.00011546191,"threshold_uncertainty_score":0.41325822},"labels":[],"label_agreement":null},{"id":"W2148956539","doi":"10.2178/jsl/1278682213","title":"Quantifier elimination in valued Ore modules","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantifier elimination; Valuation (finance); Mathematics; Quantifier (linguistics); Residue field; Property (philosophy); Independence (probability theory); Field (mathematics); Pure mathematics; Discrete mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.015861606892785717,"score_gpt":0.2604011465616606,"score_spread":0.24453953966887487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148956539","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.9375322,0.000119370394,0.059128504,0.0014323125,0.00093062734,0.000041991436,3.3624707e-7,0.000022176784,0.00079248234],"genre_scores_gemma":[0.98184913,0.000019488689,0.017597897,0.0002841832,0.00017197682,8.7117803e-7,2.3314769e-7,0.000004347898,0.00007185576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908173,0.00005839006,0.00034086776,0.000115354225,0.00024389471,0.00015978167],"domain_scores_gemma":[0.999283,0.000073989584,0.00024156545,0.00023247834,0.00010832307,0.000060618146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094926864,0.000081638034,0.00017827802,0.00023494472,0.0000356277,0.00011580482,0.00066722545,0.00007417112,0.000025195557],"category_scores_gemma":[0.00013498489,0.000058398957,0.00007272403,0.00025842804,0.00003381753,0.00071609113,0.000067945504,0.0003244979,0.000017364437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009314194,0.00016215509,0.0013258678,0.000010615601,0.000010985966,0.00010734148,0.001031453,0.000114220005,0.04411232,0.9033015,0.0004160444,0.049398217],"study_design_scores_gemma":[0.0013586006,0.00029207428,0.34640542,0.000104557126,0.000015277372,0.00097331003,0.00027955556,0.06364047,0.012039174,0.5730085,0.0015188077,0.00036426252],"about_ca_topic_score_codex":0.000006837349,"about_ca_topic_score_gemma":0.000007131606,"teacher_disagreement_score":0.34507954,"about_ca_system_score_codex":0.000018853656,"about_ca_system_score_gemma":0.000042584135,"threshold_uncertainty_score":0.23814403},"labels":[],"label_agreement":null},{"id":"W2149062436","doi":"10.2178/jsl/1190150032","title":"A new “feasible” arithmetic","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":20,"is_retracted":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; Realizability; Second-order arithmetic; Recursion (computer science); Peano axioms; Arithmetic; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.04343371595259829,"score_gpt":0.2550560087855378,"score_spread":0.2116222928329395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149062436","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.0027380993,0.0061148866,0.9485532,0.0035122414,0.002146081,0.00016564678,1.2930165e-7,0.000110963854,0.036658738],"genre_scores_gemma":[0.9758767,0.00014513022,0.019951187,0.00048490416,0.0007369984,0.0000011783728,7.3552876e-8,0.000008115327,0.0027957372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984853,0.00008687747,0.0004905418,0.00017502325,0.00044447646,0.00031774057],"domain_scores_gemma":[0.99878013,0.000060386814,0.00040975813,0.0003367418,0.0001477995,0.00026515583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047150138,0.0001450196,0.00033348543,0.00021364626,0.00007678684,0.00022069302,0.0010313567,0.0000867633,0.00015922135],"category_scores_gemma":[0.00008513352,0.000099319346,0.00019091548,0.00046345955,0.000028169781,0.00041729925,0.000096330885,0.0002596491,0.00030993018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067043807,0.00027570652,0.002195498,0.000037367183,0.0001083666,0.0005918362,0.002557165,0.000055122568,0.00038735283,0.71259916,0.036494672,0.24469103],"study_design_scores_gemma":[0.0036065879,0.0024043925,0.007785151,0.000060257997,0.0001034296,0.010520313,0.00023605843,0.0074237045,0.0007336706,0.6811344,0.28505293,0.00093908],"about_ca_topic_score_codex":0.000027046091,"about_ca_topic_score_gemma":0.000002229067,"teacher_disagreement_score":0.9731386,"about_ca_system_score_codex":0.000052392123,"about_ca_system_score_gemma":0.00007079533,"threshold_uncertainty_score":0.40501255},"labels":[],"label_agreement":null},{"id":"W2149642761","doi":"10.2307/2695103","title":"Number of variables is equivalent to space","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","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":"Arity; Mathematics; Set (abstract data type); Sequence (biology); PSPACE; Discrete mathematics; Space (punctuation); Turing; Quantifier (linguistics); DSPACE; Universe; Combinatorics; Computational complexity theory; Algorithm; Computer science; Artificial intelligence","score_opus":0.02309942492369837,"score_gpt":0.28764868821992434,"score_spread":0.26454926329622597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149642761","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.71149904,0.00042071642,0.2637212,0.006995613,0.0007165393,0.000086552944,0.0000019601139,0.000035990222,0.016522402],"genre_scores_gemma":[0.9625824,0.00014509587,0.03475369,0.0017540893,0.00020631295,7.55024e-7,7.177367e-8,0.0000063933653,0.00055117375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988349,0.000052977575,0.0004027859,0.00013062316,0.00035443116,0.00022425408],"domain_scores_gemma":[0.9989681,0.00009306929,0.0003147231,0.00031907955,0.00016130047,0.00014367996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006166722,0.00010444072,0.00028785903,0.00011473593,0.000034786866,0.000051753803,0.0008715022,0.00004865395,0.00031427035],"category_scores_gemma":[0.000058055935,0.000075119206,0.00012430079,0.00040222262,0.000026203112,0.00028370688,0.00018386444,0.00011749322,0.00008513418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008288222,0.0007058302,0.015386541,0.0000718175,0.00020142978,0.00049166504,0.006002048,0.0006446082,0.02917047,0.8693613,0.037610605,0.040270824],"study_design_scores_gemma":[0.0026457973,0.0014473143,0.044623673,0.0007839345,0.000114335824,0.0086994,0.00089132716,0.0058237654,0.033165183,0.8015763,0.09919829,0.001030671],"about_ca_topic_score_codex":0.000014187,"about_ca_topic_score_gemma":2.8313679e-7,"teacher_disagreement_score":0.25108337,"about_ca_system_score_codex":0.000035528,"about_ca_system_score_gemma":0.00006352983,"threshold_uncertainty_score":0.344104},"labels":[],"label_agreement":null},{"id":"W2150526717","doi":"10.2307/2695105","title":"Cofinitary groups, almost disjoint and dominating families","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"York University","funders":"","keywords":"Disjoint sets; Cardinality (data modeling); Combinatorics; Mathematics; Group (periodic table); Genealogy; Computer science; History; Physics; Data mining","score_opus":0.03888326236427211,"score_gpt":0.31860977929055406,"score_spread":0.279726516926282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150526717","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.98553115,0.0011610213,0.0048995786,0.0007002405,0.00021416672,0.00006401749,0.0000016178902,0.00001820464,0.0074099805],"genre_scores_gemma":[0.9888431,0.0009372439,0.0093688965,0.00034828592,0.0002494499,0.0000012978265,4.9584247e-7,0.000012563582,0.0002386569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990391,0.0000988253,0.00043829,0.00009343302,0.0001358309,0.00019451701],"domain_scores_gemma":[0.9987147,0.00067594094,0.00033137895,0.000115693576,0.00008094565,0.00008138162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006044341,0.00012530119,0.00035771297,0.00010809995,0.000120071294,0.000011324094,0.00012935814,0.000088200155,0.000090940695],"category_scores_gemma":[0.0006299663,0.00008867583,0.000079873615,0.00008981072,0.00018619606,0.00017259835,0.000054183252,0.00029988727,0.000006850528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035547797,0.00038255082,0.011493729,0.00012631415,0.00020683889,0.0012760498,0.0073325466,0.000027906039,0.0024523395,0.9504723,0.0012741782,0.024599764],"study_design_scores_gemma":[0.0006969012,0.00021254366,0.0037363344,0.00006790196,0.000053462787,0.0028227367,0.0044445707,0.000032813106,0.00014058994,0.9870232,0.0006473236,0.00012163125],"about_ca_topic_score_codex":0.0000019309107,"about_ca_topic_score_gemma":0.000003838449,"teacher_disagreement_score":0.036550887,"about_ca_system_score_codex":0.000029583498,"about_ca_system_score_gemma":0.00002176981,"threshold_uncertainty_score":0.36160955},"labels":[],"label_agreement":null},{"id":"W2152194681","doi":"10.2307/2695043","title":"Elementary properties of power series fields over finite fields","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"University of Saskatchewan","funders":"","keywords":"Mathematics; Axiom; Power series; Action (physics); Pure mathematics; Function field; Simple (philosophy); Uniformization (probability theory); Field (mathematics); Property (philosophy); Independence (probability theory); Rational function; Elementary theory; Function (biology); Series (stratigraphy); Algebra over a field; Mathematical analysis; Computer science","score_opus":0.04241540272867443,"score_gpt":0.3007000092058296,"score_spread":0.2582846064771552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152194681","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.98872215,0.0007604141,0.0035697743,0.0012631962,0.00032033812,0.00007460073,0.0000018941481,0.000012436462,0.005275185],"genre_scores_gemma":[0.9952879,0.0003484496,0.0020514317,0.0007269318,0.00013932344,0.000001488641,3.0961485e-7,0.000009076768,0.0014350784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990188,0.00007323671,0.0005025145,0.00007141295,0.00016293496,0.00017113317],"domain_scores_gemma":[0.99916244,0.00016745388,0.0003560892,0.00016147169,0.000106775056,0.000045759854],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031618588,0.0001130823,0.00033939152,0.00008842454,0.00005212189,0.0000059527574,0.0001868349,0.00013260535,0.001015781],"category_scores_gemma":[0.00028051107,0.00007537498,0.00013116784,0.00007833218,0.00012537325,0.00021360815,0.00004485537,0.00028816552,0.000004973039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046981513,0.0022550053,0.026313867,0.00077312975,0.0016074465,0.0013872188,0.025525045,0.0008806934,0.016694555,0.88834864,0.024829648,0.006686615],"study_design_scores_gemma":[0.0007954017,0.00081127085,0.0010652269,0.00014804697,0.0000766412,0.0005464984,0.0017926026,0.000011548836,0.0076985024,0.98314714,0.003738264,0.0001688361],"about_ca_topic_score_codex":0.0000034236355,"about_ca_topic_score_gemma":0.000008984741,"teacher_disagreement_score":0.094798535,"about_ca_system_score_codex":0.000016616486,"about_ca_system_score_gemma":0.000036330177,"threshold_uncertainty_score":0.9998974},"labels":[],"label_agreement":null},{"id":"W2156168582","doi":"10.2178/jsl.7801150","title":"On the decidability of implicational ticket entailment","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","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 Alberta","funders":"","keywords":"Decidability; Fragment (logic); Combinatory logic; Logical consequence; Mathematics; Discrete mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.0279169468557467,"score_gpt":0.261768744220187,"score_spread":0.23385179736444028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156168582","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.791383,0.00039123802,0.1802254,0.013441265,0.0010064066,0.00080882956,8.9026173e-7,0.000036683694,0.012706274],"genre_scores_gemma":[0.9980641,0.000009192578,0.0012239818,0.0005136838,0.00010556963,0.000013078675,1.7482678e-7,0.000002754614,0.00006744871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873817,0.00011921092,0.00046331182,0.00011792495,0.00040431123,0.0001570736],"domain_scores_gemma":[0.99847656,0.00030242366,0.00046728883,0.00037673558,0.00030040983,0.00007656587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082492764,0.000086412074,0.0001947091,0.000059511105,0.00006186524,0.00007306306,0.0008651742,0.000042250544,0.00013833713],"category_scores_gemma":[0.00014124339,0.000043221582,0.00012937014,0.00016939132,0.00006954296,0.00017335484,0.00008940535,0.00014038109,0.000099040146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004364262,0.00020463213,0.0042982777,0.000010414328,0.00003392207,0.000002164631,0.00041526125,0.000021409898,0.00089125073,0.9807694,0.0036849144,0.009663995],"study_design_scores_gemma":[0.00032304684,0.00057746074,0.10499377,0.000009711879,0.000010620005,0.00013327888,0.00013351474,0.00057218823,0.0018007337,0.8884398,0.0028964826,0.000109396744],"about_ca_topic_score_codex":0.0000302042,"about_ca_topic_score_gemma":8.802956e-7,"teacher_disagreement_score":0.2066811,"about_ca_system_score_codex":0.00005563663,"about_ca_system_score_gemma":0.00008247024,"threshold_uncertainty_score":0.1762525},"labels":[],"label_agreement":null},{"id":"W2157412138","doi":"10.2178/jsl.7803170","title":"The Theory of Tracial Von Neumann Algebras Does Not Have A Model Companion","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Operator Algebra Research","field":"Mathematics","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":"McMaster University","funders":"National Science Foundation","keywords":"Von Neumann architecture; Embedding; Von Neumann algebra; Mathematics; Pure mathematics; Quantifier (linguistics); Quantifier elimination; Model theory; Mathematical economics; Discrete mathematics; Philosophy; Computer science; Epistemology","score_opus":0.06081567080979107,"score_gpt":0.3393238393058795,"score_spread":0.27850816849608845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157412138","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.9857713,0.00022170274,0.010768455,0.0012865225,0.00019137532,0.00036308164,0.0000055665423,0.000016962043,0.0013750499],"genre_scores_gemma":[0.99429876,0.00014049927,0.004312595,0.0001469934,0.00024322742,0.0000117421905,3.200701e-7,0.00003019786,0.0008156635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976243,0.0002851969,0.0008570702,0.00013402184,0.00073184475,0.00036756805],"domain_scores_gemma":[0.99719304,0.0010702652,0.00061435293,0.00034489235,0.00063422875,0.00014324235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014775646,0.0001854377,0.0004902656,0.00013137978,0.0001948067,0.00008013387,0.00064174633,0.0001091759,0.00013418277],"category_scores_gemma":[0.0009181689,0.00008899392,0.00022704064,0.000117884345,0.00026594137,0.00036152758,0.000108716216,0.0005747216,0.000025180454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003396245,0.0005206803,0.0006513252,0.00013831661,0.0002447332,0.000025040074,0.0041334024,0.0010789618,0.05239304,0.9254983,0.0019144884,0.013062078],"study_design_scores_gemma":[0.00062133686,0.00020263702,0.0012158751,0.00005981608,0.000039737166,0.00006378441,0.0015664791,0.0055709463,0.009913307,0.9805623,0.000053756983,0.00013000131],"about_ca_topic_score_codex":0.0000057204566,"about_ca_topic_score_gemma":0.000009159881,"teacher_disagreement_score":0.055064015,"about_ca_system_score_codex":0.00007984154,"about_ca_system_score_gemma":0.0001326125,"threshold_uncertainty_score":0.36290666},"labels":[],"label_agreement":null},{"id":"W2157945276","doi":"10.2178/jsl/1254748693","title":"The strength of the rainbow Ramsey Theorem","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ramsey's theorem; Ramsey theory; Converse; Mathematics; Rainbow; Corollary; Combinatorics; Discrete mathematics; Carlson's theorem; Randomness; Constant (computer programming); Injective function; Brouwer fixed-point theorem; Danskin's theorem; Fixed-point theorem; Physics; Computer science; Statistics","score_opus":0.011784069883553738,"score_gpt":0.24186200937785363,"score_spread":0.2300779394942999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157945276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7492847,0.0054665403,0.13384613,0.08383866,0.0068063703,0.0010289424,0.000005641969,0.00017897681,0.019544035],"genre_scores_gemma":[0.9921049,0.00009428392,0.006612201,0.0007681902,0.00031293862,7.35507e-7,5.4351176e-8,0.000004758726,0.0001019766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976839,0.0003680973,0.00071856217,0.00018924032,0.0007044823,0.00033574147],"domain_scores_gemma":[0.99727386,0.0006267174,0.0007720922,0.0008698993,0.00035309902,0.00010435381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019468638,0.00017331986,0.00034768056,0.00007840814,0.00023800366,0.00015229413,0.0032632449,0.00007580712,0.000012158365],"category_scores_gemma":[0.00045775293,0.000077195065,0.00035427752,0.0006070921,0.00022297098,0.00023370818,0.0003152204,0.00045751987,0.0000049354016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034031076,0.0006082954,0.002129616,0.000013856956,0.00010388821,0.000042885273,0.0026463803,0.0011572387,0.0015463016,0.5166019,0.0027932741,0.4723223],"study_design_scores_gemma":[0.00086877495,0.0008670487,0.13352394,0.00006437074,0.000032769658,0.0005991025,0.00021413734,0.010248995,0.002355637,0.8459928,0.0049897954,0.00024264625],"about_ca_topic_score_codex":0.000004442471,"about_ca_topic_score_gemma":0.0000018035413,"teacher_disagreement_score":0.47207963,"about_ca_system_score_codex":0.00007466425,"about_ca_system_score_gemma":0.00020407973,"threshold_uncertainty_score":0.6063975},"labels":[],"label_agreement":null},{"id":"W2161054195","doi":"10.2178/jsl/1120224719","title":"Lexicographic exponentiation of chains","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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 Saskatchewan","funders":"","keywords":"Lexicographical order; Countable set; Mathematics; Exponentiation; Cartesian product; Focus (optics); Homogeneous; Power (physics); Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.05006869586978464,"score_gpt":0.3446588045126787,"score_spread":0.2945901086428941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161054195","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.96822906,0.0006888832,0.02700227,0.0008266667,0.00019275269,0.0000618294,0.0000012577906,0.00001419328,0.0029831026],"genre_scores_gemma":[0.9887349,0.00016439827,0.0104357,0.00014844675,0.0002741123,8.007105e-7,3.752048e-7,0.000007972479,0.00023327522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909776,0.00007947302,0.00048434772,0.000056885263,0.00015585158,0.00012570655],"domain_scores_gemma":[0.9989457,0.00018720233,0.0006082051,0.00012293295,0.00009003881,0.000045937435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053267454,0.00007936807,0.0002744958,0.00019345088,0.00003879305,0.0000030136218,0.00014693743,0.00008716068,0.0001239671],"category_scores_gemma":[0.00023777474,0.00005939768,0.00015015462,0.00012341792,0.00009524643,0.00014778889,0.000016099384,0.00018339434,0.0000067847104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010145495,0.0003992464,0.0015198399,0.000042145897,0.00012224897,0.000015808015,0.001638976,0.00011922873,0.008606653,0.9813371,0.00056073844,0.0055366023],"study_design_scores_gemma":[0.0007156236,0.00020166079,0.0020332464,0.000046958008,0.00006649618,0.00020255403,0.00036784206,0.00008298624,0.005832429,0.9895136,0.0008477239,0.00008889842],"about_ca_topic_score_codex":3.873568e-7,"about_ca_topic_score_gemma":0.0000018232442,"teacher_disagreement_score":0.020505873,"about_ca_system_score_codex":0.000019931915,"about_ca_system_score_gemma":0.000024905305,"threshold_uncertainty_score":0.2422167},"labels":[],"label_agreement":null},{"id":"W2163037973","doi":"10.2307/2586689","title":"On the role of implication in formal logic","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","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":"Concordia University","funders":"","keywords":"Finitary; Negation; Mathematics; Proof calculus; Second-order logic; Non-classical logic; Classical logic; Higher-order logic; Predicate logic; Computer science; Discrete mathematics; Calculus (dental); Programming language; Logical consequence; Natural deduction; Description logic; Artificial intelligence","score_opus":0.012738441753293799,"score_gpt":0.2407078262733269,"score_spread":0.2279693845200331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163037973","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.90351975,0.0010319388,0.0037004685,0.0014403545,0.00013913587,0.00013803344,6.176242e-7,0.000018057106,0.09001164],"genre_scores_gemma":[0.99858516,0.00015254422,0.00066184,0.00038670513,0.000097243814,0.0000029264647,1.677701e-7,0.0000034874927,0.00010993269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988834,0.00010121897,0.00042321207,0.00011706329,0.00024125875,0.00023380156],"domain_scores_gemma":[0.9990729,0.00018049065,0.0002995727,0.00028746243,0.00010232311,0.000057224035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077780365,0.000101201906,0.00022138421,0.0001228088,0.000061182545,0.00003936229,0.0009172968,0.00006544677,0.00015167755],"category_scores_gemma":[0.0000851013,0.000054967888,0.00011748114,0.00034375172,0.00004574225,0.00032056784,0.00005619214,0.00023730502,0.00006401826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000344561,0.00024746594,0.001431509,0.000005743378,0.0000144731175,0.000012440232,0.0015488536,0.00035226147,0.0020186433,0.8925453,0.00032586642,0.10146298],"study_design_scores_gemma":[0.0008732707,0.0011634716,0.07519466,0.00008138268,0.00001315208,0.000369865,0.00019744686,0.0052214805,0.0050764424,0.90647304,0.0051268176,0.0002089713],"about_ca_topic_score_codex":0.000011092456,"about_ca_topic_score_gemma":0.0000030038705,"teacher_disagreement_score":0.10125401,"about_ca_system_score_codex":0.000047392215,"about_ca_system_score_gemma":0.000068808,"threshold_uncertainty_score":0.22415254},"labels":[],"label_agreement":null},{"id":"W2295043651","doi":"10.1017/jsl.2014.72","title":"HOMOGENEITY AND FIX-POINTS: GOING FORTH!","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; London Mathematical Society","keywords":"Automorphism; Homogeneity (statistics); Homogeneous; Countable set; Mathematics; Automorphism group; Computer science; Discrete mathematics; Combinatorics; Statistics","score_opus":0.043289272169363895,"score_gpt":0.27150557796513153,"score_spread":0.22821630579576763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295043651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62351656,0.0023142602,0.36639354,0.003615625,0.0013861089,0.00016226305,0.0000015516385,0.00008611466,0.0025240134],"genre_scores_gemma":[0.903882,0.00006603426,0.09496794,0.00059571414,0.0004234159,0.0000014681682,2.1104061e-7,0.00000841604,0.000054746346],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816436,0.00015375407,0.0005708427,0.00027358718,0.00051002036,0.00032744234],"domain_scores_gemma":[0.99821407,0.0001738969,0.00039242057,0.00041585913,0.00041476323,0.00038901693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017015915,0.00017945796,0.0004135264,0.00018612006,0.00008318955,0.00018906449,0.00092834636,0.000085600055,0.000008937376],"category_scores_gemma":[0.0004065158,0.00013521232,0.00013028354,0.0003680672,0.000092812144,0.0006859243,0.0005194582,0.0003003142,0.000024235507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015986945,0.0018371318,0.19730876,0.00022354044,0.0004413888,0.0019738548,0.013202061,0.0028877454,0.00157999,0.1115684,0.017006123,0.6518111],"study_design_scores_gemma":[0.0044786613,0.0029836472,0.1650875,0.00015895603,0.00009081261,0.009743997,0.0004782371,0.06701407,0.0013292797,0.73253864,0.01496804,0.0011281536],"about_ca_topic_score_codex":0.000014573038,"about_ca_topic_score_gemma":0.0000064913716,"teacher_disagreement_score":0.650683,"about_ca_system_score_codex":0.00012459619,"about_ca_system_score_gemma":0.00021837147,"threshold_uncertainty_score":0.55137986},"labels":[],"label_agreement":null},{"id":"W2405635038","doi":"10.1017/jsl.2014.40","title":"SEMILATTICES AND THE RAMSEY PROPERTY","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"York University","funders":"","keywords":"Mathematics; Class (philosophy); Automorphism; Bounded function; Combinatorics; Ergodic theory; Limit (mathematics); Interpretation (philosophy); Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.10405579147128327,"score_gpt":0.3456146284198892,"score_spread":0.24155883694860594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405635038","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.9310728,0.0057511097,0.004950059,0.015356201,0.00075013825,0.00032157643,0.0000013744746,0.000037932026,0.04175886],"genre_scores_gemma":[0.9929843,0.00016444632,0.004191693,0.0007851621,0.00026081945,0.0000017281408,7.4838965e-8,0.0000076317965,0.0016041349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921906,0.0001964746,0.00027165064,0.000056727058,0.00014143832,0.00011465401],"domain_scores_gemma":[0.998898,0.00049361715,0.0002809183,0.00012252975,0.00012435079,0.00008054232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016543404,0.000076980585,0.0002676106,0.000033758693,0.00006184155,0.00001439308,0.00020843497,0.000062078856,0.00002371529],"category_scores_gemma":[0.0012389477,0.000028451586,0.000053951328,0.000050220096,0.00032845032,0.00011279787,0.000054076212,0.00024845745,0.0000073127035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066288846,0.00009550029,0.00063696835,0.000035738238,0.00012406027,0.00006984925,0.0061853174,0.000015202297,0.00009631535,0.98217505,0.006725562,0.0031775518],"study_design_scores_gemma":[0.0015448718,0.000100914665,0.00010993338,0.000021151942,0.00005687477,0.0007478244,0.0013338052,0.000038809394,0.000053937627,0.9919543,0.0039868956,0.00005067912],"about_ca_topic_score_codex":0.00000161097,"about_ca_topic_score_gemma":0.0000012832935,"teacher_disagreement_score":0.06191156,"about_ca_system_score_codex":0.000015469102,"about_ca_system_score_gemma":0.0000472894,"threshold_uncertainty_score":0.14832255},"labels":[],"label_agreement":null},{"id":"W2466224125","doi":"10.1017/jsl.2018.87","title":"AMALGAMABLE DIAGRAM SHAPES","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","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":"Diagram; Endomorphism; Decidability; Mathematics; Combinatorics; Idempotence; Simple (philosophy); Discrete mathematics; Pure mathematics","score_opus":0.01937334384823893,"score_gpt":0.24700883059446954,"score_spread":0.2276354867462306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466224125","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.30292007,0.00598106,0.57329136,0.0029719016,0.0071918448,0.0007581689,6.555978e-7,0.00031518438,0.106569745],"genre_scores_gemma":[0.9953166,0.0000683311,0.0024710293,0.00040847142,0.00034056464,0.0000020390114,1.8373711e-7,0.000007680971,0.001385079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855673,0.000081835584,0.000450302,0.00018598432,0.00040162215,0.0003235362],"domain_scores_gemma":[0.9988782,0.00007166942,0.0004410434,0.00028079984,0.00018846222,0.0001398191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007306534,0.0001384701,0.00035991656,0.00015024099,0.00005749225,0.00021583268,0.0010342307,0.00008817526,0.00008647329],"category_scores_gemma":[0.000049633407,0.00009124741,0.00018732563,0.00030279832,0.000027740492,0.0005227116,0.0001328548,0.00023625074,0.0005227077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015349813,0.00023417787,0.020313976,0.00007253743,0.00011257375,0.00019186389,0.0013838984,0.00023459268,0.0019677877,0.91465247,0.0029686973,0.057852104],"study_design_scores_gemma":[0.004512308,0.0043506306,0.07108574,0.00009669961,0.000093388444,0.0040749274,0.0005754412,0.016633753,0.002388812,0.5934359,0.3013299,0.0014224898],"about_ca_topic_score_codex":0.000018440682,"about_ca_topic_score_gemma":0.0000015500854,"teacher_disagreement_score":0.6923965,"about_ca_system_score_codex":0.00004480245,"about_ca_system_score_gemma":0.000093740025,"threshold_uncertainty_score":0.6718524},"labels":[],"label_agreement":null},{"id":"W2594069757","doi":"10.2178/jsl/1174668399","title":"Forcing indestructibility of set-theoretic axioms","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Axiom; Forcing (mathematics); Consistency (knowledge bases); Countable set; Hierarchy; Set (abstract data type); Mathematics; Set theory; Zermelo–Fraenkel set theory; Mathematical economics; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Axiom of choice; Geometry; Mathematical analysis; Programming language; Economics","score_opus":0.05022263839091771,"score_gpt":0.3662132275233379,"score_spread":0.3159905891324202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594069757","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.9235538,0.0001854367,0.07279586,0.00007905182,0.00028704855,0.000075487165,0.0000014105658,0.0000118611715,0.00301004],"genre_scores_gemma":[0.98813725,0.000022698885,0.011515432,0.00008033221,0.00016741079,2.8930674e-7,2.3123457e-7,0.000012026036,0.0000643375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851364,0.000105298386,0.00081401423,0.00010030179,0.0002188636,0.00024788582],"domain_scores_gemma":[0.9977742,0.00091874326,0.0007903845,0.0002340138,0.00019139683,0.00009129245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002671351,0.00012281173,0.0004544501,0.00016554186,0.000056605353,0.000003935046,0.00024239015,0.00015188666,0.00015226478],"category_scores_gemma":[0.0011620882,0.00008889948,0.0001675753,0.0001625129,0.0003404902,0.00012166423,0.000040798113,0.00037455757,0.0000037589064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022545576,0.000113767936,0.004767672,0.00010922632,0.00006517972,0.00005785432,0.0018468021,0.000019643774,0.0025493244,0.98797774,0.000031711686,0.0022356145],"study_design_scores_gemma":[0.00048696928,0.00021532521,0.005390479,0.0000524771,0.00005251079,0.0005353066,0.001254258,0.0000084176245,0.0074190605,0.98447496,0.000024828569,0.00008543884],"about_ca_topic_score_codex":0.0000017175009,"about_ca_topic_score_gemma":0.0000028365998,"teacher_disagreement_score":0.064583436,"about_ca_system_score_codex":0.00005740651,"about_ca_system_score_gemma":0.000051958512,"threshold_uncertainty_score":0.36252153},"labels":[],"label_agreement":null},{"id":"W2594244112","doi":"10.2307/2586531","title":"A finite basis theorem for residually finite, congruence meet-semidistributive varieties","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":41,"is_retracted":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":"Congruence (geometry); Mathematics; Variety (cybernetics); Pure mathematics; Finitely-generated abelian group; Algebra over a field; Discrete mathematics; Geometry","score_opus":0.017192324627891224,"score_gpt":0.2566598042498143,"score_spread":0.2394674796219231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594244112","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.023853358,0.0014158437,0.9596629,0.0033949495,0.0005022628,0.00032853012,0.00004288645,0.00010034427,0.010698918],"genre_scores_gemma":[0.9614234,0.00041473942,0.03536341,0.0017065248,0.0002862003,0.000014273187,0.0000029008706,0.000013281931,0.0007752561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800915,0.0001367639,0.00066305604,0.00030308124,0.00041389375,0.00047404313],"domain_scores_gemma":[0.9971274,0.0013818853,0.0004651418,0.00038634863,0.00045406935,0.00018516107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007907827,0.00024321716,0.0004800592,0.00014019298,0.00023100644,0.00016268378,0.0012946019,0.00012620924,0.00018551986],"category_scores_gemma":[0.0006973513,0.0001756733,0.00025803092,0.00046312617,0.00017331676,0.0007491341,0.000090684145,0.00027705438,0.000029387911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031599926,0.00027892427,0.00043414155,0.000048679387,0.00016525059,0.00024885233,0.0024847982,0.010796637,0.00054676924,0.9245266,0.0042965747,0.05585681],"study_design_scores_gemma":[0.0012428146,0.0011517748,0.0021747877,0.00008695051,0.00005032439,0.00027497028,0.00020717783,0.0045499043,0.0023251495,0.9735354,0.013994158,0.0004065457],"about_ca_topic_score_codex":0.0000039666875,"about_ca_topic_score_gemma":0.0000026257446,"teacher_disagreement_score":0.93757004,"about_ca_system_score_codex":0.00007165383,"about_ca_system_score_gemma":0.00022039784,"threshold_uncertainty_score":0.71637493},"labels":[],"label_agreement":null},{"id":"W2594338555","doi":"10.2178/jsl.7802100","title":"Unexpected imaginaries in valued fields with analytic structure","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"McMaster University","funders":"","keywords":"The Imaginary; Code (set theory); Algebraic number; Algebra over a field; Field (mathematics); Mathematics; Pure mathematics; Algebraic structure; Theoretical physics; Computer science; Mathematical analysis; Physics; Programming language; Psychology; Psychoanalysis","score_opus":0.017701862650279784,"score_gpt":0.2909146382977195,"score_spread":0.27321277564743973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594338555","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.9922242,0.00021377161,0.0046703704,0.0011971779,0.00009767313,0.000108635446,9.29728e-7,0.000014530826,0.001472678],"genre_scores_gemma":[0.9888063,0.000012638805,0.010520108,0.00029144512,0.00009215794,0.0000018814976,4.7774165e-7,0.000010318733,0.00026464072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991071,0.00009532971,0.00035993636,0.000090539266,0.00014659206,0.0002004614],"domain_scores_gemma":[0.9991123,0.00022102428,0.0002912276,0.00015856743,0.00015668593,0.000060213213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015421216,0.00012664052,0.0003765632,0.00016767267,0.000042122596,0.000018844881,0.00018422272,0.00011119392,0.000585327],"category_scores_gemma":[0.00026998756,0.00007636521,0.00005637264,0.00020079824,0.00014722804,0.00022652197,0.000021118654,0.00044490743,0.000007275642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006144433,0.00053485826,0.040422168,0.00019927692,0.00052391645,0.000986366,0.010787631,0.0011090277,0.0057216533,0.93273664,0.004145365,0.0022186607],"study_design_scores_gemma":[0.00075203826,0.00022018673,0.012205361,0.00004613316,0.000040659346,0.0003671306,0.0010496895,0.000074177384,0.00037738227,0.98473233,0.00002787725,0.00010705201],"about_ca_topic_score_codex":0.000010500691,"about_ca_topic_score_gemma":0.000025314715,"teacher_disagreement_score":0.05199568,"about_ca_system_score_codex":0.000039388735,"about_ca_system_score_gemma":0.00005532668,"threshold_uncertainty_score":0.64089197},"labels":[],"label_agreement":null},{"id":"W2601794338","doi":"10.1017/jsl.2016.43","title":"DEGREES OF CATEGORICITY ON A CONE VIA<i>η</i>-SYSTEMS","year":2017,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cone (formal languages); Degree (music); Mathematics; Isomorphism (crystallography); Limit (mathematics); Turing; Discrete mathematics; Combinatorics; Turing machine; Pure mathematics; Computer science; Algorithm; Mathematical analysis; Physics","score_opus":0.04343881680507022,"score_gpt":0.2852791939979936,"score_spread":0.2418403771929234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601794338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.505047,0.0011070494,0.47881567,0.0026450488,0.0050084204,0.00039977347,0.0000050555436,0.000075249955,0.0068967217],"genre_scores_gemma":[0.99043626,0.000046301702,0.008844227,0.00009872065,0.0004917944,0.0000024731846,1.5693932e-7,0.000008721888,0.00007135105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99757314,0.00017935081,0.0008687314,0.00029447835,0.0007452275,0.00033907613],"domain_scores_gemma":[0.9959272,0.00026986154,0.0017743765,0.001235938,0.0006007315,0.00019189397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001399932,0.00022339298,0.0007369297,0.00021661763,0.00023633268,0.00027068,0.0029230653,0.00011939159,0.0000112980415],"category_scores_gemma":[0.00037089034,0.00015916357,0.0002550418,0.00017290363,0.0002018012,0.00055943115,0.0004266836,0.00037483202,0.000023901795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045521097,0.006876443,0.0809702,0.000745092,0.001121362,0.002317253,0.0073263682,0.056090478,0.02173518,0.5656882,0.007066781,0.24960746],"study_design_scores_gemma":[0.00542861,0.00690498,0.6008714,0.00046585497,0.00014719975,0.0038555164,0.00023922796,0.23758017,0.0061537707,0.13303798,0.003896864,0.0014184233],"about_ca_topic_score_codex":0.00023719901,"about_ca_topic_score_gemma":0.000009665654,"teacher_disagreement_score":0.5199012,"about_ca_system_score_codex":0.00011481977,"about_ca_system_score_gemma":0.000155903,"threshold_uncertainty_score":0.6490502},"labels":[],"label_agreement":null},{"id":"W2609834214","doi":"10.1017/jsl.2019.73","title":"DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerzita Karlova v Praze","keywords":"Idempotence; Congruence (geometry); Mathematics; Variety (cybernetics); Sequence (biology); Class (philosophy); Polynomial; Time complexity; Type (biology); Path (computing); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.03510935235772742,"score_gpt":0.2733136988233666,"score_spread":0.23820434646563918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609834214","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.4398693,0.0020811467,0.5253233,0.03021423,0.00082410255,0.00021134867,0.00000408325,0.00010529288,0.0013672521],"genre_scores_gemma":[0.9808801,0.00018101993,0.011210402,0.007372055,0.00032977175,0.0000025663835,6.6346007e-7,0.0000075563617,0.000015899592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984624,0.00009283492,0.00061490934,0.00021178395,0.0003101627,0.0003079309],"domain_scores_gemma":[0.99888813,0.00023218375,0.00037180746,0.00017662461,0.00008679159,0.00024445978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003012337,0.00014781962,0.00035424787,0.00020379656,0.00008044433,0.000073343144,0.00082950405,0.000067260866,0.000045525474],"category_scores_gemma":[0.00030885977,0.00011564522,0.00014938548,0.00055605324,0.000043902804,0.0009820506,0.00016087345,0.0004041592,0.00007613737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000442252,0.0002439715,0.004731144,0.000042836327,0.00006409608,0.0019407815,0.0028670768,0.021613387,0.009018424,0.95011395,0.0014581303,0.00786195],"study_design_scores_gemma":[0.0018828374,0.0009218459,0.031599768,0.000141112,0.00002361818,0.00056871196,0.00033026192,0.015049934,0.0018666087,0.9446771,0.0024660227,0.0004721524],"about_ca_topic_score_codex":0.0000015789986,"about_ca_topic_score_gemma":7.8345363e-7,"teacher_disagreement_score":0.54101074,"about_ca_system_score_codex":0.000060738064,"about_ca_system_score_gemma":0.000099016135,"threshold_uncertainty_score":0.47158754},"labels":[],"label_agreement":null},{"id":"W2768103053","doi":"10.1017/jsl.2018.84","title":"SPACES OF TYPES IN POSITIVE MODEL THEORY","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Negation; Countable set; Space (punctuation); Distributive property; Duality (order theory); Mathematics; Model theory; Pure mathematics; Algebra over a field; Computer science; Discrete mathematics","score_opus":0.025374211708487426,"score_gpt":0.3180061572629725,"score_spread":0.2926319455544851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768103053","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.9791905,0.0004454901,0.005116324,0.00019243259,0.000108077336,0.00007480184,0.0000024361577,0.000004587889,0.014865311],"genre_scores_gemma":[0.9937642,0.000059578208,0.005206985,0.00011710931,0.000035930814,4.3550233e-7,1.7322455e-7,0.0000078400535,0.00080770574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992545,0.00012240504,0.0003308343,0.000062329345,0.00010923092,0.000120650046],"domain_scores_gemma":[0.99889743,0.0005258196,0.00035132954,0.000111742826,0.000085458,0.000028191147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070662744,0.000078921614,0.0003488367,0.00013157458,0.00001223057,0.0000026491796,0.00015136831,0.000086568354,0.00011934027],"category_scores_gemma":[0.00023377736,0.000054532826,0.00008310781,0.00007661239,0.0000818473,0.00010815396,0.000026764441,0.00022411633,0.000013212707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022081292,0.00011901835,0.0012051619,0.00003345304,0.00004633441,0.000018434577,0.0018009009,0.0016711138,0.0024639838,0.9920817,0.000041224554,0.00029788],"study_design_scores_gemma":[0.00043971487,0.0001511089,0.0007088851,0.00007816175,0.000023583267,0.00006180792,0.00078246923,0.00030875322,0.0017981234,0.9955809,0.000007892001,0.000058604837],"about_ca_topic_score_codex":7.355567e-7,"about_ca_topic_score_gemma":0.0000013177105,"teacher_disagreement_score":0.0145737035,"about_ca_system_score_codex":0.000024557683,"about_ca_system_score_gemma":0.00004795014,"threshold_uncertainty_score":0.2223784},"labels":[],"label_agreement":null},{"id":"W2798864197","doi":"10.1017/jsl.2020.64","title":"STATIONARY REFLECTION","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Reflection (computer programming); Consistency (knowledge bases); Mathematics; Upper and lower bounds; Mathematical analysis; Computer science; Geometry","score_opus":0.135059711700596,"score_gpt":0.3842291565934014,"score_spread":0.2491694448928054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798864197","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.73708725,0.00092058483,0.20834796,0.021604806,0.00090318226,0.00018864353,0.000004941313,0.000105222454,0.030837424],"genre_scores_gemma":[0.9804203,0.00006108559,0.017020805,0.0018354509,0.0004459699,6.5493447e-7,4.820205e-7,0.0000082519555,0.00020699152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994028,0.000072523326,0.00027458818,0.000053456522,0.000111649526,0.00008495174],"domain_scores_gemma":[0.9993452,0.00019058069,0.0002568745,0.000049660477,0.00008977183,0.00006791372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020487836,0.000057377732,0.00016857075,0.000041467378,0.000047040015,0.0000041442313,0.00009217617,0.000052438645,0.000210958],"category_scores_gemma":[0.0005067398,0.00004267829,0.00006567637,0.000093776995,0.000039298495,0.000117947515,0.000013385064,0.00021103073,0.000026077016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033985765,0.00013172498,0.00042242464,0.000060781884,0.00010328005,0.00017563332,0.003509794,0.00018076554,0.006721604,0.9724798,0.011861954,0.0040123784],"study_design_scores_gemma":[0.00031622886,0.00026195444,0.0002873928,0.000009277523,0.000024513656,0.00021231308,0.0004521459,0.000035771434,0.0006417678,0.99461347,0.0030935002,0.00005165232],"about_ca_topic_score_codex":1.3955707e-7,"about_ca_topic_score_gemma":1.8233888e-7,"teacher_disagreement_score":0.24333309,"about_ca_system_score_codex":0.000021315915,"about_ca_system_score_gemma":0.000033655615,"threshold_uncertainty_score":0.23098421},"labels":[],"label_agreement":null},{"id":"W2898117887","doi":"10.1017/jsl.2020.46","title":"THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Countable set; Combinatorics; Mathematics; Order (exchange); Rank (graph theory); Hausdorff space; Discrete mathematics; Sentence; Sigma; Physics; Computer science; Artificial intelligence","score_opus":0.08827320045250713,"score_gpt":0.28530182910994717,"score_spread":0.19702862865744003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898117887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6198315,0.0014450816,0.3160963,0.060079858,0.0012952312,0.00037237327,0.00000830802,0.00006035518,0.0008110126],"genre_scores_gemma":[0.9634913,0.00007483314,0.035652813,0.00056685094,0.00020304229,6.1375863e-7,2.0428608e-7,0.0000051661455,0.000005139166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976959,0.00023253252,0.00095941947,0.00020839772,0.000652708,0.0002509958],"domain_scores_gemma":[0.99748504,0.00035068774,0.0010153467,0.00039281085,0.0005989888,0.00015709705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009168134,0.00015288373,0.0005268931,0.00008260004,0.00010024334,0.000052170406,0.0020546787,0.000054570995,0.000018860586],"category_scores_gemma":[0.00038715856,0.000092406226,0.00026254464,0.00065126736,0.0007276214,0.00024159312,0.00042886892,0.00029133205,0.000006520349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010984313,0.0047672614,0.12933132,0.0018676503,0.0022946328,0.00049962156,0.046370707,0.033560548,0.062594935,0.4357649,0.015308575,0.2665414],"study_design_scores_gemma":[0.004468326,0.006549031,0.1684213,0.00038219325,0.00017355828,0.00084541587,0.0033186148,0.4041959,0.02325604,0.38315463,0.0041467273,0.0010882646],"about_ca_topic_score_codex":0.000045260265,"about_ca_topic_score_gemma":0.0000075266325,"teacher_disagreement_score":0.37063536,"about_ca_system_score_codex":0.000028947914,"about_ca_system_score_gemma":0.00019584663,"threshold_uncertainty_score":0.38181382},"labels":[],"label_agreement":null},{"id":"W2908819577","doi":"10.1017/jsl.2021.65","title":"FRAÏSSÉ LIMITS FOR RELATIONAL METRIC STRUCTURES","year":2021,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Simon Fraser University","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; University of Otago","keywords":"Metric (unit); Subclass; Class (philosophy); Mathematics; Pure mathematics; Discrete mathematics; Computer science; Artificial intelligence; Engineering; Operations management","score_opus":0.11576794836638107,"score_gpt":0.37821398548180213,"score_spread":0.262446037115421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908819577","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.42901713,0.013589937,0.5430015,0.0020878979,0.0059270435,0.00078779325,0.00008345944,0.00007131735,0.005433941],"genre_scores_gemma":[0.77990484,0.00038209735,0.21718013,0.00038431108,0.0014091446,0.000013596644,0.00002340758,0.000041975087,0.0006605057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981168,0.00017821643,0.0008872185,0.00023270167,0.00033750848,0.00024754982],"domain_scores_gemma":[0.9957153,0.0018823859,0.0013825129,0.0003085663,0.00060850475,0.00010270779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008138195,0.00026773743,0.0008585821,0.00038978807,0.00011226619,0.000032865682,0.00039596568,0.000639164,0.0003115854],"category_scores_gemma":[0.0036467882,0.00020671198,0.0005535922,0.00015992206,0.00009922684,0.00010305298,0.00016027862,0.0012755574,0.0000025217173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015010816,0.00016952977,0.00022722034,0.00040266453,0.0006743064,0.00010744504,0.0008318561,0.0027463606,0.00016490396,0.9894037,0.0027341542,0.0023877106],"study_design_scores_gemma":[0.00057098735,0.00010656427,0.0012422324,0.00012490046,0.00026882975,0.00034682176,0.00028859533,0.00005397502,0.0003765138,0.99560076,0.0008193364,0.00020045982],"about_ca_topic_score_codex":6.371607e-7,"about_ca_topic_score_gemma":0.0000014508944,"teacher_disagreement_score":0.35088772,"about_ca_system_score_codex":0.00011139264,"about_ca_system_score_gemma":0.00033005016,"threshold_uncertainty_score":0.84294695},"labels":[],"label_agreement":null},{"id":"W2926532848","doi":"10.1017/jsl.2019.20","title":"STABLE ORDERED UNION ULTRAFILTERS AND cov $\\left( \\mathcal{M} \\right) &lt; \\mathfrak{c}$","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"York University","keywords":"Ultrafilter; Combinatorics; Mathematics; Disjoint sets; Axiom; Omega; Disjoint union (topology); Discrete mathematics; Physics; Geometry","score_opus":0.02096630639013212,"score_gpt":0.28952999992220824,"score_spread":0.2685636935320761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2926532848","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.98460317,0.0006249596,0.0055487566,0.00064001814,0.00053322193,0.00019274946,0.000005423244,0.00003926726,0.0078124516],"genre_scores_gemma":[0.9911886,0.00027930824,0.006171197,0.0004940566,0.00014638212,0.0000011885277,0.0000015067271,0.000027492872,0.001690283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845773,0.00021154921,0.00058010354,0.0001767947,0.00024193004,0.00033187485],"domain_scores_gemma":[0.99837136,0.000580506,0.0005073422,0.00026431383,0.00015190196,0.00012459543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095379085,0.00020912028,0.000586624,0.00016106707,0.0001020102,0.00002737491,0.00024990182,0.00019477431,0.0005139213],"category_scores_gemma":[0.0002703597,0.00014815659,0.00011865774,0.00011083147,0.00016460732,0.0003136691,0.000052604057,0.00042377948,0.000067873174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034308754,0.0004334374,0.0043241163,0.00033932563,0.00031016616,0.00023833092,0.0033334077,0.00010250795,0.03904804,0.94658154,0.0034415445,0.001504518],"study_design_scores_gemma":[0.0017008147,0.00044646303,0.0010181632,0.00013399195,0.00008611455,0.0015080639,0.0009295627,0.00009030783,0.0038525895,0.98236364,0.0075943223,0.00027596188],"about_ca_topic_score_codex":0.0000017855778,"about_ca_topic_score_gemma":0.0000034085595,"teacher_disagreement_score":0.035782125,"about_ca_system_score_codex":0.000056212928,"about_ca_system_score_gemma":0.00006928037,"threshold_uncertainty_score":0.604165},"labels":[],"label_agreement":null},{"id":"W2943660833","doi":"10.1017/jsl.2019.26","title":"AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"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":"Marsden Fund; Massey University; Russian Science Foundation; Kazan Federal University; Ministry of Education, India; Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Algebraic structure; Computer science; Presentation (obstetrics); Set (abstract data type); Automaton; Turing machine; Algebra over a field; Discrete mathematics; Mathematics; Theoretical computer science; Programming language; Pure mathematics","score_opus":0.004713833986705237,"score_gpt":0.20536240274780657,"score_spread":0.20064856876110132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943660833","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.9951073,0.0008144613,0.0015242556,0.0008589178,0.0004446076,0.00007395591,5.971532e-7,0.000051011513,0.0011248931],"genre_scores_gemma":[0.9902434,0.000029138748,0.008619498,0.000777102,0.00014554466,3.9761713e-7,1.6925534e-7,0.0000072172606,0.0001775749],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998984,0.000073069146,0.00034807407,0.00014739644,0.00024433422,0.0002031346],"domain_scores_gemma":[0.999105,0.00013810475,0.00031873828,0.0002771739,0.0000499878,0.000111024594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043223318,0.0001258373,0.00032036696,0.00016480604,0.000045015113,0.00014916706,0.00065772847,0.00006244726,0.0002456215],"category_scores_gemma":[0.000040569867,0.00008535112,0.00008732568,0.00016000566,0.000040536026,0.00046493925,0.00014910733,0.0001631692,0.00011130558],"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.00004713424,0.00025804163,0.0069589885,0.00025779175,0.00041673667,0.00037537832,0.0055387584,0.00020326613,0.13873908,0.41029343,0.018532392,0.41837898],"study_design_scores_gemma":[0.0038622478,0.0015679168,0.22498335,0.00031525615,0.000090780166,0.007623388,0.0003298089,0.09335494,0.0063109077,0.6566534,0.003882865,0.0010251609],"about_ca_topic_score_codex":0.0000028995933,"about_ca_topic_score_gemma":8.570981e-8,"teacher_disagreement_score":0.41735384,"about_ca_system_score_codex":0.000024588744,"about_ca_system_score_gemma":0.000062912,"threshold_uncertainty_score":0.34805176},"labels":[],"label_agreement":null},{"id":"W2958785924","doi":"10.1017/jsl.2019.49","title":"A NEW MINIMAL NON-<i>σ</i>-SCATTERED LINEAR ORDER","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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 Toronto","funders":"","keywords":"Order (exchange); Type (biology); Mathematics; Mathematical analysis; Geology; Economics","score_opus":0.02769602480149027,"score_gpt":0.3215030904183239,"score_spread":0.2938070656168337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958785924","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.95151055,0.00024118624,0.032563053,0.0017298196,0.0009160655,0.00018383905,0.0000020091722,0.000026845742,0.012826608],"genre_scores_gemma":[0.89268434,0.000047867026,0.09648671,0.0012421748,0.00085273763,0.0000010260406,7.6503306e-7,0.000030446827,0.008653923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886775,0.00006428583,0.0005022569,0.00012109054,0.00019325374,0.0002513477],"domain_scores_gemma":[0.9987302,0.00031166687,0.0004418641,0.00023624263,0.00014844949,0.00013157155],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039235054,0.00015192633,0.00046476058,0.00011540772,0.000039277587,0.000009566714,0.0002965398,0.000146296,0.0013847266],"category_scores_gemma":[0.00024149654,0.000108514665,0.00015829857,0.00014678562,0.000048488248,0.00015464985,0.00004847957,0.00039191596,0.00031922854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037845063,0.0020325645,0.02392675,0.0007875752,0.0018421969,0.0009805933,0.01649362,0.0007794896,0.07236328,0.71597445,0.1379755,0.023059448],"study_design_scores_gemma":[0.00289674,0.00077471137,0.0018912229,0.00011968816,0.00011551601,0.0008573402,0.0006679499,0.00009110531,0.002377931,0.98157746,0.008324231,0.00030610012],"about_ca_topic_score_codex":0.0000020566779,"about_ca_topic_score_gemma":0.0000012349869,"teacher_disagreement_score":0.26560298,"about_ca_system_score_codex":0.000029687006,"about_ca_system_score_gemma":0.00014143102,"threshold_uncertainty_score":0.99952817},"labels":[],"label_agreement":null},{"id":"W2963453271","doi":"10.1017/jsl.2014.20","title":"THE COUNTERPARTS TO STATEMENTS THAT ARE EQUIVALENT TO THE CONTINUUM HYPOTHESIS","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Sigma; Mathematics; Partition (number theory); Continuum hypothesis; Combinatorics; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.2258875682696184,"score_gpt":0.41276222620025915,"score_spread":0.18687465793064076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963453271","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.91726536,0.0010163607,0.02321023,0.047089234,0.002664307,0.0008333326,0.000020724565,0.000041530555,0.007858928],"genre_scores_gemma":[0.9916702,0.00007450549,0.0015159246,0.003418623,0.00040233607,0.000014412882,1.2922376e-7,0.000018622262,0.0028852362],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984662,0.00023932316,0.00044846733,0.00010766359,0.00041356403,0.0003248002],"domain_scores_gemma":[0.9978336,0.00089997397,0.0004630842,0.00033451754,0.00024983654,0.00021897125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020812203,0.00014662844,0.00031580852,0.000060399634,0.0001994991,0.000052194475,0.00059429376,0.00005400993,0.000034563178],"category_scores_gemma":[0.0014905346,0.000067363064,0.00010681149,0.00010346182,0.000088241766,0.00012018948,0.00012444257,0.00022527389,0.00013526621],"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.0020169227,0.000496532,0.004686512,0.00005929686,0.0008056567,0.0003197889,0.02083772,0.0006771396,0.0005391021,0.15435556,0.8017775,0.013428266],"study_design_scores_gemma":[0.0006526747,0.0004083842,0.0015244428,0.00009542151,0.000077344426,0.00016455367,0.008135406,0.000005050957,0.0007071656,0.8188991,0.16917425,0.00015622465],"about_ca_topic_score_codex":0.0000012089605,"about_ca_topic_score_gemma":0.000034991193,"teacher_disagreement_score":0.6645435,"about_ca_system_score_codex":0.00010529666,"about_ca_system_score_gemma":0.00005396451,"threshold_uncertainty_score":0.27469862},"labels":[],"label_agreement":null},{"id":"W2963944370","doi":"10.1017/jsl.2018.10","title":"CONSTRUCTING TYPES IN DIFFERENTIALLY CLOSED FIELDS THAT ARE ANALYSABLE IN THE CONSTANTS","year":2018,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Algebraic structures and combinatorial models","field":"Mathematics","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":"Combinatorics; Rank (graph theory); Type (biology); Physics; Base (topology); Canonical form; Constant (computer programming); Mathematics; Mathematical analysis; Pure mathematics; Biology","score_opus":0.06778004490792747,"score_gpt":0.3185973889288821,"score_spread":0.2508173440209547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963944370","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.994916,0.00011475468,0.0002412072,0.00045898886,0.0005767631,0.000090749854,9.101881e-7,0.0000052291575,0.0035953575],"genre_scores_gemma":[0.9990164,0.000022383343,0.00038370548,0.00021960968,0.00032872247,0.0000011038074,1.6495906e-7,0.0000072988287,0.00002057793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987984,0.00014539673,0.00045963842,0.000097314056,0.0002910474,0.00020820388],"domain_scores_gemma":[0.99888164,0.00034743696,0.00046298423,0.00016971535,0.000103266786,0.000034941917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005287678,0.000117987875,0.00038815613,0.00013905621,0.000049809525,0.00005141957,0.00034332846,0.00011471625,0.00014464691],"category_scores_gemma":[0.00030617294,0.00006844315,0.00009277565,0.00022952817,0.00010318826,0.00008652861,0.000038734972,0.0003515043,0.0000021514888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015146582,0.00018604347,0.1378459,0.000056217246,0.00012064881,0.00017951362,0.004127266,0.000009659966,0.00011072871,0.8543569,0.0007481732,0.002107518],"study_design_scores_gemma":[0.00094211404,0.00011546794,0.014365205,0.00012962434,0.000037591442,0.00013521548,0.0033074794,0.00007107,0.00027328686,0.98050445,0.00002240162,0.00009606425],"about_ca_topic_score_codex":0.000024155375,"about_ca_topic_score_gemma":0.00022590421,"teacher_disagreement_score":0.12614761,"about_ca_system_score_codex":0.000051100356,"about_ca_system_score_gemma":0.000061968836,"threshold_uncertainty_score":0.27910307},"labels":[],"label_agreement":null},{"id":"W3018860897","doi":"10.1017/jsl.2021.31","title":"THE RELATIVIZED LASCAR GROUPS, TYPE-AMALGAMATION, AND ALGEBRAICITY","year":2021,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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":"Toronto Metropolitan University","funders":"Samsung; European Commission","keywords":"Type (biology); Mathematics; Pure mathematics; Computer science; Algebra over a field; Biology; Ecology","score_opus":0.039874542352532245,"score_gpt":0.30056704311897847,"score_spread":0.26069250076644623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018860897","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.9853684,0.0061334227,0.0025046652,0.0015687995,0.0013410004,0.00021886268,0.0000031551572,0.000031481064,0.002830232],"genre_scores_gemma":[0.9937549,0.001831255,0.0028569817,0.0001772579,0.0006006765,0.000004857576,0.0000045344277,0.000033845932,0.0007356754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736804,0.0005849895,0.0010201642,0.00023720878,0.0005139432,0.00027568126],"domain_scores_gemma":[0.99540085,0.001897345,0.0014406281,0.0005047397,0.0006159627,0.00014045378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029015238,0.0003065971,0.0007987458,0.00013297332,0.00026043394,0.00021867464,0.00050641573,0.00040706864,0.00014630695],"category_scores_gemma":[0.003008812,0.00019213316,0.00030492517,0.00025282477,0.0001951158,0.00014939983,0.00053823827,0.0014746402,0.000010131604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004847657,0.00059255963,0.004434388,0.0013272867,0.0028127362,0.00036895945,0.012235987,0.000077798715,0.00070680334,0.9579649,0.011716416,0.0072774147],"study_design_scores_gemma":[0.0005285975,0.00008710943,0.0061599184,0.00033421553,0.00028042227,0.000545994,0.0012038136,0.000044171917,0.00020872286,0.9895975,0.0007796435,0.00022989919],"about_ca_topic_score_codex":0.000004340136,"about_ca_topic_score_gemma":0.000005152586,"teacher_disagreement_score":0.03163261,"about_ca_system_score_codex":0.0000810239,"about_ca_system_score_gemma":0.00023173088,"threshold_uncertainty_score":0.78349626},"labels":[],"label_agreement":null},{"id":"W3040826579","doi":"10.1017/jsl.2020.11","title":"THE TREE PROPERTY AT THE TWO IMMEDIATE SUCCESSORS OF A SINGULAR CARDINAL","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Successor cardinal; Regular cardinal; Aleph; Mathematics; Property (philosophy); Tree (set theory); Kappa; Limit (mathematics); Combinatorics; Omega; Discrete mathematics; Mathematical analysis; Geometry; Physics; Philosophy; Epistemology; Theology","score_opus":0.05157215452786744,"score_gpt":0.31846684446002144,"score_spread":0.266894689932154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040826579","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.9664288,0.0027364313,0.0020689364,0.021963743,0.00041239115,0.00024255748,0.000004607959,0.000018230323,0.006124302],"genre_scores_gemma":[0.9974646,0.00022592608,0.0006913084,0.0005810043,0.00038680172,0.0000025540658,2.7039496e-7,0.000014129029,0.0006334189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985993,0.00028755897,0.000529727,0.00009232992,0.00027674797,0.00021437151],"domain_scores_gemma":[0.9981379,0.00079648086,0.0006237761,0.00020768345,0.00015012705,0.000084019644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096922467,0.00012657489,0.00038372376,0.000025164954,0.00023818582,0.000012629613,0.00046152555,0.00005973522,0.0000635552],"category_scores_gemma":[0.0010695974,0.000045761237,0.00023216532,0.00013215534,0.0004190525,0.00007497989,0.00010731025,0.00037423839,0.000011698978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005854513,0.0007234731,0.010238551,0.0005232825,0.0026919346,0.0010938611,0.040298402,0.0014477441,0.049111824,0.80704784,0.02965648,0.051312063],"study_design_scores_gemma":[0.0021014984,0.00071662327,0.0011041781,0.000078123085,0.00036832865,0.00075221696,0.0028294937,0.0002722214,0.009386072,0.9651609,0.016999826,0.00023054238],"about_ca_topic_score_codex":0.000003440968,"about_ca_topic_score_gemma":0.000010082645,"teacher_disagreement_score":0.158113,"about_ca_system_score_codex":0.000037718608,"about_ca_system_score_gemma":0.000067802706,"threshold_uncertainty_score":0.18660891},"labels":[],"label_agreement":null},{"id":"W3091534711","doi":"10.1017/jsl.2021.82","title":"DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS","year":2021,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","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","keywords":"Mathematics; Equivalence relation; Graph; Discrete mathematics; Equivalence (formal languages); Spectrum (functional analysis); Jump; Combinatorics; Degree (music); Pure mathematics; Physics","score_opus":0.08635827828913571,"score_gpt":0.2996625492359246,"score_spread":0.2133042709467889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091534711","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.084644526,0.004766404,0.90186936,0.0016237666,0.0013414944,0.00016946634,0.000009013483,0.000043581353,0.005532389],"genre_scores_gemma":[0.8844921,0.000540831,0.114365116,0.0001954325,0.0002576587,0.0000020273394,0.000003060955,0.0000116206165,0.00013217855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971488,0.00018506357,0.0012183128,0.00040908565,0.0006963032,0.00034240395],"domain_scores_gemma":[0.99609745,0.0002735698,0.0018915606,0.0009191879,0.00063908193,0.00017915528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006083631,0.0002967783,0.0009663754,0.0004067299,0.00008455244,0.00013008238,0.0021481074,0.00021954448,0.000121610385],"category_scores_gemma":[0.00028136926,0.00024046791,0.0005779764,0.0005992764,0.00014004558,0.00041853826,0.0010591312,0.001194558,0.00001602852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007035322,0.0015116432,0.01095656,0.0011908244,0.001625254,0.0035362612,0.0070690853,0.14048678,0.017759588,0.7826857,0.0016785332,0.031429395],"study_design_scores_gemma":[0.0010679688,0.0006978899,0.09857108,0.0016078039,0.00035283793,0.0019026907,0.000402868,0.021768618,0.0011642419,0.87099916,0.00047765477,0.0009871654],"about_ca_topic_score_codex":0.000009553028,"about_ca_topic_score_gemma":0.000005014104,"teacher_disagreement_score":0.79984754,"about_ca_system_score_codex":0.00015039404,"about_ca_system_score_gemma":0.00059675693,"threshold_uncertainty_score":0.9805997},"labels":[],"label_agreement":null},{"id":"W3159313210","doi":"10.1017/jsl.2021.30","title":"TUKEY ORDER AMONG IDEALS","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Saint Mary's University","funders":"","keywords":"Mathematics; Flatness (cosmology); Ideal (ethics); Order (exchange); Pure mathematics; Sigma; Tukey's range test; Class (philosophy); Combinatorics; Discrete mathematics; Physics; Statistics; Computer science","score_opus":0.043369855491789705,"score_gpt":0.3434148043049093,"score_spread":0.3000449488131196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159313210","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.95797193,0.0010969525,0.017252972,0.0014163326,0.0006509143,0.000059626178,0.0000019151485,0.000027592965,0.02152174],"genre_scores_gemma":[0.97747225,0.00017400832,0.01841855,0.00072659046,0.0003665225,0.000001218555,6.493554e-7,0.00001652227,0.0028236976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890953,0.00015729513,0.00046519664,0.000094965355,0.00017273435,0.00020027916],"domain_scores_gemma":[0.99858,0.00042814208,0.00036745102,0.00018819077,0.0003454273,0.00009082234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005247986,0.00010764022,0.00037776394,0.0000704084,0.0000706201,0.000013207939,0.00016511773,0.00012053934,0.00084195874],"category_scores_gemma":[0.0014440393,0.00007936184,0.00013472534,0.00017568517,0.00011194031,0.00013866495,0.000046472505,0.00034872998,0.000032549364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051856456,0.0002633918,0.004354866,0.000056951354,0.00020348825,0.001418982,0.0010762669,0.000075425996,0.0024405671,0.9828315,0.005559824,0.0016668979],"study_design_scores_gemma":[0.00045483882,0.00006287853,0.002538188,0.00004606936,0.000055250122,0.0009577704,0.00062414707,0.0000072515795,0.0019387918,0.9914411,0.0017761859,0.0000975402],"about_ca_topic_score_codex":9.623781e-7,"about_ca_topic_score_gemma":0.000005948797,"teacher_disagreement_score":0.019500285,"about_ca_system_score_codex":0.00003110686,"about_ca_system_score_gemma":0.000105948944,"threshold_uncertainty_score":0.9218858},"labels":[],"label_agreement":null},{"id":"W3169538887","doi":"10.1017/jsl.2021.38","title":"CONTRIBUTIONS TO THE THEORY OF <i>F</i>-AUTOMATIC SETS","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","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":"Endomorphism; Injective function; NIP; Abelian group; Mathematics; Automaticity; Prime (order theory); Combinatorics; Set (abstract data type); Multiplication (music); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.015106567953820968,"score_gpt":0.27411389948587456,"score_spread":0.2590073315320536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169538887","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.3611269,0.004611237,0.60097915,0.028418811,0.0014745587,0.00019969494,0.00002638409,0.0000714025,0.0030918808],"genre_scores_gemma":[0.9912088,0.00005669354,0.0058674556,0.0026512956,0.00012258458,0.000002027108,4.3786946e-7,0.0000044275985,0.00008630176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862146,0.00030310644,0.00046394445,0.00010783542,0.00031173808,0.00019191415],"domain_scores_gemma":[0.99821943,0.00048021437,0.00032051335,0.00044468517,0.00043460418,0.00010057447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014639042,0.00009106703,0.00027985265,0.000084276995,0.00008982722,0.00007049627,0.00093399285,0.00004024346,0.000064290856],"category_scores_gemma":[0.0005711777,0.00005246558,0.00016817357,0.0005065054,0.000048237303,0.00019027002,0.00020616838,0.00017128182,0.00003421108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072007906,0.00017816984,0.00011442388,0.000022534003,0.00010351666,0.00015002642,0.0017697434,0.00025657722,0.008970958,0.93910867,0.0056917337,0.043626443],"study_design_scores_gemma":[0.0009937984,0.00038479778,0.016284766,0.0003174003,0.00009593977,0.002993839,0.0012092196,0.0050161304,0.029652063,0.93262726,0.010138058,0.00028670253],"about_ca_topic_score_codex":0.0000012841816,"about_ca_topic_score_gemma":8.149939e-7,"teacher_disagreement_score":0.6300819,"about_ca_system_score_codex":0.000035371708,"about_ca_system_score_gemma":0.00021382642,"threshold_uncertainty_score":0.21394843},"labels":[],"label_agreement":null},{"id":"W3172144587","doi":"10.1017/jsl.2021.45","title":"WEAK CANONICAL BASES IN NSOP THEORIES","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Base (topology); Transitive relation; Sequence (biology); Collinearity; Simple (philosophy); Geometry; Mathematical analysis; Philosophy","score_opus":0.041669647988091175,"score_gpt":0.3475147025425514,"score_spread":0.3058450545544602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172144587","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.9504691,0.0027513923,0.0045369184,0.0031463106,0.00064340315,0.00006789127,0.0000042154593,0.000022089338,0.038358677],"genre_scores_gemma":[0.99153394,0.0002341544,0.006047436,0.00054966094,0.00023324272,0.0000013987496,5.2068395e-7,0.000010543523,0.0013890894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885964,0.00024027549,0.0004634023,0.00009405652,0.00014494243,0.0001976814],"domain_scores_gemma":[0.99849105,0.0009396052,0.00021739498,0.00016084893,0.00012564604,0.00006547957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006032082,0.000101060796,0.00038450997,0.00008220299,0.000045329634,0.00001010277,0.00015581414,0.00010709706,0.0005444896],"category_scores_gemma":[0.0017261,0.00007323971,0.00011644332,0.0001531513,0.00013559745,0.00011034639,0.000047160887,0.00038973172,0.000012265173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060545262,0.00016859804,0.0014548659,0.000020285142,0.000030795487,0.0006386013,0.0003960954,0.000023408928,0.00058053946,0.99565613,0.00035818102,0.000611957],"study_design_scores_gemma":[0.0005070399,0.00007566956,0.0012286354,0.000057941495,0.000024802588,0.0010301565,0.0012922925,0.0000040574446,0.001468652,0.9919558,0.0022719644,0.000082959734],"about_ca_topic_score_codex":0.0000017232597,"about_ca_topic_score_gemma":0.000031789205,"teacher_disagreement_score":0.04106485,"about_ca_system_score_codex":0.00004965589,"about_ca_system_score_gemma":0.00021271805,"threshold_uncertainty_score":0.59617794},"labels":[],"label_agreement":null},{"id":"W3208227432","doi":"10.1017/jsl.2021.58","title":"SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Randomness; Prefix; Omega; Combinatorics; Halting problem; BETA (programming language); Alpha (finance); Mathematics; Discrete mathematics; Computer science; Algorithm; Physics; Turing machine; Statistics; Philosophy; Quantum mechanics","score_opus":0.01715385774161524,"score_gpt":0.26727219337782365,"score_spread":0.2501183356362084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208227432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60207975,0.0052590114,0.38360953,0.0050865677,0.0026224577,0.00031344045,0.000006733135,0.00007052461,0.00095196883],"genre_scores_gemma":[0.94278675,0.0002992224,0.056293733,0.00020168544,0.00036054332,0.000003125907,6.5105434e-7,0.0000073239025,0.000046960107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760187,0.00034305893,0.0009936102,0.0002537518,0.0005014768,0.00030625632],"domain_scores_gemma":[0.9979257,0.0003563147,0.00051109615,0.0005039487,0.00056321075,0.00013972411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014143998,0.00016722547,0.0006622431,0.00033492935,0.00005294903,0.00006704769,0.0010052581,0.00010669062,0.000022779508],"category_scores_gemma":[0.0004350726,0.0001362037,0.00024952655,0.0010035897,0.000100668454,0.00061040645,0.00034789977,0.00042755812,0.000007344142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020932105,0.006601051,0.0416618,0.00049625203,0.00039843153,0.004734527,0.006484231,0.025227295,0.012390277,0.6763215,0.0007073881,0.2247679],"study_design_scores_gemma":[0.007387999,0.0005918985,0.18407781,0.00031597822,0.000056473564,0.0037542714,0.0003074831,0.04466342,0.0069785677,0.750479,0.0007913655,0.00059576536],"about_ca_topic_score_codex":0.000037300288,"about_ca_topic_score_gemma":0.000017607454,"teacher_disagreement_score":0.340707,"about_ca_system_score_codex":0.00015506777,"about_ca_system_score_gemma":0.0005611218,"threshold_uncertainty_score":0.55542254},"labels":[],"label_agreement":null},{"id":"W4254392710","doi":"10.1017/s0022481200000633","title":"JSL volume 77 issue 2 Cover and Back matter","year":2012,"lang":"en","type":"paratext","venue":"Journal of Symbolic Logic","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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; McMaster University","funders":"","keywords":"Cover (algebra); Volume (thermodynamics); Action (physics); Content (measure theory); Computer science; Engineering; Mathematics; Physics; Mechanical engineering","score_opus":0.038982623770781835,"score_gpt":0.22555450848773623,"score_spread":0.1865718847169544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254392710","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.0021736417,0.029202381,0.000076378165,0.0008361661,0.01470298,0.00011995856,0.00049837615,0.0000024451779,0.9523877],"genre_scores_gemma":[0.00614099,0.0061328844,0.00020190926,0.0012899828,0.0020135634,0.000002497919,0.000011318658,0.00003150796,0.9841753],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980003,0.000018086163,0.0011405549,0.00034395177,0.000055278048,0.0004417938],"domain_scores_gemma":[0.99777365,0.000037423637,0.0016645079,0.00026848208,0.00006891327,0.00018702786],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000714311,0.00030602107,0.0012733664,0.00040173548,0.00010007435,0.00018366547,0.00037524517,0.00028934423,0.5903068],"category_scores_gemma":[0.000026551004,0.00028219508,0.0002885911,0.000108207634,0.00018278683,0.00038280687,0.00019149446,0.00039902443,0.85853714],"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.000016340411,0.00004831828,0.0033195347,0.00008215298,0.00023680033,0.0000033310398,0.0004045561,0.000022801718,8.476174e-7,0.00035709143,0.9954246,0.00008358408],"study_design_scores_gemma":[0.00048275615,0.000050447794,0.0028766128,0.000050586128,0.000037270664,0.00006955936,0.000121039026,0.000015538708,0.0000021708609,0.0004629064,0.9955118,0.0003193256],"about_ca_topic_score_codex":0.000042812775,"about_ca_topic_score_gemma":2.2796141e-7,"teacher_disagreement_score":0.26823032,"about_ca_system_score_codex":0.0001389198,"about_ca_system_score_gemma":0.00003055094,"threshold_uncertainty_score":0.99996305},"labels":[],"label_agreement":null},{"id":"W4366777573","doi":"10.1017/jsl.2023.26","title":"ON THE C.E. DEGREES REALIZABLE IN $\\Pi ^0_1$ CLASSES","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Marsden Fund; Ministry of Education, India","keywords":"Class (philosophy); Mathematics; Degree (music); Pi; Set (abstract data type); Bounded function; Combinatorics; Discrete mathematics; Representation (politics); Computer science; Mathematical analysis; Artificial intelligence; Physics","score_opus":0.049413102059981936,"score_gpt":0.2843571914520112,"score_spread":0.23494408939202927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366777573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89924765,0.00065149897,0.047629844,0.03638529,0.002697221,0.00047774304,0.0000031597235,0.00031066663,0.01259695],"genre_scores_gemma":[0.99398875,0.00018481897,0.004319564,0.001012412,0.00026249525,0.0000067557457,3.8332976e-7,0.00001151994,0.00021329694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774826,0.0003042045,0.0006110331,0.00026954882,0.00063065445,0.00043629998],"domain_scores_gemma":[0.9975529,0.001258688,0.00031976224,0.0005869127,0.0001728405,0.00010891508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021577575,0.00018066462,0.00036861526,0.0004139261,0.00011697113,0.00018816328,0.0018214643,0.00008691352,0.00004387266],"category_scores_gemma":[0.000627227,0.0001052809,0.00016817906,0.001649704,0.00008465511,0.00032112794,0.0003823165,0.00047075917,0.00014581326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007048846,0.0010059057,0.020078681,0.00007911167,0.00012847122,0.0018179961,0.0041273446,0.060078647,0.00090798765,0.79332596,0.061922863,0.05645652],"study_design_scores_gemma":[0.00087838457,0.0009518054,0.13704462,0.00016498551,0.000013805394,0.00036040595,0.00046657427,0.10293119,0.00037651346,0.7513278,0.00509012,0.0003937877],"about_ca_topic_score_codex":0.000040023162,"about_ca_topic_score_gemma":0.00003383345,"teacher_disagreement_score":0.116965935,"about_ca_system_score_codex":0.00013869982,"about_ca_system_score_gemma":0.00017089606,"threshold_uncertainty_score":0.42932305},"labels":[],"label_agreement":null},{"id":"W4382561381","doi":"10.1017/jsl.2023.46","title":"DEFINABLE -THEOREM FOR FAMILIES WITH VC-CODENSITY LESS THAN","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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; Engineering and Physical Sciences Research Council; Fields Institute for Research in Mathematical Sciences","keywords":"Combinatorics; Conjecture; Mathematics; Intersection (aeronautics); Order (exchange); Omega; Property (philosophy); Discrete mathematics; Physics","score_opus":0.07198059426068447,"score_gpt":0.3253716880741173,"score_spread":0.25339109381343283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382561381","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.9717913,0.0001345444,0.023740368,0.00065928785,0.0002320495,0.0001735328,0.0000073741085,0.000068205525,0.003193293],"genre_scores_gemma":[0.9870662,0.00013724255,0.01070711,0.00018502075,0.00020260508,0.000007912892,0.0000017499528,0.000025130346,0.0016669907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901474,0.0000732143,0.00032472773,0.00011660492,0.00016672189,0.00030399844],"domain_scores_gemma":[0.9984402,0.0007812735,0.00032877986,0.00018288066,0.00019805525,0.00006882602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008643447,0.00014097655,0.00043031937,0.00015902739,0.00016512208,0.000013172266,0.00021699672,0.000104997656,0.000018012337],"category_scores_gemma":[0.00041053016,0.00009038286,0.00013400582,0.00020671752,0.00017542216,0.00012682189,0.000038896764,0.00022617687,0.000019091238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004600007,0.00009983428,0.0016322517,0.00012263977,0.00013108877,0.0001480845,0.0013458343,0.0001974129,0.00045212288,0.9918359,0.0023709605,0.0012039064],"study_design_scores_gemma":[0.0008102711,0.00035780921,0.001222711,0.000057124027,0.00007766827,0.00036533264,0.0044561005,0.00004598612,0.0011946261,0.9905379,0.00074842613,0.00012604472],"about_ca_topic_score_codex":0.0000019950453,"about_ca_topic_score_gemma":0.000013672699,"teacher_disagreement_score":0.0152748935,"about_ca_system_score_codex":0.00003490529,"about_ca_system_score_gemma":0.00006570998,"threshold_uncertainty_score":0.36857063},"labels":[],"label_agreement":null},{"id":"W4385240321","doi":"10.1017/jsl.2023.55","title":"FRACTAL DIMENSIONS OF <i>k</i>-AUTOMATIC SETS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","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":"Hausdorff dimension; Minkowski–Bouligand dimension; Mathematics; Fractal; Digraph; Automaton; Box counting; Fractal dimension; Cellular automaton; Effective dimension; Packing dimension; Characterization (materials science); Hausdorff measure; Dimension function; Measure (data warehouse); Discrete mathematics; Hausdorff space; Dimension (graph theory); Entropy (arrow of time); Combinatorics; Fractal analysis; Theoretical computer science; Computer science; Algorithm; Data mining; Mathematical analysis","score_opus":0.02116319322224567,"score_gpt":0.270180949605909,"score_spread":0.24901775638366333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385240321","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.98892707,0.00036924926,0.0075982143,0.0014139616,0.0007034541,0.00006243006,0.0000023956852,0.00012540026,0.0007978118],"genre_scores_gemma":[0.9933843,0.00013020639,0.00597387,0.00037061147,0.00007270384,9.436832e-7,5.31121e-7,0.00000719452,0.000059654947],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867404,0.00008114713,0.0005167619,0.000113751325,0.00039199882,0.00022230821],"domain_scores_gemma":[0.99872655,0.00027785648,0.00046060636,0.000312719,0.00011782781,0.00010444991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075799576,0.00010418625,0.00032131321,0.00028651202,0.000057815338,0.00003838796,0.00077029155,0.00005532919,0.000032722],"category_scores_gemma":[0.00013287929,0.00006498972,0.00016657611,0.000698808,0.0000495829,0.00035887607,0.00019995737,0.00016947987,0.00010063326],"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.000044919998,0.0014446821,0.0065292525,0.00048787592,0.00070159376,0.0029763624,0.013694604,0.002788623,0.18229008,0.34139937,0.08929197,0.35835066],"study_design_scores_gemma":[0.0026071111,0.0014793039,0.118820176,0.000910811,0.00012765611,0.0032595687,0.0012009662,0.2012902,0.01666807,0.64739674,0.0053913663,0.0008480121],"about_ca_topic_score_codex":0.000003102404,"about_ca_topic_score_gemma":2.1736305e-7,"teacher_disagreement_score":0.35750264,"about_ca_system_score_codex":0.000019048517,"about_ca_system_score_gemma":0.00008190085,"threshold_uncertainty_score":0.2650204},"labels":[],"label_agreement":null},{"id":"W4386506899","doi":"10.1017/jsl.2023.62","title":"MORE ON HALFWAY NEW CARDINAL CHARACTERISTICS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Artificial Intelligence in Medicine (Canada)","funders":"Austrian Science Fund","keywords":"Consistency (knowledge bases); Combinatorics; Mathematics; Discrete mathematics","score_opus":0.08152712154442658,"score_gpt":0.372710476410601,"score_spread":0.2911833548661744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386506899","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.98288685,0.0001088592,0.0035855335,0.004401772,0.001433334,0.0001173157,0.000010422468,0.00010562745,0.007350282],"genre_scores_gemma":[0.99009156,0.00015740297,0.0026311716,0.000735393,0.0013194792,0.0000012930014,0.0000020086375,0.000026458969,0.005035252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989398,0.000070878705,0.0004157758,0.00009847432,0.00023200018,0.00024305093],"domain_scores_gemma":[0.99872255,0.0005196847,0.00035351253,0.00018707315,0.00008342846,0.00013373117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004892922,0.00013432736,0.00041228792,0.00017895966,0.0000792594,0.000011687903,0.00021727206,0.00011765069,0.0001535589],"category_scores_gemma":[0.0009089287,0.00009640085,0.00016927207,0.0001859437,0.00007629142,0.00007498957,0.000036442005,0.00039857006,0.00018474802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040143947,0.0002871129,0.0023366318,0.00011832482,0.000391865,0.0023742942,0.0041270726,0.00016084156,0.0020380935,0.8833085,0.07889671,0.025559159],"study_design_scores_gemma":[0.00060549506,0.0003321308,0.008530631,0.000082949606,0.0000720289,0.00050551945,0.00050569454,0.00003366618,0.0002990853,0.9831294,0.00575344,0.00014997218],"about_ca_topic_score_codex":8.0724163e-7,"about_ca_topic_score_gemma":2.945274e-7,"teacher_disagreement_score":0.09982093,"about_ca_system_score_codex":0.000043141088,"about_ca_system_score_gemma":0.00007749892,"threshold_uncertainty_score":0.39311126},"labels":[],"label_agreement":null},{"id":"W4387501283","doi":"10.1017/jsl.2023.71","title":"UNDEFINABILITY OF MULTIPLICATION IN PRESBURGER ARITHMETIC WITH SETS OF POWERS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Presburger arithmetic; Arithmetic; Multiplication (music); Mathematics; Computer science; Algebra over a field; Discrete mathematics; Pure mathematics; Combinatorics; Decidability","score_opus":0.02421695461103939,"score_gpt":0.27699702313529884,"score_spread":0.25278006852425944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387501283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95159787,0.00017100413,0.046157815,0.0012925966,0.00020364461,0.00026085394,0.0000023854673,0.00003693891,0.00027690153],"genre_scores_gemma":[0.978495,0.00003283697,0.02138794,0.000037993555,0.000022808528,0.00000445035,5.6104454e-7,0.0000067747214,0.000011621288],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99781364,0.00019430618,0.0008902521,0.00026928473,0.0005734319,0.00025908777],"domain_scores_gemma":[0.99763554,0.00048199116,0.00073095626,0.00058577093,0.00047645433,0.00008929462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017193031,0.00014642016,0.00052092306,0.00048701357,0.00002367951,0.000022167877,0.00087045296,0.000082490835,0.00000860375],"category_scores_gemma":[0.0003632526,0.000105755134,0.0001373906,0.0016275735,0.00016750608,0.00029526203,0.00022612042,0.00024406951,0.0000043032705],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038904653,0.004234944,0.71124107,0.0010106647,0.00033613702,0.00029607746,0.013078968,0.08991531,0.011812454,0.03690401,0.0007353684,0.13004592],"study_design_scores_gemma":[0.00091211643,0.0006808971,0.90136415,0.00009831485,0.000018593877,0.00010756473,0.00015255416,0.03467555,0.0015461921,0.0602226,0.000059584443,0.00016187089],"about_ca_topic_score_codex":0.00005485197,"about_ca_topic_score_gemma":0.000010344475,"teacher_disagreement_score":0.19012308,"about_ca_system_score_codex":0.00012032722,"about_ca_system_score_gemma":0.0002343293,"threshold_uncertainty_score":0.43125692},"labels":[],"label_agreement":null},{"id":"W4391045159","doi":"10.1017/jsl.2024.4","title":"POLISH SPACE PARTITION PRINCIPLES AND THE HALPERN–LÄUCHLI THEOREM","year":2024,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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; Akademie Věd České Republiky; National Science Foundation","keywords":"Mathematical proof; Partition (number theory); Mathematics; Forcing (mathematics); Combinatorial proof; Combinatorial principles; Combinatorics; Discrete mathematics; Consistency (knowledge bases); Combinatorial explosion; Mathematical analysis","score_opus":0.04644626764774502,"score_gpt":0.3254615466338696,"score_spread":0.2790152789861246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391045159","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.89642274,0.014521109,0.02078413,0.027406747,0.0013988647,0.00034260043,0.000008355174,0.00012277428,0.038992703],"genre_scores_gemma":[0.99578494,0.0007487034,0.0015273883,0.0003463957,0.000479883,0.000003135078,2.9379063e-7,0.000013541531,0.0010957113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990707,0.00019982192,0.00032707374,0.00009409564,0.0001460847,0.00016219415],"domain_scores_gemma":[0.99852544,0.001049926,0.00017237136,0.00013693757,0.00005947751,0.00005582841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013013899,0.000108756016,0.0002688745,0.00007360423,0.000107869724,0.000051001538,0.00014502603,0.00008383146,0.00011398036],"category_scores_gemma":[0.0005957096,0.000054860317,0.0001183549,0.00008763524,0.00043245612,0.00015467305,0.00004616932,0.00035839248,0.000014464401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067916975,0.000023376386,0.000059800106,0.000046606903,0.000069822,0.00006157124,0.0018477594,0.00001333659,0.00010873175,0.9962556,0.00070336723,0.0007421527],"study_design_scores_gemma":[0.0004883483,0.00006167373,0.00024332124,0.0000997693,0.000089724344,0.0009077821,0.00084307854,0.00015859833,0.00026262726,0.99125785,0.0055198222,0.00006740325],"about_ca_topic_score_codex":0.0000014953482,"about_ca_topic_score_gemma":0.0000023989062,"teacher_disagreement_score":0.09936223,"about_ca_system_score_codex":0.00002730737,"about_ca_system_score_gemma":0.00004188436,"threshold_uncertainty_score":0.22371387},"labels":[],"label_agreement":null},{"id":"W4391584293","doi":"10.1017/jsl.2023.86","title":"BETWEENNESS ALGEBRAS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","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":"Brock University","funders":"","keywords":"Betweenness centrality; Mathematics; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.026899806867492472,"score_gpt":0.2764968481607703,"score_spread":0.24959704129327784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391584293","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.6885646,0.00074676215,0.29607588,0.006760256,0.0021608754,0.00012551315,0.0000014701595,0.00035952908,0.00520514],"genre_scores_gemma":[0.9898919,0.0001430274,0.008573299,0.00065305893,0.00042707848,0.0000015969952,5.3399066e-7,0.00000815152,0.0003013373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987237,0.00005792991,0.0003955019,0.0001578231,0.00034649984,0.00031855152],"domain_scores_gemma":[0.99900746,0.0001460069,0.00029081776,0.00027498373,0.00013704943,0.00014365566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049994385,0.00012049071,0.00028037347,0.0002831413,0.000091942966,0.000070264294,0.001048563,0.00006171555,0.000025015474],"category_scores_gemma":[0.000107712855,0.00008492166,0.0001464851,0.0009932012,0.000041515053,0.0005517149,0.00018619903,0.00023066836,0.00029469817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014643538,0.00013844197,0.0052636643,0.000036691006,0.00010442457,0.0013839988,0.0014898425,0.0014574912,0.0035935175,0.8478396,0.009879711,0.128798],"study_design_scores_gemma":[0.00078195345,0.00041574406,0.06745207,0.000051458923,0.000019696761,0.00071117777,0.00018079185,0.0015444611,0.0014203608,0.9148976,0.012196636,0.0003280192],"about_ca_topic_score_codex":0.0000010017251,"about_ca_topic_score_gemma":3.5404807e-7,"teacher_disagreement_score":0.30132735,"about_ca_system_score_codex":0.000030849937,"about_ca_system_score_gemma":0.000068824076,"threshold_uncertainty_score":0.3787847},"labels":[],"label_agreement":null},{"id":"W4392714449","doi":"10.1017/jsl.2024.16","title":"TWO-CARDINAL DERIVED TOPOLOGIES, INDESCRIBABILITY AND RAMSEYNESS","year":2024,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Network topology; Mathematics; Topology (electrical circuits); Computer science; Combinatorics","score_opus":0.05885324575531981,"score_gpt":0.36701300719205615,"score_spread":0.30815976143673635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392714449","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.9730022,0.0041040275,0.017365072,0.0012942671,0.0008420984,0.00010172017,0.000003571459,0.000068353715,0.003218682],"genre_scores_gemma":[0.9912618,0.00021299637,0.0078937495,0.000157759,0.000304188,0.0000023268592,3.6723745e-7,0.00001246732,0.00015437568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988694,0.00018370713,0.00042834683,0.00015416459,0.00014865534,0.00021572708],"domain_scores_gemma":[0.99871105,0.0008018923,0.00014427485,0.0001613058,0.000094349314,0.00008712822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101183,0.00014446635,0.00040936482,0.00010861033,0.00008334137,0.000036097386,0.00016785068,0.00012403516,0.00012222926],"category_scores_gemma":[0.00071472867,0.000098381206,0.00013285584,0.000119484925,0.00034570205,0.00020221065,0.0000764099,0.00048563987,0.00000730945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013115315,0.00008736927,0.0013384769,0.00018399679,0.0001848746,0.00044908727,0.0012179972,0.000015324955,0.0023877376,0.9836643,0.000501868,0.009837865],"study_design_scores_gemma":[0.00037532166,0.00015154968,0.0016375995,0.000072778224,0.00008660436,0.0014627659,0.0009208274,0.000041700117,0.0005946751,0.9939218,0.00062190456,0.00011244652],"about_ca_topic_score_codex":0.0000024629576,"about_ca_topic_score_gemma":0.0000023569094,"teacher_disagreement_score":0.018259563,"about_ca_system_score_codex":0.00006355644,"about_ca_system_score_gemma":0.000084086234,"threshold_uncertainty_score":0.4011869},"labels":[],"label_agreement":null},{"id":"W4405949452","doi":"10.1017/jsl.2024.69","title":"CATEGORICAL FOUNDATIONS OF FORMALIZED CONDENSED MATHEMATICS","year":2024,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd; Danmarks Grundforskningsfond; Agence Nationale de la Recherche","keywords":"Mathematics; Sheaf; Hausdorff space; Categorical variable; Topological space; Generalization; Category of topological spaces; Urysohn and completely Hausdorff spaces; Topology (electrical circuits); Pure mathematics; Space (punctuation); Compact-open topology; Algebra over a field; Hausdorff measure; Computer science; Topological tensor product; Combinatorics; Hausdorff dimension; Mathematical analysis; Functional analysis","score_opus":0.04290560431996887,"score_gpt":0.30179208831847226,"score_spread":0.2588864839985034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405949452","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.008578442,0.0013594502,0.9795722,0.0007089656,0.0013359862,0.00012408818,4.0625645e-7,0.00006484522,0.008255638],"genre_scores_gemma":[0.9889439,0.000047673562,0.0103734685,0.00006486804,0.00016962348,0.0000024425071,5.024293e-7,0.0000062251743,0.00039131666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867946,0.00004920422,0.00063906395,0.0001051202,0.00035018707,0.00017699202],"domain_scores_gemma":[0.99900025,0.00016711155,0.0003145986,0.00021221621,0.00022023512,0.000085586566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071701285,0.000100137746,0.00031932685,0.00019367384,0.000048866732,0.00017291101,0.0005373996,0.00006983879,0.00004334366],"category_scores_gemma":[0.000086994965,0.00006447505,0.00019407182,0.00039702049,0.000051838928,0.00036719168,0.00007038816,0.00017328795,0.000045014585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023732493,0.0000861164,0.000043558437,0.00010438922,0.000067194866,0.000086587854,0.0019248495,0.000014776455,0.0008184384,0.9923416,0.0011401547,0.0033699775],"study_design_scores_gemma":[0.00065983675,0.0005164421,0.0002290392,0.000036221187,0.0000765128,0.0023668492,0.00036571492,0.0140865445,0.0013321252,0.95629144,0.023835782,0.00020349471],"about_ca_topic_score_codex":0.000009340691,"about_ca_topic_score_gemma":0.0000012337715,"teacher_disagreement_score":0.98036546,"about_ca_system_score_codex":0.000046124213,"about_ca_system_score_gemma":0.0001845114,"threshold_uncertainty_score":0.26292163},"labels":[],"label_agreement":null},{"id":"W4409203108","doi":"10.1017/jsl.2025.27","title":"HIGH DIMENSIONAL COUNTABLE COMPACTNESS AND ULTRAFILTERS","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Materials and Mechanics","field":"Engineering","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":"Countable set; Compact space; Mathematics; Pure mathematics; Discrete mathematics","score_opus":0.0053894540225443155,"score_gpt":0.2153050431628279,"score_spread":0.20991558914028358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409203108","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.9865363,0.0010989839,0.009969883,0.00014443164,0.0015505546,0.000042756677,0.0000054587717,0.000029202118,0.0006223874],"genre_scores_gemma":[0.9973799,0.00035230262,0.0019108496,0.00019444303,0.00008294809,6.3264685e-7,8.077558e-7,0.0000068745053,0.00007124757],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995415,0.0000079445435,0.0002082864,0.00004395255,0.0000818908,0.0001164047],"domain_scores_gemma":[0.9997711,0.00003036673,0.00004905254,0.000052954823,0.000048206268,0.00004829016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011173898,0.00007862718,0.00021627892,0.00006616209,0.0000294063,0.000020142172,0.000061607636,0.000039162125,0.00003204067],"category_scores_gemma":[0.00001283112,0.000060011876,0.00002606866,0.00006347502,0.00001543618,0.0001010393,0.000012761274,0.00009244836,0.0000020704435],"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.00011244044,0.00008785006,0.0002103488,0.00035285307,0.00024267,0.000092327566,0.00020432805,0.14124697,0.7598262,0.08402282,0.007925729,0.0056754528],"study_design_scores_gemma":[0.0102651,0.0007968608,0.018688787,0.0018066037,0.0005502792,0.0019750015,0.0008632185,0.022764077,0.5284823,0.3565141,0.055680767,0.0016128506],"about_ca_topic_score_codex":0.0000028827535,"about_ca_topic_score_gemma":5.9648715e-7,"teacher_disagreement_score":0.27249128,"about_ca_system_score_codex":0.00003551425,"about_ca_system_score_gemma":0.000018240517,"threshold_uncertainty_score":0.24472132},"labels":[],"label_agreement":null},{"id":"W4412014509","doi":"10.1017/jsl.2025.10100","title":"QUANTUM EXPANDERS AND QUANTIFIER REDUCTION FOR TRACIAL VONNEUMANN ALGEBRAS","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Quantum Computing Algorithms and Architecture","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":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Quantifier (linguistics); Reduction (mathematics); Von Neumann architecture; Pure mathematics; Quantifier elimination; Discrete mathematics; Mathematical economics; Philosophy; Epistemology","score_opus":0.015309973849526108,"score_gpt":0.2738600935505323,"score_spread":0.2585501197010062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412014509","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.5501309,0.0006939459,0.4430475,0.0042430726,0.0016504586,0.000108494736,7.142084e-7,0.000031734642,0.00009314495],"genre_scores_gemma":[0.98159045,0.00006240876,0.017601091,0.0002698555,0.00039213029,0.0000024546534,3.4013533e-7,0.00000568649,0.00007557835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893534,0.000057798727,0.00040028346,0.00021270863,0.00016955186,0.00022431524],"domain_scores_gemma":[0.99923205,0.00012329304,0.00024986296,0.00017043506,0.00014864076,0.000075685246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054721767,0.00012987554,0.00027661675,0.00027399976,0.00020269305,0.0001490682,0.00040775674,0.00007844484,0.0000017096563],"category_scores_gemma":[0.00008955846,0.000097488344,0.00013830021,0.0002712031,0.000066811364,0.0002132126,0.00007562097,0.00023062319,9.603646e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015256573,0.00032462462,0.00040354446,0.00018924965,0.00024863184,0.00005129768,0.005086619,0.0027240303,0.016307205,0.6134876,0.0064952956,0.35452932],"study_design_scores_gemma":[0.0025642908,0.00092772796,0.011583994,0.00032358037,0.000087953595,0.0012339907,0.00061300665,0.26961333,0.002989752,0.7050729,0.004518393,0.0004710949],"about_ca_topic_score_codex":0.0000053699337,"about_ca_topic_score_gemma":7.8115784e-7,"teacher_disagreement_score":0.43145952,"about_ca_system_score_codex":0.000023810091,"about_ca_system_score_gemma":0.00010841874,"threshold_uncertainty_score":0.3975459},"labels":[],"label_agreement":null},{"id":"W4414298955","doi":"10.1017/jsl.2025.10143","title":"ON THE COMPUTABILITY OF OPTIMAL SCOTT SENTENCES","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sentence; Countable set; Computable number; Computable analysis; Computable function; Computability; Set (abstract data type)","score_opus":0.01896401671791941,"score_gpt":0.2709963990381654,"score_spread":0.252032382320246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414298955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63024926,0.00042510213,0.35420886,0.010619999,0.0013482025,0.00022809918,0.0000017256577,0.00003881224,0.002879932],"genre_scores_gemma":[0.9784931,0.00002204623,0.020472635,0.00086913095,0.000100721445,0.0000018824894,1.03179026e-7,0.000003462441,0.000036950765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760413,0.00037280933,0.00085194415,0.0002853257,0.00060471374,0.0002810696],"domain_scores_gemma":[0.9966836,0.0014817874,0.00054943725,0.0006847774,0.0005156868,0.0000846935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021105653,0.00018827927,0.00051085255,0.00022570477,0.00012646733,0.00010663688,0.0022028445,0.00007851694,0.000035328223],"category_scores_gemma":[0.00057763746,0.00010694112,0.00030497086,0.00085011835,0.00030100526,0.00022793777,0.00049099996,0.00044184888,0.000008921386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012169303,0.0019849823,0.013457308,0.00015858674,0.00030529927,0.00008614319,0.0023780738,0.036662817,0.0011018111,0.8789541,0.0046413485,0.06014783],"study_design_scores_gemma":[0.0012838846,0.001833625,0.111618206,0.0003551683,0.000066375185,0.00029237042,0.0006254093,0.14294852,0.0039946726,0.7356776,0.0008856485,0.0004185501],"about_ca_topic_score_codex":0.000020028996,"about_ca_topic_score_gemma":0.000002218153,"teacher_disagreement_score":0.34824377,"about_ca_system_score_codex":0.00009956797,"about_ca_system_score_gemma":0.0002914935,"threshold_uncertainty_score":0.43609324},"labels":[],"label_agreement":null},{"id":"W4414908835","doi":"10.1017/jsl.2025.10156","title":"DOMINATION, FIBRATIONS, AND SPLITTING","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Equivalence (formal languages); Rank (graph theory); Product (mathematics); Stability (learning theory); Algebra over a field; Type (biology)","score_opus":0.021625712702737235,"score_gpt":0.35983400117455083,"score_spread":0.3382082884718136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414908835","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.83161324,0.0021066943,0.13135996,0.006762907,0.0005058585,0.00014280365,0.0000014790736,0.000030030535,0.027477011],"genre_scores_gemma":[0.97652,0.00009997861,0.021496767,0.0004243402,0.00009648404,0.0000010121626,2.19218e-7,0.000003519654,0.0013576604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946386,0.00006159449,0.00029208517,0.000050093473,0.00005706772,0.0000752759],"domain_scores_gemma":[0.9990996,0.0005138872,0.00019695086,0.00006860461,0.00009717962,0.000023769464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049735385,0.000052983945,0.00016482701,0.000110471854,0.00008957981,0.000010836156,0.00007106317,0.0000553657,0.000037161954],"category_scores_gemma":[0.0009186987,0.000039516097,0.00003688022,0.0000872562,0.000064507556,0.00010997382,0.000022767843,0.00013791697,0.0000017310675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016896647,0.00002832034,0.0006335647,0.000029447094,0.000028374423,0.000007956418,0.00031992828,0.0000054350353,0.00043764088,0.99420244,0.000986851,0.0033031336],"study_design_scores_gemma":[0.00032230958,0.000031261407,0.0014376087,0.00004816376,0.00003141036,0.0000871775,0.00045417083,0.000028501501,0.0005548564,0.99603695,0.0009320826,0.000035513163],"about_ca_topic_score_codex":2.2222949e-7,"about_ca_topic_score_gemma":5.7793983e-7,"teacher_disagreement_score":0.14490676,"about_ca_system_score_codex":0.000017422413,"about_ca_system_score_gemma":0.000036408237,"threshold_uncertainty_score":0.16114198},"labels":[],"label_agreement":null},{"id":"W4415420634","doi":"10.1017/jsl.2025.10158","title":"WEAK <b>A2</b> SPACES, THE KASTANAS GAME, AND STRATEGICALLY RAMSEY SETS","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Countable set; Ramsey theory; Axiom; Space (punctuation); Topological space; Vector space; Connection (principal bundle); Ramsey's theorem","score_opus":0.03326664078427897,"score_gpt":0.3376169892299593,"score_spread":0.3043503484456803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415420634","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.87379164,0.0057480303,0.019009652,0.017428135,0.0007089149,0.00034050044,0.00000645146,0.000055453587,0.082911246],"genre_scores_gemma":[0.9934722,0.0004866784,0.0027675792,0.0010908352,0.00011779868,0.0000020220134,3.0150827e-7,0.00000958683,0.0020529581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988963,0.0001899979,0.0004292665,0.000111930894,0.0001566737,0.00021581422],"domain_scores_gemma":[0.9985257,0.0007615116,0.00032517972,0.00019928179,0.00011706368,0.00007127917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082021044,0.00014346531,0.00036216073,0.000094321294,0.00012692549,0.000041938598,0.00027032156,0.0001329756,0.00009914567],"category_scores_gemma":[0.00042369822,0.000079151054,0.000097497374,0.00015774764,0.00028206184,0.000106308566,0.0000663737,0.0005115649,0.000005979065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009384396,0.00007587738,0.00028222176,0.000037740763,0.0001056057,0.000055040968,0.00039106005,0.000019875542,0.0003079988,0.9937694,0.0027179809,0.0021433742],"study_design_scores_gemma":[0.00056859327,0.00012615012,0.0013615395,0.00007222614,0.000089220666,0.00034352846,0.0017128816,0.000026018075,0.00011086802,0.9889397,0.0065664067,0.00008287314],"about_ca_topic_score_codex":0.0000017349759,"about_ca_topic_score_gemma":0.0000074929144,"teacher_disagreement_score":0.11968063,"about_ca_system_score_codex":0.000029739604,"about_ca_system_score_gemma":0.00010229882,"threshold_uncertainty_score":0.32276863},"labels":[],"label_agreement":null},{"id":"W561883102","doi":"10.1017/jsl.2016.12","title":"COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY","year":2017,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; National University of Singapore; City University of New York; National Science Foundation","keywords":"Interpretability; Functor; Equivalence (formal languages); Mathematics; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.019870772776410917,"score_gpt":0.28415104373650796,"score_spread":0.26428027096009704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W561883102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3817952,0.004142338,0.60040224,0.0019392964,0.007959307,0.0010495957,0.000013512754,0.00015967278,0.0025388312],"genre_scores_gemma":[0.9642252,0.00014859931,0.03463069,0.00020211012,0.00071876234,0.00001419753,0.000001288431,0.000021153899,0.00003800057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598694,0.00062662543,0.0011455085,0.00094976666,0.00075253943,0.00053861865],"domain_scores_gemma":[0.99400276,0.00085949595,0.0020228962,0.0018843622,0.0008346694,0.00039579716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030700292,0.0006014982,0.0016328968,0.00037003684,0.0002536604,0.0009922341,0.0037360815,0.0004663843,0.000021423562],"category_scores_gemma":[0.0009321361,0.0004610946,0.0005624518,0.00016021765,0.0004212339,0.000642021,0.006394757,0.0020154894,0.000013797661],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030473087,0.002434182,0.081170484,0.002496421,0.0018870084,0.0011505203,0.012916429,0.018385392,0.0004387868,0.020676067,0.0030254023,0.8551146],"study_design_scores_gemma":[0.0014830369,0.0014549827,0.21441953,0.0007915857,0.00020380554,0.0014105333,0.000068615416,0.10033432,0.00027068728,0.6766788,0.0016770827,0.0012070572],"about_ca_topic_score_codex":0.00007957136,"about_ca_topic_score_gemma":0.000005778034,"teacher_disagreement_score":0.8539075,"about_ca_system_score_codex":0.00040914607,"about_ca_system_score_gemma":0.0004636747,"threshold_uncertainty_score":0.99978405},"labels":[],"label_agreement":null}]}