{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":26,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":26,"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":"e4d2c7d6479a","filters":{"venue":"Archive for Mathematical Logic"}},"results":[{"id":"W1987241097","doi":"10.1007/s00153-004-0249-8","title":"Weak theories of linear algebra","year":2004,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Algebra over a field; Linear algebra; Pure mathematics","authors":[{"name":"Neil Thapen","is_ca":false},{"name":"Michael Soltys","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01851687010511695,"gpt":0.2600622216944414,"spread":0.2415453515893244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002244586,0.001036033,0.001563695,0.004640671,0.003886816,0.009099012,0.001715543,0.001410721,0.02584518],"category_scores_gemma":[0.006445317,0.001273816,0.001149181,0.005668604,0.004546917,0.01432635,0.003525549,0.00689014,0.005757047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002722808,"about_ca_system_score_gemma":0.001355083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001378766,"about_ca_topic_score_gemma":0.001430749,"domain_scores_codex":[0.998569,0.0005006199,0.0001284269,0.0002248008,0.0004678487,0.0001093334],"domain_scores_gemma":[0.996034,0.001865571,0.0002260752,0.0007924577,0.000821239,0.0002607607],"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.00001708575,0.00001171134,0.00008461286,0.00004019841,0.000005743258,0.0000116641,0.0001197473,0.0001374805,0.000101855,0.9870272,0.006375492,0.006067123],"study_design_scores_gemma":[0.00000712915,0.000004637054,0.00007931377,0.00002158104,0.000009830601,0.00002352291,0.00004756519,0.0007175287,0.0001987994,0.9827291,0.01615505,0.000005835013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05277581,0.02230082,0.4522586,0.02998353,0.00442383,0.0001232062,0.003969811,0.002745088,0.4314193],"genre_scores_gemma":[0.685545,0.01113096,0.07544407,0.002519342,0.006107756,0.000294493,0.006114269,0.001301488,0.2115427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02584518,"threshold_uncertainty_score":0.08646071,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078212057","doi":"10.1007/s00153-013-0360-9","title":"Omitting types and AF algebras","year":2013,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; McMaster University; York University","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","authors":[{"name":"Kevin Carlson","is_ca":false},{"name":"Enoch Cheung","is_ca":false},{"name":"Ilijas Farah","is_ca":true},{"name":"Alexander Gerhardt-Bourke","is_ca":false},{"name":"Bradd Hart","is_ca":true},{"name":"Leanne Mezuman","is_ca":true},{"name":"Nigel Sequeira","is_ca":true},{"name":"Alexander Sherman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0568174547702114,"gpt":0.3454196293319866,"spread":0.2886021745617752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004832952,0.001237149,0.001720997,0.003894323,0.005525158,0.009052437,0.002862659,0.002469944,0.01345481],"category_scores_gemma":[0.01224921,0.001494326,0.002220438,0.004824002,0.007307512,0.03259176,0.004993281,0.01044732,0.002246518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002540775,"about_ca_system_score_gemma":0.001461344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001734313,"about_ca_topic_score_gemma":0.001579523,"domain_scores_codex":[0.9969301,0.001081036,0.0003288434,0.0005233087,0.0007376533,0.0003991402],"domain_scores_gemma":[0.9918545,0.004169574,0.0005513506,0.001578073,0.001381154,0.0004653024],"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.00001709604,0.000009007998,0.00008713546,0.00002558328,0.000003435635,0.00003002348,0.0001742408,0.00009061942,0.00007059238,0.9959207,0.001118955,0.002452646],"study_design_scores_gemma":[0.000003763812,0.000003152347,0.00002922706,0.00001027229,0.000005595152,0.00004688518,0.00004120677,0.0002937688,0.00008086374,0.9960527,0.003427574,0.000004828845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1161849,0.01122778,0.5945747,0.01636298,0.005341354,0.00007804803,0.001625701,0.001386795,0.2532179],"genre_scores_gemma":[0.8290295,0.005352831,0.07407159,0.001986905,0.004051336,0.0001279415,0.001803538,0.000863735,0.08271261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01345481,"threshold_uncertainty_score":0.04501086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055138800","doi":"10.1007/s00153-005-0282-2","title":"Quantified propositional calculus and a second-order theory for NC1","year":2005,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Mathematics; Proof complexity; Discrete mathematics; Propositional calculus; Order (exchange); Bounded function; Polynomial; Algebra over a field; Calculus (dental); Pure mathematics","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Tsuyoshi Morioka","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03004716016071145,"gpt":0.2795593172617327,"spread":0.2495121571010213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00283166,0.001029375,0.000973515,0.003271976,0.004611045,0.008566163,0.003028488,0.00204966,0.01151621],"category_scores_gemma":[0.005034073,0.0006895849,0.002221624,0.003527169,0.005166366,0.0110254,0.003063816,0.005613514,0.001537372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008336547,"about_ca_system_score_gemma":0.003799869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01332209,"about_ca_topic_score_gemma":0.01046722,"domain_scores_codex":[0.997391,0.0004966214,0.0001675075,0.0004797192,0.001055803,0.0004093231],"domain_scores_gemma":[0.9965938,0.001341635,0.0002206418,0.0006381591,0.0009746274,0.0002311587],"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.000003951858,0.00000563412,0.00002891626,0.000008391254,0.000001514029,0.0000127949,0.00004773514,0.0001655233,0.00005178735,0.9977696,0.0009179491,0.0009862019],"study_design_scores_gemma":[0.000007074499,0.000004235624,0.00008419796,0.00001434762,0.000009351012,0.00004369254,0.00003656087,0.004452365,0.0004362196,0.9797681,0.01512866,0.00001532495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03278414,0.002263471,0.67588,0.007452281,0.001928522,0.0001440097,0.00223623,0.001325393,0.2759859],"genre_scores_gemma":[0.6529591,0.001383152,0.2311103,0.002394811,0.001517229,0.0003130466,0.002613836,0.0007343036,0.1069743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01332209,"threshold_uncertainty_score":0.06048614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065234465","doi":"10.1007/s001530100135","title":"The modal logic of the countable random frame","year":2003,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Modal logic; Mathematics; Normal modal logic; Countable set; Intermediate logic; Accessibility relation; Discrete mathematics; Dynamic logic (digital electronics); Modal μ-calculus; Multimodal logic; Axiom; Frame (networking); S5; Modal; Algebra over a field; Pure mathematics; Theoretical computer science; Computer science; Description logic; Geometry","authors":[{"name":"Valentin Goranko","is_ca":false},{"name":"Bruce M. Kapron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01990583602813409,"gpt":0.2509302216620011,"spread":0.231024385633867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003412283,0.0007033793,0.001532761,0.00290474,0.003222524,0.006861448,0.002243322,0.002228508,0.0087773],"category_scores_gemma":[0.008120467,0.0007573478,0.001812163,0.002685182,0.006518632,0.01424338,0.003166346,0.003934679,0.001399486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002887235,"about_ca_system_score_gemma":0.001390053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002596785,"about_ca_topic_score_gemma":0.002014742,"domain_scores_codex":[0.9979091,0.0008880297,0.0001324629,0.0004322632,0.0004490203,0.0001889975],"domain_scores_gemma":[0.9961707,0.00193686,0.000339403,0.0008084467,0.0004722239,0.0002722669],"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.000006197452,0.000002150415,0.00001303158,0.000007689147,0.000002321426,0.000007856579,0.0000347373,0.0001809189,0.0000572926,0.9984151,0.0003346264,0.0009380265],"study_design_scores_gemma":[0.000006386325,0.000003577508,0.00002449932,0.000008265102,0.000004739641,0.00001701136,0.00001873758,0.002497558,0.00009051165,0.9949222,0.002400347,0.000006194658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0627359,0.007011144,0.7742977,0.01137685,0.0005217873,0.00008910895,0.001205303,0.0007703321,0.141992],"genre_scores_gemma":[0.8393527,0.003723379,0.1191304,0.001396424,0.00156594,0.0002702712,0.001316559,0.0003160254,0.03292835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0087773,"threshold_uncertainty_score":0.02936298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1529889279","doi":"10.1007/s00153-017-0545-8","title":"Equimorphy: the case of chains","year":2017,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Corollary; Isomorphism (crystallography); Mathematics; Chain (unit); Class (philosophy); Algebra over a field; Pure mathematics; Combinatorics; Discrete mathematics; Computer science; Crystal structure; Crystallography; Artificial intelligence","authors":[{"name":"C. Laflamme","is_ca":true},{"name":"M. Pouzet","is_ca":true},{"name":"R. Woodrow","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0625853413362719,"gpt":0.3267031561761004,"spread":0.2641178148398285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003316056,0.0005931298,0.0011834,0.00254095,0.005428979,0.008809981,0.002062436,0.00383613,0.03039886],"category_scores_gemma":[0.01950196,0.001016022,0.001111483,0.00453667,0.01040213,0.02548042,0.007011547,0.00484409,0.002079901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002101278,"about_ca_system_score_gemma":0.001405018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002993505,"about_ca_topic_score_gemma":0.001943937,"domain_scores_codex":[0.9969964,0.0009577089,0.0002140447,0.0007556852,0.0006011309,0.0004750482],"domain_scores_gemma":[0.9846949,0.008677321,0.001162066,0.002948258,0.001418045,0.001099386],"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.000009065325,0.000003629322,0.00006832287,0.000008377918,0.000001686742,0.00003638973,0.0001103063,0.0002406537,0.00002721828,0.9980904,0.0002659141,0.001137937],"study_design_scores_gemma":[0.00000368021,0.000001823846,0.00001661837,0.00001037616,0.000001991531,0.00003134835,0.00006752956,0.001515727,0.00004561015,0.9963961,0.001906549,0.000002724238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1481034,0.002749587,0.5414215,0.009087377,0.0004321488,0.0001155407,0.0006545145,0.0004100819,0.2970258],"genre_scores_gemma":[0.8725178,0.001622233,0.08597805,0.0009764771,0.0004239417,0.0002152844,0.0005129451,0.000345419,0.03740786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03039886,"threshold_uncertainty_score":0.1016943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129037541","doi":"10.1007/s00153-013-0329-8","title":"Some Calkin algebras have outer automorphisms","year":2013,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Automorphism; Bounded function; Quotient; Algebra over a field; Hilbert space; Pure mathematics; Automorphisms of the symmetric and alternating groups; Quotient algebra; Algebra representation; Mathematical analysis","authors":[{"name":"Ilijas Farah","is_ca":true},{"name":"Paul McKenney","is_ca":false},{"name":"Ernest Schimmerling","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06555588191477935,"gpt":0.3462418801488727,"spread":0.2806859982340934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321457,0.001369654,0.001023251,0.002595471,0.004739937,0.004854782,0.001140869,0.00150613,0.01130166],"category_scores_gemma":[0.003187457,0.0008730216,0.001965487,0.002201378,0.005942858,0.009162087,0.003329547,0.005206376,0.001970309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0019076,"about_ca_system_score_gemma":0.0009742113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001202385,"about_ca_topic_score_gemma":0.001212253,"domain_scores_codex":[0.9988313,0.0002332284,0.00005741189,0.0002244038,0.0003132063,0.0003404734],"domain_scores_gemma":[0.9975501,0.0008244693,0.0003044714,0.000365753,0.0004442682,0.0005109537],"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.00003771797,0.00001402904,0.0001041785,0.00001317166,0.000004999677,0.00004500301,0.0001958695,0.0001326866,0.0004733396,0.9973783,0.0005080219,0.00109254],"study_design_scores_gemma":[0.00001533766,0.00001217109,0.0001225104,0.000005225891,0.00001110174,0.00007058083,0.0000991254,0.0006819729,0.0006171138,0.9955127,0.002837979,0.00001411448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5353379,0.0009948094,0.1856266,0.003695531,0.0009220397,0.0001437867,0.0007443684,0.00104061,0.2714943],"genre_scores_gemma":[0.9252216,0.0004194357,0.0149633,0.0007529199,0.0005703405,0.00007746241,0.000467978,0.0003931064,0.05713385],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01130166,"threshold_uncertainty_score":0.03780782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041614410","doi":"10.1007/s00153-014-0367-x","title":"Coverings by open cells","year":2014,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Open set; Bounded function; Set (abstract data type); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Mathematical analysis; Programming language","authors":[{"name":"Mário J. Edmundo","is_ca":false},{"name":"Pantelis E. Eleftheriou","is_ca":true},{"name":"Luca Prelli","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04367142137469054,"gpt":0.3437346931547347,"spread":0.3000632717800442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004532015,0.0006874294,0.0008860079,0.002193749,0.002775994,0.004811782,0.0007820436,0.001126711,0.01489293],"category_scores_gemma":[0.002661421,0.0006581173,0.001224987,0.001658067,0.002722353,0.005158505,0.004729026,0.002619705,0.001854901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001123838,"about_ca_system_score_gemma":0.0004021161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00131874,"about_ca_topic_score_gemma":0.0009432884,"domain_scores_codex":[0.9989936,0.0001541768,0.00005939298,0.0002104511,0.0003088827,0.0002734777],"domain_scores_gemma":[0.9981347,0.0007139093,0.0001856138,0.0002869126,0.0003104331,0.0003683708],"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.00002981319,0.00001009506,0.0001762527,0.00001961124,0.000008086768,0.00009359311,0.0003145624,0.0004014523,0.0006363508,0.9929803,0.001133133,0.00419677],"study_design_scores_gemma":[0.00001662288,0.00001553342,0.0003069215,0.00001591745,0.0000167045,0.0002496477,0.0003723124,0.002244495,0.0008910496,0.982094,0.01376546,0.00001130247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4202034,0.002119892,0.2127961,0.002495036,0.001149169,0.0001151367,0.0009538765,0.0007244626,0.359443],"genre_scores_gemma":[0.9001412,0.001049281,0.02036494,0.0004163786,0.000447726,0.0001101743,0.0008734128,0.0002949994,0.07630183],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01489293,"threshold_uncertainty_score":0.04982185,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977405062","doi":"10.1007/s00153-003-0205-z","title":"Matrix identities and the pigeonhole principle","year":2004,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Pigeonhole principle; Mathematical proof; Mathematics; Bounded function; Matrix (chemical analysis); Algebra over a field; Discrete mathematics; Pure mathematics; Calculus (dental); Mathematical analysis","authors":[{"name":"Michael Soltys","is_ca":true},{"name":"Alasdair Urquhart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01728469457103503,"gpt":0.2881806004346795,"spread":0.2708959058636444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001637287,0.0005877541,0.0009006251,0.001830838,0.002473222,0.004118852,0.001556616,0.001578793,0.01529733],"category_scores_gemma":[0.005872141,0.0006580376,0.00125927,0.001333868,0.005989104,0.009088004,0.003610746,0.004041297,0.002233048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001579042,"about_ca_system_score_gemma":0.0008159871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001090727,"about_ca_topic_score_gemma":0.001020186,"domain_scores_codex":[0.9988989,0.0003430081,0.00005247616,0.0002143096,0.0003701454,0.0001211821],"domain_scores_gemma":[0.9975868,0.001239587,0.0001465851,0.0005278909,0.0003431224,0.0001559728],"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.000005765814,0.00000293895,0.00001601734,0.000007278086,0.00000155046,0.000008241876,0.00003524072,0.0002726967,0.00007708168,0.9969929,0.0008464616,0.001733793],"study_design_scores_gemma":[0.000002988013,0.000002888006,0.00001298106,0.000003814885,0.000001091082,0.00001337479,0.000009884052,0.001284156,0.00007970935,0.9965372,0.002049061,0.000002854264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05514959,0.002709639,0.7336447,0.007736352,0.001135864,0.00007313902,0.0004845662,0.0005957243,0.1984705],"genre_scores_gemma":[0.786861,0.002386389,0.1494762,0.001624317,0.001182108,0.0001990596,0.0005566512,0.0005906507,0.05712356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01529733,"threshold_uncertainty_score":0.05117464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089558857","doi":"10.1007/s00153-006-0019-x","title":"Model completeness for trivial, uncountably categorical theories of Morley rank 1","year":2006,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Categorical variable; Completeness (order theory); Rank (graph theory); Model theory; Discrete mathematics; Combinatorics; Statistics; Mathematical analysis","authors":[{"name":"Alfred Dolich","is_ca":true},{"name":"M. Laskowski","is_ca":false},{"name":"Alexander Raichev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07484549101937951,"gpt":0.3438388893421886,"spread":0.2689933983228091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005442655,0.001087078,0.002957765,0.002937439,0.006644863,0.008755695,0.003354674,0.00316117,0.009932521],"category_scores_gemma":[0.01359511,0.001628926,0.003474418,0.003049154,0.007593488,0.02792979,0.007152426,0.009760012,0.001181606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003987342,"about_ca_system_score_gemma":0.002860601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003666937,"about_ca_topic_score_gemma":0.005388057,"domain_scores_codex":[0.9942848,0.001887721,0.0004239884,0.001095886,0.001488002,0.0008195491],"domain_scores_gemma":[0.9796658,0.01352832,0.001033884,0.002917505,0.001934572,0.0009198496],"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.00004263823,0.00003586146,0.0004131731,0.00008204864,0.00002793535,0.00004284146,0.0004928035,0.0007245026,0.0002168367,0.9947441,0.001506378,0.001671034],"study_design_scores_gemma":[0.00001292856,0.000007588257,0.0001256076,0.000009768861,0.00001365574,0.00003280534,0.00009680918,0.002136421,0.0001916067,0.9962909,0.001071363,0.00001046344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4055452,0.005113536,0.3895688,0.01887261,0.0005045782,0.0002031346,0.004198594,0.002001482,0.1739921],"genre_scores_gemma":[0.9546229,0.0008390932,0.02651126,0.001206723,0.0004426706,0.0001741453,0.002422364,0.0002657983,0.01351505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009932521,"threshold_uncertainty_score":0.03322756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087110253","doi":"10.1007/s00153-013-0332-0","title":"Easton’s theorem in the presence of Woodin cardinals","year":2013,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Cofinality; Mathematics; Lambda; Combinatorics; Extension (predicate logic); Forcing (mathematics); Function (biology); Regular cardinal; Class (philosophy); Discrete mathematics; Physics; Uncountable set; Countable set; Biology; Mathematical analysis","authors":[{"name":"Brent Cody","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05662482139716313,"gpt":0.3354682710249315,"spread":0.2788434496277684,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001794844,0.0005740211,0.0007113632,0.001948671,0.002528431,0.003143248,0.0008688942,0.001152005,0.00909749],"category_scores_gemma":[0.003501042,0.0005662555,0.0009982451,0.001223582,0.004445287,0.01320842,0.003095291,0.003475994,0.0006076298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086418,"about_ca_system_score_gemma":0.0005072133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001561221,"about_ca_topic_score_gemma":0.00180816,"domain_scores_codex":[0.9991428,0.0002340905,0.0000610051,0.0002393917,0.0001484942,0.000174207],"domain_scores_gemma":[0.9976774,0.001498751,0.0001519042,0.0002586554,0.0002317409,0.0001816033],"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.00001128399,0.000004231299,0.00009513967,0.000008942851,0.000002568061,0.00003829756,0.0001110557,0.00008235512,0.000115765,0.9980637,0.0005749915,0.0008916197],"study_design_scores_gemma":[0.000009265012,0.000006427835,0.0002344658,0.00001229127,0.000009019953,0.00007895647,0.00012877,0.0008916497,0.0002599595,0.9914163,0.006946556,0.000006436546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.2269633,0.005281955,0.1922781,0.01028424,0.001256297,0.00004812594,0.0004444998,0.0002228441,0.5632206],"genre_scores_gemma":[0.9144322,0.001578871,0.02186997,0.001028836,0.0006409431,0.00005800716,0.0002162776,0.0001199766,0.0600548],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.00909749,"threshold_uncertainty_score":0.03043413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023176173","doi":"10.1007/s00153-003-0200-4","title":"Imaginaries in Hilbert spaces","year":2004,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Hilbert space; Algebra over a field; Pure mathematics; Linguistics; Discrete mathematics","authors":[{"name":"Itay Ben-Yaacov","is_ca":true},{"name":"Alexander Berenstein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05991727397275735,"gpt":0.3734748531109319,"spread":0.3135575791381746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002730493,0.0007463521,0.001007055,0.00315925,0.004118215,0.009896182,0.001329763,0.003241402,0.01550087],"category_scores_gemma":[0.005611556,0.0007435526,0.001159205,0.00257157,0.01049529,0.01910425,0.002642948,0.006643731,0.001351622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003777367,"about_ca_system_score_gemma":0.0009680455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001476847,"about_ca_topic_score_gemma":0.001210952,"domain_scores_codex":[0.9986432,0.0007284782,0.00008387616,0.0001640832,0.0002460335,0.0001342604],"domain_scores_gemma":[0.9967284,0.00206732,0.0002065298,0.0003933315,0.0003675141,0.000236904],"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.00000223604,0.000001752732,0.000007718329,0.000006472368,8.401686e-7,0.00000638224,0.0001173527,0.00003193811,0.0000212277,0.9990287,0.0004776279,0.0002976698],"study_design_scores_gemma":[0.000003710156,0.00000172047,0.00001639002,0.000005987269,0.000001419455,0.00001347002,0.00006697872,0.0001972927,0.00003150068,0.9950911,0.004568135,0.000002167899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.07552161,0.02736763,0.1921264,0.04733329,0.003160043,0.00006775498,0.0009464227,0.0005789472,0.6528978],"genre_scores_gemma":[0.897024,0.005940136,0.02467656,0.00186794,0.002957109,0.0001323105,0.0006011376,0.0002705628,0.06653018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01550087,"threshold_uncertainty_score":0.05185556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2953488600","doi":"10.1007/s00153-019-00683-w","title":"Fields with a dense-codense linearly independent multiplicative subgroup","year":2019,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Ministry of Education and Science of the Republic of Kazakhstan; Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Algebraically closed field; Mathematics; Multiplicative function; NIP; Multiplicative group; Field (mathematics); Pure mathematics; Group (periodic table); General linear group; Discrete mathematics; Combinatorics; Algebra over a field; Mathematical analysis; Symmetric group","authors":[{"name":"Alexander Berenstein","is_ca":false},{"name":"Evgueni Vassiliev","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0322526313498849,"gpt":0.3096191633750647,"spread":0.2773665320251798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001650283,0.001410996,0.001437464,0.002558504,0.003162697,0.003845182,0.001331664,0.0012646,0.009761947],"category_scores_gemma":[0.002933634,0.000961413,0.001374763,0.001785492,0.005357268,0.007502013,0.005265034,0.004255809,0.002414515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00163509,"about_ca_system_score_gemma":0.001198272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006353677,"about_ca_topic_score_gemma":0.0006751145,"domain_scores_codex":[0.9981647,0.0003636394,0.0001234076,0.0003965938,0.0005043074,0.0004473787],"domain_scores_gemma":[0.9971334,0.0009605212,0.000284997,0.0006103703,0.0005005889,0.0005100968],"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.0000963542,0.0000288924,0.0001519334,0.00002481003,0.00001102828,0.0001048462,0.000238929,0.0001052916,0.001259067,0.994354,0.0009476529,0.002677108],"study_design_scores_gemma":[0.00006639109,0.00005703698,0.0002704403,0.00001262161,0.00002210487,0.0004763028,0.0001456229,0.0009019974,0.002659885,0.9883099,0.007054824,0.000022911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4919256,0.001091275,0.2310199,0.005467398,0.001228698,0.0002523648,0.001598239,0.00107584,0.2663406],"genre_scores_gemma":[0.912594,0.0004204928,0.02735438,0.0007359239,0.001073236,0.0001545746,0.0009237978,0.0001995734,0.05654413],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009761947,"threshold_uncertainty_score":0.03265703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087377736","doi":"10.1007/s001530100095","title":"On the distribution of Lachlan nonsplitting bases","year":2002,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Degree (music); Base (topology); Recursively enumerable language; Bounding overwatch; Hierarchy; Combinatorics; Distribution (mathematics); Computer science; Mathematical analysis; Physics; Artificial intelligence","authors":[{"name":"S. Barry Cooper","is_ca":false},{"name":"Angsheng Li","is_ca":false},{"name":"Xiaoding Yi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04930155187970691,"gpt":0.2544212250325528,"spread":0.2051196731528459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004678582,0.0006035604,0.001106953,0.004309582,0.004527233,0.006598928,0.003656853,0.001485688,0.01171556],"category_scores_gemma":[0.033676,0.0008009257,0.0006163715,0.004493386,0.005081558,0.01080118,0.003541741,0.003996826,0.001620213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004062479,"about_ca_system_score_gemma":0.001821331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002235072,"about_ca_topic_score_gemma":0.001766349,"domain_scores_codex":[0.9979622,0.0007105666,0.0000984469,0.0002915717,0.0005923021,0.000344772],"domain_scores_gemma":[0.9771741,0.01349017,0.001373681,0.003191298,0.003241491,0.001529226],"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.0000703495,0.00001750039,0.0002544448,0.00001332917,0.000003392838,0.00002272004,0.0001563868,0.001660966,0.0002217559,0.9902439,0.00132624,0.006009211],"study_design_scores_gemma":[0.00001296964,0.00001110735,0.00013584,0.00001588792,0.000003875339,0.00004378415,0.00006989691,0.0118787,0.0003427164,0.9854679,0.002007221,0.00001004856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3902909,0.002904148,0.5039808,0.00742264,0.0003137797,0.00009503782,0.001104127,0.0009485565,0.09294003],"genre_scores_gemma":[0.9347391,0.001549984,0.03431185,0.0005924714,0.0005931552,0.0001666791,0.001008245,0.0003801002,0.02665856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01171556,"threshold_uncertainty_score":0.03919244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052797720","doi":"10.1007/s00153-004-0224-4","title":"Hechler’s theorem for the null ideal","year":2004,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Countable set; Ideal (ethics); Forcing (mathematics); Null (SQL); Set (abstract data type); Set theory","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.06564812499668081,"gpt":0.3520433646781959,"spread":0.286395239681515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002675721,0.0006941004,0.0009196457,0.002692922,0.002497616,0.003200146,0.0009744359,0.001697131,0.01314194],"category_scores_gemma":[0.003929604,0.0005165509,0.00131892,0.00147353,0.007277221,0.01130973,0.00294465,0.005604049,0.002690707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001818917,"about_ca_system_score_gemma":0.0008857235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009729818,"about_ca_topic_score_gemma":0.0007165215,"domain_scores_codex":[0.998825,0.0002821196,0.0000755513,0.0003645869,0.0002810264,0.0001717102],"domain_scores_gemma":[0.9981884,0.0007972749,0.0001258223,0.0003041959,0.000442967,0.0001412577],"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.00001399551,0.000007333778,0.00005566704,0.00002223767,0.00000683187,0.00001974124,0.0001030854,0.00006929309,0.0002213109,0.9939675,0.002479041,0.003033931],"study_design_scores_gemma":[0.000009986788,0.000004729777,0.00007832193,0.000006425317,0.000004467007,0.00004816796,0.00002481191,0.0002160328,0.0002367142,0.9897669,0.009597124,0.000006286994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04188836,0.009435425,0.3108661,0.02012793,0.00421755,0.00009221918,0.0009526546,0.0005941211,0.6118256],"genre_scores_gemma":[0.7713424,0.006178682,0.08016217,0.006801043,0.004493207,0.0002482551,0.0009235161,0.0003978526,0.1294529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01314194,"threshold_uncertainty_score":0.04396415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084344766","doi":"10.1007/s00153-009-0136-4","title":"The equivalence of theories that characterize ALogTime","year":2009,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Word problem (mathematics education); Permutation (music); Equivalence (formal languages); Combinatorics; Equivalence relation; Discrete mathematics; Characterization (materials science); Algebra over a field; Pure mathematics; Arithmetic","authors":[{"name":"Phuong Nguyen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0286124315755724,"gpt":0.2647288471045348,"spread":0.2361164155289624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003550519,0.0007719395,0.001615881,0.003407611,0.004559824,0.009455827,0.002985641,0.002960062,0.01571176],"category_scores_gemma":[0.01859668,0.001145473,0.002628846,0.003199507,0.007861678,0.03023227,0.0052935,0.007923265,0.001917132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002402376,"about_ca_system_score_gemma":0.00181467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001477061,"about_ca_topic_score_gemma":0.001317842,"domain_scores_codex":[0.9942848,0.001529991,0.0005135675,0.001321928,0.001239749,0.001109921],"domain_scores_gemma":[0.9810311,0.01041022,0.001431994,0.003689968,0.002203525,0.001233125],"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.00008030273,0.00009959043,0.0004530884,0.00003512981,0.00001404625,0.00006883089,0.0007014306,0.0005441828,0.000393687,0.9906207,0.00119363,0.005795339],"study_design_scores_gemma":[0.00002606016,0.00002022538,0.0002340166,0.00001432534,0.00001456737,0.00007645435,0.0002568324,0.002163506,0.0005433623,0.9936463,0.002993006,0.00001134876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3063827,0.001579702,0.4993343,0.009704258,0.0009036163,0.0004201281,0.003794458,0.002538046,0.1753428],"genre_scores_gemma":[0.9434381,0.0003595627,0.04014208,0.001185462,0.0004821976,0.0002675929,0.002526687,0.0005014693,0.01109683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01571176,"threshold_uncertainty_score":0.05256104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131174171","doi":"10.1007/s00153-010-0219-2","title":"Relatively computably enumerable reals","year":2010,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Class (philosophy); Simple (philosophy); Real number; Set (abstract data type); Maximal set; Real line; Real analysis","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02261528776794679,"gpt":0.2756690841286623,"spread":0.2530537963607155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001634406,0.0008316237,0.001048059,0.003598744,0.002314714,0.008056338,0.001997576,0.001015524,0.02027747],"category_scores_gemma":[0.01041455,0.0007017456,0.0009783519,0.004516766,0.003214806,0.01237326,0.002281768,0.005091014,0.006462442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002133196,"about_ca_system_score_gemma":0.001148237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005012426,"about_ca_topic_score_gemma":0.0006414555,"domain_scores_codex":[0.9988006,0.0003208719,0.0001265365,0.0002726617,0.0003729614,0.0001063365],"domain_scores_gemma":[0.9932545,0.003347213,0.0005172351,0.001709614,0.0008425023,0.000329088],"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.00004794152,0.00002149505,0.0001722159,0.00007224698,0.000008555532,0.00002999338,0.0001634306,0.0005145755,0.0004000257,0.981062,0.00355233,0.01395518],"study_design_scores_gemma":[0.00001302348,0.00001132433,0.0001785963,0.00003857829,0.00001303473,0.0001251298,0.00006035221,0.002443764,0.0008170519,0.9753364,0.02095051,0.0000123346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1141611,0.009227965,0.6545346,0.007775073,0.001267868,0.0001543226,0.006410755,0.003160201,0.2033081],"genre_scores_gemma":[0.6964665,0.0047759,0.2001171,0.0009438551,0.001423388,0.0003243586,0.006106352,0.0007916437,0.08905093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02027747,"threshold_uncertainty_score":0.06783491,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950898230","doi":"10.1007/s00153-023-00874-6","title":"On the non-existence of $$\\kappa $$-mad families","year":2023,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Kappa; Mathematics; Construct (python library); Regular cardinal; Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Computer science; Geometry; Programming language","authors":[{"name":"Haim Horowitz","is_ca":true},{"name":"Saharon Shelah","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08170340628202306,"gpt":0.3518667465763465,"spread":0.2701633402943234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004538893,0.0004293656,0.001365808,0.001805275,0.004906062,0.004578263,0.002069751,0.002007392,0.01174967],"category_scores_gemma":[0.02272967,0.0009524853,0.00121186,0.001361074,0.006875405,0.01104317,0.005720008,0.005018818,0.0008012204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002321965,"about_ca_system_score_gemma":0.0008590807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001458388,"about_ca_topic_score_gemma":0.001347463,"domain_scores_codex":[0.9982103,0.0005952612,0.00009872583,0.0003673739,0.000346567,0.0003817432],"domain_scores_gemma":[0.9738617,0.01932509,0.001407634,0.001974356,0.001883248,0.001547948],"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.00004564452,0.000007832717,0.0003411803,0.00002542931,0.000007517593,0.00006292699,0.0001760605,0.0003692412,0.00024708,0.996262,0.001083256,0.001371767],"study_design_scores_gemma":[0.00001610551,0.000009329069,0.0003653643,0.00002020014,0.000009823173,0.0001499668,0.0002599796,0.004511172,0.0002633657,0.9921888,0.002193334,0.00001254546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5381038,0.002561853,0.1670756,0.01758989,0.0007924082,0.00005918768,0.0006742542,0.0003707813,0.2727721],"genre_scores_gemma":[0.973713,0.0005523302,0.01060008,0.000786976,0.0002606621,0.00007104838,0.000229438,0.00009944433,0.0136869],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01174967,"threshold_uncertainty_score":0.03930652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970610329","doi":"10.1007/s00153-009-0144-4","title":"Property $${(\\hbar)}$$ and cellularity of complete Boolean algebras","year":2009,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Subsequence; Mathematics; Combinatorics; Boolean algebra; Sequence (biology); Discrete mathematics","authors":[{"name":"Miloš S. Kurilić","is_ca":false},{"name":"Stevo Todorčević","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07276729089638911,"gpt":0.3218469085121767,"spread":0.2490796176157876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009596733,0.0004231957,0.0008960693,0.00126247,0.002632741,0.003992,0.001322643,0.0008992948,0.007457043],"category_scores_gemma":[0.003831036,0.0005706917,0.001002214,0.001332401,0.00399445,0.004272563,0.002222571,0.001820769,0.0008174571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001043579,"about_ca_system_score_gemma":0.0007980304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002370913,"about_ca_topic_score_gemma":0.002364937,"domain_scores_codex":[0.9990661,0.0002029508,0.00008468044,0.0002810974,0.0001441592,0.0002211392],"domain_scores_gemma":[0.9964266,0.001701341,0.0003556568,0.0004839475,0.0006817513,0.0003507608],"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.000040687,0.0000110671,0.0002815575,0.00002258717,0.000009294736,0.00003613521,0.0002027134,0.0003453036,0.0009694458,0.9951321,0.0004684959,0.002480599],"study_design_scores_gemma":[0.00002296046,0.00001995652,0.0004230912,0.00001179734,0.00001969571,0.0001335492,0.0001907455,0.002776176,0.001607933,0.9903133,0.004461353,0.00001943902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6143355,0.0006395432,0.2980464,0.002126815,0.0002277397,0.0001028777,0.001349165,0.0004510251,0.08272085],"genre_scores_gemma":[0.9712749,0.0002177488,0.01782723,0.0002985264,0.0001414855,0.0001395638,0.0006478639,0.00009189076,0.00936074],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007457043,"threshold_uncertainty_score":0.02494633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3207065630","doi":"10.1007/s00153-021-00793-4","title":"Definable groups in dense pairs of geometric structures","year":2021,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Ministry of Education and Science of the Republic of Kazakhstan; Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Mathematics; Combinatorics; Predicate (mathematical logic); Dimension (graph theory); Group (periodic table); NIP; Discrete mathematics; Physics","authors":[{"name":"Alexander Berenstein","is_ca":false},{"name":"Evgueni Vassiliev","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04857405823965345,"gpt":0.3193030494266547,"spread":0.2707289911870012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001686831,0.001394147,0.001634649,0.003785474,0.003453169,0.005613948,0.001986879,0.001581529,0.0116946],"category_scores_gemma":[0.002718938,0.001444272,0.00147353,0.002519339,0.006015938,0.01484968,0.007282032,0.00516663,0.001197037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001630379,"about_ca_system_score_gemma":0.0005395742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00064462,"about_ca_topic_score_gemma":0.0008523129,"domain_scores_codex":[0.998082,0.0005534489,0.0001249058,0.0005570693,0.0003663412,0.0003161563],"domain_scores_gemma":[0.9975405,0.001162732,0.0002603151,0.0003114656,0.0002815021,0.0004435172],"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.00002154255,0.00001705899,0.0001012088,0.00002224714,0.000005339787,0.00005007512,0.0004961803,0.00009834751,0.0002020502,0.9974245,0.0003267943,0.001234725],"study_design_scores_gemma":[0.00002346808,0.00002255023,0.000140593,0.00001361552,0.00001152442,0.0001175403,0.0003882549,0.0006885019,0.0003716994,0.9951804,0.003035552,0.000006332712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3974291,0.001897151,0.4031329,0.003128122,0.0008083111,0.0003056686,0.001438463,0.0008346626,0.1910257],"genre_scores_gemma":[0.9211205,0.0005608789,0.04639909,0.0005083272,0.0003393938,0.0002773123,0.001525808,0.0001858535,0.02908284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0116946,"threshold_uncertainty_score":0.03912234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066080230","doi":"10.1007/s00153-008-0112-4","title":"Linear orders with distinguished function symbol","year":2008,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Automorphism; Rational number; Symbol (formal); Categorical variable; Function (biology); Algebra over a field; Discrete mathematics; Fixed point; Automorphism group; Arithmetic; Pure mathematics; Mathematical analysis; Computer science","authors":[{"name":"Douglas Cenzer","is_ca":false},{"name":"Barbara F. Csima","is_ca":true},{"name":"Bakhadyr Khoussainov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03192420173380044,"gpt":0.2463704260378365,"spread":0.214446224304036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001217915,0.0008895937,0.001090544,0.003603433,0.002889551,0.007332019,0.001689562,0.001168462,0.04136549],"category_scores_gemma":[0.004412796,0.001067717,0.000992615,0.006947798,0.002866195,0.009242667,0.002005797,0.005423958,0.01768558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002769223,"about_ca_system_score_gemma":0.002197392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001771494,"about_ca_topic_score_gemma":0.002097543,"domain_scores_codex":[0.9989834,0.0002169348,0.000116573,0.0001575171,0.0003815121,0.0001439503],"domain_scores_gemma":[0.995817,0.00162064,0.0002312397,0.001340249,0.0007150209,0.0002758836],"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.00007568688,0.00003618911,0.0001541701,0.0001119016,0.000007174118,0.00006054488,0.0002529722,0.0006378591,0.0004532784,0.9472879,0.02261442,0.02830797],"study_design_scores_gemma":[0.00002176402,0.00001786906,0.0001401073,0.00005057377,0.00001260878,0.0001517512,0.00009005257,0.002328972,0.001648698,0.8837249,0.1117861,0.00002666746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04296223,0.00532681,0.6254683,0.007964205,0.003092417,0.000180409,0.01557062,0.01045231,0.2889827],"genre_scores_gemma":[0.4872372,0.005963665,0.2213333,0.001775512,0.002302802,0.0003733807,0.01883499,0.003787408,0.2583918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04136549,"threshold_uncertainty_score":0.1383813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4417424742","doi":"10.1007/s00153-025-01003-1","title":"Limits on forcing axioms at $$\\omega _2$$ compatible with the continuum hypothesis","year":2025,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Forcing (mathematics); Axiom; Axiom of choice; Generalization; Limit (mathematics); Zermelo–Fraenkel set theory; Continuum hypothesis; Constructive set theory; Axiom independence","authors":[{"name":"Stevo Todorčević","is_ca":true},{"name":"Shihao Xiong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05672658853150693,"gpt":0.3179612707031239,"spread":0.2612346821716169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004688313,0.0007269706,0.001058848,0.002671133,0.004644063,0.005339514,0.0018421,0.002988944,0.01452386],"category_scores_gemma":[0.0123632,0.001114281,0.002533382,0.001402888,0.007362563,0.01554936,0.006419754,0.007777526,0.001723645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001968731,"about_ca_system_score_gemma":0.001714815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001107527,"about_ca_topic_score_gemma":0.001438169,"domain_scores_codex":[0.9954469,0.001367618,0.0003519238,0.001031223,0.001080938,0.0007214259],"domain_scores_gemma":[0.9868664,0.007788052,0.0007557482,0.0016668,0.001889143,0.001033904],"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.0000176374,0.00001092446,0.00009821005,0.00001355926,0.000006090634,0.0000694277,0.0001259821,0.0001480621,0.000312618,0.9978577,0.0004487743,0.0008908634],"study_design_scores_gemma":[0.0000114401,0.000007438641,0.0001251358,0.000009647022,0.000005361957,0.00008125347,0.00007247221,0.0007118715,0.0003578535,0.9965911,0.002016869,0.000009481405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1794872,0.0009797018,0.4664934,0.00882653,0.001436699,0.0001351685,0.001018535,0.0009938944,0.3406288],"genre_scores_gemma":[0.8992696,0.0005365803,0.06385335,0.002151707,0.001084258,0.0003185807,0.0007853308,0.0005060805,0.0314945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01452386,"threshold_uncertainty_score":0.04858714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391817173","doi":"10.1007/s00153-024-00907-8","title":"The second-order version of Morley’s theorem on the number of countable models does not require large cardinals","year":2024,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Countable set; Order (exchange); Discrete mathematics; Regular cardinal; Combinatorics; Algebra over a field; Pure mathematics","authors":[{"name":"Franklin D. Tall","is_ca":true},{"name":"Jing Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04312370273887596,"gpt":0.3405124272735469,"spread":0.297388724534671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005101166,0.001413828,0.003700367,0.003083339,0.004543765,0.006816794,0.003721992,0.003318932,0.01674454],"category_scores_gemma":[0.02221168,0.00194729,0.005704063,0.002404016,0.009262909,0.03821809,0.00740552,0.01402387,0.002472217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002908486,"about_ca_system_score_gemma":0.001616236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001716782,"about_ca_topic_score_gemma":0.002509891,"domain_scores_codex":[0.9938944,0.0008586046,0.0004762823,0.00252005,0.001368592,0.0008820653],"domain_scores_gemma":[0.966155,0.02011071,0.001487474,0.007124496,0.003244282,0.001878035],"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.00005650072,0.00002172231,0.0004767726,0.000074864,0.00002355676,0.00007482374,0.0001646762,0.0006048094,0.0005224519,0.9921221,0.002599397,0.003258391],"study_design_scores_gemma":[0.00002012408,0.00001144506,0.0002759664,0.00001227124,0.00001384745,0.0001368009,0.00003942031,0.002588995,0.0004104775,0.9932862,0.003187599,0.00001691715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1139303,0.002037041,0.6357509,0.02018364,0.001735266,0.0001147874,0.001942271,0.001065847,0.22324],"genre_scores_gemma":[0.864504,0.00110476,0.07691767,0.004860224,0.002609468,0.0004012588,0.00124258,0.0006839789,0.04767606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01674454,"threshold_uncertainty_score":0.05601603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408568635","doi":"10.1007/s00153-025-00971-8","title":"Siblings of direct sums of chains","year":2025,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Algebra over a field; Chain (unit); Combinatorics; Discrete mathematics; Arithmetic; Pure mathematics","authors":[{"name":"Davoud Abdi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05107347960088803,"gpt":0.3586310636584284,"spread":0.3075575840575404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007249439,0.0005268013,0.0009642963,0.00227113,0.002312743,0.003326474,0.001174586,0.001235918,0.01987743],"category_scores_gemma":[0.004986169,0.0009662731,0.0009400294,0.002356589,0.002136118,0.00664268,0.003216922,0.002064734,0.002215424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008337648,"about_ca_system_score_gemma":0.0006378763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001136221,"about_ca_topic_score_gemma":0.001937689,"domain_scores_codex":[0.9989943,0.000201816,0.00008283959,0.0002709021,0.0002969892,0.0001531328],"domain_scores_gemma":[0.9958935,0.001900059,0.000413006,0.0004314515,0.0006459949,0.0007160431],"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.00008372797,0.00003906716,0.001080542,0.00007945551,0.00002522813,0.0006002627,0.0007231648,0.0004387864,0.001547874,0.984891,0.001974288,0.00851654],"study_design_scores_gemma":[0.00001814055,0.00001711882,0.000408005,0.00002485594,0.00002288795,0.0003358011,0.0003012853,0.001381288,0.0007893849,0.9917767,0.004912699,0.00001184942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6694844,0.000814732,0.1673517,0.001100293,0.0004857551,0.0001749047,0.001822378,0.0005510997,0.1582147],"genre_scores_gemma":[0.9036319,0.0005230118,0.03784744,0.0003304559,0.0002327948,0.0001597287,0.001766901,0.0003929289,0.05511498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01987743,"threshold_uncertainty_score":0.06649667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064694271","doi":"10.1007/s00153-012-0321-8","title":"Intersection numbers of families of ideals","year":2013,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Intersection (aeronautics); Mathematics; Class (philosophy); Bounding overwatch; Intersection number; Combinatorics; Ideal (ethics); Discrete mathematics; Computer science; Geography; Geometry","authors":[{"name":"Michael Hrušák","is_ca":false},{"name":"Carlos Martínez-Ranero","is_ca":true},{"name":"Ulises Ariet Ramos-García","is_ca":false},{"name":"O. A. Téllez-Nieto","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04055925299918715,"gpt":0.332031948174687,"spread":0.2914726951754998,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003070327,0.0007491091,0.001057316,0.006197088,0.004840799,0.006456708,0.001793076,0.001092465,0.01456625],"category_scores_gemma":[0.007252986,0.001206298,0.001280803,0.003472469,0.004086905,0.0128784,0.003280075,0.003850353,0.001345327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002514241,"about_ca_system_score_gemma":0.0006326061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004136721,"about_ca_topic_score_gemma":0.0004112433,"domain_scores_codex":[0.9976884,0.0005733677,0.0001598688,0.0005136274,0.0006429221,0.0004217524],"domain_scores_gemma":[0.9925729,0.004193495,0.0007183429,0.0005404103,0.0009690608,0.001005795],"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.0001122993,0.00002090712,0.0007560408,0.0000457094,0.00001752933,0.00007224733,0.0004681048,0.0003340628,0.0005380218,0.9905431,0.001319167,0.00577285],"study_design_scores_gemma":[0.00002479958,0.00003550181,0.001074211,0.00004957043,0.00005134629,0.0004725118,0.0005014432,0.003002876,0.002141111,0.9839811,0.008638099,0.00002749061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.493445,0.002438081,0.2448607,0.002440117,0.0004278822,0.0001214889,0.001553619,0.0007557927,0.2539572],"genre_scores_gemma":[0.9386088,0.0007125603,0.03975845,0.0001585742,0.000255271,0.0001551821,0.001078165,0.0001614326,0.01911158],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01456625,"threshold_uncertainty_score":0.04872894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3176180624","doi":"10.1007/s00153-023-00865-7","title":"Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms","year":2023,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Automorphism; Equivalence (formal languages); Turing; Algebra over a field; Equivalence class (music); Real line; Congruence relation; Discrete mathematics; Pure mathematics; Computer science","authors":[{"name":"Iván Ongay-Valverde","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04916702238295074,"gpt":0.3255475253210538,"spread":0.2763805029381031,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003854161,0.0007547166,0.001345466,0.005292086,0.003486443,0.007595298,0.001712346,0.001813732,0.005869051],"category_scores_gemma":[0.01681546,0.0008786894,0.002221752,0.00486512,0.008103168,0.01511992,0.004659951,0.004909411,0.0006133883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003255151,"about_ca_system_score_gemma":0.001281853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001395483,"about_ca_topic_score_gemma":0.00126763,"domain_scores_codex":[0.9978556,0.0007778798,0.0002283034,0.0005305299,0.0004656964,0.0001420416],"domain_scores_gemma":[0.9812237,0.01429059,0.001013745,0.001509857,0.001135228,0.0008268426],"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.00001423167,0.00001434195,0.0001416451,0.00002917717,0.000004703938,0.00002942828,0.0002663732,0.0007776184,0.00009518783,0.9930012,0.0004516045,0.005174436],"study_design_scores_gemma":[0.000005532236,0.000005398931,0.00009793077,0.0000195356,0.000005530089,0.00004819468,0.0001003793,0.002974452,0.0001630213,0.9939067,0.00266613,0.000007159465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1655243,0.01216043,0.6968675,0.007976544,0.001118957,0.0001369172,0.0008996705,0.0006889388,0.1146268],"genre_scores_gemma":[0.7934127,0.005935651,0.170382,0.0007789932,0.001665445,0.0002172573,0.0006670002,0.0002992652,0.02664173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007595298,"threshold_uncertainty_score":0.0236178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024261644","doi":"10.1007/s001530100082","title":"Index sets and parametric reductions","year":2001,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Mathematics; Index (typography); Set (abstract data type); Degree (music); Computable function; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Computer science","authors":[{"name":"Rod Downey","is_ca":false},{"name":"Michael R. Fellows","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0375416402301425,"gpt":0.2921386216958838,"spread":0.2545969814657413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001657567,0.0009967639,0.00187682,0.00575821,0.003162312,0.00994558,0.002707464,0.001173895,0.06089911],"category_scores_gemma":[0.009251888,0.001073065,0.001381018,0.01076927,0.00255759,0.01193446,0.00375657,0.005563051,0.01596341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002853271,"about_ca_system_score_gemma":0.001437432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001060512,"about_ca_topic_score_gemma":0.001297755,"domain_scores_codex":[0.9979765,0.0003280475,0.0001988519,0.0003040677,0.001045271,0.0001473567],"domain_scores_gemma":[0.9952322,0.001867749,0.000260005,0.001711625,0.000700943,0.0002274388],"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.00006421617,0.00004945083,0.0001519554,0.0001487471,0.00001821027,0.00005265288,0.0001730782,0.001097671,0.0003843307,0.8946264,0.04538976,0.05784348],"study_design_scores_gemma":[0.00001368066,0.000009729876,0.0001534274,0.00006155567,0.0000189012,0.0001129485,0.00006146626,0.002774185,0.0008162633,0.8824814,0.1134786,0.00001781749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02116165,0.01077867,0.4000783,0.009471701,0.003851018,0.0001872907,0.009963,0.00680958,0.5376988],"genre_scores_gemma":[0.433789,0.01555266,0.1793061,0.002150307,0.004751625,0.0007242704,0.02700982,0.005819443,0.3308968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06089911,"threshold_uncertainty_score":0.2037278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}