{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004766912,0.00006906239,0.0002269251,0.00006619233,0.00004288376,0.000007417075,0.00007172755,0.00006613537,0.0004183773],"category_scores_gemma":[0.0003789893,0.00004955224,0.00003358454,0.00006983633,0.0001276458,0.0001264378,0.00001054523,0.0001784117,0.000003081749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002610294,"about_ca_system_score_gemma":0.00003563669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005844176,"about_ca_topic_score_gemma":0.00003038141,"domain_scores_codex":[0.9993191,0.0001226876,0.0002998291,0.00006054612,0.00008091867,0.0001169677],"domain_scores_gemma":[0.9991417,0.0005961855,0.0001190706,0.00006879104,0.00003374899,0.00004052182],"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.0001428005,0.0001060983,0.005062437,0.00001936976,0.00001905381,0.00008364611,0.001006967,0.00004991837,0.0001149557,0.9730906,0.0003118978,0.01999229],"study_design_scores_gemma":[0.000479309,0.0001131043,0.006521319,0.00001968978,0.00001374983,0.0002604658,0.0003155598,0.00002159576,0.0001229177,0.9910993,0.0009772778,0.00005570967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9928988,0.000387106,0.0008294925,0.0006206228,0.00004431005,0.00004739761,0.000001701672,0.000007485055,0.005163127],"genre_scores_gemma":[0.9974964,0.0002127235,0.001666108,0.0002433301,0.00007990425,0.000001113627,3.996782e-7,0.000005421079,0.0002946406],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01993658,"threshold_uncertainty_score":0.4580939,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265295,0.0001176747,0.0003785963,0.0001228577,0.00007516644,0.00002182429,0.00169911,0.0000639901,0.0000102943],"category_scores_gemma":[0.0002129622,0.00006933483,0.0003093198,0.0007311548,0.0007005649,0.0002485157,0.0002298081,0.0002843374,9.838288e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002464086,"about_ca_system_score_gemma":0.00022393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003526374,"about_ca_topic_score_gemma":0.000009283523,"domain_scores_codex":[0.9980303,0.0001274348,0.0008904738,0.0001406935,0.0005821366,0.0002289657],"domain_scores_gemma":[0.9976628,0.0003542131,0.001020099,0.000492253,0.0003913346,0.00007927986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001492047,0.001536658,0.0637657,0.0003378191,0.0002427583,0.00008995833,0.004382393,0.0002134574,0.19006,0.6483621,0.001775268,0.08908466],"study_design_scores_gemma":[0.001006448,0.0007950436,0.04791941,0.0002222854,0.00005128641,0.0008736583,0.000297579,0.000225465,0.4777196,0.4670812,0.003522963,0.0002850569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8483843,0.002847986,0.1315804,0.00505474,0.002324266,0.0003447335,0.000009663257,0.00003433465,0.009419691],"genre_scores_gemma":[0.9792139,0.00003357126,0.02016135,0.0004775358,0.0000887865,4.581732e-7,4.79037e-8,0.000003109114,0.00002125616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2876596,"threshold_uncertainty_score":0.3157397,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007907827,0.0002432172,0.0004800592,0.000140193,0.0002310064,0.0001626838,0.001294602,0.0001262092,0.0001855199],"category_scores_gemma":[0.0006973513,0.0001756733,0.0002580309,0.0004631262,0.0001733168,0.0007491341,0.00009068415,0.0002770544,0.00002938791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007165383,"about_ca_system_score_gemma":0.0002203978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003966687,"about_ca_topic_score_gemma":0.000002625745,"domain_scores_codex":[0.9980091,0.0001367639,0.000663056,0.0003030812,0.0004138938,0.0004740431],"domain_scores_gemma":[0.9971274,0.001381885,0.0004651418,0.0003863486,0.0004540693,0.0001851611],"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.0003159993,0.0002789243,0.0004341415,0.00004867939,0.0001652506,0.0002488523,0.002484798,0.01079664,0.0005467692,0.9245266,0.004296575,0.05585681],"study_design_scores_gemma":[0.001242815,0.001151775,0.002174788,0.00008695051,0.00005032439,0.0002749703,0.0002071778,0.004549904,0.002325149,0.9735354,0.01399416,0.0004065457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02385336,0.001415844,0.9596629,0.003394949,0.0005022628,0.0003285301,0.00004288645,0.0001003443,0.01069892],"genre_scores_gemma":[0.9614234,0.0004147394,0.03536341,0.001706525,0.0002862003,0.00001427319,0.000002900871,0.00001328193,0.0007752561],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.93757,"threshold_uncertainty_score":0.7163749,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001946864,0.0001733199,0.0003476806,0.00007840814,0.0002380037,0.0001522941,0.003263245,0.00007580712,0.00001215837],"category_scores_gemma":[0.0004577529,0.00007719507,0.0003542775,0.0006070921,0.000222971,0.0002337082,0.0003152204,0.0004575199,0.000004935402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007466425,"about_ca_system_score_gemma":0.0002040797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004442471,"about_ca_topic_score_gemma":0.000001803541,"domain_scores_codex":[0.9976839,0.0003680973,0.0007185622,0.0001892403,0.0007044823,0.0003357415],"domain_scores_gemma":[0.9972739,0.0006267174,0.0007720922,0.0008698993,0.000353099,0.0001043538],"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.00003403108,0.0006082954,0.002129616,0.00001385696,0.0001038882,0.00004288527,0.00264638,0.001157239,0.001546302,0.5166019,0.002793274,0.4723223],"study_design_scores_gemma":[0.000868775,0.0008670487,0.1335239,0.00006437074,0.00003276966,0.0005991025,0.0002141373,0.010249,0.002355637,0.8459928,0.004989795,0.0002426462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7492847,0.00546654,0.1338461,0.08383866,0.00680637,0.001028942,0.000005641969,0.0001789768,0.01954404],"genre_scores_gemma":[0.9921049,0.00009428392,0.006612201,0.0007681902,0.0003129386,7.35507e-7,5.435118e-8,0.000004758726,0.0001019766],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4720796,"threshold_uncertainty_score":0.6063975,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00243992,0.0002246582,0.0005259896,0.0002208214,0.0001587605,0.0002757453,0.001307574,0.0001756022,0.00006067872],"category_scores_gemma":[0.0009626533,0.0001690458,0.0001590441,0.0005266386,0.000215463,0.000773702,0.0004859392,0.0008988851,0.00001607992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006145287,"about_ca_system_score_gemma":0.0002824654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002319868,"about_ca_topic_score_gemma":0.000009516354,"domain_scores_codex":[0.9976787,0.0001543571,0.000738172,0.0004859606,0.0005185263,0.0004242999],"domain_scores_gemma":[0.9975879,0.0003916855,0.0004647832,0.000842143,0.0003859884,0.0003275537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001954507,0.002836567,0.0493391,0.0002061485,0.0002509453,0.0006660771,0.004286269,0.000469464,0.04494181,0.1703675,0.004404747,0.7220359],"study_design_scores_gemma":[0.003640942,0.001650214,0.2498537,0.00005994941,0.00007729657,0.006601914,0.0001478719,0.03646525,0.004080253,0.6897732,0.006672678,0.0009767051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.960694,0.0003201207,0.03165163,0.002259769,0.003375622,0.0001695767,0.000002637331,0.00008506791,0.001441536],"genre_scores_gemma":[0.9302163,0.00002818001,0.06896233,0.0001915403,0.0005490412,0.000002041783,2.718424e-7,0.000008604082,0.00004170964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7210592,"threshold_uncertainty_score":0.6893487,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004690677,0.0000999176,0.0003345071,0.0001406792,0.0000796442,0.00002258908,0.0009091055,0.00004648325,0.00004228538],"category_scores_gemma":[0.00003379359,0.00007061166,0.0001382131,0.0003776617,0.0001744096,0.0003375433,0.0001300749,0.0001448781,0.00001491281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003566014,"about_ca_system_score_gemma":0.0001208508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000154919,"about_ca_topic_score_gemma":9.076315e-7,"domain_scores_codex":[0.9987769,0.00007231987,0.0004944059,0.0001160826,0.000343445,0.000196864],"domain_scores_gemma":[0.9988649,0.00006349067,0.0005159689,0.0002905584,0.0001713193,0.00009376594],"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.00004591457,0.001443422,0.01034468,0.0001762381,0.0002531185,0.0006075805,0.005187537,0.004631308,0.06688675,0.8797612,0.01338296,0.01727933],"study_design_scores_gemma":[0.002074842,0.001347087,0.1033866,0.0001885537,0.00003606819,0.007488539,0.0001681186,0.018758,0.01645107,0.8441821,0.005385057,0.0005339506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8038255,0.001605631,0.1882024,0.0009461512,0.0005161809,0.000105872,0.000001628293,0.00004757226,0.004749129],"genre_scores_gemma":[0.9701329,0.0001793281,0.02915064,0.0003094271,0.0001136435,8.239768e-7,2.111807e-7,0.00000512532,0.0001079352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1663074,"threshold_uncertainty_score":0.287946,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001135738,0.00009839279,0.0002261567,0.00008499926,0.00008965114,0.00009161533,0.000628999,0.00005602368,0.000008872765],"category_scores_gemma":[0.0001123781,0.00005365174,0.0001193305,0.0002360749,0.0002219079,0.0001823618,0.00005889361,0.0001378034,0.000009229998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003642913,"about_ca_system_score_gemma":0.00009498809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000158409,"about_ca_topic_score_gemma":0.000002892481,"domain_scores_codex":[0.99867,0.0003045365,0.0004906635,0.0001043576,0.0002648798,0.0001655614],"domain_scores_gemma":[0.9984331,0.0002624277,0.0006619664,0.0002272188,0.0003757848,0.00003957771],"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.00003360945,0.00002239198,0.0005036817,0.000009267834,0.00003434821,0.00001072401,0.0007686067,0.0001265621,0.0006553352,0.9894798,0.0002590595,0.00809664],"study_design_scores_gemma":[0.0003590797,0.0002851802,0.001506373,0.00001092726,0.00002390915,0.000304695,0.0003221158,0.001943211,0.001438323,0.992839,0.0008778595,0.00008932051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1654379,0.003575231,0.8055741,0.0006290281,0.002839705,0.000300178,0.000001256426,0.00004907139,0.02159357],"genre_scores_gemma":[0.99809,0.00004092772,0.001450186,0.00007711457,0.0001957987,0.000001455934,5.142243e-7,0.000004799028,0.0001392413],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8326521,"threshold_uncertainty_score":0.2187854,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001534853,0.0001109948,0.0003099927,0.0001464126,0.00005687111,0.0000259827,0.0002756191,0.00009543656,0.0006294666],"category_scores_gemma":[0.0002760907,0.0000729413,0.0000911888,0.0002236594,0.000193912,0.0001255755,0.0000345458,0.0002062963,0.00001903391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000275716,"about_ca_system_score_gemma":0.00003287058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002204159,"about_ca_topic_score_gemma":6.880115e-7,"domain_scores_codex":[0.9989161,0.00009814083,0.0004069677,0.0001439225,0.0001657369,0.0002691672],"domain_scores_gemma":[0.9988438,0.0005327062,0.0002356248,0.0001508123,0.00006371948,0.0001733648],"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.0001505116,0.0001984411,0.0006041579,0.00001182419,0.00004327743,0.00004025798,0.00358979,0.000001018707,0.0003651111,0.9927808,0.0001766545,0.002038145],"study_design_scores_gemma":[0.0007523173,0.0003433466,0.004330727,0.00004310848,0.00003859188,0.0004544756,0.001538397,0.00006879656,0.0001133463,0.9910643,0.001162002,0.00009059317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8134048,0.00184505,0.0156068,0.00446118,0.0003823629,0.0003129095,0.00001435221,0.00001650242,0.163956],"genre_scores_gemma":[0.996559,0.0001112747,0.002019021,0.0007267004,0.0001746197,0.0000135494,4.552817e-7,0.000008458916,0.0003869598],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1831542,"threshold_uncertainty_score":0.6892218,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322332,0.0001258373,0.000320367,0.000164806,0.00004501511,0.0001491671,0.0006577285,0.00006244726,0.0002456215],"category_scores_gemma":[0.00004056987,0.00008535112,0.00008732568,0.0001600057,0.00004053603,0.0004649393,0.0001491073,0.0001631692,0.0001113056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002458874,"about_ca_system_score_gemma":0.000062912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002899593,"about_ca_topic_score_gemma":8.570981e-8,"domain_scores_codex":[0.998984,0.00007306915,0.0003480741,0.0001473964,0.0002443342,0.0002031346],"domain_scores_gemma":[0.999105,0.0001381047,0.0003187383,0.0002771739,0.0000499878,0.0001110246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004713424,0.0002580416,0.006958988,0.0002577917,0.0004167367,0.0003753783,0.005538758,0.0002032661,0.1387391,0.4102934,0.01853239,0.418379],"study_design_scores_gemma":[0.003862248,0.001567917,0.2249833,0.0003152562,0.00009078017,0.007623388,0.0003298089,0.09335494,0.006310908,0.6566534,0.003882865,0.001025161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9951073,0.0008144613,0.001524256,0.0008589178,0.0004446076,0.00007395591,5.971532e-7,0.00005101151,0.001124893],"genre_scores_gemma":[0.9902434,0.00002913875,0.008619498,0.000777102,0.0001455447,3.976171e-7,1.692553e-7,0.000007217261,0.0001775749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4173538,"threshold_uncertainty_score":0.3480518,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004406529,0.0001117157,0.000263225,0.00009441964,0.0001833678,0.00002785792,0.0009992038,0.00006589404,0.0000254102],"category_scores_gemma":[0.0001320596,0.00006206572,0.0001605941,0.0003229161,0.0001352923,0.0002517078,0.0001843441,0.0002311522,0.00001535906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004864567,"about_ca_system_score_gemma":0.0002100235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006841876,"about_ca_topic_score_gemma":8.766149e-7,"domain_scores_codex":[0.9985777,0.0001230471,0.0004549836,0.0001375155,0.0005061964,0.0002005282],"domain_scores_gemma":[0.9987316,0.00008990447,0.0005416094,0.0002726683,0.0002808641,0.00008340401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001571306,0.002865265,0.1822942,0.0001933115,0.0006671908,0.001134341,0.03142737,0.001453889,0.07340049,0.6716806,0.015519,0.01920723],"study_design_scores_gemma":[0.00341772,0.001513374,0.9074079,0.0004360689,0.0000892959,0.008294296,0.0003806622,0.006623406,0.03299442,0.03535335,0.002851436,0.0006380018],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9477398,0.0006328444,0.03989581,0.0004621036,0.001103119,0.0001067789,0.00000104543,0.00001866696,0.01003979],"genre_scores_gemma":[0.9955965,0.00004626133,0.003600984,0.0002080564,0.0001928465,0.000001282928,1.861315e-7,0.000004638925,0.0003492613],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7251138,"threshold_uncertainty_score":0.2530967,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001477565,0.0001854377,0.0004902656,0.0001313798,0.0001948067,0.00008013387,0.0006417463,0.0001091759,0.0001341828],"category_scores_gemma":[0.0009181689,0.00008899392,0.0002270406,0.0001178843,0.0002659414,0.0003615276,0.0001087162,0.0005747216,0.00002518045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007984154,"about_ca_system_score_gemma":0.0001326125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005720457,"about_ca_topic_score_gemma":0.000009159881,"domain_scores_codex":[0.9976243,0.0002851969,0.0008570702,0.0001340218,0.0007318447,0.000367568],"domain_scores_gemma":[0.997193,0.001070265,0.0006143529,0.0003448924,0.0006342288,0.0001432423],"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.0003396245,0.0005206803,0.0006513252,0.0001383166,0.0002447332,0.00002504007,0.004133402,0.001078962,0.05239304,0.9254983,0.001914488,0.01306208],"study_design_scores_gemma":[0.0006213369,0.000202637,0.001215875,0.00005981608,0.00003973717,0.00006378441,0.001566479,0.005570946,0.009913307,0.9805623,0.00005375698,0.0001300013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9857713,0.0002217027,0.01076846,0.001286522,0.0001913753,0.0003630816,0.000005566542,0.00001696204,0.00137505],"genre_scores_gemma":[0.9942988,0.0001404993,0.004312595,0.0001469934,0.0002432274,0.00001174219,3.200701e-7,0.00003019786,0.0008156635],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05506402,"threshold_uncertainty_score":0.3629067,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003161859,0.0001130823,0.0003393915,0.00008842454,0.00005212189,0.000005952757,0.0001868349,0.0001326053,0.001015781],"category_scores_gemma":[0.0002805111,0.00007537498,0.0001311678,0.00007833218,0.0001253732,0.0002136081,0.00004485537,0.0002881655,0.000004973039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001661649,"about_ca_system_score_gemma":0.00003633018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003423635,"about_ca_topic_score_gemma":0.000008984741,"domain_scores_codex":[0.9990188,0.00007323671,0.0005025145,0.00007141295,0.000162935,0.0001711332],"domain_scores_gemma":[0.9991624,0.0001674539,0.0003560892,0.0001614717,0.0001067751,0.00004575985],"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.004698151,0.002255005,0.02631387,0.0007731298,0.001607446,0.001387219,0.02552504,0.0008806934,0.01669456,0.8883486,0.02482965,0.006686615],"study_design_scores_gemma":[0.0007954017,0.0008112708,0.001065227,0.000148047,0.0000766412,0.0005464984,0.001792603,0.00001154884,0.007698502,0.9831471,0.003738264,0.0001688361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9887221,0.0007604141,0.003569774,0.001263196,0.0003203381,0.00007460073,0.000001894148,0.00001243646,0.005275185],"genre_scores_gemma":[0.9952879,0.0003484496,0.002051432,0.0007269318,0.0001393234,0.000001488641,3.096148e-7,0.000009076768,0.001435078],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09479854,"threshold_uncertainty_score":0.9998974,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003300114,0.0001130354,0.0004819533,0.0001969478,0.0001087581,0.000003134506,0.0001110413,0.00007540313,0.0001046472],"category_scores_gemma":[0.0005057078,0.00007958146,0.0001387225,0.0001662646,0.0004080315,0.0001111856,0.00003378669,0.0002275061,0.000006306737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002580085,"about_ca_system_score_gemma":0.00005804151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003157206,"about_ca_topic_score_gemma":0.000004069262,"domain_scores_codex":[0.9989938,0.00007246059,0.0005379912,0.00008751223,0.0001610837,0.0001471586],"domain_scores_gemma":[0.9987004,0.0004578415,0.0004523394,0.0001585937,0.0001499396,0.00008089221],"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.0009823011,0.002243951,0.06791773,0.0007544846,0.002586369,0.001379316,0.01559401,0.0008954629,0.008192054,0.8802852,0.01228188,0.006887214],"study_design_scores_gemma":[0.001188873,0.0006048281,0.01879224,0.00009783068,0.0004268962,0.004106388,0.003897551,0.0002012974,0.0005769164,0.9692715,0.0006254819,0.0002101841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9871318,0.0008047011,0.007365655,0.0003389785,0.0001464971,0.00006145771,0.000004735933,0.00001134698,0.004134819],"genre_scores_gemma":[0.9962366,0.0006000295,0.002071948,0.00009218405,0.00008766272,7.670088e-7,4.904986e-7,0.000009072579,0.0009012063],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08898629,"threshold_uncertainty_score":0.3245237,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004715014,0.0001450196,0.0003334854,0.0002136463,0.00007678684,0.000220693,0.001031357,0.0000867633,0.0001592214],"category_scores_gemma":[0.00008513352,0.00009931935,0.0001909155,0.0004634596,0.00002816978,0.0004172992,0.00009633088,0.0002596491,0.0003099302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005239212,"about_ca_system_score_gemma":0.00007079533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002704609,"about_ca_topic_score_gemma":0.000002229067,"domain_scores_codex":[0.9984853,0.00008687747,0.0004905418,0.0001750232,0.0004444765,0.0003177406],"domain_scores_gemma":[0.9987801,0.00006038681,0.0004097581,0.0003367418,0.0001477995,0.0002651558],"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.000006704381,0.0002757065,0.002195498,0.00003736718,0.0001083666,0.0005918362,0.002557165,0.00005512257,0.0003873528,0.7125992,0.03649467,0.244691],"study_design_scores_gemma":[0.003606588,0.002404392,0.007785151,0.000060258,0.0001034296,0.01052031,0.0002360584,0.007423704,0.0007336706,0.6811344,0.2850529,0.00093908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002738099,0.006114887,0.9485532,0.003512241,0.002146081,0.0001656468,1.293017e-7,0.0001109639,0.03665874],"genre_scores_gemma":[0.9758767,0.0001451302,0.01995119,0.0004849042,0.0007369984,0.000001178373,7.355288e-8,0.000008115327,0.002795737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9731386,"threshold_uncertainty_score":0.4050125,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249276,0.00008641207,0.0001947091,0.00005951111,0.00006186524,0.00007306306,0.0008651742,0.00004225054,0.0001383371],"category_scores_gemma":[0.0001412434,0.00004322158,0.0001293701,0.0001693913,0.00006954296,0.0001733548,0.00008940535,0.0001403811,0.00009904015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005563663,"about_ca_system_score_gemma":0.00008247024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000302042,"about_ca_topic_score_gemma":8.802956e-7,"domain_scores_codex":[0.9987382,0.0001192109,0.0004633118,0.000117925,0.0004043112,0.0001570736],"domain_scores_gemma":[0.9984766,0.0003024237,0.0004672888,0.0003767356,0.0003004098,0.00007656587],"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.000004364262,0.0002046321,0.004298278,0.00001041433,0.00003392207,0.000002164631,0.0004152613,0.0000214099,0.0008912507,0.9807694,0.003684914,0.009663995],"study_design_scores_gemma":[0.0003230468,0.0005774607,0.1049938,0.000009711879,0.00001062001,0.0001332789,0.0001335147,0.0005721882,0.001800734,0.8884398,0.002896483,0.0001093967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.791383,0.000391238,0.1802254,0.01344126,0.001006407,0.0008088296,8.902617e-7,0.00003668369,0.01270627],"genre_scores_gemma":[0.9980641,0.000009192578,0.001223982,0.0005136838,0.0001055696,0.00001307867,1.748268e-7,0.000002754614,0.00006744871],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2066811,"threshold_uncertainty_score":0.1762525,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002590985,0.0000779043,0.0001952447,0.00008521992,0.000147427,0.00005523607,0.0007931574,0.00004889584,0.000004648719],"category_scores_gemma":[0.0001010573,0.00004288161,0.0001118489,0.0002636254,0.0001746203,0.000153316,0.0001027414,0.0001541619,0.00001027484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005043751,"about_ca_system_score_gemma":0.00005384974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003818598,"about_ca_topic_score_gemma":0.00002355674,"domain_scores_codex":[0.9985644,0.0000844813,0.0005987718,0.00009061177,0.0004229909,0.0002386932],"domain_scores_gemma":[0.9985884,0.00009549117,0.0006981337,0.0002716389,0.0002721663,0.00007417017],"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.00002294774,0.00008404256,0.001592945,0.00001269723,0.00003472192,0.00002375454,0.0004228584,0.00001088637,0.0007321701,0.9755654,0.001023356,0.02047419],"study_design_scores_gemma":[0.001437074,0.00129688,0.1102676,0.00003159544,0.00003310892,0.0006764242,0.0004862061,0.0009986773,0.002938932,0.790879,0.09068833,0.0002662452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03891532,0.002475575,0.9275208,0.002351594,0.002360405,0.0002165886,3.804696e-7,0.00004257514,0.02611677],"genre_scores_gemma":[0.9952252,0.00005333804,0.00426339,0.00009507436,0.000205795,4.556118e-7,1.652771e-7,0.000002788786,0.0001537895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9563099,"threshold_uncertainty_score":0.1748661,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007753334,0.0001420297,0.0004962449,0.0002225645,0.00003871231,0.00001212798,0.0004622861,0.000103627,0.0004798229],"category_scores_gemma":[0.002166887,0.0000754214,0.0001854182,0.0002386975,0.0001363062,0.0002650175,0.00006790314,0.0002390444,0.00005533475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008552807,"about_ca_system_score_gemma":0.0001466412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.967906e-7,"about_ca_topic_score_gemma":0.000001444786,"domain_scores_codex":[0.9980838,0.0001136034,0.00074425,0.0001190221,0.0006379072,0.0003014682],"domain_scores_gemma":[0.9976348,0.0007955512,0.0005411169,0.0003057857,0.0005549807,0.0001677776],"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.0003061985,0.0008249454,0.008365321,0.0002652915,0.0003676057,0.0002764189,0.001016455,0.000009701282,0.342056,0.5978248,0.008854089,0.03983314],"study_design_scores_gemma":[0.001702477,0.0007363082,0.00346906,0.0003556501,0.00004806977,0.0003160672,0.0002004519,0.000004505452,0.08511528,0.9064858,0.001370656,0.0001956562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9860998,0.0004525609,0.008615356,0.001406177,0.0002036773,0.000133897,0.000005190001,0.00001854015,0.003064826],"genre_scores_gemma":[0.986326,0.0002319508,0.01241285,0.00008817577,0.0002652242,0.000002085639,7.183997e-8,0.00002690871,0.0006467261],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.308661,"threshold_uncertainty_score":0.5253724,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008907774,0.0001024853,0.0003439723,0.00007479864,0.0000496266,0.000007060818,0.000190305,0.00009964828,0.001579736],"category_scores_gemma":[0.0005905113,0.00007237065,0.0001033115,0.000126986,0.0001713627,0.0001403857,0.00001593744,0.0003180879,0.00003028394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005306408,"about_ca_system_score_gemma":0.00004862763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002997518,"about_ca_topic_score_gemma":0.00001076588,"domain_scores_codex":[0.9989347,0.0001778251,0.0004756882,0.00008762034,0.0001189372,0.0002051794],"domain_scores_gemma":[0.9990015,0.0005380561,0.0001734525,0.0001760055,0.00005864364,0.00005232666],"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.0002573123,0.0003492176,0.005286887,0.00005146558,0.00002476964,0.0001304842,0.001482092,0.0001993676,0.00006555866,0.9825602,0.0002518256,0.009340887],"study_design_scores_gemma":[0.0004405751,0.0001056823,0.005301672,0.00002483114,0.00001167301,0.0001833389,0.0003084509,0.000008748288,0.0001844368,0.9927445,0.0006099513,0.00007610618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9865123,0.0002408176,0.0009187492,0.0004512001,0.00008275868,0.00006651883,0.000001628156,0.00001364501,0.01171238],"genre_scores_gemma":[0.9971169,0.00009611266,0.002021715,0.0002724953,0.0001055854,0.000001665437,2.938079e-7,0.000008161944,0.0003771092],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01133527,"threshold_uncertainty_score":0.999333,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001740408,0.000430867,0.001135594,0.0005230406,0.0002020158,0.0003051256,0.001263572,0.0002042197,0.00001079012],"category_scores_gemma":[0.00009871602,0.0003620283,0.0003064751,0.001044113,0.0002880168,0.00111888,0.0005319702,0.000485009,0.00001489301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001461071,"about_ca_system_score_gemma":0.0002272618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008640101,"about_ca_topic_score_gemma":0.000008462694,"domain_scores_codex":[0.9958919,0.000334638,0.001594678,0.0005605393,0.0009752066,0.0006429893],"domain_scores_gemma":[0.996783,0.0005012436,0.001156134,0.0006276211,0.0006917486,0.000240249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001944997,0.003462888,0.0190531,0.0007374851,0.0003606797,0.0002793869,0.002906214,0.7271589,0.05466051,0.06153573,0.008305005,0.1213456],"study_design_scores_gemma":[0.003782244,0.00117177,0.02537283,0.0002603567,0.0001106559,0.001868999,0.0001423527,0.8052018,0.02428224,0.1360291,0.0009663766,0.0008113137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5894572,0.001695173,0.4063828,0.0007060083,0.0003477629,0.0003050121,0.000005227221,0.00008553422,0.001015218],"genre_scores_gemma":[0.9282071,0.0001257536,0.0708968,0.0002425814,0.0004733398,0.000004306919,0.000003831167,0.0000235843,0.00002267902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3387499,"threshold_uncertainty_score":0.9998832,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165434,0.00007698058,0.0002676106,0.00003375869,0.00006184155,0.00001439308,0.000208435,0.00006207886,0.00002371529],"category_scores_gemma":[0.001238948,0.00002845159,0.00005395133,0.0000502201,0.0003284503,0.0001127979,0.00005407621,0.0002484575,0.000007312703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000154691,"about_ca_system_score_gemma":0.0000472894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000161097,"about_ca_topic_score_gemma":0.000001283293,"domain_scores_codex":[0.9992191,0.0001964746,0.0002716506,0.00005672706,0.0001414383,0.000114654],"domain_scores_gemma":[0.998898,0.0004936171,0.0002809183,0.0001225297,0.0001243508,0.00008054232],"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.0006628885,0.00009550029,0.0006369684,0.00003573824,0.0001240603,0.00006984925,0.006185317,0.0000152023,0.00009631535,0.9821751,0.006725562,0.003177552],"study_design_scores_gemma":[0.001544872,0.0001009147,0.0001099334,0.00002115194,0.00005687477,0.0007478244,0.001333805,0.00003880939,0.00005393763,0.9919543,0.003986896,0.00005067912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9310728,0.00575111,0.004950059,0.0153562,0.0007501382,0.0003215764,0.000001374475,0.00003793203,0.04175886],"genre_scores_gemma":[0.9929843,0.0001644463,0.004191693,0.0007851621,0.0002608194,0.000001728141,7.483897e-8,0.000007631797,0.001604135],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06191156,"threshold_uncertainty_score":0.1483226,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003012337,0.0001478196,0.0003542479,0.0002037966,0.00008044433,0.00007334314,0.000829504,0.00006726087,0.00004552547],"category_scores_gemma":[0.0003088598,0.0001156452,0.0001493855,0.0005560532,0.0000439028,0.0009820506,0.0001608734,0.0004041592,0.00007613737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006073806,"about_ca_system_score_gemma":0.00009901614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001578999,"about_ca_topic_score_gemma":7.834536e-7,"domain_scores_codex":[0.9984624,0.00009283492,0.0006149093,0.0002117839,0.0003101627,0.0003079309],"domain_scores_gemma":[0.9988881,0.0002321838,0.0003718075,0.0001766246,0.00008679159,0.0002444598],"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.0000442252,0.0002439715,0.004731144,0.00004283633,0.00006409608,0.001940781,0.002867077,0.02161339,0.009018424,0.950114,0.00145813,0.00786195],"study_design_scores_gemma":[0.001882837,0.0009218459,0.03159977,0.000141112,0.00002361818,0.000568712,0.0003302619,0.01504993,0.001866609,0.9446771,0.002466023,0.0004721524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4398693,0.002081147,0.5253233,0.03021423,0.0008241025,0.0002113487,0.00000408325,0.0001052929,0.001367252],"genre_scores_gemma":[0.9808801,0.0001810199,0.0112104,0.007372055,0.0003297717,0.000002566384,6.634601e-7,0.000007556362,0.00001589959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5410107,"threshold_uncertainty_score":0.4715875,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008248591,0.0000492685,0.0001714176,0.0001125254,0.00002494835,0.00004918756,0.001216392,0.0000209884,0.00002414197],"category_scores_gemma":[0.00009562501,0.00002870447,0.00005111544,0.0003238154,0.00004716663,0.0003183205,0.0001437677,0.000103539,0.0000026465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001040438,"about_ca_system_score_gemma":0.0000324561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003477915,"about_ca_topic_score_gemma":0.000004714648,"domain_scores_codex":[0.9992372,0.0001348379,0.0003263065,0.00005891371,0.0001620306,0.00008065654],"domain_scores_gemma":[0.9992163,0.0001972962,0.0003538874,0.0001375119,0.000072757,0.00002231867],"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.0000189182,0.0004758951,0.001695723,0.00002755099,0.00003390513,0.00003007968,0.01313842,0.001439666,0.002336993,0.8811863,0.001008377,0.09860814],"study_design_scores_gemma":[0.00130628,0.0008777859,0.1100375,0.000278114,0.00002602626,0.0004182192,0.001061599,0.009664818,0.001698463,0.8726615,0.0017748,0.0001949778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9355301,0.001052982,0.0490473,0.006659975,0.0002496099,0.0001456587,7.926705e-7,0.000006757882,0.007306795],"genre_scores_gemma":[0.9964226,0.00006181878,0.003221572,0.0002013158,0.00003948355,8.166662e-7,3.57002e-8,0.000001456669,0.00005092576],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1083417,"threshold_uncertainty_score":0.226038,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000729132,0.00009080712,0.0001587625,0.0001582085,0.00008700368,0.00009341681,0.0003331272,0.0000629291,0.00002910241],"category_scores_gemma":[0.0003682994,0.00006203248,0.00004068638,0.0002682148,0.00004341334,0.000676572,0.00005569694,0.0001484947,0.00001376952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003603398,"about_ca_system_score_gemma":0.00005968927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001857662,"about_ca_topic_score_gemma":0.000001346503,"domain_scores_codex":[0.9991626,0.0001151816,0.0002344292,0.0001341185,0.0002136935,0.000139966],"domain_scores_gemma":[0.9988916,0.0001250835,0.0002297448,0.0001481027,0.0004995738,0.0001058919],"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.00008487988,0.0002692983,0.01311375,0.000009372387,0.0000342106,0.0001028083,0.002805334,0.00008518771,0.004382911,0.8965594,0.0008918456,0.08166105],"study_design_scores_gemma":[0.001085786,0.001829908,0.4774192,0.00008317797,0.00003821823,0.002880858,0.0004475482,0.01622809,0.00084815,0.4953789,0.003442121,0.0003180502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.85097,0.0005880316,0.1415542,0.001364688,0.0007212464,0.00006451756,2.05068e-7,0.00003919274,0.004697915],"genre_scores_gemma":[0.9956903,0.0001988,0.003219074,0.0004533044,0.0002796721,4.284959e-7,8.229327e-7,0.000004357492,0.0001531924],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4643055,"threshold_uncertainty_score":0.2529611,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006044341,0.0001253012,0.000357713,0.0001081,0.0001200713,0.00001132409,0.0001293581,0.00008820016,0.0000909407],"category_scores_gemma":[0.0006299663,0.00008867583,0.00007987361,0.00008981072,0.0001861961,0.0001725983,0.00005418325,0.0002998873,0.000006850528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000295835,"about_ca_system_score_gemma":0.00002176981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001930911,"about_ca_topic_score_gemma":0.000003838449,"domain_scores_codex":[0.9990391,0.0000988253,0.00043829,0.00009343302,0.0001358309,0.000194517],"domain_scores_gemma":[0.9987147,0.0006759409,0.0003313789,0.0001156936,0.00008094565,0.00008138162],"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.000355478,0.0003825508,0.01149373,0.0001263141,0.0002068389,0.00127605,0.007332547,0.00002790604,0.00245234,0.9504723,0.001274178,0.02459976],"study_design_scores_gemma":[0.0006969012,0.0002125437,0.003736334,0.00006790196,0.00005346279,0.002822737,0.004444571,0.00003281311,0.0001405899,0.9870232,0.0006473236,0.0001216313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9855312,0.001161021,0.004899579,0.0007002405,0.0002141667,0.00006401749,0.00000161789,0.00001820464,0.007409981],"genre_scores_gemma":[0.9888431,0.0009372439,0.009368896,0.0003482859,0.0002494499,0.000001297827,4.958425e-7,0.00001256358,0.0002386569],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03655089,"threshold_uncertainty_score":0.3616095,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001704792,0.0002761337,0.0007298869,0.0005812282,0.00007972668,0.0002050801,0.001660558,0.0001616023,0.00002579199],"category_scores_gemma":[0.0002735459,0.000216726,0.0002967891,0.001180495,0.0001340238,0.0005071642,0.0004780328,0.0006153994,0.00002026105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003008385,"about_ca_system_score_gemma":0.0001739402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001704717,"about_ca_topic_score_gemma":0.0000509301,"domain_scores_codex":[0.9962482,0.0003676359,0.001550556,0.0004882431,0.0008100173,0.0005352821],"domain_scores_gemma":[0.9975722,0.0005688246,0.000689427,0.0007012847,0.0003034926,0.0001648019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0009429549,0.01783958,0.5483577,0.0004099534,0.0003014779,0.003280331,0.005289983,0.08452581,0.01273357,0.1370067,0.007920871,0.181391],"study_design_scores_gemma":[0.003092056,0.0004804431,0.838786,0.00004542757,0.00001343551,0.0003704407,0.00003220473,0.03727426,0.0005537444,0.1185078,0.0004729872,0.0003712128],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7963895,0.0001809452,0.1996723,0.001470674,0.001153506,0.0001706577,0.000004250677,0.00006824575,0.0008899761],"genre_scores_gemma":[0.9782724,0.00000801603,0.02097308,0.0001063298,0.0005906969,0.00000177549,0.000001854793,0.000009653356,0.00003618038],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2904283,"threshold_uncertainty_score":0.8837832,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00177707,0.0002281982,0.000727016,0.0002617595,0.00006461751,0.00004309673,0.0020993,0.0001303055,0.00009798269],"category_scores_gemma":[0.0003353888,0.0001726908,0.000357305,0.000637746,0.0002097986,0.0005196101,0.0004069485,0.0004075835,0.00002346874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009363984,"about_ca_system_score_gemma":0.0002167643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003456619,"about_ca_topic_score_gemma":0.000003139316,"domain_scores_codex":[0.9971039,0.0002901091,0.00124483,0.0003303208,0.0006598943,0.0003709588],"domain_scores_gemma":[0.9968936,0.0003440673,0.0009790977,0.0007843206,0.0007603472,0.000238571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000329153,0.01090304,0.1842491,0.0006104365,0.0007819418,0.0008873173,0.03282098,0.002702573,0.008061343,0.2999312,0.003203094,0.4555198],"study_design_scores_gemma":[0.00153004,0.002611204,0.5365838,0.0001065457,0.00006436415,0.001151606,0.0002050815,0.01449364,0.008862435,0.4330192,0.0007787586,0.0005933071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5069215,0.0006229681,0.4839781,0.0006125697,0.001477795,0.0002079578,0.000002204133,0.00008149139,0.006095343],"genre_scores_gemma":[0.8579851,0.00002667423,0.1415527,0.0002383938,0.0001740025,0.000001130729,1.428373e-7,0.000007982734,0.00001389138],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4549265,"threshold_uncertainty_score":0.7042124,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002240595,0.0001847992,0.0004213207,0.000139113,0.0001821604,0.0004223626,0.001054856,0.0000871256,0.00004803462],"category_scores_gemma":[0.0005537345,0.0001013414,0.00013932,0.0003953511,0.000244475,0.0005926597,0.0002831381,0.0003695163,0.00002585825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005463126,"about_ca_system_score_gemma":0.0001154619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008810585,"about_ca_topic_score_gemma":0.000003290704,"domain_scores_codex":[0.9979239,0.00044709,0.0006422944,0.0002381319,0.0004545595,0.000294088],"domain_scores_gemma":[0.9972997,0.001087737,0.0005044583,0.000483558,0.0004744121,0.0001501309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001742501,0.0009449354,0.02086316,0.0001445868,0.0004689119,0.0002046714,0.01095651,0.001435083,0.004571101,0.3871907,0.02209201,0.550954],"study_design_scores_gemma":[0.002862598,0.000478209,0.1418535,0.00005384063,0.00004494045,0.001738425,0.0002568002,0.07810865,0.0001967123,0.7716517,0.002448623,0.0003060103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4885632,0.002364805,0.4365621,0.06752932,0.001388371,0.0009678455,0.000001316375,0.0001139646,0.002509033],"genre_scores_gemma":[0.9685496,0.0001919328,0.02798965,0.002847605,0.0003091141,0.00001085809,3.249681e-7,0.000008762628,0.00009216558],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.550648,"threshold_uncertainty_score":0.4132582,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006118797,0.00008896584,0.0002168518,0.0001280583,0.000103374,0.00003698327,0.0001534334,0.00006075665,0.0003293513],"category_scores_gemma":[0.002147755,0.00006452294,0.0001672671,0.0001696439,0.00004601434,0.0001694453,0.00001300846,0.0001229387,0.00001689103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007991987,"about_ca_system_score_gemma":0.00003936161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.785042e-7,"about_ca_topic_score_gemma":0.000002685676,"domain_scores_codex":[0.9989871,0.00006834033,0.0005115687,0.00008214623,0.0002204575,0.0001303787],"domain_scores_gemma":[0.9978223,0.001102416,0.0003067687,0.0001674941,0.0005387623,0.00006224042],"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.00005742452,0.0004559398,0.0001259306,0.00006626925,0.00007208842,0.000005066082,0.00123692,0.0001957495,0.0009513315,0.9850179,0.01013441,0.001681001],"study_design_scores_gemma":[0.0008051632,0.0002451705,0.0001986903,0.00003812503,0.00005625388,0.0001671992,0.0001539935,0.002172237,0.0003264384,0.9909343,0.004809589,0.00009288666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.577141,0.0007187329,0.3654918,0.01865158,0.00144384,0.001316956,0.0000889966,0.0001241425,0.03502299],"genre_scores_gemma":[0.9657378,0.00002280039,0.03249694,0.0002465716,0.0003530232,0.0000178136,0.000001788836,0.00001444414,0.001108812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3885968,"threshold_uncertainty_score":0.3606166,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003111307,0.0001494917,0.0003695497,0.000143048,0.00007788069,0.0000590619,0.001575643,0.00006300345,0.0001009498],"category_scores_gemma":[0.00006398035,0.00009071252,0.0001667655,0.0004708135,0.0001323884,0.0003240239,0.000187315,0.0003488857,0.000009719313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001025491,"about_ca_system_score_gemma":0.000149304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006076849,"about_ca_topic_score_gemma":0.00002799925,"domain_scores_codex":[0.9976498,0.0004160502,0.0009228842,0.0001957839,0.0004854679,0.0003300373],"domain_scores_gemma":[0.9983143,0.0005652203,0.0003652319,0.0005015201,0.000158755,0.00009496289],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003180703,0.0009632592,0.009764587,0.00004418514,0.0001474128,0.0002904517,0.005436934,0.02242857,0.0008035447,0.1350522,0.0007973834,0.8239534],"study_design_scores_gemma":[0.001585702,0.001163741,0.05670634,0.00007162871,0.00002605783,0.0004041028,0.0003042692,0.05131726,0.0007573392,0.8858669,0.001497079,0.0002995149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9580671,0.001058138,0.03363484,0.002751345,0.0004435152,0.0002126581,0.00000382133,0.00002831964,0.003800336],"genre_scores_gemma":[0.9892203,0.0008444677,0.009271426,0.0003243649,0.0002180228,0.000002248467,4.985231e-7,0.000006740848,0.0001118893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8236539,"threshold_uncertainty_score":0.3699149,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002671351,0.0001228117,0.0004544501,0.0001655419,0.00005660535,0.000003935046,0.0002423901,0.0001518867,0.0001522648],"category_scores_gemma":[0.001162088,0.00008889948,0.0001675753,0.0001625129,0.0003404902,0.0001216642,0.00004079811,0.0003745576,0.000003758906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005740651,"about_ca_system_score_gemma":0.00005195851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001717501,"about_ca_topic_score_gemma":0.0000028366,"domain_scores_codex":[0.9985136,0.0001052984,0.0008140142,0.0001003018,0.0002188636,0.0002478858],"domain_scores_gemma":[0.9977742,0.0009187433,0.0007903845,0.0002340138,0.0001913968,0.00009129245],"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.0002254558,0.0001137679,0.004767672,0.0001092263,0.00006517972,0.00005785432,0.001846802,0.00001964377,0.002549324,0.9879777,0.00003171169,0.002235614],"study_design_scores_gemma":[0.0004869693,0.0002153252,0.005390479,0.0000524771,0.00005251079,0.0005353066,0.001254258,0.000008417624,0.00741906,0.984475,0.00002482857,0.00008543884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9235538,0.0001854367,0.07279586,0.00007905182,0.0002870485,0.00007548717,0.000001410566,0.00001186117,0.00301004],"genre_scores_gemma":[0.9881372,0.00002269889,0.01151543,0.00008033221,0.0001674108,2.893067e-7,2.312346e-7,0.00001202604,0.0000643375],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06458344,"threshold_uncertainty_score":0.3625215,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001399932,0.000223393,0.0007369297,0.0002166176,0.0002363327,0.00027068,0.002923065,0.0001193916,0.00001129804],"category_scores_gemma":[0.0003708903,0.0001591636,0.0002550418,0.0001729036,0.0002018012,0.0005594312,0.0004266836,0.000374832,0.0000239018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001148198,"about_ca_system_score_gemma":0.000155903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000237199,"about_ca_topic_score_gemma":0.000009665654,"domain_scores_codex":[0.9975731,0.0001793508,0.0008687314,0.0002944783,0.0007452275,0.0003390761],"domain_scores_gemma":[0.9959272,0.0002698615,0.001774376,0.001235938,0.0006007315,0.000191894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000455211,0.006876443,0.0809702,0.000745092,0.001121362,0.002317253,0.007326368,0.05609048,0.02173518,0.5656882,0.007066781,0.2496075],"study_design_scores_gemma":[0.00542861,0.00690498,0.6008714,0.000465855,0.0001471998,0.003855516,0.000239228,0.2375802,0.006153771,0.133038,0.003896864,0.001418423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.505047,0.001107049,0.4788157,0.002645049,0.00500842,0.0003997735,0.000005055544,0.00007524995,0.006896722],"genre_scores_gemma":[0.9904363,0.0000463017,0.008844227,0.00009872065,0.0004917944,0.000002473185,1.569393e-7,0.000008721888,0.00007135105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5199012,"threshold_uncertainty_score":0.6490502,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006066242,0.0001432402,0.0003990106,0.0003257446,0.00004878914,0.0001043886,0.00067446,0.0001051271,0.0001685471],"category_scores_gemma":[0.000207507,0.0001005258,0.0001294168,0.0004322269,0.0001207603,0.0005545863,0.0001250034,0.0002883276,0.00006521142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009553418,"about_ca_system_score_gemma":0.0001424196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002880054,"about_ca_topic_score_gemma":0.00001993565,"domain_scores_codex":[0.9984182,0.0001564938,0.0007409488,0.0001626533,0.0002739051,0.0002478614],"domain_scores_gemma":[0.9985071,0.0001672199,0.000636193,0.0002293839,0.0003521459,0.000107909],"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.00001902239,0.000374269,0.008162182,0.00006343134,0.00003865068,0.0001503947,0.003646474,0.00009082509,0.01270823,0.9676051,0.001928063,0.00521336],"study_design_scores_gemma":[0.001236487,0.0007005488,0.02141037,0.0002453886,0.00001503327,0.0008689404,0.0008500075,0.005042868,0.0004969782,0.9684569,0.0004280282,0.0002484398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4258623,0.0009898352,0.5403551,0.003175459,0.0009169769,0.00039729,0.000002154653,0.00004840591,0.02825249],"genre_scores_gemma":[0.9792448,0.00003964692,0.02035036,0.0002071136,0.0001057426,0.000004252084,6.023758e-7,0.000004997657,0.0000424865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5533825,"threshold_uncertainty_score":0.4099324,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009168134,0.0001528837,0.0005268931,0.00008260004,0.0001002433,0.00005217041,0.002054679,0.000054571,0.00001886059],"category_scores_gemma":[0.0003871586,0.00009240623,0.0002625446,0.0006512674,0.0007276214,0.0002415931,0.0004288689,0.000291332,0.000006520349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002894791,"about_ca_system_score_gemma":0.0001958466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004526027,"about_ca_topic_score_gemma":0.000007526633,"domain_scores_codex":[0.9976959,0.0002325325,0.0009594195,0.0002083977,0.000652708,0.0002509958],"domain_scores_gemma":[0.997485,0.0003506877,0.001015347,0.0003928108,0.0005989888,0.000157097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001098431,0.004767261,0.1293313,0.00186765,0.002294633,0.0004996216,0.04637071,0.03356055,0.06259494,0.4357649,0.01530857,0.2665414],"study_design_scores_gemma":[0.004468326,0.006549031,0.1684213,0.0003821932,0.0001735583,0.0008454159,0.003318615,0.4041959,0.02325604,0.3831546,0.004146727,0.001088265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6198315,0.001445082,0.3160963,0.06007986,0.001295231,0.0003723733,0.00000830802,0.00006035518,0.0008110126],"genre_scores_gemma":[0.9634913,0.00007483314,0.03565281,0.0005668509,0.0002030423,6.137586e-7,2.042861e-7,0.000005166145,0.000005139166],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3706354,"threshold_uncertainty_score":0.3818138,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001319708,0.0001665036,0.000453531,0.0004472461,0.00008896195,0.00004970148,0.0003077722,0.0001002992,0.0002697546],"category_scores_gemma":[0.001022338,0.0001168084,0.0002291218,0.0004353724,0.00008093765,0.0003155373,0.00003528419,0.0003086611,0.0001021294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007279753,"about_ca_system_score_gemma":0.00007641412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000288417,"about_ca_topic_score_gemma":6.428344e-7,"domain_scores_codex":[0.9983811,0.00009040468,0.0005701663,0.00008779127,0.0004697778,0.0004007391],"domain_scores_gemma":[0.9982888,0.0005141339,0.0005772036,0.0002342724,0.0001820063,0.0002036134],"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.000109485,0.001749734,0.02621302,0.0002906741,0.0002852567,0.00003941184,0.001618072,0.00002305629,0.003243448,0.9510096,0.008831914,0.006586362],"study_design_scores_gemma":[0.001165165,0.0003694901,0.03892024,0.000172391,0.0002313245,0.000259837,0.0005065083,0.00001259398,0.009621887,0.9428808,0.005483209,0.0003765471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9806721,0.002032646,0.008214097,0.0007185425,0.0007658226,0.0001015206,0.000002370674,0.0000403593,0.007452559],"genre_scores_gemma":[0.989372,0.00008347684,0.008463351,0.0003984856,0.001311431,0.000002065258,5.634164e-7,0.00002490319,0.0003437308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01270722,"threshold_uncertainty_score":0.4763308,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001542122,0.0001266405,0.0003765632,0.0001676727,0.0000421226,0.00001884488,0.0001842227,0.0001111939,0.000585327],"category_scores_gemma":[0.0002699876,0.00007636521,0.00005637264,0.0002007982,0.000147228,0.000226522,0.00002111865,0.0004449074,0.000007275642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003938873,"about_ca_system_score_gemma":0.00005532668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001050069,"about_ca_topic_score_gemma":0.00002531472,"domain_scores_codex":[0.9991071,0.00009532971,0.0003599364,0.00009053927,0.0001465921,0.0002004614],"domain_scores_gemma":[0.9991123,0.0002210243,0.0002912276,0.0001585674,0.0001566859,0.00006021321],"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.0006144433,0.0005348583,0.04042217,0.0001992769,0.0005239164,0.000986366,0.01078763,0.001109028,0.005721653,0.9327366,0.004145365,0.002218661],"study_design_scores_gemma":[0.0007520383,0.0002201867,0.01220536,0.00004613316,0.00004065935,0.0003671306,0.001049689,0.00007417738,0.0003773823,0.9847323,0.00002787725,0.000107052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9922242,0.0002137716,0.00467037,0.001197178,0.00009767313,0.0001086354,9.29728e-7,0.00001453083,0.001472678],"genre_scores_gemma":[0.9888063,0.0000126388,0.01052011,0.0002914451,0.00009215794,0.000001881498,4.777417e-7,0.00001031873,0.0002646407],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05199568,"threshold_uncertainty_score":0.640892,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007066274,0.00007892161,0.0003488367,0.0001315746,0.00001223057,0.00000264918,0.0001513683,0.00008656835,0.0001193403],"category_scores_gemma":[0.0002337774,0.00005453283,0.00008310781,0.00007661239,0.0000818473,0.000108154,0.00002676444,0.0002241163,0.00001321271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002455768,"about_ca_system_score_gemma":0.00004795014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.355567e-7,"about_ca_topic_score_gemma":0.00000131771,"domain_scores_codex":[0.9992545,0.000122405,0.0003308343,0.00006232935,0.0001092309,0.00012065],"domain_scores_gemma":[0.9988974,0.0005258196,0.0003513295,0.0001117428,0.000085458,0.00002819115],"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.0002208129,0.0001190183,0.001205162,0.00003345304,0.00004633441,0.00001843458,0.001800901,0.001671114,0.002463984,0.9920817,0.00004122455,0.00029788],"study_design_scores_gemma":[0.0004397149,0.0001511089,0.0007088851,0.00007816175,0.00002358327,0.00006180792,0.0007824692,0.0003087532,0.001798123,0.9955809,0.000007892001,0.00005860484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9791905,0.0004454901,0.005116324,0.0001924326,0.0001080773,0.00007480184,0.000002436158,0.000004587889,0.01486531],"genre_scores_gemma":[0.9937642,0.00005957821,0.005206985,0.0001171093,0.00003593081,4.355023e-7,1.732245e-7,0.000007840054,0.0008077057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0145737,"threshold_uncertainty_score":0.2223784,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002942047,0.0004806725,0.001502169,0.0006060501,0.0001862687,0.00007556295,0.0009129174,0.000251098,0.000005996757],"category_scores_gemma":[0.0003038405,0.0003327777,0.0005240653,0.0008866042,0.0002622393,0.001133161,0.0009717738,0.0007013966,0.000004720415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004830027,"about_ca_system_score_gemma":0.0001363107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003718741,"about_ca_topic_score_gemma":0.000009170228,"domain_scores_codex":[0.9949023,0.001262564,0.001196564,0.0005360526,0.001345921,0.0007566399],"domain_scores_gemma":[0.9928095,0.002844204,0.002258865,0.0006557821,0.001088224,0.0003433682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.001682255,0.006376719,0.1841322,0.0008291508,0.001928375,0.0003912616,0.04628268,0.002798219,0.4753892,0.03527196,0.000090767,0.2448272],"study_design_scores_gemma":[0.002158171,0.003281806,0.818216,0.0009199223,0.0002196208,0.0003523371,0.0003293293,0.008370935,0.1570487,0.008600134,0.000004377907,0.0004986998],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9154205,0.0003201744,0.08130151,0.0002255107,0.001304444,0.0008952263,0.00001182434,0.0000647998,0.0004559477],"genre_scores_gemma":[0.973372,0.000159548,0.02587138,0.0001000225,0.0004549561,0.000008884313,0.000002064224,0.00002695375,0.000004192259],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6340837,"threshold_uncertainty_score":0.9999124,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001570659,0.0001565274,0.0003562257,0.0001553839,0.0001393979,0.00002228049,0.0002484118,0.0001455984,0.006233734],"category_scores_gemma":[0.0004348787,0.0001141661,0.0002048613,0.00008801284,0.0001451757,0.0001729327,0.00004398457,0.000373567,0.00002822889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003639844,"about_ca_system_score_gemma":0.00001617614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001033202,"about_ca_topic_score_gemma":0.000002555402,"domain_scores_codex":[0.9987258,0.0001251893,0.0005239598,0.0001128967,0.0002642965,0.0002478212],"domain_scores_gemma":[0.9988123,0.0003824865,0.000441772,0.0001755816,0.0000822308,0.0001056451],"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.0001230416,0.0004045726,0.0002454254,0.00003005297,0.0002084007,0.0001354686,0.002120412,0.00005795619,0.005560392,0.9825354,0.006024932,0.002553926],"study_design_scores_gemma":[0.001268957,0.0002407788,0.002247346,0.00002205799,0.0001345494,0.0003154341,0.0002696314,0.0003428908,0.0007433402,0.9936672,0.0005635803,0.0001841976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9385381,0.0004383964,0.05543907,0.0004100421,0.001055123,0.0001050017,0.000007963455,0.00003574732,0.003970498],"genre_scores_gemma":[0.9947885,0.00004473918,0.003229409,0.0001427317,0.0008676556,0.000001615756,9.014515e-7,0.00001663409,0.0009077991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05625036,"threshold_uncertainty_score":0.9946747,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001174685,0.0001071672,0.0003725227,0.00002581996,0.0001001986,0.00001046776,0.0008724415,0.0001658719,0.000361157],"category_scores_gemma":[0.003917812,0.00006151503,0.0001801085,0.00009249411,0.0002977896,0.0001553538,0.0002752906,0.000726075,0.000002261462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000311806,"about_ca_system_score_gemma":0.0001131174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003150835,"about_ca_topic_score_gemma":0.000086382,"domain_scores_codex":[0.9988052,0.0002300053,0.0005464047,0.0001140393,0.0001513593,0.000152984],"domain_scores_gemma":[0.9969635,0.001787938,0.0005053785,0.0005186041,0.0001592387,0.00006531343],"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.003118733,0.001969637,0.03729563,0.0001720696,0.0003075508,0.00001716014,0.006139189,0.0000105402,0.03371615,0.8939614,0.01431917,0.008972765],"study_design_scores_gemma":[0.000848574,0.0003179613,0.003545247,0.00002795917,0.00006445601,0.00004421752,0.0006922723,0.000006570574,0.006289877,0.987577,0.0005018018,0.00008411007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.987612,0.00003931954,0.0005989643,0.001622832,0.0009723363,0.000176019,0.0000103413,0.000007242761,0.008960965],"genre_scores_gemma":[0.9964529,0.00002466904,0.003199971,0.0001755753,0.00004544456,0.000003188861,3.030138e-7,0.000006782629,0.00009118345],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09361555,"threshold_uncertainty_score":0.469027,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005326745,0.00007936807,0.0002744958,0.0001934509,0.00003879305,0.000003013622,0.0001469374,0.00008716068,0.0001239671],"category_scores_gemma":[0.0002377747,0.00005939768,0.0001501546,0.0001234179,0.00009524643,0.0001477889,0.00001609938,0.0001833943,0.00000678471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001993191,"about_ca_system_score_gemma":0.0000249053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.873568e-7,"about_ca_topic_score_gemma":0.000001823244,"domain_scores_codex":[0.9990978,0.00007947302,0.0004843477,0.00005688526,0.0001558516,0.0001257065],"domain_scores_gemma":[0.9989457,0.0001872023,0.0006082051,0.000122933,0.00009003881,0.00004593744],"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.0001014549,0.0003992464,0.00151984,0.0000421459,0.000122249,0.00001580801,0.001638976,0.0001192287,0.008606653,0.9813371,0.0005607384,0.005536602],"study_design_scores_gemma":[0.0007156236,0.0002016608,0.002033246,0.00004695801,0.00006649618,0.000202554,0.0003678421,0.00008298624,0.005832429,0.9895136,0.0008477239,0.00008889842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9682291,0.0006888832,0.02700227,0.0008266667,0.0001927527,0.0000618294,0.000001257791,0.00001419328,0.002983103],"genre_scores_gemma":[0.9887349,0.0001643983,0.0104357,0.0001484468,0.0002741123,8.007105e-7,3.752048e-7,0.000007972479,0.0002332752],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02050587,"threshold_uncertainty_score":0.2422167,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001115859,0.0001932697,0.0003845794,0.0002735649,0.000118873,0.00007509966,0.001263656,0.0001010292,0.0000375044],"category_scores_gemma":[0.0003342426,0.0001436263,0.000280296,0.000257918,0.00009082137,0.0005094988,0.0001780924,0.000274936,0.00002367096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001535712,"about_ca_system_score_gemma":0.0001514262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001299332,"about_ca_topic_score_gemma":0.000002000824,"domain_scores_codex":[0.9981664,0.0001206618,0.0005844326,0.0003529208,0.0004121471,0.0003634285],"domain_scores_gemma":[0.9980864,0.0003146133,0.0004304897,0.0005863882,0.0003975556,0.0001845833],"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.0007129891,0.003855611,0.008322195,0.0003437556,0.0003873427,0.0002754372,0.02885288,0.001787297,0.003002032,0.6192811,0.02018651,0.3129928],"study_design_scores_gemma":[0.004146855,0.01346429,0.05981205,0.0003326215,0.0001156418,0.0007295933,0.001851619,0.0447947,0.020046,0.8474936,0.005990139,0.001222847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6362824,0.0004885782,0.345695,0.002228475,0.004113543,0.0005914958,0.000005440396,0.0001489718,0.01044604],"genre_scores_gemma":[0.921277,0.00002754977,0.07767605,0.0004286312,0.0004138528,0.000004834574,3.575939e-7,0.00001031409,0.000161396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.31177,"threshold_uncertainty_score":0.5856912,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532032,0.0001249901,0.0004394252,0.0001302018,0.00005135686,0.0000100426,0.0003726254,0.00007902693,0.0001523413],"category_scores_gemma":[0.0002060749,0.00007078444,0.0001466455,0.0001330751,0.0002979464,0.0001013951,0.00001960557,0.0003306892,0.000003980752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000266948,"about_ca_system_score_gemma":0.00003194565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006501906,"about_ca_topic_score_gemma":0.00001488769,"domain_scores_codex":[0.998463,0.0004519121,0.0005879879,0.0000729615,0.0002199727,0.0002041998],"domain_scores_gemma":[0.997739,0.001396228,0.0005960816,0.0001729943,0.00006925395,0.00002650273],"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.0002046903,0.0003569115,0.004679081,0.0000291039,0.00003476108,0.00006506951,0.001272181,0.0001878341,0.001132024,0.9906226,0.001266568,0.0001491419],"study_design_scores_gemma":[0.0006647377,0.0002407092,0.05639763,0.00003346989,0.00004016921,0.0002894932,0.004201617,0.0000177543,0.0001862851,0.937617,0.0002378615,0.00007325403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9845911,0.0004177788,0.002144883,0.0006895309,0.00008822019,0.00009604186,0.000004827131,0.00000681331,0.01196083],"genre_scores_gemma":[0.9975482,0.0000149473,0.002004658,0.0001165108,0.0002062136,6.20769e-7,9.837145e-7,0.000008665727,0.00009922592],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05300561,"threshold_uncertainty_score":0.2886506,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009137533,0.0001929911,0.0004460131,0.0003117743,0.0001367083,0.0001090349,0.001292165,0.0001052005,0.00002974317],"category_scores_gemma":[0.000482609,0.0001384625,0.0002821684,0.0004715604,0.00006085667,0.0006247154,0.0001340834,0.0002575012,0.00004786345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004928884,"about_ca_system_score_gemma":0.00007677852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.490686e-7,"about_ca_topic_score_gemma":5.232857e-7,"domain_scores_codex":[0.9983059,0.00008168354,0.0005809413,0.0002508077,0.0003595083,0.0004211731],"domain_scores_gemma":[0.9981605,0.0004128263,0.0005447336,0.0004046501,0.0002670694,0.0002101805],"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.00001983159,0.0001204974,0.0005269181,0.00003325136,0.00004724253,0.00001979957,0.0002212343,0.0002624187,0.001786616,0.9317566,0.002275112,0.0629305],"study_design_scores_gemma":[0.00129068,0.001063218,0.005906265,0.00003997058,0.00002853536,0.0004967621,0.00004258357,0.002826459,0.001800169,0.9606576,0.02552756,0.000320195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08781753,0.0006193258,0.9065568,0.002070365,0.001017289,0.000132821,9.129996e-7,0.00006332731,0.001721667],"genre_scores_gemma":[0.9199488,0.00004904532,0.07651359,0.00250003,0.0007649172,0.000005679742,6.245261e-7,0.00001388437,0.0002034552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8321313,"threshold_uncertainty_score":0.5646335,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009849473,0.0001092,0.0003594871,0.00005243402,0.0001024877,0.00001040294,0.0003109288,0.00009474794,0.00009801314],"category_scores_gemma":[0.0008210728,0.00006514149,0.0001626978,0.00009447718,0.0001686673,0.0001086888,0.00004601331,0.0003015784,0.00000970068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003841021,"about_ca_system_score_gemma":0.00003581366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002209922,"about_ca_topic_score_gemma":0.000007169357,"domain_scores_codex":[0.9987786,0.0001254385,0.0005763159,0.00007044969,0.0002160698,0.0002330632],"domain_scores_gemma":[0.9976082,0.001137665,0.0008676922,0.0001904325,0.0001280534,0.00006788894],"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.0003690379,0.000209549,0.004066267,0.00006232564,0.0003329277,0.0003189293,0.001868449,0.0003794917,0.002236025,0.9842721,0.003447034,0.002437915],"study_design_scores_gemma":[0.0004783161,0.00012864,0.0008539195,0.00006180714,0.00005359626,0.0007260883,0.00159109,0.00001358223,0.0005799525,0.9899462,0.005481397,0.00008536419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9695714,0.001179238,0.009979765,0.00141525,0.00053752,0.0001075586,0.00000303777,0.00001934976,0.01718685],"genre_scores_gemma":[0.9964682,0.0006789117,0.001533401,0.0003880422,0.0002039004,0.00000103842,1.40519e-7,0.00001219705,0.0007141249],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02689682,"threshold_uncertainty_score":0.2656393,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002838134,0.0001985443,0.0004312235,0.0003811233,0.0001692485,0.000214114,0.00164777,0.0001091343,0.00001765078],"category_scores_gemma":[0.0001145481,0.0001549673,0.0002496456,0.000652662,0.00008094174,0.000832671,0.0003340221,0.0004190536,0.00002674775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000250211,"about_ca_system_score_gemma":0.0001832161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001520617,"about_ca_topic_score_gemma":0.000005605085,"domain_scores_codex":[0.99756,0.00008764877,0.0008237858,0.0002740822,0.0006879475,0.0005666008],"domain_scores_gemma":[0.9980449,0.0002848086,0.0004955796,0.0005076829,0.0003834334,0.0002835838],"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.00008615601,0.001690088,0.003562004,0.00009844077,0.0002720802,0.003607371,0.01269596,0.03242441,0.007334122,0.5263402,0.001473237,0.4104159],"study_design_scores_gemma":[0.001121781,0.0009819474,0.01077442,0.00006476285,0.000037496,0.006273782,0.0002594044,0.07826738,0.001401924,0.8978469,0.002390898,0.0005792942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1385522,0.0009212603,0.8531438,0.0006790047,0.001365238,0.0000998685,4.339415e-7,0.00007482077,0.005163377],"genre_scores_gemma":[0.8916911,0.00004497444,0.107125,0.0004720435,0.0005969648,6.138782e-7,1.393036e-7,0.00001029082,0.00005886259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.753139,"threshold_uncertainty_score":0.6319383,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001472367,0.0001648269,0.0003931636,0.0001620788,0.0001154401,0.0001904972,0.00109661,0.0001236481,0.00002979082],"category_scores_gemma":[0.0003378543,0.0001207892,0.0001374274,0.0003821609,0.0002670902,0.0004822451,0.0004297524,0.0006429181,0.000009442426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003666909,"about_ca_system_score_gemma":0.0001393169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001534496,"about_ca_topic_score_gemma":0.000007681983,"domain_scores_codex":[0.9983714,0.0001166518,0.0005402351,0.0002732617,0.000412226,0.0002862364],"domain_scores_gemma":[0.998397,0.0001774803,0.0003901256,0.0004966828,0.0002966037,0.0002421281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005013337,0.001297347,0.06612915,0.00009258228,0.0001480614,0.0004394268,0.002081317,0.0002560059,0.05440628,0.3254515,0.002017473,0.5476308],"study_design_scores_gemma":[0.002306788,0.001077632,0.4293315,0.00002911578,0.00005757708,0.005081862,0.00006687412,0.03608417,0.005161481,0.507913,0.0120631,0.0008269803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7273367,0.0002228632,0.2678804,0.002117218,0.001522697,0.00009097116,9.318094e-7,0.00005631931,0.0007719336],"genre_scores_gemma":[0.9085732,0.0000347521,0.09038907,0.0004400462,0.0005298436,0.000001112998,1.03795e-7,0.000005339329,0.00002658665],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5468038,"threshold_uncertainty_score":0.4925639,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003923505,0.0001519263,0.0004647606,0.0001154077,0.00003927759,0.000009566714,0.0002965398,0.000146296,0.001384727],"category_scores_gemma":[0.0002414965,0.0001085147,0.0001582986,0.0001467856,0.00004848825,0.0001546499,0.00004847957,0.000391916,0.0003192285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002968701,"about_ca_system_score_gemma":0.000141431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002056678,"about_ca_topic_score_gemma":0.000001234987,"domain_scores_codex":[0.9988678,0.00006428583,0.0005022569,0.0001210905,0.0001932537,0.0002513477],"domain_scores_gemma":[0.9987302,0.0003116669,0.0004418641,0.0002362426,0.0001484495,0.0001315715],"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.003784506,0.002032564,0.02392675,0.0007875752,0.001842197,0.0009805933,0.01649362,0.0007794896,0.07236328,0.7159745,0.1379755,0.02305945],"study_design_scores_gemma":[0.00289674,0.0007747114,0.001891223,0.0001196882,0.000115516,0.0008573402,0.0006679499,0.00009110531,0.002377931,0.9815775,0.008324231,0.0003061001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9515105,0.0002411862,0.03256305,0.00172982,0.0009160655,0.000183839,0.000002009172,0.00002684574,0.01282661],"genre_scores_gemma":[0.8926843,0.00004786703,0.09648671,0.001242175,0.0008527376,0.000001026041,7.650331e-7,0.00003044683,0.008653923],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.265603,"threshold_uncertainty_score":0.9995282,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004463454,0.0001017508,0.0002780253,0.00005352662,0.00008098727,0.00001407361,0.0004146401,0.00006816757,0.00009185196],"category_scores_gemma":[0.0002510269,0.00003797872,0.0001034225,0.0000831289,0.0001213045,0.00009349259,0.00006129841,0.0001497546,0.000003041687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001879044,"about_ca_system_score_gemma":0.0000507333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001225035,"about_ca_topic_score_gemma":0.000003034741,"domain_scores_codex":[0.9990245,0.00007892078,0.0003953431,0.00006313405,0.0002884995,0.0001495723],"domain_scores_gemma":[0.9986275,0.0005015807,0.0003802466,0.0002695553,0.0001598364,0.00006128998],"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.0005825451,0.0004208355,0.002959343,0.00008081976,0.0004232432,0.00002195327,0.001399395,0.0001075594,0.008894934,0.9743624,0.006561154,0.004185778],"study_design_scores_gemma":[0.001433762,0.0003601118,0.001552434,0.0001594846,0.00008691478,0.0001336252,0.0002869863,0.0001440044,0.006284411,0.9893696,0.00007864938,0.0001100291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9570192,0.00007740698,0.04046912,0.0009654076,0.0001438783,0.00005622826,0.000002792654,0.000006954582,0.001259067],"genre_scores_gemma":[0.9985332,0.00005378923,0.0007707422,0.00004428429,0.0001404144,9.882424e-7,6.646746e-8,0.000009349822,0.0004471609],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04151407,"threshold_uncertainty_score":0.1548727,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007390586,0.0001669577,0.0003510049,0.0003399204,0.00007273004,0.00007232513,0.0006275306,0.0001121992,0.00001792799],"category_scores_gemma":[0.000137872,0.0001172361,0.00007957676,0.0004410294,0.00008419443,0.00046033,0.0001546879,0.0003844202,0.000005565783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005797733,"about_ca_system_score_gemma":0.00005754231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006444638,"about_ca_topic_score_gemma":0.00001699056,"domain_scores_codex":[0.9984719,0.00005481809,0.0005690441,0.0002129625,0.0002974943,0.0003938178],"domain_scores_gemma":[0.9990214,0.0001825321,0.0003409533,0.000199487,0.00009049434,0.0001651161],"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.00004795226,0.00009403767,0.009371108,0.00001633378,0.0000194642,0.0007687531,0.0009624602,0.0003001583,0.003716914,0.9190254,0.0001375692,0.0655398],"study_design_scores_gemma":[0.0006112067,0.0002876466,0.194569,0.00001676555,0.000005793567,0.0008935794,0.000122818,0.0001292486,0.0006641762,0.802016,0.0005154718,0.0001683609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8118614,0.001441314,0.1829997,0.001000544,0.0005020876,0.000096728,4.361464e-7,0.0000322166,0.002065551],"genre_scores_gemma":[0.9780887,0.0001043969,0.01993039,0.001528188,0.0003230051,4.593782e-7,1.634243e-7,0.000006181897,0.00001852215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1851979,"threshold_uncertainty_score":0.4780751,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009492686,0.00008163803,0.000178278,0.0002349447,0.0000356277,0.0001158048,0.0006672255,0.00007417112,0.00002519556],"category_scores_gemma":[0.0001349849,0.00005839896,0.00007272403,0.000258428,0.00003381753,0.0007160911,0.0000679455,0.0003244979,0.00001736444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001885366,"about_ca_system_score_gemma":0.00004258414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006837349,"about_ca_topic_score_gemma":0.000007131606,"domain_scores_codex":[0.9990817,0.00005839006,0.0003408678,0.0001153542,0.0002438947,0.0001597817],"domain_scores_gemma":[0.999283,0.00007398958,0.0002415654,0.0002324783,0.0001083231,0.00006061815],"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.000009314194,0.0001621551,0.001325868,0.0000106156,0.00001098597,0.0001073415,0.001031453,0.00011422,0.04411232,0.9033015,0.0004160444,0.04939822],"study_design_scores_gemma":[0.001358601,0.0002920743,0.3464054,0.0001045571,0.00001527737,0.00097331,0.0002795556,0.06364047,0.01203917,0.5730085,0.001518808,0.0003642625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9375322,0.0001193704,0.0591285,0.001432313,0.0009306273,0.00004199144,3.362471e-7,0.00002217678,0.0007924823],"genre_scores_gemma":[0.9818491,0.00001948869,0.0175979,0.0002841832,0.0001719768,8.71178e-7,2.331477e-7,0.000004347898,0.00007185576],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3450795,"threshold_uncertainty_score":0.238144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}