{"meta":{"query_hash":"68074938eee5","filters":{"venue":"Annals of Pure and Applied Logic"},"cohort_total":65,"direct_labels_cover":0,"predictions_cover":65,"exported":65,"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/68074938eee5","api":"https://metacan.xera.ac/api/v1/cohort?venue=Annals+of+Pure+and+Applied+Logic"},"results":[{"id":"W131197506","doi":"10.1016/j.apal.2005.06.003","title":"What can be efficiently reduced to the Kolmogorov-random strings?","year":2005,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Time complexity; Mathematics; Decidability; PSPACE; Monotone polygon; Discrete mathematics; Reduction (mathematics); Set (abstract data type); Upper and lower bounds; Binary logarithm; Computational complexity theory; Computer science; Algorithm","score_opus":0.0468738684075537,"score_gpt":0.28981120707797775,"score_spread":0.24293733867042405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131197506","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.811783,0.0020359042,0.05325609,0.127053,0.0006332352,0.0014210531,0.000013977377,0.00024573327,0.0035579947],"genre_scores_gemma":[0.9857971,0.00013257076,0.005496624,0.0081946775,0.00022286539,0.000036800484,0.000002641322,0.000008340101,0.000108401364],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981983,0.000060990405,0.00034079058,0.0005781277,0.00037858658,0.00044324147],"domain_scores_gemma":[0.9986319,0.00021476828,0.00012521898,0.0007326844,0.00011841811,0.00017700536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078250177,0.00022176706,0.00032771533,0.00009186613,0.00018298584,0.00031034034,0.0010856494,0.000080961065,0.000015723943],"category_scores_gemma":[0.00004432715,0.00014941566,0.00009586081,0.00050265575,0.000099846984,0.00020522739,0.00056682987,0.00017241368,0.000018578565],"study_design_candidate":"design_other","study_design_consensus":null,"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.00010672351,0.0005512996,0.000056212433,0.000052573665,0.000079321275,0.00000903371,0.009223608,0.01770158,0.0063446867,0.13310952,0.01395906,0.8188064],"study_design_scores_gemma":[0.008874752,0.0035145304,0.022380728,0.00031882667,0.00017207052,0.0001870539,0.0069844113,0.07995606,0.35308087,0.19262192,0.32720548,0.0047033154],"about_ca_topic_score_codex":0.000014645469,"about_ca_topic_score_gemma":0.000045262223,"teacher_disagreement_score":0.81410307,"about_ca_system_score_codex":0.000013043367,"about_ca_system_score_gemma":0.00004624785,"threshold_uncertainty_score":0.6092994},"labels":[],"label_agreement":null},{"id":"W1611875164","doi":"10.1016/j.apal.2007.03.001","title":"First-order Gödel logics","year":2007,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":64,"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":"Uncountable set; Negation; Mathematics; Interpretation (philosophy); Order (exchange); Combinatorics; Discrete mathematics; Finite set; Countable set; Computer science; Mathematical analysis","score_opus":0.04747162189864145,"score_gpt":0.2948686843336565,"score_spread":0.24739706243501502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1611875164","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.037099607,0.0012516206,0.92619973,0.002632349,0.00010802082,0.00019314178,0.0000019670642,0.00013499026,0.03237859],"genre_scores_gemma":[0.9635456,0.0002434579,0.03203328,0.0039669187,0.00006959767,0.000004867027,0.0000018810435,0.0000057022266,0.00012870015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890214,0.0000081897215,0.00023883616,0.00032169023,0.00017307476,0.0003560939],"domain_scores_gemma":[0.9992772,0.00011208375,0.00011391707,0.0003110972,0.00008103996,0.000104714185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036875316,0.00015014676,0.00021295236,0.00007342456,0.00011244022,0.000029862073,0.000412325,0.00010294694,0.00001809378],"category_scores_gemma":[0.000023448873,0.00011484554,0.000046476027,0.000357427,0.000089002,0.00013437356,0.00018445415,0.00012377075,0.000023079961],"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.000012921767,0.00007092131,0.00013397785,0.000021728669,0.00001076358,0.000012991605,0.00020518918,0.0002351188,0.0007259092,0.9638133,0.0009149446,0.033842217],"study_design_scores_gemma":[0.00037206477,0.00023823707,0.0063336175,0.000013790799,0.0000067403716,0.00001933507,0.00016097676,0.0006568787,0.009126477,0.96221745,0.020477526,0.0003768777],"about_ca_topic_score_codex":0.0000018849214,"about_ca_topic_score_gemma":0.000009666287,"teacher_disagreement_score":0.92644596,"about_ca_system_score_codex":0.0000026571538,"about_ca_system_score_gemma":0.000012867133,"threshold_uncertainty_score":0.46832654},"labels":[],"label_agreement":null},{"id":"W1883221139","doi":"10.1016/j.apal.2015.08.001","title":"Measuring complexities of classes of structures","year":2015,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Turing; Mathematics; Class (philosophy); Ordinal data; Ordinal regression; Discrete mathematics; Bounded function; Computer science; Artificial intelligence; Statistics","score_opus":0.22346921515104232,"score_gpt":0.3130626732780226,"score_spread":0.0895934581269803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883221139","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.9047713,0.0026476586,0.07326396,0.0010198148,0.00020358109,0.00036985314,0.000021301463,0.00009893504,0.017603561],"genre_scores_gemma":[0.9771373,0.000021323744,0.022662917,0.00012266096,0.00003948013,0.0000031491907,0.0000014020413,0.0000040315817,0.000007713272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884164,0.000042827527,0.00035462825,0.00024556534,0.00033337963,0.00018195069],"domain_scores_gemma":[0.9989402,0.00012443704,0.00023325958,0.0003607692,0.00026157647,0.000079698715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041063476,0.00013276788,0.00040090334,0.00009267815,0.000027623295,0.000020994345,0.00052585854,0.00006293439,0.000005929647],"category_scores_gemma":[0.000046601646,0.00010599307,0.00006145986,0.00021234415,0.00023824214,0.000097616,0.00034857012,0.00007730434,7.476909e-7],"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.000032844247,0.00013994558,0.0010649747,0.00023611735,0.000052312585,0.0000018894788,0.0016846659,0.0013588856,0.0045778537,0.96337485,0.00086881913,0.026606828],"study_design_scores_gemma":[0.0003044852,0.0002896109,0.012409024,0.000019876343,0.000008325495,0.000006873622,0.00048528568,0.0012224425,0.07264512,0.9121273,0.00031403993,0.00016760775],"about_ca_topic_score_codex":0.000029713026,"about_ca_topic_score_gemma":0.00000870308,"teacher_disagreement_score":0.072365984,"about_ca_system_score_codex":0.000003837444,"about_ca_system_score_gemma":0.00005338639,"threshold_uncertainty_score":0.43222722},"labels":[],"label_agreement":null},{"id":"W1966402460","doi":"10.1016/j.apal.2008.09.019","title":"Definable principal congruences and solvability","year":2008,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","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":"McMaster University","funders":"","keywords":"Congruence relation; Mathematics; Principal (computer security); Pure mathematics; Discrete mathematics; Computer science","score_opus":0.06344789465245204,"score_gpt":0.2813684653132636,"score_spread":0.21792057066081155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966402460","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.9771578,0.0014005982,0.01197287,0.00080857985,0.00003320415,0.00014478392,0.0000017827282,0.00005913167,0.008421266],"genre_scores_gemma":[0.9914446,0.0004980814,0.0071133235,0.0008458367,0.000019713621,0.000010177281,7.9814964e-7,0.0000024207798,0.00006506511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916244,0.000016538985,0.0001635581,0.0003137744,0.00011981869,0.00022387347],"domain_scores_gemma":[0.99950796,0.00007212383,0.0000770811,0.00021627329,0.00004496713,0.00008160312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017662116,0.00011116559,0.00020475793,0.000032594657,0.00015244084,0.000020471653,0.0002246593,0.00005728233,0.0000072047155],"category_scores_gemma":[0.000020492389,0.0000837278,0.00002674994,0.00013576674,0.00025263338,0.00017157957,0.00017211765,0.00008068397,0.000004392414],"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.000014386444,0.000079038684,0.0052128616,0.00004299335,0.000011369168,0.000014853906,0.0005462052,0.00005522814,0.0011149577,0.9777843,0.00033749317,0.014786314],"study_design_scores_gemma":[0.00040583662,0.00033375525,0.07416921,0.00001116091,0.000005956435,0.00008361412,0.0001621392,0.0003607634,0.012627576,0.90731174,0.0041746697,0.00035359224],"about_ca_topic_score_codex":0.000006950348,"about_ca_topic_score_gemma":0.0000042000456,"teacher_disagreement_score":0.07047257,"about_ca_system_score_codex":0.0000016003459,"about_ca_system_score_gemma":0.000024534822,"threshold_uncertainty_score":0.34143206},"labels":[],"label_agreement":null},{"id":"W1967948656","doi":"10.1016/j.apal.2003.10.018","title":"The proof complexity of linear algebra","year":2004,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":39,"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":"Mathematics; Algebra over a field; Linear algebra; Discrete mathematics; Pure mathematics","score_opus":0.13543145746453764,"score_gpt":0.3439368107145531,"score_spread":0.20850535325001548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967948656","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.149903,0.00093439966,0.83135176,0.0060109384,0.00011736523,0.00049616426,0.0000052321475,0.00006154648,0.011119571],"genre_scores_gemma":[0.820749,0.00006294469,0.17886636,0.000283313,0.000018667912,0.000007789207,7.3281e-7,0.000002039379,0.000009153697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939764,0.000024050893,0.00018983909,0.00013173844,0.00013598849,0.00012073913],"domain_scores_gemma":[0.9994164,0.000038693943,0.00014206122,0.00030706238,0.00006750844,0.000028281638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051950186,0.00006257524,0.00011771324,0.000021530504,0.00009365572,0.000015247454,0.00041047146,0.00003898121,0.0000013483207],"category_scores_gemma":[0.000030929634,0.000040062034,0.000029359664,0.00016506894,0.00024290732,0.000073071074,0.000108147346,0.00006751297,0.000002683842],"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.0000076082233,0.000032011038,0.0000064023384,0.000016452132,0.0000057559014,1.3970637e-7,0.00024067004,0.000084453044,0.0019937025,0.9762177,0.00005313356,0.02134199],"study_design_scores_gemma":[0.00012520998,0.00011008822,0.0016604904,0.000008106408,0.0000022133263,0.000002094854,0.000053487533,0.0005919159,0.22799611,0.76849306,0.000896144,0.000061079845],"about_ca_topic_score_codex":0.0000047649196,"about_ca_topic_score_gemma":0.0000022182376,"teacher_disagreement_score":0.670846,"about_ca_system_score_codex":0.0000019351303,"about_ca_system_score_gemma":0.000020269954,"threshold_uncertainty_score":0.16336824},"labels":[],"label_agreement":null},{"id":"W1970954854","doi":"10.1016/s0168-0072(00)00006-3","title":"Higher type recursion, ramification and polynomial time","year":2000,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":70,"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":"Recursion (computer science); Mathematics; Type (biology); Polynomial; Ramification; Notation; Algebra over a field; Discrete mathematics; Pure mathematics; Arithmetic; Algorithm; Mathematical analysis","score_opus":0.03763477329273652,"score_gpt":0.2673608311565192,"score_spread":0.2297260578637827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970954854","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.5594219,0.012309529,0.008980909,0.015387037,0.00081934844,0.001676973,0.000006735272,0.00065878726,0.40073878],"genre_scores_gemma":[0.99608886,0.00025628906,0.00050895504,0.0005994037,0.000090780086,0.0000052002856,0.0000043765035,0.0000038781122,0.0024422721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993677,0.000022004497,0.0001419411,0.00022974875,0.00009335573,0.00014526333],"domain_scores_gemma":[0.99963737,0.000021316342,0.0000623874,0.00019147445,0.000037695838,0.00004975014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018949986,0.0000866488,0.00014266546,0.00003114134,0.00006486274,0.000053820695,0.00016379541,0.00007932853,0.00009491134],"category_scores_gemma":[0.0000032008627,0.000065863875,0.000019222472,0.00014102328,0.00005311792,0.00009800569,0.000036458627,0.000051445168,0.000101451566],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.000055360597,0.00009698061,0.00015639262,0.000038093127,0.000026445552,0.000002924568,0.0004949687,0.0000058481796,0.00408795,0.57225764,0.026920792,0.39585662],"study_design_scores_gemma":[0.00078194076,0.0006565843,0.01112023,0.000010111038,0.000019702044,0.000024307517,0.000041637286,0.00044223308,0.006685629,0.17958213,0.8000988,0.0005367424],"about_ca_topic_score_codex":0.000008884436,"about_ca_topic_score_gemma":5.825175e-7,"teacher_disagreement_score":0.773178,"about_ca_system_score_codex":0.0000016466486,"about_ca_system_score_gemma":0.00001027445,"threshold_uncertainty_score":0.2685851},"labels":[],"label_agreement":null},{"id":"W1976087186","doi":"10.1016/j.apal.2010.06.001","title":"Infinitely Peano differentiable functions in polynomially bounded o-minimal structures","year":2010,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"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":"Peano axioms; Mathematics; Differentiable function; Bounded function; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.06128211050150189,"score_gpt":0.3294251231486668,"score_spread":0.2681430126471649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976087186","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.9782562,0.00007948443,0.00055028487,0.0003102267,0.000093447234,0.00014603793,0.000014743874,0.000033483026,0.020516057],"genre_scores_gemma":[0.9965435,0.00001855869,0.0024308893,0.00035675504,0.00008464169,0.000013934603,0.000010132827,0.000011500976,0.00053004647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992183,0.000025088246,0.00025461052,0.00019180578,0.00007699172,0.0002332295],"domain_scores_gemma":[0.9993608,0.00024483498,0.000114256836,0.00019687905,0.000029428553,0.0000538215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019100412,0.00014266935,0.00027920195,0.00009770974,0.00009492685,0.000013584946,0.000116350435,0.00018920777,0.00034101555],"category_scores_gemma":[0.000093943236,0.000115674375,0.000046691974,0.000089938614,0.0002270552,0.000050838105,0.00005714594,0.0003403374,0.0000071349054],"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.00014252707,0.000097999175,0.00055104017,0.000035963185,0.000025108762,0.0000025552781,0.0002588745,0.000003944869,0.01735155,0.9793344,0.0010474438,0.0011485614],"study_design_scores_gemma":[0.00037050075,0.00006688766,0.0054153837,0.0000048843726,0.000015295278,0.000006726812,0.00032186531,0.0000039767533,0.0073112864,0.98517025,0.0011847989,0.00012816704],"about_ca_topic_score_codex":0.0000035991372,"about_ca_topic_score_gemma":0.00012647259,"teacher_disagreement_score":0.01998601,"about_ca_system_score_codex":0.0000016126709,"about_ca_system_score_gemma":0.000022152364,"threshold_uncertainty_score":0.47170642},"labels":[],"label_agreement":null},{"id":"W1979127885","doi":"10.1016/j.apal.2008.04.005","title":"Introduction to Turing categories","year":2008,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":45,"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 Ottawa; University of Calgary","funders":"","keywords":"Turing machine; Turing; Categorical variable; Mathematics; Computability theory; Description number; Recursion (computer science); Computability; Generality; Super-recursive algorithm; Algebra over a field; Exposition (narrative); Universal Turing machine; Computer science; Computation; Discrete mathematics; Algorithm; Pure mathematics; Programming language","score_opus":0.04680070270485933,"score_gpt":0.26789864610753344,"score_spread":0.2210979434026741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979127885","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.69953907,0.0005778499,0.26906708,0.025364693,0.00047089433,0.00044712244,0.000002445378,0.00027817726,0.0042527067],"genre_scores_gemma":[0.9767657,0.000059109705,0.02176875,0.0008254322,0.00047674114,0.00001450334,0.0000015651273,0.000004611539,0.00008357694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894226,0.000018785022,0.0002022163,0.0004200372,0.00018232534,0.00023440344],"domain_scores_gemma":[0.9993307,0.000038090482,0.000062379055,0.00038443808,0.00009049903,0.00009387808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002348768,0.00012739399,0.00021138563,0.00008862328,0.00012604149,0.00003500819,0.00035083163,0.000052669526,0.00001213411],"category_scores_gemma":[0.000027477534,0.00010836853,0.000038883703,0.00034508223,0.000079743,0.00013604779,0.0002969578,0.00009232189,0.000024283394],"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.000053476186,0.0003916351,0.00073354784,0.000111568705,0.00005830777,0.000029750932,0.0062807137,0.0040846677,0.013359849,0.72182983,0.036178045,0.21688862],"study_design_scores_gemma":[0.0007369177,0.001174323,0.05593351,0.000018200068,0.000018430212,0.00030889869,0.00040030072,0.0030244568,0.24580844,0.6146452,0.07658147,0.0013498779],"about_ca_topic_score_codex":0.0000107649,"about_ca_topic_score_gemma":0.0000033697304,"teacher_disagreement_score":0.27722666,"about_ca_system_score_codex":0.000005700705,"about_ca_system_score_gemma":0.00002088944,"threshold_uncertainty_score":0.44191402},"labels":[],"label_agreement":null},{"id":"W1981329023","doi":"10.1016/j.apal.2003.11.009","title":"Boolean algebras arising from information systems","year":2004,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Interior algebra; Mathematics; Stone's representation theorem for Boolean algebras; Modal operator; Complete Boolean algebra; Boolean algebras canonically defined; Free Boolean algebra; Connection (principal bundle); Set (abstract data type); Algebra over a field; Modal; Discrete mathematics; Two-element Boolean algebra; Pure mathematics; Modal logic; Computer science; Subalgebra; Division algebra; Algebra representation","score_opus":0.03007391690818214,"score_gpt":0.25807795959950447,"score_spread":0.22800404269132232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981329023","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.22224307,0.0011970559,0.7649759,0.0012328298,0.00017255433,0.00024915094,0.0000087801045,0.00015548202,0.009765195],"genre_scores_gemma":[0.9908563,0.00009037932,0.007407361,0.0015641782,0.000054773933,0.000007823987,0.000009873979,0.0000030537542,0.000006266201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992076,0.000010673818,0.00025138955,0.00017496997,0.00016362223,0.00019170156],"domain_scores_gemma":[0.9994528,0.000033908265,0.00015935292,0.00023974401,0.000045996825,0.00006817539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012249876,0.00011852359,0.00018812575,0.000065519176,0.000086366126,0.00010508409,0.00027678304,0.000075102966,0.0000025806405],"category_scores_gemma":[0.000010271512,0.00009526262,0.000033930006,0.00016587543,0.000041176154,0.0005864451,0.00010227079,0.0000938254,0.00003390357],"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.000005067889,0.000021307898,0.000028899809,0.000017778488,0.000012022065,0.0000019677514,0.00052569783,0.0024557593,0.0009478039,0.9756157,0.00014089438,0.020227123],"study_design_scores_gemma":[0.0005215828,0.000120636054,0.0027388823,0.000048082027,0.0000076935385,0.000009841121,0.00045525245,0.00048642323,0.008126805,0.9835542,0.0036517614,0.00027883687],"about_ca_topic_score_codex":0.000026482952,"about_ca_topic_score_gemma":0.0000020652653,"teacher_disagreement_score":0.7686132,"about_ca_system_score_codex":0.0000052052837,"about_ca_system_score_gemma":0.000020341611,"threshold_uncertainty_score":0.3884697},"labels":[],"label_agreement":null},{"id":"W1983031289","doi":"10.1016/j.apal.2008.09.005","title":"o-minimal analytic separation of sets in dimension 2","year":2008,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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 Saskatchewan","funders":"","keywords":"Mathematics; Dimension (graph theory); Separation (statistics); Combinatorics; Pure mathematics; Discrete mathematics; Statistics","score_opus":0.1080255414990182,"score_gpt":0.38130469866319566,"score_spread":0.27327915716417744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983031289","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.9942164,0.00020497604,0.00042730733,0.00014517944,0.000010137956,0.000101203674,0.0000029687037,0.000008819325,0.0048830044],"genre_scores_gemma":[0.9982674,0.0001351205,0.0013502573,0.00014266389,0.000009378378,0.0000040655214,0.000004485849,0.0000042540773,0.00008234091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945885,0.000025585143,0.00022893609,0.00011229099,0.00006824914,0.000106065556],"domain_scores_gemma":[0.9995779,0.00014806601,0.00011966074,0.000105859894,0.000027274711,0.000021239868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018709729,0.00007395862,0.00024445105,0.000065343425,0.000030424888,6.6059255e-7,0.000043060754,0.000086626664,0.00002607718],"category_scores_gemma":[0.000040486808,0.000060559814,0.000029625,0.0000928574,0.00013246451,0.000033233497,0.000022304384,0.00007220121,0.000002619521],"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.00029118525,0.00027228377,0.0013433766,0.000118355114,0.000033083772,0.000017161658,0.0019065549,0.00015765539,0.013280314,0.9801267,0.0011762391,0.0012770945],"study_design_scores_gemma":[0.00034114154,0.0001340354,0.0045225183,0.000017560596,0.000012339309,0.000011860495,0.00026927685,0.00007164979,0.029441163,0.9650303,0.000059982987,0.00008816437],"about_ca_topic_score_codex":0.0000012478216,"about_ca_topic_score_gemma":0.0000067380747,"teacher_disagreement_score":0.01616085,"about_ca_system_score_codex":0.0000016336611,"about_ca_system_score_gemma":0.000009650045,"threshold_uncertainty_score":0.24695575},"labels":[],"label_agreement":null},{"id":"W1986218945","doi":"10.1016/j.apal.2007.04.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>O</mml:mi></mml:math>-minimal <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi>Λ</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup></mml:math>-regular stratification","year":2007,"lang":"lv","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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 Saskatchewan","funders":"","keywords":"Mathematics; Lipschitz continuity; Order (exchange); Scroll; Algorithm; Discrete mathematics; Pure mathematics; Theology","score_opus":0.027501634343880473,"score_gpt":0.2733949552202487,"score_spread":0.24589332087636823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986218945","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.8284016,0.0029750606,0.0029116713,0.0012860389,0.002272458,0.0001762518,0.00083270675,0.00045429406,0.16068992],"genre_scores_gemma":[0.97790706,0.0032875228,0.0062583024,0.0032469733,0.0033025295,0.0014750647,0.0027490095,0.0011422106,0.00063132035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98456657,0.00060412375,0.003970148,0.0032936148,0.003427396,0.004138152],"domain_scores_gemma":[0.98609793,0.003322198,0.0043640775,0.004114076,0.00039893648,0.0017027671],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0042479835,0.0020027752,0.0010469718,0.0007972883,0.002826602,0.0014188566,0.0031491905,0.0051005813,0.03789891],"category_scores_gemma":[0.002206426,0.0031828603,0.002812272,0.0015533183,0.0036588213,0.0021009513,0.0024812745,0.0033190586,0.0033158432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.0045159627,0.0012482767,0.000015106747,0.0027044215,0.0026644028,0.001905104,0.003183577,0.0020992556,0.006869734,0.9225389,0.04915521,0.0031000632],"study_design_scores_gemma":[0.0044839643,0.004005911,0.00017469263,0.0019145771,0.0034538165,0.0025693304,0.0064863907,0.2675898,0.69130725,0.007097648,0.0073119425,0.0036046924],"about_ca_topic_score_codex":0.00057054544,"about_ca_topic_score_gemma":0.0010230987,"teacher_disagreement_score":0.9154412,"about_ca_system_score_codex":0.000030552394,"about_ca_system_score_gemma":0.0017902115,"threshold_uncertainty_score":0.99961776},"labels":[],"label_agreement":null},{"id":"W1993827888","doi":"10.1016/j.apal.2005.04.005","title":"Structures interpretable in models of bounded arithmetic","year":2005,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto","keywords":"Pigeonhole principle; Mathematics; Bounded function; Converse; Discrete mathematics; Injective function; Reverse mathematics; Intuitionism; Combinatorics; Mathematical analysis; Axiom","score_opus":0.047674248122388595,"score_gpt":0.2869142189680694,"score_spread":0.2392399708456808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993827888","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.6049093,0.002292802,0.3747418,0.0024266231,0.000110990135,0.00053626177,0.000009417442,0.00009731857,0.0148754995],"genre_scores_gemma":[0.9491158,0.00005824742,0.050317075,0.00044683012,0.000030288107,0.000008927112,0.0000011800531,0.000004921214,0.00001673316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868906,0.000039019164,0.00040292073,0.0003771527,0.00021722082,0.0002746092],"domain_scores_gemma":[0.9992039,0.00010127707,0.00014140148,0.0004152794,0.000074563344,0.00006354444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038086655,0.0001589077,0.00038390543,0.00015387285,0.000029978763,0.000043991262,0.00058759627,0.00009306012,0.0000144016385],"category_scores_gemma":[0.000016909527,0.00013296341,0.00006186606,0.00033232858,0.00012403652,0.00022353185,0.00034482937,0.0001416908,0.0000017943024],"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.000027170236,0.0002467962,0.00019375418,0.00008559404,0.000025431189,0.0000028550455,0.0014014337,0.020901486,0.0017609819,0.8353411,0.00020996804,0.13980342],"study_design_scores_gemma":[0.00027199514,0.00011261151,0.0017136914,0.00001524978,0.0000040831687,0.0000060871525,0.000057659043,0.101648346,0.009539631,0.8862959,0.0001735053,0.00016124798],"about_ca_topic_score_codex":0.0000261785,"about_ca_topic_score_gemma":0.000035197274,"teacher_disagreement_score":0.3442065,"about_ca_system_score_codex":0.000008722255,"about_ca_system_score_gemma":0.000036155692,"threshold_uncertainty_score":0.542209},"labels":[],"label_agreement":null},{"id":"W1996830918","doi":"10.1016/j.apal.2004.03.001","title":"Saturated models of intuitionistic theories","year":2004,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Mathematical and Theoretical Analysis","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Categorical variable; Mathematics; Intuitionistic logic; Filter (signal processing); Construct (python library); Pure mathematics; Algebra over a field; Topos theory; Discrete mathematics; Propositional calculus; Computer science; Statistics","score_opus":0.07420537336851178,"score_gpt":0.314725394603388,"score_spread":0.2405200212348762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996830918","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.62142706,0.0004697373,0.1934299,0.0028950316,0.000024983177,0.00045202376,0.000058434976,0.000099975434,0.18114284],"genre_scores_gemma":[0.995324,0.00005930977,0.004373472,0.00015927541,0.000015884796,0.0000085155725,0.000004662619,0.0000067836563,0.000048099497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992325,0.000016714503,0.00032826408,0.00013011131,0.00015468469,0.00013773315],"domain_scores_gemma":[0.9993377,0.0002229212,0.00012890529,0.00015972849,0.000094401934,0.000056369605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023420666,0.000112700785,0.00037851845,0.00004264511,0.000042165193,0.000010101545,0.00009496755,0.00007485284,0.00013493319],"category_scores_gemma":[0.00011313069,0.00007315994,0.00008236689,0.00016844872,0.0003068704,0.00003115084,0.00004379778,0.000072839895,0.000004990159],"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.000029749832,0.00016047395,7.0125185e-7,0.00023668942,0.00006017702,8.601136e-7,0.0002560942,0.0000670137,0.00089997135,0.9977461,0.00003791498,0.0005042321],"study_design_scores_gemma":[0.0001651617,0.0000646546,0.000004937564,0.000046511384,0.000063665175,0.0000017207944,0.00019537593,0.00010206005,0.020041905,0.97922355,0.0000068070603,0.000083643754],"about_ca_topic_score_codex":0.0000029781324,"about_ca_topic_score_gemma":0.0000017933544,"teacher_disagreement_score":0.37389693,"about_ca_system_score_codex":0.0000017614797,"about_ca_system_score_gemma":0.000010995955,"threshold_uncertainty_score":0.29833758},"labels":[],"label_agreement":null},{"id":"W1998220929","doi":"10.1016/j.apal.2009.06.008","title":"Effectiveness in RPL, with applications to continuous logic","year":2009,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Decidability; Mathematics; Discrete mathematics; Model theory; Abstract model theory; Extension (predicate logic); Computability; Algebra over a field; Pure mathematics; Computer science","score_opus":0.031871769687497095,"score_gpt":0.2976856607751662,"score_spread":0.2658138910876691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998220929","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.21685432,0.00046230198,0.7703086,0.0042219646,0.00003195359,0.0017279299,0.0000046142113,0.0001660689,0.006222219],"genre_scores_gemma":[0.97564775,0.000017301469,0.022570135,0.0015902258,0.00003055668,0.00012743707,0.0000021936655,0.000004740072,0.000009647506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986206,0.000059892,0.00024149015,0.0005618903,0.0001924003,0.00032372467],"domain_scores_gemma":[0.99904865,0.00016961775,0.00008640872,0.0004769561,0.00010095008,0.00011740788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050287443,0.0001885647,0.00037935041,0.00014124782,0.00006155675,0.000059706388,0.00054393854,0.000079407866,0.0000032333514],"category_scores_gemma":[0.000014079367,0.00014495432,0.00003858876,0.00074333174,0.00006628732,0.00009631972,0.00014800492,0.00013136612,0.000012052801],"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.00008375167,0.0006508806,0.0011469935,0.00007277575,0.00001746091,0.000016885777,0.00040862238,0.002266879,0.003929566,0.6870929,0.0001508784,0.3041624],"study_design_scores_gemma":[0.0010641314,0.0019828186,0.21899146,0.00006957286,0.000011942812,0.000033928452,0.00010916388,0.0009786283,0.012157824,0.76212966,0.0017943244,0.0006765691],"about_ca_topic_score_codex":0.000009835194,"about_ca_topic_score_gemma":0.000011502394,"teacher_disagreement_score":0.7587935,"about_ca_system_score_codex":0.000010919533,"about_ca_system_score_gemma":0.000030739942,"threshold_uncertainty_score":0.5911066},"labels":[],"label_agreement":null},{"id":"W1998261607","doi":"10.1016/j.apal.2004.06.004","title":"Dynamic topological logic","year":2004,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"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":"Topological space; Topological dynamics; Topology (electrical circuits); Mathematics; Topological vector space; Topological entropy in physics; Topological algebra; Topological quantum number; Context (archaeology); Category of topological spaces; Connected space; Zero-dimensional space; Topological manifold; Topological tensor product; Pure mathematics; Physics; Combinatorics","score_opus":0.03988905272719816,"score_gpt":0.29429667275519206,"score_spread":0.2544076200279939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998261607","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.44994602,0.006882268,0.29647198,0.015399673,0.00047707162,0.00073685055,0.000009419148,0.0006299989,0.22944671],"genre_scores_gemma":[0.9882945,0.0003423399,0.008872933,0.0022771494,0.00004146448,0.000014049026,0.0000032840617,0.000005320642,0.00014899693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875766,0.000024564517,0.00023604369,0.00043496152,0.00016971276,0.00037705738],"domain_scores_gemma":[0.99929446,0.000057319667,0.00011338252,0.0003456331,0.00006360328,0.00012558608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026625124,0.00019145139,0.00030935006,0.00007057281,0.00012187067,0.000058843543,0.0005855887,0.00016116878,0.000030325984],"category_scores_gemma":[0.000031775682,0.00013426047,0.00009080536,0.00025705242,0.00017678758,0.00011258543,0.0002694066,0.00016166465,0.00007070661],"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.000008495204,0.00012774707,0.00005544951,0.00001664885,0.000012925229,0.000015697877,0.00026356484,0.00008053468,0.0010982683,0.9892764,0.0002508639,0.008793385],"study_design_scores_gemma":[0.00043787734,0.00034104445,0.0036748154,0.0000124718445,0.0000071778077,0.000032817265,0.00009225133,0.00018776493,0.0034039742,0.99014187,0.0014119756,0.00025597968],"about_ca_topic_score_codex":0.000006111426,"about_ca_topic_score_gemma":0.000010949235,"teacher_disagreement_score":0.53834844,"about_ca_system_score_codex":0.000008593856,"about_ca_system_score_gemma":0.00003745865,"threshold_uncertainty_score":0.5474983},"labels":[],"label_agreement":null},{"id":"W2012102524","doi":"10.1016/j.apal.2008.09.013","title":"On lengths of proofs in non-classical logics","year":2008,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":50,"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":"Akademie Věd České Republiky","keywords":"Mathematical proof; Mathematics; Calculus (dental); Discrete mathematics; Algebra over a field; Pure mathematics; Geometry","score_opus":0.058427297583524274,"score_gpt":0.282818869212485,"score_spread":0.22439157162896073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012102524","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.76589817,0.0013792501,0.09467657,0.0027440775,0.00032774397,0.0014007218,0.000003699313,0.00015355462,0.1334162],"genre_scores_gemma":[0.9986053,0.000091441136,0.00076460565,0.00036907606,0.000035184257,0.000016564343,0.0000013389349,0.000004077012,0.00011242438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899226,0.000026813668,0.00027847182,0.0002724344,0.00020474281,0.00022527744],"domain_scores_gemma":[0.99941295,0.00007987925,0.00013951669,0.00026295747,0.000047739246,0.000056931927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027391774,0.00012301124,0.00030531653,0.00008831382,0.00004256563,0.000012581868,0.0003283655,0.00011284729,0.000004052175],"category_scores_gemma":[0.000021550297,0.000088303255,0.000052721673,0.00025036206,0.000120510136,0.0000614075,0.00009811854,0.0001269432,0.000011841097],"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.000021433716,0.00028006057,0.00066413055,0.000057391313,0.000010503769,0.000021791822,0.0006602566,0.0000484613,0.00063437695,0.9760092,0.0013458931,0.02024649],"study_design_scores_gemma":[0.0017162827,0.0023951167,0.024662402,0.00004091529,0.000009992124,0.000058336664,0.00022600456,0.0017954955,0.036507774,0.923324,0.008560605,0.000703063],"about_ca_topic_score_codex":0.000009206922,"about_ca_topic_score_gemma":0.0000067725005,"teacher_disagreement_score":0.23270711,"about_ca_system_score_codex":0.000003240372,"about_ca_system_score_gemma":0.000027199565,"threshold_uncertainty_score":0.36009023},"labels":[],"label_agreement":null},{"id":"W2017401893","doi":"10.1016/j.apal.2005.09.005","title":"External cofinalities and the antichain condition in partial orders","year":2005,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":"Government of Canada","funders":"","keywords":"Cofinality; Antichain; Mathematics; Uncountable set; Conjecture; Combinatorics; Partially ordered set; Counterexample; Discrete mathematics; Countable set","score_opus":0.06100663339937409,"score_gpt":0.3483265469893879,"score_spread":0.28731991359001385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017401893","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.9903824,0.00080402015,0.0026439605,0.00301036,0.000014358478,0.00016193805,0.000004871461,0.000012403661,0.0029657164],"genre_scores_gemma":[0.9976897,0.00024307867,0.0007509132,0.0011445141,0.00005175688,0.000014491395,0.0000016953614,0.0000039740235,0.00009986486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999498,0.000056705823,0.0001671726,0.00009777711,0.00005428527,0.00012605738],"domain_scores_gemma":[0.99949306,0.00032456123,0.00007507278,0.00007513251,0.000013248278,0.000018901304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004512476,0.00007516819,0.00018529044,0.000027646816,0.000057280075,0.000006283098,0.000047387348,0.000060160528,0.000043878485],"category_scores_gemma":[0.000049440343,0.000048789076,0.000020075584,0.000033354812,0.00045303587,0.000038747665,0.000024425573,0.00009681292,0.0000018179278],"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.00019631266,0.000030754447,0.00008394243,0.000024229339,0.00000976568,0.0000015610983,0.0008988035,0.000016037904,0.00023093316,0.9960408,0.00019303609,0.0022738182],"study_design_scores_gemma":[0.0008345703,0.000029100336,0.00028240195,0.000013919435,0.000010565072,0.000007583876,0.0010038016,0.000056482102,0.00311519,0.9941458,0.00043923335,0.000061316874],"about_ca_topic_score_codex":0.0000033035064,"about_ca_topic_score_gemma":0.00002219247,"teacher_disagreement_score":0.0073073404,"about_ca_system_score_codex":0.0000012236936,"about_ca_system_score_gemma":0.0000050011654,"threshold_uncertainty_score":0.19895607},"labels":[],"label_agreement":null},{"id":"W2020649391","doi":"10.1016/s0168-0072(00)00045-2","title":"Basis problem for turbulent actions I: Tsirelson submeasures","year":2001,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"York University","funders":"","keywords":"Mathematics; Basis (linear algebra); Calculus (dental); Geometry","score_opus":0.17462050639290305,"score_gpt":0.37335779319422996,"score_spread":0.1987372868013269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020649391","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.7749343,0.0026753936,0.08183041,0.01755213,0.0001702434,0.0026843797,0.000066386216,0.00034796746,0.11973878],"genre_scores_gemma":[0.9912468,0.00038908768,0.0067296573,0.00066735764,0.00007659618,0.000117171185,0.000006917883,0.00001330785,0.00075307814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934375,0.000019149042,0.00018561358,0.00016939938,0.00007151487,0.00021058458],"domain_scores_gemma":[0.9994134,0.00023105074,0.00010470822,0.00014419836,0.000058457827,0.000048184236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002688461,0.00011446844,0.00022243665,0.00004497874,0.000126028,0.0000059088024,0.00007787494,0.00011610768,0.000048282338],"category_scores_gemma":[0.0000504347,0.00009058549,0.00006883442,0.00007028544,0.0000942995,0.000038356426,0.000017829874,0.000088238696,0.000004355738],"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.00015755776,0.00016478049,0.000053906064,0.00009572617,0.000051206993,0.0000021634849,0.000191666,0.000026162495,0.0015846468,0.98144513,0.004620411,0.011606619],"study_design_scores_gemma":[0.00020658273,0.00006089191,0.00013488474,0.000012404955,0.00003204111,0.000016389475,0.00029438414,0.0000098621185,0.008918533,0.97712725,0.01307937,0.00010741535],"about_ca_topic_score_codex":9.1951296e-7,"about_ca_topic_score_gemma":0.000009488415,"teacher_disagreement_score":0.21631253,"about_ca_system_score_codex":0.000002968294,"about_ca_system_score_gemma":0.000009116667,"threshold_uncertainty_score":0.3693969},"labels":[],"label_agreement":null},{"id":"W2024042018","doi":"10.1016/j.apal.2004.05.002","title":"Softness of hypercoherences and MALL full completeness","year":2004,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Multiplicative function; Completeness (order theory); Gödel's completeness theorem; Discrete mathematics; Functor; Calculus (dental)","score_opus":0.0718893980317534,"score_gpt":0.27993936507657796,"score_spread":0.20804996704482456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024042018","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.8278141,0.0046287472,0.1557623,0.0016581003,0.00017929338,0.00051513576,0.000004442088,0.000105532185,0.00933236],"genre_scores_gemma":[0.99732095,0.00011925059,0.0022280167,0.0002638308,0.000033243083,0.000010745893,0.000001654399,0.000003426406,0.00001885581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999185,0.000017532766,0.00022066612,0.00024783093,0.00014648568,0.00018243438],"domain_scores_gemma":[0.99949545,0.000037254635,0.000139583,0.00019522668,0.00007122654,0.000061272774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024302908,0.00011519416,0.00028345353,0.000048491467,0.00005744086,0.000041158484,0.00029907006,0.000070925984,0.000003741107],"category_scores_gemma":[0.0000061958754,0.00008370479,0.000034136912,0.00014893487,0.00015250928,0.00011934871,0.00012895663,0.00005464879,0.0000033799517],"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.000010470387,0.00006901406,0.0005496145,0.00013260212,0.000018437935,0.0000036286601,0.000399661,0.000035472658,0.0034667042,0.971377,0.000036003694,0.023901349],"study_design_scores_gemma":[0.0009624351,0.00075652864,0.009554355,0.00002834872,0.000018887535,0.00006083639,0.00062397926,0.0001034752,0.01708054,0.9665913,0.0038055512,0.00041376599],"about_ca_topic_score_codex":0.000058024998,"about_ca_topic_score_gemma":0.000024200499,"teacher_disagreement_score":0.1695069,"about_ca_system_score_codex":0.0000014335235,"about_ca_system_score_gemma":0.000024291367,"threshold_uncertainty_score":0.34133825},"labels":[],"label_agreement":null},{"id":"W2027737305","doi":"10.1016/j.apal.2010.07.004","title":"A measure-theoretic proof of Turing incomparability","year":2010,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lemma (botany); Turing; Mathematics; Existential quantification; Description number; Discrete mathematics; Turing machine; Combinatorics; NSPACE; Set (abstract data type); Measure (data warehouse); Computer science; Universal Turing machine; Algorithm","score_opus":0.04048729888383151,"score_gpt":0.2811536320011267,"score_spread":0.24066633311729518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027737305","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.92299736,0.0002369881,0.06849564,0.0011603201,0.00015904615,0.00048724774,0.000004052302,0.000086610606,0.006372763],"genre_scores_gemma":[0.9815841,0.0000056329213,0.018164912,0.0001606325,0.000054372114,0.000018499593,8.677149e-7,0.0000057607294,0.000005265195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998404,0.00006052278,0.0004298495,0.00048702728,0.00033052583,0.00028806453],"domain_scores_gemma":[0.99851876,0.00019652309,0.0002112698,0.00075997395,0.00020161753,0.00011185895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012135145,0.00018698591,0.00043514892,0.00008672527,0.00006237739,0.000036856956,0.0007798163,0.00012079255,0.000019585665],"category_scores_gemma":[0.000095169155,0.00014824406,0.00009805701,0.00031971693,0.0003645839,0.00011445192,0.00044224883,0.00028130726,0.0000026901719],"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.00005292859,0.0007867811,0.0030865187,0.00036709852,0.00004686465,0.0000036452157,0.0012619703,0.0002936005,0.035793427,0.8193616,0.00015104968,0.13879447],"study_design_scores_gemma":[0.0003136972,0.00022265094,0.018063486,0.0000189641,0.000010597195,0.00001320346,0.00003839179,0.0038169136,0.157575,0.81949025,0.00017061712,0.0002662355],"about_ca_topic_score_codex":0.000009991586,"about_ca_topic_score_gemma":0.000017798717,"teacher_disagreement_score":0.13852823,"about_ca_system_score_codex":0.000003670849,"about_ca_system_score_gemma":0.000050825616,"threshold_uncertainty_score":0.60452175},"labels":[],"label_agreement":null},{"id":"W2033086528","doi":"10.1016/j.apal.2003.10.014","title":"What is the world of mathematics?","year":2003,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, programming, and type systems","field":"Computer Science","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":"McGill University","funders":"","keywords":"Topos theory; Intuitionism; Mathematics; Type theory; Type (biology); Category theory; Model theory; Set theory; Theory of computation; Algebra over a field; Pure mathematics; Discrete mathematics; Computer science; Algorithm; Set (abstract data type)","score_opus":0.05969010755121887,"score_gpt":0.29055124549203887,"score_spread":0.23086113794082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033086528","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.08652288,0.037618704,0.31956777,0.021816647,0.0018273472,0.0031660243,0.0000048108022,0.00033135168,0.52914447],"genre_scores_gemma":[0.99625725,0.00021248862,0.0017585773,0.0009905506,0.000019482362,0.000011373439,2.9063378e-7,0.0000034100244,0.0007465612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929154,0.000024955783,0.00021251068,0.0001586491,0.00015685159,0.00015551275],"domain_scores_gemma":[0.99932146,0.000083428,0.00016354563,0.0003462764,0.00005076542,0.000034505225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046908643,0.00008993113,0.00019309855,0.00004070007,0.000052722273,0.00008132576,0.00033171847,0.00003890037,0.000020594143],"category_scores_gemma":[0.000008738023,0.000051116844,0.00005587751,0.0002360991,0.00007882638,0.000116448704,0.000062368155,0.000057917718,0.000012913307],"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":[7.434334e-7,0.000052373263,0.00003955045,0.000048598704,0.000016223967,5.9454e-7,0.0011435983,0.0000019530623,0.00022059088,0.98881745,0.0016974083,0.007960923],"study_design_scores_gemma":[0.0001453214,0.000079615864,0.00010382671,0.000013162947,0.000009363473,0.000007672806,0.0012376879,0.00007461714,0.0379464,0.9194468,0.04080548,0.00013002878],"about_ca_topic_score_codex":0.0000033610254,"about_ca_topic_score_gemma":0.000007270352,"teacher_disagreement_score":0.90973437,"about_ca_system_score_codex":9.656295e-7,"about_ca_system_score_gemma":0.000012079378,"threshold_uncertainty_score":0.20844844},"labels":[],"label_agreement":null},{"id":"W2036651904","doi":"10.1016/s0168-0072(03)00056-3","title":"A second-order system for polytime reasoning based on Grädel's theorem","year":2003,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"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; Order (exchange); Bounded function; Polynomial; Reverse mathematics; Corollary; Second-order logic; Function (biology); Class (philosophy); French horn; Polynomial hierarchy; Discrete mathematics; Second-order arithmetic; Time complexity; Combinatorics; Algebra over a field; Pure mathematics; Computer science; Axiom; Description logic; Artificial intelligence","score_opus":0.03015922952910509,"score_gpt":0.26459985969411787,"score_spread":0.23444063016501276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036651904","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.02466185,0.0013975019,0.40443322,0.0007857677,0.00033133497,0.0010590134,0.000021734257,0.00032764123,0.566982],"genre_scores_gemma":[0.9871406,0.000008885666,0.011119508,0.0012592258,0.000058979622,0.000059040605,0.000004129067,0.0000126925615,0.0003369389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987236,0.000058018213,0.00023552979,0.00044383496,0.0001619472,0.00037704827],"domain_scores_gemma":[0.99897486,0.00022031661,0.0001603414,0.00040287385,0.00012576672,0.00011585299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006945374,0.00021054765,0.00033017568,0.00009401215,0.00016704403,0.000083376355,0.0003591754,0.00012519093,0.000030824984],"category_scores_gemma":[0.00007279895,0.00015753192,0.000101041114,0.00026008344,0.000059037084,0.00008210124,0.00004737105,0.00010510938,0.000018169763],"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.000029789308,0.00006953688,0.00003483322,0.000094196206,0.00001790482,0.0000027203191,0.00019247153,0.000086344546,0.00045929477,0.9939314,0.0014220157,0.0036594777],"study_design_scores_gemma":[0.009004458,0.0040609227,0.0018143889,0.0008386232,0.00014709606,0.00012713634,0.0019145302,0.09509612,0.25409415,0.52836406,0.101167366,0.0033711395],"about_ca_topic_score_codex":0.000001394889,"about_ca_topic_score_gemma":0.0000026612408,"teacher_disagreement_score":0.96247876,"about_ca_system_score_codex":0.000008522916,"about_ca_system_score_gemma":0.000067798035,"threshold_uncertainty_score":0.6423965},"labels":[],"label_agreement":null},{"id":"W2039375426","doi":"10.1016/j.apal.2005.09.010","title":"The number of translates of a closed nowhere dense set required to cover a Polish group","year":2005,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Separable space; Nowhere dense set; Cardinality (data modeling); Cover (algebra); Group (periodic table); Banach space; Locally compact space; Combinatorics; Compact space; Discrete mathematics; Space (punctuation); Locally compact group; Set (abstract data type); Pure mathematics; Computer science; Mathematical analysis","score_opus":0.06568592897368486,"score_gpt":0.3603924315277249,"score_spread":0.29470650255404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039375426","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.98507154,0.0005698457,0.0011218667,0.0017600184,0.000019796958,0.0003013718,0.00005767143,0.000018218392,0.01107967],"genre_scores_gemma":[0.9961307,0.00016366116,0.002765534,0.0005782465,0.000040571253,0.0000126795985,0.0000035751395,0.000011114808,0.00029392474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916923,0.00004487219,0.0003444488,0.00013771938,0.000107837106,0.00019590557],"domain_scores_gemma":[0.9990293,0.00046159353,0.00017785169,0.00022444114,0.00005957964,0.000047246594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035000808,0.000121131176,0.00033594613,0.000024900857,0.000058232356,0.0000036517788,0.00014610255,0.0001213445,0.0000898832],"category_scores_gemma":[0.00005935536,0.000081190854,0.00007927987,0.00009809676,0.0002340579,0.0000397513,0.000032039505,0.000089556546,0.000009149116],"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.00060168037,0.00015622102,0.00010815244,0.00012392768,0.000102001686,0.0000016085843,0.0024195816,0.000020433448,0.010280374,0.97549564,0.003916389,0.0067739785],"study_design_scores_gemma":[0.00049651216,0.00010379496,0.0001771176,0.000031818483,0.000039556613,0.000007383765,0.00078760594,0.000006967436,0.0283367,0.965083,0.0048133153,0.00011621509],"about_ca_topic_score_codex":0.0000029849673,"about_ca_topic_score_gemma":0.000028797833,"teacher_disagreement_score":0.018056326,"about_ca_system_score_codex":0.0000018873878,"about_ca_system_score_gemma":0.000010708938,"threshold_uncertainty_score":0.3310867},"labels":[],"label_agreement":null},{"id":"W2046193889","doi":"10.1016/j.apal.2008.06.002","title":"Parameter-free polymorphic types","year":2008,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto; Deutsche Forschungsgemeinschaft","keywords":"Variable (mathematics); Mathematics; Iterated function; Scope (computer science); Type (biology); Fragment (logic); Discrete mathematics; Calculus (dental); Computer science; Pure mathematics; Algebra over a field; Algorithm; Programming language","score_opus":0.06935606317556205,"score_gpt":0.2697775510396174,"score_spread":0.2004214878640554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046193889","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.4802872,0.018097254,0.30198914,0.009052474,0.0012911601,0.0014794557,0.000010090912,0.0009437495,0.18684947],"genre_scores_gemma":[0.996473,0.00017492144,0.0021602684,0.0008036976,0.00009553242,0.00001332743,0.0000017210418,0.000005178075,0.00027233528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909854,0.000023678127,0.00019087245,0.00027059665,0.0001729042,0.00024343272],"domain_scores_gemma":[0.9992471,0.00005855164,0.00010647947,0.00046260256,0.000045356235,0.00007994962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018721317,0.00012410092,0.00022721496,0.000059293616,0.000102609665,0.000034579785,0.0005416535,0.00008462359,0.000011831597],"category_scores_gemma":[0.000024157556,0.00009198036,0.00005717609,0.00019244288,0.00010747164,0.00009257921,0.00018536171,0.00008124452,0.000036117974],"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.000008680815,0.00007775964,0.000641803,0.000028951099,0.000029570743,0.000022755707,0.00046102089,0.0000058109076,0.0005557292,0.9716067,0.006683499,0.01987777],"study_design_scores_gemma":[0.0006523705,0.0005285177,0.005413712,0.0000065746876,0.000013854758,0.00015960794,0.00008488265,0.00025390912,0.014826196,0.9471596,0.030409692,0.0004910719],"about_ca_topic_score_codex":0.000021104966,"about_ca_topic_score_gemma":0.000004043688,"teacher_disagreement_score":0.5161858,"about_ca_system_score_codex":0.0000015895721,"about_ca_system_score_gemma":0.0000218965,"threshold_uncertainty_score":0.375085},"labels":[],"label_agreement":null},{"id":"W2055120840","doi":"10.1016/j.apal.2006.05.011","title":"Compact spaces, elementary submodels, and the countable chain condition","year":2006,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":4,"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; Institut d'Estudis Catalans; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Mathematics; Countable set; Second-countable space; Chain (unit); Discrete mathematics; Compact space; Pure mathematics; Space (punctuation); Locally compact space; Cosmic space; Topology (electrical circuits); Combinatorics; Computer science","score_opus":0.04715921338892022,"score_gpt":0.320140168865827,"score_spread":0.2729809554769068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055120840","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.9541903,0.002908552,0.004754997,0.0050033983,0.00003452309,0.0005389098,0.000061006333,0.00004740175,0.032460876],"genre_scores_gemma":[0.99785125,0.00024958816,0.00044288556,0.0010841099,0.000053671447,0.0000100742245,0.000031599553,0.0000068062063,0.00027001192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942034,0.00004533703,0.0001708825,0.00012569418,0.00007790954,0.00015980363],"domain_scores_gemma":[0.99945116,0.00027208636,0.00011644736,0.00011626482,0.000021329244,0.000022716311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045654862,0.000105317595,0.00023797364,0.00002490538,0.00012815419,0.000010865197,0.000058255366,0.00006391589,0.000058086953],"category_scores_gemma":[0.000009675537,0.00006696864,0.000027436148,0.000042218824,0.00037095233,0.000046790257,0.000023159899,0.00009728649,0.0000019873744],"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.00014012838,0.00004720483,0.000089396475,0.000036681504,0.000024408957,0.0000013330775,0.00012502613,0.000038349328,0.0003651569,0.99178773,0.0071090986,0.00023546041],"study_design_scores_gemma":[0.0007850439,0.000034211032,0.0002261508,0.0000081580265,0.00002711759,0.000008326013,0.000524197,0.00006725693,0.0023963575,0.9942572,0.0015850664,0.00008090138],"about_ca_topic_score_codex":0.00002942456,"about_ca_topic_score_gemma":0.000038725433,"teacher_disagreement_score":0.043660916,"about_ca_system_score_codex":0.0000023777395,"about_ca_system_score_gemma":0.0000057515895,"threshold_uncertainty_score":0.2730902},"labels":[],"label_agreement":null},{"id":"W2055767407","doi":"10.1016/j.apal.2011.01.011","title":"The complexity of central series in nilpotent computable groups","year":2011,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","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 Waterloo","funders":"","keywords":"Mathematics; Computable number; Nilpotent; Central series; Turing; Nilpotent group; Series (stratigraphy); Turing machine; Degree (music); Discrete mathematics; Computable function; Algebra over a field; Pure mathematics; Computable analysis; Computer science; Algorithm; Computation","score_opus":0.11724217098113329,"score_gpt":0.2690373915610357,"score_spread":0.15179522057990238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055767407","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.84904355,0.0021538283,0.12538366,0.005093072,0.0004810697,0.0011286056,0.000019544992,0.00016697729,0.016529664],"genre_scores_gemma":[0.983899,0.0001188725,0.015720194,0.00020935756,0.000025558187,0.00000899172,0.0000014716516,0.0000042725173,0.0000123124155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859434,0.00007025049,0.00040401472,0.00032068603,0.0002132882,0.0003974302],"domain_scores_gemma":[0.9991322,0.000093378876,0.00017436118,0.00043759705,0.00008486667,0.000077576165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005487843,0.00015556919,0.00033387326,0.000053572174,0.00010119073,0.000036092726,0.00074492407,0.00006444275,0.000009895264],"category_scores_gemma":[0.000014963894,0.00010714402,0.000067624416,0.00030993947,0.00059218134,0.00014171388,0.00050677464,0.00013682242,0.0000021431617],"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.000048242196,0.00028438843,0.0019423681,0.000048572703,0.000019942283,0.0000045831102,0.0016063963,0.00022376746,0.00026843292,0.97304183,0.00022773587,0.022283716],"study_design_scores_gemma":[0.00026961532,0.00026267613,0.12831923,0.000013283219,0.0000040293826,0.000010616906,0.00027258936,0.004269319,0.0069654095,0.8590758,0.00035994253,0.0001774985],"about_ca_topic_score_codex":0.00008456047,"about_ca_topic_score_gemma":0.00008734502,"teacher_disagreement_score":0.13485539,"about_ca_system_score_codex":0.0000067072547,"about_ca_system_score_gemma":0.00002996215,"threshold_uncertainty_score":0.43692064},"labels":[],"label_agreement":null},{"id":"W2056361918","doi":"10.1016/j.apal.2005.04.001","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>κ</mml:mi></mml:math>-bounded exponential-logarithmic power series fields","year":2005,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":20,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Exponentiation; Mathematics; Exponential function; Series (stratigraphy); Power series; Cardinality (data modeling); Discrete mathematics; Bounded function; Discrete logarithm; Combinatorics; Mathematical analysis; Computer science; Database","score_opus":0.030170104414146286,"score_gpt":0.2832738904449643,"score_spread":0.253103786030818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056361918","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.98738796,0.0004898786,0.0017822131,0.001189264,0.00021582552,0.00008743567,0.00004397842,0.00010215289,0.008701283],"genre_scores_gemma":[0.9922345,0.0004215565,0.004547267,0.001861939,0.00031766298,0.00009379161,0.000060274073,0.000054334927,0.000408647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981981,0.000050081482,0.0005108936,0.00043168772,0.00029620354,0.00051304384],"domain_scores_gemma":[0.9985831,0.0003394534,0.00036875578,0.00052808685,0.000048798087,0.00013183303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047656303,0.0003011381,0.000318959,0.000073890325,0.00035739315,0.00006754318,0.00031767017,0.0005872598,0.00019279351],"category_scores_gemma":[0.00015020992,0.00030731983,0.00023784446,0.0001187191,0.00046406768,0.00026602874,0.00024896892,0.00042479113,0.00019262942],"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.00040608292,0.00019430536,0.0000028855584,0.00015526607,0.0001732466,0.000049438633,0.0008727508,0.00010791807,0.0016442422,0.9938036,0.0016745882,0.0009156545],"study_design_scores_gemma":[0.0018571834,0.0011040899,0.000082003105,0.00022975256,0.00036238332,0.00036315495,0.0028112007,0.028882772,0.06873435,0.87670606,0.017816396,0.0010506598],"about_ca_topic_score_codex":0.000011042657,"about_ca_topic_score_gemma":0.0000755741,"teacher_disagreement_score":0.117097564,"about_ca_system_score_codex":0.0000038123683,"about_ca_system_score_gemma":0.000069321555,"threshold_uncertainty_score":0.9999379},"labels":[],"label_agreement":null},{"id":"W2057338786","doi":"10.1016/j.apal.2014.02.001","title":"Definability and decidability in infinite algebraic extensions","year":2014,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Mount Royal University","funders":"","keywords":"Countable set; Mathematics; Decidability; Undecidable problem; Generalization; Algebraic number; Degree (music); Algebraically closed field; Field (mathematics); Discrete mathematics; Pure mathematics; Order (exchange); Field extension; Mathematical analysis","score_opus":0.07480024261852344,"score_gpt":0.34466703355569445,"score_spread":0.26986679093717103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057338786","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.99221385,0.00021139086,0.001409669,0.0008590015,0.000013831849,0.00018778029,0.0000035153362,0.000022063374,0.005078886],"genre_scores_gemma":[0.9960211,0.00007639417,0.0028602963,0.00098158,0.000014210543,0.00001740141,0.0000017643613,0.0000058200517,0.000021443975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917835,0.00008998686,0.0002566633,0.00023535013,0.000058969497,0.00018065797],"domain_scores_gemma":[0.99855816,0.0010240296,0.00008202369,0.00024254582,0.000037110007,0.000056143803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008661819,0.000113804,0.0003120805,0.00004903448,0.00006118532,0.000004180256,0.000064418746,0.00013038934,0.000026268694],"category_scores_gemma":[0.0006660867,0.00009086532,0.000029927485,0.000088772045,0.00033411942,0.000037414735,0.000075792756,0.00015102513,0.0000024406106],"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.000060139286,0.00010941791,0.0032533652,0.000078115634,0.000006302282,8.162232e-7,0.00027296614,0.000004625629,0.00037689638,0.98709464,0.00011344171,0.008629267],"study_design_scores_gemma":[0.00023654616,0.00006575214,0.029697148,0.000010342599,0.000007845855,0.0000034554384,0.00016741341,0.000014780742,0.00081370986,0.9685402,0.0003507974,0.00009200915],"about_ca_topic_score_codex":0.0000028472764,"about_ca_topic_score_gemma":0.000040850606,"teacher_disagreement_score":0.026443783,"about_ca_system_score_codex":0.0000023218909,"about_ca_system_score_gemma":0.000008815748,"threshold_uncertainty_score":0.37053803},"labels":[],"label_agreement":null},{"id":"W2058518827","doi":"10.1016/j.apal.2012.05.011","title":"On two topological cardinal invariants of an order-theoretic flavour","year":2012,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":"York University","funders":"","keywords":"Mathematics; Pure mathematics; Type (biology); Noetherian; Disjoint sets; Conjecture; Discrete mathematics; Topology (electrical circuits); Combinatorics; Algebra over a field","score_opus":0.09403055107687434,"score_gpt":0.3757559766640241,"score_spread":0.28172542558714975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058518827","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.9693329,0.00021595115,0.0033376524,0.00022757844,0.000059188063,0.00016909752,0.00001234908,0.00002799458,0.026617311],"genre_scores_gemma":[0.9942573,0.000044624478,0.0049359095,0.00059336436,0.00008239844,0.000010150494,0.000005222104,0.000010444506,0.000060598362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906445,0.00010716906,0.0002523407,0.00016729964,0.00011762616,0.0002911472],"domain_scores_gemma":[0.99906224,0.00039466275,0.00015180644,0.00024170526,0.000048559945,0.00010101629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006129005,0.0001499354,0.00038938303,0.00005247514,0.00006540781,0.0000031124212,0.0001338398,0.00015005036,0.00022452074],"category_scores_gemma":[0.00018411188,0.00010838377,0.000053858643,0.00008776385,0.00036004963,0.000060744336,0.000053969114,0.00016848609,0.000009664059],"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.00020824661,0.00029528362,0.000111952344,0.000042947475,0.000032393775,0.0000027570493,0.0003747995,0.000011101299,0.0014598191,0.99565697,0.00011928735,0.00168443],"study_design_scores_gemma":[0.00035366404,0.00033680073,0.00035482843,0.000011940968,0.00003014933,0.000013794254,0.00054443645,0.0000075719354,0.012964227,0.98520744,0.00005383405,0.00012133684],"about_ca_topic_score_codex":0.0000015455265,"about_ca_topic_score_gemma":0.0000012637558,"teacher_disagreement_score":0.026556714,"about_ca_system_score_codex":0.0000022939969,"about_ca_system_score_gemma":0.0000101744945,"threshold_uncertainty_score":0.4419762},"labels":[],"label_agreement":null},{"id":"W2061059115","doi":"10.1016/j.apal.2006.05.010","title":"Partition relations on a plain product order type","year":2006,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Carnegie Mellon University","keywords":"Mathematics; Partition (number theory); Order type; Type (biology); Product type; Order (exchange); Combinatorics; Discrete mathematics; Computer science","score_opus":0.10853291480095255,"score_gpt":0.3278589232304541,"score_spread":0.21932600842950156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061059115","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.86138415,0.00015044321,0.0012929675,0.0075188144,0.00007373789,0.0006606951,0.00004082041,0.00009833173,0.12878002],"genre_scores_gemma":[0.9966831,0.0000071324066,0.002090867,0.00018341553,0.000085375155,0.000025166191,0.00005255762,0.0000071984614,0.0008651712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.000021119356,0.00020488154,0.00016436467,0.00014330693,0.000102006874],"domain_scores_gemma":[0.9993538,0.00023906761,0.00008412408,0.00016230535,0.00014096039,0.00001973844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023712045,0.00007775939,0.0001205011,0.000048959584,0.00007517494,0.000009472425,0.000034936482,0.00004834473,0.00009832465],"category_scores_gemma":[0.0003063265,0.00006391111,0.000023183731,0.00022250474,0.000047109355,0.000034344055,0.000012011883,0.00007338334,0.000049815833],"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.000079768375,0.00025469714,0.000112507216,0.00003364944,0.000011732968,2.8386305e-7,0.000058490234,0.0006210301,0.0012451402,0.9765357,0.020564845,0.00048219736],"study_design_scores_gemma":[0.00020313809,0.000115442104,0.0027950637,0.000013435651,0.000015386157,0.0000012428893,0.000047000172,0.000064546,0.003833287,0.9887155,0.0041035963,0.000092327246],"about_ca_topic_score_codex":0.000007640078,"about_ca_topic_score_gemma":0.00003159686,"teacher_disagreement_score":0.13529894,"about_ca_system_score_codex":0.000005367573,"about_ca_system_score_gemma":0.000021334732,"threshold_uncertainty_score":0.26062194},"labels":[],"label_agreement":null},{"id":"W2063349669","doi":"10.1016/j.apal.2012.02.004","title":"Forcing by non-scattered sets","year":2012,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":19,"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":"Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Forcing (mathematics); Mathematics; Extension (predicate logic); Set (abstract data type); Order (exchange); Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.08136030827582773,"score_gpt":0.3570536708259919,"score_spread":0.27569336255016413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063349669","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.9559171,0.0010965213,0.008791693,0.0009037076,0.00007487945,0.00023207087,0.000019675448,0.000046435387,0.032917906],"genre_scores_gemma":[0.9962833,0.000066393965,0.002027164,0.0012531661,0.000054881424,0.00001269888,0.000008440772,0.000010470926,0.00028346956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993917,0.000016821941,0.00016040893,0.00010876042,0.000060194165,0.00026215796],"domain_scores_gemma":[0.9995189,0.00015704402,0.00009750417,0.0001438888,0.000016211088,0.00006648951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027211147,0.00010733787,0.0002171085,0.000025359017,0.000066752815,0.000003418367,0.00007544404,0.00010671686,0.00007504768],"category_scores_gemma":[0.000022153119,0.00008533693,0.000036424244,0.000042791897,0.000088890694,0.00006490751,0.000041583717,0.00009819232,0.000015568563],"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.00007190893,0.00020938633,0.00057422527,0.00014951467,0.00006750124,8.552097e-7,0.0014479358,0.000001956903,0.016934166,0.9290698,0.0426633,0.0088094175],"study_design_scores_gemma":[0.00023448067,0.000041537198,0.0002925313,0.00001217622,0.00002021988,0.000004724314,0.0004942004,0.0000028360475,0.056380417,0.94021416,0.0021605827,0.00014213641],"about_ca_topic_score_codex":5.787365e-7,"about_ca_topic_score_gemma":6.5146236e-7,"teacher_disagreement_score":0.040502716,"about_ca_system_score_codex":0.0000015185235,"about_ca_system_score_gemma":0.0000032082564,"threshold_uncertainty_score":0.34799388},"labels":[],"label_agreement":null},{"id":"W2068303546","doi":"10.1016/j.apal.2009.01.015","title":"Dynamic topological S5","year":2009,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","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":"University of Toronto","funders":"","keywords":"Topological space; Mathematics; Topological tensor product; Modal logic; Topological vector space; Normal modal logic; Function space; Topology (electrical circuits); Compact-open topology; Category of topological spaces; Class (philosophy); Homeomorphism (graph theory); Discrete space; Pure mathematics; Modal; Discrete mathematics; Computer science; Mathematical analysis; Combinatorics; Functional analysis; Artificial intelligence","score_opus":0.03521211998771567,"score_gpt":0.2953889388376347,"score_spread":0.260176818849919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068303546","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.44675955,0.0060712136,0.10821673,0.016455004,0.0002944372,0.00052958704,0.000005228388,0.0005009399,0.4211673],"genre_scores_gemma":[0.99278575,0.00024410964,0.0039440743,0.0027345463,0.000036420977,0.00000402809,0.0000020067919,0.0000023942102,0.00024665712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907815,0.00002157306,0.00017561982,0.00031712165,0.00012698224,0.0002805487],"domain_scores_gemma":[0.99946296,0.000046745146,0.00007980697,0.00027072575,0.000045081113,0.000094705065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021169888,0.00013705583,0.00023701564,0.00005123682,0.00008505145,0.000047710768,0.00044608046,0.00011260668,0.000024506977],"category_scores_gemma":[0.000019782938,0.000096453216,0.00006490452,0.00018578675,0.00007844726,0.00008779622,0.00010788978,0.00011489484,0.000032002146],"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.000008278234,0.00010235739,0.00005279047,0.0000065938325,0.000006927524,0.000008160215,0.00022512839,0.000007737825,0.0014439635,0.93419594,0.0013998399,0.062542275],"study_design_scores_gemma":[0.0003297693,0.00060499244,0.018521488,0.000011158068,0.0000076002884,0.00002575082,0.00008084496,0.0011969762,0.0038618466,0.97047216,0.0045793797,0.00030800753],"about_ca_topic_score_codex":0.0000012956015,"about_ca_topic_score_gemma":0.0000023782852,"teacher_disagreement_score":0.54602623,"about_ca_system_score_codex":0.000003039246,"about_ca_system_score_gemma":0.00001565978,"threshold_uncertainty_score":0.3933248},"labels":[],"label_agreement":null},{"id":"W2070821880","doi":"10.1016/j.apal.2011.08.002","title":"Cofinal types of ultrafilters","year":2011,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","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 Toronto","funders":"","keywords":"Ultrafilter; Mathematics; Class (philosophy); Equivalence (formal languages); Tukey's range test; Counterexample; Combinatorics; Pure mathematics; Statistics; Computer science; Artificial intelligence","score_opus":0.15967259452523724,"score_gpt":0.3416737533701869,"score_spread":0.18200115884494966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070821880","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.8762546,0.00042885906,0.0027080236,0.00013364917,0.000039039875,0.00014229218,0.000012837362,0.000029918283,0.12025074],"genre_scores_gemma":[0.99497414,0.00008176424,0.00456086,0.00021903038,0.000014041915,0.0000035881185,0.0000013928171,0.000005041726,0.00014015916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995878,0.000015157791,0.00015477337,0.00009031649,0.000046240813,0.000105759354],"domain_scores_gemma":[0.99962556,0.00010220109,0.00010461734,0.00011378903,0.000027766919,0.000026089498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015258665,0.000070734925,0.00019781753,0.000029606894,0.000022859378,7.205758e-7,0.00007615889,0.00006990488,0.00015928653],"category_scores_gemma":[0.00003014165,0.000054218144,0.00003383121,0.000040170347,0.00019892694,0.000020525566,0.000019444315,0.000061012324,0.000004676887],"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.00013445909,0.00007739446,0.00008830267,0.000059085352,0.000032026965,0.0000016107251,0.00075252156,9.976047e-7,0.0023606769,0.9943487,0.00044954658,0.0016946803],"study_design_scores_gemma":[0.000118745214,0.00012309368,0.00038250865,0.000008636462,0.000016817321,0.000003334734,0.00036261647,7.5280224e-7,0.07409975,0.9246764,0.00014966533,0.00005764042],"about_ca_topic_score_codex":0.0000010469745,"about_ca_topic_score_gemma":0.000001738335,"teacher_disagreement_score":0.12011058,"about_ca_system_score_codex":4.8197234e-7,"about_ca_system_score_gemma":0.0000054748357,"threshold_uncertainty_score":0.22109517},"labels":[],"label_agreement":null},{"id":"W2079131539","doi":"10.1016/j.apal.2009.10.004","title":"On lovely pairs of geometric structures","year":2009,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Facultad de Ciencias, Universidad de los Andes; Natural Sciences and Engineering Research Council of Canada; Université Claude Bernard Lyon 1; Agence Nationale de la Recherche; Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Trichotomy (philosophy); Mathematics; Class (philosophy); Rank (graph theory); Type (biology); Modular design; Combinatorics; Point (geometry); Pure mathematics; Discrete mathematics; Geometry; Computer science","score_opus":0.07450086488067305,"score_gpt":0.34453369537014317,"score_spread":0.27003283048947013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079131539","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.96108675,0.0006463859,0.0029918428,0.000587206,0.000029298484,0.00017777503,0.000014534673,0.00003112415,0.034435086],"genre_scores_gemma":[0.99705774,0.0000862956,0.0017731813,0.000948795,0.000023134937,0.0000014023335,0.0000023309208,0.0000047816347,0.00010235151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994126,0.000018544453,0.00019752698,0.00013164754,0.00009682305,0.00014288773],"domain_scores_gemma":[0.9993251,0.0003041971,0.00014859713,0.00015617309,0.000032009197,0.000033952118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017827487,0.00010490973,0.00027480928,0.00012261617,0.000032030235,0.0000021193912,0.00009413752,0.00010919331,0.00008066984],"category_scores_gemma":[0.00012445671,0.000077167875,0.000048669855,0.00016634377,0.00010260833,0.000019480827,0.000015195667,0.00010545564,0.0000027194105],"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.00010140755,0.00008761427,0.000011336875,0.000034039364,0.000018879386,0.0000016555563,0.000101510384,0.000033658762,0.0010856626,0.9844493,0.0015909434,0.012483948],"study_design_scores_gemma":[0.00018520301,0.00029501406,0.00143697,0.000008197011,0.000011579489,0.0000021976389,0.00012000403,0.0000012465857,0.025620257,0.972133,0.000111107845,0.00007522979],"about_ca_topic_score_codex":3.109268e-7,"about_ca_topic_score_gemma":4.020408e-7,"teacher_disagreement_score":0.03597098,"about_ca_system_score_codex":0.000001266667,"about_ca_system_score_gemma":0.0000058010814,"threshold_uncertainty_score":0.31468147},"labels":[],"label_agreement":null},{"id":"W2094301123","doi":"10.1016/j.apal.2005.05.018","title":"A globalisation of the Gelfand duality theorem","year":2005,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":60,"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":"Topos theory; Mathematics; Commutative property; Dual (grammatical number); Duality (order theory); Equivalence (formal languages); Pure mathematics; Constructive; Algebra over a field; Discrete mathematics; Linguistics","score_opus":0.07318049852209535,"score_gpt":0.34008615990439217,"score_spread":0.2669056613822968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094301123","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.9642168,0.00018057063,0.0001824534,0.0049640094,0.000031797754,0.00016907993,0.000010279083,0.000011678622,0.030233312],"genre_scores_gemma":[0.99820656,0.00003779826,0.00056280126,0.0010229168,0.00005559361,0.000007777304,0.0000010645103,0.0000038090782,0.00010166823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993359,0.00007354099,0.00024785844,0.00011760031,0.00009809911,0.00012700126],"domain_scores_gemma":[0.9993646,0.00016189487,0.00018435463,0.00022651406,0.00003975208,0.000022892193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004549701,0.00008327502,0.0002153317,0.000017236776,0.000052401356,0.0000030960484,0.0001431807,0.00012195627,0.0001041036],"category_scores_gemma":[0.00008101198,0.000051377232,0.00005874024,0.00007802014,0.00030419056,0.00001611585,0.00006063689,0.000083414845,0.0000028299387],"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.000026095246,0.000081505765,0.0003737723,0.000034463897,0.000029393117,2.2699415e-7,0.00053058274,0.0000021824642,0.0013613008,0.9920946,0.001072668,0.0043932465],"study_design_scores_gemma":[0.00018156934,0.000039519444,0.0030554247,0.0000073686497,0.000023885466,0.000007952206,0.00020706594,0.00000422173,0.029056104,0.96622545,0.0011348028,0.000056616725],"about_ca_topic_score_codex":0.000003843537,"about_ca_topic_score_gemma":0.000022218646,"teacher_disagreement_score":0.033989754,"about_ca_system_score_codex":0.000002318559,"about_ca_system_score_gemma":0.000014564541,"threshold_uncertainty_score":0.20951028},"labels":[],"label_agreement":null},{"id":"W2096221521","doi":"10.1016/j.apal.2013.05.002","title":"Combinatorial realizability models of type theory","year":2013,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":10,"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 Ottawa","funders":"","keywords":"Realizability; Type theory; Mathematics; Type (biology); Functor; Homotopy; Model theory; Algebra over a field; Graph; Pure mathematics; Discrete mathematics; Algorithm","score_opus":0.07758309245407317,"score_gpt":0.32676280957495696,"score_spread":0.24917971712088377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096221521","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.9490385,0.00017838471,0.0005055143,0.00045046295,0.00011733357,0.00029101924,0.0000051581515,0.000026298716,0.049387313],"genre_scores_gemma":[0.9990775,0.00006161604,0.00046653725,0.0002599743,0.000038742142,0.00001957506,0.000002998202,0.0000070921933,0.00006595405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992059,0.00009232008,0.00029131942,0.00015902694,0.000087042135,0.0001643947],"domain_scores_gemma":[0.99905634,0.0003747387,0.00014692415,0.00026014535,0.00011724859,0.000044590663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048963184,0.000103937695,0.00035022467,0.00003282206,0.000032605632,0.0000034094128,0.0001393914,0.00019124986,0.00032808995],"category_scores_gemma":[0.00010763549,0.00007999355,0.000047217047,0.000079463534,0.0003267758,0.0000382949,0.00006510707,0.0001048903,0.000008462198],"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.000056058427,0.0001536362,0.000084141495,0.00007708366,0.000040822026,5.0993305e-7,0.0003180728,0.0000025285765,0.0008401296,0.99570876,0.0012749826,0.0014432742],"study_design_scores_gemma":[0.0002154741,0.00017580413,0.00024235145,0.0000057749767,0.000018795321,0.000002699023,0.000190066,0.000018098794,0.005968331,0.99303496,0.000053559776,0.00007410648],"about_ca_topic_score_codex":0.000016044389,"about_ca_topic_score_gemma":0.0000016406063,"teacher_disagreement_score":0.050038997,"about_ca_system_score_codex":0.0000015931905,"about_ca_system_score_gemma":0.000019845644,"threshold_uncertainty_score":0.3592355},"labels":[],"label_agreement":null},{"id":"W2098385002","doi":"10.1016/j.apal.2013.05.001","title":"Martin-Löf complexes","year":2013,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","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 Ottawa","funders":"","keywords":"Mathematics; Model category; Homotopy; Homotopy category; Pure mathematics; Derived category; Algebra over a field; Type (biology); Closed category; Category theory; Functor","score_opus":0.08336237303201456,"score_gpt":0.3310391692860479,"score_spread":0.24767679625403333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098385002","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.9487253,0.00021137783,0.00024306342,0.0040795505,0.00004224261,0.00025703624,0.00000327226,0.000051516217,0.046386637],"genre_scores_gemma":[0.9959149,0.000042718933,0.0015222211,0.001821276,0.0000572702,0.00004661712,0.0000032936075,0.0000086538,0.00058310234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999237,0.000034226523,0.00024369513,0.00016991243,0.00007659719,0.00023857343],"domain_scores_gemma":[0.99940515,0.0001835349,0.000110215144,0.00019431462,0.00004554163,0.00006126166],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001720321,0.000119203876,0.00029347127,0.000040784915,0.000063203865,0.000010397446,0.00013310889,0.00013418723,0.0011590137],"category_scores_gemma":[0.000045479,0.00009233774,0.00004620722,0.000063130276,0.00023480447,0.00003319861,0.000069468435,0.00011322037,0.00011349798],"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.000010164674,0.00008532072,0.00034199076,0.000047789395,0.000037246904,0.0000023476969,0.00022324653,2.636369e-7,0.003285194,0.96570617,0.025723683,0.0045365924],"study_design_scores_gemma":[0.00015927339,0.000093063696,0.0018201726,0.0000056436684,0.000012622374,0.000014209329,0.00024678474,0.000005133651,0.0085628005,0.98741436,0.001560102,0.00010583917],"about_ca_topic_score_codex":0.000009965406,"about_ca_topic_score_gemma":0.0000070967326,"teacher_disagreement_score":0.04718954,"about_ca_system_score_codex":0.0000011001031,"about_ca_system_score_gemma":0.00000821018,"threshold_uncertainty_score":0.9997541},"labels":[],"label_agreement":null},{"id":"W2101249878","doi":"10.1016/j.apal.2006.04.001","title":"Frege systems for extensible modal logics","year":2006,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"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":"Propositional calculus; Propositional variable; Equivalence (formal languages); Intuitionistic logic; Well-formed formula; Mathematics; Modal; Modal logic; Calculus (dental); Mathematical proof; Propositional formula; Discrete mathematics; Intermediate logic; Zeroth-order logic; Logical equivalence; Algebra over a field; Computer science; Pure mathematics; Programming language; Multimodal logic; Description logic","score_opus":0.04791883066781888,"score_gpt":0.2739468383898415,"score_spread":0.22602800772202264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101249878","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.083523825,0.021573333,0.7251241,0.001859769,0.0007188805,0.0015014763,0.000040595027,0.00041314628,0.16524486],"genre_scores_gemma":[0.9945988,0.00015153964,0.003852997,0.0003876033,0.0002377309,0.00004972854,0.000008916211,0.000007881765,0.0007047998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887925,0.000018316641,0.00025227675,0.00036431942,0.00014413054,0.00034171238],"domain_scores_gemma":[0.9992332,0.00010131458,0.00014460045,0.00030554985,0.00014728509,0.00006806357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225872,0.00016563507,0.00030888533,0.00006466902,0.00012254402,0.00009694496,0.00038510328,0.00012687134,0.0000029819112],"category_scores_gemma":[0.000015471089,0.00012405908,0.00008272191,0.00017381298,0.00006848651,0.00010672097,0.00011801921,0.00007224579,0.000011957642],"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.000009534488,0.00008235754,0.000092059,0.00006740776,0.000011040485,0.000002891219,0.0000683336,0.0003297402,0.0010170138,0.97987455,0.015997145,0.0024479253],"study_design_scores_gemma":[0.0010017757,0.0005239816,0.0026718543,0.000043266293,0.000026976246,0.000035857676,0.00015996516,0.015967986,0.011473443,0.924083,0.04337981,0.0006320842],"about_ca_topic_score_codex":0.000025899337,"about_ca_topic_score_gemma":0.0000073301358,"teacher_disagreement_score":0.911075,"about_ca_system_score_codex":0.000003888294,"about_ca_system_score_gemma":0.00002672383,"threshold_uncertainty_score":0.50589824},"labels":[],"label_agreement":null},{"id":"W2111056284","doi":"10.1016/j.apal.2013.11.006","title":"Omitting types for infinitary<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">]</mml:mo></mml:math>-valued logic","year":2013,"lang":"lv","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":15,"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":"Finitary; Countable set; Mathematics; Separable space; Discrete mathematics; Quotient; Pure mathematics; Mathematical analysis","score_opus":0.036438759986693055,"score_gpt":0.2794287398301802,"score_spread":0.24298997984348714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111056284","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.9751652,0.005331391,0.002454947,0.0017319137,0.0014828532,0.00063492055,0.0013295746,0.0006034591,0.011265752],"genre_scores_gemma":[0.97680503,0.0028184417,0.009683186,0.004296441,0.0022961341,0.0016614124,0.0012261955,0.00077503565,0.00043812054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9872757,0.00063096505,0.0034526342,0.0029122483,0.002074553,0.0036538811],"domain_scores_gemma":[0.98843485,0.0037839802,0.0036711683,0.0022991847,0.0005368345,0.0012739946],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0035765488,0.002047721,0.0016317946,0.00065512554,0.0024044577,0.0009403226,0.0025306155,0.004042462,0.0020606173],"category_scores_gemma":[0.0022916556,0.0026427594,0.0021867435,0.0010981945,0.002590865,0.0014139174,0.002020373,0.0027682101,0.0023556608],"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.0020081108,0.0010378028,0.000019189665,0.002252313,0.002482534,0.00033817985,0.0030670285,0.0013258228,0.0033027704,0.9505645,0.026476795,0.0071249614],"study_design_scores_gemma":[0.006042073,0.0049341535,0.000078937745,0.0021298858,0.003718668,0.0010033497,0.011900544,0.09234294,0.21574697,0.64616466,0.011292205,0.004645641],"about_ca_topic_score_codex":0.00045431431,"about_ca_topic_score_gemma":0.00035469155,"teacher_disagreement_score":0.30439985,"about_ca_system_score_codex":0.000042639705,"about_ca_system_score_gemma":0.00083573064,"threshold_uncertainty_score":0.99953246},"labels":[],"label_agreement":null},{"id":"W2137120340","doi":"10.1016/j.apal.2005.03.005","title":"Products of sequential CLP-compact spaces are CLP-compact","year":2006,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"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; Compact space; Relatively compact subspace; Compact disc; Computer science; Pure mathematics; Physics","score_opus":0.0884580073405187,"score_gpt":0.3463021221392212,"score_spread":0.2578441147987025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137120340","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.97078866,0.0010934547,0.00041441707,0.0018528437,0.000071193244,0.00032889278,0.00004270356,0.000058621765,0.025349203],"genre_scores_gemma":[0.99817836,0.00006628304,0.0007861663,0.00017122812,0.00017927162,0.0000030457663,0.000013901825,0.000016048712,0.000585703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889565,0.000055730627,0.00035808817,0.0002563419,0.00015173729,0.0002824548],"domain_scores_gemma":[0.99900013,0.00017547062,0.00040386958,0.00028393103,0.00008867978,0.000047900576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003367482,0.00020177716,0.00053310674,0.00008099738,0.00007621421,0.000009308735,0.00014771643,0.00014715602,0.000073878036],"category_scores_gemma":[0.000068487774,0.00015689747,0.000083632054,0.00013837311,0.00031672916,0.00006757078,0.000029366218,0.00016264577,0.000007122997],"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.00023926854,0.00037347546,0.00080682733,0.00037004976,0.000088229586,0.000010179577,0.0002795159,0.00015942103,0.025088774,0.95920706,0.012947099,0.00043007798],"study_design_scores_gemma":[0.00034619664,0.0001015252,0.0022665474,0.000037345388,0.000042701366,0.000010130576,0.00042045684,0.0000040536966,0.15383917,0.84107447,0.0016832558,0.00017412966],"about_ca_topic_score_codex":0.000013989543,"about_ca_topic_score_gemma":0.000014462939,"teacher_disagreement_score":0.1287504,"about_ca_system_score_codex":0.0000037742802,"about_ca_system_score_gemma":0.000021669315,"threshold_uncertainty_score":0.6398093},"labels":[],"label_agreement":null},{"id":"W2147758190","doi":"10.1016/j.apal.2006.09.001","title":"A categorical semantics for polarized<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"sans-serif\"><mml:mi>MALL</mml:mi></mml:mstyle></mml:math>","year":2006,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, programming, and type systems","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 Ottawa","funders":"","keywords":"Linear logic; Multiplicative function; Mathematics; Completeness (order theory); Discrete mathematics; Mathematical analysis","score_opus":0.025729949732435014,"score_gpt":0.2535003448029045,"score_spread":0.2277703950704695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147758190","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.8680885,0.0013322706,0.114932515,0.0018089861,0.0008315092,0.00027403547,0.000064513406,0.0003072433,0.012360424],"genre_scores_gemma":[0.99160653,0.00019075841,0.0057460195,0.0011833793,0.0006691755,0.00022926487,0.00013768778,0.000070329486,0.00016686034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968776,0.000059359823,0.0007192104,0.0007982061,0.0006186753,0.0009269402],"domain_scores_gemma":[0.9979944,0.00026523875,0.0005840648,0.0008201269,0.00010416565,0.00023197405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008990453,0.00039265453,0.00036341086,0.00011589754,0.00048710423,0.00047232324,0.0008800487,0.0006150442,0.000030219524],"category_scores_gemma":[0.000082363884,0.0004140924,0.00040891953,0.00036469853,0.00027259364,0.00041054597,0.00050201436,0.00037693474,0.00017791636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.00013309982,0.00025046157,0.000019921381,0.00033455045,0.00015380654,0.00010272867,0.00035509985,0.00013058988,0.0020186265,0.9925328,0.0026106955,0.0013576068],"study_design_scores_gemma":[0.0028706433,0.0022222912,0.000373052,0.00013594428,0.00044927807,0.000683366,0.0009493872,0.8133727,0.033334874,0.1021925,0.04168118,0.0017347882],"about_ca_topic_score_codex":0.00035100628,"about_ca_topic_score_gemma":0.00012993897,"teacher_disagreement_score":0.8903403,"about_ca_system_score_codex":0.0000059606077,"about_ca_system_score_gemma":0.00020286045,"threshold_uncertainty_score":0.9998311},"labels":[],"label_agreement":null},{"id":"W2220541827","doi":"10.1016/j.apal.2015.12.003","title":"Separating club-guessing principles in the presence of fat forcing axioms","year":2015,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"Forcing (mathematics); Axiom; Mathematics; Club; Separation axiom; Mathematical economics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry; Medicine","score_opus":0.23950483965898503,"score_gpt":0.4015562130680431,"score_spread":0.1620513734090581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220541827","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.97328347,0.0006686869,0.006432468,0.00034036435,0.000024387578,0.00022177809,0.0000025339707,0.00001428531,0.019012047],"genre_scores_gemma":[0.99647456,0.000027377057,0.0031835968,0.00020466957,0.00003505802,0.000011457691,0.0000014776843,0.0000052642877,0.000056540244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926984,0.00007338385,0.00026369168,0.00012059412,0.000114983886,0.00015749663],"domain_scores_gemma":[0.9990552,0.000526509,0.00018695752,0.00016659638,0.000039281218,0.00002543341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009059447,0.000088157314,0.00022678969,0.000037894453,0.000049968578,0.0000063301204,0.00015076723,0.00007549062,0.000003654792],"category_scores_gemma":[0.00025575366,0.000056479374,0.000027583916,0.00010034177,0.00016646353,0.0000600758,0.00006308989,0.00012521043,8.0581754e-7],"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.00005216545,0.00005991048,0.00027280257,0.000095468116,0.000010473816,0.0000031338893,0.007313272,0.0003603996,0.0017754368,0.98824507,0.00016112636,0.001650718],"study_design_scores_gemma":[0.00020882438,0.00006224362,0.0001466718,0.000054018605,0.000008730514,0.0000054920783,0.008247054,0.00021865807,0.01126367,0.9795747,0.0001348947,0.00007504093],"about_ca_topic_score_codex":0.000003030884,"about_ca_topic_score_gemma":0.000014359629,"teacher_disagreement_score":0.02319111,"about_ca_system_score_codex":0.000001967899,"about_ca_system_score_gemma":0.00001276229,"threshold_uncertainty_score":0.23031619},"labels":[],"label_agreement":null},{"id":"W2268439824","doi":"10.1016/j.apal.2018.02.005","title":"New-from-old full dualities via axiomatisation","year":2018,"lang":"en","type":"preprint","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duality (order theory); Dual (grammatical number); Algebra over a field; Mathematics; French horn; Pure mathematics; Natural (archaeology); Physics; Linguistics","score_opus":0.05508357663907007,"score_gpt":0.29424860470000047,"score_spread":0.2391650280609304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268439824","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.10327204,0.0020462913,0.88417226,0.0022874519,0.00050247344,0.0004189514,0.000038787566,0.00023004356,0.007031669],"genre_scores_gemma":[0.9387851,0.00035387528,0.057988223,0.0018614044,0.00056945515,0.00003292301,0.00007883263,0.000015662847,0.0003145251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828696,0.000042746495,0.00041151512,0.00066965254,0.00029009697,0.0002990048],"domain_scores_gemma":[0.99852073,0.0001293952,0.00040862794,0.0007160557,0.00009748585,0.00012772891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002148631,0.0003167321,0.0004756968,0.00011000784,0.00008693581,0.000120385135,0.00077489,0.00031409395,0.00007372783],"category_scores_gemma":[0.000021384232,0.0002689864,0.000101514284,0.00013726988,0.00010604046,0.00015639234,0.0010105929,0.0002469873,0.00004280014],"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.00004036992,0.00007352747,0.000055165932,0.00018248809,0.00011549437,0.000007745634,0.0020351706,0.00028066212,0.00399715,0.8593176,0.010674633,0.12322002],"study_design_scores_gemma":[0.00014613713,0.00011401322,0.0011163454,0.000050970903,0.00001414681,0.000003615065,0.000058639027,0.0005333378,0.007699628,0.9887173,0.0012199262,0.00032593636],"about_ca_topic_score_codex":0.00006113788,"about_ca_topic_score_gemma":0.000016201151,"teacher_disagreement_score":0.83551306,"about_ca_system_score_codex":0.000006751338,"about_ca_system_score_gemma":0.000057363886,"threshold_uncertainty_score":0.9999762},"labels":[],"label_agreement":null},{"id":"W2337591713","doi":"10.1016/j.apal.2016.04.001","title":"The poset of all copies of the random graph has the 2-localization property","year":2016,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Combinatorics; Mathematics; Partially ordered set; Monoid; Countable set; Discrete mathematics; Graph","score_opus":0.0890163147516098,"score_gpt":0.31537173302863913,"score_spread":0.22635541827702932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337591713","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.8407923,0.007114345,0.051488105,0.07248555,0.00037679073,0.0038114279,0.00016133288,0.00009011685,0.023680003],"genre_scores_gemma":[0.9984396,0.0005862784,0.00006725558,0.0004777111,0.00001651587,0.000016825386,9.041508e-7,0.0000056189883,0.00038929345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993439,0.00010542958,0.00024541165,0.00008586684,0.00010562078,0.00011379054],"domain_scores_gemma":[0.998609,0.0007845042,0.00024709068,0.00027342874,0.00007319906,0.000012760251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055675744,0.000083784704,0.00019807924,0.000012902599,0.00016059075,0.00000405983,0.00021636244,0.000067568784,0.000015811045],"category_scores_gemma":[0.00018064666,0.000022717699,0.000068659356,0.00006874899,0.0009915212,0.00002290551,0.00006059853,0.000057453846,7.9847774e-7],"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.0003547704,0.00006075664,0.000113538736,0.000056998186,0.00009145497,1.4873295e-7,0.0008815894,0.000015525764,0.0056463596,0.983242,0.0052146087,0.004322303],"study_design_scores_gemma":[0.00047438,0.000050067712,0.00013452847,0.000030254912,0.000031460524,0.0000016363495,0.00042275767,0.000004815836,0.04247306,0.95178026,0.0045535536,0.00004324602],"about_ca_topic_score_codex":0.0000021269975,"about_ca_topic_score_gemma":0.000020097155,"teacher_disagreement_score":0.15764727,"about_ca_system_score_codex":9.3222536e-7,"about_ca_system_score_gemma":0.00001348359,"threshold_uncertainty_score":0.3653301},"labels":[],"label_agreement":null},{"id":"W2346602651","doi":"10.1016/j.apal.2016.04.007","title":"Apartness spaces and uniform neighbourhood structures","year":2016,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Canterbury; Ryerson University","keywords":"Neighbourhood (mathematics); Mathematics; Constructive; Uniform limit theorem; Bounded function; Pure mathematics; Mathematical analysis; Computer science; Process (computing)","score_opus":0.06685076243352794,"score_gpt":0.33931814305463637,"score_spread":0.2724673806211084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346602651","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.9746787,0.00066106475,0.0035560948,0.0021702952,0.000036049278,0.00015675373,0.000017342438,0.00004297155,0.018680729],"genre_scores_gemma":[0.9976431,0.0003137914,0.0013451019,0.00035561674,0.000047205085,0.000006066823,0.0000010201979,0.000008093305,0.00027996476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994453,0.000018027053,0.00014278744,0.00015801429,0.00006262281,0.00017322652],"domain_scores_gemma":[0.9994181,0.0002657841,0.00009980532,0.00013701788,0.000025543211,0.000053742897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015425205,0.0001177203,0.0002322549,0.000035648292,0.00006993922,0.000007009794,0.000072242845,0.00010756162,0.000110882655],"category_scores_gemma":[0.00005175601,0.00006597363,0.000023944403,0.000037687525,0.00026589714,0.000055025845,0.000052096297,0.000059974973,0.0000025339386],"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.000054132117,0.000018726238,0.00012937837,0.000043401673,0.000025381381,0.0000016917611,0.00019569413,4.5602044e-7,0.0019611043,0.982329,0.0003286555,0.014912342],"study_design_scores_gemma":[0.00028015085,0.00006058577,0.0010452953,0.000014106214,0.000014006663,0.000009426072,0.0003398717,6.032893e-7,0.01569369,0.9817359,0.0007044931,0.00010188545],"about_ca_topic_score_codex":6.4898893e-7,"about_ca_topic_score_gemma":0.000006828112,"teacher_disagreement_score":0.02296444,"about_ca_system_score_codex":0.0000011201705,"about_ca_system_score_gemma":0.0000065533636,"threshold_uncertainty_score":0.26903266},"labels":[],"label_agreement":null},{"id":"W2741595739","doi":"10.1016/j.apal.2017.07.001","title":"Corrigendum to “The d.r.e. degrees are not dense” [Ann. Pure Appl. Logic 55 (1991) 125–151]","year":2017,"lang":"en","type":"erratum","venue":"Annals of Pure and Applied 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":"Simon Fraser University","funders":"","keywords":"Mathematics; Discrete mathematics; Artificial intelligence; Computer science; Mathematical economics; Calculus (dental); Medicine","score_opus":0.1098005144807524,"score_gpt":0.3076933068725218,"score_spread":0.19789279239176938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741595739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029690585,0.063903436,0.28284264,0.19986002,0.16902268,0.01903981,0.0023546615,0.0033412941,0.2566664],"genre_scores_gemma":[0.48845667,0.01184851,0.062084638,0.09126795,0.0346263,0.0030256247,0.0015841469,0.00080690696,0.30629924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937679,0.00021086316,0.001045516,0.0022622931,0.00130346,0.0014099573],"domain_scores_gemma":[0.99352854,0.0002316259,0.0014059958,0.003687475,0.000601153,0.000545209],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014842632,0.001227045,0.0018386795,0.0003695685,0.00091418694,0.0008374027,0.0063388376,0.0012562335,0.00006834718],"category_scores_gemma":[0.00028007632,0.0008762414,0.0005156161,0.00062644656,0.00053806923,0.00025236473,0.0031584485,0.0017615496,0.00036732006],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000035805566,0.00021904834,0.00003828447,0.00025184927,0.00012189018,0.00009124876,0.00044471773,0.00015040147,0.00004731453,0.017732855,0.9337453,0.047121275],"study_design_scores_gemma":[0.00042243727,0.0005006069,0.0046409215,0.00023612515,0.00010984615,0.00010088661,0.00022751816,0.002213362,0.00023813198,0.07796944,0.91160065,0.0017400957],"about_ca_topic_score_codex":0.000080165955,"about_ca_topic_score_gemma":0.00043120643,"teacher_disagreement_score":0.4854876,"about_ca_system_score_codex":0.000049883933,"about_ca_system_score_gemma":0.00028274042,"threshold_uncertainty_score":0.99936885},"labels":[],"label_agreement":null},{"id":"W2767976260","doi":"10.1016/j.apal.2019.102735","title":"Feasibly constructive proofs of succinct weak circuit lower bounds","year":2019,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; European Commission","keywords":"Mathematical proof; Mathematics; Pigeonhole principle; Upper and lower bounds; Proof complexity; Discrete mathematics; Bounded function; Combinatorics; Constructive; Logarithm; Computer science","score_opus":0.03561292216084491,"score_gpt":0.26679288051277583,"score_spread":0.23117995835193092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767976260","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.90884286,0.000757718,0.030976307,0.0010073171,0.00041546673,0.0010039998,0.000019131325,0.00011977109,0.056857426],"genre_scores_gemma":[0.99530244,0.000025484593,0.0041693267,0.0003277469,0.000048552574,0.000012640935,0.000002357588,0.0000082978395,0.000103146194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828845,0.000049091108,0.0003986669,0.0005739111,0.00034544338,0.00034443472],"domain_scores_gemma":[0.9985897,0.0001623332,0.0002660384,0.00065131247,0.00022737209,0.00010325575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047163275,0.00022090974,0.0005116873,0.00012387548,0.0000543543,0.000059083188,0.00068170484,0.00013167755,0.00006340755],"category_scores_gemma":[0.000024051868,0.00018391399,0.000117373835,0.0004288022,0.00024306346,0.00018706394,0.00039369776,0.00016865206,0.000024440698],"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.000060370938,0.0004190106,0.00835396,0.000217774,0.00010320501,0.0000063424436,0.0006877877,0.00013183606,0.0067533012,0.9001328,0.00063258084,0.08250106],"study_design_scores_gemma":[0.0014144478,0.0014984945,0.065519094,0.000069813854,0.000030347868,0.00006185555,0.0003466641,0.0019574098,0.024428101,0.9014381,0.0024699497,0.00076570356],"about_ca_topic_score_codex":0.000012431393,"about_ca_topic_score_gemma":0.0000045892534,"teacher_disagreement_score":0.086459585,"about_ca_system_score_codex":0.000009774223,"about_ca_system_score_gemma":0.00009300754,"threshold_uncertainty_score":0.7499795},"labels":[],"label_agreement":null},{"id":"W2767989015","doi":"10.1016/j.apal.2018.03.005","title":"Functoriality and uniformity in Hrushovski's groupoid-cover correspondence","year":2018,"lang":"en","type":"preprint","venue":"Annals of Pure and Applied Logic","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":2,"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":"Morphism; Equivalence (formal languages); Mathematics; Cover (algebra); Pure mathematics; Turkish; Diagonal; Algebra over a field; Discrete mathematics; Linguistics; Geometry; Philosophy; Engineering","score_opus":0.09581153663591728,"score_gpt":0.35247620714831046,"score_spread":0.25666467051239317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767989015","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.9870177,0.00055679644,0.00045990822,0.0008527871,0.00052721536,0.0005124935,0.00006180193,0.000043357217,0.009967937],"genre_scores_gemma":[0.9971529,0.0004383362,0.0008334667,0.00092834665,0.00029570062,0.000056720066,0.000018906052,0.000016990554,0.0002585802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998125,0.00016369882,0.000559945,0.00059594464,0.00018663912,0.0003687388],"domain_scores_gemma":[0.9983915,0.00052482256,0.00037928767,0.0005255821,0.000083979525,0.00009481731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013164646,0.0003402804,0.00084615016,0.0001305469,0.0000668685,0.000024697201,0.00030727003,0.0009288794,0.00025343345],"category_scores_gemma":[0.00027851728,0.0002911005,0.000080623126,0.00010681807,0.0006691549,0.000042445863,0.00076711405,0.00067583355,0.000015687301],"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.00059900794,0.0003313884,0.0046374155,0.0008675024,0.00014030423,0.000037158392,0.0013808203,0.000004376762,0.0002642845,0.9782668,0.011263415,0.0022075588],"study_design_scores_gemma":[0.00036604892,0.00014697437,0.0067972713,0.00005830531,0.000043875014,0.000015199496,0.000098925804,0.000009926737,0.0011019671,0.9898668,0.0012122617,0.00028244033],"about_ca_topic_score_codex":0.000047099875,"about_ca_topic_score_gemma":0.00009894848,"teacher_disagreement_score":0.011600036,"about_ca_system_score_codex":0.000010696132,"about_ca_system_score_gemma":0.000080666476,"threshold_uncertainty_score":0.9999541},"labels":[],"label_agreement":null},{"id":"W2962886912","doi":"10.1016/j.apal.2008.09.021","title":"A strong antidiamond principle compatible with <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"normal\"><mml:mi>CH</mml:mi></mml:mstyle></mml:math>","year":2008,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":"Thornhill Medical (Canada)","funders":"","keywords":"Mathematics; Parameterized complexity; Ideal (ethics); Modulo; Forcing (mathematics); Order (exchange); Algebra over a field; Discrete mathematics; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.03727274417826677,"score_gpt":0.2815602377238132,"score_spread":0.24428749354554646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962886912","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.9756464,0.00043283153,0.0023560286,0.0002341949,0.00013299208,0.000108313776,0.00010141217,0.00012085432,0.020866983],"genre_scores_gemma":[0.9911206,0.00047442128,0.006778331,0.00073728955,0.0002631931,0.0001485106,0.00013975834,0.000106781445,0.00023111298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973736,0.00007615189,0.00066267926,0.0006008768,0.0005069686,0.0007797601],"domain_scores_gemma":[0.99776536,0.0004948064,0.0006657835,0.00076267554,0.0000737299,0.0002376654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006114326,0.00041401098,0.0004147021,0.0001129078,0.0006530911,0.00007331253,0.00044757844,0.00053707126,0.0003115571],"category_scores_gemma":[0.00013469493,0.00043796678,0.0002576374,0.0002518072,0.0007686835,0.0003346382,0.00035328796,0.0005604877,0.00018934393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.0006335992,0.00033424833,0.000053802654,0.00037559465,0.00030961604,0.00024933045,0.00095846935,0.0005973201,0.0010227504,0.99340594,0.001788637,0.00027071376],"study_design_scores_gemma":[0.010375526,0.0063494933,0.00186613,0.001649336,0.0018959574,0.0037651765,0.008769264,0.3812483,0.3443693,0.2192697,0.015861152,0.004580671],"about_ca_topic_score_codex":0.000038619575,"about_ca_topic_score_gemma":0.00008444811,"teacher_disagreement_score":0.77413625,"about_ca_system_score_codex":0.0000045700963,"about_ca_system_score_gemma":0.00017698099,"threshold_uncertainty_score":0.99980724},"labels":[],"label_agreement":null},{"id":"W2963465171","doi":"10.1016/j.apal.2011.04.003","title":"Groups elementarily equivalent to a free nilpotent group of finite rank","year":2011,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; McGill University","keywords":"Mathematics; Nilpotent; Rank (graph theory); Group (periodic table); Nilpotent group; Pure mathematics; Binomial (polynomial); Domain (mathematical analysis); Algebra over a field; Discrete mathematics; Combinatorics; Mathematical analysis; Statistics","score_opus":0.22611269102588727,"score_gpt":0.3534014375907391,"score_spread":0.12728874656485184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963465171","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.96597725,0.00027763675,0.0052858866,0.0005008735,0.000049726812,0.0010696634,0.00009457546,0.000049838494,0.026694532],"genre_scores_gemma":[0.99037033,0.00008740988,0.00866343,0.00059340865,0.000046646637,0.000073750634,0.000009405865,0.000026349828,0.00012928553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982583,0.00006960457,0.00052909646,0.00030970236,0.00041252602,0.00042077253],"domain_scores_gemma":[0.99858755,0.00034563587,0.00019622075,0.0006035662,0.000107848246,0.0001591693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011704373,0.00020758134,0.00046833273,0.00018157871,0.00005343305,0.000011133579,0.0004893062,0.00010637162,0.0005293174],"category_scores_gemma":[0.00017025502,0.0001693291,0.00011530138,0.00024496266,0.00013831344,0.00005108904,0.0004350481,0.0001669446,0.000025611918],"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.0006630558,0.0007516063,0.00032276244,0.00050609454,0.00015197851,0.000009793598,0.0034425326,0.0000022803242,0.013345837,0.9687694,0.006615323,0.00541935],"study_design_scores_gemma":[0.00091394957,0.0008992863,0.0021549824,0.000073644296,0.0000452062,0.0000026937666,0.0010107897,0.000009232768,0.029448397,0.9646839,0.0005268656,0.0002310375],"about_ca_topic_score_codex":0.000025890047,"about_ca_topic_score_gemma":0.000030260764,"teacher_disagreement_score":0.026565248,"about_ca_system_score_codex":0.000006971107,"about_ca_system_score_gemma":0.000014168453,"threshold_uncertainty_score":0.690504},"labels":[],"label_agreement":null},{"id":"W3011769116","doi":"10.1016/j.apal.2023.103316","title":"Companionability characterization for the expansion of an o-minimal theory by a dense subgroup","year":2023,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"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":"National Science Foundation","keywords":"Mathematics; Multiplicative function; Unary operation; Abelian group; Predicate (mathematical logic); Characterization (materials science); Morphism; Discrete mathematics; Base (topology); Pure mathematics; Combinatorics; Computer science; Mathematical analysis","score_opus":0.08079708343801577,"score_gpt":0.3528783710157186,"score_spread":0.27208128757770284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011769116","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.98460376,0.00007460519,0.014266899,0.0004164005,0.000028134564,0.00037768466,0.00008852771,0.000036832902,0.000107181535],"genre_scores_gemma":[0.9989951,0.000081562386,0.00039498537,0.0002570494,0.00003041883,0.00005082679,0.00010065951,0.000009277908,0.00008008101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993544,0.00007210371,0.00021784716,0.0001483269,0.00007342479,0.00013385157],"domain_scores_gemma":[0.9985708,0.0010058684,0.00014828985,0.00019202559,0.000056710684,0.000026295613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089523266,0.00008924018,0.00021093866,0.000027791717,0.000101453465,0.000003471836,0.00010328327,0.000088035835,0.00002184153],"category_scores_gemma":[0.00011997155,0.000058411588,0.000045151934,0.00009082658,0.00021141086,0.00004641544,0.000035003897,0.00006126279,0.0000013032987],"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.00048959727,0.00013008468,0.000029258981,0.00012111893,0.000028928564,3.0566747e-7,0.000892136,0.0000059489917,0.10039489,0.88888663,0.00041794244,0.008603168],"study_design_scores_gemma":[0.00020998722,0.00014596475,0.0016763045,0.0000071877816,0.000022963153,0.0000011969881,0.0011112717,0.00014356569,0.04784367,0.94852334,0.00024483606,0.00006973084],"about_ca_topic_score_codex":4.1565636e-7,"about_ca_topic_score_gemma":0.000001177106,"teacher_disagreement_score":0.0596367,"about_ca_system_score_codex":0.0000013136745,"about_ca_system_score_gemma":0.0000086106,"threshold_uncertainty_score":0.23819555},"labels":[],"label_agreement":null},{"id":"W3035751756","doi":"10.1016/j.apal.2021.102984","title":"Parametrized Ramsey theory of infinite block sequences of vectors","year":2021,"lang":"en","type":"preprint","venue":"Annals of Pure and Applied 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":"Ramsey's theorem; Ramsey theory; Sequence (biology); Mathematics; Block (permutation group theory); Omega; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.12425744941052021,"score_gpt":0.36071055752349396,"score_spread":0.23645310811297376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035751756","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.9873131,0.0044840807,0.0014966821,0.000122044774,0.00010282682,0.0003522223,0.000074442534,0.000028466353,0.006026128],"genre_scores_gemma":[0.99240506,0.001324581,0.005906364,0.00015456052,0.00003676525,0.000024722804,0.000028414022,0.000017628863,0.00010192176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983425,0.00020559123,0.0007037546,0.0003434786,0.00019092998,0.00021372997],"domain_scores_gemma":[0.99669784,0.0016453156,0.00093322655,0.000488679,0.00018120726,0.000053732536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880117,0.00027654012,0.0011560551,0.00015394004,0.000035920228,0.000006637058,0.0002905862,0.00054047775,0.00015585088],"category_scores_gemma":[0.0004834303,0.00022504934,0.00022173926,0.00016653283,0.0006650047,0.00002509475,0.000347332,0.00046763464,0.00000115135],"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.00035086914,0.00029400445,0.00010969559,0.0018065376,0.0004538512,0.000009008469,0.0017063377,0.000262155,0.010635625,0.98162884,0.00013498278,0.0026081237],"study_design_scores_gemma":[0.00023796955,0.00008900681,0.00007654944,0.00018290732,0.000113595604,0.000003631765,0.0011436789,0.000003138104,0.11251964,0.8854133,0.000039516017,0.00017708646],"about_ca_topic_score_codex":0.000004001011,"about_ca_topic_score_gemma":0.0000028262443,"teacher_disagreement_score":0.101884015,"about_ca_system_score_codex":0.0000030159447,"about_ca_system_score_gemma":0.00008601089,"threshold_uncertainty_score":0.9177246},"labels":[],"label_agreement":null},{"id":"W3087696930","doi":"10.1016/j.apal.2024.103452","title":"Can you take Komjath's inaccessible away?","year":2024,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Mathematics; Lemma (botany); Combinatorics; Regular cardinal; Tree (set theory); Consistency (knowledge bases); Order (exchange); Function (biology); Discrete mathematics","score_opus":0.09364430099789671,"score_gpt":0.3691400032492957,"score_spread":0.27549570225139897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087696930","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.8062555,0.010420759,0.0055454224,0.010372801,0.00036060286,0.000543233,0.00008188637,0.0004241375,0.16599566],"genre_scores_gemma":[0.9960405,0.00032747805,0.0013509374,0.00075927546,0.00009967153,0.00001979971,0.000005605791,0.000016011287,0.0013807097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925995,0.000020830192,0.00020035039,0.00022038937,0.00008529755,0.00021319326],"domain_scores_gemma":[0.9994987,0.0001886306,0.000055682132,0.00017623871,0.000025695725,0.000055027183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002677262,0.00013380886,0.00024608427,0.00007074856,0.00007158067,0.00001883705,0.000117661744,0.00013102815,0.00013569706],"category_scores_gemma":[0.000036088186,0.00010163642,0.00005355793,0.00013544376,0.00014917219,0.00005248912,0.000056913625,0.00017581253,0.000016933853],"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.000022001908,0.000038091464,0.000028238646,0.00019002898,0.000040068895,0.000016751337,0.00038866035,0.000003401261,0.0008252532,0.9869317,0.0038974655,0.007618366],"study_design_scores_gemma":[0.00009284774,0.000052408504,0.00007574473,0.00003515561,0.00002419003,0.00000824756,0.0004139368,0.000013203856,0.0070377258,0.98351157,0.008614859,0.00012011605],"about_ca_topic_score_codex":0.000004057381,"about_ca_topic_score_gemma":0.000018951563,"teacher_disagreement_score":0.189785,"about_ca_system_score_codex":0.00000331091,"about_ca_system_score_gemma":0.000024775061,"threshold_uncertainty_score":0.41446128},"labels":[],"label_agreement":null},{"id":"W3186095916","doi":"10.1016/j.apal.2023.103317","title":"An undecidable extension of Morley's theorem on the number of countable models","year":2023,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Undecidable problem; Countable set; Mathematics; Discrete mathematics; Continuum hypothesis; Extension (predicate logic); Model theory; Equivalence (formal languages); Decidability; Combinatorics; Computer science","score_opus":0.14781299137105075,"score_gpt":0.3812278666988754,"score_spread":0.23341487532782462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186095916","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.96856683,0.00006995529,0.0022403256,0.0003578448,0.00002266347,0.00021640227,0.000023101597,0.00003271529,0.028470173],"genre_scores_gemma":[0.9984816,0.00017984553,0.0006535467,0.00034606332,0.000016602553,0.000012119641,0.0000058299192,0.000011933668,0.00029249792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992431,0.0000544634,0.00023982987,0.00015391414,0.00014320566,0.0001654965],"domain_scores_gemma":[0.9987614,0.0006055014,0.00017576845,0.00035148492,0.0000776704,0.000028136159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007099166,0.00010567123,0.0002990119,0.00003828197,0.00006798845,0.0000029065686,0.0001510598,0.00010249415,0.00013332107],"category_scores_gemma":[0.00004679238,0.000064571024,0.000047066245,0.0001626207,0.00024372597,0.000051191833,0.000043989316,0.00009983085,0.00000907376],"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.000112108726,0.00013924293,0.000024302033,0.000056106768,0.000026211363,0.0000011209647,0.00035834953,0.0012233891,0.0062628044,0.9899676,0.0014111538,0.0004176464],"study_design_scores_gemma":[0.00013994476,0.00009164542,0.000056766105,0.00002709544,0.000015491309,0.0000017368915,0.0015144569,0.0004560535,0.04039847,0.95718384,0.000050153576,0.00006436126],"about_ca_topic_score_codex":0.00000477809,"about_ca_topic_score_gemma":0.0000026408022,"teacher_disagreement_score":0.034135666,"about_ca_system_score_codex":0.0000016077747,"about_ca_system_score_gemma":0.000011670995,"threshold_uncertainty_score":0.263313},"labels":[],"label_agreement":null},{"id":"W4205188424","doi":"10.1016/j.apal.2006.05.004","title":"Cardinal sequences","year":2006,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":"University of Toronto","funders":"","keywords":"Mathematics; Stone's representation theorem for Boolean algebras; Sequence (biology); Countable set; Boolean algebra; Complete Boolean algebra; Discrete mathematics; Two-element Boolean algebra; Free Boolean algebra; Extension (predicate logic); Space (punctuation); Combinatorics; Regular cardinal; Algebra over a field; Pure mathematics; Filtered algebra","score_opus":0.07796418073834574,"score_gpt":0.34470969667075885,"score_spread":0.26674551593241314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205188424","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.8275531,0.0011960026,0.0034568703,0.0010241977,0.00004742406,0.00015773765,0.00001243592,0.000063328334,0.16648893],"genre_scores_gemma":[0.99616855,0.000049250924,0.0029554379,0.0002915884,0.00007941234,0.0000070983046,0.000003383101,0.000004809998,0.00044044387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995232,0.000017531182,0.00013995919,0.00011751884,0.00006289977,0.00013889698],"domain_scores_gemma":[0.9996614,0.00012426225,0.00007150595,0.00009898592,0.000022905839,0.00002097236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017523617,0.00008027213,0.0001852019,0.00002616195,0.000057360317,0.000003796186,0.000062894396,0.00007517892,0.00004696695],"category_scores_gemma":[0.000016277254,0.000060916605,0.00003724784,0.000047824993,0.00017037311,0.000026507798,0.000021506035,0.000070727314,0.000005930553],"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.000019978026,0.000028863655,0.000104771505,0.00002574755,0.000011710482,0.0000037795364,0.000048239643,0.000012960747,0.0014956935,0.9947952,0.0023294885,0.0011235802],"study_design_scores_gemma":[0.000091222486,0.00003475404,0.00030091853,0.0000049727973,0.000010867075,0.000007444648,0.00017269605,0.0000017858937,0.009197835,0.98869836,0.0014073366,0.00007182929],"about_ca_topic_score_codex":0.0000037516415,"about_ca_topic_score_gemma":0.000006156959,"teacher_disagreement_score":0.1686155,"about_ca_system_score_codex":0.0000010697491,"about_ca_system_score_gemma":0.0000064146097,"threshold_uncertainty_score":0.2484107},"labels":[],"label_agreement":null},{"id":"W4211158071","doi":"10.1016/j.apal.2005.05.015","title":"Preface","year":2005,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"","field":"","cited_by":2,"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; Computer science","score_opus":0.07169535233512939,"score_gpt":0.31676455510717105,"score_spread":0.24506920277204167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211158071","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.85111374,0.001716252,0.000045861536,0.0023850848,0.000012907007,0.00023773682,0.00003255668,0.000110963316,0.14434491],"genre_scores_gemma":[0.9971067,0.00010224011,0.00075455994,0.0014427657,0.000108724314,0.000012830361,0.0000077536915,0.000019883195,0.0004445849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925,0.00001259627,0.00016563438,0.00019618214,0.00014559415,0.00022997196],"domain_scores_gemma":[0.99958843,0.000025331376,0.000089275156,0.00018208199,0.000038581245,0.00007628217],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002191963,0.000118341835,0.00018695994,0.000051035462,0.0000422454,0.000013717758,0.00011441413,0.00007137631,0.00017893504],"category_scores_gemma":[0.000010440618,0.00009589156,0.000037991205,0.00013200798,0.00008178407,0.00006250507,0.00005017336,0.00008430907,0.00093218597],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.00028067597,0.00057822844,0.0006932016,0.00010052957,0.00013406844,0.0000044216868,0.0011195187,0.0009053596,0.2612036,0.39793348,0.23933552,0.09771139],"study_design_scores_gemma":[0.0011903389,0.000255946,0.013432987,0.00003085865,0.000054605604,0.000014833068,0.00047584227,0.000110949615,0.41277137,0.077171,0.49383366,0.00065758073],"about_ca_topic_score_codex":0.000002123005,"about_ca_topic_score_gemma":0.000009293471,"teacher_disagreement_score":0.3207625,"about_ca_system_score_codex":0.0000025429692,"about_ca_system_score_gemma":0.000009648156,"threshold_uncertainty_score":0.9998457},"labels":[],"label_agreement":null},{"id":"W4212987142","doi":"10.1016/s0168-0072(00)00004-x","title":"Preface","year":2000,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"","field":"","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":"McGill University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.0623051985432753,"score_gpt":0.3048786273687259,"score_spread":0.2425734288254506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212987142","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.77489144,0.0007557621,0.000004658755,0.0004776578,0.00000637584,0.00015420487,0.000026501148,0.000069941176,0.22361347],"genre_scores_gemma":[0.99709034,0.0002254911,0.0001925427,0.0010105935,0.000046294153,0.000013125866,0.000010007695,0.000019910263,0.0013917176],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992537,0.000015159784,0.00015631708,0.00020468136,0.00014106117,0.0002290643],"domain_scores_gemma":[0.99963266,0.00002249648,0.00005392601,0.00019039906,0.00002574971,0.000074749754],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001793949,0.00011907089,0.00019201328,0.00003698909,0.000046343386,0.0000143429515,0.00011371794,0.000071594775,0.0014341219],"category_scores_gemma":[0.0000048941192,0.00009626012,0.000038527727,0.00015453054,0.00009259131,0.00004712859,0.000021956654,0.00008019311,0.0016004085],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.00090098655,0.00085326214,0.00093057647,0.00018073534,0.00022497983,0.000018928093,0.0016677775,0.0009643175,0.1612781,0.22929345,0.2771351,0.3265518],"study_design_scores_gemma":[0.0016685626,0.0004993325,0.028731987,0.000053095773,0.00008011973,0.000026123245,0.0004706144,0.0000680702,0.20023239,0.24265476,0.5245533,0.0009616568],"about_ca_topic_score_codex":0.000004937185,"about_ca_topic_score_gemma":0.0000035883718,"teacher_disagreement_score":0.32559013,"about_ca_system_score_codex":0.0000014839864,"about_ca_system_score_gemma":0.000008603423,"threshold_uncertainty_score":0.9994787},"labels":[],"label_agreement":null},{"id":"W4313649963","doi":"10.1016/j.apal.2023.103244","title":"Applying generic coding with help to uniformizations","year":2023,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fields Institute for Research in Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Ultrafilter; Disjoint sets; Class (philosophy); Discrete mathematics; Consistency (knowledge bases); Combinatorics; Statement (logic); Countable set; Regular cardinal; Computer science; Artificial intelligence","score_opus":0.12233173928809234,"score_gpt":0.3519858308043756,"score_spread":0.2296540915162833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313649963","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.7990574,0.00019042488,0.15445654,0.003159513,0.00007314224,0.0014613513,0.000033797696,0.00044523002,0.041122608],"genre_scores_gemma":[0.99076885,0.00009575622,0.007394228,0.0010168384,0.000040069455,0.00013310966,0.000011447407,0.000014205106,0.0005255094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945706,0.00001221151,0.00013103674,0.00014023272,0.000073289404,0.00018617943],"domain_scores_gemma":[0.99957305,0.00015177786,0.000059294358,0.00012975764,0.000032809392,0.0000532972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018584073,0.00009098446,0.00017652573,0.000089541434,0.00012621652,0.0000060369334,0.00007429088,0.00005609339,0.000024672348],"category_scores_gemma":[0.00003652298,0.00006845784,0.000018627405,0.0003484729,0.0000612384,0.000030310137,0.000049181155,0.00006619488,0.000021911488],"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.00003441831,0.000020845706,0.000058650854,0.000052288226,0.00002414116,0.0000044090975,0.00038458404,0.0006959581,0.0017921805,0.99111664,0.001763726,0.004052148],"study_design_scores_gemma":[0.00018767262,0.00008776122,0.00014168561,0.00002365122,0.000018738601,0.0000064814867,0.0016846278,0.00006727485,0.0066651227,0.98811847,0.002847191,0.0001513101],"about_ca_topic_score_codex":4.304477e-7,"about_ca_topic_score_gemma":0.0000048790157,"teacher_disagreement_score":0.19171144,"about_ca_system_score_codex":0.0000017601743,"about_ca_system_score_gemma":0.0000089537,"threshold_uncertainty_score":0.27916297},"labels":[],"label_agreement":null},{"id":"W4376129855","doi":"10.1016/j.apal.2023.103286","title":"Forcing with copies of the Rado and Henson graphs","year":2023,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"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":"Centre National de la Recherche Scientifique; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Forcing (mathematics); Mathematics; Combinatorics; Graph; Distributive property; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.07347100660882844,"score_gpt":0.3252654999441475,"score_spread":0.25179449333531906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376129855","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.9961335,0.00032164244,0.00023349571,0.0006395021,0.000013183791,0.00013521814,0.000005356186,0.000022679562,0.002495435],"genre_scores_gemma":[0.9989027,0.00021366304,0.00049797696,0.00020430096,0.000008090646,0.0000064907717,9.779735e-7,0.000005775029,0.00016002977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996152,0.000017188931,0.000108447864,0.00009186485,0.000059908903,0.00010737169],"domain_scores_gemma":[0.9995412,0.00021351603,0.00009009561,0.00011833282,0.000020345818,0.00001648893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017082038,0.000070015885,0.00017671645,0.000031370553,0.00007095039,0.0000023454688,0.000057462414,0.000050880102,0.00000613106],"category_scores_gemma":[0.000027156118,0.000038873233,0.000022770842,0.000118585616,0.00026081112,0.000018995037,0.000045263903,0.00006635298,5.579521e-7],"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.000057017805,0.000014626159,0.00074346276,0.0001257182,0.000030628544,0.0000010774833,0.0007446631,0.000011767244,0.0015198891,0.99481785,0.00057238777,0.0013609009],"study_design_scores_gemma":[0.00017796521,0.000060737475,0.0017880397,0.000029899278,0.000017098073,0.000003974218,0.0013050124,0.00000464194,0.01341767,0.9829938,0.00014988522,0.00005130478],"about_ca_topic_score_codex":8.666082e-7,"about_ca_topic_score_gemma":0.0000073006854,"teacher_disagreement_score":0.011897781,"about_ca_system_score_codex":4.1447788e-7,"about_ca_system_score_gemma":0.0000045659335,"threshold_uncertainty_score":0.15852045},"labels":[],"label_agreement":null},{"id":"W4385211012","doi":"10.1016/j.apal.2023.103321","title":"Some variations on the splitting number","year":2023,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Mathematics; Disjoint sets; Property (philosophy); Finite set; Family of sets; Disjoint union (topology); Consistency (knowledge bases); Combinatorics; Infinite set; Set (abstract data type); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.1237882572754632,"score_gpt":0.3705175952988528,"score_spread":0.2467293380233896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385211012","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.88366497,0.000112100875,0.0014094829,0.018938402,0.00012735958,0.00043021358,0.000024609813,0.00022543452,0.09506745],"genre_scores_gemma":[0.99653596,0.000083658575,0.0004582512,0.0019619945,0.000109569264,0.00002333245,0.0000041297944,0.000007963956,0.000815159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995155,0.000031774514,0.00013086035,0.000108483146,0.00006760601,0.00014583192],"domain_scores_gemma":[0.9987964,0.00093539123,0.00007317271,0.00015726851,0.000017259585,0.000020484746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004404658,0.00007209621,0.00012530517,0.00002339051,0.00014542155,0.0000054287257,0.00008199652,0.000065241235,0.00009785983],"category_scores_gemma":[0.00014636958,0.00004491977,0.000033651027,0.000114802555,0.00008180802,0.000023441962,0.000040475694,0.00011242918,0.00012391151],"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.000010535038,0.000024240398,0.000018244848,0.000013918277,0.000019646339,0.0000013314831,0.00031250357,0.000012329039,0.00025090005,0.99357283,0.0050262366,0.0007372579],"study_design_scores_gemma":[0.00006582502,0.000015464231,0.00024428224,0.0000073495244,0.000008144914,0.0000012570893,0.0004420922,0.000018058598,0.001559983,0.99675995,0.0008255005,0.000052105814],"about_ca_topic_score_codex":3.4275254e-7,"about_ca_topic_score_gemma":5.546545e-7,"teacher_disagreement_score":0.11287099,"about_ca_system_score_codex":0.00000102965,"about_ca_system_score_gemma":0.000005240046,"threshold_uncertainty_score":0.1831775},"labels":[],"label_agreement":null},{"id":"W4392979310","doi":"10.1016/j.apal.2024.103442","title":"Vector spaces with a dense-codense generic submodule","year":2024,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Banach Space 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":"","keywords":"Mathematics; Pure mathematics; Discrete mathematics","score_opus":0.06405062142514124,"score_gpt":0.31803236606144003,"score_spread":0.2539817446362988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392979310","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.9808242,0.0043101893,0.006384973,0.0016248527,0.00004717048,0.00032565944,0.000017366681,0.0002143717,0.006251241],"genre_scores_gemma":[0.99107844,0.00024144829,0.0075539136,0.00027731646,0.00009719792,0.00003086915,0.000003095051,0.000035309466,0.00068240846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991277,0.000021842496,0.0001556406,0.00027509758,0.00016832686,0.00025140692],"domain_scores_gemma":[0.99937487,0.0002063674,0.00007137353,0.00023630667,0.000041027233,0.00007007694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022180373,0.00018424455,0.000292922,0.00007771347,0.000046822162,0.000036215795,0.0000979127,0.00007466243,0.00005300567],"category_scores_gemma":[0.000029238188,0.00012581491,0.00004780792,0.0002122814,0.00013249535,0.00006200238,0.000045237164,0.00013092844,0.000021310077],"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.00013836661,0.00008368999,0.000023449807,0.00052196434,0.00013263548,0.000064377884,0.00094984024,0.000058286063,0.02038947,0.9663722,0.0075660995,0.0036996314],"study_design_scores_gemma":[0.0002383055,0.00025306141,0.000120330296,0.00011785761,0.00008557216,0.00004614897,0.0007755838,0.00010445797,0.041932892,0.9521526,0.0038564845,0.00031669717],"about_ca_topic_score_codex":0.0000020257362,"about_ca_topic_score_gemma":0.000021048694,"teacher_disagreement_score":0.021543423,"about_ca_system_score_codex":0.000005307467,"about_ca_system_score_gemma":0.000023704939,"threshold_uncertainty_score":0.5130583},"labels":[],"label_agreement":null},{"id":"W4399358029","doi":"10.1016/j.apal.2024.103484","title":"Around definable types in p-adically closed fields","year":2024,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Pure mathematics; Discrete mathematics; Physics","score_opus":0.07503355616375781,"score_gpt":0.3515309681905321,"score_spread":0.27649741202677425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399358029","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.904853,0.004364469,0.0030043442,0.0028493165,0.0000953065,0.00021972058,0.00000758384,0.00008827775,0.084517986],"genre_scores_gemma":[0.99693286,0.0002948783,0.0013095314,0.0007037494,0.00004105911,0.00001098067,0.0000025696081,0.000007523087,0.00069682265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945676,0.000018945375,0.00016333885,0.00014885666,0.000054775508,0.00015732538],"domain_scores_gemma":[0.9995351,0.00029328326,0.000027550721,0.00010531133,0.000011852446,0.00002690761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002612689,0.000083710576,0.00018692049,0.000057060894,0.000027767925,0.000009941801,0.00006890783,0.00014094295,0.000079031066],"category_scores_gemma":[0.000051017953,0.000065294495,0.000032552187,0.00010005425,0.00009094489,0.00003532899,0.00003058676,0.00016884302,0.000017297947],"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.00003513137,0.00004277728,0.00004443944,0.00013547784,0.000018584797,0.00002161617,0.00023961077,0.000013369309,0.0002480667,0.99320865,0.0016978972,0.004294376],"study_design_scores_gemma":[0.0000986214,0.000053667336,0.00012475545,0.000031209336,0.000009693589,0.0000050745025,0.00017968052,0.00003038187,0.0015372297,0.9954425,0.0024120659,0.00007511613],"about_ca_topic_score_codex":0.0000019160714,"about_ca_topic_score_gemma":0.000018122968,"teacher_disagreement_score":0.09207989,"about_ca_system_score_codex":0.0000021161354,"about_ca_system_score_gemma":0.000016193479,"threshold_uncertainty_score":0.26626322},"labels":[],"label_agreement":null},{"id":"W4399392303","doi":"10.1016/j.apal.2024.103486","title":"Posets of copies of countable ultrahomogeneous tournaments","year":2024,"lang":"en","type":"article","venue":"Annals of Pure and Applied 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":"Countable set; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.07543598530810063,"score_gpt":0.3617738189368878,"score_spread":0.2863378336287872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399392303","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.97878736,0.0051471833,0.0011135146,0.00021073905,0.00007200328,0.00016803511,0.000070827686,0.000026475835,0.014403836],"genre_scores_gemma":[0.9976128,0.0006118256,0.0012630057,0.0001126031,0.0000205603,0.0000045546267,0.000004420625,0.000008273278,0.0003619619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993904,0.000016146505,0.00025895846,0.000114299735,0.00009625512,0.00012389949],"domain_scores_gemma":[0.9994198,0.00024578752,0.00014266545,0.00012265879,0.000043969212,0.000025122248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002093329,0.000090727575,0.00029524192,0.000050003975,0.000024226145,0.0000033571157,0.00008231222,0.000085586544,0.000100396755],"category_scores_gemma":[0.0000323701,0.00006986774,0.00004951368,0.000073440904,0.00017524455,0.000029714482,0.000027624379,0.00007651298,0.0000027646156],"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.00008705501,0.0001190462,0.000083195395,0.0006740392,0.00014024712,0.000009290806,0.0007903222,0.000020292233,0.03090167,0.96171093,0.0020536212,0.0034102655],"study_design_scores_gemma":[0.00011153125,0.000112128015,0.000054145385,0.00007067917,0.00003272451,0.000012013077,0.0004139165,0.0000052523733,0.15419121,0.84423524,0.00069752784,0.00006364681],"about_ca_topic_score_codex":0.0000019890713,"about_ca_topic_score_gemma":0.000003304027,"teacher_disagreement_score":0.12328953,"about_ca_system_score_codex":0.0000018048011,"about_ca_system_score_gemma":0.000016374457,"threshold_uncertainty_score":0.28491238},"labels":[],"label_agreement":null},{"id":"W4403527981","doi":"10.1016/j.apal.2024.103525","title":"Bi-colored expansions of geometric theories","year":2024,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Iran National Science Foundation; Iran's National Elites Foundation; Fields Institute for Research in Mathematical Sciences","keywords":"Colored; Mathematics; Pure mathematics; Sociology","score_opus":0.08875443143808873,"score_gpt":0.3317888907195749,"score_spread":0.24303445928148618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403527981","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.9145463,0.004903998,0.005698748,0.0004964995,0.00015646365,0.0003683876,0.000051057094,0.00014356527,0.073634945],"genre_scores_gemma":[0.9968056,0.00019882455,0.002192295,0.00008657723,0.000038962116,0.000014699993,0.0000027835965,0.000015058255,0.00064516853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918437,0.000028825682,0.00032262632,0.00015569403,0.00015978712,0.00014871676],"domain_scores_gemma":[0.9988087,0.0007751659,0.00010689656,0.0002099026,0.000050744617,0.000048592552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062821066,0.00012865805,0.00034586483,0.00022449516,0.00005899615,0.000011978754,0.00012686444,0.000096043856,0.0001752504],"category_scores_gemma":[0.00017602343,0.00009434232,0.00009313941,0.00039230488,0.00020511383,0.000044248583,0.000047755926,0.00010560366,0.000015821579],"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.000021399432,0.00011168627,0.0000022947718,0.0007606653,0.000063062944,0.0000037420791,0.0016656427,0.0000022014003,0.0025268348,0.98698336,0.004096218,0.003762909],"study_design_scores_gemma":[0.00008442046,0.00009420648,0.000014732438,0.0000883503,0.00004974581,0.000004783531,0.00078662013,0.000011610919,0.018447626,0.97655666,0.0037601984,0.00010107369],"about_ca_topic_score_codex":6.7480613e-7,"about_ca_topic_score_gemma":0.0000010529336,"teacher_disagreement_score":0.0822593,"about_ca_system_score_codex":0.000002717507,"about_ca_system_score_gemma":0.000023538138,"threshold_uncertainty_score":0.38471684},"labels":[],"label_agreement":null},{"id":"W4416295885","doi":"10.1016/j.apal.2025.103679","title":"Construction schemes: Transferring structures from ω to ω1","year":2025,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conseil National de la Recherche Scientifique; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Algebra over a field; Class (philosophy); Calculus (dental); Set theory","score_opus":0.0386720072520189,"score_gpt":0.28649124755354294,"score_spread":0.24781924030152402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416295885","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.13775861,0.0015943167,0.8391353,0.0014472511,0.00038551408,0.00038709462,0.0000032442024,0.00014592196,0.019142762],"genre_scores_gemma":[0.9916381,0.00003193461,0.0072685895,0.00094852166,0.00005340145,0.000013849482,0.0000024253814,0.0000027312863,0.000040417664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992169,0.000016858325,0.00018865557,0.00029681422,0.00011085386,0.00016992993],"domain_scores_gemma":[0.9995911,0.000033741046,0.00004581112,0.00022889677,0.0000436482,0.000056806843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012066541,0.000111301626,0.0002024212,0.000083621584,0.000077625344,0.00007733935,0.00028275678,0.0000815335,0.000007999158],"category_scores_gemma":[0.000008847346,0.000088000306,0.000041637548,0.00023648608,0.00004770537,0.000070865746,0.000077231474,0.00007581061,0.0000051717425],"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.000008350722,0.000011329801,0.0002311923,0.000032178785,0.000028216837,0.0000010501923,0.0003867131,0.000015534735,0.0035156677,0.9035201,0.00031721403,0.091932476],"study_design_scores_gemma":[0.0002836594,0.00007901812,0.002301887,0.000014132561,0.000011900807,0.0000028818229,0.00041985355,0.000086525986,0.06262777,0.9202064,0.013780258,0.00018569137],"about_ca_topic_score_codex":0.000041180014,"about_ca_topic_score_gemma":0.000011216782,"teacher_disagreement_score":0.8538795,"about_ca_system_score_codex":0.0000028764612,"about_ca_system_score_gemma":0.000022659848,"threshold_uncertainty_score":0.35885483},"labels":[],"label_agreement":null}]}