{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":102,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":102,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"62857203da34","filters":{"venue":"Journal of Symbolic Logic"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Bradd Hart","is_ca":true},{"name":"Byunghan Kim","is_ca":true},{"name":"Anand Pillay","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02524597511868252,"gpt":0.3302476609904741,"spread":0.3050016858717916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00130151,0.0003740473,0.0004127188,0.001314408,0.001614957,0.001833429,0.0008245254,0.0006750527,0.005690284],"category_scores_gemma":[0.002059433,0.0002767071,0.0006830163,0.001045492,0.005555054,0.006204687,0.002631126,0.001650858,0.0006544992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139404,"about_ca_system_score_gemma":0.0007317938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00106949,"about_ca_topic_score_gemma":0.0009488034,"domain_scores_codex":[0.9990475,0.0002612161,0.00006618973,0.0001999647,0.0002990128,0.0001260606],"domain_scores_gemma":[0.9990288,0.0003212576,0.0001357413,0.0002011859,0.0001827347,0.0001303173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004116698,0.000003261164,0.00009338321,0.00001140482,0.000002037233,0.00002055095,0.0002208854,0.0003410332,0.0002044938,0.9970976,0.0001487266,0.001852568],"study_design_scores_gemma":[0.000005344866,0.00001418496,0.0001275277,0.000007423776,0.000003066838,0.00003578574,0.0001152745,0.001226573,0.0004092794,0.9939746,0.004075081,0.000005749192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3136109,0.002770507,0.5240588,0.002649815,0.0004016391,0.0001129884,0.0004144379,0.0006364551,0.1553445],"genre_scores_gemma":[0.9431407,0.0007636121,0.04235439,0.0001703197,0.0002393045,0.00009310989,0.0002482348,0.00006628726,0.01292403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005690284,"threshold_uncertainty_score":0.01903588,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Jan Krajı́ček","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02375080234186978,"gpt":0.2625584848825566,"spread":0.2388076825406868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004829844,0.000456063,0.0006028885,0.001136114,0.002968576,0.003650293,0.001835061,0.001486064,0.008770843],"category_scores_gemma":[0.02866378,0.0007383617,0.001333376,0.0007513343,0.007456217,0.007864632,0.004189718,0.005457566,0.0006830849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002018902,"about_ca_system_score_gemma":0.001757128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002446041,"about_ca_topic_score_gemma":0.002326662,"domain_scores_codex":[0.9936683,0.001603252,0.000379899,0.0009338428,0.001969939,0.001444878],"domain_scores_gemma":[0.9372201,0.04840246,0.002582133,0.004000338,0.005286145,0.002508889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006476163,0.0003779309,0.006042557,0.000462007,0.0001435848,0.002763435,0.001593319,0.007859513,0.01366541,0.9346552,0.00970693,0.02208259],"study_design_scores_gemma":[0.0002007982,0.0001570138,0.004334128,0.0000935491,0.0001067574,0.001029707,0.001050924,0.02379804,0.0250147,0.9348527,0.009283664,0.00007799119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5140052,0.0006254839,0.2933957,0.01248918,0.0007068604,0.0005824026,0.001379151,0.003563811,0.1732523],"genre_scores_gemma":[0.9750912,0.0002001734,0.02069918,0.0009166394,0.0002196777,0.0001238695,0.0003906115,0.000211921,0.002146774],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008770843,"threshold_uncertainty_score":0.0293414,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ross Willard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01719232462789122,"gpt":0.2566598042498143,"spread":0.2394674796219231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001958382,0.0002542313,0.0008601681,0.001075563,0.001254491,0.003569064,0.0009754517,0.0006263541,0.005911229],"category_scores_gemma":[0.004810364,0.000341291,0.001060773,0.0008339226,0.003659834,0.004437278,0.002425789,0.001926688,0.001054308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001083833,"about_ca_system_score_gemma":0.0007725054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000952405,"about_ca_topic_score_gemma":0.0007924247,"domain_scores_codex":[0.9984334,0.0002816888,0.0001169602,0.0003422085,0.0006063139,0.0002193418],"domain_scores_gemma":[0.9967945,0.001630748,0.0001655591,0.000453648,0.0007117001,0.0002439338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006890164,0.00003289652,0.0005132306,0.00004243854,0.00000935211,0.00006984399,0.000331231,0.001122692,0.002187914,0.9861107,0.0005325443,0.008978181],"study_design_scores_gemma":[0.00004604381,0.00005778966,0.000371419,0.00002604317,0.00001183258,0.0001250133,0.0002145073,0.01535411,0.006117873,0.9700792,0.007577219,0.00001885981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2241162,0.0006462094,0.7172332,0.0009276097,0.0001411438,0.0001571332,0.000476187,0.0008257487,0.05547664],"genre_scores_gemma":[0.8944581,0.0001613653,0.09748193,0.0001768885,0.0001313839,0.0001419329,0.000531802,0.00009737828,0.006819222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005911229,"threshold_uncertainty_score":0.01977503,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Barbara F. Csima","is_ca":true},{"name":"Joseph R. Mileti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01178406988355374,"gpt":0.2418620093778536,"spread":0.2300779394942999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005329707,0.0004024029,0.00124999,0.001232833,0.002224968,0.003479758,0.001774254,0.001336856,0.008621606],"category_scores_gemma":[0.02063236,0.0008108589,0.0008819742,0.0005757202,0.006356212,0.01115594,0.006380169,0.003228669,0.0007152308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001436217,"about_ca_system_score_gemma":0.0008618375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009102594,"about_ca_topic_score_gemma":0.0007320878,"domain_scores_codex":[0.9949754,0.001396169,0.000286028,0.001384496,0.001370793,0.0005871656],"domain_scores_gemma":[0.9764749,0.01474615,0.001439,0.003910124,0.002017037,0.001412699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001292689,0.00002772961,0.001427193,0.00010389,0.00003561697,0.0001025374,0.0002461542,0.002230183,0.002725052,0.985935,0.001289119,0.005748272],"study_design_scores_gemma":[0.00003171014,0.00007047216,0.0007857825,0.00003037075,0.00003428609,0.0002722057,0.0001609917,0.0163565,0.003408505,0.975015,0.003797568,0.00003662909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5548233,0.001259242,0.3273539,0.007713381,0.0003946566,0.00008218701,0.0004372371,0.0008136472,0.1071224],"genre_scores_gemma":[0.9875485,0.000169725,0.008617736,0.0004691167,0.0001521314,0.0000425974,0.00007191442,0.00005567067,0.002872729],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008621606,"threshold_uncertainty_score":0.02884215,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Johanna N. Y. Franklin","is_ca":true},{"name":"Frank Stephan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01413839293032509,"gpt":0.2619920865501573,"spread":0.2478536936198322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00250769,0.0005310514,0.0009383341,0.002683708,0.002150598,0.004084965,0.00133905,0.001000858,0.007094366],"category_scores_gemma":[0.009851954,0.0005579905,0.001324344,0.001605247,0.006846439,0.008279577,0.00355696,0.003707283,0.0008139178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002512233,"about_ca_system_score_gemma":0.0008468239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001010161,"about_ca_topic_score_gemma":0.0007524553,"domain_scores_codex":[0.9950805,0.001124616,0.0003513418,0.0009788134,0.001614464,0.0008503243],"domain_scores_gemma":[0.9878898,0.006367632,0.001022824,0.002170184,0.001902763,0.0006467901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009261623,0.00002986165,0.0006503499,0.00006341155,0.00002284037,0.00009267986,0.00040046,0.003203966,0.001810831,0.987182,0.001045625,0.005405308],"study_design_scores_gemma":[0.00001014453,0.0000204227,0.0002719378,0.00001370459,0.00001176398,0.00009568108,0.0001623935,0.006981567,0.003011151,0.9874894,0.001909052,0.00002283185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3428724,0.001359061,0.5671765,0.004225066,0.0002647266,0.0001664314,0.0008492005,0.0015109,0.08157572],"genre_scores_gemma":[0.9776791,0.0001549192,0.01736251,0.0004030357,0.0001459925,0.00006108515,0.0002422409,0.00005572565,0.003895265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007094366,"threshold_uncertainty_score":0.02373296,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alexei Myasnikov","is_ca":true},{"name":"Alexander Rybalov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0957049011215074,"gpt":0.2547248305775202,"spread":0.1590199294560128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172237,0.0009304628,0.001349417,0.002447104,0.001662986,0.0049975,0.003083324,0.002208327,0.005766624],"category_scores_gemma":[0.02479538,0.000849969,0.002916331,0.002135905,0.006260367,0.01082607,0.004968703,0.005398076,0.000275113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004529814,"about_ca_system_score_gemma":0.001447056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009772843,"about_ca_topic_score_gemma":0.0007058373,"domain_scores_codex":[0.9911396,0.002071573,0.000702114,0.001886395,0.003089441,0.001110914],"domain_scores_gemma":[0.9656032,0.02526462,0.002308086,0.00360202,0.002014413,0.001207785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002260488,0.0001975569,0.004172351,0.0005367802,0.0001565123,0.0003519511,0.0006765432,0.06527114,0.004846855,0.8993207,0.001703016,0.02254052],"study_design_scores_gemma":[0.00004464799,0.00005304477,0.0008838275,0.00003594416,0.00005944099,0.0002771013,0.0001339457,0.1193475,0.004441434,0.8721403,0.002554466,0.00002847561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4756246,0.0009986475,0.4833423,0.004154245,0.00009409403,0.0004263085,0.0008843819,0.0009627255,0.03351274],"genre_scores_gemma":[0.9494311,0.0003664813,0.04463575,0.0003692877,0.0001580071,0.0003186586,0.0009584391,0.0001224065,0.003639949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005766624,"threshold_uncertainty_score":0.0328663,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nicola Gambino","is_ca":true},{"name":"Peter Aczel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01220020915681502,"gpt":0.2463931295562374,"spread":0.2341929203994224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005443246,0.0006653522,0.001004377,0.003473424,0.001518537,0.007173522,0.002444087,0.00241564,0.005718207],"category_scores_gemma":[0.006749956,0.0006200475,0.001949483,0.002355617,0.01397404,0.008175095,0.003346717,0.003529737,0.0008038434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003592841,"about_ca_system_score_gemma":0.001196155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008519596,"about_ca_topic_score_gemma":0.0007840213,"domain_scores_codex":[0.9949133,0.002512614,0.0002099401,0.0005060649,0.001504909,0.0003530268],"domain_scores_gemma":[0.9960455,0.001826297,0.0002810195,0.0008281058,0.0008326835,0.0001862665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005499771,0.000002094834,0.00002284371,0.0000193047,0.000003976708,0.00002558315,0.0001068056,0.0005339628,0.0001613716,0.9975811,0.0002066685,0.001330692],"study_design_scores_gemma":[0.000009041758,0.000006014551,0.00003496898,0.00002344019,0.000006274168,0.00006584487,0.00003874466,0.002169257,0.0002387767,0.9912279,0.006171824,0.00000801345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04648671,0.00384313,0.8052334,0.005907029,0.001236848,0.00008421615,0.0003266598,0.0007753126,0.1361067],"genre_scores_gemma":[0.8546222,0.00153483,0.1269437,0.001743614,0.001348154,0.0001538935,0.0001713851,0.0002872333,0.01319481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007173522,"threshold_uncertainty_score":0.02878696,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Gerhard Jäger","is_ca":false},{"name":"Thomas Strahm","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06064039954745797,"gpt":0.3603894693762913,"spread":0.2997490698288334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006724942,0.0007564109,0.001223725,0.004495848,0.002403849,0.007635396,0.00203204,0.00195531,0.01095089],"category_scores_gemma":[0.02870801,0.0008514832,0.001403824,0.001904952,0.006164409,0.01564891,0.008445871,0.006043869,0.00144308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003855437,"about_ca_system_score_gemma":0.0009719104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001019839,"about_ca_topic_score_gemma":0.00119853,"domain_scores_codex":[0.9923803,0.002265044,0.0004622274,0.0008775808,0.003060376,0.0009546198],"domain_scores_gemma":[0.970912,0.01989545,0.001711468,0.003092898,0.003373259,0.001014843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001437641,0.000006654684,0.0001455691,0.00003495648,0.000007028063,0.00001804675,0.0001462377,0.0008551472,0.0003181181,0.9955974,0.0003305782,0.002525888],"study_design_scores_gemma":[0.000005037217,0.000009763028,0.0001689255,0.00002894081,0.000009575582,0.00003440491,0.00005479251,0.007974834,0.0009203634,0.9885244,0.002254573,0.00001443225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09728491,0.005135035,0.7754397,0.004491237,0.0003616618,0.0001057647,0.0004466817,0.001226017,0.115509],"genre_scores_gemma":[0.9334264,0.0009038312,0.05828055,0.0006026834,0.0004172799,0.0001359096,0.0002010703,0.0002314846,0.005800744],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01095089,"threshold_uncertainty_score":0.03663439,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Nikolay Bazhenov","is_ca":false},{"name":"Matthew Harrison‐Trainor","is_ca":true},{"name":"I. Sh. Kalimullin","is_ca":false},{"name":"Alexander Melnikov","is_ca":false},{"name":"Keng Meng Ng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004713833986705237,"gpt":0.2053624027478066,"spread":0.2006485687611013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142311,0.0003404188,0.0005615097,0.000915046,0.001843792,0.003579461,0.001254971,0.001157942,0.00722412],"category_scores_gemma":[0.007718877,0.0004673879,0.001282086,0.0008920922,0.004456454,0.00612391,0.002391887,0.002595116,0.0006361197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001752514,"about_ca_system_score_gemma":0.001237403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00112306,"about_ca_topic_score_gemma":0.00125354,"domain_scores_codex":[0.9969198,0.0007448606,0.0002091049,0.0007899711,0.0009604702,0.000375772],"domain_scores_gemma":[0.9903964,0.005210512,0.001033703,0.001468223,0.001345242,0.0005459609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007687401,0.00005566586,0.0004020683,0.00005621503,0.00001078082,0.0001192713,0.0003510961,0.006151147,0.002110171,0.9847032,0.0006012376,0.005362241],"study_design_scores_gemma":[0.00002587179,0.0000273799,0.000160741,0.00001281345,0.000008657836,0.0001049255,0.0000997269,0.0203959,0.001876172,0.9744323,0.002840065,0.00001543185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5239969,0.0004705073,0.4146825,0.002843398,0.0001784552,0.0001597033,0.0008646043,0.000977241,0.05582661],"genre_scores_gemma":[0.9476892,0.0001197823,0.04362295,0.0001633953,0.0001362979,0.0001092905,0.00052795,0.00006521905,0.00756608],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00722412,"threshold_uncertainty_score":0.02416706,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Steven Perron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0541860406085994,"gpt":0.2498554769199531,"spread":0.1956694363113537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002691058,0.0005464259,0.000528217,0.001483701,0.001344612,0.003072574,0.001721609,0.0009407668,0.005969826],"category_scores_gemma":[0.0114593,0.0008349073,0.001138263,0.001486881,0.003970416,0.006183577,0.00375884,0.002134436,0.0004778306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002411077,"about_ca_system_score_gemma":0.001319013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007884062,"about_ca_topic_score_gemma":0.006256748,"domain_scores_codex":[0.9975719,0.0006075961,0.0001150062,0.0003266472,0.001028863,0.000350026],"domain_scores_gemma":[0.9925735,0.004796696,0.0005519913,0.001112251,0.0007320344,0.0002334609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00037449,0.0001090772,0.002511185,0.0002822893,0.00008759186,0.002081612,0.002471006,0.02755985,0.01383726,0.9129455,0.002355209,0.035385],"study_design_scores_gemma":[0.00008072436,0.0001121014,0.001261277,0.0001151138,0.0001086614,0.000551441,0.0006368954,0.1124071,0.01472064,0.8523608,0.01759106,0.00005425949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3422705,0.0008673486,0.613866,0.002130133,0.0001673539,0.0002721868,0.0007091032,0.003404504,0.03631284],"genre_scores_gemma":[0.9013568,0.0002923243,0.0937643,0.000365219,0.00007862026,0.00006915951,0.0004179044,0.000234631,0.003421141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007884062,"threshold_uncertainty_score":0.01997107,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Isaac Goldbring","is_ca":false},{"name":"Bradd Hart","is_ca":true},{"name":"Thomas Sinclair","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06081567080979107,"gpt":0.3393238393058795,"spread":0.2785081684960884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001341567,0.0004098993,0.0008950121,0.0008819191,0.002212985,0.004416124,0.0008982547,0.001495806,0.005888757],"category_scores_gemma":[0.004083012,0.0004419858,0.0009576785,0.0005617086,0.005344103,0.009945575,0.003364872,0.00266574,0.0005846123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001698517,"about_ca_system_score_gemma":0.001252469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001535867,"about_ca_topic_score_gemma":0.001168836,"domain_scores_codex":[0.9982281,0.0002859067,0.0001122826,0.0004409848,0.0006542716,0.0002783833],"domain_scores_gemma":[0.9966103,0.001207085,0.0003678261,0.0007347887,0.0006046917,0.0004751664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002101047,0.00001477091,0.000296669,0.00002273821,0.000007554692,0.00006595125,0.0002647686,0.0003450624,0.0006935254,0.9969015,0.0003880104,0.0009785495],"study_design_scores_gemma":[0.00001526016,0.00005100724,0.0003064847,0.00001564103,0.00001620272,0.0001960784,0.0002267272,0.005579538,0.002011043,0.9869528,0.004613084,0.00001612584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6607646,0.0009383197,0.1620059,0.003867565,0.0003160137,0.00009583947,0.0003571403,0.0008250562,0.1708295],"genre_scores_gemma":[0.9913433,0.00009503253,0.004122823,0.0001886082,0.00006352163,0.00002323315,0.00007396688,0.00002858923,0.004060866],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005888757,"threshold_uncertainty_score":0.01969987,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Franz‐Viktor Kuhlmann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04241540272867443,"gpt":0.3007000092058296,"spread":0.2582846064771552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359612,0.000247595,0.0004268812,0.001068379,0.0007281833,0.001737431,0.0003681782,0.0003672852,0.002484788],"category_scores_gemma":[0.00268316,0.0002480058,0.0004974038,0.0006320414,0.003539463,0.003843314,0.0009016542,0.001061695,0.0002362426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000782722,"about_ca_system_score_gemma":0.0002788712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003216465,"about_ca_topic_score_gemma":0.0002341387,"domain_scores_codex":[0.9994879,0.0001181315,0.00004116541,0.00009749165,0.0001419579,0.0001134359],"domain_scores_gemma":[0.9978433,0.001166362,0.0002961229,0.0002470251,0.0002653728,0.0001818396],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006997922,0.00002570589,0.001769781,0.00005179344,0.00001275304,0.0002599399,0.0003748738,0.00161891,0.004621748,0.9842787,0.0002214107,0.006694437],"study_design_scores_gemma":[0.00003556197,0.0001199481,0.002898331,0.00002339531,0.00002292067,0.0004815944,0.0002364005,0.005017637,0.01021286,0.9762151,0.004719387,0.00001676531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9000863,0.0003300413,0.06746779,0.0003873207,0.00004710044,0.00004242143,0.0001145142,0.0001688078,0.03135577],"genre_scores_gemma":[0.9952428,0.00009686608,0.002818054,0.00002716553,0.00004633837,0.00001213936,0.00005073002,0.00001179779,0.001694067],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002484788,"threshold_uncertainty_score":0.008312464,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Countable set; Mathematics; Disjoint sets; Pairwise comparison; Combinatorics; Discrete mathematics; Existential quantification; Statistics","authors":[{"name":"Bart Kastermans","is_ca":false},{"name":"Juris Steprāns","is_ca":true},{"name":"Yi Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06064661469918653,"gpt":0.3131754181774878,"spread":0.2525288034783013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002738734,0.0004747253,0.0007827045,0.002775816,0.002562354,0.002712042,0.001020321,0.0008115693,0.003753641],"category_scores_gemma":[0.008891482,0.0007125231,0.0009940919,0.00112474,0.004596156,0.004473055,0.004754641,0.001612827,0.000346991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002714425,"about_ca_system_score_gemma":0.0007074765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001077201,"about_ca_topic_score_gemma":0.0006097314,"domain_scores_codex":[0.9976487,0.0005601686,0.0001212604,0.000461432,0.0008805649,0.0003278434],"domain_scores_gemma":[0.99249,0.003473126,0.0008680058,0.0007790473,0.001358193,0.001031637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001190818,0.00003103079,0.002890887,0.00005122156,0.00005788989,0.0005255553,0.0009727375,0.00267304,0.003691894,0.9831781,0.000596089,0.005212466],"study_design_scores_gemma":[0.00005402499,0.00008570725,0.003050303,0.00006894499,0.00007873216,0.001667956,0.001433015,0.02759149,0.006123822,0.9480155,0.01177333,0.00005714503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8312678,0.00115629,0.1272547,0.001453044,0.00006663986,0.00003519923,0.0002367718,0.0002418452,0.03828777],"genre_scores_gemma":[0.9894538,0.0001610295,0.007157305,0.00009240205,0.00004468578,0.00003873766,0.000126402,0.00002444715,0.002901237],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003753641,"threshold_uncertainty_score":0.01969463,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stephen J. Bellantoni","is_ca":true},{"name":"Martin Hofmann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04343371595259829,"gpt":0.2550560087855378,"spread":0.2116222928329395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576294,0.0005602578,0.0005817525,0.001308945,0.001509083,0.00325457,0.001315659,0.0013278,0.00912218],"category_scores_gemma":[0.002959658,0.000613149,0.001157164,0.0006951632,0.005285093,0.006939059,0.003522509,0.003557225,0.00167418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001263131,"about_ca_system_score_gemma":0.001027203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006107899,"about_ca_topic_score_gemma":0.0007332521,"domain_scores_codex":[0.9983168,0.0004358222,0.0001139959,0.0003690273,0.0005445646,0.0002198328],"domain_scores_gemma":[0.9990067,0.0002882578,0.00009792019,0.0002412889,0.0002561584,0.00010971],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002410018,0.000009703397,0.00004292829,0.00003287379,0.000003525903,0.00004825977,0.0001415853,0.001019415,0.002249703,0.9904956,0.0006756373,0.005256625],"study_design_scores_gemma":[0.00002686027,0.00006301839,0.0001160023,0.00004847189,0.00002091072,0.0001614687,0.00009827946,0.01426309,0.004948997,0.9432932,0.03692698,0.00003283246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05957368,0.0006674972,0.8425602,0.002382982,0.0004407871,0.0001242376,0.0002377904,0.001444131,0.09256876],"genre_scores_gemma":[0.6810959,0.0005217105,0.2963666,0.0005770116,0.0003412392,0.0002006755,0.0002687622,0.0002813506,0.02034682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00912218,"threshold_uncertainty_score":0.0305168,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Katalin Bimbó","is_ca":true},{"name":"J. Michael Dunn","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0279169468557467,"gpt":0.261768744220187,"spread":0.2338517973644403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006965788,0.000545755,0.00110099,0.001687788,0.002500962,0.005628645,0.002727031,0.001392612,0.005245613],"category_scores_gemma":[0.01777502,0.001104667,0.003027674,0.001522538,0.006558565,0.008677738,0.00418722,0.006370729,0.0004628241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003980623,"about_ca_system_score_gemma":0.003180115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00481312,"about_ca_topic_score_gemma":0.004044256,"domain_scores_codex":[0.9940575,0.001284228,0.0004316971,0.001477482,0.001708326,0.001040798],"domain_scores_gemma":[0.9748389,0.02064497,0.001059043,0.001276676,0.001477726,0.0007027974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003755705,0.0003039132,0.00294123,0.000328063,0.00009970647,0.0009925349,0.001623747,0.01049321,0.005092108,0.9541637,0.002876074,0.02071011],"study_design_scores_gemma":[0.0001057108,0.00006097411,0.0005351074,0.00007163325,0.00009570142,0.0003195019,0.0003245399,0.04547715,0.006263301,0.943016,0.003686968,0.00004356078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3712112,0.001755089,0.5731353,0.006091976,0.0003599153,0.0003675133,0.0009514106,0.002351936,0.04377572],"genre_scores_gemma":[0.9438529,0.0005229681,0.05025333,0.0007958348,0.0002714823,0.0001205142,0.0005386904,0.0001575782,0.003486655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006965788,"threshold_uncertainty_score":0.03683907,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Joshua Buresh-Oppenheim","is_ca":true},{"name":"Toniann Pitassi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07207676306605637,"gpt":0.2981267113148954,"spread":0.226049948248839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0173493,0.0007198498,0.001747996,0.002968031,0.002754812,0.006883423,0.003654446,0.003023433,0.009565853],"category_scores_gemma":[0.129803,0.001699228,0.00334485,0.003532818,0.008007035,0.01724874,0.007613705,0.006946213,0.001301114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003414315,"about_ca_system_score_gemma":0.002307357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003479401,"about_ca_topic_score_gemma":0.002021423,"domain_scores_codex":[0.97204,0.01028505,0.002143989,0.002734974,0.009910698,0.002885428],"domain_scores_gemma":[0.7705387,0.1923123,0.006082769,0.02186941,0.007320871,0.001875894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004934397,0.0001552372,0.005251771,0.0004994114,0.0001319909,0.0004045302,0.001680601,0.05482047,0.00294341,0.8661967,0.005557383,0.06186508],"study_design_scores_gemma":[0.00009242974,0.00004688741,0.0008583858,0.00008529826,0.00009828225,0.0003677962,0.0005098517,0.1607146,0.004484858,0.8268206,0.005859932,0.00006110899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2890561,0.001855161,0.6621467,0.009160824,0.0001593495,0.0006192895,0.001133443,0.002686677,0.03318245],"genre_scores_gemma":[0.8465355,0.001222424,0.1445236,0.000668647,0.0001886324,0.0003267978,0.001160558,0.0005066564,0.004867291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0173493,"threshold_uncertainty_score":0.09175301,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Christopher J. Eagle","is_ca":true},{"name":"Ilijas Farah","is_ca":true},{"name":"Bradd Hart","is_ca":true},{"name":"Borys Kadets","is_ca":false},{"name":"VLADYSLAV KALASHNYK","is_ca":false},{"name":"Martino Lupini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09231600380510294,"gpt":0.3797142543628975,"spread":0.2873982505577946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001326478,0.0004059728,0.0004569675,0.002286393,0.001611993,0.001789603,0.0004904131,0.0005945001,0.004168081],"category_scores_gemma":[0.002828231,0.0002290481,0.0004436266,0.0006794941,0.002283798,0.003910445,0.001039713,0.001069177,0.0003522534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085849,"about_ca_system_score_gemma":0.000339027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001184854,"about_ca_topic_score_gemma":0.0008695435,"domain_scores_codex":[0.9993625,0.0001160914,0.00003100134,0.0001201474,0.0002341472,0.0001361444],"domain_scores_gemma":[0.9987957,0.0003677931,0.0001573167,0.0001481486,0.0003180662,0.0002129876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003080012,0.00001383685,0.0003652768,0.00001996491,0.00001000676,0.0001077179,0.0003246578,0.0008353211,0.002420294,0.9922283,0.0002386225,0.003405108],"study_design_scores_gemma":[0.00001212705,0.0000415848,0.001035906,0.00002061147,0.00001155431,0.0003685238,0.0002754068,0.00879156,0.004398875,0.98125,0.003769807,0.00002404512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8626922,0.000816207,0.06488206,0.000395888,0.0000523644,0.00003711801,0.0001602575,0.000248377,0.07071552],"genre_scores_gemma":[0.9886863,0.000160484,0.005650372,0.00004473411,0.00005001633,0.00002164696,0.00005606918,0.00001739475,0.005313011],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004168081,"threshold_uncertainty_score":0.01394367,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ziv Shami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02323994967720576,"gpt":0.3232181049454415,"spread":0.2999781552682357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153254,0.0004283852,0.0007897591,0.002153421,0.002077633,0.003339529,0.0008162537,0.0007601127,0.004754654],"category_scores_gemma":[0.003776744,0.0005559988,0.001136353,0.00123522,0.006083455,0.005939202,0.003456725,0.003534276,0.0007492708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003044011,"about_ca_system_score_gemma":0.0008201711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001214789,"about_ca_topic_score_gemma":0.001133223,"domain_scores_codex":[0.9979982,0.000491344,0.0001381531,0.0003787366,0.0007796573,0.0002139998],"domain_scores_gemma":[0.9975412,0.001355074,0.0002236116,0.000285116,0.0003964326,0.0001986062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000118673,0.000008262334,0.0002756023,0.00003676839,0.000005622436,0.00003730248,0.0003512095,0.0001999933,0.0004717426,0.9945282,0.0004057157,0.003667587],"study_design_scores_gemma":[0.0000109625,0.00001661025,0.0002498146,0.00001896261,0.000006577946,0.00005895727,0.00007839839,0.001642627,0.0005388155,0.9887885,0.008582828,0.000006847305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3366067,0.008023996,0.3056096,0.005950722,0.0004610846,0.0001770785,0.0008053032,0.0007798866,0.3415856],"genre_scores_gemma":[0.9437295,0.001034362,0.03414409,0.0006589169,0.0004455718,0.0001331237,0.0005903092,0.00008879622,0.01917523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004754654,"threshold_uncertainty_score":0.02208596,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Wesley Calvert","is_ca":false},{"name":"Julia F. Knight","is_ca":false},{"name":"Jessica Millar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01097482113881487,"gpt":0.2141956998777218,"spread":0.2032208787389069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004348487,0.0002206806,0.0003346871,0.000732791,0.0009808737,0.001532819,0.0004113972,0.0003900389,0.002692349],"category_scores_gemma":[0.002909192,0.0001843086,0.0004326059,0.0009918918,0.00182953,0.003202448,0.001006949,0.001106728,0.0002079025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352381,"about_ca_system_score_gemma":0.0007201082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002899391,"about_ca_topic_score_gemma":0.004138979,"domain_scores_codex":[0.9996271,0.00006021382,0.00002320436,0.00006529956,0.0001387263,0.00008540312],"domain_scores_gemma":[0.9985214,0.0007676076,0.0001561054,0.0002268798,0.0001790292,0.0001490417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001195231,0.00002760247,0.001362751,0.00006341436,0.000005943906,0.0002232971,0.0006417989,0.006064887,0.004485977,0.9743871,0.001078217,0.01153952],"study_design_scores_gemma":[0.00003857973,0.00005180985,0.002078404,0.00002195936,0.00002787601,0.0002416063,0.0004390148,0.03376128,0.01026281,0.9432439,0.00979795,0.00003474271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6826703,0.0005555172,0.2650648,0.001757632,0.00007107886,0.00008353989,0.0005490109,0.0007340855,0.04851413],"genre_scores_gemma":[0.9724118,0.000126342,0.02200687,0.00007154812,0.00003601387,0.00002861522,0.0002013429,0.00003496101,0.005082527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002899391,"threshold_uncertainty_score":0.009812295,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Miodrag Sokić","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1040557914712833,"gpt":0.3456146284198892,"spread":0.2415588369486059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006081379,0.0001900315,0.0002400656,0.0008638893,0.001021398,0.001298612,0.000262685,0.0003159666,0.004032032],"category_scores_gemma":[0.001305908,0.0001615212,0.0002575893,0.0002884326,0.002170446,0.001521091,0.0006809511,0.0005872611,0.0002532938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008896705,"about_ca_system_score_gemma":0.0004075333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001983024,"about_ca_topic_score_gemma":0.002527316,"domain_scores_codex":[0.9996514,0.0000694491,0.00001622528,0.00006256803,0.0001112884,0.00008908252],"domain_scores_gemma":[0.999104,0.0003557293,0.0001410462,0.00008954439,0.000114446,0.000195272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009465526,0.00003351111,0.002124556,0.00003679208,0.000008513921,0.0001040202,0.0005106417,0.002317277,0.00619875,0.9825523,0.0005303242,0.005488735],"study_design_scores_gemma":[0.00003066072,0.00006443483,0.003589047,0.00002882506,0.00001251766,0.0002926957,0.0004652611,0.0201799,0.005875792,0.9632055,0.006228869,0.00002656966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9300765,0.0003806431,0.02160277,0.0004151801,0.00003432073,0.00001818414,0.0001185846,0.0001298242,0.04722392],"genre_scores_gemma":[0.9963291,0.00004277473,0.001747152,0.0000247593,0.0000175424,0.000005649181,0.00003259942,0.000005726629,0.001794656],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004032032,"threshold_uncertainty_score":0.01348853,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","authors":[{"name":"Alexandr Kazda","is_ca":false},{"name":"Matthew Valeriote","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03510935235772742,"gpt":0.2733136988233666,"spread":0.2382043464656392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005007753,0.0005271992,0.001411356,0.001094603,0.002083061,0.006088356,0.001949313,0.00231068,0.006740548],"category_scores_gemma":[0.02111426,0.0007729288,0.002455785,0.0009816001,0.004625525,0.01234438,0.00286416,0.003269456,0.0006090146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002343767,"about_ca_system_score_gemma":0.002323436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002209399,"about_ca_topic_score_gemma":0.002406003,"domain_scores_codex":[0.9949986,0.001409252,0.0004346434,0.001209155,0.000951931,0.0009964689],"domain_scores_gemma":[0.9691482,0.02524499,0.001552075,0.001710821,0.001213089,0.001130922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002566007,0.0006075698,0.01133411,0.0005668984,0.0002167281,0.00125566,0.001223075,0.1027351,0.01985904,0.8173898,0.003418649,0.03882748],"study_design_scores_gemma":[0.0002248327,0.0002183772,0.0008701098,0.00004518732,0.00006732206,0.0002434155,0.0006278646,0.1692129,0.01887786,0.8076683,0.001866866,0.00007696687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7969589,0.0002010092,0.1919712,0.001703923,0.00008094309,0.0002760512,0.0007189572,0.0007328912,0.007356099],"genre_scores_gemma":[0.9493758,0.0001218101,0.04764412,0.0001510431,0.00007297548,0.00007851925,0.0009726585,0.00007962571,0.001503364],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006740548,"threshold_uncertainty_score":0.02648389,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Murray Marshall","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03957285186282869,"gpt":0.2706639565630444,"spread":0.2310911047002157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003549889,0.0008087283,0.001088562,0.002452537,0.002769247,0.005619618,0.002343917,0.00272745,0.00769953],"category_scores_gemma":[0.006085668,0.0006126527,0.00146999,0.002944232,0.01041205,0.01897666,0.004351745,0.005453716,0.0007451703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002344314,"about_ca_system_score_gemma":0.000982576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001019929,"about_ca_topic_score_gemma":0.0005461349,"domain_scores_codex":[0.9968458,0.001191485,0.0001668221,0.0005496661,0.0008153583,0.0004308548],"domain_scores_gemma":[0.992531,0.00526646,0.0004716027,0.0006082644,0.0005523731,0.000570233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007528411,0.000009253279,0.0001175771,0.00003876515,0.00000381334,0.00002161663,0.0001744679,0.000499714,0.00008051324,0.9958029,0.0006476942,0.002596152],"study_design_scores_gemma":[0.000003576836,0.000008277771,0.00007755854,0.00001194409,0.000001197414,0.00002487224,0.0001214168,0.001150463,0.00004353499,0.994852,0.003700748,0.000004288713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3171026,0.05147644,0.3815316,0.05180579,0.00219172,0.00009748215,0.001707325,0.0006669338,0.1934201],"genre_scores_gemma":[0.9081338,0.009643649,0.05210131,0.002296041,0.003876034,0.0001357036,0.001124435,0.0001590819,0.02252986],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00769953,"threshold_uncertainty_score":0.02575743,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Paul C. Gilmore","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02827150745272364,"gpt":0.2724352146138546,"spread":0.244163707161131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006599559,0.0005193343,0.0009307651,0.003332711,0.00198577,0.004260767,0.00265387,0.001847737,0.005958092],"category_scores_gemma":[0.008735419,0.001007899,0.001861754,0.003554528,0.009650997,0.01335382,0.004333783,0.00588826,0.0005665527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00271508,"about_ca_system_score_gemma":0.001179464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001418021,"about_ca_topic_score_gemma":0.00111183,"domain_scores_codex":[0.9959598,0.001497659,0.0002579576,0.0005391904,0.001383924,0.0003614519],"domain_scores_gemma":[0.9910802,0.005203805,0.0005112312,0.001297507,0.001584117,0.0003231427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004757275,0.000004968651,0.00005163286,0.00001665978,0.000003056106,0.00003363091,0.00009429854,0.0003117051,0.0000823301,0.9973495,0.0003761362,0.001671306],"study_design_scores_gemma":[0.00001192106,0.000006641197,0.0000567981,0.0000230583,0.000009224901,0.00009419606,0.0000608005,0.004295578,0.0002979961,0.9908128,0.00432474,0.000006094014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04291373,0.001839485,0.8775603,0.005829566,0.0003256283,0.0001200993,0.0002828555,0.0003513375,0.07077707],"genre_scores_gemma":[0.6327535,0.001540415,0.3468221,0.001995948,0.0009123269,0.0003014418,0.000510545,0.0003093766,0.01485448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006599559,"threshold_uncertainty_score":0.03490222,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michael Hrušák","is_ca":true},{"name":"Juris Steprāns","is_ca":true},{"name":"Yi Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03888326236427211,"gpt":0.3186097792905541,"spread":0.279726516926282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002627138,0.000327051,0.0007039447,0.001310741,0.002561055,0.002632456,0.0007343062,0.001105297,0.003134799],"category_scores_gemma":[0.005065727,0.000347474,0.000625646,0.00100929,0.006920211,0.005573325,0.003561448,0.001992593,0.0002249135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001647927,"about_ca_system_score_gemma":0.0006784766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009081275,"about_ca_topic_score_gemma":0.001154213,"domain_scores_codex":[0.9978862,0.0005388002,0.0001341914,0.00053857,0.000512489,0.0003897035],"domain_scores_gemma":[0.9915252,0.004883066,0.0007264699,0.00134472,0.000760704,0.0007598209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001433463,0.00002967969,0.001849614,0.00004553996,0.00001458738,0.0001743793,0.0005634357,0.001163891,0.002475777,0.9890373,0.0004483333,0.004054145],"study_design_scores_gemma":[0.00003711949,0.00003924566,0.0009071791,0.00001782131,0.00002138296,0.0003390734,0.0005884164,0.003661433,0.002902937,0.9865174,0.004952747,0.0000151686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8146254,0.0008635729,0.1125691,0.003798306,0.000189911,0.00004642316,0.0002300395,0.0002491883,0.06742802],"genre_scores_gemma":[0.9907106,0.00007915991,0.007182602,0.0001448438,0.00006610937,0.0000162699,0.00006025006,0.0000120037,0.001728161],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003134799,"threshold_uncertainty_score":0.01389378,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Barbara F. Csima","is_ca":true},{"name":"Robert I. Soare","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01754326544855362,"gpt":0.2507667551692935,"spread":0.2332234897207399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183295,0.00083306,0.0007488106,0.003524192,0.001790664,0.004546446,0.001132234,0.001163585,0.004963724],"category_scores_gemma":[0.008558027,0.0003764638,0.001260369,0.003092459,0.007958663,0.008538928,0.00381835,0.004808774,0.0005352438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004624662,"about_ca_system_score_gemma":0.0006137418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001752812,"about_ca_topic_score_gemma":0.0007621029,"domain_scores_codex":[0.9979764,0.0005235865,0.0001679896,0.0005561987,0.0006068684,0.0001690309],"domain_scores_gemma":[0.9916198,0.005972472,0.0003781532,0.001023815,0.0007212759,0.0002843821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004706847,0.00000321857,0.0001113596,0.00001830775,0.000003518387,0.0000183998,0.00007528443,0.0007993384,0.0001437864,0.9968985,0.0002295379,0.001694052],"study_design_scores_gemma":[0.000003930209,0.000004690146,0.0001254762,0.00001293993,0.000003880884,0.00003174112,0.00003484027,0.004680029,0.0003329552,0.9901624,0.004602186,0.000004846315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1379881,0.01398119,0.663518,0.01354434,0.001025812,0.0001248908,0.0007777365,0.0005213749,0.1685186],"genre_scores_gemma":[0.9287723,0.002767048,0.05452251,0.0007981765,0.0007889159,0.0001534537,0.0003175304,0.0001096578,0.01177055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004963724,"threshold_uncertainty_score":0.03355443,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Barbara F. Csima","is_ca":true},{"name":"Valentina Harizanov","is_ca":false},{"name":"Russell Miller","is_ca":false},{"name":"Antonio Montalbán","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06807033090625696,"gpt":0.2583032159889854,"spread":0.1902328850827284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034598,0.0002719435,0.0005554386,0.002138508,0.001524022,0.003093919,0.0007033716,0.0008164626,0.002846796],"category_scores_gemma":[0.01147538,0.0003555857,0.0007850234,0.0007703981,0.006055128,0.007183129,0.002623877,0.001564155,0.0002146226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001719831,"about_ca_system_score_gemma":0.0004642099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000908771,"about_ca_topic_score_gemma":0.0006354256,"domain_scores_codex":[0.9981954,0.0003199401,0.0001129472,0.0005539836,0.0005280991,0.0002897047],"domain_scores_gemma":[0.9928397,0.004665071,0.0005812029,0.000721003,0.000647517,0.0005454863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005090169,0.0000191744,0.002013942,0.00004085318,0.00001301431,0.0001501755,0.0009841457,0.002448678,0.00276512,0.9872843,0.0001711545,0.004058576],"study_design_scores_gemma":[0.00000942021,0.00002845471,0.0008283987,0.00002573013,0.00001489173,0.0002430048,0.0002873525,0.01350133,0.004414715,0.9781528,0.002474769,0.00001911191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8449244,0.0007292101,0.1270286,0.0008774296,0.00004922358,0.00004301669,0.0001709653,0.0003936935,0.02578338],"genre_scores_gemma":[0.9927341,0.000084227,0.005907548,0.00003552343,0.00003915522,0.00001415676,0.00003545053,0.00001358604,0.001136368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003093919,"threshold_uncertainty_score":0.01247829,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Chris J. Conidis","is_ca":true},{"name":"Theodore A. Slaman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01403643530093572,"gpt":0.2270762544515826,"spread":0.2130398191506468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004028586,0.0003114434,0.0005950596,0.00115364,0.001390373,0.001730187,0.001046681,0.0007696904,0.003693179],"category_scores_gemma":[0.00673017,0.0003446535,0.0007179285,0.0005451901,0.006272642,0.007298427,0.002686231,0.002210308,0.0002506911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00134581,"about_ca_system_score_gemma":0.0005785619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007859992,"about_ca_topic_score_gemma":0.0009301849,"domain_scores_codex":[0.9983,0.0006362022,0.0001020667,0.0003817774,0.0003971966,0.0001826437],"domain_scores_gemma":[0.9944828,0.003554318,0.0005714578,0.0006617585,0.0004726897,0.0002570565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002322801,0.00000976137,0.000316886,0.00002039682,0.000007247659,0.00006636725,0.0001180665,0.0009360966,0.0007631953,0.9955973,0.0002493454,0.001892123],"study_design_scores_gemma":[0.00001438036,0.00003095202,0.0005223157,0.00001583719,0.00001306439,0.0001010699,0.0001059367,0.006053239,0.001230182,0.9893935,0.002500458,0.00001917697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5167654,0.001784767,0.388099,0.00574831,0.0002580283,0.00006476176,0.0002769465,0.0004588469,0.08654398],"genre_scores_gemma":[0.9788722,0.0001950641,0.01684806,0.0004035859,0.0001039745,0.00003785198,0.00005829635,0.00003009512,0.003450737],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004028586,"threshold_uncertainty_score":0.02130544,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Uniqueness; Countable set; Transitive relation; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis","authors":[{"name":"Paul Larson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1441852712389649,"gpt":0.3401671201379032,"spread":0.1959818488989383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002615238,0.0007262414,0.001125287,0.002007399,0.003100114,0.003460471,0.001216453,0.001620693,0.006045897],"category_scores_gemma":[0.008451602,0.0007191827,0.002308282,0.0008189057,0.00601036,0.006914292,0.005272686,0.003430367,0.001175562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001245198,"about_ca_system_score_gemma":0.00118552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006777928,"about_ca_topic_score_gemma":0.0005452727,"domain_scores_codex":[0.9977553,0.0005428246,0.0001702702,0.000768068,0.0004357396,0.0003278181],"domain_scores_gemma":[0.9946309,0.002575941,0.0003492498,0.0006744848,0.001309601,0.0004597534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000310865,0.0000091683,0.0004297184,0.00003960217,0.00002022361,0.00008227481,0.0002907733,0.0009258565,0.0007806005,0.9923652,0.0006677413,0.004357718],"study_design_scores_gemma":[0.00001597474,0.00002897893,0.0001775471,0.00003349543,0.0000178795,0.0002811324,0.0001642135,0.009467508,0.002296905,0.9818923,0.005604797,0.00001903325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1579341,0.001345252,0.7460555,0.002199813,0.0004735498,0.0001368511,0.0003888794,0.0008813391,0.0905847],"genre_scores_gemma":[0.9002348,0.0004312834,0.07722407,0.0005465554,0.0003788785,0.0002988519,0.0002931017,0.0004210857,0.02017146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006045897,"threshold_uncertainty_score":0.02022558,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Kenneth Kunen","is_ca":false},{"name":"Franklin D. Tall","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02172968886334308,"gpt":0.2761347691118486,"spread":0.2544050802485056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003882102,0.0005662725,0.0007247733,0.001801296,0.00227146,0.006152438,0.0009621364,0.001136779,0.004084724],"category_scores_gemma":[0.003963621,0.0004779459,0.001343094,0.001843666,0.008816011,0.01302965,0.00266403,0.004226993,0.0008988185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003403348,"about_ca_system_score_gemma":0.001027411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001609791,"about_ca_topic_score_gemma":0.001352967,"domain_scores_codex":[0.9970817,0.001419544,0.000145442,0.0005566713,0.0005598774,0.0002367485],"domain_scores_gemma":[0.9973551,0.001295125,0.0002211733,0.0006650342,0.0002739901,0.0001896555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003979185,0.000003370462,0.00004049462,0.000009325983,0.000001568474,0.00001194024,0.0002054383,0.0001749904,0.0001041182,0.9980825,0.0002614615,0.001100901],"study_design_scores_gemma":[0.000004314756,0.00001029022,0.00005000373,0.00001062384,0.000002411341,0.00001948099,0.0000576674,0.001006834,0.000118302,0.9905048,0.008211466,0.00000376974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1053702,0.01250286,0.5641879,0.01282367,0.0009016397,0.0001054997,0.0006749943,0.001005706,0.3024276],"genre_scores_gemma":[0.8852352,0.002565418,0.08821233,0.001108879,0.0009321402,0.0002395502,0.0003975726,0.0002485702,0.02106037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006152438,"threshold_uncertainty_score":0.02469313,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Bernhard König","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05022263839091771,"gpt":0.3662132275233379,"spread":0.3159905891324202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007161429,0.0004815122,0.001292561,0.002409365,0.00223556,0.003770972,0.002584223,0.001627553,0.003903368],"category_scores_gemma":[0.01965173,0.001032101,0.002323199,0.001458679,0.01022186,0.007475107,0.006244042,0.00605497,0.0004777033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00173139,"about_ca_system_score_gemma":0.001258299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007851701,"about_ca_topic_score_gemma":0.0008298118,"domain_scores_codex":[0.9940438,0.001379352,0.0006540372,0.001405599,0.001806868,0.0007104601],"domain_scores_gemma":[0.9721797,0.01380192,0.001705623,0.008241901,0.003071118,0.0009997938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008639145,0.00005275043,0.001458908,0.00009799063,0.00005561518,0.0003303814,0.0007583053,0.002616154,0.003750028,0.9821576,0.0004964819,0.008139242],"study_design_scores_gemma":[0.00003547625,0.00006517032,0.0008526418,0.00003491575,0.00004291967,0.0004059933,0.0001959733,0.008646678,0.007747527,0.9779766,0.003965397,0.00003069379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4443658,0.0007406882,0.4799349,0.00368132,0.0003801798,0.0001344472,0.0006541555,0.001389966,0.06871841],"genre_scores_gemma":[0.9605104,0.0001955547,0.03419937,0.0004165912,0.0002052235,0.00007640078,0.0003054411,0.0001052237,0.003985972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007161429,"threshold_uncertainty_score":0.03787369,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Barbara F. Csima","is_ca":true},{"name":"Matthew Harrison‐Trainor","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04343881680507022,"gpt":0.2852791939979936,"spread":0.2418403771929234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002763554,0.0003442895,0.0007560898,0.001778197,0.001458705,0.005426609,0.001235333,0.000876643,0.004199042],"category_scores_gemma":[0.007625823,0.0004507848,0.001265624,0.001090131,0.00560831,0.007816983,0.003251352,0.002845156,0.0002378583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003674795,"about_ca_system_score_gemma":0.001067155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00352301,"about_ca_topic_score_gemma":0.002476364,"domain_scores_codex":[0.9968912,0.0007233848,0.0002103061,0.0005936123,0.0009387767,0.0006426454],"domain_scores_gemma":[0.9870451,0.00834802,0.0009569752,0.001179582,0.001024448,0.001445991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001144213,0.00005004576,0.002656693,0.00006391849,0.00001719162,0.0001383371,0.0005951422,0.009748071,0.002246047,0.9793068,0.0003924892,0.004670904],"study_design_scores_gemma":[0.00003947573,0.00007756842,0.002094502,0.00003082235,0.00002392914,0.0001647348,0.0004319616,0.04119721,0.003734363,0.9496726,0.002490239,0.00004255963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8099624,0.0002893996,0.1623368,0.00126776,0.00003613828,0.00009366588,0.0003637193,0.0003323101,0.02531791],"genre_scores_gemma":[0.9858961,0.00008042474,0.01175801,0.00007661122,0.00002699009,0.00003137158,0.0001771645,0.00002442042,0.001928836],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005426609,"threshold_uncertainty_score":0.02666259,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01299006144829343,"gpt":0.2397607336340612,"spread":0.2267706721857677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009303541,0.0006788048,0.001636838,0.002129745,0.002887669,0.004604071,0.004080554,0.003000823,0.005055084],"category_scores_gemma":[0.02500141,0.0009928845,0.002116229,0.002015483,0.01261585,0.01566267,0.006802917,0.007232689,0.0007042432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002980199,"about_ca_system_score_gemma":0.002052698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002836592,"about_ca_topic_score_gemma":0.001376782,"domain_scores_codex":[0.9918441,0.002024279,0.0006610908,0.001214426,0.002919837,0.001336217],"domain_scores_gemma":[0.9720643,0.01856938,0.001262991,0.004553371,0.002627719,0.0009222212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002545894,0.00004382665,0.001219044,0.0002037646,0.00004722058,0.0004296624,0.0005399236,0.005545036,0.001464926,0.982633,0.001462882,0.006156133],"study_design_scores_gemma":[0.00004527221,0.00004493381,0.0002734618,0.00004692419,0.00003406269,0.0002390803,0.0001728863,0.01668264,0.003238224,0.9759913,0.003186756,0.00004440367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3780153,0.001698622,0.5048226,0.01024443,0.0005858777,0.0001079459,0.0007226556,0.002571579,0.1012309],"genre_scores_gemma":[0.981639,0.0002950155,0.01537375,0.0004421699,0.0001200968,0.0000279009,0.0001469567,0.00008513154,0.001870009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009303541,"threshold_uncertainty_score":0.04920238,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Rachael Alvir","is_ca":false},{"name":"Dino Rossegger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08827320045250713,"gpt":0.2853018291099472,"spread":0.19702862865744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626656,0.0004067285,0.000749269,0.001933917,0.00119565,0.004371075,0.0008825277,0.0008628614,0.006910446],"category_scores_gemma":[0.01072682,0.0004772261,0.001007028,0.001143205,0.002317876,0.007841727,0.001637061,0.001390928,0.0004020728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002482062,"about_ca_system_score_gemma":0.0008809067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001754422,"about_ca_topic_score_gemma":0.00212237,"domain_scores_codex":[0.9974139,0.0005822605,0.0002084581,0.0003457307,0.001033912,0.0004157282],"domain_scores_gemma":[0.9865481,0.009503255,0.001334467,0.000725878,0.001092555,0.0007956446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001005442,0.0002624047,0.01579437,0.0005944974,0.0001833735,0.0007683143,0.002952721,0.05898251,0.01588333,0.876832,0.003908602,0.02283255],"study_design_scores_gemma":[0.00007755084,0.000182688,0.009376008,0.00005933544,0.00009631203,0.0003681373,0.0008365751,0.1553182,0.009856343,0.8198411,0.003868336,0.0001193762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.934212,0.0002749805,0.05214635,0.0008241422,0.00002552814,0.00004671466,0.0007572035,0.0002692741,0.01144384],"genre_scores_gemma":[0.9891803,0.00009894783,0.00783337,0.00007012243,0.00006062102,0.0000393781,0.0006725389,0.0000491978,0.001995499],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006910446,"threshold_uncertainty_score":0.02311772,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alexander Berenstein","is_ca":false},{"name":"Evgueni Vassiliev","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06083862360909566,"gpt":0.2988159076620913,"spread":0.2379772840529956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726018,0.0004070505,0.0004940748,0.001254062,0.0009235,0.001717416,0.0007364135,0.0005526746,0.002998153],"category_scores_gemma":[0.001297196,0.0001756464,0.0004545769,0.000551386,0.004458178,0.003283807,0.001971646,0.001283511,0.0002973112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001234121,"about_ca_system_score_gemma":0.0003698117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004645065,"about_ca_topic_score_gemma":0.0004737168,"domain_scores_codex":[0.9992442,0.000147507,0.00003678429,0.000159644,0.0002852239,0.0001266524],"domain_scores_gemma":[0.9990188,0.000246818,0.000181205,0.0001940083,0.0001864642,0.0001725939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001327,0.00001239909,0.0006297032,0.00001619712,0.000004281458,0.00006867032,0.0002072664,0.0007984859,0.001315002,0.9946098,0.0001490086,0.002175828],"study_design_scores_gemma":[0.00001752435,0.00005759547,0.0009530373,0.00001705145,0.0000106864,0.0002248593,0.0002472283,0.008108851,0.001751865,0.9854455,0.003152028,0.00001374718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8263488,0.0003602155,0.08966208,0.0009103077,0.00005941452,0.00005643366,0.0001284628,0.0001910203,0.08228324],"genre_scores_gemma":[0.990694,0.00006487234,0.005197229,0.00008695296,0.00002978983,0.00001981852,0.00006011108,0.00001324494,0.003834004],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002998153,"threshold_uncertainty_score":0.01002979,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Deirdre Haskell","is_ca":true},{"name":"Ehud Hrushovski","is_ca":false},{"name":"Dugald Macpherson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01770186265027978,"gpt":0.2909146382977195,"spread":0.2732127756474397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001614316,0.0003487284,0.0004586429,0.001253671,0.001884124,0.004336821,0.0006366079,0.001397456,0.004088271],"category_scores_gemma":[0.005922579,0.0003070883,0.0004457758,0.00074278,0.01351916,0.009027678,0.00260671,0.003144889,0.0002962801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001727797,"about_ca_system_score_gemma":0.0004666919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006615496,"about_ca_topic_score_gemma":0.0004575073,"domain_scores_codex":[0.9990649,0.0003171184,0.00004342469,0.000115385,0.0002715446,0.0001876202],"domain_scores_gemma":[0.9970054,0.001710689,0.0002335766,0.000470918,0.0003051971,0.0002742027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002758171,0.000004140096,0.0001070912,0.00001350466,0.000001647322,0.000154376,0.0006860882,0.0003248858,0.0006990359,0.9968418,0.0002153695,0.0009244541],"study_design_scores_gemma":[0.00001564455,0.00001254914,0.0001122639,0.00001229945,0.000003406169,0.000173126,0.0005896597,0.001584057,0.0008626279,0.9922347,0.004388392,0.00001118284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6209167,0.0007838308,0.1778508,0.009174977,0.0003710679,0.0000519305,0.0002287806,0.0005525578,0.1900692],"genre_scores_gemma":[0.9905741,0.00007991536,0.005772349,0.0001348953,0.00003311463,0.00001479753,0.00003039874,0.00003979964,0.003320833],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004336821,"threshold_uncertainty_score":0.01367664,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Levon Haykazyan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02537421170848743,"gpt":0.3180061572629725,"spread":0.2926319455544851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002501819,0.0004978537,0.0008011502,0.002528048,0.001805319,0.006758417,0.0009846085,0.001055843,0.005018275],"category_scores_gemma":[0.003195699,0.000504662,0.001199877,0.001975493,0.007573058,0.01005398,0.004197087,0.002360741,0.0005307093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001794461,"about_ca_system_score_gemma":0.001016824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008308657,"about_ca_topic_score_gemma":0.0006382993,"domain_scores_codex":[0.9975084,0.0009857933,0.0001473995,0.0003287227,0.000780311,0.0002492904],"domain_scores_gemma":[0.9977011,0.000997883,0.0002647652,0.0003130047,0.0004435687,0.0002798034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007010746,0.000003011296,0.0000581124,0.00001072113,0.000002962547,0.00002027358,0.0001045063,0.0003384354,0.0001666639,0.9983996,0.0001057887,0.0007830651],"study_design_scores_gemma":[0.000006671957,0.00001187,0.00006800089,0.00001245509,0.000005590969,0.00008134071,0.0001371746,0.002760509,0.0003570012,0.9933821,0.003169542,0.000007780738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2829597,0.002770452,0.6130717,0.003407932,0.000607688,0.000104645,0.0007341114,0.000534847,0.09580896],"genre_scores_gemma":[0.9582981,0.0005200463,0.03278119,0.0002419773,0.0001772234,0.00009498135,0.0001865095,0.0000830967,0.007616951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006758417,"threshold_uncertainty_score":0.01678777,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Chris J. Conidis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02040741888462065,"gpt":0.268995094939475,"spread":0.2485876760548543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001607314,0.0008359696,0.0008069724,0.0009506444,0.0009101804,0.002801019,0.001097044,0.001235363,0.004989551],"category_scores_gemma":[0.01421269,0.0004530062,0.0009258249,0.0006261172,0.003106574,0.006610134,0.002344083,0.001941811,0.0006056778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001361011,"about_ca_system_score_gemma":0.0009131709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003292848,"about_ca_topic_score_gemma":0.0003586573,"domain_scores_codex":[0.9981889,0.000415108,0.0001947703,0.000471437,0.0004836097,0.0002461092],"domain_scores_gemma":[0.9876471,0.006873779,0.001003949,0.002730485,0.001011064,0.0007335667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001656586,0.0002153888,0.0096681,0.0007525259,0.0001796823,0.0004855176,0.0009018946,0.06099253,0.05096108,0.7879342,0.005390502,0.08086195],"study_design_scores_gemma":[0.0001586998,0.0005397387,0.002509628,0.0001368216,0.0001053084,0.0007551895,0.0003993581,0.252231,0.05369167,0.674827,0.01448336,0.000162266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6959881,0.0007355863,0.2778104,0.001975552,0.0003246569,0.0001024212,0.0003805099,0.001912965,0.02076975],"genre_scores_gemma":[0.886084,0.00007619996,0.1116354,0.0001734034,0.00004296561,0.00005831075,0.0002098892,0.0001547267,0.001565043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004989551,"threshold_uncertainty_score":0.01669174,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Chris Miller","is_ca":true},{"name":"Patrick Speissegger","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06992720322201543,"gpt":0.3259013966798077,"spread":0.2559741934577923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008024593,0.0004700152,0.0004467976,0.0009673219,0.0006112669,0.00111591,0.0006198044,0.000453,0.002353134],"category_scores_gemma":[0.002586018,0.0001788258,0.0006078522,0.0004523676,0.001336694,0.003244683,0.001214787,0.001214466,0.0002164016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001892334,"about_ca_system_score_gemma":0.0005046059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001713782,"about_ca_topic_score_gemma":0.001550575,"domain_scores_codex":[0.9997253,0.00005589998,0.00001536275,0.00005490291,0.00007894739,0.00006958046],"domain_scores_gemma":[0.999256,0.0002701678,0.00013304,0.00004308744,0.0001495444,0.0001481996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003050595,0.00003097536,0.001086447,0.00003676735,0.000009582222,0.0001789245,0.0003826953,0.005763651,0.003028751,0.9844984,0.0002236838,0.004729453],"study_design_scores_gemma":[0.0000232511,0.00005841318,0.001221365,0.00003114375,0.00001094069,0.0001772586,0.0002835974,0.07821915,0.001752182,0.915763,0.002438615,0.00002103482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8607991,0.0007546629,0.1007312,0.0008766167,0.00006996524,0.00002829964,0.00009591118,0.0001365144,0.03650775],"genre_scores_gemma":[0.9757113,0.0003841138,0.01421771,0.0001176201,0.00009497516,0.00002352994,0.00009099781,0.00002789526,0.009331702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002353134,"threshold_uncertainty_score":0.01372987,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Harvey M. Friedman","is_ca":false},{"name":"Patrick Speissegger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04491493955108227,"gpt":0.3819997416435831,"spread":0.3370848020925008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002017854,0.0003105021,0.000488149,0.001288729,0.0008005019,0.003163384,0.0007485357,0.0006878121,0.003187485],"category_scores_gemma":[0.00472655,0.0003055321,0.0006172759,0.0005359784,0.007738708,0.006531058,0.002266948,0.002172632,0.0001690988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001786726,"about_ca_system_score_gemma":0.0003692767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006480511,"about_ca_topic_score_gemma":0.000621737,"domain_scores_codex":[0.998602,0.0004309151,0.00009428342,0.0002625486,0.0003880361,0.0002222351],"domain_scores_gemma":[0.9961113,0.002464246,0.0003769534,0.0004627664,0.0003154502,0.0002692557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002927764,0.00001449476,0.0002592413,0.0000198093,0.000002249131,0.00007841338,0.000585787,0.0008189199,0.001374078,0.9945221,0.00006706662,0.00222871],"study_design_scores_gemma":[0.00002289915,0.00005596023,0.0006327397,0.00003789533,0.00001282846,0.0001720919,0.0004993866,0.008228694,0.003095234,0.9839178,0.00330706,0.00001745162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6726167,0.001186377,0.2333272,0.001932799,0.0001147968,0.00005272278,0.0001650486,0.0003144337,0.0902899],"genre_scores_gemma":[0.9840297,0.0001365317,0.0130791,0.00008023177,0.00006070992,0.00002646,0.00006380854,0.00002969875,0.002493715],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003187485,"threshold_uncertainty_score":0.01296365,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"W. Charles Holland","is_ca":false},{"name":"Salma Kuhlmann","is_ca":true},{"name":"Stephen H. McCleary","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05006869586978464,"gpt":0.3446588045126787,"spread":0.2945901086428941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002183,0.000356064,0.0004235877,0.00151782,0.001008817,0.00315623,0.000354364,0.0003317382,0.01175625],"category_scores_gemma":[0.00301202,0.0003404292,0.0003892829,0.001300996,0.002647611,0.004324742,0.002412828,0.0008320779,0.001719234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000829613,"about_ca_system_score_gemma":0.0004038943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006163341,"about_ca_topic_score_gemma":0.001017932,"domain_scores_codex":[0.998657,0.0003850229,0.0001979474,0.0002287728,0.0003008639,0.0002304237],"domain_scores_gemma":[0.9975396,0.001075657,0.0002467265,0.000397817,0.0004797308,0.0002604667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000292463,0.00002877552,0.001246272,0.0001861082,0.00002139112,0.0006845822,0.001771597,0.0008967224,0.006723337,0.9585522,0.002060831,0.02753571],"study_design_scores_gemma":[0.00008068589,0.0001309329,0.001258561,0.0001409537,0.00004223051,0.0008190271,0.001496486,0.004489071,0.01449955,0.9061661,0.07083644,0.00003989011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5460935,0.002336515,0.1700549,0.001641153,0.0007157772,0.0001833986,0.001086771,0.0005817735,0.2773064],"genre_scores_gemma":[0.9285468,0.0008045697,0.03246669,0.0002646752,0.0002981457,0.00005230961,0.0005837412,0.0001435026,0.03683951],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01175625,"threshold_uncertainty_score":0.03932852,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Barbara F. Csima","is_ca":true},{"name":"Rod Downey","is_ca":false},{"name":"Keng Meng Ng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1159473559644005,"gpt":0.28514799890236,"spread":0.1692006429379595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003835848,0.0005622786,0.0009322331,0.002476399,0.001633997,0.003326808,0.001433575,0.001312786,0.008146934],"category_scores_gemma":[0.0162029,0.0006674897,0.00147093,0.001029499,0.006287494,0.007729827,0.006248986,0.004767854,0.0005705911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001514947,"about_ca_system_score_gemma":0.0007351884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001317393,"about_ca_topic_score_gemma":0.001065647,"domain_scores_codex":[0.9962437,0.0006622116,0.0002825357,0.0006644531,0.001505011,0.0006420624],"domain_scores_gemma":[0.9889706,0.007131481,0.0004637095,0.001359657,0.001386707,0.0006878715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005162548,0.00003682027,0.0007431911,0.00004750758,0.00001643275,0.0002245719,0.0003778653,0.001916455,0.001128317,0.9902925,0.0004937382,0.004671065],"study_design_scores_gemma":[0.00001547038,0.00002824291,0.0002976994,0.00001707744,0.0000151847,0.0001840891,0.0001834801,0.009266546,0.001624831,0.9862618,0.002089919,0.00001570701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5901428,0.001251409,0.2135905,0.002975258,0.0002498504,0.0001524289,0.0004302897,0.0008471162,0.1903604],"genre_scores_gemma":[0.9761316,0.0002201139,0.01554233,0.000303739,0.0001253618,0.00008622893,0.0001839161,0.00009874935,0.007307963],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008146934,"threshold_uncertainty_score":0.02725422,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Pure mathematics; Mathematics; Algebra over a field","authors":[{"name":"Matthias Aschenbrenner","is_ca":false},{"name":"Rahim Moosa","is_ca":true},{"name":"Thomas Scanlon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06157065115899552,"gpt":0.3279451757935848,"spread":0.2663745246345893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001000309,0.0006578881,0.0005008176,0.001508161,0.001182907,0.003176834,0.0006830631,0.0009473343,0.003161579],"category_scores_gemma":[0.001886712,0.0002564256,0.0004935125,0.00071424,0.004847583,0.005144938,0.002488948,0.00147724,0.0002118219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001087498,"about_ca_system_score_gemma":0.000357268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004006367,"about_ca_topic_score_gemma":0.0004673135,"domain_scores_codex":[0.9994013,0.0001873145,0.00003423135,0.000104707,0.000162495,0.0001099996],"domain_scores_gemma":[0.9987789,0.0005404803,0.0001699771,0.0001370141,0.0001762925,0.000197266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003802415,0.00001525473,0.0004133195,0.00003119316,0.000007469948,0.000176127,0.001038453,0.0005781609,0.002081193,0.9941911,0.0001511214,0.001278542],"study_design_scores_gemma":[0.00001732546,0.00003481935,0.0005038854,0.00001822172,0.00001031707,0.0001256632,0.0005718082,0.002957429,0.001179347,0.9923673,0.002205219,0.000008671332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8837486,0.000610296,0.07658285,0.001454459,0.00008507894,0.00006115851,0.0001508831,0.0001276436,0.03717906],"genre_scores_gemma":[0.9936529,0.00007063344,0.003988511,0.00005006612,0.00003369114,0.00001828645,0.0000415842,0.00001196472,0.002132377],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003176834,"threshold_uncertainty_score":0.01057655,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"L. P. Belluce","is_ca":true},{"name":"Antonio Di Nola","is_ca":false},{"name":"Giacomo Lenzi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01520268909291623,"gpt":0.2576290290568988,"spread":0.2424263399639826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007519954,0.0004036027,0.0005147284,0.001376121,0.001145001,0.002175062,0.0006405718,0.0003560491,0.004460714],"category_scores_gemma":[0.001526629,0.0001737488,0.0005943202,0.0008641886,0.003083839,0.003448497,0.001934416,0.001033303,0.0005404694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001252486,"about_ca_system_score_gemma":0.0004188356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00108937,"about_ca_topic_score_gemma":0.0004682451,"domain_scores_codex":[0.9991196,0.0002754456,0.00004547356,0.0001586897,0.000292698,0.0001081891],"domain_scores_gemma":[0.9992385,0.0001697206,0.0001205049,0.00007262517,0.0002551503,0.0001434599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005086891,0.000001982914,0.00007451977,0.000008909621,0.00000279401,0.00002113912,0.00006821872,0.000293265,0.0002879366,0.998163,0.000130559,0.0009424132],"study_design_scores_gemma":[0.000006386806,0.00001658002,0.0001979238,0.000008589208,0.000005239313,0.00007438904,0.0001114116,0.003100693,0.0004492306,0.9922225,0.003799747,0.000007301129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4735912,0.002228393,0.375178,0.002469092,0.0003634354,0.0000759815,0.0005221157,0.0003823519,0.1451894],"genre_scores_gemma":[0.9829561,0.0003991707,0.01062044,0.0001302024,0.0002179583,0.00002402686,0.0001322834,0.00003183536,0.005488116],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004460714,"threshold_uncertainty_score":0.01492262,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Ideal (ethics); Combinatorics; Discrete mathematics; Philosophy; Epistemology","authors":[{"name":"Saharon Shelah","is_ca":false},{"name":"Juris Steprāns","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07546392514603789,"gpt":0.3675730739033885,"spread":0.2921091487573506,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166396,0.0003958798,0.0005779738,0.001644088,0.001526601,0.002894444,0.0003525144,0.0004754902,0.002411522],"category_scores_gemma":[0.002784936,0.0003169139,0.0004521273,0.0007347651,0.003344628,0.003556265,0.001572771,0.0008385913,0.0005500994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001367499,"about_ca_system_score_gemma":0.0003499557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004309381,"about_ca_topic_score_gemma":0.0003135043,"domain_scores_codex":[0.9987079,0.000191276,0.00009862179,0.0002826135,0.0003551111,0.0003644442],"domain_scores_gemma":[0.9980235,0.0006147479,0.0003729751,0.0001412761,0.0003585359,0.0004888997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003860897,0.00002896695,0.001785111,0.00006555553,0.00001917648,0.0001410276,0.0007039097,0.001377696,0.008273902,0.9781449,0.0008155627,0.008258202],"study_design_scores_gemma":[0.00004598964,0.0001310254,0.00474539,0.00004186542,0.0000375781,0.0005478822,0.0005816963,0.005843814,0.01396398,0.9624316,0.01158505,0.0000441824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9132624,0.0007364962,0.03084592,0.0004533616,0.0001486526,0.00003241402,0.0002176167,0.0001488174,0.05415432],"genre_scores_gemma":[0.9928364,0.000181218,0.004082007,0.00004451325,0.00008059002,0.0000210675,0.0001601876,0.00001943882,0.002574529],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002894444,"threshold_uncertainty_score":0.009921908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1504640313","doi":"10.2178/jsl/1174668397","title":"Bounding homogenous models","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Barbara F. Csima","is_ca":true},{"name":"Valentina Harizanov","is_ca":false},{"name":"Denis R. Hirschfeldt","is_ca":false},{"name":"Robert I. Soare","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.031414162483599,"gpt":0.2687297140358942,"spread":0.2373155515522952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001656235,0.0005880749,0.0007691354,0.001247645,0.001260059,0.002547484,0.001322223,0.0005851216,0.006355233],"category_scores_gemma":[0.005780282,0.0007696966,0.001332898,0.0008449398,0.003750158,0.007364257,0.00695501,0.002201932,0.0007200873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00184122,"about_ca_system_score_gemma":0.001025801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003100145,"about_ca_topic_score_gemma":0.002487893,"domain_scores_codex":[0.9974505,0.0004573701,0.0001660241,0.0007022064,0.0006470706,0.0005767899],"domain_scores_gemma":[0.9937402,0.00288892,0.0004486715,0.001634989,0.0006710807,0.0006162195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001420957,0.00006013196,0.00260471,0.0001353452,0.0000419545,0.0002662484,0.0009980807,0.01319831,0.008859703,0.9590696,0.001164276,0.01345944],"study_design_scores_gemma":[0.00005220124,0.0000855402,0.001512933,0.00006278251,0.000109376,0.00031125,0.0004653118,0.04501451,0.02092645,0.9089303,0.02248169,0.00004760035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3918703,0.0006543382,0.5437192,0.001038014,0.00008306601,0.0002059234,0.0006806332,0.00172337,0.06002527],"genre_scores_gemma":[0.9632494,0.0002184365,0.02845101,0.0001413648,0.00006954758,0.00007185728,0.0003466507,0.0001299374,0.007321667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006355233,"threshold_uncertainty_score":0.02126032,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Triviality; Corollary; Turing; Connection (principal bundle); Computer science; Mathematics; Pure mathematics; Programming language","authors":[{"name":"Johanna N. Y. Franklin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01084332765022075,"gpt":0.2438671298932027,"spread":0.2330238022429819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00171537,0.0003652763,0.0007680678,0.001514912,0.002199878,0.002327671,0.001005227,0.0008183394,0.007250679],"category_scores_gemma":[0.007546066,0.0004049165,0.0009983925,0.001015365,0.008676457,0.005780364,0.004409048,0.002357614,0.0003547462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001677033,"about_ca_system_score_gemma":0.0006863683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001305834,"about_ca_topic_score_gemma":0.00106936,"domain_scores_codex":[0.9976935,0.0004240142,0.0001377385,0.0005018328,0.0004955164,0.0007474612],"domain_scores_gemma":[0.9908363,0.004023425,0.001173322,0.001419566,0.001534469,0.001012877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001989642,0.00005498994,0.003556775,0.0001029385,0.00003404304,0.0002842847,0.0006123526,0.005055358,0.004854727,0.9783685,0.0005471898,0.006329895],"study_design_scores_gemma":[0.0000303891,0.0001081656,0.002182006,0.00002927432,0.00003155115,0.0002515699,0.0004037154,0.01107348,0.005646352,0.978335,0.001856835,0.0000518208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8452503,0.0003892081,0.1125967,0.001368347,0.0000634368,0.0000849057,0.0002382866,0.0004567234,0.03955208],"genre_scores_gemma":[0.9960743,0.00005162028,0.002751258,0.00008591077,0.00002923689,0.00001136475,0.00006433101,0.00001654565,0.0009154697],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007250679,"threshold_uncertainty_score":0.02425587,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Order (exchange); Type (biology); Mathematics; Mathematical analysis; Geology; Economics","authors":[{"name":"Hossein Lamei Ramandi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02769602480149027,"gpt":0.3215030904183239,"spread":0.2938070656168337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003014139,0.0002326518,0.0004149546,0.0007259612,0.000977941,0.001790383,0.0004505883,0.0003843659,0.005986563],"category_scores_gemma":[0.0006435902,0.0002525652,0.0004200659,0.0005132351,0.001447088,0.001682867,0.001231394,0.001054301,0.0008458791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007735459,"about_ca_system_score_gemma":0.0007801972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008994126,"about_ca_topic_score_gemma":0.001705015,"domain_scores_codex":[0.9996718,0.0000365279,0.00003196788,0.00008052253,0.00009486561,0.00008435977],"domain_scores_gemma":[0.9992977,0.0001003971,0.00006471256,0.0001088759,0.000198551,0.0002297505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001783591,0.00008896831,0.001933456,0.0001317063,0.00001657924,0.0006396339,0.0005718616,0.001454278,0.02557993,0.9547986,0.001782582,0.01282397],"study_design_scores_gemma":[0.000095157,0.0004169354,0.002333476,0.00006553662,0.00004197465,0.001374532,0.001065816,0.01519764,0.03219059,0.9085317,0.03862875,0.00005786842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6114054,0.0005341717,0.2255484,0.001184694,0.0002152797,0.0001028458,0.0007308758,0.0008715919,0.1594067],"genre_scores_gemma":[0.9464686,0.0001139566,0.03226839,0.0002238946,0.00006432373,0.00002758476,0.00052474,0.0001025896,0.02020585],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005986563,"threshold_uncertainty_score":0.0200271,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Omar León Sánchez","is_ca":true},{"name":"Rahim Moosa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02916451065974832,"gpt":0.2676404700721348,"spread":0.2384759594123865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001377383,0.0004108632,0.0009236271,0.001675765,0.001663965,0.002996727,0.0005791101,0.001270173,0.005691493],"category_scores_gemma":[0.002725907,0.0003541845,0.001085484,0.0007984373,0.00334979,0.007303244,0.003406541,0.002202452,0.0006066328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001650296,"about_ca_system_score_gemma":0.0008686069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000693468,"about_ca_topic_score_gemma":0.0003523936,"domain_scores_codex":[0.9989195,0.0001993168,0.00005114681,0.0002607608,0.0004022813,0.0001670175],"domain_scores_gemma":[0.9984097,0.0004942045,0.0001722835,0.0002871469,0.0003287958,0.0003077374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001782897,0.00001719432,0.000253033,0.00001466436,0.000004151034,0.00009845588,0.0002664342,0.0002928089,0.0006231009,0.9966379,0.0004125008,0.001361778],"study_design_scores_gemma":[0.00001631457,0.00004721055,0.0002939602,0.00001332243,0.000008059698,0.0002380719,0.0001233928,0.005404199,0.0007995534,0.9889904,0.004054096,0.00001150371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6644799,0.0009453485,0.2377574,0.002562741,0.0005513522,0.0001056738,0.0004209642,0.0005205129,0.09265615],"genre_scores_gemma":[0.9830335,0.0001881846,0.008061707,0.0002668451,0.0002241323,0.00003115218,0.0001635679,0.00004922688,0.007981759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005691493,"threshold_uncertainty_score":0.01903999,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"L. P. Belluce","is_ca":true},{"name":"Antonio Di Nola","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0161204057250458,"gpt":0.2802801720625293,"spread":0.2641597663374835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002285922,0.0006366664,0.0008158875,0.002229884,0.001954279,0.004406506,0.001220105,0.0015643,0.005410635],"category_scores_gemma":[0.002344307,0.0003802213,0.0009487121,0.002310203,0.005918796,0.007490575,0.002098537,0.003189592,0.0008643484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003155118,"about_ca_system_score_gemma":0.001067589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002627075,"about_ca_topic_score_gemma":0.001933148,"domain_scores_codex":[0.9985994,0.0005732521,0.00008617449,0.0001992286,0.000398082,0.0001439482],"domain_scores_gemma":[0.9988506,0.0005834747,0.000117639,0.00013531,0.0001730554,0.0001399782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002116775,0.000003191,0.00002971703,0.00001278077,0.000002277258,0.00001825607,0.0001059141,0.0003091225,0.00008669748,0.9976966,0.0003173819,0.001415933],"study_design_scores_gemma":[0.000001688586,0.000003438618,0.00003165292,0.000008466928,0.00000118274,0.00001288504,0.00003092346,0.001067087,0.00003993493,0.9947131,0.004086731,0.000002802298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07949707,0.05027077,0.5647469,0.01642608,0.001314248,0.0001847267,0.0007513333,0.000716236,0.2860926],"genre_scores_gemma":[0.7738019,0.01446386,0.1747277,0.002415697,0.00296299,0.0002968263,0.0006470917,0.0001500712,0.03053383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005410635,"threshold_uncertainty_score":0.02289206,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Luc Bélair","is_ca":true},{"name":"Françoise Point","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01586160689278572,"gpt":0.2604011465616606,"spread":0.2445395396688749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001900925,0.0003372657,0.0005399545,0.0009081971,0.0009750554,0.001649233,0.0007026789,0.0004977678,0.002028139],"category_scores_gemma":[0.002129388,0.0003618775,0.0009993388,0.0004297018,0.002507163,0.003966103,0.00167436,0.001428365,0.0003589234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007843419,"about_ca_system_score_gemma":0.0006852389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004640115,"about_ca_topic_score_gemma":0.0003950002,"domain_scores_codex":[0.9988014,0.0002293426,0.00007622633,0.0001868211,0.0004588963,0.0002474184],"domain_scores_gemma":[0.9983754,0.0008298561,0.0001595378,0.0001385644,0.0003558722,0.0001408487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007530779,0.00006841164,0.0008714522,0.00007333227,0.00002770049,0.00059299,0.001019491,0.002089944,0.01356756,0.9733628,0.0003379778,0.007913047],"study_design_scores_gemma":[0.00005871657,0.0001171687,0.0007332216,0.00002564922,0.0000407215,0.0006168183,0.0003052407,0.02151769,0.02692649,0.9441174,0.005496986,0.00004389669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7774672,0.0002734991,0.2029119,0.0005913058,0.00007035441,0.00005057236,0.00006399283,0.000338821,0.01823242],"genre_scores_gemma":[0.9807171,0.00008947942,0.01325191,0.0001173055,0.00004692464,0.00001947039,0.00004762824,0.00004299203,0.005667257],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002028139,"threshold_uncertainty_score":0.01005316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}