{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001619171,0.00009173303,0.0001776591,0.00004774768,0.00006986206,0.0000197934,0.0004139798,0.00002366215,0.00001098077],"category_scores_gemma":[0.0001812148,0.0000660255,0.0001071537,0.0001073501,0.0001095086,0.0001132776,0.000142039,0.00005107448,0.00005691915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008829747,"about_ca_system_score_gemma":0.0000404424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002317694,"about_ca_topic_score_gemma":8.975789e-7,"domain_scores_codex":[0.9992675,0.00001953968,0.0002323751,0.0001765819,0.0001246578,0.0001793702],"domain_scores_gemma":[0.9991468,0.0004684463,0.00007372035,0.0002203158,0.00003260496,0.00005817223],"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.000006385952,0.00008623341,0.000001387369,0.00004617312,0.00000877312,7.368857e-7,0.0005393645,0.0001676177,0.0008348362,0.9944481,0.00002485287,0.003835576],"study_design_scores_gemma":[0.0003045809,0.0002034074,0.00008620178,0.00003055204,0.000005163363,0.000007896758,0.00001931416,0.01205115,0.004691528,0.9823829,0.0001375045,0.00007980865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01238173,0.00001912449,0.9804195,0.001005369,0.00006763933,0.0002042859,0.000007924848,0.00007687383,0.005817546],"genre_scores_gemma":[0.5963573,0.000001318666,0.403387,0.0001281355,0.000042907,0.00001923752,0.000003588532,0.000004627093,0.0000557914],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5839756,"threshold_uncertainty_score":0.2692442,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003556969,0.0001961954,0.0003468361,0.00007325057,0.0001693978,0.00008197179,0.0002208055,0.00006484993,0.0004963361],"category_scores_gemma":[0.003089102,0.0001404345,0.00008858703,0.00008880551,0.0002164313,0.0001652227,0.0001932541,0.0001925514,0.0004314414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001882245,"about_ca_system_score_gemma":0.0000199315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002340843,"about_ca_topic_score_gemma":0.000002250425,"domain_scores_codex":[0.9985657,0.00006614618,0.0003433354,0.0003165204,0.0002226623,0.0004856742],"domain_scores_gemma":[0.9956862,0.003677701,0.00006931495,0.0003092635,0.00006747671,0.0001899909],"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.00001039981,0.00009199647,0.00005327348,0.0002935439,0.00003273164,0.000002219442,0.0003483805,5.550123e-7,0.002279513,0.9922355,0.001396401,0.003255468],"study_design_scores_gemma":[0.0003599653,0.0001509348,0.0001308878,0.00005309225,0.00002067152,0.0000196597,0.0001816098,0.003925328,0.0009315828,0.9937461,0.0003000416,0.0001801408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5165806,0.0001820247,0.4476305,0.002118044,0.00006934031,0.003547118,0.00003466099,0.0003548837,0.02948283],"genre_scores_gemma":[0.3558663,0.000010898,0.6418244,0.0002414299,0.0001141041,0.0005599152,0.00000755828,0.00006650445,0.00130887],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.194194,"threshold_uncertainty_score":0.5726751,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799466,0.0001395196,0.000218796,0.00004838946,0.0001794373,0.0001119884,0.0003061103,0.00005268086,0.00004731604],"category_scores_gemma":[0.0002290315,0.00009545188,0.0001035277,0.00006557645,0.0001276272,0.0001383942,0.0001083469,0.00006725236,0.00006129629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001248593,"about_ca_system_score_gemma":0.00003139089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.556763e-7,"about_ca_topic_score_gemma":0.000006352918,"domain_scores_codex":[0.9988964,0.00007040137,0.0002516136,0.0003367249,0.0001298698,0.0003149766],"domain_scores_gemma":[0.9984682,0.001051321,0.00007274305,0.000238278,0.00006951833,0.00009997773],"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.00002165404,0.0001231818,0.000002629277,0.0001744445,0.00002413209,0.000001141977,0.0006836473,0.000002918723,0.000296016,0.987543,0.0004213304,0.0107059],"study_design_scores_gemma":[0.0004508712,0.0002387464,0.00002544072,0.000006631834,0.00001224238,0.00004383261,0.00003115587,0.05210231,0.0003464101,0.9362997,0.01030039,0.0001422627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006571823,0.00009631412,0.9908378,0.0008001291,0.00007451336,0.001031788,0.00001462408,0.0001023926,0.006385235],"genre_scores_gemma":[0.581198,0.000001358916,0.4160505,0.0005214494,0.0001600694,0.0004592112,0.00001968334,0.00001351373,0.001576208],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5805409,"threshold_uncertainty_score":0.3892415,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009051163,0.0001617735,0.0002850198,0.00002177732,0.0004186859,0.00009290365,0.001273983,0.00005656531,0.00003211945],"category_scores_gemma":[0.001626435,0.00007052078,0.0002590962,0.000180152,0.000347086,0.00008476125,0.0002232489,0.00016454,0.00007141618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001772015,"about_ca_system_score_gemma":0.0000754936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000218125,"about_ca_topic_score_gemma":0.000004876358,"domain_scores_codex":[0.9985275,0.0002002538,0.0003277315,0.0002626859,0.0002645369,0.0004172904],"domain_scores_gemma":[0.9960111,0.00297535,0.0001484105,0.000710626,0.00008176819,0.00007274837],"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.00001331566,0.0001007806,0.00003031031,0.00003662956,0.00001817336,6.004764e-7,0.0004249516,0.00002888648,0.0002093774,0.9980042,0.0008036905,0.000329093],"study_design_scores_gemma":[0.0006268804,0.0001138339,0.00009336951,0.00002307757,0.00001545941,0.0000199818,0.00004664235,0.01976703,0.0009483649,0.9723929,0.005846492,0.0001059643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001599742,0.0002446151,0.8975235,0.0006111604,0.0002417499,0.0006558993,0.000007242307,0.00005177343,0.09906432],"genre_scores_gemma":[0.9074643,0.00002929116,0.08953313,0.0005221873,0.00005732693,0.0001756188,0.000001434832,0.00001597724,0.002200781],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9058645,"threshold_uncertainty_score":0.3220236,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007897872,0.0001565794,0.0002967124,0.00003913567,0.0005378071,0.000159278,0.002195036,0.00003816878,0.00002144843],"category_scores_gemma":[0.001118841,0.00009156892,0.0002151544,0.00005487961,0.0005220607,0.0001604134,0.001175412,0.0001282155,0.00005267337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001424291,"about_ca_system_score_gemma":0.00003589714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002111933,"about_ca_topic_score_gemma":0.00002481545,"domain_scores_codex":[0.9987366,0.00007997959,0.0003282002,0.0003553195,0.0001601677,0.0003397035],"domain_scores_gemma":[0.9959587,0.001791977,0.0002292898,0.001866988,0.00005905951,0.00009401206],"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.000004229724,0.0001400084,0.00001688147,0.00006846323,0.00001684839,0.00008736445,0.0005685628,0.0000161558,0.0001257021,0.9836498,0.0001527615,0.01515314],"study_design_scores_gemma":[0.000182543,0.0001707823,0.0003355027,0.00001393194,0.000009868501,0.0003290703,0.00002870866,0.2371787,0.0001912343,0.7613243,0.0001414526,0.00009382307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01465598,0.00002065541,0.9737133,0.00302406,0.0001569735,0.0006142801,0.00002727316,0.00006860268,0.00771885],"genre_scores_gemma":[0.7133479,0.000001250953,0.2862708,0.0001350841,0.00007176578,0.00006344167,0.000001324728,0.000007729864,0.0001006878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6986919,"threshold_uncertainty_score":0.4136432,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004631379,0.0003871318,0.0006420881,0.0001525415,0.0002212293,0.0001243546,0.0006173247,0.0001406668,0.001916489],"category_scores_gemma":[0.002228902,0.000281947,0.0002948853,0.0001109606,0.0003760929,0.0003752325,0.0003137085,0.0003900193,0.002609284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000078886,"about_ca_system_score_gemma":0.00005325461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006759589,"about_ca_topic_score_gemma":0.000004009987,"domain_scores_codex":[0.9971339,0.0001308589,0.0006701404,0.0005529116,0.0005418389,0.000970337],"domain_scores_gemma":[0.9952458,0.003322567,0.0001297811,0.0007591223,0.0001695111,0.000373175],"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.00001869289,0.0003149675,0.00001880317,0.0002959456,0.00006049004,0.00001630438,0.0004042315,0.000003231064,0.002455643,0.9837618,0.01159113,0.001058774],"study_design_scores_gemma":[0.0006967071,0.000285628,0.00007711142,0.00006374608,0.00003400792,0.00003777763,0.0001421935,0.007879844,0.002192744,0.9874016,0.0008215627,0.000367061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1268442,0.0001548454,0.8407355,0.005566978,0.0002675756,0.00794779,0.0002271205,0.0008979256,0.01735808],"genre_scores_gemma":[0.178669,0.00001212524,0.809998,0.001290124,0.0004920203,0.002611752,0.00005416745,0.0002006195,0.006672133],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05182482,"threshold_uncertainty_score":0.9999633,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171612,0.000180402,0.0004027731,0.00002747788,0.0001626386,0.00003360107,0.0005894821,0.00008086531,0.0004138371],"category_scores_gemma":[0.001206247,0.0001374732,0.0001101846,0.00004114947,0.0002278421,0.00009641349,0.000261847,0.000142037,0.0002700646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001314261,"about_ca_system_score_gemma":0.000009804677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.110904e-7,"about_ca_topic_score_gemma":0.000001253906,"domain_scores_codex":[0.9988496,0.0001038236,0.0003060287,0.000283747,0.0001011205,0.0003556793],"domain_scores_gemma":[0.9953067,0.004077783,0.0001120859,0.0003689812,0.00002460169,0.0001098558],"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.00005350645,0.0001726524,0.000001326702,0.0001302685,0.00002165977,7.967321e-7,0.0001874247,0.000002098342,0.003608699,0.9758297,0.01942553,0.0005663368],"study_design_scores_gemma":[0.0005506136,0.0002252694,0.000001323143,0.00002869509,0.00002989137,0.000007936424,0.00004714025,0.0009431562,0.005316187,0.9719488,0.0207164,0.0001845838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004164424,0.000008878931,0.9040683,0.0003897514,0.00006878635,0.0007457367,0.0000729029,0.00008993731,0.09039129],"genre_scores_gemma":[0.2057283,0.000007528996,0.7793182,0.00205396,0.00012323,0.0004160921,0.00005405089,0.00008827528,0.01221037],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2015638,"threshold_uncertainty_score":0.5605996,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003290017,0.00006898143,0.0001064248,0.00003944433,0.0001808323,0.000116978,0.0002457544,0.00001497442,0.000006725004],"category_scores_gemma":[0.0001829924,0.00004155275,0.00005971773,0.00008819613,0.0001236137,0.0001349788,0.0001505896,0.00004602178,0.00004066389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008290408,"about_ca_system_score_gemma":0.00002399067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001113911,"about_ca_topic_score_gemma":0.000001293558,"domain_scores_codex":[0.9994062,0.000028555,0.0001541174,0.0001519238,0.0001297726,0.0001293915],"domain_scores_gemma":[0.9992053,0.0005237085,0.00004118036,0.0001617389,0.0000293622,0.00003869085],"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.000007605072,0.00002502077,0.000001372735,0.0000263853,0.000006801399,7.865316e-7,0.000422955,0.001073043,0.00007183831,0.9977427,0.00004716259,0.0005743428],"study_design_scores_gemma":[0.0007071772,0.00005073543,0.0001390594,0.000009156813,0.000006299827,0.00002973001,0.00001488144,0.03534194,0.0002333054,0.962867,0.0005437029,0.00005706439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01116929,0.00009747954,0.9839668,0.002255168,0.00005856585,0.0003208152,0.000004031348,0.00004641656,0.002081381],"genre_scores_gemma":[0.5813611,0.00001220494,0.4172597,0.0004777217,0.00007388512,0.0001056667,0.000007515797,0.000005039049,0.0006971402],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5701919,"threshold_uncertainty_score":0.1694472,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006085361,0.0002626588,0.0007660094,0.00007949167,0.0001959927,0.00001110966,0.0003205146,0.0001263326,0.00006582186],"category_scores_gemma":[0.001127003,0.000193317,0.0003180132,0.00008351779,0.0006135305,0.00007755738,0.00007183435,0.000128956,0.000009623873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002555465,"about_ca_system_score_gemma":0.00004668555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004936281,"about_ca_topic_score_gemma":0.00001478014,"domain_scores_codex":[0.9982914,0.00008161132,0.0006855727,0.0003080299,0.0001772937,0.0004560844],"domain_scores_gemma":[0.9922254,0.006981171,0.0002311572,0.0003666121,0.0001318103,0.00006384996],"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.0003726387,0.0004499768,0.000008111415,0.0006083737,0.00004458029,0.000001445612,0.0002344892,0.0006392943,0.001667255,0.9947743,0.001079536,0.0001199371],"study_design_scores_gemma":[0.00123608,0.0002325481,0.000006294697,0.00002607928,0.0001205482,0.00001379969,0.0001442192,0.03959848,0.001341689,0.9568807,0.0001794994,0.0002201005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01175385,0.00004352915,0.9798571,0.0002226301,0.00006872445,0.001174639,0.0003637791,0.00009027834,0.006425478],"genre_scores_gemma":[0.6215141,0.000002985725,0.3770216,0.0000917412,0.0001005332,0.0003812528,0.00007771877,0.00004212851,0.0007679118],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6097603,"threshold_uncertainty_score":0.7883237,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009161749,0.0001479971,0.0003729362,0.00005959798,0.00006667453,0.000009710143,0.000463752,0.00006659296,0.0002913138],"category_scores_gemma":[0.002615108,0.00008296911,0.0001554776,0.00009433166,0.0004622042,0.00007933011,0.00007584526,0.000181543,0.00007449844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008694746,"about_ca_system_score_gemma":0.00001742758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003204608,"about_ca_topic_score_gemma":0.000004452136,"domain_scores_codex":[0.9986625,0.0002752185,0.0004004621,0.0001865832,0.0001615871,0.0003136925],"domain_scores_gemma":[0.990537,0.008832556,0.0001243519,0.000420425,0.00004450695,0.00004108381],"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.00002891609,0.0001907438,0.00003263975,0.0001740785,0.00001799187,0.000002124899,0.002312095,0.000008799334,0.0003934077,0.9955291,0.000732967,0.0005771435],"study_design_scores_gemma":[0.000266687,0.0001333447,0.0001858864,0.00006081453,0.00002248464,0.00001969536,0.001378095,0.0006738156,0.000438123,0.9966292,0.00009405326,0.00009778705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2807615,0.0001197437,0.6197113,0.002292241,0.00008897229,0.003523808,0.00006262726,0.00007907168,0.09336077],"genre_scores_gemma":[0.9158245,0.000004875384,0.0831767,0.000188584,0.00003199014,0.0003702961,0.000003785624,0.00001532323,0.0003838967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6350631,"threshold_uncertainty_score":0.3383382,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004191289,0.0002171642,0.0004070667,0.0001447487,0.0001049585,0.00005994245,0.0003343718,0.00005986825,0.0001277963],"category_scores_gemma":[0.002807269,0.0001652421,0.0001211085,0.000194919,0.0003182187,0.0001689762,0.0001490431,0.0002474652,0.0001709205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009374292,"about_ca_system_score_gemma":0.00007153337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006536342,"about_ca_topic_score_gemma":0.00004859012,"domain_scores_codex":[0.9983437,0.00005187674,0.0003896918,0.0003372094,0.0002936712,0.0005838304],"domain_scores_gemma":[0.9974533,0.001922116,0.00006102322,0.0003753518,0.00005829546,0.0001298912],"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.00004904045,0.0003291313,0.00006180603,0.0002714451,0.00001388638,0.00002337686,0.0008847605,0.0000408764,0.0009865768,0.9968984,0.0001953742,0.0002453198],"study_design_scores_gemma":[0.001019554,0.0001960677,0.00009908792,0.0001111856,0.0000109953,0.00002540297,0.0002694007,0.0002797374,0.001980387,0.9953924,0.0004111355,0.000204693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2043796,0.0001339021,0.7563938,0.008728293,0.0000826035,0.00260261,0.00006611193,0.0002692491,0.02734387],"genre_scores_gemma":[0.394208,0.000009708198,0.6045324,0.0002357695,0.00006250259,0.0004019638,0.00001133287,0.0000590407,0.0004793394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1898284,"threshold_uncertainty_score":0.6738375,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003535193,0.0002653622,0.0004887786,0.0000696494,0.0001159217,0.00001820993,0.0002996148,0.0001551467,0.000403453],"category_scores_gemma":[0.0006630028,0.0001782232,0.0001568676,0.0000802745,0.0002473853,0.00008707119,0.000102597,0.0003420294,0.000442422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002480644,"about_ca_system_score_gemma":0.00002898745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000013349,"about_ca_topic_score_gemma":0.00001501964,"domain_scores_codex":[0.9984721,0.00009998965,0.0003548403,0.0004215077,0.0002063558,0.0004452351],"domain_scores_gemma":[0.9947161,0.004371223,0.0001628359,0.0005468776,0.00008058555,0.0001223666],"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.0004479185,0.000293285,0.0001197974,0.0002291937,0.00008985829,0.00001431289,0.001490031,0.00001830036,0.0006358452,0.9962366,0.0001935002,0.000231314],"study_design_scores_gemma":[0.001200746,0.0007313861,0.0001503243,0.00007573175,0.00006149153,0.00007734037,0.0004130165,0.00192588,0.0008841495,0.9940017,0.0002118774,0.0002663735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3006189,0.0000191427,0.6837088,0.000294465,0.00005160556,0.001446615,0.00004433471,0.0001418461,0.01367429],"genre_scores_gemma":[0.7565974,0.000003323937,0.239287,0.000414957,0.00005488127,0.0002651454,0.0000182671,0.00004639618,0.003312697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4559785,"threshold_uncertainty_score":0.7267731,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005416168,0.0001345792,0.0002164422,0.00003045744,0.0001485897,0.00004545456,0.0007525911,0.00003030935,0.00009040651],"category_scores_gemma":[0.001558363,0.00007946198,0.0001597378,0.0001723875,0.0001662159,0.00006648246,0.0002510868,0.0001171897,0.00008758877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002199584,"about_ca_system_score_gemma":0.000007815424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001719793,"about_ca_topic_score_gemma":5.424713e-7,"domain_scores_codex":[0.9987499,0.0001194697,0.0003181264,0.0002936784,0.0002424041,0.0002764502],"domain_scores_gemma":[0.9932628,0.005927773,0.0001075512,0.0005867173,0.00005402003,0.0000611214],"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.000003004843,0.0002570406,0.00001562007,0.00005093364,0.000008027445,0.000001273632,0.0002436886,0.00007562017,0.00006220343,0.9933565,0.0007342103,0.005191837],"study_design_scores_gemma":[0.00008701863,0.0001889931,0.000199169,0.00002528364,0.000004859634,0.00000585117,0.00001198715,0.3646623,0.0002543289,0.6343668,0.0001284353,0.00006502101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01460152,0.00001594179,0.9768847,0.002605101,0.00005775184,0.0004701826,0.00004705855,0.00009232236,0.005225461],"genre_scores_gemma":[0.8932877,0.000001512654,0.1062702,0.0002623576,0.00003967633,0.00006434402,0.000008630343,0.000006359477,0.00005922517],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8786862,"threshold_uncertainty_score":0.3240365,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007773507,0.0002272653,0.0003648011,0.00003984928,0.0004136543,0.00001893344,0.0004364946,0.0001022348,0.0001309737],"category_scores_gemma":[0.002604752,0.0001291382,0.0003191282,0.00006041123,0.0005320811,0.00005614135,0.00008605807,0.0001961574,0.00009160637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003058702,"about_ca_system_score_gemma":0.00003735143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.6648e-7,"about_ca_topic_score_gemma":0.000006665409,"domain_scores_codex":[0.9986558,0.00005591721,0.000383115,0.0002817175,0.0001350019,0.0004884671],"domain_scores_gemma":[0.9886318,0.01064878,0.0001236729,0.0004587839,0.00005295021,0.00008395302],"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.0001657866,0.0001784153,7.352391e-7,0.00016441,0.00006718768,0.000002277518,0.0007272313,0.00005296979,0.0001811081,0.9968889,0.0007481171,0.0008228065],"study_design_scores_gemma":[0.001052143,0.0002755873,0.00000638434,0.00004214999,0.0001010308,0.00003886191,0.0003782996,0.0005740428,0.0007692977,0.9942744,0.002307302,0.0001804784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002102755,0.00008388441,0.9836845,0.00277129,0.0001271121,0.001675465,0.00009440335,0.0001418551,0.009318739],"genre_scores_gemma":[0.3114173,0.00001868738,0.6840199,0.001524695,0.0003342392,0.001273801,0.00002907712,0.00008561255,0.001296716],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3093145,"threshold_uncertainty_score":0.5266101,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006006666,0.0001238875,0.0002098244,0.00002707209,0.0001724999,0.00007870739,0.001140947,0.00002816257,0.0000158684],"category_scores_gemma":[0.0002775908,0.00006721191,0.0001347094,0.00008371836,0.0002366473,0.0001653233,0.0001561963,0.00007288333,0.00003348697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005483748,"about_ca_system_score_gemma":0.00001618431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.095955e-7,"about_ca_topic_score_gemma":1.212931e-7,"domain_scores_codex":[0.9989966,0.00006661223,0.0002408828,0.0002080065,0.0001865102,0.000301431],"domain_scores_gemma":[0.9971134,0.002125034,0.0001252066,0.000552037,0.00002930203,0.00005503781],"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.00001240045,0.00005569137,0.000002695058,0.00002219311,0.000007710444,0.000001293391,0.0003577301,6.171718e-7,0.004108279,0.9777141,0.00009095071,0.01762629],"study_design_scores_gemma":[0.0001143249,0.0002328303,0.000978505,0.00003850963,0.000005885836,0.00001367308,0.00003238772,0.008292907,0.003479473,0.9863716,0.0003480011,0.00009194428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008680558,0.0001023323,0.9814661,0.002641531,0.00007887293,0.0003156372,0.00001920697,0.0001127572,0.00658305],"genre_scores_gemma":[0.9248793,0.00002769186,0.07422457,0.0005923012,0.0000358253,0.00003058875,0.000003928363,0.000005776469,0.0002000447],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9161987,"threshold_uncertainty_score":0.2740822,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009497182,0.0002879701,0.0004755656,0.0001141446,0.0002731946,0.0001784623,0.00146064,0.0001137346,0.000121136],"category_scores_gemma":[0.0009938518,0.0002265081,0.0002414619,0.00028096,0.0002622216,0.0003054971,0.0006704709,0.0004812456,0.0004031487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000250113,"about_ca_system_score_gemma":0.00007392084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007341763,"about_ca_topic_score_gemma":0.000007440038,"domain_scores_codex":[0.9976324,0.0001202256,0.000524507,0.0007299366,0.0003517772,0.0006410809],"domain_scores_gemma":[0.9953856,0.003092763,0.0001544339,0.0009740979,0.000137019,0.0002560674],"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.000007186562,0.0002667378,0.00004652814,0.00006084103,0.00001924025,0.000007303927,0.0004827339,0.00006968232,0.00190197,0.9865479,0.0007558795,0.009833935],"study_design_scores_gemma":[0.0003049065,0.0002155041,0.0008078194,0.00001392402,0.000008803459,0.00005339367,0.000008236555,0.2098953,0.0003333129,0.7851205,0.003004924,0.0002333412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006724858,0.00001573164,0.9659612,0.001655948,0.0004048992,0.0008178067,0.00002417158,0.0004070286,0.02398838],"genre_scores_gemma":[0.1679451,0.000001465201,0.8310177,0.0003793083,0.0001384199,0.0001070149,0.00000936275,0.00001983131,0.0003817067],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2098256,"threshold_uncertainty_score":0.9236732,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006540263,0.0001599772,0.000340468,0.00007956321,0.0001684269,0.000005647494,0.0003641549,0.0000627956,0.0001496522],"category_scores_gemma":[0.003312942,0.00009086599,0.0001822367,0.0001703922,0.0005582096,0.00002890686,0.0001076569,0.0001647672,0.000332677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008144408,"about_ca_system_score_gemma":0.00001581686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.247067e-7,"about_ca_topic_score_gemma":0.00000144427,"domain_scores_codex":[0.9988948,0.00008215837,0.000333772,0.0002042978,0.0001680641,0.0003169735],"domain_scores_gemma":[0.9855901,0.01376381,0.0001229867,0.0004415438,0.00003622734,0.00004530734],"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.00005945411,0.0001040606,0.000003053653,0.0002231728,0.00003154359,0.000003670175,0.0009900852,0.00001488769,0.0005731119,0.9954737,0.002226062,0.0002971327],"study_design_scores_gemma":[0.0002047437,0.0002380501,0.00004219984,0.00008464449,0.00002609526,0.000004859864,0.0009080712,0.001825172,0.001399862,0.9949888,0.000171785,0.0001056928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3247448,0.00002042641,0.5204577,0.00278491,0.0002098749,0.002088415,0.0002125282,0.0003649383,0.1491164],"genre_scores_gemma":[0.9345963,0.00002436483,0.061469,0.0005075451,0.00006142497,0.0003345208,0.00001937928,0.00004511286,0.002942353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6098515,"threshold_uncertainty_score":0.4276,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003915472,0.0001782628,0.0004708392,0.00004936694,0.0001184518,0.000007256377,0.0001806295,0.00006747305,0.00009516085],"category_scores_gemma":[0.0008650754,0.0001091366,0.0001198986,0.00004682865,0.0004230603,0.00005570016,0.00006151146,0.0001593689,0.00001556409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007733307,"about_ca_system_score_gemma":0.00001280994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.171829e-7,"about_ca_topic_score_gemma":0.000001453216,"domain_scores_codex":[0.9988704,0.00009086782,0.0003921739,0.0002429856,0.0001149054,0.0002886384],"domain_scores_gemma":[0.9979804,0.001456446,0.0001309018,0.0002960038,0.00004116504,0.00009510785],"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.00008924672,0.0002625787,0.00001391771,0.0002595768,0.00002414956,0.00000482111,0.0003916138,7.741263e-7,0.003584039,0.993745,0.0002336475,0.001390586],"study_design_scores_gemma":[0.0004698985,0.0004820442,0.0001363607,0.00005457527,0.00005297472,0.00003613433,0.00008447614,0.0009922668,0.00149527,0.9956805,0.0003626062,0.0001529609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08276767,0.0001172218,0.8792522,0.00138706,0.00004475568,0.001342256,0.0001012404,0.0001457254,0.03484188],"genre_scores_gemma":[0.7115299,0.000007712887,0.2873993,0.0003347721,0.0000346563,0.00002492646,0.00001474704,0.00001703418,0.000636967],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6287622,"threshold_uncertainty_score":0.445046,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004077229,0.0001560903,0.0004891541,0.0001786473,0.00005927285,0.000005898592,0.0001724475,0.00009896124,0.0003596723],"category_scores_gemma":[0.004899822,0.0001251713,0.0001607393,0.0003232575,0.0002169479,0.00004854737,0.0001062286,0.0001759551,0.00001614857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002070127,"about_ca_system_score_gemma":0.0000384662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.420128e-7,"about_ca_topic_score_gemma":0.00001164051,"domain_scores_codex":[0.9986877,0.0001293457,0.0004571711,0.0002480359,0.0001332551,0.0003444646],"domain_scores_gemma":[0.9943396,0.005088899,0.0001234421,0.0003258503,0.0000623046,0.00005983512],"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.00005999139,0.0002601222,0.0001138057,0.0005290938,0.00002838096,0.00003752537,0.0003721401,0.00002617751,0.0005856488,0.9973656,0.0001866699,0.0004348336],"study_design_scores_gemma":[0.0005520129,0.0001148318,0.0003857686,0.00004782567,0.0000346177,0.00005880186,0.0004640902,0.0002195635,0.004107565,0.9938044,0.0000766373,0.0001338947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3719118,0.0003238083,0.6132071,0.0002006373,0.00008052969,0.0005327783,0.00006662712,0.00006044093,0.01361629],"genre_scores_gemma":[0.7077717,0.00001554778,0.2916293,0.00009689662,0.00002212704,0.00005555267,0.00001686801,0.00002148796,0.0003706077],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3358599,"threshold_uncertainty_score":0.5865898,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002741874,0.0002292494,0.0003310069,0.00007740209,0.0002862285,0.00004666923,0.0006524962,0.00004947007,0.00003768741],"category_scores_gemma":[0.0005667122,0.00015763,0.0001320275,0.0002802882,0.0002687262,0.0001517729,0.0002571009,0.0001639836,0.0001206233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003038494,"about_ca_system_score_gemma":0.00006441248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005225519,"about_ca_topic_score_gemma":0.000003668775,"domain_scores_codex":[0.9982765,0.00006980365,0.0003216767,0.0005641413,0.0003287711,0.0004391388],"domain_scores_gemma":[0.9978702,0.001111045,0.00009952128,0.0006323565,0.000130797,0.0001560571],"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.00006911185,0.0006489417,0.0004705526,0.0001904597,0.00005987925,0.00004785338,0.00119018,0.0005808866,0.0001405443,0.990345,0.0007336817,0.005522905],"study_design_scores_gemma":[0.0004945673,0.0007450234,0.001787012,0.00002348078,0.00001669515,0.0001329085,0.00002338216,0.2652072,0.00006641171,0.7306232,0.0006370176,0.0002431452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01386967,0.00001173699,0.9797469,0.0005281635,0.0001304297,0.0006702609,0.000007113674,0.0003801783,0.004655546],"genre_scores_gemma":[0.3917214,0.000001145336,0.6076311,0.000254253,0.0001140217,0.0001051427,0.00001068355,0.00001663716,0.0001456083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3778517,"threshold_uncertainty_score":0.6427965,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004720135,0.0002761279,0.000507456,0.00009670741,0.0005141333,0.00002313554,0.0003825537,0.00008881828,0.0001081176],"category_scores_gemma":[0.001283942,0.0001490073,0.0001763665,0.0001490034,0.0005107523,0.00004564363,0.0001067525,0.0002369205,0.0001105127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004695645,"about_ca_system_score_gemma":0.00002441644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.590438e-7,"about_ca_topic_score_gemma":0.00004464503,"domain_scores_codex":[0.9985409,0.0001439595,0.0003383041,0.0003401946,0.0001688518,0.0004677498],"domain_scores_gemma":[0.9841766,0.01501913,0.0001499886,0.0005378166,0.00004971062,0.00006680561],"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.0004579494,0.0002085077,0.0000165083,0.0002375265,0.0001180941,0.000005430475,0.0006051934,0.00001840282,0.0004657135,0.99257,0.004457085,0.0008395257],"study_design_scores_gemma":[0.0008158464,0.000374849,0.00009776828,0.000188763,0.0001252097,0.00001494919,0.0003790747,0.0007205585,0.004019805,0.9914097,0.001665068,0.000188455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1354022,0.00005630598,0.73672,0.00445001,0.0001050919,0.001786763,0.00005809222,0.0002172758,0.1212043],"genre_scores_gemma":[0.9128968,0.000005865155,0.06929858,0.001934069,0.00006271181,0.0004487721,0.00001102936,0.00004983459,0.01529241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7774945,"threshold_uncertainty_score":0.6076342,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001547873,0.0001942426,0.0004134777,0.00003397654,0.0002586773,0.00001804428,0.0003788565,0.00009139631,0.0009806136],"category_scores_gemma":[0.000920284,0.0000813789,0.0002666747,0.000100868,0.000585241,0.0001096424,0.0001310072,0.0002461737,0.0000640812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001897633,"about_ca_system_score_gemma":0.00003580995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001032854,"about_ca_topic_score_gemma":0.000004938985,"domain_scores_codex":[0.9984986,0.0002005761,0.000465031,0.0002350565,0.0002547697,0.0003459657],"domain_scores_gemma":[0.9845757,0.01462433,0.0001410284,0.0005296392,0.00008978137,0.0000394972],"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.0001701412,0.0001209646,0.000002154779,0.0006686298,0.000137352,0.000002490265,0.001106426,0.00002651731,0.0007050018,0.9955868,0.001360387,0.000113181],"study_design_scores_gemma":[0.0002163159,0.0000972698,0.000001163649,0.0002006111,0.00007334838,0.00001096046,0.001234586,0.006997226,0.006661386,0.9823707,0.002029626,0.0001067712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1389825,0.0002985187,0.6901824,0.003213377,0.0004570215,0.002062074,0.001921874,0.0001650349,0.1627172],"genre_scores_gemma":[0.9774348,0.00004131224,0.01400506,0.0002554921,0.00005789315,0.0001306644,0.00001055519,0.00004216883,0.008022009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8384523,"threshold_uncertainty_score":0.9999326,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004205744,0.0001076958,0.0003844762,0.0001393471,0.00005380643,0.000004055082,0.0002354011,0.0000448328,0.00004623527],"category_scores_gemma":[0.001148871,0.00008199552,0.0002177539,0.000243836,0.0002318652,0.00002061275,0.00006189341,0.0000643478,0.000007459699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004712946,"about_ca_system_score_gemma":0.00002087469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.967749e-7,"about_ca_topic_score_gemma":0.000001632398,"domain_scores_codex":[0.9991108,0.00004032803,0.0004421493,0.0001503597,0.00009661252,0.0001597346],"domain_scores_gemma":[0.9958763,0.003545581,0.0001553338,0.0003368993,0.0000515674,0.00003433317],"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.00002646798,0.0002948276,0.00002079253,0.0008183017,0.00005445517,1.222685e-7,0.000293319,0.000001167183,0.008640417,0.9889361,0.0006217815,0.0002922018],"study_design_scores_gemma":[0.0002449505,0.00007992271,0.00004245879,0.0001556372,0.00007974316,6.798036e-7,0.0001101951,0.0006276555,0.02233826,0.9758961,0.0003562801,0.00006813824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1870046,0.00006043378,0.6267656,0.000619806,0.00004653917,0.001438005,0.0002648061,0.0001049932,0.1836952],"genre_scores_gemma":[0.8978323,0.000006005495,0.1007977,0.00005495241,0.00001036141,0.0001561508,0.00001104209,0.0000119201,0.001119488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7108278,"threshold_uncertainty_score":0.334368,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002293502,0.0001095627,0.0003746009,0.00006910703,0.00003448437,0.000002296657,0.0001422904,0.0000615975,0.0004198409],"category_scores_gemma":[0.001237843,0.00008067294,0.0001561656,0.00005422068,0.0003903823,0.00006605694,0.00003884836,0.00008031067,0.00004107668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008488569,"about_ca_system_score_gemma":0.00000919446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005894554,"about_ca_topic_score_gemma":0.000003758046,"domain_scores_codex":[0.9991128,0.00006186828,0.000438858,0.0001256412,0.00008860047,0.0001722504],"domain_scores_gemma":[0.9967375,0.002738835,0.0002005677,0.0002129656,0.00007076593,0.00003930705],"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.00003766123,0.0001471032,0.00002927701,0.0004951039,0.00004497724,2.411965e-7,0.001075401,0.000003807458,0.006557703,0.990535,0.0004336542,0.000640066],"study_design_scores_gemma":[0.0002457483,0.0002110251,0.0000757202,0.00006833176,0.00003208415,0.000006849298,0.001262457,0.0003268623,0.008577357,0.989089,0.00002878834,0.00007577943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3571254,0.00001497538,0.5985733,0.0001117565,0.00006742826,0.0007322255,0.00003226476,0.00004710977,0.0432955],"genre_scores_gemma":[0.8568819,0.000004346596,0.1426451,0.00003895022,0.00001584369,0.00008653307,0.000004827878,0.00001315191,0.0003093494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4997565,"threshold_uncertainty_score":0.4596964,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004021649,0.0001504587,0.0002758435,0.0001239513,0.0001168969,0.00004607053,0.0006256344,0.00005526588,0.0000154141],"category_scores_gemma":[0.0001447154,0.0001282995,0.00009166517,0.0004357378,0.0001535656,0.00008371609,0.0006108686,0.0001022928,0.00006153525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002120861,"about_ca_system_score_gemma":0.0000388086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000156957,"about_ca_topic_score_gemma":0.000007274306,"domain_scores_codex":[0.9985659,0.00004892701,0.0003344901,0.0004548539,0.0002384867,0.0003573433],"domain_scores_gemma":[0.997723,0.001471849,0.00007401001,0.0005159649,0.00005671832,0.0001584984],"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.000007070545,0.0001087994,0.00004486641,0.0002564697,0.00002181542,0.000002804856,0.001173197,0.0008156768,0.0008776865,0.9863343,0.0003732134,0.009984097],"study_design_scores_gemma":[0.0001882859,0.0001554247,0.001979337,0.00002573123,0.000009177448,0.000008303603,0.00006756175,0.1087776,0.0002582778,0.8882879,0.0001008786,0.0001415061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04693148,0.000005724396,0.9475982,0.002044117,0.00005853123,0.0009978145,0.00002350289,0.0002832675,0.002057395],"genre_scores_gemma":[0.5495182,0.00000913686,0.4498064,0.0002341608,0.00003010299,0.0002941927,0.000009414074,0.00001291973,0.00008547748],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5025868,"threshold_uncertainty_score":0.5231901,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003644211,0.0001687193,0.0002625998,0.0001844712,0.000180568,0.0001214196,0.0005417191,0.00005419677,0.00003311985],"category_scores_gemma":[0.0006481902,0.0001335283,0.0001041687,0.0005172929,0.0001943482,0.0001789568,0.0004044409,0.0001472016,0.00006341095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002585561,"about_ca_system_score_gemma":0.00002786766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000418637,"about_ca_topic_score_gemma":0.000002022015,"domain_scores_codex":[0.9985501,0.00007012051,0.000295549,0.0004917429,0.000208555,0.0003838913],"domain_scores_gemma":[0.9976958,0.001474646,0.00006734482,0.0005294527,0.0000568474,0.0001759084],"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.000007775616,0.0003267774,0.0003125733,0.00005922819,0.00002056344,0.00001138442,0.000338427,0.000126182,0.00004525216,0.953451,0.0004367597,0.04486411],"study_design_scores_gemma":[0.0001881933,0.0001614724,0.002791766,0.000008545282,0.000007390199,0.0001864661,0.00001812817,0.2412659,0.00001520236,0.7544213,0.0008045181,0.0001310735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02163924,0.00006144587,0.9711257,0.001762058,0.0001297599,0.0005223136,0.000007547688,0.0002082584,0.004543692],"genre_scores_gemma":[0.4705608,0.00001436866,0.528931,0.000188269,0.00005767228,0.00009261847,0.00000356133,0.000009634363,0.0001420147],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4489216,"threshold_uncertainty_score":0.5445128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}