{"meta":{"query_hash":"c6f5c3dbd578","filters":{"venue":"Mathematical logic quarterly"},"cohort_total":29,"direct_labels_cover":0,"predictions_cover":29,"exported":29,"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/c6f5c3dbd578","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematical+logic+quarterly"},"results":[{"id":"W1493806114","doi":"10.1002/malq.201300030","title":"Generic trivializations of geometric theories","year":2014,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; NIP; Converse; Rank (graph theory); Simplicity; Stability (learning theory); Pure mathematics; Discrete mathematics; Combinatorics; Geometry; Computer science","score_opus":0.03355777729189491,"score_gpt":0.3065429095177503,"score_spread":0.2729851322258554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493806114","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.043104675,0.000041480518,0.92087525,0.0001683499,0.00010140568,0.00018795574,0.000006275285,0.00013084701,0.035383765],"genre_scores_gemma":[0.940627,0.0000024473184,0.058137905,0.000111344496,0.00007795633,0.000029896995,0.0000044431144,0.00002284282,0.0009862108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985075,0.0002390157,0.00055135204,0.00021304352,0.00020970436,0.0002793592],"domain_scores_gemma":[0.9967395,0.0024069962,0.00020617191,0.00048096688,0.00008795445,0.00007840615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007659992,0.00018034362,0.0004985453,0.00018050284,0.00010321818,0.000012427498,0.0002651095,0.00014195821,0.0008955516],"category_scores_gemma":[0.0016863977,0.0001334195,0.00013107642,0.0004600773,0.00036027937,0.00008112187,0.000023560588,0.00012612328,0.00015719164],"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.000012648346,0.00022481215,0.000021204309,0.00013395479,0.00002476225,0.0000013575351,0.00074031967,0.000004147444,0.0001554893,0.99420464,0.00018277882,0.0042938986],"study_design_scores_gemma":[0.0002975867,0.0004309921,0.00004262514,0.000021367101,0.00005095549,0.000017242952,0.00035245297,0.00051066774,0.0004173106,0.99745953,0.00024942687,0.00014982141],"about_ca_topic_score_codex":5.9293825e-7,"about_ca_topic_score_gemma":0.0000010431925,"teacher_disagreement_score":0.8975223,"about_ca_system_score_codex":0.000014566571,"about_ca_system_score_gemma":0.0000140366,"threshold_uncertainty_score":0.9805662},"labels":[],"label_agreement":null},{"id":"W1597965172","doi":"10.1002/malq.201300006","title":"Rado's Conjecture and Ascent Paths of Square Sequences","year":2014,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Successor cardinal; Mathematics; Conjecture; Continuation; Combinatorics; Square (algebra); Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.022191613290356616,"score_gpt":0.29666036370792476,"score_spread":0.27446875041756813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597965172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65782434,0.00024087196,0.3201498,0.0012512599,0.0001632496,0.00057300134,0.000023369901,0.00022222011,0.019551868],"genre_scores_gemma":[0.9710555,0.0000038490393,0.02855645,0.00014968406,0.000049823226,0.000015705458,0.0000027550539,0.000016146214,0.00015010535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863946,0.00021522812,0.0004386832,0.00025048605,0.00018599986,0.00027012042],"domain_scores_gemma":[0.99789107,0.001444848,0.00017401298,0.0003458744,0.000045607034,0.000098591394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005717047,0.00020417437,0.0005204275,0.00004782795,0.000079085585,0.000013752272,0.00017074044,0.00018090101,0.00039913776],"category_scores_gemma":[0.00046982168,0.00014131838,0.00008654158,0.00007009019,0.00046084562,0.0000677634,0.000023558414,0.00019063758,0.00004301055],"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.000018101315,0.00012807529,0.000047658436,0.00038567992,0.000028038265,0.000006879677,0.002052506,5.396281e-7,0.00029726495,0.991424,0.00009669354,0.0055145654],"study_design_scores_gemma":[0.00037065675,0.0007275926,0.00006468331,0.00009384454,0.00004348994,0.000066511195,0.0010759257,0.000322234,0.00036985707,0.99652946,0.00017105168,0.00016467519],"about_ca_topic_score_codex":0.0000015192508,"about_ca_topic_score_gemma":0.0000030466167,"teacher_disagreement_score":0.31323114,"about_ca_system_score_codex":0.000012168259,"about_ca_system_score_gemma":0.0000117373565,"threshold_uncertainty_score":0.5762796},"labels":[],"label_agreement":null},{"id":"W1625734883","doi":"10.1002/malq.201500004","title":"The conjugacy problem for automorphism groups of countable homogeneous structures","year":2016,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; Boise State University","keywords":"Mathematics; Omega; Combinatorics; Isomorphism (crystallography); Conjugacy class; Conjecture; Discrete mathematics; Physics","score_opus":0.029220698429902044,"score_gpt":0.30509187738468224,"score_spread":0.2758711789547802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625734883","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.07318652,0.00027381146,0.9111832,0.0024951217,0.00029640622,0.0018717232,0.00012647625,0.00027760366,0.010289151],"genre_scores_gemma":[0.92248935,0.000010407847,0.073578864,0.00013827573,0.00011389621,0.00025391692,0.0000031192433,0.0000475606,0.003364612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982976,0.00011548735,0.000651337,0.0002579163,0.00021661898,0.00046103986],"domain_scores_gemma":[0.993359,0.0055928174,0.00029271594,0.0005388938,0.00013830405,0.00007822824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007783964,0.0002277082,0.00047258878,0.000034352757,0.00026298253,0.0000224936,0.0004083421,0.00016543875,0.0003567884],"category_scores_gemma":[0.0005601868,0.00010569866,0.00016450738,0.00006508035,0.00069237576,0.00008921392,0.000027561684,0.00010225947,0.000051766532],"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.000098473276,0.00010284028,0.0000037935815,0.00016978284,0.00006216914,0.0000040066952,0.00054730737,4.0037872e-7,0.0017556,0.9888787,0.0012776001,0.0070992773],"study_design_scores_gemma":[0.0007333164,0.00066651736,0.0000082145925,0.000060136765,0.00005776872,0.00006866739,0.00041847315,0.00006564884,0.0012918462,0.99512357,0.0013368479,0.00016899162],"about_ca_topic_score_codex":8.0197316e-7,"about_ca_topic_score_gemma":0.0000055114256,"teacher_disagreement_score":0.8493028,"about_ca_system_score_codex":0.000036747806,"about_ca_system_score_gemma":0.000035889407,"threshold_uncertainty_score":0.43102664},"labels":[],"label_agreement":null},{"id":"W1849716023","doi":"10.1002/malq.201400110","title":"Computable axiomatizability of elementary classes","year":2016,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Ultraproduct; Class (philosophy); Algebra over a field; New class; Calculus (dental)","score_opus":0.018746146630212374,"score_gpt":0.25473146860272017,"score_spread":0.2359853219725078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849716023","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.0795188,0.000031730277,0.91391146,0.0022037015,0.00019667108,0.00039840423,0.000010153892,0.0003279675,0.0034011093],"genre_scores_gemma":[0.73809135,0.000001000079,0.26162612,0.00012695864,0.000045116874,0.000025900283,0.0000010527662,0.000009936611,0.00007256204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701595,0.00025227884,0.0009281163,0.0006642925,0.0005987195,0.0005406543],"domain_scores_gemma":[0.9965896,0.0014810393,0.00022853537,0.0013332852,0.00017948129,0.00018805322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010061645,0.00028589997,0.0006076487,0.0001061937,0.00007885105,0.00008341595,0.0014262915,0.00010500161,0.0005170787],"category_scores_gemma":[0.00016132632,0.00017363121,0.00020056678,0.0003959277,0.00030834065,0.0004844189,0.00028670602,0.00010265369,0.0003582927],"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.000012020046,0.0013686855,0.0009331083,0.00031771604,0.000054510598,0.000018682038,0.0009718567,0.000009696126,0.0036080868,0.77973384,0.0006869429,0.21228488],"study_design_scores_gemma":[0.00051646156,0.0010288504,0.0019489982,0.00007340356,0.000011835475,0.000037167385,0.000076066426,0.024162458,0.0013712558,0.9702901,0.00019921725,0.0002841696],"about_ca_topic_score_codex":0.000011664511,"about_ca_topic_score_gemma":0.0000031329444,"teacher_disagreement_score":0.65857255,"about_ca_system_score_codex":0.00010383948,"about_ca_system_score_gemma":0.000064567655,"threshold_uncertainty_score":0.7080475},"labels":[],"label_agreement":null},{"id":"W2015311986","doi":"10.1002/malq.200410029","title":"Excluded Middle versus Choice in a topos","year":2005,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Law of excluded middle; Topos theory; Epimorphism; Mathematics; Pure mathematics; Combinatorics; Linguistics; Philosophy; Literature","score_opus":0.046753796971506896,"score_gpt":0.27962813159821714,"score_spread":0.23287433462671026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015311986","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.17532334,0.00039741033,0.44745874,0.0042955168,0.00077385124,0.0007549286,0.000002065299,0.0008080438,0.3701861],"genre_scores_gemma":[0.951697,0.0000013117466,0.04644483,0.00029801184,0.00021094181,0.000050785944,0.0000011854369,0.00001078657,0.0012851458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826795,0.00009442812,0.00040042083,0.00043801585,0.00028345754,0.0005157342],"domain_scores_gemma":[0.998557,0.000548605,0.0000754925,0.0006135726,0.00004439156,0.00016095625],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038326313,0.00021228274,0.00032497177,0.00010062237,0.000072551346,0.00016607306,0.0009244409,0.00012462608,0.00028006884],"category_scores_gemma":[0.0001878315,0.00016394725,0.00010887518,0.00033751706,0.00006752146,0.00037950158,0.000083366125,0.00020935644,0.0025551321],"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.0000178653,0.00058818574,0.00007212616,0.000053712716,0.000012693548,0.00003537982,0.005802648,0.0000067828832,0.00012381143,0.9532784,0.0005726571,0.039435744],"study_design_scores_gemma":[0.005953605,0.002726265,0.0030032361,0.00019486841,0.000029399418,0.00009508221,0.0006149742,0.1435019,0.0004595967,0.8286386,0.013536518,0.00124594],"about_ca_topic_score_codex":0.000011476152,"about_ca_topic_score_gemma":0.000099202196,"teacher_disagreement_score":0.7763737,"about_ca_system_score_codex":0.00009027577,"about_ca_system_score_gemma":0.000037541176,"threshold_uncertainty_score":0.9982215},"labels":[],"label_agreement":null},{"id":"W2024325951","doi":"10.1002/malq.200610049","title":"Local sentences and Mahlo cardinals","year":2007,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Equivalence (formal languages); Axiom; Regular cardinal; Sentence; Consistency (knowledge bases); Combinatorics; Integer (computer science); Order (exchange); Discrete mathematics; Type (biology); Pure mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.035422512756671166,"score_gpt":0.3315521679374453,"score_spread":0.2961296551807741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024325951","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.15612322,0.0001291158,0.812053,0.00042431802,0.00009120951,0.00021043302,0.000003290632,0.00016061724,0.030804766],"genre_scores_gemma":[0.9605717,0.0000033683118,0.038141977,0.00025346287,0.00006931228,0.000010147474,0.0000012403598,0.000017523626,0.00093128695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985522,0.0000843328,0.00043492563,0.00027907794,0.00020682426,0.00044262066],"domain_scores_gemma":[0.9977944,0.0016256347,0.000092954026,0.0002829851,0.000043633238,0.00016038898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011869454,0.00020418741,0.00041241426,0.00006576044,0.00012915512,0.000021789578,0.00015207745,0.00017038413,0.0003647294],"category_scores_gemma":[0.00022810361,0.0001485958,0.000087446395,0.0000934202,0.00059424696,0.00009744816,0.000027574306,0.00021378041,0.00018965839],"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.000035791585,0.00010581013,0.00004284509,0.00010363567,0.000028452632,0.000088202294,0.0012653194,2.2159134e-7,0.00011118564,0.98541903,0.0002129618,0.012586534],"study_design_scores_gemma":[0.0002480306,0.00032679457,0.00013136181,0.00003728625,0.000037425958,0.00024590688,0.0052458206,0.00012017061,0.00023861456,0.99294895,0.00023459486,0.00018503306],"about_ca_topic_score_codex":0.0000016779571,"about_ca_topic_score_gemma":0.000007329994,"teacher_disagreement_score":0.8044485,"about_ca_system_score_codex":0.000022103886,"about_ca_system_score_gemma":0.00000907016,"threshold_uncertainty_score":0.60595614},"labels":[],"label_agreement":null},{"id":"W2045590994","doi":"10.1002/malq.200810012","title":"Commutative rings whose ideals form an MV‐algebra","year":2009,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"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; Commutative ring; Commutative algebra; Noncommutative ring; Class (philosophy); Semiprime ring; Pure mathematics; Commutative property; Maximal ideal; Artinian ring; Von Neumann regular ring; Local ring; Lattice (music); Ideal (ethics); Unit (ring theory); Ring (chemistry); Algebra over a field; Combinatorics; Law; Chemistry; Noetherian","score_opus":0.019081062640995457,"score_gpt":0.28462956003784207,"score_spread":0.2655484973968466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045590994","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.07807998,0.000047175887,0.90392846,0.0023908946,0.00007322254,0.00031785457,0.0000021922256,0.0005726551,0.014587575],"genre_scores_gemma":[0.85087395,0.0000013151507,0.14651935,0.002351776,0.000057831316,0.000022281482,0.0000038092237,0.000010082463,0.00015961136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978664,0.00011693196,0.00050138123,0.00052085007,0.00039081645,0.0006036164],"domain_scores_gemma":[0.99828094,0.0002890257,0.00015609966,0.00089973136,0.00008317409,0.0002910541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042424834,0.00030455718,0.0004494589,0.00009339861,0.000214812,0.0002682339,0.0012614434,0.0001174452,0.00012320181],"category_scores_gemma":[0.000056590336,0.00022629941,0.0001267512,0.00032657382,0.00011287764,0.0011821935,0.000058264643,0.00027247795,0.00070345827],"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.0000055050864,0.00028821104,0.0000051859397,0.000014317616,0.000006683093,0.000047822836,0.005301832,0.0000040578025,0.00027710642,0.92823243,0.00009941198,0.06571745],"study_design_scores_gemma":[0.0003239572,0.0023309828,0.00097647065,0.000030179426,0.000007782734,0.00007499706,0.0004119144,0.010478363,0.00017151696,0.98477477,0.00009769565,0.00032138225],"about_ca_topic_score_codex":0.0000016828313,"about_ca_topic_score_gemma":0.0000016805718,"teacher_disagreement_score":0.77279395,"about_ca_system_score_codex":0.000045447254,"about_ca_system_score_gemma":0.000024577894,"threshold_uncertainty_score":0.9228222},"labels":[],"label_agreement":null},{"id":"W2060156489","doi":"10.1002/malq.200610011","title":"On the extender algebra being complete","year":2006,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Extender; Simple (philosophy); Mathematics; Algebra over a field; Pure mathematics; Chemistry; Philosophy; Organic chemistry; Epistemology","score_opus":0.03827155897042094,"score_gpt":0.29030495982462134,"score_spread":0.2520334008542004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060156489","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.20815288,0.000037754267,0.4508999,0.005586471,0.00019600701,0.00074590923,0.0000130653,0.0004938282,0.3338742],"genre_scores_gemma":[0.98341537,3.0710922e-7,0.012629164,0.0011736347,0.00013555177,0.00006106978,0.0000045357037,0.0000332961,0.0025470883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983308,0.0002262579,0.0004494683,0.00028667157,0.00027132247,0.0004355117],"domain_scores_gemma":[0.9950674,0.0041235187,0.000120172524,0.0005956692,0.000036965943,0.000056276243],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006045214,0.00025182765,0.00035707018,0.000046991372,0.00029278692,0.000039942635,0.00033857705,0.00013293326,0.002047107],"category_scores_gemma":[0.00030371756,0.0001443839,0.00015112523,0.00010669373,0.00035232233,0.00006461218,0.000025100187,0.00033522455,0.0013254933],"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.000017256327,0.00023121032,0.0000023965101,0.000035487334,0.000018838746,0.000025284035,0.00042602475,0.0000021945873,0.0001570863,0.9958371,0.0027736109,0.0004735462],"study_design_scores_gemma":[0.00022880404,0.0002491822,0.00004625849,0.00003840725,0.00002822758,0.00004387772,0.0004132974,0.00040055657,0.00007725844,0.9979925,0.0002908357,0.00019074962],"about_ca_topic_score_codex":0.0000017673087,"about_ca_topic_score_gemma":0.0000032434914,"teacher_disagreement_score":0.7752625,"about_ca_system_score_codex":0.000029895364,"about_ca_system_score_gemma":0.00000910738,"threshold_uncertainty_score":0.9994521},"labels":[],"label_agreement":null},{"id":"W2062755128","doi":"10.1002/malq.200610040","title":"Bounded BCK‐algebras and their generated variety","year":2007,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Population and Public Health","keywords":"Bounded function; Mathematics; Residuated lattice; Commutative property; Simple (philosophy); Class (philosophy); Variety (cybernetics); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015349064421880842,"score_gpt":0.2413161522678692,"score_spread":0.22596708784598837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062755128","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.11006421,0.00009481755,0.8826963,0.0005355952,0.00010751087,0.00017153414,0.0000010588918,0.00031443228,0.006014583],"genre_scores_gemma":[0.8789731,0.0000022216755,0.11984122,0.00089815893,0.000071049835,0.000009692001,0.000002105735,0.000011287587,0.00019114134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983471,0.00005928737,0.00039738195,0.00046763394,0.0002008757,0.00052768976],"domain_scores_gemma":[0.99872446,0.00036569926,0.000089029825,0.00053484534,0.00006103748,0.00022492734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064671424,0.000252875,0.0003167103,0.00006914152,0.00019002888,0.00022282121,0.00051865465,0.00012970324,0.0000798202],"category_scores_gemma":[0.0000428926,0.00016681486,0.0000753376,0.00032126793,0.00016116818,0.00032683028,0.00008141094,0.00019898046,0.0001933309],"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.0000045474876,0.00010663375,0.0000143698935,0.000021937567,0.000013255171,0.000031336123,0.0020994565,8.3154083e-7,0.0015467757,0.96499634,0.00006986221,0.031094642],"study_design_scores_gemma":[0.0002818032,0.00040984794,0.0006115466,0.000012112363,0.0000047281987,0.00012347073,0.00029042066,0.00886951,0.0007875867,0.9880276,0.00032934753,0.00025205093],"about_ca_topic_score_codex":0.0000015461858,"about_ca_topic_score_gemma":0.0000035098535,"teacher_disagreement_score":0.7689089,"about_ca_system_score_codex":0.00002770406,"about_ca_system_score_gemma":0.000022464603,"threshold_uncertainty_score":0.6802513},"labels":[],"label_agreement":null},{"id":"W2067703954","doi":"10.1002/malq.201020093","title":"Simulating non-prenex cuts in quantified propositional calculus","year":2011,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Calculus (dental); Propositional variable; Propositional formula; Propositional calculus; Computer science; Discrete mathematics; Artificial intelligence; Orthodontics; Medicine","score_opus":0.04646462270182227,"score_gpt":0.27033705662141105,"score_spread":0.22387243391958878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067703954","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.02032905,0.000019559764,0.9357894,0.000105082894,0.00020462782,0.00042583657,4.7426443e-7,0.00019182304,0.04293412],"genre_scores_gemma":[0.9653265,1.4977937e-7,0.034209147,0.00009008937,0.000053258587,0.000055794673,0.0000024010253,0.000010214351,0.00025245108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812806,0.00010925125,0.0005339174,0.00044012623,0.00033694535,0.00045171377],"domain_scores_gemma":[0.9990542,0.0001403988,0.00012464741,0.00049169076,0.00006468017,0.00012441869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056596124,0.00020067676,0.00032353454,0.000102355734,0.000092100585,0.00013850475,0.0006440641,0.00012577699,0.00011761595],"category_scores_gemma":[0.00004631246,0.00014865187,0.00010029935,0.0002838532,0.00007631718,0.00028868817,0.0000700047,0.00017247867,0.0007406427],"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.000006291176,0.00034508316,0.00022395627,0.00008675322,0.000010471772,0.00009208824,0.007818157,0.000006317359,0.0001966759,0.98382294,0.00003375636,0.0073574837],"study_design_scores_gemma":[0.00042666594,0.0006042136,0.0011335796,0.000026686706,0.0000063499556,0.000055348064,0.00025331276,0.13011815,0.00022924592,0.86681724,0.000048113114,0.00028107094],"about_ca_topic_score_codex":0.000064204796,"about_ca_topic_score_gemma":0.000014808313,"teacher_disagreement_score":0.94499743,"about_ca_system_score_codex":0.000038093443,"about_ca_system_score_gemma":0.00003490104,"threshold_uncertainty_score":0.95197105},"labels":[],"label_agreement":null},{"id":"W2082808755","doi":"10.1002/malq.200710030","title":"The axiom of choice and the law of excluded middle in weak set theories","year":2008,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Philosophy and Theoretical Science","field":"Psychology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Extensionality; Axiom of choice; Constructive set theory; Urelement; Law of excluded middle; Mathematics; Zermelo–Fraenkel set theory; Axiom; Quotient; Set (abstract data type); Pure mathematics; Mathematical economics; Set theory; Discrete mathematics; Computer science; Geometry; Epistemology; Philosophy","score_opus":0.04597893310610612,"score_gpt":0.29704903133439436,"score_spread":0.25107009822828824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082808755","genre_codex":"other","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.45719835,0.00033385612,0.0011391919,0.003306677,0.00009935002,0.00035218583,0.000009501232,0.000018829638,0.53754205],"genre_scores_gemma":[0.99945474,0.000004787828,0.000113510054,0.00014454263,0.000025135498,0.000029557239,3.5393853e-7,0.00000457213,0.00022281829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861765,0.00035107683,0.00041840156,0.00016721136,0.00020875763,0.00023692314],"domain_scores_gemma":[0.9958011,0.0036189242,0.00011212242,0.0003890305,0.000030510304,0.00004832166],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011134235,0.00010709004,0.00030169758,0.000019132356,0.00013318805,0.000012041065,0.0003852307,0.00007152429,0.00019533173],"category_scores_gemma":[0.00022957359,0.000047488702,0.00006928296,0.00018124106,0.0050285086,0.000043975957,0.000032595617,0.00014580225,0.000041742085],"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.00009746292,0.00011577758,0.000038939223,0.000022045835,0.000013191749,0.0000027685799,0.011417508,1.2725198e-7,0.000057275687,0.98788494,0.000015678721,0.00033428476],"study_design_scores_gemma":[0.0007113347,0.00028200322,0.0013106671,0.000026050317,0.000009661732,0.000030438901,0.0020059356,0.00007703137,0.00006378858,0.99533844,0.00008444452,0.000060189108],"about_ca_topic_score_codex":0.00006076602,"about_ca_topic_score_gemma":0.000020461963,"teacher_disagreement_score":0.54225636,"about_ca_system_score_codex":0.0000047386907,"about_ca_system_score_gemma":0.000007689222,"threshold_uncertainty_score":0.99767923},"labels":[],"label_agreement":null},{"id":"W2089220531","doi":"10.1002/malq.200910001","title":"Degree spectra and immunity properties","year":2010,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Uncountable set; Mathematics; Corollary; Complement (music); Pure mathematics; Spectrum (functional analysis); Combinatorics; Physics; Biology","score_opus":0.037241469415239,"score_gpt":0.240759079117303,"score_spread":0.20351760970206398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089220531","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.40677872,0.000063647116,0.5782241,0.0021968777,0.0003305822,0.00040279058,0.0000012995717,0.00050409714,0.011497877],"genre_scores_gemma":[0.7926789,7.643268e-7,0.20695135,0.00013910874,0.00007703563,0.00002411229,3.9737685e-7,0.000008992568,0.00011934925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829906,0.00011250209,0.0003762722,0.00046831768,0.00032334847,0.00042052646],"domain_scores_gemma":[0.9983079,0.0002909203,0.00007219855,0.0010543902,0.000085129315,0.00018948289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007125805,0.00023999113,0.00033617197,0.00006971683,0.00017882184,0.00037227717,0.0010240057,0.00012396078,0.00014004625],"category_scores_gemma":[0.00017083526,0.00016694552,0.00008149497,0.00020337277,0.00032529165,0.00034894445,0.00023197939,0.00049587694,0.00029186837],"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.000005702874,0.00049166416,0.00013623068,0.00012714665,0.000018169245,0.000031492502,0.0043112575,7.4388316e-7,0.008054606,0.8484054,0.00007832551,0.13833927],"study_design_scores_gemma":[0.0002468614,0.0006224821,0.005157453,0.000018380108,0.000008582922,0.00026023554,0.00015749462,0.04908331,0.0005384941,0.9434279,0.00015637676,0.0003223785],"about_ca_topic_score_codex":0.000017470416,"about_ca_topic_score_gemma":0.000020689076,"teacher_disagreement_score":0.38590017,"about_ca_system_score_codex":0.000018497945,"about_ca_system_score_gemma":0.00003743016,"threshold_uncertainty_score":0.68078405},"labels":[],"label_agreement":null},{"id":"W2093788800","doi":"10.1002/malq.201110037","title":"Conjectures of Rado and Chang and special Aronszajn trees","year":2012,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Square (algebra); Geometry","score_opus":0.03163157865390188,"score_gpt":0.28557650544306257,"score_spread":0.2539449267891607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093788800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98142445,0.00047434997,0.0024956504,0.00013435679,0.00017568943,0.0002654558,0.000011563413,0.000048709848,0.014969802],"genre_scores_gemma":[0.98979324,0.000008778692,0.009469777,0.00007400709,0.0005107649,0.000009017353,8.7103956e-7,0.0000170767,0.000116476745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988801,0.00009049939,0.00035482808,0.00016466156,0.00019551747,0.00031440583],"domain_scores_gemma":[0.9986479,0.000816143,0.00012324481,0.00024742022,0.000024840218,0.00014044496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045401885,0.00019774809,0.0004498952,0.000073916,0.00011016045,0.000024235955,0.00011044358,0.00012834462,0.00037846345],"category_scores_gemma":[0.0002012211,0.00013050657,0.00007030747,0.000062053434,0.0003866176,0.00009820311,0.000051114992,0.00012921065,0.000005623373],"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.000021042486,0.000094971336,0.00046493695,0.00023909254,0.000037472844,0.0000018638564,0.010830045,1.7051484e-8,0.0002311057,0.9821687,0.000363819,0.0055469605],"study_design_scores_gemma":[0.00032360837,0.0002667924,0.0026065002,0.000046633155,0.00006670207,0.00007884658,0.0013554989,0.000031788448,0.00021842914,0.9946795,0.00016215,0.00016355679],"about_ca_topic_score_codex":0.0000011256468,"about_ca_topic_score_gemma":0.0000023332238,"teacher_disagreement_score":0.014853326,"about_ca_system_score_codex":0.000006816213,"about_ca_system_score_gemma":0.000004335741,"threshold_uncertainty_score":0.5321903},"labels":[],"label_agreement":null},{"id":"W2114015893","doi":"10.1002/malq.201200079","title":"Cofinalities of Borel ideals","year":2014,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Consejo de Ciencia y Tecnología del Estado de Chiapas; Universidad Nacional Autónoma de México; Akademie Věd České Republiky; Grantová Agentura České Republiky","keywords":"Cofinality; Mathematics; Invariant (physics); Ideal (ethics); Uncountable set; Pairwise comparison; Pure mathematics; Discrete mathematics; Countable set; Epistemology; Statistics; Philosophy","score_opus":0.03852999292608383,"score_gpt":0.3240765200978396,"score_spread":0.28554652717175577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114015893","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.20584473,0.000054245535,0.6672108,0.0006363635,0.00012474424,0.00029802043,0.000012962343,0.00022768875,0.12559041],"genre_scores_gemma":[0.9433127,0.0000010864654,0.054867346,0.0001987461,0.000064715314,0.000023368842,0.0000025668248,0.000020687603,0.0015087543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851805,0.00021320429,0.00056979613,0.0001960458,0.00020634544,0.00029653846],"domain_scores_gemma":[0.99691474,0.002283336,0.00019342656,0.00046240145,0.00006763064,0.000078470155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008537878,0.00018005262,0.00054761476,0.000056993013,0.0000663682,0.000009534655,0.00024502305,0.00014524088,0.00079753925],"category_scores_gemma":[0.0008178994,0.00013397903,0.00013134502,0.00007842438,0.0004068423,0.00006889218,0.000020966052,0.0001521092,0.00021575083],"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.000022216389,0.00015499731,0.000014917327,0.0002699395,0.000022161308,0.000002939035,0.0013805006,5.408945e-7,0.00023146978,0.99560386,0.00044675687,0.0018496994],"study_design_scores_gemma":[0.00030014073,0.00053405366,0.00004190058,0.000057408106,0.000035717174,0.000025617122,0.0008877609,0.0002481535,0.0004496955,0.99697113,0.00029964774,0.0001487897],"about_ca_topic_score_codex":0.0000014454669,"about_ca_topic_score_gemma":0.000001512911,"teacher_disagreement_score":0.737468,"about_ca_system_score_codex":0.00001223502,"about_ca_system_score_gemma":0.00001140323,"threshold_uncertainty_score":0.87324953},"labels":[],"label_agreement":null},{"id":"W2166403219","doi":"10.1002/malq.200310061","title":"On existence of complete sets for bounded reducibilities","year":2003,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Recursively enumerable language; Oracle; Mathematics; Hierarchy; Set (abstract data type); Bounded function; Combinatorics; Discrete mathematics; Computer science","score_opus":0.06315396646092529,"score_gpt":0.2998707246096498,"score_spread":0.2367167581487245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166403219","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.048852142,0.00003373249,0.93689144,0.0005767881,0.00029488455,0.00079957524,0.000016665474,0.00019596315,0.012338786],"genre_scores_gemma":[0.5916137,2.5239478e-7,0.4079297,0.00018847671,0.000017612294,0.00007752651,0.000001838405,0.000010998968,0.00015988151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744916,0.00021967881,0.0006906147,0.0007034935,0.00045027098,0.00048677015],"domain_scores_gemma":[0.99602246,0.0021291652,0.00018008282,0.0013413948,0.00018797863,0.0001389292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011443014,0.00026417006,0.00055613613,0.00009143884,0.00012246592,0.0001281546,0.0009387247,0.00009866047,0.000096439115],"category_scores_gemma":[0.0007101974,0.0002092788,0.00022451118,0.00025697178,0.00029091808,0.0001752596,0.00005358829,0.00013586885,0.00009717073],"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.0000088817105,0.00039813173,0.0000035777712,0.00018669623,0.000012510973,0.000003307271,0.0016427581,0.000011963698,0.00014529985,0.9931144,0.00015674405,0.00431571],"study_design_scores_gemma":[0.0003998046,0.0020586362,0.000064684304,0.00004749935,0.0000081188045,0.00003389421,0.00022824765,0.03280985,0.00034615942,0.9635549,0.00021819261,0.00022996454],"about_ca_topic_score_codex":0.000003219712,"about_ca_topic_score_gemma":0.0000015309846,"teacher_disagreement_score":0.5427616,"about_ca_system_score_codex":0.000068030924,"about_ca_system_score_gemma":0.00007172885,"threshold_uncertainty_score":0.8534142},"labels":[],"label_agreement":null},{"id":"W2193617815","doi":"10.1002/malq.201500067","title":"The length of an intersection","year":2017,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Partially ordered set; Infimum and supremum; Cardinality (data modeling); Intersection (aeronautics); Discrete mathematics","score_opus":0.028636140349287027,"score_gpt":0.29710783054218814,"score_spread":0.2684716901929011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193617815","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.026936842,0.00009974531,0.96048135,0.0008213533,0.00082826294,0.00034269664,0.0000034123707,0.00018427875,0.010302079],"genre_scores_gemma":[0.9571694,0.000006889814,0.042344943,0.0000513818,0.00011998628,0.000054579286,0.0000032303537,0.000011368128,0.00023822667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830204,0.00014221763,0.00047011688,0.0004738674,0.00032193295,0.00028985122],"domain_scores_gemma":[0.9968393,0.00029388937,0.00048451143,0.0021914549,0.0000970853,0.00009379932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006023753,0.00024377913,0.00039548587,0.000047982277,0.0002819089,0.00039086043,0.002709943,0.00020464795,0.000017298222],"category_scores_gemma":[0.0001070143,0.00014296277,0.00018083224,0.000043674358,0.000251293,0.00027202905,0.00041945797,0.00048682498,0.00008166518],"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.000005897616,0.00011750521,0.0000014579784,0.00009447269,0.000023952234,0.00001025525,0.0014682431,0.000020082654,0.000046515066,0.87559456,0.0000472758,0.1225698],"study_design_scores_gemma":[0.00009058498,0.000526795,0.00012119933,0.00007988016,0.000011613348,0.000021545828,0.00017719142,0.033305865,0.00008408663,0.96530485,0.000106420615,0.00016997784],"about_ca_topic_score_codex":0.0000053862505,"about_ca_topic_score_gemma":0.000007622979,"teacher_disagreement_score":0.9302325,"about_ca_system_score_codex":0.00003465911,"about_ca_system_score_gemma":0.000050423336,"threshold_uncertainty_score":0.5829853},"labels":[],"label_agreement":null},{"id":"W2227441040","doi":"10.1002/malq.201600071","title":"Constructing quasiminimal structures","year":2017,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Outcome (game theory); Mathematics; Upper and lower bounds; Order (exchange); Epistemology; Mathematical economics; Pure mathematics; Computer science; Philosophy; Mathematical analysis; Economics","score_opus":0.08272061478614534,"score_gpt":0.37401943283780004,"score_spread":0.2912988180516547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227441040","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.19706236,0.00039804925,0.4922788,0.0025067579,0.0030762183,0.0022197687,0.00030995015,0.0015197231,0.30062836],"genre_scores_gemma":[0.7796288,0.0000038519875,0.21784623,0.00013125403,0.0005810477,0.00010792436,0.000040262454,0.00009580726,0.0015647819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676776,0.0002891947,0.0009821572,0.0008360615,0.00041697608,0.0007078412],"domain_scores_gemma":[0.9949456,0.0018274798,0.00096863916,0.0019289757,0.00012497127,0.00020432878],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00080605724,0.0007081273,0.0014303057,0.00012294728,0.0004216264,0.00021208932,0.0012361165,0.0010729671,0.0014959843],"category_scores_gemma":[0.0018356682,0.00056786014,0.00042661073,0.000032187407,0.0011238493,0.000115532,0.00040635938,0.0016936228,0.00025137234],"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.0000398978,0.00011414515,0.000019454088,0.00091059407,0.0001337098,0.00010977747,0.0015179587,0.0000013190843,0.000013481264,0.986352,0.00055543386,0.01023223],"study_design_scores_gemma":[0.000350225,0.00021412234,0.000017559107,0.00027462887,0.00017495146,0.00020069654,0.0020444228,0.00036270852,0.00008123068,0.99559724,0.00007553971,0.00060664344],"about_ca_topic_score_codex":0.0000035012304,"about_ca_topic_score_gemma":0.000009861294,"teacher_disagreement_score":0.5825665,"about_ca_system_score_codex":0.00010530182,"about_ca_system_score_gemma":0.00011065098,"threshold_uncertainty_score":0.9996773},"labels":[],"label_agreement":null},{"id":"W2777179981","doi":"10.1002/malq.201500022","title":"Supersimple structures with a dense independent subset","year":2017,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Triviality; Omega; Modulo; Predicate (mathematical logic); Mathematics; Rank (graph theory); Combinatorics; Type (biology); Discrete mathematics; Pure mathematics; Physics; Computer science; Quantum mechanics","score_opus":0.05767260280052555,"score_gpt":0.3393782905255882,"score_spread":0.28170568772506266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777179981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67769355,0.00027896083,0.2816682,0.0015934125,0.0007301264,0.0024547218,0.0002472388,0.0008379414,0.034495857],"genre_scores_gemma":[0.93833715,0.0000053844938,0.059417684,0.00016809673,0.00023235346,0.00017202696,0.000060417464,0.00010170613,0.0015051923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684197,0.0002688026,0.00069628225,0.00087373407,0.00058453705,0.0007347019],"domain_scores_gemma":[0.99579936,0.0009998186,0.000571428,0.0022328768,0.0001464121,0.00025009373],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006734335,0.0007488213,0.0013107149,0.00013150464,0.0003936009,0.0002018428,0.0011891519,0.00092660263,0.001374153],"category_scores_gemma":[0.0004941027,0.0005130813,0.00029984524,0.000041539093,0.00075716176,0.000122045705,0.0003069444,0.0015211196,0.00022604836],"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.0001823132,0.0002714776,0.000045962533,0.00094977696,0.00028240812,0.00042401694,0.004017951,0.000009669651,0.000023576757,0.9916717,0.000993898,0.0011272818],"study_design_scores_gemma":[0.0006482256,0.0005327443,0.000108412365,0.00023811348,0.00026343903,0.00033809023,0.001204222,0.00014168206,0.000070553084,0.99566954,0.00012867454,0.0006563248],"about_ca_topic_score_codex":0.000012641364,"about_ca_topic_score_gemma":0.0000652503,"teacher_disagreement_score":0.26064357,"about_ca_system_score_codex":0.000098446544,"about_ca_system_score_gemma":0.00014046334,"threshold_uncertainty_score":0.9997321},"labels":[],"label_agreement":null},{"id":"W2919009353","doi":"10.1002/malq.201900058","title":"On universal modules with pure embeddings","year":2020,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cofinality; Mathematics; Embedding; Lambda; Cardinality (data modeling); Injective function; Abelian group; Countable set; Limit (mathematics); Model theory; Pure mathematics; Discrete mathematics; Combinatorics; Uncountable set; Physics; Computer science; Mathematical analysis","score_opus":0.03884149798080114,"score_gpt":0.27498290341155107,"score_spread":0.23614140543074993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919009353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63855624,0.00006968354,0.2686627,0.0062415353,0.00047615843,0.0023829394,0.00014637272,0.0018238145,0.08164056],"genre_scores_gemma":[0.92540497,0.000004948691,0.07213638,0.0005367979,0.00042642732,0.00011610224,0.000046341727,0.00018859954,0.0011394218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963153,0.00014512327,0.00077187945,0.0011655897,0.00092142617,0.00068065384],"domain_scores_gemma":[0.9969273,0.00085035455,0.0004819747,0.0012324458,0.00012917488,0.0003787356],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034244807,0.0009007581,0.001392764,0.00016468075,0.00014862212,0.0002906937,0.00095499767,0.0005964913,0.00089139264],"category_scores_gemma":[0.00031508526,0.0006490828,0.0003878289,0.00016826665,0.0002855675,0.00011346489,0.00022983007,0.0014669314,0.0009156611],"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.00011001484,0.00049454917,0.0000034975508,0.0017665247,0.00021106283,0.00024833775,0.0037847552,0.000025299321,0.00005019145,0.98661244,0.0054029836,0.0012903454],"study_design_scores_gemma":[0.0006016368,0.0013510782,0.000027165379,0.0010694833,0.00023066385,0.00004438363,0.0010342543,0.002990315,0.00009226339,0.99162346,0.00012961186,0.0008057051],"about_ca_topic_score_codex":0.000006618925,"about_ca_topic_score_gemma":0.000006448588,"teacher_disagreement_score":0.28684872,"about_ca_system_score_codex":0.00014474452,"about_ca_system_score_gemma":0.00009395992,"threshold_uncertainty_score":0.99986225},"labels":[],"label_agreement":null},{"id":"W2947754331","doi":"10.1002/malq.201900041","title":"Concrete barriers to quantifier elimination in finite dimensional C*‐algebras","year":2019,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Quantifier elimination; Predicate (mathematical logic); Separable space; Mathematics; Quantifier (linguistics); Discrete mathematics; Pure mathematics; Algebra over a field; Combinatorics; Computer science; Programming language; Artificial intelligence; Mathematical analysis","score_opus":0.05546138578556566,"score_gpt":0.35685333530604646,"score_spread":0.3013919495204808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947754331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84958977,0.00010049574,0.13393617,0.0034912657,0.0008581805,0.005182333,0.00018182212,0.00038014003,0.0062797996],"genre_scores_gemma":[0.92238224,0.0000028561785,0.073174804,0.00069683924,0.00014905911,0.0006289419,0.000073800395,0.00016732137,0.0027241216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942743,0.00051007885,0.0014673878,0.001288256,0.001422548,0.0010374294],"domain_scores_gemma":[0.99353266,0.003494396,0.00030226755,0.0016050397,0.00035134825,0.0007142615],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001884029,0.00076287,0.0014403944,0.00058447133,0.000116669544,0.0003104268,0.0009680739,0.0007983266,0.0022321774],"category_scores_gemma":[0.0057239877,0.0006627495,0.00031170764,0.00044354773,0.00018766626,0.0002551753,0.0005623102,0.0017116847,0.0024057068],"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.0002059996,0.00015780856,0.00012382041,0.0023473671,0.000121653175,0.00018372943,0.006281497,0.0009100022,0.0010562047,0.98514426,0.0024540254,0.0010136632],"study_design_scores_gemma":[0.000731066,0.000618705,0.00014762393,0.00089772587,0.00004916047,0.000013462234,0.00089089887,0.017174633,0.00022565499,0.978275,0.00011915269,0.0008568947],"about_ca_topic_score_codex":0.000011283622,"about_ca_topic_score_gemma":0.000018009845,"teacher_disagreement_score":0.07279246,"about_ca_system_score_codex":0.0003905923,"about_ca_system_score_gemma":0.00041343583,"threshold_uncertainty_score":0.99958235},"labels":[],"label_agreement":null},{"id":"W2980681923","doi":"10.1002/malq.201700049","title":"Degrees of categoricity of trees and the isomorphism problem","year":2019,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Mathematics; Isomorphism (crystallography); Rank (graph theory); Degree (music); Mathematical proof; Tree (set theory); Limit (mathematics); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.010032088061797992,"score_gpt":0.21377323759178685,"score_spread":0.20374114952998884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980681923","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.32272056,0.00018813355,0.66806227,0.0016997025,0.00011891226,0.00097176817,0.0000036883482,0.00010080107,0.006134174],"genre_scores_gemma":[0.91716695,0.0000017721527,0.08266411,0.000037394515,0.000014088692,0.000017076789,3.7713846e-7,0.000005438891,0.00009279791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982527,0.00019621143,0.00058767805,0.00034069785,0.0003828999,0.00023981257],"domain_scores_gemma":[0.9976501,0.0011391484,0.00024157239,0.0007872028,0.00011979345,0.00006216756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009716277,0.00017568016,0.00058442156,0.0000588579,0.000039265346,0.000050960858,0.00090444833,0.00007581761,0.0000653222],"category_scores_gemma":[0.00006444382,0.00009776032,0.00012652694,0.00026247342,0.00046038974,0.00015998853,0.0001852941,0.00013330604,0.00004825451],"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.0000147724695,0.00023351764,0.00041027946,0.00021117354,0.000022730572,0.0000016795159,0.0037088476,0.000042648033,0.00027573988,0.9848937,0.000030176223,0.010154739],"study_design_scores_gemma":[0.00080139266,0.0007464347,0.0043155532,0.00003144817,0.000015518975,0.00003085103,0.00019722381,0.14344397,0.00014366118,0.85012984,0.000013766902,0.00013036189],"about_ca_topic_score_codex":0.000046561272,"about_ca_topic_score_gemma":0.000010179652,"teacher_disagreement_score":0.59444636,"about_ca_system_score_codex":0.000014514546,"about_ca_system_score_gemma":0.00002958255,"threshold_uncertainty_score":0.39865503},"labels":[],"label_agreement":null},{"id":"W2997454689","doi":"10.1002/malq.202000005","title":"Turing invariant sets and the perfect set property","year":2020,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Countable set; Property (philosophy); Invariant (physics); Turing; Mathematics; Discrete mathematics; Equivalence (formal languages); Set (abstract data type); Computer science","score_opus":0.04685334213629911,"score_gpt":0.2649848492308628,"score_spread":0.2181315070945637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997454689","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.007071777,0.00024436257,0.95229536,0.030846618,0.00053989916,0.0022286407,0.000016560294,0.00072808453,0.006028705],"genre_scores_gemma":[0.8347824,0.000010589222,0.16290326,0.0014683238,0.0002971208,0.00034260968,0.000009972557,0.00004241223,0.00014326474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956474,0.00082367763,0.0008329397,0.0014256708,0.00069413724,0.0005762006],"domain_scores_gemma":[0.9961956,0.0012795193,0.00027503923,0.0018594409,0.0001089691,0.0002814158],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019065232,0.0006185026,0.0011031532,0.00007280444,0.00023189627,0.0011810753,0.0026071656,0.00032031612,0.00007066296],"category_scores_gemma":[0.00043219578,0.00029715823,0.00031360236,0.00022646094,0.0004988342,0.00018158265,0.0028129693,0.0012973072,0.00026124975],"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.000077706296,0.00045319216,0.000024274757,0.0032036928,0.00026317564,0.000350967,0.04303723,0.00019918664,0.00006279702,0.87223566,0.0012987204,0.07879342],"study_design_scores_gemma":[0.00043422042,0.00024253137,0.00012907882,0.00009603121,0.000040774026,0.00012725302,0.00009455116,0.39583483,0.000008697896,0.6026006,0.0000756795,0.00031576437],"about_ca_topic_score_codex":0.000041997133,"about_ca_topic_score_gemma":0.000004350308,"teacher_disagreement_score":0.8277107,"about_ca_system_score_codex":0.00008336406,"about_ca_system_score_gemma":0.00014242018,"threshold_uncertainty_score":0.999948},"labels":[],"label_agreement":null},{"id":"W3118314718","doi":"10.1002/malq.202100008","title":"Pathological examples of structures with o‐minimal open core","year":2021,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Unary operation; Predicate (mathematical logic); Core (optical fiber); Mathematics; Graph; Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.13346662143024196,"score_gpt":0.37374109803885847,"score_spread":0.2402744766086165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118314718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8084425,0.00019604013,0.17143539,0.00024886543,0.00019064215,0.0014973027,0.00012318541,0.00019498315,0.017671116],"genre_scores_gemma":[0.6846028,0.0000048339525,0.31464413,0.00011343173,0.00007040163,0.00013928229,0.000064206324,0.000049987455,0.00031090513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673164,0.0003868733,0.001056923,0.0008734228,0.00043676194,0.00051438477],"domain_scores_gemma":[0.99562365,0.0019351405,0.00070234603,0.0013666231,0.00021287348,0.00015934667],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007634538,0.0006227381,0.0018877427,0.000085441025,0.00011714288,0.000123418,0.0014216381,0.0008349104,0.0024797665],"category_scores_gemma":[0.0006558485,0.0004036154,0.0002619903,0.00012049737,0.0009530536,0.00010776685,0.000858464,0.0010938444,0.000020904736],"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.00022345406,0.0005899868,0.000051812778,0.0012430581,0.00017883333,0.00038191836,0.0036804727,0.000010327061,0.00023645799,0.99182284,0.00014809349,0.0014327721],"study_design_scores_gemma":[0.00057037256,0.0011469531,0.00028097988,0.0004462379,0.00020714928,0.0002689766,0.004117495,0.00008517964,0.00024494043,0.99211943,0.000020006071,0.00049229054],"about_ca_topic_score_codex":0.0000061413543,"about_ca_topic_score_gemma":0.000017117298,"teacher_disagreement_score":0.14320874,"about_ca_system_score_codex":0.000041161522,"about_ca_system_score_gemma":0.00015596431,"threshold_uncertainty_score":0.9998416},"labels":[],"label_agreement":null},{"id":"W4283221234","doi":"10.1002/malq.202100074","title":"κ‐Madness and definability","year":2022,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Uncountable set; Mathematics; Regular cardinal; Construct (python library); Pure mathematics; Discrete mathematics; Computer science","score_opus":0.038059841576573036,"score_gpt":0.3132345562557084,"score_spread":0.27517471467913535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283221234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8650885,0.00013208108,0.101505816,0.0017257647,0.00019945265,0.0005713001,0.000025219646,0.00035341314,0.030398434],"genre_scores_gemma":[0.980963,6.38194e-7,0.017478155,0.00030217244,0.000026004469,0.00015348995,0.0000028212955,0.000018234023,0.0010554936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861634,0.00028437038,0.00031902132,0.00029006452,0.00020255118,0.00028766578],"domain_scores_gemma":[0.99830765,0.0011241467,0.00008180486,0.00037837983,0.000022523605,0.00008548277],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008418437,0.00015617673,0.00032516054,0.000043131906,0.0003754519,0.000014657656,0.00019550062,0.00006033639,0.0022801817],"category_scores_gemma":[0.00028797783,0.00013023108,0.00006841942,0.00010217649,0.00027226962,0.00006396036,0.000097088494,0.00031028618,0.000057350244],"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.000030245947,0.00027056757,0.000046418558,0.0000964705,0.00001232144,0.00002302438,0.001930746,8.695043e-7,0.000041558902,0.9945008,0.0002736057,0.0027733545],"study_design_scores_gemma":[0.000272437,0.0004503061,0.00008915501,0.0000043280475,0.000023365661,0.00017734278,0.0027299859,0.00018569322,0.000013024565,0.9953535,0.0005421494,0.00015870371],"about_ca_topic_score_codex":9.4082145e-7,"about_ca_topic_score_gemma":0.0000010034736,"teacher_disagreement_score":0.11587447,"about_ca_system_score_codex":0.000045411904,"about_ca_system_score_gemma":0.000016218455,"threshold_uncertainty_score":0.9986319},"labels":[],"label_agreement":null},{"id":"W4379010621","doi":"10.1002/malq.202200021","title":"Cofinal types on ω<sub>2</sub>","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Science Fund of the Republic of Serbia","keywords":"Successor cardinal; Mathematics; Cofinality; Class (philosophy); Simple (philosophy); Type (biology); Discrete mathematics; Countable set; Uncountable set; Computer science; Artificial intelligence; Mathematical analysis; Epistemology","score_opus":0.04692441027446455,"score_gpt":0.31960517528390653,"score_spread":0.272680765009442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379010621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8895639,0.000023348332,0.04991554,0.0018957489,0.0003700524,0.0005257425,0.000022043176,0.0014809693,0.05620264],"genre_scores_gemma":[0.9932807,0.000004709055,0.0044766674,0.00047159626,0.00015822047,0.00007547371,0.000011730108,0.000048670823,0.0014722523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983159,0.00017613941,0.00039707325,0.00033224098,0.0002783499,0.0005003124],"domain_scores_gemma":[0.99705017,0.0022158588,0.00009765068,0.00047469663,0.000040552688,0.000121097946],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000743238,0.0002496673,0.00041709188,0.00012769322,0.0001631464,0.000024490846,0.0002513617,0.00019682106,0.0003963181],"category_scores_gemma":[0.00061343855,0.00018973823,0.00014040452,0.00027296515,0.00022947922,0.00007172184,0.00002934196,0.00030174572,0.011158497],"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.00006166145,0.00019174884,0.0000029875996,0.000102566075,0.000031262778,0.00010037793,0.0007500946,0.0000039160495,0.0016994657,0.9865311,0.0036927809,0.006832039],"study_design_scores_gemma":[0.00029324717,0.00078338094,0.0000407914,0.00005795512,0.000030905572,0.000038241073,0.00042978168,0.0005248837,0.002422885,0.99493176,0.00021982919,0.00022633193],"about_ca_topic_score_codex":1.4509463e-7,"about_ca_topic_score_gemma":0.0000014740118,"teacher_disagreement_score":0.10371676,"about_ca_system_score_codex":0.000030220031,"about_ca_system_score_gemma":0.000017572107,"threshold_uncertainty_score":0.98961145},"labels":[],"label_agreement":null},{"id":"W4385222867","doi":"10.1002/malq.202200044","title":"Topological duality for orthomodular lattices","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Morphism; Topological space; Category of topological spaces; Pure mathematics; Class (philosophy); Duality (order theory); Discrete mathematics; Algebra over a field; Topological tensor product; Functional analysis","score_opus":0.04756827024346589,"score_gpt":0.31647797732285965,"score_spread":0.26890970707939377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385222867","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.048060503,0.000025958932,0.943981,0.0034227718,0.00018645615,0.00037597417,0.0000053485965,0.00096513075,0.0029768946],"genre_scores_gemma":[0.85783917,0.0000020903262,0.14045452,0.00068299304,0.000112972775,0.00017104615,0.000008423594,0.00001154469,0.000717235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827504,0.0000848876,0.00036451648,0.00048671447,0.00026271917,0.00052610884],"domain_scores_gemma":[0.99834335,0.00080793933,0.00008272889,0.00057025295,0.00005735092,0.00013836454],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006497572,0.00018499036,0.00032563452,0.00006732393,0.00017754773,0.00012753082,0.00074065634,0.00011667439,0.00009361378],"category_scores_gemma":[0.0001744886,0.00012796183,0.00016025531,0.00041274147,0.00011066924,0.00027113623,0.00008929434,0.00011717909,0.0010151425],"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.0000038045612,0.00008325425,0.000026779433,0.000057916626,0.00000874864,0.000028769218,0.00047773044,0.000008847873,0.000102053156,0.98686075,0.00031279385,0.01202855],"study_design_scores_gemma":[0.0002271087,0.0005469215,0.00077626854,0.000009935676,0.000006739107,0.0000175176,0.00016138339,0.025618644,0.000056282064,0.9713725,0.0010136088,0.00019312838],"about_ca_topic_score_codex":4.5585764e-7,"about_ca_topic_score_gemma":6.761155e-7,"teacher_disagreement_score":0.8097787,"about_ca_system_score_codex":0.000016313756,"about_ca_system_score_gemma":0.00001625724,"threshold_uncertainty_score":0.99976265},"labels":[],"label_agreement":null},{"id":"W4385224119","doi":"10.1002/malq.202200059","title":"Avoiding Medvedev reductions inside a linear order","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Mathematics; Lift (data mining); Order (exchange); Interval (graph theory); Construct (python library); Discrete mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.04155128374394942,"score_gpt":0.290644978695253,"score_spread":0.2490936949513036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385224119","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.03067426,0.0000275447,0.9532799,0.0061265165,0.000625744,0.0003990486,0.0000031468637,0.0020307994,0.006833015],"genre_scores_gemma":[0.60512066,0.000004571812,0.39259076,0.00043476612,0.0003843064,0.0001425024,0.000008342062,0.000037447247,0.0012766477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971189,0.00031171707,0.0006083733,0.0007329657,0.00055504334,0.0006730389],"domain_scores_gemma":[0.99736804,0.0010706715,0.00010458045,0.0010400148,0.00018345304,0.00023323281],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014543897,0.0002846818,0.00041742634,0.0002442108,0.0004243123,0.00024152221,0.0010999901,0.00014017666,0.00017845708],"category_scores_gemma":[0.00078715157,0.00023291555,0.00016050621,0.0019103466,0.00015618629,0.00038630504,0.000277637,0.0004915294,0.004098755],"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.0000049410337,0.00055620365,0.000019960915,0.00015865926,0.000058993035,0.00021398466,0.010977549,0.0004927929,0.0009808941,0.91149217,0.0030206582,0.07202319],"study_design_scores_gemma":[0.00018105374,0.00027326183,0.00018909521,0.00003192452,0.000009561374,0.00015187463,0.00058007636,0.30776188,0.0000990122,0.6897785,0.0006710491,0.00027270502],"about_ca_topic_score_codex":0.000008761089,"about_ca_topic_score_gemma":0.0000034237428,"teacher_disagreement_score":0.5744464,"about_ca_system_score_codex":0.00007459452,"about_ca_system_score_gemma":0.000081703714,"threshold_uncertainty_score":0.9966767},"labels":[],"label_agreement":null},{"id":"W4388933863","doi":"10.1002/malq.202300017","title":"A dichotomy for T$T$‐convex fields with a monomial group","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Monomial; Mathematics; Regular polygon; Group (periodic table); Combinatorics; Pure mathematics; Geometry; Physics","score_opus":0.045650421504437246,"score_gpt":0.3262218439188264,"score_spread":0.28057142241438915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388933863","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.1811721,0.000012431281,0.8063717,0.0012921834,0.00014536687,0.0011561414,0.000020086869,0.00072724186,0.009102756],"genre_scores_gemma":[0.90989923,0.0000016693103,0.085034296,0.00044097975,0.00022514528,0.0008861601,0.000022757671,0.000064353146,0.0034254233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857193,0.0000682846,0.0003711992,0.00033359075,0.00015878402,0.0004961904],"domain_scores_gemma":[0.99717325,0.002156513,0.000103448554,0.0004075341,0.00004179179,0.000117469295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050893944,0.00023477669,0.00047585377,0.00009034536,0.00015585094,0.000028856206,0.00024231213,0.00020877612,0.0003352483],"category_scores_gemma":[0.0002531046,0.00016211814,0.0001368481,0.00018297155,0.00020648487,0.00010243093,0.000021360795,0.0002007375,0.00040060325],"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.00018150361,0.00015563109,0.000011112612,0.00023806539,0.000058468075,0.000037269372,0.0017674126,0.000001978271,0.00005701207,0.99286956,0.0022347998,0.0023871802],"study_design_scores_gemma":[0.0009930682,0.0012523931,0.000025356501,0.00004735737,0.00005619748,0.000036452446,0.0010750201,0.0017567803,0.000045144745,0.99374944,0.0007285478,0.00023421942],"about_ca_topic_score_codex":7.684268e-7,"about_ca_topic_score_gemma":0.000007984162,"teacher_disagreement_score":0.7287271,"about_ca_system_score_codex":0.000021619448,"about_ca_system_score_gemma":0.000018437182,"threshold_uncertainty_score":0.6610986},"labels":[],"label_agreement":null},{"id":"W4402522828","doi":"10.1002/malq.202400030","title":"Effectiveness of Walker's cancellation theorem","year":2024,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Mathematical economics; Calculus (dental); Discrete mathematics; Mathematics education; Medicine","score_opus":0.010137675523845344,"score_gpt":0.24654553770877644,"score_spread":0.2364078621849311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402522828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42545712,0.003308589,0.42498928,0.00013978906,0.00047030824,0.0005074996,0.00003913888,0.0007634349,0.14432482],"genre_scores_gemma":[0.99824905,0.00001354459,0.0016247383,0.0000021568876,0.00001732382,0.000023509036,0.0000063687253,0.000015145565,0.000048146034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995006,0.000051421644,0.00018634865,0.0000804205,0.000078764366,0.00010247751],"domain_scores_gemma":[0.99923056,0.0004441235,0.000009380793,0.00026747157,0.000018363102,0.000030095722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030747612,0.00008501898,0.0001484888,0.000049540115,0.00001552242,0.000023248229,0.00012207436,0.00004562435,0.00019794088],"category_scores_gemma":[0.000011873709,0.00006509447,0.000057817924,0.00013578276,0.000040195195,0.00004116725,0.00000722305,0.00008994617,0.0001329683],"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.000007292357,0.00005641935,0.0000061105625,0.002341311,0.00005595124,0.0000048405195,0.0008875845,0.00055274117,0.016236383,0.96205443,0.0002538716,0.017543085],"study_design_scores_gemma":[0.00012549282,0.00016048028,0.000310963,0.0006018937,0.0000335905,0.000010470013,0.00008725259,0.19309336,0.0045810407,0.79965603,0.0011702414,0.0001691803],"about_ca_topic_score_codex":0.000001890843,"about_ca_topic_score_gemma":0.0000010157067,"teacher_disagreement_score":0.57279193,"about_ca_system_score_codex":0.00002630143,"about_ca_system_score_gemma":0.000007807119,"threshold_uncertainty_score":0.26544756},"labels":[],"label_agreement":null}]}