{"meta":{"query_hash":"e4d2c7d6479a","filters":{"venue":"Archive for Mathematical Logic"},"cohort_total":26,"direct_labels_cover":0,"predictions_cover":26,"exported":26,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/e4d2c7d6479a","api":"https://metacan.xera.ac/api/v1/cohort?venue=Archive+for+Mathematical+Logic"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0625853413362719,"score_gpt":0.3267031561761004,"score_spread":0.2641178148398285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529889279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14810342,0.0027495872,0.54142153,0.009087377,0.00043214875,0.000115540686,0.00065451453,0.00041008188,0.29702577],"genre_scores_gemma":[0.8725178,0.0016222327,0.085978046,0.00097647705,0.0004239417,0.00021528437,0.00051294506,0.000345419,0.037407864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969964,0.0009577089,0.00021404466,0.0007556852,0.0006011309,0.00047504823],"domain_scores_gemma":[0.9846949,0.0086773215,0.0011620661,0.002948258,0.0014180448,0.001099386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033160564,0.00059312984,0.0011834004,0.0025409504,0.005428979,0.008809981,0.0020624362,0.0038361296,0.030398857],"category_scores_gemma":[0.019501958,0.0010160218,0.0011114834,0.0045366697,0.010402128,0.025480423,0.0070115468,0.00484409,0.0020799013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009065325,0.0000036293218,0.00006832287,0.000008377918,0.0000016867422,0.000036389727,0.00011030628,0.00024065367,0.000027218279,0.99809045,0.0002659141,0.0011379373],"study_design_scores_gemma":[0.0000036802103,0.0000018238458,0.00001661837,0.00001037616,0.000001991531,0.00003134835,0.00006752956,0.0015157275,0.00004561015,0.9963961,0.0019065487,0.000002724238],"about_ca_topic_score_codex":0.002993505,"about_ca_topic_score_gemma":0.0019439372,"teacher_disagreement_score":0.030398857,"about_ca_system_score_codex":0.0021012782,"about_ca_system_score_gemma":0.0014050183,"threshold_uncertainty_score":0.101694286},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Subsequence; Mathematics; Combinatorics; Boolean algebra; Sequence (biology); Discrete mathematics","score_opus":0.07276729089638911,"score_gpt":0.3218469085121767,"score_spread":0.24907961761578756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970610329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61433554,0.00063954317,0.29804644,0.0021268153,0.00022773971,0.0001028777,0.0013491645,0.0004510251,0.08272085],"genre_scores_gemma":[0.9712749,0.00021774878,0.017827226,0.00029852643,0.0001414855,0.00013956375,0.0006478639,0.00009189076,0.00936074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906605,0.00020295076,0.00008468044,0.00028109743,0.00014415925,0.00022113915],"domain_scores_gemma":[0.99642664,0.0017013407,0.00035565684,0.0004839475,0.0006817513,0.00035076082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009596733,0.00042319574,0.0008960693,0.00126247,0.0026327407,0.0039919997,0.0013226432,0.0008992948,0.007457043],"category_scores_gemma":[0.0038310364,0.0005706917,0.0010022145,0.0013324007,0.00399445,0.0042725634,0.0022225713,0.0018207687,0.0008174571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040687,0.000011067096,0.00028155753,0.000022587166,0.000009294736,0.000036135214,0.00020271342,0.00034530365,0.0009694458,0.9951321,0.00046849594,0.002480599],"study_design_scores_gemma":[0.000022960463,0.000019956522,0.00042309123,0.000011797345,0.000019695713,0.00013354923,0.00019074554,0.0027761755,0.0016079327,0.9903133,0.0044613527,0.000019439016],"about_ca_topic_score_codex":0.0023709126,"about_ca_topic_score_gemma":0.0023649368,"teacher_disagreement_score":0.007457043,"about_ca_system_score_codex":0.0010435793,"about_ca_system_score_gemma":0.0007980304,"threshold_uncertainty_score":0.024946332},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017284694571035035,"score_gpt":0.28818060043467947,"score_spread":0.2708959058636444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977405062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055149585,0.0027096395,0.73364466,0.007736352,0.001135864,0.00007313902,0.00048456618,0.00059572427,0.19847047],"genre_scores_gemma":[0.786861,0.0023863888,0.14947622,0.0016243167,0.0011821077,0.00019905956,0.00055665115,0.0005906507,0.057123557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889886,0.00034300814,0.000052476164,0.00021430956,0.00037014543,0.00012118206],"domain_scores_gemma":[0.99758685,0.0012395865,0.00014658512,0.0005278909,0.00034312243,0.00015597284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016372871,0.0005877541,0.00090062513,0.0018308382,0.002473222,0.0041188523,0.001556616,0.0015787926,0.015297329],"category_scores_gemma":[0.0058721406,0.0006580376,0.0012592701,0.0013338678,0.0059891036,0.009088004,0.0036107465,0.004041297,0.0022330477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005765814,0.00000293895,0.00001601734,0.000007278086,0.0000015504601,0.000008241876,0.000035240722,0.0002726967,0.000077081684,0.99699295,0.0008464616,0.001733793],"study_design_scores_gemma":[0.0000029880134,0.000002888006,0.000012981058,0.000003814885,0.0000010910821,0.000013374793,0.000009884052,0.0012841559,0.00007970935,0.9965372,0.0020490605,0.0000028542645],"about_ca_topic_score_codex":0.001090727,"about_ca_topic_score_gemma":0.0010201859,"teacher_disagreement_score":0.015297329,"about_ca_system_score_codex":0.0015790421,"about_ca_system_score_gemma":0.00081598706,"threshold_uncertainty_score":0.05117464},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Algebra over a field; Linear algebra; Pure mathematics","score_opus":0.018516870105116955,"score_gpt":0.2600622216944414,"score_spread":0.24154535158932441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987241097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052775808,0.02230082,0.45225865,0.02998353,0.00442383,0.00012320622,0.003969811,0.0027450877,0.43141928],"genre_scores_gemma":[0.68554497,0.0111309625,0.07544407,0.0025193417,0.0061077564,0.00029449296,0.0061142687,0.0013014884,0.21154265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998569,0.00050061994,0.00012842694,0.0002248008,0.00046784867,0.000109333385],"domain_scores_gemma":[0.99603397,0.0018655715,0.0002260752,0.0007924577,0.000821239,0.00026076072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022445857,0.0010360329,0.0015636955,0.0046406714,0.0038868163,0.009099012,0.0017155429,0.0014107212,0.025845183],"category_scores_gemma":[0.0064453166,0.001273816,0.0011491807,0.0056686043,0.0045469166,0.014326346,0.0035255486,0.0068901405,0.005757047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017085755,0.00001171134,0.00008461286,0.000040198407,0.000005743258,0.000011664103,0.00011974733,0.00013748046,0.000101854996,0.9870272,0.006375492,0.006067123],"study_design_scores_gemma":[0.00000712915,0.000004637054,0.00007931377,0.00002158104,0.000009830601,0.000023522909,0.00004756519,0.0007175287,0.00019879936,0.9827291,0.016155047,0.000005835013],"about_ca_topic_score_codex":0.0013787656,"about_ca_topic_score_gemma":0.0014307486,"teacher_disagreement_score":0.025845183,"about_ca_system_score_codex":0.0027228077,"about_ca_system_score_gemma":0.0013550834,"threshold_uncertainty_score":0.08646071},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Hilbert space; Algebra over a field; Pure mathematics; Linguistics; Discrete mathematics","score_opus":0.05991727397275735,"score_gpt":0.3734748531109319,"score_spread":0.31355757913817456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023176173","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07552161,0.027367633,0.19212638,0.047333285,0.0031600432,0.00006775498,0.0009464227,0.0005789472,0.65289783],"genre_scores_gemma":[0.89702404,0.0059401356,0.02467656,0.0018679401,0.002957109,0.00013231047,0.00060113764,0.00027056277,0.06653018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986432,0.00072847825,0.000083876155,0.00016408316,0.00024603345,0.00013426041],"domain_scores_gemma":[0.9967284,0.0020673203,0.00020652983,0.00039333152,0.00036751412,0.00023690396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002730493,0.00074635213,0.0010070552,0.0031592504,0.004118215,0.0098961815,0.0013297633,0.0032414016,0.015500869],"category_scores_gemma":[0.0056115557,0.00074355263,0.0011592055,0.00257157,0.01049529,0.019104252,0.0026429484,0.0066437307,0.0013516222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022360398,0.0000017527325,0.000007718329,0.0000064723677,8.4016864e-7,0.0000063822404,0.00011735273,0.000031938114,0.000021227705,0.9990287,0.0004776279,0.00029766976],"study_design_scores_gemma":[0.000003710156,0.0000017204699,0.000016390017,0.0000059872687,0.0000014194547,0.000013470019,0.00006697872,0.00019729274,0.000031500676,0.9950911,0.0045681354,0.0000021678993],"about_ca_topic_score_codex":0.001476847,"about_ca_topic_score_gemma":0.0012109523,"teacher_disagreement_score":0.015500869,"about_ca_system_score_codex":0.0037773673,"about_ca_system_score_gemma":0.0009680455,"threshold_uncertainty_score":0.051855564},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.037541640230142496,"score_gpt":0.29213862169588384,"score_spread":0.25459698146574133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024261644","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021161651,0.010778673,0.4000783,0.0094717005,0.0038510177,0.00018729069,0.009963,0.00680958,0.5376988],"genre_scores_gemma":[0.43378904,0.015552662,0.1793061,0.002150307,0.0047516255,0.0007242704,0.027009824,0.005819443,0.3308968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979765,0.00032804746,0.0001988519,0.00030406774,0.0010452714,0.00014735665],"domain_scores_gemma":[0.99523216,0.0018677488,0.00026000498,0.0017116248,0.000700943,0.00022743877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016575673,0.0009967639,0.0018768195,0.0057582096,0.0031623123,0.00994558,0.0027074637,0.0011738949,0.060899112],"category_scores_gemma":[0.009251888,0.0010730645,0.0013810181,0.010769272,0.0025575904,0.0119344555,0.00375657,0.0055630514,0.015963405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006421617,0.000049450828,0.00015195539,0.0001487471,0.000018210272,0.000052652882,0.0001730782,0.0010976709,0.00038433075,0.8946264,0.045389757,0.05784348],"study_design_scores_gemma":[0.00001368066,0.000009729876,0.00015342736,0.00006155567,0.0000189012,0.00011294847,0.000061466264,0.002774185,0.0008162633,0.8824814,0.113478616,0.00001781749],"about_ca_topic_score_codex":0.001060512,"about_ca_topic_score_gemma":0.0012977547,"teacher_disagreement_score":0.060899112,"about_ca_system_score_codex":0.0028532709,"about_ca_system_score_gemma":0.0014374317,"threshold_uncertainty_score":0.20372784},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04367142137469054,"score_gpt":0.3437346931547347,"score_spread":0.30006327178004416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041614410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42020336,0.0021198923,0.21279609,0.0024950355,0.001149169,0.00011513675,0.00095387653,0.0007244626,0.359443],"genre_scores_gemma":[0.90014124,0.0010492814,0.020364944,0.0004163786,0.00044772602,0.00011017426,0.00087341276,0.00029499942,0.07630183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989936,0.00015417681,0.000059392976,0.00021045114,0.00030888268,0.00027347772],"domain_scores_gemma":[0.99813473,0.00071390934,0.0001856138,0.00028691263,0.00031043313,0.00036837082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045320147,0.00068742945,0.0008860079,0.0021937494,0.0027759944,0.004811782,0.00078204356,0.0011267113,0.0148929255],"category_scores_gemma":[0.0026614214,0.0006581173,0.0012249867,0.0016580666,0.0027223532,0.005158505,0.0047290265,0.0026197047,0.0018549009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002981319,0.000010095058,0.00017625272,0.00001961124,0.000008086768,0.00009359311,0.00031456244,0.00040145227,0.00063635083,0.9929803,0.001133133,0.0041967705],"study_design_scores_gemma":[0.000016622884,0.000015533424,0.00030692146,0.000015917445,0.000016704504,0.0002496477,0.0003723124,0.002244495,0.0008910496,0.982094,0.013765462,0.000011302465],"about_ca_topic_score_codex":0.0013187402,"about_ca_topic_score_gemma":0.00094328844,"teacher_disagreement_score":0.0148929255,"about_ca_system_score_codex":0.0011238385,"about_ca_system_score_gemma":0.0004021161,"threshold_uncertainty_score":0.049821854},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06564812499668081,"score_gpt":0.35204336467819586,"score_spread":0.28639523968151503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052797720","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04188836,0.009435425,0.31086612,0.020127926,0.00421755,0.000092219176,0.00095265463,0.00059412105,0.61182564],"genre_scores_gemma":[0.7713424,0.0061786817,0.08016217,0.006801043,0.004493207,0.00024825515,0.00092351605,0.0003978526,0.12945285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998825,0.0002821196,0.000075551296,0.00036458691,0.00028102638,0.00017171018],"domain_scores_gemma":[0.99818844,0.0007972749,0.00012582232,0.00030419586,0.00044296702,0.00014125768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026757214,0.0006941004,0.0009196457,0.0026929216,0.0024976162,0.0032001464,0.00097443594,0.0016971307,0.013141936],"category_scores_gemma":[0.0039296043,0.0005165509,0.0013189204,0.0014735304,0.0072772214,0.011309734,0.0029446501,0.005604049,0.0026907069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013995513,0.0000073337783,0.00005566704,0.00002223767,0.0000068318705,0.000019741241,0.00010308545,0.00006929309,0.00022131091,0.99396753,0.0024790412,0.003033931],"study_design_scores_gemma":[0.000009986788,0.0000047297767,0.00007832193,0.0000064253168,0.000004467007,0.000048167964,0.000024811914,0.00021603281,0.00023671416,0.9897669,0.009597124,0.000006286994],"about_ca_topic_score_codex":0.0009729818,"about_ca_topic_score_gemma":0.00071652146,"teacher_disagreement_score":0.013141936,"about_ca_system_score_codex":0.001818917,"about_ca_system_score_gemma":0.0008857235,"threshold_uncertainty_score":0.043964148},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03004716016071145,"score_gpt":0.2795593172617327,"score_spread":0.24951215710102126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055138800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03278414,0.0022634715,0.67588,0.0074522807,0.0019285221,0.00014400974,0.00223623,0.0013253932,0.2759859],"genre_scores_gemma":[0.6529591,0.0013831515,0.23111026,0.002394811,0.0015172285,0.0003130466,0.0026138355,0.0007343036,0.106974296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997391,0.00049662136,0.00016750753,0.00047971922,0.0010558026,0.00040932308],"domain_scores_gemma":[0.9965938,0.0013416351,0.0002206418,0.00063815905,0.0009746274,0.00023115875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028316597,0.0010293748,0.000973515,0.003271976,0.0046110447,0.0085661635,0.0030284885,0.0020496596,0.0115162125],"category_scores_gemma":[0.0050340733,0.00068958494,0.0022216241,0.003527169,0.0051663658,0.011025399,0.0030638159,0.005613514,0.0015373718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003951858,0.0000056341205,0.000028916258,0.000008391254,0.0000015140289,0.000012794902,0.000047735135,0.00016552332,0.000051787345,0.9977696,0.00091794913,0.0009862019],"study_design_scores_gemma":[0.000007074499,0.0000042356237,0.00008419796,0.000014347622,0.000009351012,0.000043692537,0.00003656087,0.004452365,0.00043621965,0.9797681,0.01512866,0.00001532495],"about_ca_topic_score_codex":0.013322089,"about_ca_topic_score_gemma":0.010467224,"teacher_disagreement_score":0.013322089,"about_ca_system_score_codex":0.008336547,"about_ca_system_score_gemma":0.0037998687,"threshold_uncertainty_score":0.060486138},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040559252999187154,"score_gpt":0.33203194817468695,"score_spread":0.2914726951754998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064694271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49344504,0.0024380807,0.24486074,0.0024401173,0.00042788222,0.00012148895,0.0015536193,0.0007557927,0.25395724],"genre_scores_gemma":[0.9386088,0.00071256026,0.03975845,0.00015857423,0.00025527098,0.00015518208,0.0010781649,0.00016143265,0.01911158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976884,0.0005733677,0.00015986875,0.00051362737,0.00064292207,0.00042175237],"domain_scores_gemma":[0.9925729,0.004193495,0.0007183429,0.0005404103,0.00096906075,0.0010057945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030703272,0.0007491091,0.0010573157,0.0061970884,0.004840799,0.0064567076,0.0017930757,0.0010924652,0.014566252],"category_scores_gemma":[0.0072529856,0.0012062979,0.0012808028,0.003472469,0.004086905,0.0128783975,0.0032800746,0.0038503527,0.0013453274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011229931,0.00002090712,0.0007560408,0.000045709403,0.000017529332,0.00007224733,0.00046810484,0.00033406282,0.00053802185,0.99054307,0.0013191673,0.0057728505],"study_design_scores_gemma":[0.000024799576,0.00003550181,0.0010742105,0.000049570426,0.000051346287,0.00047251178,0.0005014432,0.003002876,0.0021411106,0.9839811,0.008638099,0.000027490605],"about_ca_topic_score_codex":0.00041367207,"about_ca_topic_score_gemma":0.00041124332,"teacher_disagreement_score":0.014566252,"about_ca_system_score_codex":0.002514241,"about_ca_system_score_gemma":0.0006326061,"threshold_uncertainty_score":0.048728943},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019905836028134085,"score_gpt":0.25093022166200113,"score_spread":0.23102438563386704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065234465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0627359,0.0070111444,0.7742977,0.0113768475,0.00052178727,0.00008910895,0.0012053031,0.00077033206,0.14199196],"genre_scores_gemma":[0.83935267,0.0037233792,0.11913041,0.0013964237,0.0015659403,0.0002702712,0.0013165593,0.00031602543,0.032928348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979091,0.0008880297,0.00013246293,0.00043226316,0.00044902027,0.00018899745],"domain_scores_gemma":[0.9961707,0.0019368601,0.00033940302,0.00080844667,0.0004722239,0.00027226686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034122826,0.00070337934,0.0015327615,0.00290474,0.003222524,0.006861448,0.0022433216,0.0022285082,0.0087773],"category_scores_gemma":[0.008120467,0.0007573478,0.0018121627,0.0026851823,0.006518632,0.014243378,0.0031663463,0.0039346786,0.0013994863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061974515,0.000002150415,0.00001303158,0.0000076891465,0.000002321426,0.000007856579,0.000034737295,0.00018091893,0.000057292604,0.9984151,0.00033462635,0.00093802647],"study_design_scores_gemma":[0.0000063863254,0.000003577508,0.000024499319,0.000008265102,0.0000047396406,0.000017011356,0.00001873758,0.0024975582,0.00009051165,0.9949222,0.0024003475,0.0000061946575],"about_ca_topic_score_codex":0.0025967848,"about_ca_topic_score_gemma":0.002014742,"teacher_disagreement_score":0.0087773,"about_ca_system_score_codex":0.0028872355,"about_ca_system_score_gemma":0.0013900534,"threshold_uncertainty_score":0.029362977},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031924201733800436,"score_gpt":0.2463704260378365,"score_spread":0.21444622430403604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066080230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042962234,0.0053268103,0.6254683,0.007964205,0.0030924175,0.00018040896,0.015570616,0.010452309,0.2889827],"genre_scores_gemma":[0.48723722,0.0059636654,0.2213333,0.0017755119,0.0023028022,0.0003733807,0.018834988,0.0037874084,0.25839177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898344,0.00021693482,0.00011657297,0.00015751713,0.0003815121,0.00014395034],"domain_scores_gemma":[0.995817,0.0016206404,0.00023123974,0.0013402486,0.00071502087,0.00027588365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012179149,0.00088959374,0.0010905442,0.0036034335,0.0028895508,0.0073320186,0.0016895618,0.0011684619,0.041365486],"category_scores_gemma":[0.004412796,0.0010677171,0.000992615,0.0069477977,0.002866195,0.009242667,0.0020057973,0.0054239584,0.01768558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075686876,0.000036189114,0.00015417006,0.00011190159,0.0000071741183,0.000060544877,0.00025297215,0.0006378591,0.0004532784,0.94728786,0.022614416,0.028307967],"study_design_scores_gemma":[0.000021764019,0.00001786906,0.00014010727,0.00005057377,0.000012608776,0.0001517512,0.00009005257,0.0023289716,0.0016486982,0.88372487,0.11178608,0.000026667461],"about_ca_topic_score_codex":0.0017714942,"about_ca_topic_score_gemma":0.002097543,"teacher_disagreement_score":0.041365486,"about_ca_system_score_codex":0.0027692227,"about_ca_system_score_gemma":0.0021973923,"threshold_uncertainty_score":0.1383813},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; McMaster University; York University","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.056817454770211405,"score_gpt":0.3454196293319866,"score_spread":0.2886021745617752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078212057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1161849,0.01122778,0.5945747,0.016362978,0.005341354,0.000078048026,0.0016257014,0.0013867954,0.25321788],"genre_scores_gemma":[0.8290295,0.0053528305,0.074071586,0.0019869048,0.004051336,0.0001279415,0.0018035384,0.000863735,0.082712606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693006,0.0010810364,0.00032884337,0.0005233087,0.0007376533,0.0003991402],"domain_scores_gemma":[0.99185455,0.0041695735,0.0005513506,0.0015780731,0.0013811543,0.00046530238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004832952,0.0012371489,0.0017209968,0.0038943233,0.005525158,0.009052437,0.0028626593,0.002469944,0.0134548135],"category_scores_gemma":[0.012249212,0.0014943257,0.0022204383,0.0048240023,0.0073075118,0.03259176,0.004993281,0.010447324,0.0022465182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017096037,0.000009007998,0.00008713546,0.00002558328,0.0000034356353,0.000030023484,0.00017424076,0.00009061942,0.00007059238,0.99592066,0.0011189551,0.0024526457],"study_design_scores_gemma":[0.000003763812,0.0000031523466,0.000029227058,0.000010272292,0.000005595152,0.000046885176,0.000041206775,0.00029376883,0.00008086374,0.99605274,0.0034275737,0.0000048288452],"about_ca_topic_score_codex":0.0017343129,"about_ca_topic_score_gemma":0.0015795233,"teacher_disagreement_score":0.0134548135,"about_ca_system_score_codex":0.002540775,"about_ca_system_score_gemma":0.0014613444,"threshold_uncertainty_score":0.045010865},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0286124315755724,"score_gpt":0.26472884710453476,"score_spread":0.23611641552896237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084344766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3063827,0.0015797019,0.49933434,0.009704258,0.0009036163,0.00042012805,0.0037944585,0.0025380459,0.17534281],"genre_scores_gemma":[0.94343805,0.00035956266,0.040142078,0.001185462,0.00048219765,0.00026759293,0.002526687,0.0005014693,0.01109683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942848,0.0015299909,0.0005135675,0.0013219278,0.001239749,0.001109921],"domain_scores_gemma":[0.9810311,0.010410221,0.0014319939,0.0036899678,0.0022035253,0.0012331252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035505195,0.0007719395,0.0016158812,0.003407611,0.004559824,0.009455827,0.002985641,0.0029600621,0.01571176],"category_scores_gemma":[0.018596679,0.001145473,0.0026288459,0.0031995072,0.007861678,0.030232271,0.0052934997,0.007923265,0.0019171323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008030273,0.00009959043,0.00045308843,0.000035129808,0.000014046248,0.000068830894,0.0007014306,0.00054418284,0.00039368705,0.99062073,0.00119363,0.0057953387],"study_design_scores_gemma":[0.000026060156,0.000020225376,0.00023401657,0.000014325345,0.000014567375,0.00007645435,0.00025683243,0.002163506,0.0005433623,0.99364626,0.0029930063,0.000011348763],"about_ca_topic_score_codex":0.0014770614,"about_ca_topic_score_gemma":0.0013178424,"teacher_disagreement_score":0.01571176,"about_ca_system_score_codex":0.0024023764,"about_ca_system_score_gemma":0.0018146702,"threshold_uncertainty_score":0.052561045},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05662482139716313,"score_gpt":0.33546827102493154,"score_spread":0.2788434496277684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087110253","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22696325,0.0052819555,0.19227815,0.010284243,0.0012562966,0.000048125945,0.0004444998,0.00022284409,0.5632206],"genre_scores_gemma":[0.9144322,0.001578871,0.021869969,0.0010288361,0.0006409431,0.00005800716,0.00021627758,0.000119976605,0.060054798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914277,0.00023409053,0.000061005103,0.00023939172,0.0001484942,0.00017420703],"domain_scores_gemma":[0.9976774,0.0014987511,0.0001519042,0.00025865537,0.00023174091,0.00018160329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017948439,0.0005740211,0.00071136316,0.0019486711,0.0025284307,0.0031432484,0.00086889416,0.0011520052,0.00909749],"category_scores_gemma":[0.003501042,0.0005662555,0.0009982451,0.0012235816,0.004445287,0.01320842,0.003095291,0.0034759936,0.00060762983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011283991,0.0000042312995,0.000095139665,0.000008942851,0.0000025680606,0.00003829756,0.0001110557,0.00008235512,0.000115765026,0.99806374,0.0005749915,0.0008916197],"study_design_scores_gemma":[0.000009265012,0.000006427835,0.00023446583,0.000012291272,0.000009019953,0.000078956466,0.00012876997,0.0008916497,0.00025995955,0.9914163,0.0069465563,0.000006436546],"about_ca_topic_score_codex":0.0015612206,"about_ca_topic_score_gemma":0.0018081598,"teacher_disagreement_score":0.00909749,"about_ca_system_score_codex":0.0010864183,"about_ca_system_score_gemma":0.00050721335,"threshold_uncertainty_score":0.030434132},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04930155187970691,"score_gpt":0.2544212250325528,"score_spread":0.2051196731528459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087377736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39029095,0.0029041483,0.50398076,0.0074226395,0.00031377966,0.00009503782,0.0011041274,0.00094855647,0.092940025],"genre_scores_gemma":[0.93473905,0.0015499837,0.034311846,0.00059247145,0.0005931552,0.00016667909,0.0010082447,0.00038010022,0.026658565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796224,0.0007105666,0.0000984469,0.00029157175,0.00059230207,0.00034477204],"domain_scores_gemma":[0.9771741,0.013490166,0.0013736805,0.0031912983,0.0032414906,0.0015292263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004678582,0.00060356036,0.0011069535,0.0043095816,0.0045272326,0.0065989275,0.0036568535,0.0014856877,0.011715558],"category_scores_gemma":[0.033676,0.00080092566,0.0006163715,0.0044933856,0.005081558,0.010801178,0.003541741,0.003996826,0.0016202134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070349495,0.000017500388,0.00025444478,0.000013329169,0.0000033928382,0.000022720042,0.00015638677,0.0016609663,0.00022175594,0.99024385,0.0013262404,0.0060092113],"study_design_scores_gemma":[0.000012969643,0.000011107349,0.00013584003,0.00001588792,0.0000038753387,0.00004378415,0.00006989691,0.011878703,0.00034271643,0.98546785,0.0020072209,0.000010048559],"about_ca_topic_score_codex":0.0022350715,"about_ca_topic_score_gemma":0.0017663486,"teacher_disagreement_score":0.011715558,"about_ca_system_score_codex":0.004062479,"about_ca_system_score_gemma":0.0018213312,"threshold_uncertainty_score":0.039192438},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07484549101937951,"score_gpt":0.3438388893421886,"score_spread":0.2689933983228091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089558857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40554523,0.005113536,0.38956878,0.018872611,0.00050457823,0.00020313462,0.0041985936,0.0020014816,0.17399205],"genre_scores_gemma":[0.95462286,0.0008390932,0.026511256,0.0012067234,0.00044267057,0.00017414533,0.0024223637,0.00026579833,0.013515054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942848,0.0018877215,0.00042398841,0.0010958859,0.0014880022,0.0008195491],"domain_scores_gemma":[0.9796658,0.013528324,0.0010338838,0.0029175053,0.0019345719,0.00091984955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005442655,0.0010870782,0.0029577648,0.0029374394,0.006644863,0.008755695,0.0033546744,0.00316117,0.009932521],"category_scores_gemma":[0.013595113,0.0016289264,0.0034744178,0.0030491538,0.007593488,0.027929792,0.007152426,0.009760012,0.001181606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004263823,0.000035861463,0.0004131731,0.00008204864,0.000027935354,0.000042841457,0.00049280346,0.0007245026,0.0002168367,0.99474406,0.001506378,0.0016710339],"study_design_scores_gemma":[0.000012928562,0.000007588257,0.00012560756,0.000009768861,0.000013655737,0.00003280534,0.00009680918,0.0021364214,0.00019160668,0.9962909,0.0010713629,0.000010463439],"about_ca_topic_score_codex":0.003666937,"about_ca_topic_score_gemma":0.0053880573,"teacher_disagreement_score":0.009932521,"about_ca_system_score_codex":0.003987342,"about_ca_system_score_gemma":0.0028606006,"threshold_uncertainty_score":0.033227563},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06555588191477935,"score_gpt":0.34624188014887275,"score_spread":0.2806859982340934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129037541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5353379,0.0009948094,0.18562655,0.003695531,0.0009220397,0.00014378669,0.00074436836,0.0010406099,0.27149433],"genre_scores_gemma":[0.9252216,0.00041943567,0.0149633,0.00075291994,0.00057034055,0.000077462406,0.00046797798,0.00039310643,0.057133846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883133,0.0002332284,0.000057411893,0.00022440376,0.00031320626,0.00034047343],"domain_scores_gemma":[0.9975501,0.0008244693,0.00030447135,0.00036575296,0.00044426823,0.0005109537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013214565,0.0013696535,0.0010232511,0.0025954712,0.0047399374,0.0048547816,0.0011408693,0.00150613,0.011301663],"category_scores_gemma":[0.0031874566,0.0008730216,0.0019654871,0.0022013779,0.005942858,0.009162087,0.0033295474,0.0052063763,0.0019703093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037717968,0.000014029041,0.00010417851,0.000013171664,0.0000049996765,0.000045003013,0.00019586952,0.00013268662,0.00047333958,0.99737835,0.0005080219,0.0010925398],"study_design_scores_gemma":[0.000015337659,0.000012171088,0.00012251039,0.000005225891,0.000011101735,0.00007058083,0.0000991254,0.0006819729,0.0006171138,0.99551266,0.0028379788,0.000014114482],"about_ca_topic_score_codex":0.0012023848,"about_ca_topic_score_gemma":0.0012122535,"teacher_disagreement_score":0.011301663,"about_ca_system_score_codex":0.0019075995,"about_ca_system_score_gemma":0.0009742113,"threshold_uncertainty_score":0.037807822},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022615287767946794,"score_gpt":0.27566908412866226,"score_spread":0.25305379636071546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131174171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11416112,0.009227965,0.65453464,0.0077750734,0.0012678679,0.00015432261,0.0064107548,0.0031602015,0.20330806],"genre_scores_gemma":[0.6964665,0.0047759,0.20011711,0.0009438551,0.0014233878,0.00032435864,0.006106352,0.0007916437,0.08905093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880064,0.00032087194,0.00012653647,0.0002726617,0.00037296137,0.00010633646],"domain_scores_gemma":[0.9932545,0.0033472134,0.0005172351,0.0017096136,0.0008425023,0.00032908804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016344057,0.00083162374,0.0010480593,0.003598744,0.0023147142,0.008056338,0.0019975756,0.0010155244,0.020277474],"category_scores_gemma":[0.010414554,0.0007017456,0.0009783519,0.004516766,0.003214806,0.012373261,0.0022817685,0.0050910143,0.006462442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047941525,0.00002149505,0.00017221586,0.000072246985,0.000008555532,0.000029993376,0.00016343055,0.00051457545,0.00040002572,0.981062,0.0035523302,0.0139551805],"study_design_scores_gemma":[0.000013023484,0.000011324326,0.00017859631,0.00003857829,0.000013034728,0.00012512975,0.000060352213,0.0024437637,0.0008170519,0.97533643,0.020950506,0.000012334597],"about_ca_topic_score_codex":0.0005012426,"about_ca_topic_score_gemma":0.0006414555,"teacher_disagreement_score":0.020277474,"about_ca_system_score_codex":0.0021331962,"about_ca_system_score_gemma":0.0011482374,"threshold_uncertainty_score":0.067834914},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08170340628202306,"score_gpt":0.3518667465763465,"score_spread":0.27016334029432343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950898230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5381038,0.002561853,0.16707563,0.017589888,0.00079240825,0.00005918768,0.0006742542,0.00037078132,0.27277213],"genre_scores_gemma":[0.97371304,0.0005523302,0.0106000835,0.00078697596,0.00026066208,0.00007104838,0.00022943798,0.00009944433,0.013686898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982103,0.0005952612,0.00009872583,0.00036737387,0.00034656702,0.00038174324],"domain_scores_gemma":[0.9738617,0.019325087,0.0014076345,0.0019743561,0.0018832475,0.0015479483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004538893,0.00042936564,0.0013658083,0.0018052747,0.004906062,0.0045782626,0.002069751,0.002007392,0.011749666],"category_scores_gemma":[0.02272967,0.00095248525,0.0012118604,0.0013610739,0.0068754046,0.011043168,0.0057200077,0.005018818,0.00080122036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004564452,0.000007832717,0.0003411803,0.000025429314,0.000007517593,0.00006292699,0.0001760605,0.00036924123,0.00024707997,0.996262,0.0010832557,0.0013717669],"study_design_scores_gemma":[0.000016105509,0.000009329069,0.00036536434,0.000020200141,0.000009823173,0.00014996681,0.0002599796,0.004511172,0.00026336568,0.9921888,0.002193334,0.00001254546],"about_ca_topic_score_codex":0.001458388,"about_ca_topic_score_gemma":0.001347463,"teacher_disagreement_score":0.011749666,"about_ca_system_score_codex":0.0023219646,"about_ca_system_score_gemma":0.0008590807,"threshold_uncertainty_score":0.03930652},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0322526313498849,"score_gpt":0.3096191633750647,"score_spread":0.2773665320251798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953488600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49192563,0.0010912751,0.23101993,0.005467398,0.0012286978,0.00025236476,0.0015982392,0.0010758397,0.26634055],"genre_scores_gemma":[0.912594,0.00042049275,0.02735438,0.00073592394,0.0010732355,0.00015457458,0.0009237978,0.00019957343,0.056544133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981647,0.00036363935,0.00012340765,0.00039659376,0.00050430745,0.00044737873],"domain_scores_gemma":[0.9971334,0.00096052117,0.000284997,0.0006103703,0.00050058885,0.0005100968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016502833,0.001410996,0.0014374637,0.0025585042,0.0031626972,0.0038451822,0.0013316643,0.0012646001,0.009761947],"category_scores_gemma":[0.0029336335,0.00096141297,0.0013747633,0.0017854924,0.0053572683,0.007502013,0.005265034,0.0042558094,0.0024145148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096354204,0.000028892397,0.00015193336,0.000024810031,0.00001102828,0.00010484616,0.000238929,0.000105291554,0.0012590666,0.994354,0.0009476529,0.0026771082],"study_design_scores_gemma":[0.00006639109,0.000057036978,0.0002704403,0.00001262161,0.000022104872,0.00047630278,0.00014562291,0.00090199744,0.0026598854,0.98830986,0.007054824,0.000022910997],"about_ca_topic_score_codex":0.0006353677,"about_ca_topic_score_gemma":0.00067511445,"teacher_disagreement_score":0.009761947,"about_ca_system_score_codex":0.0016350897,"about_ca_system_score_gemma":0.0011982716,"threshold_uncertainty_score":0.032657027},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04916702238295074,"score_gpt":0.3255475253210538,"score_spread":0.27638050293810307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176180624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16552432,0.012160434,0.69686747,0.007976544,0.0011189567,0.0001369172,0.00089967053,0.00068893883,0.1146268],"genre_scores_gemma":[0.79341274,0.0059356513,0.17038196,0.0007789932,0.0016654449,0.00021725731,0.0006670002,0.0002992652,0.026641734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978556,0.00077787985,0.00022830337,0.00053052994,0.0004656964,0.00014204164],"domain_scores_gemma":[0.9812237,0.014290593,0.0010137452,0.0015098567,0.0011352276,0.00082684256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038541607,0.00075471663,0.0013454657,0.0052920864,0.0034864428,0.0075952983,0.0017123456,0.0018137324,0.0058690514],"category_scores_gemma":[0.016815461,0.0008786894,0.002221752,0.0048651197,0.008103168,0.015119917,0.004659951,0.0049094106,0.00061338826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014231674,0.000014341954,0.00014164507,0.000029177168,0.000004703938,0.000029428284,0.00026637316,0.0007776184,0.00009518783,0.9930012,0.00045160454,0.005174436],"study_design_scores_gemma":[0.000005532236,0.0000053989306,0.000097930766,0.0000195356,0.0000055300893,0.000048194684,0.000100379315,0.0029744518,0.00016302125,0.9939067,0.00266613,0.0000071594645],"about_ca_topic_score_codex":0.0013954832,"about_ca_topic_score_gemma":0.0012676296,"teacher_disagreement_score":0.0075952983,"about_ca_system_score_codex":0.0032551512,"about_ca_system_score_gemma":0.001281853,"threshold_uncertainty_score":0.023617804},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04857405823965345,"score_gpt":0.31930304942665466,"score_spread":0.2707289911870012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207065630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39742908,0.0018971508,0.40313286,0.0031281218,0.0008083111,0.00030566863,0.0014384633,0.00083466264,0.19102567],"genre_scores_gemma":[0.9211205,0.0005608789,0.046399094,0.0005083272,0.00033939377,0.00027731227,0.0015258081,0.00018585347,0.029082842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808204,0.00055344886,0.00012490583,0.0005570693,0.00036634118,0.00031615628],"domain_scores_gemma":[0.9975405,0.0011627323,0.00026031514,0.00031146556,0.00028150214,0.00044351723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016868309,0.0013941474,0.0016346487,0.0037854738,0.0034531693,0.005613948,0.0019868787,0.0015815287,0.011694597],"category_scores_gemma":[0.0027189378,0.0014442723,0.0014735297,0.0025193393,0.0060159382,0.014849684,0.0072820317,0.0051666303,0.0011970367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021542546,0.000017058988,0.00010120885,0.00002224714,0.000005339787,0.00005007512,0.0004961803,0.00009834751,0.00020205019,0.9974245,0.00032679434,0.0012347254],"study_design_scores_gemma":[0.000023468083,0.00002255023,0.000140593,0.000013615523,0.00001152442,0.00011754034,0.00038825488,0.00068850187,0.00037169937,0.99518037,0.0030355523,0.000006332712],"about_ca_topic_score_codex":0.00064462,"about_ca_topic_score_gemma":0.0008523129,"teacher_disagreement_score":0.011694597,"about_ca_system_score_codex":0.0016303795,"about_ca_system_score_gemma":0.00053957425,"threshold_uncertainty_score":0.039122343},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04312370273887596,"score_gpt":0.3405124272735469,"score_spread":0.29738872453467097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391817173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11393031,0.0020370407,0.6357509,0.020183641,0.0017352661,0.00011478742,0.0019422709,0.0010658469,0.22324005],"genre_scores_gemma":[0.864504,0.0011047595,0.07691767,0.004860224,0.0026094678,0.00040125882,0.0012425797,0.0006839789,0.047676057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938944,0.0008586046,0.0004762823,0.00252005,0.0013685923,0.0008820653],"domain_scores_gemma":[0.966155,0.02011071,0.0014874737,0.0071244957,0.0032442817,0.0018780348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051011657,0.0014138281,0.0037003674,0.003083339,0.0045437645,0.0068167937,0.0037219916,0.0033189321,0.016744537],"category_scores_gemma":[0.022211676,0.0019472898,0.0057040625,0.0024040157,0.009262909,0.038218092,0.00740552,0.014023867,0.0024722174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056500725,0.000021722313,0.00047677264,0.000074864,0.000023556759,0.00007482374,0.00016467624,0.0006048094,0.0005224519,0.99212205,0.0025993967,0.0032583906],"study_design_scores_gemma":[0.000020124076,0.00001144506,0.00027596645,0.000012271243,0.000013847453,0.00013680091,0.00003942031,0.002588995,0.0004104775,0.9932862,0.0031875991,0.000016917154],"about_ca_topic_score_codex":0.0017167822,"about_ca_topic_score_gemma":0.0025098906,"teacher_disagreement_score":0.016744537,"about_ca_system_score_codex":0.0029084864,"about_ca_system_score_gemma":0.0016162359,"threshold_uncertainty_score":0.056016028},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Algebra over a field; Chain (unit); Combinatorics; Discrete mathematics; Arithmetic; Pure mathematics","score_opus":0.05107347960088803,"score_gpt":0.3586310636584284,"score_spread":0.30755758405754036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408568635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6694844,0.000814732,0.16735174,0.0011002927,0.00048575507,0.00017490466,0.0018223783,0.00055109966,0.15821472],"genre_scores_gemma":[0.90363187,0.00052301184,0.037847437,0.00033045592,0.00023279477,0.00015972872,0.0017669005,0.00039292887,0.05511498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989943,0.00020181602,0.000082839586,0.00027090212,0.00029698916,0.00015313285],"domain_scores_gemma":[0.9958935,0.0019000586,0.000413006,0.00043145154,0.0006459949,0.00071604305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007249439,0.00052680133,0.00096429634,0.0022711297,0.0023127429,0.0033264742,0.0011745861,0.0012359181,0.01987743],"category_scores_gemma":[0.0049861693,0.00096627313,0.0009400294,0.002356589,0.0021361175,0.0066426797,0.0032169216,0.0020647342,0.0022154239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083727966,0.000039067156,0.0010805419,0.00007945551,0.000025228126,0.00060026266,0.00072316476,0.00043878643,0.0015478741,0.984891,0.001974288,0.00851654],"study_design_scores_gemma":[0.00001814055,0.000017118824,0.00040800497,0.000024855943,0.000022887954,0.00033580113,0.00030128533,0.0013812883,0.0007893849,0.9917767,0.0049126986,0.00001184942],"about_ca_topic_score_codex":0.0011362209,"about_ca_topic_score_gemma":0.0019376895,"teacher_disagreement_score":0.01987743,"about_ca_system_score_codex":0.00083376485,"about_ca_system_score_gemma":0.00063787634,"threshold_uncertainty_score":0.06649667},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05672658853150693,"score_gpt":0.31796127070312385,"score_spread":0.26123468217161694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417424742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17948715,0.0009797018,0.46649343,0.00882653,0.0014366993,0.00013516854,0.0010185352,0.0009938944,0.34062883],"genre_scores_gemma":[0.8992696,0.0005365803,0.063853346,0.0021517072,0.0010842578,0.00031858069,0.00078533083,0.0005060805,0.0314945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99544686,0.0013676177,0.00035192384,0.0010312231,0.0010809383,0.00072142587],"domain_scores_gemma":[0.98686635,0.007788052,0.0007557482,0.0016668001,0.0018891427,0.0010339039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046883128,0.0007269706,0.0010588479,0.002671133,0.004644063,0.005339514,0.0018420997,0.0029889443,0.014523864],"category_scores_gemma":[0.012363204,0.0011142811,0.0025333816,0.0014028884,0.007362563,0.015549355,0.006419754,0.007777526,0.0017236449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017637403,0.000010924463,0.000098210054,0.000013559264,0.0000060906336,0.0000694277,0.00012598209,0.00014806213,0.00031261795,0.99785775,0.0004487743,0.00089086336],"study_design_scores_gemma":[0.0000114400955,0.000007438641,0.00012513576,0.000009647022,0.000005361957,0.00008125347,0.00007247221,0.0007118715,0.0003578535,0.9965911,0.0020168694,0.000009481405],"about_ca_topic_score_codex":0.0011075267,"about_ca_topic_score_gemma":0.0014381689,"teacher_disagreement_score":0.014523864,"about_ca_system_score_codex":0.001968731,"about_ca_system_score_gemma":0.0017148147,"threshold_uncertainty_score":0.048587143},"labels":[],"label_agreement":null}]}