{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01465598,0.000020655414,0.97371334,0.0030240596,0.00015697349,0.0006142801,0.000027273161,0.00006860268,0.00771885],"genre_scores_gemma":[0.7133479,0.000001250953,0.28627083,0.00013508412,0.00007176578,0.00006344167,0.0000013247278,0.000007729864,0.00010068775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987366,0.00007997959,0.00032820023,0.0003553195,0.00016016772,0.00033970346],"domain_scores_gemma":[0.9959587,0.0017919765,0.00022928978,0.0018669877,0.00005905951,0.00009401206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078978715,0.00015657941,0.00029671245,0.000039135673,0.00053780706,0.000159278,0.002195036,0.000038168775,0.000021448428],"category_scores_gemma":[0.0011188413,0.00009156892,0.00021515443,0.000054879605,0.00052206067,0.00016041336,0.0011754117,0.0001282155,0.00005267337],"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.000004229724,0.00014000839,0.000016881468,0.00006846323,0.000016848391,0.00008736445,0.0005685628,0.000016155796,0.0001257021,0.98364985,0.00015276148,0.015153143],"study_design_scores_gemma":[0.00018254296,0.00017078234,0.00033550267,0.000013931941,0.000009868501,0.00032907032,0.000028708657,0.23717873,0.00019123433,0.76132435,0.0001414526,0.00009382307],"about_ca_topic_score_codex":0.000021119326,"about_ca_topic_score_gemma":0.00002481545,"teacher_disagreement_score":0.6986919,"about_ca_system_score_codex":0.000014242909,"about_ca_system_score_gemma":0.000035897137,"threshold_uncertainty_score":0.41364315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082767665,0.00011722177,0.8792522,0.0013870598,0.000044755685,0.0013422564,0.00010124043,0.00014572543,0.034841876],"genre_scores_gemma":[0.7115299,0.000007712887,0.28739926,0.00033477208,0.000034656303,0.000024926458,0.000014747036,0.000017034185,0.00063696696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887043,0.00009086782,0.00039217388,0.00024298562,0.0001149054,0.0002886384],"domain_scores_gemma":[0.99798036,0.0014564461,0.00013090181,0.00029600383,0.000041165036,0.00009510785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039154716,0.0001782628,0.00047083918,0.00004936694,0.000118451826,0.0000072563766,0.00018062955,0.000067473055,0.000095160845],"category_scores_gemma":[0.00086507545,0.00010913656,0.0001198986,0.000046828645,0.00042306026,0.00005570016,0.00006151146,0.0001593689,0.000015564088],"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.00008924672,0.00026257866,0.000013917709,0.00025957677,0.000024149564,0.0000048211095,0.0003916138,7.741263e-7,0.0035840392,0.993745,0.00023364747,0.0013905856],"study_design_scores_gemma":[0.0004698985,0.00048204415,0.0001363607,0.000054575266,0.000052974716,0.00003613433,0.00008447614,0.0009922668,0.0014952704,0.99568045,0.0003626062,0.00015296094],"about_ca_topic_score_codex":6.171829e-7,"about_ca_topic_score_gemma":0.0000014532164,"teacher_disagreement_score":0.62876225,"about_ca_system_score_codex":0.000007733307,"about_ca_system_score_gemma":0.00001280994,"threshold_uncertainty_score":0.44504598},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011169289,0.00009747954,0.9839668,0.0022551683,0.00005856585,0.00032081525,0.0000040313485,0.000046416557,0.002081381],"genre_scores_gemma":[0.5813611,0.000012204942,0.4172597,0.00047772174,0.00007388512,0.0001056667,0.0000075157973,0.000005039049,0.0006971402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994062,0.000028555,0.00015411738,0.00015192377,0.00012977261,0.00012939154],"domain_scores_gemma":[0.9992053,0.0005237085,0.000041180356,0.00016173895,0.000029362198,0.000038690854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032900175,0.000068981426,0.000106424835,0.000039444327,0.00018083227,0.000116977986,0.0002457544,0.000014974417,0.0000067250044],"category_scores_gemma":[0.00018299236,0.000041552754,0.000059717728,0.00008819613,0.00012361366,0.00013497882,0.00015058962,0.000046021778,0.000040663894],"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.0000076050724,0.00002502077,0.0000013727348,0.000026385303,0.0000068013987,7.865316e-7,0.00042295502,0.0010730433,0.00007183831,0.9977427,0.00004716259,0.00057434285],"study_design_scores_gemma":[0.0007071772,0.00005073543,0.00013905944,0.000009156813,0.0000062998274,0.000029730007,0.000014881439,0.035341945,0.00023330543,0.96286696,0.00054370286,0.000057064393],"about_ca_topic_score_codex":0.0000011139114,"about_ca_topic_score_gemma":0.0000012935582,"teacher_disagreement_score":0.57019186,"about_ca_system_score_codex":0.000008290408,"about_ca_system_score_gemma":0.000023990666,"threshold_uncertainty_score":0.1694472},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012381733,0.000019124485,0.9804195,0.0010053691,0.00006763933,0.0002042859,0.0000079248475,0.00007687383,0.0058175456],"genre_scores_gemma":[0.59635735,0.000001318666,0.40338704,0.00012813546,0.000042906995,0.00001923752,0.0000035885316,0.000004627093,0.0000557914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926746,0.00001953968,0.00023237507,0.00017658195,0.0001246578,0.00017937017],"domain_scores_gemma":[0.99914676,0.00046844635,0.00007372035,0.00022031576,0.000032604963,0.000058172227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016191714,0.000091733025,0.00017765911,0.00004774768,0.00006986206,0.000019793402,0.00041397984,0.000023662147,0.0000109807725],"category_scores_gemma":[0.00018121481,0.000066025495,0.00010715368,0.00010735006,0.00010950862,0.00011327757,0.00014203905,0.00005107448,0.000056919154],"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.0000063859525,0.00008623341,0.0000013873695,0.00004617312,0.00000877312,7.368857e-7,0.0005393645,0.00016761772,0.00083483616,0.99444807,0.000024852874,0.0038355757],"study_design_scores_gemma":[0.0003045809,0.00020340737,0.000086201784,0.00003055204,0.000005163363,0.000007896758,0.000019314162,0.012051154,0.004691528,0.9823829,0.00013750445,0.000079808655],"about_ca_topic_score_codex":0.000002317694,"about_ca_topic_score_gemma":8.975789e-7,"teacher_disagreement_score":0.5839756,"about_ca_system_score_codex":0.0000088297475,"about_ca_system_score_gemma":0.000040442395,"threshold_uncertainty_score":0.26924416},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20437957,0.00013390214,0.7563938,0.008728293,0.000082603496,0.0026026098,0.000066111934,0.00026924905,0.027343871],"genre_scores_gemma":[0.39420795,0.000009708198,0.60453236,0.00023576953,0.000062502586,0.00040196383,0.000011332869,0.0000590407,0.00047933942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983437,0.000051876737,0.0003896918,0.00033720938,0.00029367118,0.0005838304],"domain_scores_gemma":[0.99745333,0.0019221163,0.000061023224,0.00037535175,0.000058295456,0.0001298912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004191289,0.00021716424,0.00040706666,0.00014474866,0.00010495853,0.000059942446,0.00033437178,0.00005986825,0.0001277963],"category_scores_gemma":[0.002807269,0.00016524206,0.0001211085,0.00019491898,0.00031821866,0.00016897617,0.00014904315,0.00024746518,0.00017092051],"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.00004904045,0.00032913126,0.00006180603,0.00027144508,0.000013886376,0.000023376857,0.00088476046,0.0000408764,0.0009865768,0.9968984,0.00019537423,0.0002453198],"study_design_scores_gemma":[0.001019554,0.00019606773,0.00009908792,0.000111185625,0.000010995302,0.000025402967,0.00026940068,0.00027973737,0.0019803871,0.9953924,0.0004111355,0.00020469297],"about_ca_topic_score_codex":0.000006536342,"about_ca_topic_score_gemma":0.00004859012,"teacher_disagreement_score":0.18982838,"about_ca_system_score_codex":0.00009374292,"about_ca_system_score_gemma":0.00007153337,"threshold_uncertainty_score":0.67383754},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02163924,0.00006144587,0.97112566,0.0017620575,0.0001297599,0.0005223136,0.0000075476883,0.00020825843,0.0045436923],"genre_scores_gemma":[0.47056082,0.0000143686575,0.528931,0.000188269,0.00005767228,0.00009261847,0.0000035613298,0.000009634363,0.00014201469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985501,0.00007012051,0.00029554905,0.00049174286,0.00020855504,0.00038389134],"domain_scores_gemma":[0.9976958,0.0014746464,0.000067344816,0.0005294527,0.0000568474,0.00017590843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036442114,0.00016871931,0.00026259976,0.00018447121,0.00018056796,0.00012141959,0.00054171914,0.00005419677,0.00003311985],"category_scores_gemma":[0.0006481902,0.00013352835,0.000104168685,0.0005172929,0.0001943482,0.0001789568,0.0004044409,0.00014720162,0.000063410946],"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.000007775616,0.00032677737,0.00031257333,0.00005922819,0.000020563437,0.000011384417,0.00033842702,0.00012618204,0.00004525216,0.953451,0.0004367597,0.04486411],"study_design_scores_gemma":[0.0001881933,0.00016147237,0.0027917663,0.000008545282,0.0000073901992,0.00018646613,0.00001812817,0.24126594,0.000015202356,0.7544213,0.0008045181,0.00013107347],"about_ca_topic_score_codex":0.0000041863696,"about_ca_topic_score_gemma":0.0000020220145,"teacher_disagreement_score":0.4489216,"about_ca_system_score_codex":0.000025855607,"about_ca_system_score_gemma":0.000027867662,"threshold_uncertainty_score":0.5445128},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041644243,0.000008878931,0.9040683,0.00038975143,0.00006878635,0.0007457367,0.0000729029,0.00008993731,0.090391286],"genre_scores_gemma":[0.20572826,0.000007528996,0.7793182,0.00205396,0.00012322997,0.00041609208,0.000054050888,0.00008827528,0.012210375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884963,0.000103823586,0.0003060287,0.000283747,0.00010112045,0.0003556793],"domain_scores_gemma":[0.9953067,0.0040777833,0.00011208588,0.0003689812,0.000024601688,0.00010985576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061716116,0.00018040197,0.00040277315,0.000027477881,0.00016263858,0.00003360107,0.0005894821,0.000080865306,0.00041383714],"category_scores_gemma":[0.0012062467,0.00013747324,0.00011018456,0.00004114947,0.00022784213,0.00009641349,0.00026184696,0.00014203698,0.00027006463],"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.000053506454,0.00017265239,0.0000013267023,0.00013026847,0.000021659771,7.9673214e-7,0.0001874247,0.000002098342,0.003608699,0.9758297,0.019425532,0.0005663368],"study_design_scores_gemma":[0.0005506136,0.00022526938,0.0000013231434,0.000028695085,0.000029891373,0.0000079364245,0.000047140253,0.0009431562,0.005316187,0.9719488,0.0207164,0.00018458377],"about_ca_topic_score_codex":9.110904e-7,"about_ca_topic_score_gemma":0.0000012539057,"teacher_disagreement_score":0.20156384,"about_ca_system_score_codex":0.000013142606,"about_ca_system_score_gemma":0.000009804677,"threshold_uncertainty_score":0.56059957},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021027545,0.00008388441,0.9836845,0.0027712905,0.0001271121,0.0016754646,0.000094403345,0.00014185508,0.009318739],"genre_scores_gemma":[0.31141725,0.000018687377,0.6840199,0.0015246951,0.00033423916,0.0012738006,0.000029077122,0.00008561255,0.0012967163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986558,0.000055917215,0.000383115,0.00028171754,0.0001350019,0.0004884671],"domain_scores_gemma":[0.98863184,0.0106487805,0.00012367286,0.00045878388,0.000052950207,0.00008395302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077735074,0.00022726531,0.00036480112,0.000039849278,0.00041365426,0.000018933442,0.0004364946,0.000102234764,0.00013097374],"category_scores_gemma":[0.0026047518,0.00012913816,0.00031912822,0.00006041123,0.0005320811,0.00005614135,0.00008605807,0.00019615742,0.000091606365],"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.00016578658,0.0001784153,7.352391e-7,0.00016440997,0.000067187684,0.0000022775175,0.00072723127,0.000052969794,0.00018110812,0.99688894,0.0007481171,0.0008228065],"study_design_scores_gemma":[0.0010521432,0.00027558728,0.0000063843404,0.00004214999,0.00010103077,0.00003886191,0.0003782996,0.00057404285,0.0007692977,0.99427444,0.0023073016,0.00018047844],"about_ca_topic_score_codex":7.6648e-7,"about_ca_topic_score_gemma":0.0000066654093,"teacher_disagreement_score":0.30931452,"about_ca_system_score_codex":0.00003058702,"about_ca_system_score_gemma":0.000037351427,"threshold_uncertainty_score":0.52661014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006571823,0.00009631412,0.9908378,0.00080012914,0.00007451336,0.0010317881,0.000014624077,0.000102392565,0.006385235],"genre_scores_gemma":[0.58119804,0.0000013589159,0.41605046,0.00052144943,0.00016006941,0.0004592112,0.000019683335,0.000013513734,0.0015762076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988964,0.00007040137,0.00025161356,0.00033672494,0.0001298698,0.00031497664],"domain_scores_gemma":[0.99846816,0.0010513213,0.000072743045,0.00023827801,0.000069518326,0.000099977726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799466,0.00013951956,0.00021879603,0.00004838946,0.00017943728,0.000111988425,0.00030611028,0.00005268086,0.000047316036],"category_scores_gemma":[0.00022903147,0.00009545188,0.00010352768,0.000065576445,0.0001276272,0.0001383942,0.00010834691,0.00006725236,0.00006129629],"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.000021654041,0.00012318183,0.0000026292769,0.00017444447,0.00002413209,0.000001141977,0.00068364735,0.0000029187233,0.00029601602,0.987543,0.00042133042,0.010705896],"study_design_scores_gemma":[0.00045087122,0.00023874639,0.00002544072,0.0000066318344,0.00001224238,0.000043832613,0.00003115587,0.05210231,0.00034641006,0.9362997,0.010300389,0.0001422627],"about_ca_topic_score_codex":7.556763e-7,"about_ca_topic_score_gemma":0.000006352918,"teacher_disagreement_score":0.5805409,"about_ca_system_score_codex":0.000012485928,"about_ca_system_score_gemma":0.000031390886,"threshold_uncertainty_score":0.38924146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3571254,0.000014975384,0.5985733,0.00011175652,0.000067428264,0.0007322255,0.000032264757,0.000047109774,0.0432955],"genre_scores_gemma":[0.8568819,0.000004346596,0.14264509,0.000038950224,0.00001584369,0.00008653307,0.0000048278785,0.000013151909,0.00030934942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991128,0.000061868275,0.000438858,0.00012564116,0.00008860047,0.00017225041],"domain_scores_gemma":[0.99673754,0.0027388346,0.00020056765,0.00021296562,0.00007076593,0.000039307055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002293502,0.00010956274,0.0003746009,0.00006910703,0.000034484372,0.000002296657,0.00014229037,0.0000615975,0.00041984092],"category_scores_gemma":[0.0012378427,0.00008067294,0.00015616561,0.00005422068,0.0003903823,0.00006605694,0.00003884836,0.000080310674,0.000041076684],"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.000037661233,0.00014710317,0.00002927701,0.00049510394,0.000044977238,2.4119646e-7,0.0010754013,0.0000038074584,0.0065577035,0.990535,0.0004336542,0.00064006605],"study_design_scores_gemma":[0.00024574826,0.00021102508,0.0000757202,0.000068331756,0.00003208415,0.0000068492977,0.0012624566,0.0003268623,0.008577357,0.989089,0.000028788341,0.000075779426],"about_ca_topic_score_codex":0.000005894554,"about_ca_topic_score_gemma":0.0000037580464,"teacher_disagreement_score":0.49975652,"about_ca_system_score_codex":0.000008488569,"about_ca_system_score_gemma":0.00000919446,"threshold_uncertainty_score":0.45969635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015997421,0.00024461513,0.8975235,0.00061116036,0.0002417499,0.0006558993,0.000007242307,0.000051773433,0.09906432],"genre_scores_gemma":[0.90746427,0.00002929116,0.08953313,0.0005221873,0.00005732693,0.00017561881,0.0000014348324,0.00001597724,0.0022007814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985275,0.0002002538,0.00032773148,0.00026268588,0.00026453688,0.00041729043],"domain_scores_gemma":[0.9960111,0.0029753505,0.00014841047,0.000710626,0.00008176819,0.00007274837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009051163,0.00016177353,0.00028501978,0.000021777316,0.00041868593,0.000092903654,0.001273983,0.000056565314,0.000032119446],"category_scores_gemma":[0.0016264351,0.00007052078,0.00025909618,0.00018015195,0.00034708602,0.000084761254,0.00022324889,0.00016454005,0.00007141618],"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.000013315665,0.00010078062,0.000030310308,0.000036629564,0.000018173363,6.0047637e-7,0.00042495164,0.000028886483,0.00020937735,0.9980042,0.0008036905,0.00032909305],"study_design_scores_gemma":[0.0006268804,0.00011383393,0.00009336951,0.000023077575,0.00001545941,0.000019981799,0.00004664235,0.019767033,0.0009483649,0.9723929,0.005846492,0.00010596431],"about_ca_topic_score_codex":0.0000021812505,"about_ca_topic_score_gemma":0.000004876358,"teacher_disagreement_score":0.90586454,"about_ca_system_score_codex":0.00001772015,"about_ca_system_score_gemma":0.000075493605,"threshold_uncertainty_score":0.3220236},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013869672,0.0000117369855,0.9797469,0.0005281635,0.0001304297,0.0006702609,0.000007113674,0.00038017827,0.004655546],"genre_scores_gemma":[0.39172137,0.0000011453363,0.60763115,0.00025425304,0.000114021685,0.0001051427,0.000010683552,0.000016637165,0.00014560828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982765,0.00006980365,0.0003216767,0.00056414126,0.00032877113,0.0004391388],"domain_scores_gemma":[0.9978702,0.0011110448,0.000099521276,0.0006323565,0.00013079704,0.00015605713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027418745,0.00022924936,0.0003310069,0.00007740209,0.00028622852,0.00004666923,0.00065249624,0.000049470073,0.00003768741],"category_scores_gemma":[0.0005667122,0.00015763,0.00013202748,0.0002802882,0.0002687262,0.0001517729,0.00025710088,0.00016398363,0.00012062327],"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.00006911185,0.00064894167,0.0004705526,0.00019045969,0.00005987925,0.000047853377,0.0011901798,0.00058088655,0.00014054433,0.990345,0.00073368166,0.005522905],"study_design_scores_gemma":[0.0004945673,0.00074502337,0.0017870123,0.000023480785,0.000016695147,0.0001329085,0.000023382163,0.26520717,0.00006641171,0.7306232,0.0006370176,0.00024314522],"about_ca_topic_score_codex":0.0000052255186,"about_ca_topic_score_gemma":0.0000036687752,"teacher_disagreement_score":0.3778517,"about_ca_system_score_codex":0.000030384945,"about_ca_system_score_gemma":0.00006441248,"threshold_uncertainty_score":0.64279646},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51658064,0.0001820247,0.44763047,0.0021180443,0.000069340305,0.003547118,0.000034660992,0.0003548837,0.02948283],"genre_scores_gemma":[0.35586628,0.000010897998,0.6418244,0.00024142988,0.00011410412,0.0005599152,0.0000075582802,0.00006650445,0.00130887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985657,0.00006614618,0.00034333536,0.00031652043,0.00022266227,0.00048567416],"domain_scores_gemma":[0.99568623,0.0036777009,0.00006931495,0.00030926353,0.00006747671,0.00018999088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035569686,0.0001961954,0.00034683614,0.000073250565,0.0001693978,0.00008197179,0.00022080545,0.000064849926,0.00049633614],"category_scores_gemma":[0.003089102,0.00014043447,0.00008858703,0.00008880551,0.00021643128,0.00016522272,0.00019325415,0.00019255141,0.00043144138],"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.00001039981,0.000091996466,0.00005327348,0.00029354388,0.000032731637,0.0000022194417,0.00034838048,5.5501226e-7,0.002279513,0.99223554,0.0013964009,0.0032554679],"study_design_scores_gemma":[0.0003599653,0.00015093482,0.00013088778,0.000053092248,0.000020671516,0.000019659698,0.00018160975,0.0039253277,0.0009315828,0.9937461,0.00030004157,0.00018014082],"about_ca_topic_score_codex":0.0000023408434,"about_ca_topic_score_gemma":0.0000022504255,"teacher_disagreement_score":0.19419397,"about_ca_system_score_codex":0.00001882245,"about_ca_system_score_gemma":0.0000199315,"threshold_uncertainty_score":0.5726751},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008680558,0.00010233231,0.98146605,0.0026415314,0.00007887293,0.0003156372,0.000019206966,0.00011275724,0.0065830504],"genre_scores_gemma":[0.92487925,0.000027691858,0.07422457,0.0005923012,0.0000358253,0.00003058875,0.000003928363,0.000005776469,0.0002000447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899656,0.00006661223,0.00024088279,0.00020800649,0.0001865102,0.00030143105],"domain_scores_gemma":[0.9971134,0.0021250336,0.00012520658,0.00055203703,0.000029302033,0.000055037814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006006666,0.00012388747,0.00020982439,0.000027072087,0.00017249989,0.00007870739,0.0011409471,0.000028162565,0.0000158684],"category_scores_gemma":[0.00027759076,0.00006721191,0.00013470938,0.00008371836,0.00023664733,0.00016532328,0.00015619626,0.00007288333,0.00003348697],"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.0000124004455,0.00005569137,0.0000026950584,0.000022193106,0.000007710444,0.0000012933908,0.00035773008,6.1717185e-7,0.0041082785,0.9777141,0.00009095071,0.017626291],"study_design_scores_gemma":[0.00011432488,0.00023283031,0.000978505,0.000038509632,0.000005885836,0.000013673077,0.00003238772,0.008292907,0.0034794726,0.9863716,0.00034800108,0.000091944275],"about_ca_topic_score_codex":3.0959555e-7,"about_ca_topic_score_gemma":1.2129307e-7,"teacher_disagreement_score":0.91619873,"about_ca_system_score_codex":0.000005483748,"about_ca_system_score_gemma":0.000016184315,"threshold_uncertainty_score":0.27408224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2807615,0.00011974373,0.6197113,0.0022922414,0.000088972294,0.003523808,0.00006262726,0.00007907168,0.093360774],"genre_scores_gemma":[0.91582453,0.0000048753836,0.0831767,0.00018858397,0.000031990145,0.00037029607,0.0000037856241,0.00001532323,0.00038389672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986625,0.00027521854,0.0004004621,0.00018658322,0.00016158713,0.00031369252],"domain_scores_gemma":[0.99053705,0.008832556,0.00012435186,0.000420425,0.000044506945,0.000041083815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009161749,0.00014799707,0.0003729362,0.00005959798,0.000066674525,0.000009710143,0.000463752,0.00006659296,0.0002913138],"category_scores_gemma":[0.0026151082,0.000082969105,0.00015547764,0.00009433166,0.00046220425,0.00007933011,0.00007584526,0.00018154296,0.000074498435],"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.000028916094,0.0001907438,0.00003263975,0.0001740785,0.000017991868,0.000002124899,0.002312095,0.000008799334,0.00039340765,0.9955291,0.000732967,0.0005771435],"study_design_scores_gemma":[0.00026668698,0.00013334467,0.00018588644,0.00006081453,0.00002248464,0.000019695364,0.001378095,0.0006738156,0.00043812295,0.99662924,0.00009405326,0.00009778705],"about_ca_topic_score_codex":0.0000032046082,"about_ca_topic_score_gemma":0.000004452136,"teacher_disagreement_score":0.63506305,"about_ca_system_score_codex":0.000008694746,"about_ca_system_score_gemma":0.00001742758,"threshold_uncertainty_score":0.3383382},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014601521,0.000015941787,0.97688466,0.0026051009,0.00005775184,0.0004701826,0.00004705855,0.000092322356,0.0052254605],"genre_scores_gemma":[0.8932877,0.0000015126536,0.1062702,0.00026235756,0.00003967633,0.00006434402,0.000008630343,0.000006359477,0.000059225167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874985,0.000119469725,0.00031812637,0.00029367843,0.00024240413,0.00027645016],"domain_scores_gemma":[0.9932628,0.0059277727,0.00010755124,0.00058671733,0.000054020034,0.0000611214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054161676,0.00013457915,0.00021644223,0.000030457439,0.00014858968,0.000045454555,0.00075259106,0.000030309347,0.00009040651],"category_scores_gemma":[0.0015583632,0.00007946198,0.00015973783,0.00017238753,0.00016621593,0.00006648246,0.00025108678,0.000117189746,0.00008758877],"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.0000030048434,0.00025704058,0.000015620075,0.00005093364,0.000008027445,0.000001273632,0.00024368857,0.00007562017,0.000062203435,0.9933565,0.0007342103,0.0051918374],"study_design_scores_gemma":[0.00008701863,0.00018899306,0.000199169,0.000025283643,0.0000048596344,0.0000058511696,0.000011987148,0.3646623,0.00025432894,0.63436675,0.00012843535,0.000065021006],"about_ca_topic_score_codex":0.0000017197934,"about_ca_topic_score_gemma":5.424713e-7,"teacher_disagreement_score":0.8786862,"about_ca_system_score_codex":0.000021995837,"about_ca_system_score_gemma":0.000007815424,"threshold_uncertainty_score":0.32403654},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011753848,0.000043529155,0.9798571,0.00022263009,0.000068724454,0.0011746392,0.0003637791,0.000090278336,0.006425478],"genre_scores_gemma":[0.62151414,0.0000029857254,0.37702158,0.0000917412,0.00010053324,0.00038125282,0.000077718774,0.000042128515,0.0007679118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829143,0.000081611324,0.00068557274,0.00030802994,0.00017729365,0.00045608435],"domain_scores_gemma":[0.9922254,0.0069811707,0.00023115725,0.0003666121,0.00013181035,0.000063849955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006085361,0.00026265878,0.0007660094,0.00007949167,0.00019599267,0.000011109659,0.00032051458,0.00012633261,0.000065821856],"category_scores_gemma":[0.0011270026,0.00019331697,0.00031801325,0.000083517785,0.00061353046,0.00007755738,0.00007183435,0.00012895599,0.000009623873],"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.0003726387,0.00044997683,0.000008111415,0.00060837367,0.000044580294,0.0000014456124,0.00023448924,0.00063929433,0.0016672552,0.99477434,0.0010795362,0.00011993708],"study_design_scores_gemma":[0.0012360797,0.00023254812,0.0000062946965,0.000026079282,0.000120548204,0.000013799686,0.00014421919,0.03959848,0.0013416889,0.9568807,0.00017949937,0.00022010051],"about_ca_topic_score_codex":0.0000049362807,"about_ca_topic_score_gemma":0.00001478014,"teacher_disagreement_score":0.6097603,"about_ca_system_score_codex":0.000025554653,"about_ca_system_score_gemma":0.000046685545,"threshold_uncertainty_score":0.7883237},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12684418,0.00015484542,0.8407355,0.0055669784,0.00026757558,0.0079477895,0.00022712054,0.0008979256,0.017358078],"genre_scores_gemma":[0.178669,0.000012125235,0.80999804,0.0012901236,0.0004920203,0.0026117524,0.000054167445,0.00020061948,0.006672133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971339,0.00013085894,0.00067014043,0.0005529116,0.00054183893,0.000970337],"domain_scores_gemma":[0.9952458,0.0033225673,0.00012978112,0.00075912225,0.0001695111,0.000373175],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046313787,0.00038713185,0.00064208807,0.00015254148,0.00022122933,0.0001243546,0.00061732467,0.0001406668,0.0019164892],"category_scores_gemma":[0.0022289017,0.000281947,0.00029488528,0.000110960624,0.00037609294,0.00037523254,0.00031370847,0.00039001933,0.0026092841],"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.000018692892,0.0003149675,0.000018803166,0.00029594565,0.00006049004,0.000016304379,0.00040423145,0.0000032310638,0.0024556427,0.9837618,0.011591128,0.0010587742],"study_design_scores_gemma":[0.0006967071,0.00028562805,0.00007711142,0.000063746076,0.000034007917,0.000037777634,0.00014219352,0.007879844,0.002192744,0.9874016,0.0008215627,0.00036706103],"about_ca_topic_score_codex":0.000006759589,"about_ca_topic_score_gemma":0.0000040099867,"teacher_disagreement_score":0.05182482,"about_ca_system_score_codex":0.000078886,"about_ca_system_score_gemma":0.000053254615,"threshold_uncertainty_score":0.9999633},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006724858,0.000015731643,0.96596116,0.001655948,0.0004048992,0.0008178067,0.000024171577,0.00040702856,0.02398838],"genre_scores_gemma":[0.16794515,0.0000014652014,0.83101773,0.00037930827,0.0001384199,0.000107014894,0.00000936275,0.000019831308,0.0003817067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763244,0.00012022562,0.000524507,0.0007299366,0.0003517772,0.0006410809],"domain_scores_gemma":[0.99538565,0.0030927625,0.00015443392,0.00097409793,0.000137019,0.00025606737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094971823,0.00028797006,0.0004755656,0.000114144634,0.00027319457,0.00017846226,0.0014606403,0.000113734575,0.00012113601],"category_scores_gemma":[0.0009938518,0.0002265081,0.00024146192,0.00028096,0.00026222155,0.00030549706,0.0006704709,0.0004812456,0.00040314873],"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.0000071865616,0.00026673777,0.000046528145,0.000060841034,0.000019240251,0.000007303927,0.00048273386,0.00006968232,0.0019019704,0.98654795,0.0007558795,0.009833935],"study_design_scores_gemma":[0.00030490645,0.00021550409,0.00080781936,0.000013924021,0.0000088034585,0.000053393665,0.000008236555,0.2098953,0.0003333129,0.78512055,0.0030049244,0.0002333412],"about_ca_topic_score_codex":0.000007341763,"about_ca_topic_score_gemma":0.000007440038,"teacher_disagreement_score":0.2098256,"about_ca_system_score_codex":0.000025011299,"about_ca_system_score_gemma":0.00007392084,"threshold_uncertainty_score":0.9236732},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3247448,0.000020426412,0.52045774,0.00278491,0.00020987492,0.0020884154,0.00021252823,0.0003649383,0.14911638],"genre_scores_gemma":[0.9345963,0.000024364828,0.061469,0.00050754513,0.00006142497,0.0003345208,0.000019379284,0.000045112858,0.002942353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889475,0.000082158374,0.00033377204,0.00020429782,0.00016806406,0.00031697348],"domain_scores_gemma":[0.9855901,0.01376381,0.00012298672,0.00044154376,0.00003622734,0.000045307337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006540263,0.00015997718,0.00034046796,0.000079563215,0.00016842691,0.0000056474937,0.00036415487,0.000062795596,0.00014965225],"category_scores_gemma":[0.0033129423,0.00009086599,0.0001822367,0.00017039223,0.0005582096,0.000028906865,0.00010765692,0.00016476725,0.00033267695],"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.00005945411,0.00010406057,0.000003053653,0.0002231728,0.000031543594,0.000003670175,0.0009900852,0.000014887688,0.0005731119,0.99547374,0.0022260621,0.0002971327],"study_design_scores_gemma":[0.0002047437,0.00023805007,0.000042199845,0.00008464449,0.00002609526,0.0000048598645,0.00090807123,0.0018251722,0.0013998615,0.9949888,0.00017178498,0.00010569282],"about_ca_topic_score_codex":4.2470668e-7,"about_ca_topic_score_gemma":0.0000014442697,"teacher_disagreement_score":0.60985154,"about_ca_system_score_codex":0.000008144408,"about_ca_system_score_gemma":0.000015816857,"threshold_uncertainty_score":0.42760003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30061895,0.000019142704,0.6837088,0.000294465,0.000051605555,0.0014466145,0.000044334705,0.00014184609,0.013674294],"genre_scores_gemma":[0.7565974,0.0000033239367,0.23928696,0.00041495703,0.000054881268,0.00026514535,0.000018267096,0.00004639618,0.0033126974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984721,0.00009998965,0.00035484027,0.00042150772,0.00020635579,0.00044523505],"domain_scores_gemma":[0.9947161,0.0043712226,0.00016283586,0.00054687756,0.000080585545,0.0001223666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035351934,0.0002653622,0.00048877863,0.000069649395,0.000115921735,0.00001820993,0.00029961483,0.00015514673,0.00040345304],"category_scores_gemma":[0.00066300284,0.0001782232,0.00015686761,0.0000802745,0.00024738532,0.00008707119,0.00010259696,0.00034202938,0.00044242202],"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.00044791852,0.00029328503,0.00011979743,0.00022919368,0.000089858295,0.000014312894,0.001490031,0.000018300358,0.0006358452,0.9962366,0.00019350024,0.00023131404],"study_design_scores_gemma":[0.0012007459,0.0007313861,0.00015032431,0.00007573175,0.00006149153,0.00007734037,0.0004130165,0.0019258801,0.0008841495,0.9940017,0.0002118774,0.0002663735],"about_ca_topic_score_codex":0.0000013349004,"about_ca_topic_score_gemma":0.000015019644,"teacher_disagreement_score":0.45597845,"about_ca_system_score_codex":0.000024806443,"about_ca_system_score_gemma":0.000028987452,"threshold_uncertainty_score":0.7267731},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046931475,0.0000057243956,0.94759816,0.0020441166,0.000058531226,0.0009978145,0.00002350289,0.00028326747,0.0020573947],"genre_scores_gemma":[0.5495182,0.00000913686,0.44980636,0.00023416078,0.00003010299,0.00029419267,0.000009414074,0.0000129197315,0.000085477484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985659,0.000048927006,0.00033449006,0.00045485387,0.00023848674,0.00035734332],"domain_scores_gemma":[0.997723,0.0014718488,0.00007401001,0.00051596493,0.00005671832,0.00015849844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004021649,0.00015045868,0.00027584354,0.00012395131,0.00011689691,0.000046070527,0.00062563445,0.000055265882,0.0000154141],"category_scores_gemma":[0.00014471538,0.00012829948,0.00009166517,0.0004357378,0.00015356559,0.00008371609,0.00061086856,0.00010229285,0.000061535255],"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.0000070705446,0.0001087994,0.000044866414,0.00025646968,0.000021815422,0.0000028048557,0.0011731968,0.0008156768,0.00087768654,0.9863343,0.0003732134,0.0099840965],"study_design_scores_gemma":[0.00018828592,0.00015542473,0.0019793366,0.00002573123,0.000009177448,0.000008303603,0.00006756175,0.10877762,0.00025827778,0.8882879,0.00010087858,0.0001415061],"about_ca_topic_score_codex":0.000015695705,"about_ca_topic_score_gemma":0.0000072743055,"teacher_disagreement_score":0.5025868,"about_ca_system_score_codex":0.00002120861,"about_ca_system_score_gemma":0.000038808605,"threshold_uncertainty_score":0.5231901},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3719118,0.00032380832,0.6132071,0.00020063725,0.00008052969,0.00053277833,0.00006662712,0.000060440932,0.013616294],"genre_scores_gemma":[0.70777166,0.000015547776,0.29162925,0.00009689662,0.000022127038,0.00005555267,0.000016868009,0.00002148796,0.00037060768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868774,0.00012934575,0.00045717115,0.0002480359,0.00013325512,0.00034446464],"domain_scores_gemma":[0.99433964,0.005088899,0.00012344212,0.0003258503,0.0000623046,0.000059835118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004077229,0.0001560903,0.0004891541,0.00017864729,0.000059272847,0.0000058985916,0.00017244747,0.00009896124,0.00035967233],"category_scores_gemma":[0.0048998217,0.00012517125,0.00016073934,0.0003232575,0.0002169479,0.000048547372,0.00010622859,0.0001759551,0.000016148571],"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.000059991387,0.0002601222,0.000113805705,0.00052909384,0.000028380962,0.000037525366,0.0003721401,0.000026177515,0.00058564876,0.9973656,0.00018666989,0.0004348336],"study_design_scores_gemma":[0.0005520129,0.000114831775,0.00038576862,0.000047825666,0.0000346177,0.00005880186,0.00046409018,0.00021956346,0.004107565,0.9938044,0.0000766373,0.00013389473],"about_ca_topic_score_codex":9.420128e-7,"about_ca_topic_score_gemma":0.0000116405145,"teacher_disagreement_score":0.33585986,"about_ca_system_score_codex":0.000020701274,"about_ca_system_score_gemma":0.0000384662,"threshold_uncertainty_score":0.5865898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1389825,0.00029851866,0.6901824,0.0032133765,0.0004570215,0.0020620744,0.0019218741,0.00016503489,0.16271724],"genre_scores_gemma":[0.9774348,0.000041312243,0.014005061,0.00025549205,0.00005789315,0.0001306644,0.000010555186,0.000042168827,0.008022009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984986,0.00020057606,0.00046503101,0.00023505652,0.00025476972,0.00034596573],"domain_scores_gemma":[0.98457575,0.014624331,0.00014102836,0.0005296392,0.000089781366,0.0000394972],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015478731,0.0001942426,0.00041347765,0.000033976536,0.0002586773,0.000018044284,0.0003788565,0.00009139631,0.0009806136],"category_scores_gemma":[0.000920284,0.0000813789,0.00026667473,0.00010086805,0.00058524095,0.00010964243,0.00013100721,0.0002461737,0.0000640812],"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.00017014121,0.000120964585,0.0000021547787,0.0006686298,0.000137352,0.000002490265,0.001106426,0.000026517306,0.0007050018,0.99558675,0.0013603867,0.00011318103],"study_design_scores_gemma":[0.0002163159,0.0000972698,0.0000011636495,0.00020061106,0.000073348376,0.000010960463,0.0012345857,0.006997226,0.006661386,0.98237073,0.002029626,0.00010677117],"about_ca_topic_score_codex":0.000001032854,"about_ca_topic_score_gemma":0.000004938985,"teacher_disagreement_score":0.83845234,"about_ca_system_score_codex":0.00001897633,"about_ca_system_score_gemma":0.00003580995,"threshold_uncertainty_score":0.99993265},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18700461,0.000060433784,0.6267656,0.000619806,0.000046539168,0.001438005,0.0002648061,0.00010499319,0.18369523],"genre_scores_gemma":[0.89783233,0.0000060054954,0.10079772,0.000054952412,0.000010361406,0.00015615075,0.000011042086,0.000011920101,0.0011194878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991108,0.00004032803,0.00044214932,0.00015035973,0.000096612515,0.00015973463],"domain_scores_gemma":[0.9958763,0.0035455811,0.00015533382,0.00033689933,0.000051567404,0.000034333167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042057445,0.00010769581,0.0003844762,0.00013934706,0.00005380643,0.0000040550817,0.00023540114,0.000044832796,0.000046235273],"category_scores_gemma":[0.0011488715,0.00008199552,0.0002177539,0.00024383601,0.00023186517,0.000020612746,0.000061893414,0.0000643478,0.0000074596987],"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.00002646798,0.0002948276,0.00002079253,0.00081830175,0.000054455173,1.2226855e-7,0.00029331897,0.0000011671834,0.008640417,0.9889361,0.00062178145,0.00029220182],"study_design_scores_gemma":[0.0002449505,0.00007992271,0.000042458792,0.00015563723,0.000079743164,6.7980363e-7,0.00011019513,0.0006276555,0.022338262,0.97589606,0.0003562801,0.000068138244],"about_ca_topic_score_codex":9.967749e-7,"about_ca_topic_score_gemma":0.0000016323982,"teacher_disagreement_score":0.71082777,"about_ca_system_score_codex":0.0000047129456,"about_ca_system_score_gemma":0.000020874688,"threshold_uncertainty_score":0.33436802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13540217,0.000056305984,0.73672,0.0044500097,0.0001050919,0.0017867632,0.000058092217,0.00021727577,0.12120427],"genre_scores_gemma":[0.91289675,0.0000058651553,0.06929858,0.0019340687,0.000062711806,0.0004487721,0.00001102936,0.000049834594,0.015292409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854094,0.0001439595,0.0003383041,0.00034019456,0.0001688518,0.0004677498],"domain_scores_gemma":[0.9841766,0.015019129,0.00014998855,0.0005378166,0.000049710623,0.00006680561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004720135,0.00027612786,0.000507456,0.00009670741,0.0005141333,0.000023135535,0.0003825537,0.000088818284,0.00010811764],"category_scores_gemma":[0.0012839424,0.0001490073,0.00017636655,0.00014900342,0.00051075226,0.00004564363,0.00010675254,0.00023692047,0.00011051267],"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.00045794938,0.00020850768,0.000016508304,0.00023752652,0.0001180941,0.0000054304746,0.00060519343,0.000018402818,0.00046571347,0.99257004,0.0044570854,0.00083952566],"study_design_scores_gemma":[0.0008158464,0.00037484898,0.00009776828,0.00018876296,0.00012520966,0.000014949193,0.00037907474,0.00072055846,0.0040198048,0.99140966,0.0016650675,0.000188455],"about_ca_topic_score_codex":6.5904385e-7,"about_ca_topic_score_gemma":0.00004464503,"teacher_disagreement_score":0.77749455,"about_ca_system_score_codex":0.000046956455,"about_ca_system_score_gemma":0.000024416437,"threshold_uncertainty_score":0.6076342},"labels":[],"label_agreement":null}]}