{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":29,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":29,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"c6f5c3dbd578","filters":{"venue":"Mathematical logic quarterly"}},"results":[{"id":"W2045590994","doi":"10.1002/malq.200810012","title":"Commutative rings whose ideals form an MV‐algebra","year":2009,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":32,"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; Commutative ring; Commutative algebra; Noncommutative ring; Class (philosophy); Semiprime ring; Pure mathematics; Commutative property; Maximal ideal; Artinian ring; Von Neumann regular ring; Local ring; Lattice (music); Ideal (ethics); Unit (ring theory); Ring (chemistry); Algebra over a field; Combinatorics; Law; Chemistry; Noetherian","retraction":null,"screen_n_in":null,"score":{"opus":0.01908106264099546,"gpt":0.2846295600378421,"spread":0.2655484973968466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004242483,0.0003045572,0.0004494589,0.00009339861,0.000214812,0.0002682339,0.001261443,0.0001174452,0.0001232018],"category_scores_gemma":[0.00005659034,0.0002262994,0.0001267512,0.0003265738,0.0001128776,0.001182194,0.00005826464,0.0002724779,0.0007034583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004544725,"about_ca_system_score_gemma":0.00002457789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001682831,"about_ca_topic_score_gemma":0.000001680572,"domain_scores_codex":[0.9978664,0.000116932,0.0005013812,0.0005208501,0.0003908165,0.0006036164],"domain_scores_gemma":[0.9982809,0.0002890257,0.0001560997,0.0008997314,0.00008317409,0.0002910541],"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.000005505086,0.000288211,0.00000518594,0.00001431762,0.000006683093,0.00004782284,0.005301832,0.000004057802,0.0002771064,0.9282324,0.00009941198,0.06571745],"study_design_scores_gemma":[0.0003239572,0.002330983,0.0009764706,0.00003017943,0.000007782734,0.00007499706,0.0004119144,0.01047836,0.000171517,0.9847748,0.00009769565,0.0003213822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07807998,0.00004717589,0.9039285,0.002390895,0.00007322254,0.0003178546,0.000002192226,0.0005726551,0.01458757],"genre_scores_gemma":[0.8508739,0.000001315151,0.1465193,0.002351776,0.00005783132,0.00002228148,0.000003809224,0.00001008246,0.0001596114],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7727939,"threshold_uncertainty_score":0.9228222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067703954","doi":"10.1002/malq.201020093","title":"Simulating non-prenex cuts in quantified propositional calculus","year":2011,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"McGill University","funders":"","keywords":"Mathematics; Calculus (dental); Propositional variable; Propositional formula; Propositional calculus; Computer science; Discrete mathematics; Artificial intelligence; Orthodontics; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.04646462270182227,"gpt":0.2703370566214111,"spread":0.2238724339195888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005659612,0.0002006768,0.0003235345,0.0001023557,0.00009210058,0.0001385048,0.0006440641,0.000125777,0.0001176159],"category_scores_gemma":[0.00004631246,0.0001486519,0.0001002994,0.0002838532,0.00007631718,0.0002886882,0.0000700047,0.0001724787,0.0007406427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003809344,"about_ca_system_score_gemma":0.00003490104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000642048,"about_ca_topic_score_gemma":0.00001480831,"domain_scores_codex":[0.9981281,0.0001092512,0.0005339174,0.0004401262,0.0003369453,0.0004517138],"domain_scores_gemma":[0.9990542,0.0001403988,0.0001246474,0.0004916908,0.00006468017,0.0001244187],"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.000006291176,0.0003450832,0.0002239563,0.00008675322,0.00001047177,0.00009208824,0.007818157,0.000006317359,0.0001966759,0.9838229,0.00003375636,0.007357484],"study_design_scores_gemma":[0.0004266659,0.0006042136,0.00113358,0.00002668671,0.000006349956,0.00005534806,0.0002533128,0.1301181,0.0002292459,0.8668172,0.00004811311,0.0002810709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02032905,0.00001955976,0.9357894,0.0001050829,0.0002046278,0.0004258366,4.742644e-7,0.000191823,0.04293412],"genre_scores_gemma":[0.9653265,1.497794e-7,0.03420915,0.00009008937,0.00005325859,0.00005579467,0.000002401025,0.00001021435,0.0002524511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9449974,"threshold_uncertainty_score":0.9519711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089220531","doi":"10.1002/malq.200910001","title":"Degree spectra and immunity properties","year":2010,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":16,"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); Uncountable set; Mathematics; Corollary; Complement (music); Pure mathematics; Spectrum (functional analysis); Combinatorics; Physics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.037241469415239,"gpt":0.240759079117303,"spread":0.203517609702064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007125805,0.0002399911,0.000336172,0.00006971683,0.0001788218,0.0003722772,0.001024006,0.0001239608,0.0001400462],"category_scores_gemma":[0.0001708353,0.0001669455,0.00008149497,0.0002033728,0.0003252917,0.0003489444,0.0002319794,0.0004958769,0.0002918684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001849795,"about_ca_system_score_gemma":0.00003743016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001747042,"about_ca_topic_score_gemma":0.00002068908,"domain_scores_codex":[0.9982991,0.0001125021,0.0003762722,0.0004683177,0.0003233485,0.0004205265],"domain_scores_gemma":[0.9983079,0.0002909203,0.00007219855,0.00105439,0.00008512932,0.0001894829],"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.000005702874,0.0004916642,0.0001362307,0.0001271466,0.00001816924,0.0000314925,0.004311258,7.438832e-7,0.008054606,0.8484054,0.00007832551,0.1383393],"study_design_scores_gemma":[0.0002468614,0.0006224821,0.005157453,0.00001838011,0.000008582922,0.0002602355,0.0001574946,0.04908331,0.0005384941,0.9434279,0.0001563768,0.0003223785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4067787,0.00006364712,0.5782241,0.002196878,0.0003305822,0.0004027906,0.000001299572,0.0005040971,0.01149788],"genre_scores_gemma":[0.7926789,7.643268e-7,0.2069513,0.0001391087,0.00007703563,0.00002411229,3.973769e-7,0.000008992568,0.0001193492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3859002,"threshold_uncertainty_score":0.680784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093788800","doi":"10.1002/malq.201110037","title":"Conjectures of Rado and Chang and special Aronszajn trees","year":2012,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Limits and Structures in Graph 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":"University of Toronto","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Square (algebra); Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03163157865390188,"gpt":0.2855765054430626,"spread":0.2539449267891607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004540189,0.0001977481,0.0004498952,0.000073916,0.0001101605,0.00002423595,0.0001104436,0.0001283446,0.0003784634],"category_scores_gemma":[0.0002012211,0.0001305066,0.00007030747,0.00006205343,0.0003866176,0.00009820311,0.00005111499,0.0001292106,0.000005623373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006816213,"about_ca_system_score_gemma":0.000004335741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001125647,"about_ca_topic_score_gemma":0.000002333224,"domain_scores_codex":[0.9988801,0.00009049939,0.0003548281,0.0001646616,0.0001955175,0.0003144058],"domain_scores_gemma":[0.9986479,0.000816143,0.0001232448,0.0002474202,0.00002484022,0.000140445],"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.00002104249,0.00009497134,0.000464937,0.0002390925,0.00003747284,0.000001863856,0.01083004,1.705148e-8,0.0002311057,0.9821687,0.000363819,0.005546961],"study_design_scores_gemma":[0.0003236084,0.0002667924,0.0026065,0.00004663315,0.00006670207,0.00007884658,0.001355499,0.00003178845,0.0002184291,0.9946795,0.00016215,0.0001635568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9814245,0.00047435,0.00249565,0.0001343568,0.0001756894,0.0002654558,0.00001156341,0.00004870985,0.0149698],"genre_scores_gemma":[0.9897932,0.000008778692,0.009469777,0.00007400709,0.0005107649,0.000009017353,8.710396e-7,0.0000170767,0.0001164767],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01485333,"threshold_uncertainty_score":0.5321903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062755128","doi":"10.1002/malq.200610040","title":"Bounded BCK‐algebras and their generated variety","year":2007,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Institute of Population and Public Health","keywords":"Bounded function; Mathematics; Residuated lattice; Commutative property; Simple (philosophy); Class (philosophy); Variety (cybernetics); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01534906442188084,"gpt":0.2413161522678692,"spread":0.2259670878459884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006467142,0.000252875,0.0003167103,0.00006914152,0.0001900289,0.0002228212,0.0005186546,0.0001297032,0.0000798202],"category_scores_gemma":[0.0000428926,0.0001668149,0.0000753376,0.0003212679,0.0001611682,0.0003268303,0.00008141094,0.0001989805,0.0001933309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002770406,"about_ca_system_score_gemma":0.0000224646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001546186,"about_ca_topic_score_gemma":0.000003509854,"domain_scores_codex":[0.9983471,0.00005928737,0.000397382,0.0004676339,0.0002008757,0.0005276898],"domain_scores_gemma":[0.9987245,0.0003656993,0.00008902983,0.0005348453,0.00006103748,0.0002249273],"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.000004547488,0.0001066337,0.00001436989,0.00002193757,0.00001325517,0.00003133612,0.002099456,8.315408e-7,0.001546776,0.9649963,0.00006986221,0.03109464],"study_design_scores_gemma":[0.0002818032,0.0004098479,0.0006115466,0.00001211236,0.000004728199,0.0001234707,0.0002904207,0.00886951,0.0007875867,0.9880276,0.0003293475,0.0002520509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1100642,0.00009481755,0.8826963,0.0005355952,0.0001075109,0.0001715341,0.000001058892,0.0003144323,0.006014583],"genre_scores_gemma":[0.8789731,0.000002221675,0.1198412,0.0008981589,0.00007104984,0.000009692001,0.000002105735,0.00001128759,0.0001911413],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7689089,"threshold_uncertainty_score":0.6802513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114015893","doi":"10.1002/malq.201200079","title":"Cofinalities of Borel ideals","year":2014,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"Saint Mary's University","funders":"Consejo de Ciencia y Tecnología del Estado de Chiapas; Universidad Nacional Autónoma de México; Akademie Věd České Republiky; Grantová Agentura České Republiky","keywords":"Cofinality; Mathematics; Invariant (physics); Ideal (ethics); Uncountable set; Pairwise comparison; Pure mathematics; Discrete mathematics; Countable set; Epistemology; Statistics; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.03852999292608383,"gpt":0.3240765200978396,"spread":0.2855465271717558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008537878,0.0001800526,0.0005476148,0.00005699301,0.0000663682,0.000009534655,0.0002450231,0.0001452409,0.0007975393],"category_scores_gemma":[0.0008178994,0.000133979,0.000131345,0.00007842438,0.0004068423,0.00006889218,0.00002096605,0.0001521092,0.0002157508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001223502,"about_ca_system_score_gemma":0.00001140323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001445467,"about_ca_topic_score_gemma":0.000001512911,"domain_scores_codex":[0.998518,0.0002132043,0.0005697961,0.0001960458,0.0002063454,0.0002965385],"domain_scores_gemma":[0.9969147,0.002283336,0.0001934266,0.0004624015,0.00006763064,0.00007847016],"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.00002221639,0.0001549973,0.00001491733,0.0002699395,0.00002216131,0.000002939035,0.001380501,5.408945e-7,0.0002314698,0.9956039,0.0004467569,0.001849699],"study_design_scores_gemma":[0.0003001407,0.0005340537,0.00004190058,0.00005740811,0.00003571717,0.00002561712,0.0008877609,0.0002481535,0.0004496955,0.9969711,0.0002996477,0.0001487897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2058447,0.00005424553,0.6672108,0.0006363635,0.0001247442,0.0002980204,0.00001296234,0.0002276888,0.1255904],"genre_scores_gemma":[0.9433127,0.000001086465,0.05486735,0.0001987461,0.00006471531,0.00002336884,0.000002566825,0.0000206876,0.001508754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.737468,"threshold_uncertainty_score":0.8732495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082808755","doi":"10.1002/malq.200710030","title":"The axiom of choice and the law of excluded middle in weak set theories","year":2008,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Philosophy and Theoretical Science","field":"Psychology","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Extensionality; Axiom of choice; Constructive set theory; Urelement; Law of excluded middle; Mathematics; Zermelo–Fraenkel set theory; Axiom; Quotient; Set (abstract data type); Pure mathematics; Mathematical economics; Set theory; Discrete mathematics; Computer science; Geometry; Epistemology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.04597893310610612,"gpt":0.2970490313343944,"spread":0.2510700982282882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001113423,0.00010709,0.0003016976,0.00001913236,0.000133188,0.00001204107,0.0003852307,0.00007152429,0.0001953317],"category_scores_gemma":[0.0002295736,0.0000474887,0.00006928296,0.0001812411,0.005028509,0.00004397596,0.00003259562,0.0001458022,0.00004174209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004738691,"about_ca_system_score_gemma":0.000007689222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006076602,"about_ca_topic_score_gemma":0.00002046196,"domain_scores_codex":[0.9986176,0.0003510768,0.0004184016,0.0001672114,0.0002087576,0.0002369231],"domain_scores_gemma":[0.9958011,0.003618924,0.0001121224,0.0003890305,0.0000305103,0.00004832166],"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.00009746292,0.0001157776,0.00003893922,0.00002204584,0.00001319175,0.00000276858,0.01141751,1.27252e-7,0.00005727569,0.9878849,0.00001567872,0.0003342848],"study_design_scores_gemma":[0.0007113347,0.0002820032,0.001310667,0.00002605032,0.000009661732,0.0000304389,0.002005936,0.00007703137,0.00006378858,0.9953384,0.00008444452,0.00006018911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4571984,0.0003338561,0.001139192,0.003306677,0.00009935002,0.0003521858,0.000009501232,0.00001882964,0.537542],"genre_scores_gemma":[0.9994547,0.000004787828,0.0001135101,0.0001445426,0.0000251355,0.00002955724,3.539385e-7,0.00000457213,0.0002228183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5422564,"threshold_uncertainty_score":0.9976792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1493806114","doi":"10.1002/malq.201300030","title":"Generic trivializations of geometric theories","year":2014,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; NIP; Converse; Rank (graph theory); Simplicity; Stability (learning theory); Pure mathematics; Discrete mathematics; Combinatorics; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03355777729189491,"gpt":0.3065429095177503,"spread":0.2729851322258554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007659992,0.0001803436,0.0004985453,0.0001805028,0.0001032182,0.0000124275,0.0002651095,0.0001419582,0.0008955516],"category_scores_gemma":[0.001686398,0.0001334195,0.0001310764,0.0004600773,0.0003602794,0.00008112187,0.00002356059,0.0001261233,0.0001571916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001456657,"about_ca_system_score_gemma":0.0000140366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.929382e-7,"about_ca_topic_score_gemma":0.000001043192,"domain_scores_codex":[0.9985075,0.0002390157,0.000551352,0.0002130435,0.0002097044,0.0002793592],"domain_scores_gemma":[0.9967395,0.002406996,0.0002061719,0.0004809669,0.00008795445,0.00007840615],"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.00001264835,0.0002248121,0.00002120431,0.0001339548,0.00002476225,0.000001357535,0.0007403197,0.000004147444,0.0001554893,0.9942046,0.0001827788,0.004293899],"study_design_scores_gemma":[0.0002975867,0.0004309921,0.00004262514,0.0000213671,0.00005095549,0.00001724295,0.000352453,0.0005106677,0.0004173106,0.9974595,0.0002494269,0.0001498214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04310467,0.00004148052,0.9208753,0.0001683499,0.0001014057,0.0001879557,0.000006275285,0.000130847,0.03538376],"genre_scores_gemma":[0.940627,0.000002447318,0.0581379,0.0001113445,0.00007795633,0.000029897,0.000004443114,0.00002284282,0.0009862108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8975223,"threshold_uncertainty_score":0.9805662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1625734883","doi":"10.1002/malq.201500004","title":"The conjugacy problem for automorphism groups of countable homogeneous structures","year":2016,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University; Boise State University","keywords":"Mathematics; Omega; Combinatorics; Isomorphism (crystallography); Conjugacy class; Conjecture; Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02922069842990204,"gpt":0.3050918773846822,"spread":0.2758711789547802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007783964,0.0002277082,0.0004725888,0.00003435276,0.0002629825,0.0000224936,0.0004083421,0.0001654387,0.0003567884],"category_scores_gemma":[0.0005601868,0.0001056987,0.0001645074,0.00006508035,0.0006923758,0.00008921392,0.00002756168,0.0001022595,0.00005176653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003674781,"about_ca_system_score_gemma":0.00003588941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.019732e-7,"about_ca_topic_score_gemma":0.000005511426,"domain_scores_codex":[0.9982976,0.0001154874,0.000651337,0.0002579163,0.000216619,0.0004610399],"domain_scores_gemma":[0.993359,0.005592817,0.0002927159,0.0005388938,0.0001383041,0.00007822824],"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.00009847328,0.0001028403,0.000003793582,0.0001697828,0.00006216914,0.000004006695,0.0005473074,4.003787e-7,0.0017556,0.9888787,0.0012776,0.007099277],"study_design_scores_gemma":[0.0007333164,0.0006665174,0.000008214593,0.00006013676,0.00005776872,0.00006866739,0.0004184732,0.00006564884,0.001291846,0.9951236,0.001336848,0.0001689916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07318652,0.0002738115,0.9111832,0.002495122,0.0002964062,0.001871723,0.0001264763,0.0002776037,0.01028915],"genre_scores_gemma":[0.9224893,0.00001040785,0.07357886,0.0001382757,0.0001138962,0.0002539169,0.000003119243,0.0000475606,0.003364612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8493028,"threshold_uncertainty_score":0.4310266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4379010621","doi":"10.1002/malq.202200021","title":"Cofinal types on ω<sub>2</sub>","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"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":"Science Fund of the Republic of Serbia","keywords":"Successor cardinal; Mathematics; Cofinality; Class (philosophy); Simple (philosophy); Type (biology); Discrete mathematics; Countable set; Uncountable set; Computer science; Artificial intelligence; Mathematical analysis; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.04692441027446455,"gpt":0.3196051752839065,"spread":0.272680765009442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000743238,0.0002496673,0.0004170919,0.0001276932,0.0001631464,0.00002449085,0.0002513617,0.0001968211,0.0003963181],"category_scores_gemma":[0.0006134385,0.0001897382,0.0001404045,0.0002729651,0.0002294792,0.00007172184,0.00002934196,0.0003017457,0.0111585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003022003,"about_ca_system_score_gemma":0.00001757211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.450946e-7,"about_ca_topic_score_gemma":0.000001474012,"domain_scores_codex":[0.9983159,0.0001761394,0.0003970733,0.000332241,0.0002783499,0.0005003124],"domain_scores_gemma":[0.9970502,0.002215859,0.00009765068,0.0004746966,0.00004055269,0.0001210979],"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.00006166145,0.0001917488,0.0000029876,0.0001025661,0.00003126278,0.0001003779,0.0007500946,0.00000391605,0.001699466,0.9865311,0.003692781,0.006832039],"study_design_scores_gemma":[0.0002932472,0.0007833809,0.0000407914,0.00005795512,0.00003090557,0.00003824107,0.0004297817,0.0005248837,0.002422885,0.9949318,0.0002198292,0.0002263319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8895639,0.00002334833,0.04991554,0.001895749,0.0003700524,0.0005257425,0.00002204318,0.001480969,0.05620264],"genre_scores_gemma":[0.9932807,0.000004709055,0.004476667,0.0004715963,0.0001582205,0.00007547371,0.00001173011,0.00004867082,0.001472252],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1037168,"threshold_uncertainty_score":0.9896114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1597965172","doi":"10.1002/malq.201300006","title":"Rado's Conjecture and Ascent Paths of Square Sequences","year":2014,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"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":"Successor cardinal; Mathematics; Conjecture; Continuation; Combinatorics; Square (algebra); Discrete mathematics; Geometry; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02219161329035662,"gpt":0.2966603637079248,"spread":0.2744687504175681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005717047,0.0002041744,0.0005204275,0.00004782795,0.00007908558,0.00001375227,0.0001707404,0.000180901,0.0003991378],"category_scores_gemma":[0.0004698217,0.0001413184,0.00008654158,0.00007009019,0.0004608456,0.0000677634,0.00002355841,0.0001906376,0.00004301055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001216826,"about_ca_system_score_gemma":0.00001173736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001519251,"about_ca_topic_score_gemma":0.000003046617,"domain_scores_codex":[0.9986395,0.0002152281,0.0004386832,0.000250486,0.0001859999,0.0002701204],"domain_scores_gemma":[0.9978911,0.001444848,0.000174013,0.0003458744,0.00004560703,0.00009859139],"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.00001810131,0.0001280753,0.00004765844,0.0003856799,0.00002803826,0.000006879677,0.002052506,5.396281e-7,0.000297265,0.991424,0.00009669354,0.005514565],"study_design_scores_gemma":[0.0003706568,0.0007275926,0.00006468331,0.00009384454,0.00004348994,0.00006651119,0.001075926,0.000322234,0.0003698571,0.9965295,0.0001710517,0.0001646752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6578243,0.000240872,0.3201498,0.00125126,0.0001632496,0.0005730013,0.0000233699,0.0002222201,0.01955187],"genre_scores_gemma":[0.9710555,0.000003849039,0.02855645,0.0001496841,0.00004982323,0.00001570546,0.000002755054,0.00001614621,0.0001501053],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3132311,"threshold_uncertainty_score":0.5762796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2919009353","doi":"10.1002/malq.201900058","title":"On universal modules with pure embeddings","year":2020,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Cofinality; Mathematics; Embedding; Lambda; Cardinality (data modeling); Injective function; Abelian group; Countable set; Limit (mathematics); Model theory; Pure mathematics; Discrete mathematics; Combinatorics; Uncountable set; Physics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03884149798080114,"gpt":0.2749829034115511,"spread":0.2361414054307499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003424481,0.0009007581,0.001392764,0.0001646808,0.0001486221,0.0002906937,0.0009549977,0.0005964913,0.0008913926],"category_scores_gemma":[0.0003150853,0.0006490828,0.0003878289,0.0001682666,0.0002855675,0.0001134649,0.0002298301,0.001466931,0.0009156611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001447445,"about_ca_system_score_gemma":0.00009395992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006618925,"about_ca_topic_score_gemma":0.000006448588,"domain_scores_codex":[0.9963153,0.0001451233,0.0007718795,0.00116559,0.0009214262,0.0006806538],"domain_scores_gemma":[0.9969273,0.0008503546,0.0004819747,0.001232446,0.0001291749,0.0003787356],"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.0001100148,0.0004945492,0.000003497551,0.001766525,0.0002110628,0.0002483377,0.003784755,0.00002529932,0.00005019145,0.9866124,0.005402984,0.001290345],"study_design_scores_gemma":[0.0006016368,0.001351078,0.00002716538,0.001069483,0.0002306638,0.00004438363,0.001034254,0.002990315,0.00009226339,0.9916235,0.0001296119,0.0008057051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6385562,0.00006968354,0.2686627,0.006241535,0.0004761584,0.002382939,0.0001463727,0.001823814,0.08164056],"genre_scores_gemma":[0.925405,0.000004948691,0.07213638,0.0005367979,0.0004264273,0.0001161022,0.00004634173,0.0001885995,0.001139422],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2868487,"threshold_uncertainty_score":0.9998623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015311986","doi":"10.1002/malq.200410029","title":"Excluded Middle versus Choice in a topos","year":2005,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"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":"Law of excluded middle; Topos theory; Epimorphism; Mathematics; Pure mathematics; Combinatorics; Linguistics; Philosophy; Literature","retraction":null,"screen_n_in":null,"score":{"opus":0.0467537969715069,"gpt":0.2796281315982171,"spread":0.2328743346267103,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003832631,0.0002122827,0.0003249718,0.0001006224,0.00007255135,0.0001660731,0.0009244409,0.0001246261,0.0002800688],"category_scores_gemma":[0.0001878315,0.0001639472,0.0001088752,0.0003375171,0.00006752146,0.0003795016,0.00008336613,0.0002093564,0.002555132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009027577,"about_ca_system_score_gemma":0.00003754118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001147615,"about_ca_topic_score_gemma":0.0000992022,"domain_scores_codex":[0.9982679,0.00009442812,0.0004004208,0.0004380158,0.0002834575,0.0005157342],"domain_scores_gemma":[0.998557,0.000548605,0.0000754925,0.0006135726,0.00004439156,0.0001609562],"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.0000178653,0.0005881857,0.00007212616,0.00005371272,0.00001269355,0.00003537982,0.005802648,0.000006782883,0.0001238114,0.9532784,0.0005726571,0.03943574],"study_design_scores_gemma":[0.005953605,0.002726265,0.003003236,0.0001948684,0.00002939942,0.00009508221,0.0006149742,0.1435019,0.0004595967,0.8286386,0.01353652,0.00124594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1753233,0.0003974103,0.4474587,0.004295517,0.0007738512,0.0007549286,0.000002065299,0.0008080438,0.3701861],"genre_scores_gemma":[0.951697,0.000001311747,0.04644483,0.0002980118,0.0002109418,0.00005078594,0.000001185437,0.00001078657,0.001285146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7763737,"threshold_uncertainty_score":0.9982215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2227441040","doi":"10.1002/malq.201600071","title":"Constructing quasiminimal structures","year":2017,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"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":"Outcome (game theory); Mathematics; Upper and lower bounds; Order (exchange); Epistemology; Mathematical economics; Pure mathematics; Computer science; Philosophy; Mathematical analysis; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.08272061478614534,"gpt":0.3740194328378,"spread":0.2912988180516547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008060572,0.0007081273,0.001430306,0.0001229473,0.0004216264,0.0002120893,0.001236117,0.001072967,0.001495984],"category_scores_gemma":[0.001835668,0.0005678601,0.0004266107,0.00003218741,0.001123849,0.000115532,0.0004063594,0.001693623,0.0002513723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053018,"about_ca_system_score_gemma":0.000110651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000350123,"about_ca_topic_score_gemma":0.000009861294,"domain_scores_codex":[0.9967678,0.0002891947,0.0009821572,0.0008360615,0.0004169761,0.0007078412],"domain_scores_gemma":[0.9949456,0.00182748,0.0009686392,0.001928976,0.0001249713,0.0002043288],"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.0000398978,0.0001141452,0.00001945409,0.0009105941,0.0001337098,0.0001097775,0.001517959,0.000001319084,0.00001348126,0.986352,0.0005554339,0.01023223],"study_design_scores_gemma":[0.000350225,0.0002141223,0.00001755911,0.0002746289,0.0001749515,0.0002006965,0.002044423,0.0003627085,0.00008123068,0.9955972,0.00007553971,0.0006066434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1970624,0.0003980492,0.4922788,0.002506758,0.003076218,0.002219769,0.0003099501,0.001519723,0.3006284],"genre_scores_gemma":[0.7796288,0.000003851987,0.2178462,0.000131254,0.0005810477,0.0001079244,0.00004026245,0.00009580726,0.001564782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5825665,"threshold_uncertainty_score":0.9996773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2997454689","doi":"10.1002/malq.202000005","title":"Turing invariant sets and the perfect set property","year":2020,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"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":"Countable set; Property (philosophy); Invariant (physics); Turing; Mathematics; Discrete mathematics; Equivalence (formal languages); Set (abstract data type); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04685334213629911,"gpt":0.2649848492308628,"spread":0.2181315070945637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001906523,0.0006185026,0.001103153,0.00007280444,0.0002318963,0.001181075,0.002607166,0.0003203161,0.00007066296],"category_scores_gemma":[0.0004321958,0.0002971582,0.0003136024,0.0002264609,0.0004988342,0.0001815827,0.002812969,0.001297307,0.0002612497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008336406,"about_ca_system_score_gemma":0.0001424202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004199713,"about_ca_topic_score_gemma":0.000004350308,"domain_scores_codex":[0.9956474,0.0008236776,0.0008329397,0.001425671,0.0006941372,0.0005762006],"domain_scores_gemma":[0.9961956,0.001279519,0.0002750392,0.001859441,0.0001089691,0.0002814158],"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.0000777063,0.0004531922,0.00002427476,0.003203693,0.0002631756,0.000350967,0.04303723,0.0001991866,0.00006279702,0.8722357,0.00129872,0.07879342],"study_design_scores_gemma":[0.0004342204,0.0002425314,0.0001290788,0.00009603121,0.00004077403,0.000127253,0.00009455116,0.3958348,0.000008697896,0.6026006,0.0000756795,0.0003157644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007071777,0.0002443626,0.9522954,0.03084662,0.0005398992,0.002228641,0.00001656029,0.0007280845,0.006028705],"genre_scores_gemma":[0.8347824,0.00001058922,0.1629033,0.001468324,0.0002971208,0.0003426097,0.000009972557,0.00004241223,0.0001432647],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8277107,"threshold_uncertainty_score":0.999948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060156489","doi":"10.1002/malq.200610011","title":"On the extender algebra being complete","year":2006,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"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":"Extender; Simple (philosophy); Mathematics; Algebra over a field; Pure mathematics; Chemistry; Philosophy; Organic chemistry; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.03827155897042094,"gpt":0.2903049598246213,"spread":0.2520334008542004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006045214,0.0002518276,0.0003570702,0.00004699137,0.0002927869,0.00003994264,0.0003385771,0.0001329333,0.002047107],"category_scores_gemma":[0.0003037176,0.0001443839,0.0001511252,0.0001066937,0.0003523223,0.00006461218,0.00002510019,0.0003352246,0.001325493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002989536,"about_ca_system_score_gemma":0.00000910738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001767309,"about_ca_topic_score_gemma":0.000003243491,"domain_scores_codex":[0.9983308,0.0002262579,0.0004494683,0.0002866716,0.0002713225,0.0004355117],"domain_scores_gemma":[0.9950674,0.004123519,0.0001201725,0.0005956692,0.00003696594,0.00005627624],"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.00001725633,0.0002312103,0.00000239651,0.00003548733,0.00001883875,0.00002528403,0.0004260248,0.000002194587,0.0001570863,0.9958371,0.002773611,0.0004735462],"study_design_scores_gemma":[0.000228804,0.0002491822,0.00004625849,0.00003840725,0.00002822758,0.00004387772,0.0004132974,0.0004005566,0.00007725844,0.9979925,0.0002908357,0.0001907496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2081529,0.00003775427,0.4508999,0.005586471,0.000196007,0.0007459092,0.0000130653,0.0004938282,0.3338742],"genre_scores_gemma":[0.9834154,3.071092e-7,0.01262916,0.001173635,0.0001355518,0.00006106978,0.000004535704,0.0000332961,0.002547088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7752625,"threshold_uncertainty_score":0.9994521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2980681923","doi":"10.1002/malq.201700049","title":"Degrees of categoricity of trees and the isomorphism problem","year":2019,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Mathematics; Isomorphism (crystallography); Rank (graph theory); Degree (music); Mathematical proof; Tree (set theory); Limit (mathematics); Combinatorics; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01003208806179799,"gpt":0.2137732375917868,"spread":0.2037411495299888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009716277,0.0001756802,0.0005844216,0.0000588579,0.00003926535,0.00005096086,0.0009044483,0.00007581761,0.0000653222],"category_scores_gemma":[0.00006444382,0.00009776032,0.0001265269,0.0002624734,0.0004603897,0.0001599885,0.0001852941,0.000133306,0.00004825451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001451455,"about_ca_system_score_gemma":0.00002958255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004656127,"about_ca_topic_score_gemma":0.00001017965,"domain_scores_codex":[0.9982527,0.0001962114,0.000587678,0.0003406979,0.0003828999,0.0002398126],"domain_scores_gemma":[0.9976501,0.001139148,0.0002415724,0.0007872028,0.0001197934,0.00006216756],"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.00001477247,0.0002335176,0.0004102795,0.0002111735,0.00002273057,0.000001679516,0.003708848,0.00004264803,0.0002757399,0.9848937,0.00003017622,0.01015474],"study_design_scores_gemma":[0.0008013927,0.0007464347,0.004315553,0.00003144817,0.00001551898,0.00003085103,0.0001972238,0.143444,0.0001436612,0.8501298,0.0000137669,0.0001303619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3227206,0.0001881335,0.6680623,0.001699702,0.0001189123,0.0009717682,0.000003688348,0.0001008011,0.006134174],"genre_scores_gemma":[0.9171669,0.000001772153,0.08266411,0.00003739451,0.00001408869,0.00001707679,3.771385e-7,0.000005438891,0.00009279791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5944464,"threshold_uncertainty_score":0.398655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388933863","doi":"10.1002/malq.202300017","title":"A dichotomy for T$T$‐convex fields with a monomial group","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"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":"Monomial; Mathematics; Regular polygon; Group (periodic table); Combinatorics; Pure mathematics; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04565042150443725,"gpt":0.3262218439188264,"spread":0.2805714224143891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005089394,0.0002347767,0.0004758538,0.00009034536,0.0001558509,0.00002885621,0.0002423121,0.0002087761,0.0003352483],"category_scores_gemma":[0.0002531046,0.0001621181,0.0001368481,0.0001829715,0.0002064849,0.0001024309,0.00002136079,0.0002007375,0.0004006033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002161945,"about_ca_system_score_gemma":0.00001843718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.684268e-7,"about_ca_topic_score_gemma":0.000007984162,"domain_scores_codex":[0.9985719,0.0000682846,0.0003711992,0.0003335908,0.000158784,0.0004961904],"domain_scores_gemma":[0.9971732,0.002156513,0.0001034486,0.0004075341,0.00004179179,0.0001174693],"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.0001815036,0.0001556311,0.00001111261,0.0002380654,0.00005846807,0.00003726937,0.001767413,0.000001978271,0.00005701207,0.9928696,0.0022348,0.00238718],"study_design_scores_gemma":[0.0009930682,0.001252393,0.0000253565,0.00004735737,0.00005619748,0.00003645245,0.00107502,0.00175678,0.00004514474,0.9937494,0.0007285478,0.0002342194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1811721,0.00001243128,0.8063717,0.001292183,0.0001453669,0.001156141,0.00002008687,0.0007272419,0.009102756],"genre_scores_gemma":[0.9098992,0.00000166931,0.0850343,0.0004409798,0.0002251453,0.0008861601,0.00002275767,0.00006435315,0.003425423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7287271,"threshold_uncertainty_score":0.6610986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024325951","doi":"10.1002/malq.200610049","title":"Local sentences and Mahlo cardinals","year":2007,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"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; Equivalence (formal languages); Axiom; Regular cardinal; Sentence; Consistency (knowledge bases); Combinatorics; Integer (computer science); Order (exchange); Discrete mathematics; Type (biology); Pure mathematics; Computer science; Artificial intelligence; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03542251275667117,"gpt":0.3315521679374453,"spread":0.2961296551807741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001186945,0.0002041874,0.0004124143,0.00006576044,0.0001291551,0.00002178958,0.0001520775,0.0001703841,0.0003647294],"category_scores_gemma":[0.0002281036,0.0001485958,0.00008744639,0.0000934202,0.000594247,0.00009744816,0.00002757431,0.0002137804,0.0001896584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002210389,"about_ca_system_score_gemma":0.00000907016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001677957,"about_ca_topic_score_gemma":0.000007329994,"domain_scores_codex":[0.9985522,0.0000843328,0.0004349256,0.0002790779,0.0002068243,0.0004426207],"domain_scores_gemma":[0.9977944,0.001625635,0.00009295403,0.0002829851,0.00004363324,0.000160389],"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.00003579159,0.0001058101,0.00004284509,0.0001036357,0.00002845263,0.00008820229,0.001265319,2.215913e-7,0.0001111856,0.985419,0.0002129618,0.01258653],"study_design_scores_gemma":[0.0002480306,0.0003267946,0.0001313618,0.00003728625,0.00003742596,0.0002459069,0.005245821,0.0001201706,0.0002386146,0.9929489,0.0002345949,0.0001850331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1561232,0.0001291158,0.812053,0.000424318,0.00009120951,0.000210433,0.000003290632,0.0001606172,0.03080477],"genre_scores_gemma":[0.9605717,0.000003368312,0.03814198,0.0002534629,0.00006931228,0.00001014747,0.00000124036,0.00001752363,0.000931287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8044485,"threshold_uncertainty_score":0.6059561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283221234","doi":"10.1002/malq.202100074","title":"κ‐Madness and definability","year":2022,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Uncountable set; Mathematics; Regular cardinal; Construct (python library); Pure mathematics; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03805984157657304,"gpt":0.3132345562557084,"spread":0.2751747146791353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008418437,0.0001561767,0.0003251605,0.00004313191,0.0003754519,0.00001465766,0.0001955006,0.00006033639,0.002280182],"category_scores_gemma":[0.0002879778,0.0001302311,0.00006841942,0.0001021765,0.0002722696,0.00006396036,0.00009708849,0.0003102862,0.00005735024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000454119,"about_ca_system_score_gemma":0.00001621846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.408215e-7,"about_ca_topic_score_gemma":0.000001003474,"domain_scores_codex":[0.9986163,0.0002843704,0.0003190213,0.0002900645,0.0002025512,0.0002876658],"domain_scores_gemma":[0.9983076,0.001124147,0.00008180486,0.0003783798,0.00002252361,0.00008548277],"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.00003024595,0.0002705676,0.00004641856,0.0000964705,0.00001232144,0.00002302438,0.001930746,8.695043e-7,0.0000415589,0.9945008,0.0002736057,0.002773355],"study_design_scores_gemma":[0.000272437,0.0004503061,0.00008915501,0.000004328047,0.00002336566,0.0001773428,0.002729986,0.0001856932,0.00001302457,0.9953535,0.0005421494,0.0001587037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8650885,0.0001320811,0.1015058,0.001725765,0.0001994527,0.0005713001,0.00002521965,0.0003534131,0.03039843],"genre_scores_gemma":[0.980963,6.38194e-7,0.01747815,0.0003021724,0.00002600447,0.0001534899,0.000002821296,0.00001823402,0.001055494],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1158745,"threshold_uncertainty_score":0.9986319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385222867","doi":"10.1002/malq.202200044","title":"Topological duality for orthomodular lattices","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Morphism; Topological space; Category of topological spaces; Pure mathematics; Class (philosophy); Duality (order theory); Discrete mathematics; Algebra over a field; Topological tensor product; Functional analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04756827024346589,"gpt":0.3164779773228596,"spread":0.2689097070793938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006497572,0.0001849904,0.0003256345,0.00006732393,0.0001775477,0.0001275308,0.0007406563,0.0001166744,0.00009361378],"category_scores_gemma":[0.0001744886,0.0001279618,0.0001602553,0.0004127415,0.0001106692,0.0002711362,0.00008929434,0.0001171791,0.001015143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001631376,"about_ca_system_score_gemma":0.00001625724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.558576e-7,"about_ca_topic_score_gemma":6.761155e-7,"domain_scores_codex":[0.998275,0.0000848876,0.0003645165,0.0004867145,0.0002627192,0.0005261088],"domain_scores_gemma":[0.9983433,0.0008079393,0.00008272889,0.0005702529,0.00005735092,0.0001383645],"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.000003804561,0.00008325425,0.00002677943,0.00005791663,0.00000874864,0.00002876922,0.0004777304,0.000008847873,0.0001020532,0.9868608,0.0003127939,0.01202855],"study_design_scores_gemma":[0.0002271087,0.0005469215,0.0007762685,0.000009935676,0.000006739107,0.0000175176,0.0001613834,0.02561864,0.00005628206,0.9713725,0.001013609,0.0001931284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0480605,0.00002595893,0.943981,0.003422772,0.0001864561,0.0003759742,0.000005348596,0.0009651307,0.002976895],"genre_scores_gemma":[0.8578392,0.000002090326,0.1404545,0.000682993,0.0001129728,0.0001710462,0.000008423594,0.00001154469,0.000717235],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8097787,"threshold_uncertainty_score":0.9997627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3118314718","doi":"10.1002/malq.202100008","title":"Pathological examples of structures with o‐minimal open core","year":2021,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"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":"Unary operation; Predicate (mathematical logic); Core (optical fiber); Mathematics; Graph; Combinatorics; Discrete mathematics; Computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.133466621430242,"gpt":0.3737410980388585,"spread":0.2402744766086165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007634538,0.0006227381,0.001887743,0.00008544102,0.0001171429,0.000123418,0.001421638,0.0008349104,0.002479766],"category_scores_gemma":[0.0006558485,0.0004036154,0.0002619903,0.0001204974,0.0009530536,0.0001077668,0.000858464,0.001093844,0.00002090474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004116152,"about_ca_system_score_gemma":0.0001559643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006141354,"about_ca_topic_score_gemma":0.0000171173,"domain_scores_codex":[0.9967316,0.0003868733,0.001056923,0.0008734228,0.0004367619,0.0005143848],"domain_scores_gemma":[0.9956236,0.00193514,0.000702346,0.001366623,0.0002128735,0.0001593467],"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.0002234541,0.0005899868,0.00005181278,0.001243058,0.0001788333,0.0003819184,0.003680473,0.00001032706,0.000236458,0.9918228,0.0001480935,0.001432772],"study_design_scores_gemma":[0.0005703726,0.001146953,0.0002809799,0.0004462379,0.0002071493,0.0002689766,0.004117495,0.00008517964,0.0002449404,0.9921194,0.00002000607,0.0004922905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8084425,0.0001960401,0.1714354,0.0002488654,0.0001906422,0.001497303,0.0001231854,0.0001949831,0.01767112],"genre_scores_gemma":[0.6846028,0.000004833953,0.3146441,0.0001134317,0.00007040163,0.0001392823,0.00006420632,0.00004998745,0.0003109051],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1432087,"threshold_uncertainty_score":0.9998416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1849716023","doi":"10.1002/malq.201400110","title":"Computable axiomatizability of elementary classes","year":2016,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Ultraproduct; Class (philosophy); Algebra over a field; New class; Calculus (dental)","retraction":null,"screen_n_in":null,"score":{"opus":0.01874614663021237,"gpt":0.2547314686027202,"spread":0.2359853219725078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006164,0.0002859,0.0006076487,0.0001061937,0.00007885105,0.00008341595,0.001426292,0.0001050016,0.0005170787],"category_scores_gemma":[0.0001613263,0.0001736312,0.0002005668,0.0003959277,0.0003083406,0.0004844189,0.000286706,0.0001026537,0.0003582927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001038395,"about_ca_system_score_gemma":0.00006456766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001166451,"about_ca_topic_score_gemma":0.000003132944,"domain_scores_codex":[0.997016,0.0002522788,0.0009281163,0.0006642925,0.0005987195,0.0005406543],"domain_scores_gemma":[0.9965896,0.001481039,0.0002285354,0.001333285,0.0001794813,0.0001880532],"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.00001202005,0.001368686,0.0009331083,0.000317716,0.0000545106,0.00001868204,0.0009718567,0.000009696126,0.003608087,0.7797338,0.0006869429,0.2122849],"study_design_scores_gemma":[0.0005164616,0.00102885,0.001948998,0.00007340356,0.00001183547,0.00003716739,0.00007606643,0.02416246,0.001371256,0.9702901,0.0001992172,0.0002841696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0795188,0.00003173028,0.9139115,0.002203702,0.0001966711,0.0003984042,0.00001015389,0.0003279675,0.003401109],"genre_scores_gemma":[0.7380913,0.000001000079,0.2616261,0.0001269586,0.00004511687,0.00002590028,0.000001052766,0.000009936611,0.00007256204],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6585726,"threshold_uncertainty_score":0.7080475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2193617815","doi":"10.1002/malq.201500067","title":"The length of an intersection","year":2017,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Partially ordered set; Infimum and supremum; Cardinality (data modeling); Intersection (aeronautics); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02863614034928703,"gpt":0.2971078305421881,"spread":0.2684716901929011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006023753,0.0002437791,0.0003954859,0.00004798228,0.0002819089,0.0003908604,0.002709943,0.0002046479,0.00001729822],"category_scores_gemma":[0.0001070143,0.0001429628,0.0001808322,0.00004367436,0.000251293,0.0002720291,0.000419458,0.000486825,0.00008166518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003465911,"about_ca_system_score_gemma":0.00005042334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000538625,"about_ca_topic_score_gemma":0.000007622979,"domain_scores_codex":[0.998302,0.0001422176,0.0004701169,0.0004738674,0.000321933,0.0002898512],"domain_scores_gemma":[0.9968393,0.0002938894,0.0004845114,0.002191455,0.0000970853,0.00009379932],"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.000005897616,0.0001175052,0.000001457978,0.00009447269,0.00002395223,0.00001025525,0.001468243,0.00002008265,0.00004651507,0.8755946,0.0000472758,0.1225698],"study_design_scores_gemma":[0.00009058498,0.000526795,0.0001211993,0.00007988016,0.00001161335,0.00002154583,0.0001771914,0.03330586,0.00008408663,0.9653049,0.0001064206,0.0001699778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02693684,0.00009974531,0.9604813,0.0008213533,0.0008282629,0.0003426966,0.000003412371,0.0001842787,0.01030208],"genre_scores_gemma":[0.9571694,0.000006889814,0.04234494,0.0000513818,0.0001199863,0.00005457929,0.000003230354,0.00001136813,0.0002382267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9302325,"threshold_uncertainty_score":0.5829853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385224119","doi":"10.1002/malq.202200059","title":"Avoiding Medvedev reductions inside a linear order","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Mathematics; Lift (data mining); Order (exchange); Interval (graph theory); Construct (python library); Discrete mathematics; Combinatorics; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04155128374394942,"gpt":0.290644978695253,"spread":0.2490936949513036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00145439,0.0002846818,0.0004174263,0.0002442108,0.0004243123,0.0002415222,0.00109999,0.0001401767,0.0001784571],"category_scores_gemma":[0.0007871516,0.0002329156,0.0001605062,0.001910347,0.0001561863,0.000386305,0.000277637,0.0004915294,0.004098755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007459452,"about_ca_system_score_gemma":0.00008170371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008761089,"about_ca_topic_score_gemma":0.000003423743,"domain_scores_codex":[0.9971189,0.0003117171,0.0006083733,0.0007329657,0.0005550433,0.0006730389],"domain_scores_gemma":[0.997368,0.001070671,0.0001045805,0.001040015,0.000183453,0.0002332328],"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.000004941034,0.0005562037,0.00001996091,0.0001586593,0.00005899304,0.0002139847,0.01097755,0.0004927929,0.0009808941,0.9114922,0.003020658,0.07202319],"study_design_scores_gemma":[0.0001810537,0.0002732618,0.0001890952,0.00003192452,0.000009561374,0.0001518746,0.0005800764,0.3077619,0.0000990122,0.6897785,0.0006710491,0.000272705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03067426,0.0000275447,0.9532799,0.006126516,0.000625744,0.0003990486,0.000003146864,0.002030799,0.006833015],"genre_scores_gemma":[0.6051207,0.000004571812,0.3925908,0.0004347661,0.0003843064,0.0001425024,0.000008342062,0.00003744725,0.001276648],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5744464,"threshold_uncertainty_score":0.9966767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402522828","doi":"10.1002/malq.202400030","title":"Effectiveness of Walker's cancellation theorem","year":2024,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Mathematical economics; Calculus (dental); Discrete mathematics; Mathematics education; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.01013767552384534,"gpt":0.2465455377087764,"spread":0.2364078621849311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003074761,0.00008501898,0.0001484888,0.00004954011,0.00001552242,0.00002324823,0.0001220744,0.00004562435,0.0001979409],"category_scores_gemma":[0.00001187371,0.00006509447,0.00005781792,0.0001357828,0.00004019519,0.00004116725,0.00000722305,0.00008994617,0.0001329683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002630143,"about_ca_system_score_gemma":0.000007807119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001890843,"about_ca_topic_score_gemma":0.000001015707,"domain_scores_codex":[0.9995006,0.00005142164,0.0001863487,0.0000804205,0.00007876437,0.0001024775],"domain_scores_gemma":[0.9992306,0.0004441235,0.000009380793,0.0002674716,0.0000183631,0.00003009572],"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.000007292357,0.00005641935,0.000006110562,0.002341311,0.00005595124,0.00000484052,0.0008875845,0.0005527412,0.01623638,0.9620544,0.0002538716,0.01754308],"study_design_scores_gemma":[0.0001254928,0.0001604803,0.000310963,0.0006018937,0.0000335905,0.00001047001,0.00008725259,0.1930934,0.004581041,0.799656,0.001170241,0.0001691803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4254571,0.003308589,0.4249893,0.0001397891,0.0004703082,0.0005074996,0.00003913888,0.0007634349,0.1443248],"genre_scores_gemma":[0.9982491,0.00001354459,0.001624738,0.000002156888,0.00001732382,0.00002350904,0.000006368725,0.00001514557,0.00004814603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5727919,"threshold_uncertainty_score":0.2654476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2947754331","doi":"10.1002/malq.201900041","title":"Concrete barriers to quantifier elimination in finite dimensional C*‐algebras","year":2019,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Quantifier elimination; Predicate (mathematical logic); Separable space; Mathematics; Quantifier (linguistics); Discrete mathematics; Pure mathematics; Algebra over a field; Combinatorics; Computer science; Programming language; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05546138578556566,"gpt":0.3568533353060465,"spread":0.3013919495204808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001884029,0.00076287,0.001440394,0.0005844713,0.0001166695,0.0003104268,0.0009680739,0.0007983266,0.002232177],"category_scores_gemma":[0.005723988,0.0006627495,0.0003117076,0.0004435477,0.0001876663,0.0002551753,0.0005623102,0.001711685,0.002405707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003905923,"about_ca_system_score_gemma":0.0004134358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001128362,"about_ca_topic_score_gemma":0.00001800985,"domain_scores_codex":[0.9942743,0.0005100789,0.001467388,0.001288256,0.001422548,0.001037429],"domain_scores_gemma":[0.9935327,0.003494396,0.0003022676,0.00160504,0.0003513483,0.0007142615],"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.0002059996,0.0001578086,0.0001238204,0.002347367,0.0001216532,0.0001837294,0.006281497,0.0009100022,0.001056205,0.9851443,0.002454025,0.001013663],"study_design_scores_gemma":[0.000731066,0.000618705,0.0001476239,0.0008977259,0.00004916047,0.00001346223,0.0008908989,0.01717463,0.000225655,0.978275,0.0001191527,0.0008568947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8495898,0.0001004957,0.1339362,0.003491266,0.0008581805,0.005182333,0.0001818221,0.00038014,0.0062798],"genre_scores_gemma":[0.9223822,0.000002856179,0.0731748,0.0006968392,0.0001490591,0.0006289419,0.00007380039,0.0001673214,0.002724122],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07279246,"threshold_uncertainty_score":0.9995824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166403219","doi":"10.1002/malq.200310061","title":"On existence of complete sets for bounded reducibilities","year":2003,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Recursively enumerable language; Oracle; Mathematics; Hierarchy; Set (abstract data type); Bounded function; Combinatorics; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06315396646092529,"gpt":0.2998707246096498,"spread":0.2367167581487245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001144301,0.0002641701,0.0005561361,0.00009143884,0.0001224659,0.0001281546,0.0009387247,0.00009866047,0.00009643911],"category_scores_gemma":[0.0007101974,0.0002092788,0.0002245112,0.0002569718,0.0002909181,0.0001752596,0.00005358829,0.0001358688,0.00009717073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006803092,"about_ca_system_score_gemma":0.00007172885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003219712,"about_ca_topic_score_gemma":0.000001530985,"domain_scores_codex":[0.9974492,0.0002196788,0.0006906147,0.0007034935,0.000450271,0.0004867702],"domain_scores_gemma":[0.9960225,0.002129165,0.0001800828,0.001341395,0.0001879786,0.0001389292],"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.000008881711,0.0003981317,0.000003577771,0.0001866962,0.00001251097,0.000003307271,0.001642758,0.0000119637,0.0001452999,0.9931144,0.000156744,0.00431571],"study_design_scores_gemma":[0.0003998046,0.002058636,0.0000646843,0.00004749935,0.000008118805,0.00003389421,0.0002282476,0.03280985,0.0003461594,0.9635549,0.0002181926,0.0002299645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04885214,0.00003373249,0.9368914,0.0005767881,0.0002948846,0.0007995752,0.00001666547,0.0001959631,0.01233879],"genre_scores_gemma":[0.5916137,2.523948e-7,0.4079297,0.0001884767,0.00001761229,0.00007752651,0.000001838405,0.00001099897,0.0001598815],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5427616,"threshold_uncertainty_score":0.8534142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2777179981","doi":"10.1002/malq.201500022","title":"Supersimple structures with a dense independent subset","year":2017,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"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":"Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Triviality; Omega; Modulo; Predicate (mathematical logic); Mathematics; Rank (graph theory); Combinatorics; Type (biology); Discrete mathematics; Pure mathematics; Physics; Computer science; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.05767260280052555,"gpt":0.3393782905255882,"spread":0.2817056877250627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006734335,0.0007488213,0.001310715,0.0001315046,0.0003936009,0.0002018428,0.001189152,0.0009266026,0.001374153],"category_scores_gemma":[0.0004941027,0.0005130813,0.0002998452,0.00004153909,0.0007571618,0.0001220457,0.0003069444,0.00152112,0.0002260484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009844654,"about_ca_system_score_gemma":0.0001404633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001264136,"about_ca_topic_score_gemma":0.0000652503,"domain_scores_codex":[0.996842,0.0002688026,0.0006962823,0.0008737341,0.000584537,0.0007347019],"domain_scores_gemma":[0.9957994,0.0009998186,0.000571428,0.002232877,0.0001464121,0.0002500937],"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.0001823132,0.0002714776,0.00004596253,0.000949777,0.0002824081,0.0004240169,0.004017951,0.000009669651,0.00002357676,0.9916717,0.000993898,0.001127282],"study_design_scores_gemma":[0.0006482256,0.0005327443,0.0001084124,0.0002381135,0.000263439,0.0003380902,0.001204222,0.0001416821,0.00007055308,0.9956695,0.0001286745,0.0006563248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6776935,0.0002789608,0.2816682,0.001593412,0.0007301264,0.002454722,0.0002472388,0.0008379414,0.03449586],"genre_scores_gemma":[0.9383371,0.000005384494,0.05941768,0.0001680967,0.0002323535,0.000172027,0.00006041746,0.0001017061,0.001505192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2606436,"threshold_uncertainty_score":0.9997321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}