{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24889061,0.0035367217,0.43434584,0.04707644,0.0031157942,0.0003144298,0.0023391857,0.0042744675,0.2561066],"genre_scores_gemma":[0.8602511,0.0015992374,0.085565515,0.003941559,0.0015316828,0.00034474712,0.0019484558,0.0014535271,0.043364123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967912,0.0010861682,0.00016377073,0.00061232847,0.0006793282,0.0006672634],"domain_scores_gemma":[0.99080175,0.0053121587,0.00027266188,0.0026558817,0.0005941086,0.00036350358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018255875,0.0008018348,0.0020510782,0.0009366575,0.002612763,0.005739216,0.002244055,0.0030750453,0.024312956],"category_scores_gemma":[0.021040725,0.00074965326,0.0020720107,0.0012561824,0.0041728374,0.014858825,0.0038433322,0.0047272854,0.0058242353],"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.00013135023,0.00009029101,0.00016647525,0.00013831114,0.000031190528,0.00005281108,0.00016039416,0.004106557,0.0006105336,0.96839595,0.011037322,0.015078865],"study_design_scores_gemma":[0.000018257904,0.000008695797,0.00004547538,0.000015960803,0.000012271017,0.000022224605,0.000041941174,0.005663271,0.00036710317,0.9904096,0.0033858565,0.0000093595445],"about_ca_topic_score_codex":0.0014016497,"about_ca_topic_score_gemma":0.0015612036,"teacher_disagreement_score":0.024312956,"about_ca_system_score_codex":0.0012994448,"about_ca_system_score_gemma":0.0027479304,"threshold_uncertainty_score":0.08133489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10510611,0.0162437,0.49258614,0.01553479,0.0015628478,0.0000567293,0.0009789394,0.0013313395,0.3665994],"genre_scores_gemma":[0.87451667,0.0051594707,0.06296078,0.0011523758,0.0013716918,0.000039125047,0.000633656,0.00016017786,0.054005936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993538,0.00014079227,0.00003824254,0.00013245876,0.00025046855,0.00008430696],"domain_scores_gemma":[0.9988673,0.000540064,0.00006399776,0.00018730026,0.00020700856,0.00013443918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001287335,0.0005110389,0.00072605046,0.0016619579,0.002026989,0.004189869,0.0009808999,0.0008705192,0.007322615],"category_scores_gemma":[0.001978238,0.00051175815,0.000765266,0.0016857946,0.0038032965,0.009724985,0.0015994613,0.0033700524,0.001044479],"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.000008908724,0.0000054951565,0.00004518566,0.000012230061,0.0000033745116,0.0000117276195,0.00007400373,0.00011985992,0.00012177611,0.9955444,0.0010076849,0.0030454064],"study_design_scores_gemma":[0.000003446139,0.0000020128814,0.000041703952,0.000004615641,0.000004241941,0.000027458813,0.000018999604,0.0005925493,0.00018112987,0.9931264,0.00599378,0.0000036406361],"about_ca_topic_score_codex":0.00078708783,"about_ca_topic_score_gemma":0.0011464729,"teacher_disagreement_score":0.007322615,"about_ca_system_score_codex":0.0017236712,"about_ca_system_score_gemma":0.001026043,"threshold_uncertainty_score":0.024496555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88295645,0.00060529594,0.10329393,0.0014879128,0.000045696426,0.00009359824,0.0010380582,0.00048606197,0.009992933],"genre_scores_gemma":[0.98289824,0.00020602476,0.015104644,0.000046499536,0.00006664951,0.000055877194,0.0005532908,0.00008588881,0.000982837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942054,0.0015095779,0.00041000213,0.0013916945,0.0019204039,0.00056304026],"domain_scores_gemma":[0.87025917,0.09968608,0.008802634,0.014584511,0.0032795423,0.003388186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042075226,0.0007480116,0.0011819453,0.0050218715,0.0012768072,0.0075177466,0.0025004442,0.0024750717,0.006885339],"category_scores_gemma":[0.06635198,0.0010874118,0.0012771885,0.0033285916,0.0038203637,0.018666113,0.003241463,0.003845818,0.0004863852],"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.0010851108,0.000616791,0.070547305,0.00043936138,0.0004210711,0.0002465084,0.0016206906,0.1722119,0.008856401,0.6617327,0.0040172297,0.07820494],"study_design_scores_gemma":[0.00005071214,0.00013481556,0.011882871,0.000038298193,0.00009896124,0.00027967407,0.0005372715,0.27031037,0.005014701,0.7098119,0.0017734232,0.00006695171],"about_ca_topic_score_codex":0.0017806744,"about_ca_topic_score_gemma":0.0018751677,"teacher_disagreement_score":0.0075177466,"about_ca_system_score_codex":0.0029595403,"about_ca_system_score_gemma":0.0014761363,"threshold_uncertainty_score":0.023033798},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27538216,0.0041412823,0.42231718,0.014112081,0.0012040663,0.00036705632,0.0010419183,0.0014076626,0.28002644],"genre_scores_gemma":[0.92070866,0.0012358881,0.042158656,0.0007052087,0.0011523787,0.000244476,0.00088446576,0.0002501046,0.032660156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688905,0.00075701973,0.0002594314,0.0008528217,0.000698305,0.00054345065],"domain_scores_gemma":[0.99402726,0.0038455543,0.00035023305,0.0005634652,0.00068113685,0.0005322955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030353868,0.0008955888,0.0019320771,0.0016800171,0.0043371445,0.006589369,0.0014888906,0.001935729,0.010445249],"category_scores_gemma":[0.009043557,0.001374804,0.002384372,0.0019822055,0.0098221125,0.016525976,0.005404841,0.0084068375,0.0015615588],"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.000043756372,0.000040838317,0.00013884054,0.000029265488,0.000009296894,0.000057231813,0.00050824496,0.00017933371,0.00041602817,0.9945604,0.00092653756,0.0030902368],"study_design_scores_gemma":[0.000034640067,0.0000054734837,0.000054522978,0.000005020658,0.000006517446,0.00003271165,0.00007624881,0.0004628316,0.00026571556,0.99735767,0.0016929224,0.000005744066],"about_ca_topic_score_codex":0.0011328058,"about_ca_topic_score_gemma":0.0014455795,"teacher_disagreement_score":0.010445249,"about_ca_system_score_codex":0.0020667964,"about_ca_system_score_gemma":0.0018688774,"threshold_uncertainty_score":0.034942806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28730676,0.011201502,0.51690686,0.048005328,0.0007858751,0.0001691373,0.0018640241,0.0012266061,0.13253395],"genre_scores_gemma":[0.9492985,0.0025076158,0.036425523,0.0009010686,0.0013100086,0.0001547018,0.00057165313,0.00025650128,0.008574462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99111056,0.003365231,0.000432348,0.0010698808,0.0031684241,0.00085357815],"domain_scores_gemma":[0.9081988,0.08108294,0.0019313663,0.005094805,0.002332071,0.0013600392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005319368,0.0007041737,0.0018235779,0.0021110214,0.0024270895,0.008533891,0.0028468447,0.0021119828,0.012261344],"category_scores_gemma":[0.03758774,0.0013760182,0.0018900846,0.0025303396,0.0060099815,0.02807445,0.0032352235,0.0088194,0.0010574638],"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.00014224267,0.000071687384,0.0007451163,0.00014529916,0.000049113605,0.00004666682,0.00035141295,0.00828471,0.00056738197,0.97176456,0.0036248243,0.014206955],"study_design_scores_gemma":[0.00001795111,0.00000807495,0.00019285794,0.000012124016,0.000015944364,0.000022208855,0.000027983258,0.017129276,0.00027977323,0.9809668,0.0013160389,0.000010978611],"about_ca_topic_score_codex":0.002352126,"about_ca_topic_score_gemma":0.001925585,"teacher_disagreement_score":0.012261344,"about_ca_system_score_codex":0.005158889,"about_ca_system_score_gemma":0.0038028609,"threshold_uncertainty_score":0.041018248},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19225216,0.032885123,0.5121935,0.022151332,0.0013921858,0.000057285197,0.00064456766,0.0014344367,0.23698929],"genre_scores_gemma":[0.9217505,0.005804919,0.043776594,0.0014098926,0.0017588835,0.000056652643,0.00031015347,0.00024831283,0.024884062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972319,0.00079353264,0.00013139227,0.00066674215,0.00065893284,0.0005174687],"domain_scores_gemma":[0.9901968,0.0068981885,0.00056738727,0.0013825723,0.00057267834,0.00038225664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034953873,0.00068286655,0.0017749268,0.0017055658,0.002271158,0.0069030044,0.0021567529,0.002042198,0.008195356],"category_scores_gemma":[0.011468922,0.00094429107,0.001658568,0.0033850488,0.010964002,0.018819394,0.0031284764,0.00957246,0.0011575343],"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.00002401282,0.000011672573,0.00015586901,0.000027627808,0.0000039189945,0.000016873211,0.00014657222,0.00050442835,0.00010931908,0.99389726,0.00088191975,0.0042205285],"study_design_scores_gemma":[0.0000071731947,0.000003329749,0.00006384966,0.0000068887825,0.0000050128524,0.00002886811,0.000020924388,0.0009432351,0.000073594376,0.996974,0.0018677427,0.0000053951894],"about_ca_topic_score_codex":0.0036405378,"about_ca_topic_score_gemma":0.0036646817,"teacher_disagreement_score":0.008195356,"about_ca_system_score_codex":0.0050542955,"about_ca_system_score_gemma":0.0018379276,"threshold_uncertainty_score":0.03667164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47576708,0.0019030053,0.29752204,0.0048773973,0.00044285224,0.000054898803,0.00034912897,0.00054344477,0.21854016],"genre_scores_gemma":[0.9607006,0.00052182213,0.02073971,0.00038697195,0.00014035801,0.000037812708,0.00015436923,0.00010908026,0.017209223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993679,0.00014080474,0.000034107194,0.00013104721,0.00015989218,0.00016632676],"domain_scores_gemma":[0.998796,0.0006823454,0.00009307279,0.0001331214,0.00010812274,0.00018727368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007385623,0.00069530436,0.00082336017,0.0011538118,0.0021720582,0.003067761,0.0010298265,0.001054578,0.0042818845],"category_scores_gemma":[0.00251443,0.00065121765,0.0010679542,0.001073313,0.004104129,0.00904825,0.0033091796,0.0048442325,0.0006038078],"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.000029851526,0.00000873052,0.00008697516,0.000011438683,0.0000025576683,0.000044013937,0.00012629095,0.00027026373,0.00045162244,0.9971848,0.00021269497,0.0015708044],"study_design_scores_gemma":[0.000009587535,0.000009375735,0.00013153596,0.000006678271,0.0000056259746,0.000042483553,0.00006864745,0.0015456795,0.0003975217,0.99637634,0.0013998498,0.0000065945524],"about_ca_topic_score_codex":0.0015832222,"about_ca_topic_score_gemma":0.0017052322,"teacher_disagreement_score":0.0042818845,"about_ca_system_score_codex":0.0017368319,"about_ca_system_score_gemma":0.0007237038,"threshold_uncertainty_score":0.014324307},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067489315,0.13746333,0.19271572,0.03642326,0.018770812,0.000087509616,0.0015112701,0.0011947735,0.60508436],"genre_scores_gemma":[0.34265074,0.07511504,0.09080631,0.015353421,0.04456965,0.00061791495,0.0014387904,0.0013317154,0.42811644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990609,0.00029035573,0.00005238811,0.00023432264,0.00027022482,0.000091752525],"domain_scores_gemma":[0.99848795,0.00082009105,0.000045142668,0.00025709122,0.00025966665,0.00013006377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009962759,0.00084342033,0.0011607258,0.0034135105,0.0024208827,0.004061549,0.001088877,0.0015903588,0.024506167],"category_scores_gemma":[0.003371249,0.00071461994,0.0009830587,0.0040092743,0.006549979,0.007167874,0.0028553675,0.005910259,0.0070908335],"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.0000043883997,0.0000063069647,0.000047305843,0.00006171776,0.000004013813,0.000013933994,0.0001623869,0.0001463268,0.00010857711,0.96516365,0.022274978,0.012006374],"study_design_scores_gemma":[0.0000022593565,0.0000044730436,0.000098746146,0.000039271352,0.0000037125014,0.00005874529,0.000034776764,0.00024605694,0.000083667815,0.7678422,0.2315794,0.000006688062],"about_ca_topic_score_codex":0.0011756221,"about_ca_topic_score_gemma":0.0015028034,"teacher_disagreement_score":0.024506167,"about_ca_system_score_codex":0.002645588,"about_ca_system_score_gemma":0.0016082512,"threshold_uncertainty_score":0.08198136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11733071,0.019235829,0.60982645,0.019430421,0.0018364589,0.00016814,0.0013525583,0.0005925545,0.23022693],"genre_scores_gemma":[0.89478344,0.009400022,0.0520535,0.0021957303,0.0025950507,0.00021915138,0.0008402397,0.00014950642,0.037763283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980197,0.0006242157,0.00015259311,0.0002242351,0.0007981712,0.00018097773],"domain_scores_gemma":[0.9967698,0.0020481898,0.0002519864,0.00025735787,0.00045134727,0.00022139664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023022722,0.00079148856,0.0014393637,0.0031607058,0.002115017,0.007813755,0.0012086781,0.0021570872,0.008002457],"category_scores_gemma":[0.007435151,0.00078412774,0.0012773619,0.0041817734,0.004282802,0.013518763,0.0027494074,0.004680836,0.001249841],"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.000003809532,0.0000031860384,0.00002073981,0.000013890837,0.0000023593498,0.000014924383,0.000044790893,0.0001514277,0.000053981006,0.9981729,0.0003815366,0.0011363963],"study_design_scores_gemma":[0.0000024218518,0.0000011606162,0.000009614926,0.0000034221696,0.0000023538876,0.00001978211,0.000011386321,0.0009824436,0.00004339103,0.9977822,0.0011398402,0.0000021441815],"about_ca_topic_score_codex":0.0010723823,"about_ca_topic_score_gemma":0.0008833324,"teacher_disagreement_score":0.008002457,"about_ca_system_score_codex":0.0027868713,"about_ca_system_score_gemma":0.0013264922,"threshold_uncertainty_score":0.02677089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57447034,0.0019501426,0.18175085,0.0038843884,0.00060943497,0.00008600322,0.0006177701,0.0005465866,0.2360845],"genre_scores_gemma":[0.9582298,0.0003592342,0.023585882,0.0005468929,0.00019131145,0.000048319984,0.00037541488,0.00007100993,0.016592097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994697,0.00011211818,0.000028578315,0.00010901577,0.00014925607,0.0001312453],"domain_scores_gemma":[0.99914837,0.00028787283,0.00009634296,0.000109086155,0.00013499046,0.0002233096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049457257,0.0005960106,0.00073220883,0.0014886474,0.001991954,0.0031603002,0.0008432942,0.00083703536,0.004446218],"category_scores_gemma":[0.0017221884,0.00039511896,0.0007502164,0.0007111771,0.0025617296,0.004079577,0.003449007,0.0024870064,0.00045670057],"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.000066732806,0.000014861756,0.00019563759,0.000025758529,0.000012072847,0.000040867515,0.00018930371,0.0003403128,0.00111009,0.9939028,0.0010489348,0.0030526877],"study_design_scores_gemma":[0.0000167224,0.000014063206,0.00020418309,0.000008674674,0.000009549224,0.000057585894,0.00016943086,0.001591312,0.0005481,0.9940904,0.0032828078,0.000007167175],"about_ca_topic_score_codex":0.0008998558,"about_ca_topic_score_gemma":0.00091993087,"teacher_disagreement_score":0.004446218,"about_ca_system_score_codex":0.0012946861,"about_ca_system_score_gemma":0.0006427213,"threshold_uncertainty_score":0.014874041},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005036149,0.00040637667,0.19973972,0.0045128986,0.00093723607,0.00028298085,0.03097098,0.045203872,0.71290976],"genre_scores_gemma":[0.07845039,0.001485784,0.1584721,0.001423579,0.00069046335,0.00047417503,0.060837664,0.03704445,0.66112137],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999511,0.00009140634,0.000050230865,0.00010100234,0.00017390316,0.000072390125],"domain_scores_gemma":[0.9990746,0.00017930046,0.00005307952,0.00024343641,0.00029921666,0.00015033626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082405953,0.0007943189,0.00072913704,0.0015521949,0.0010933268,0.0040810285,0.0010489299,0.0007221843,0.27090517],"category_scores_gemma":[0.0024019456,0.00061102863,0.0008115488,0.0019362901,0.0008355747,0.005001587,0.0019793399,0.0019358892,0.22620012],"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.00015807497,0.000049301896,0.00037377773,0.00024891843,0.000010264942,0.000084397056,0.00033703336,0.00037024607,0.0049982346,0.19657427,0.7166698,0.080125615],"study_design_scores_gemma":[0.000026014963,0.00001438738,0.00056267536,0.000036069425,0.000007316356,0.00009391436,0.00007650695,0.0009870073,0.0034666841,0.05735293,0.9373507,0.000025683477],"about_ca_topic_score_codex":0.0043827984,"about_ca_topic_score_gemma":0.0062412624,"teacher_disagreement_score":0.27090517,"about_ca_system_score_codex":0.0018509526,"about_ca_system_score_gemma":0.0014420281,"threshold_uncertainty_score":0.90626806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24536511,0.002144336,0.6321393,0.0064543504,0.0004733761,0.00015953812,0.0015173049,0.001959652,0.10978702],"genre_scores_gemma":[0.9279338,0.00066038675,0.05810006,0.00060595374,0.00030122045,0.00015683158,0.0011325377,0.00023165299,0.010877568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982256,0.00065029314,0.00014332122,0.00027847817,0.0004553427,0.00024705043],"domain_scores_gemma":[0.99558604,0.0026225604,0.00041664293,0.0006849726,0.0004916897,0.00019801666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016270841,0.0009495595,0.0011598113,0.0021041147,0.0024484897,0.0075713447,0.0018115876,0.0023182605,0.0075642793],"category_scores_gemma":[0.006666654,0.0012296734,0.0018208286,0.0022802285,0.006186408,0.013902367,0.0032202932,0.005700434,0.00086675247],"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.000018192943,0.000009201525,0.00007158543,0.0000207521,0.0000058996457,0.000041498126,0.00024578304,0.0010216486,0.00024447136,0.9968965,0.00034510263,0.0010794852],"study_design_scores_gemma":[0.000007747765,0.0000031313357,0.0000266044,0.000007499444,0.0000054279058,0.000014579107,0.00004914807,0.0024842413,0.0001437647,0.996347,0.0009066604,0.000004163748],"about_ca_topic_score_codex":0.0021653613,"about_ca_topic_score_gemma":0.0026635802,"teacher_disagreement_score":0.0075713447,"about_ca_system_score_codex":0.0026810607,"about_ca_system_score_gemma":0.0012918893,"threshold_uncertainty_score":0.025305033},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20540121,0.00482122,0.52944064,0.012474366,0.00037878408,0.00011773157,0.0013415595,0.001022132,0.2450024],"genre_scores_gemma":[0.954681,0.000991716,0.028038451,0.00075961434,0.00037776993,0.00011217521,0.000679981,0.00012018872,0.014239205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976083,0.0010850667,0.00015235154,0.00030548562,0.0006096814,0.00023911937],"domain_scores_gemma":[0.9939174,0.0039052642,0.00037215653,0.0008265509,0.0006675101,0.00031111157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025485368,0.0009624509,0.0013288688,0.0023886529,0.0026675507,0.006097461,0.0018365049,0.0021384107,0.0110855345],"category_scores_gemma":[0.0064899754,0.0014145965,0.002078003,0.0025527708,0.006372701,0.015017117,0.003221475,0.004597456,0.0009775511],"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.000008101073,0.000006836467,0.00006143621,0.000015604748,0.000008090118,0.00001106671,0.00016131534,0.00043049204,0.00005995612,0.9982931,0.000340885,0.00060319074],"study_design_scores_gemma":[0.0000038698936,0.0000017775293,0.000023278806,0.0000033101335,0.0000036835195,0.00000804682,0.000021936405,0.0012293328,0.00003225944,0.9981047,0.0005653234,0.0000023647683],"about_ca_topic_score_codex":0.002425048,"about_ca_topic_score_gemma":0.0033536842,"teacher_disagreement_score":0.0110855345,"about_ca_system_score_codex":0.0031782947,"about_ca_system_score_gemma":0.0016394007,"threshold_uncertainty_score":0.037084818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02758002,0.0056504067,0.8858369,0.004260049,0.00032351675,0.00007674427,0.0002893035,0.0006780074,0.07530499],"genre_scores_gemma":[0.68509287,0.005116212,0.2826432,0.00095711485,0.002109181,0.0002658661,0.00046772874,0.00063501333,0.02271272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952295,0.002495547,0.00027582503,0.00059194845,0.0011055146,0.00030172616],"domain_scores_gemma":[0.96651644,0.027625201,0.0012253454,0.0016374064,0.0019997016,0.0009959204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071049137,0.0011682527,0.0021654312,0.0055683223,0.0018855033,0.008156025,0.0025432827,0.001866005,0.0092630405],"category_scores_gemma":[0.029111018,0.0008971294,0.0019408423,0.005639798,0.006104406,0.013279871,0.0041913474,0.005929017,0.0011314998],"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.00002741912,0.000030555526,0.0002563546,0.000081091246,0.00001243265,0.00003305142,0.00021045688,0.005420202,0.00014012915,0.97008836,0.0016745803,0.022025347],"study_design_scores_gemma":[0.000013279632,0.000024205756,0.00019420595,0.000038421564,0.000023293347,0.00006466451,0.00010820111,0.054566722,0.00038564918,0.9404883,0.004075284,0.000017855933],"about_ca_topic_score_codex":0.00208998,"about_ca_topic_score_gemma":0.001624022,"teacher_disagreement_score":0.0092630405,"about_ca_system_score_codex":0.003736902,"about_ca_system_score_gemma":0.0013060278,"threshold_uncertainty_score":0.037574828},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029412406,0.013433638,0.2478905,0.022877662,0.0019090356,0.00005201001,0.0011069389,0.0006297525,0.68268806],"genre_scores_gemma":[0.76817495,0.0077513237,0.050326865,0.0026090222,0.002296155,0.00013962307,0.0013444743,0.00033009466,0.1670276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999329,0.00019472647,0.000032048112,0.00018158033,0.00020466915,0.00005804868],"domain_scores_gemma":[0.9990552,0.00030793317,0.00006241144,0.00023032026,0.0002273176,0.00011677418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095854886,0.00052422873,0.00061391643,0.001857402,0.0018162652,0.004702372,0.00071567495,0.0010705609,0.014333992],"category_scores_gemma":[0.002147745,0.0003417621,0.00058085326,0.0014542463,0.004475961,0.0072843176,0.0018453571,0.0032085977,0.0021726133],"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.0000030574472,0.000002145618,0.000018740375,0.000005471686,0.0000013079227,0.0000059532167,0.000032683856,0.00010298618,0.0000556647,0.9957853,0.0017790371,0.0022076883],"study_design_scores_gemma":[0.0000029716539,0.0000030532624,0.000038559127,0.000007037108,0.0000030924339,0.000031158692,0.000034534885,0.00073153345,0.0000920392,0.96864736,0.030405711,0.0000030094222],"about_ca_topic_score_codex":0.0012598993,"about_ca_topic_score_gemma":0.0012342276,"teacher_disagreement_score":0.014333992,"about_ca_system_score_codex":0.0025900134,"about_ca_system_score_gemma":0.0010751694,"threshold_uncertainty_score":0.047951996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38406986,0.016924456,0.5312909,0.013990656,0.0009723459,0.00021248653,0.0020170824,0.001262436,0.0492598],"genre_scores_gemma":[0.9063351,0.005045577,0.07211572,0.0010228661,0.0017762014,0.0003259604,0.0010321734,0.0009342864,0.011412099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856902,0.0055197678,0.0012938925,0.0019053809,0.004161568,0.0014290868],"domain_scores_gemma":[0.61314416,0.3394998,0.017356658,0.012871775,0.010059111,0.007068382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025232032,0.0011952291,0.002304612,0.0061436594,0.0042326525,0.009609416,0.005764653,0.00304957,0.012460216],"category_scores_gemma":[0.13088074,0.0026298263,0.00197808,0.005234892,0.009846141,0.0439074,0.00699814,0.009114046,0.0012368024],"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.00064596615,0.000088290115,0.0036957534,0.0002667654,0.00008056129,0.00009533263,0.0012424113,0.0075157043,0.0006216113,0.9605599,0.0018358113,0.023351816],"study_design_scores_gemma":[0.000032159383,0.000033196502,0.0005354412,0.00006398036,0.000050545677,0.000043253807,0.00013173542,0.010096991,0.00038137875,0.98739666,0.0012074971,0.000027272186],"about_ca_topic_score_codex":0.0013127476,"about_ca_topic_score_gemma":0.0020292578,"teacher_disagreement_score":0.025232032,"about_ca_system_score_codex":0.006934152,"about_ca_system_score_gemma":0.0032198587,"threshold_uncertainty_score":0.13344133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54735637,0.003038274,0.19047426,0.005307497,0.00040732138,0.0000720734,0.00069903885,0.00031371578,0.25233155],"genre_scores_gemma":[0.9768842,0.00069230335,0.009988216,0.00027879624,0.00028263518,0.000049577273,0.00035333508,0.00007447265,0.011396472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868006,0.00041453782,0.00013544662,0.00028475418,0.0002554644,0.00022961893],"domain_scores_gemma":[0.99190485,0.005329189,0.00044681114,0.00072710897,0.0010439255,0.00054794893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025999153,0.0004926853,0.0011569544,0.001944432,0.0034411717,0.0056972704,0.000864128,0.0018032497,0.0058683534],"category_scores_gemma":[0.0057972535,0.0009234516,0.0010219369,0.0024124254,0.0073740683,0.013073036,0.0026056552,0.004887752,0.0006097026],"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.000032534386,0.000012012127,0.00027901283,0.000016684678,0.000004070443,0.000053214128,0.00016909011,0.0003016675,0.00022447483,0.99745876,0.00025235544,0.0011960653],"study_design_scores_gemma":[0.000011369133,0.000006080145,0.00017378491,0.000007272138,0.0000069997127,0.0000432747,0.000084731306,0.000907827,0.00027081816,0.9970374,0.0014448328,0.0000056764216],"about_ca_topic_score_codex":0.0020910525,"about_ca_topic_score_gemma":0.003528592,"teacher_disagreement_score":0.0058683534,"about_ca_system_score_codex":0.0021428494,"about_ca_system_score_gemma":0.0014408845,"threshold_uncertainty_score":0.019631565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42981508,0.002543235,0.40693292,0.0068514803,0.0011221807,0.000111960726,0.0005985032,0.000602056,0.15142259],"genre_scores_gemma":[0.9181256,0.0013448836,0.028604023,0.0007271831,0.000623393,0.00014333485,0.00051172747,0.00025707483,0.04966274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999511,0.00012057149,0.000025272122,0.00009246318,0.000109529356,0.00014124926],"domain_scores_gemma":[0.9990042,0.00036532638,0.000124535,0.000098656325,0.00011886625,0.00028844352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010705609,0.0010415805,0.0015867242,0.0018352083,0.0028015878,0.0032778287,0.0014249119,0.0024147893,0.010285933],"category_scores_gemma":[0.002890103,0.0006165395,0.0015788677,0.0011592722,0.0043192315,0.006222265,0.0038007642,0.0044613327,0.0009312255],"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.000013218299,0.000006305511,0.00004285572,0.000010464604,0.0000034772227,0.000014944506,0.00006126581,0.00063917716,0.00009466094,0.9977654,0.00057112717,0.0007771145],"study_design_scores_gemma":[0.000008243289,0.000007481167,0.000045830846,0.0000071677696,0.0000030262154,0.000014941337,0.000065015636,0.0058553433,0.0000662028,0.9932005,0.0007198278,0.0000064931332],"about_ca_topic_score_codex":0.0022984499,"about_ca_topic_score_gemma":0.0014768027,"teacher_disagreement_score":0.010285933,"about_ca_system_score_codex":0.0017057768,"about_ca_system_score_gemma":0.0014940454,"threshold_uncertainty_score":0.03440988},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40731612,0.002951889,0.46203136,0.010830055,0.00052929856,0.00015395888,0.0012272911,0.00077955215,0.11418053],"genre_scores_gemma":[0.9580919,0.0006312921,0.026062889,0.0010709146,0.00058838684,0.00013078724,0.00044652284,0.00016205519,0.012815177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943036,0.0015246421,0.0005822145,0.0012561162,0.0015922848,0.00074109866],"domain_scores_gemma":[0.97580546,0.014525209,0.0013603262,0.0038423354,0.0029789517,0.0014878012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056334673,0.0006282889,0.0018832039,0.003279063,0.0035898485,0.0076035303,0.0022417638,0.002295922,0.010084068],"category_scores_gemma":[0.019767245,0.0013483808,0.002117347,0.002554855,0.010575158,0.021055236,0.007379969,0.007609473,0.0009339552],"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.000060252252,0.000021550251,0.00041569848,0.00004617793,0.000022149676,0.000059264974,0.000307059,0.00048114793,0.00034346123,0.9939055,0.00063432055,0.0037034077],"study_design_scores_gemma":[0.000014786638,0.0000064558744,0.00012762357,0.000009565069,0.0000108409495,0.000042007316,0.00007728723,0.0011910651,0.0002763339,0.9975326,0.0007002882,0.000011190337],"about_ca_topic_score_codex":0.0012556058,"about_ca_topic_score_gemma":0.0012950987,"teacher_disagreement_score":0.010084068,"about_ca_system_score_codex":0.0026474886,"about_ca_system_score_gemma":0.0018269158,"threshold_uncertainty_score":0.03373456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09178384,0.0034261683,0.66104585,0.033005323,0.0026260377,0.00011586245,0.00066451775,0.0009744113,0.20635799],"genre_scores_gemma":[0.9184222,0.0008295919,0.0595847,0.0031718016,0.0018200971,0.00023970458,0.00025205486,0.00028993524,0.015389889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995509,0.0011984007,0.0002465356,0.0008282717,0.0017398754,0.00047790987],"domain_scores_gemma":[0.98398834,0.01122298,0.00053743634,0.0019467587,0.001590833,0.0007136084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042504882,0.0012485072,0.0020135792,0.0030771422,0.004016656,0.0057184547,0.0038407757,0.0034043575,0.008769649],"category_scores_gemma":[0.020781985,0.0012742667,0.0030931672,0.0025684505,0.0139337,0.015591088,0.0077884216,0.009341216,0.0011260852],"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.000010629856,0.000010746094,0.00005246729,0.000017495942,0.000006859172,0.000022566459,0.000067136774,0.00040766396,0.00011391708,0.99725276,0.00079359056,0.0012441988],"study_design_scores_gemma":[0.000009845783,0.0000058436453,0.00005431214,0.00000869242,0.0000053548615,0.00002504808,0.000017354385,0.0027413166,0.00017467137,0.9955884,0.0013616853,0.000007526422],"about_ca_topic_score_codex":0.0014428654,"about_ca_topic_score_gemma":0.0010838783,"teacher_disagreement_score":0.008769649,"about_ca_system_score_codex":0.0045358236,"about_ca_system_score_gemma":0.0020070977,"threshold_uncertainty_score":0.03290987},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0218089,0.20180249,0.03709956,0.5772589,0.008668941,0.000019750853,0.00084535975,0.00018884549,0.15230726],"genre_scores_gemma":[0.7558591,0.13058478,0.014885053,0.04046277,0.033604722,0.00012803657,0.0005118279,0.00021987718,0.023743829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972921,0.0015655265,0.00009748718,0.00038378636,0.00048016827,0.00018092462],"domain_scores_gemma":[0.9912322,0.005369477,0.0006421821,0.0009942194,0.0010551987,0.0007066203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004215486,0.00044865138,0.0012174039,0.0024246834,0.0037925637,0.015069005,0.0012173547,0.0032860255,0.007180307],"category_scores_gemma":[0.010978282,0.00048435872,0.00065647793,0.0034528784,0.021087736,0.027819091,0.0019484385,0.0070126457,0.0015205244],"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.00001858959,0.000013898165,0.00028711683,0.000073469215,0.000012838156,0.000022936763,0.00044900144,0.00019838486,0.00006745065,0.9771782,0.012803134,0.008874964],"study_design_scores_gemma":[0.000004761151,0.0000036090246,0.00018006918,0.00006682056,0.000005197332,0.000029173792,0.00037337717,0.00023192473,0.000025039391,0.9476112,0.0514616,0.0000073087735],"about_ca_topic_score_codex":0.0028505656,"about_ca_topic_score_gemma":0.0019724183,"teacher_disagreement_score":0.015069005,"about_ca_system_score_codex":0.0025201652,"about_ca_system_score_gemma":0.002578989,"threshold_uncertainty_score":0.024020493},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011174231,0.00014862983,0.9778706,0.00043412478,0.0001561874,0.00014440634,0.00041186984,0.002368222,0.0072916746],"genre_scores_gemma":[0.31044635,0.00024985088,0.6765533,0.00043401308,0.00017143448,0.0003094969,0.0011172937,0.00051148975,0.01020685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970805,0.00044524262,0.00036886046,0.0007664689,0.0009288924,0.000410086],"domain_scores_gemma":[0.99703586,0.0012628142,0.00013471828,0.00074904866,0.0005827881,0.00023492552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021799672,0.00089878077,0.0019864172,0.0020427005,0.0023830612,0.006029017,0.0035321836,0.0016932179,0.008442881],"category_scores_gemma":[0.005992429,0.0010690312,0.0033595066,0.0017234825,0.0036091853,0.009100276,0.005377519,0.004462021,0.0025941024],"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.00017017424,0.00007694906,0.00040614867,0.00015129664,0.00004404693,0.00015940612,0.00052606006,0.009541546,0.0030838272,0.9481313,0.003799767,0.03390947],"study_design_scores_gemma":[0.00012805282,0.00007902539,0.000234928,0.00004236513,0.00013142222,0.00013004965,0.00010712263,0.168494,0.005704373,0.8072465,0.017614063,0.000088153814],"about_ca_topic_score_codex":0.009750141,"about_ca_topic_score_gemma":0.012213935,"teacher_disagreement_score":0.009750141,"about_ca_system_score_codex":0.002973073,"about_ca_system_score_gemma":0.0027818906,"threshold_uncertainty_score":0.028244257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8976281,0.00029558272,0.071019426,0.0023499783,0.00030881853,0.00008880963,0.00074613636,0.00043555314,0.027127573],"genre_scores_gemma":[0.9614811,0.00027116,0.027713014,0.0002594887,0.0003962098,0.00018931861,0.0014136507,0.00030323793,0.007972774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974331,0.00051676336,0.00032510303,0.0005550071,0.0007132708,0.0004567134],"domain_scores_gemma":[0.9754125,0.017134905,0.0016838632,0.0014689522,0.0012995937,0.0030001737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024956556,0.0012028001,0.002651019,0.0013067978,0.0028077958,0.0063417098,0.0023621854,0.0036464562,0.015428117],"category_scores_gemma":[0.016664235,0.0015432936,0.0018197898,0.0011491281,0.0047073,0.01570197,0.004068161,0.004342951,0.002009836],"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.002637171,0.00033113072,0.0054539405,0.0004151419,0.00016029892,0.0010707789,0.0016167923,0.007750541,0.0453031,0.9127812,0.0035963992,0.018883467],"study_design_scores_gemma":[0.0003690966,0.0005891705,0.005652114,0.00007906481,0.00021047547,0.0017774883,0.0015253868,0.039886255,0.033068273,0.9099577,0.006753127,0.00013187545],"about_ca_topic_score_codex":0.00046102275,"about_ca_topic_score_gemma":0.00047146686,"teacher_disagreement_score":0.015428117,"about_ca_system_score_codex":0.0013804007,"about_ca_system_score_gemma":0.00093336083,"threshold_uncertainty_score":0.0516122},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03537958,0.018321833,0.6975647,0.014001953,0.004418625,0.00005197448,0.00075242127,0.0022767528,0.22723214],"genre_scores_gemma":[0.64994174,0.014872001,0.15527222,0.0037331055,0.007111441,0.00016514896,0.0013210109,0.0015331653,0.16605023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754214,0.00049396907,0.00016545909,0.00067557726,0.0009367479,0.00018621844],"domain_scores_gemma":[0.9954489,0.001797975,0.00018271495,0.0017096546,0.0006494912,0.00021131366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023525446,0.00070152496,0.0011844436,0.001534845,0.0021699776,0.006508763,0.0016040708,0.0015204946,0.010138836],"category_scores_gemma":[0.0071872654,0.0012432798,0.001102837,0.002465615,0.0058224597,0.012799837,0.003570665,0.008913203,0.0036795367],"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.000023164956,0.00001762734,0.00022136104,0.000036168054,0.00000747559,0.000025656092,0.00014149268,0.0004471241,0.00030605297,0.96402556,0.007965245,0.026783165],"study_design_scores_gemma":[0.000007411096,0.000007217303,0.0001007277,0.000021365186,0.000012627249,0.000101964935,0.000026409543,0.0019129056,0.0004771247,0.95930916,0.03801264,0.000010437932],"about_ca_topic_score_codex":0.0007980038,"about_ca_topic_score_gemma":0.00091761944,"teacher_disagreement_score":0.010138836,"about_ca_system_score_codex":0.0020180081,"about_ca_system_score_gemma":0.0019119777,"threshold_uncertainty_score":0.033917785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51297814,0.0071639605,0.2575497,0.011262476,0.000376284,0.0000651595,0.00088171475,0.00032946267,0.20939319],"genre_scores_gemma":[0.9764356,0.0012099291,0.010462978,0.00043689428,0.00029126217,0.000064601125,0.0003235859,0.00004704832,0.010728198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991314,0.0002840923,0.00006350203,0.00020477275,0.00018134752,0.00013489474],"domain_scores_gemma":[0.9948426,0.0034951342,0.00030754524,0.0006193318,0.00040686395,0.00032855186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021602907,0.00049111317,0.00088127353,0.0014924294,0.0022918088,0.0034792454,0.00092810276,0.0020433927,0.0070153554],"category_scores_gemma":[0.004319712,0.00061854534,0.0009471533,0.0015562093,0.007494358,0.013162228,0.003649326,0.0036176438,0.00056757964],"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.000013326306,0.000007556273,0.00014343848,0.000014240634,0.0000035614014,0.00003176853,0.00014509275,0.00017296094,0.00014641858,0.997973,0.00028623242,0.0010623275],"study_design_scores_gemma":[0.0000058937753,0.0000048767492,0.0000619723,0.0000049096384,0.0000028469494,0.000022235854,0.00004705392,0.00063561386,0.000099072735,0.9984256,0.0006872389,0.000002649913],"about_ca_topic_score_codex":0.0015666098,"about_ca_topic_score_gemma":0.0016882127,"teacher_disagreement_score":0.0070153554,"about_ca_system_score_codex":0.0015120533,"about_ca_system_score_gemma":0.0007921454,"threshold_uncertainty_score":0.023468673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81276035,0.0023144067,0.11619993,0.011163156,0.00030611502,0.000084626605,0.00066570326,0.0003549293,0.056150775],"genre_scores_gemma":[0.98806816,0.00048241345,0.005647186,0.00018331228,0.00039777582,0.00005891971,0.00021954846,0.00004647333,0.0048961826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720603,0.00082166307,0.00014529336,0.00044690212,0.0009867735,0.0003932649],"domain_scores_gemma":[0.9724425,0.022511007,0.0013623607,0.0014979467,0.0008945774,0.0012916377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029838188,0.0008076695,0.0018336585,0.0030561993,0.002698149,0.009842716,0.0028192112,0.0022699838,0.008206192],"category_scores_gemma":[0.020865604,0.0008066641,0.0012632266,0.0031035303,0.008318858,0.022445196,0.004479866,0.005435451,0.0005859455],"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.00011075868,0.000042875596,0.00085821474,0.000047191235,0.000013624089,0.00005822462,0.0004368511,0.0049540773,0.00026710628,0.9893884,0.0006821468,0.0031404677],"study_design_scores_gemma":[0.000016929602,0.0000074543227,0.00012969704,0.0000050351246,0.0000061393125,0.000027106422,0.00005798005,0.008146461,0.00014986536,0.9910487,0.0003960897,0.00000864287],"about_ca_topic_score_codex":0.0015190482,"about_ca_topic_score_gemma":0.0013861259,"teacher_disagreement_score":0.009842716,"about_ca_system_score_codex":0.004303566,"about_ca_system_score_gemma":0.001921656,"threshold_uncertainty_score":0.031224668},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023145648,0.00051070313,0.2265634,0.006355255,0.0012749061,0.00025029373,0.13171852,0.10548825,0.5255241],"genre_scores_gemma":[0.041752335,0.0019354074,0.16114484,0.0030890359,0.0010792,0.00070976134,0.17699648,0.08859453,0.5246984],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995327,0.00008716622,0.000053894102,0.00007433479,0.00020878049,0.000043165765],"domain_scores_gemma":[0.99811363,0.000533946,0.00012028655,0.0005014272,0.0005828763,0.00014779126],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008140082,0.0010430103,0.00075750117,0.002127941,0.0008057722,0.0046515786,0.002156802,0.0012495576,0.4552853],"category_scores_gemma":[0.003846684,0.00084020174,0.00067185453,0.0033402788,0.000583102,0.006899014,0.0016119236,0.0026242752,0.33809724],"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.00007050468,0.000028996055,0.00014596793,0.00026785926,0.000007243851,0.000043491385,0.00012838516,0.00031468723,0.001966647,0.09061112,0.8608825,0.045532588],"study_design_scores_gemma":[0.00003570162,0.000009559923,0.00047422867,0.00006030711,0.0000054912784,0.00011367863,0.000044862918,0.0019868019,0.0045804447,0.04006837,0.9525893,0.000031219348],"about_ca_topic_score_codex":0.0050594457,"about_ca_topic_score_gemma":0.005778739,"teacher_disagreement_score":0.4552853,"about_ca_system_score_codex":0.0019129288,"about_ca_system_score_gemma":0.0010447487,"threshold_uncertainty_score":0.7769694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5010436,0.004694442,0.37295783,0.00946188,0.00042347418,0.00014069895,0.00077008555,0.00052965677,0.10997832],"genre_scores_gemma":[0.9700014,0.00075689045,0.01909387,0.00048187294,0.00034741417,0.000110515284,0.00052194815,0.00007470112,0.008611411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621034,0.0011490309,0.00031126238,0.0010409954,0.0007853275,0.0005030124],"domain_scores_gemma":[0.9811489,0.015410868,0.0007238311,0.001243279,0.0008597708,0.00061331445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004586184,0.0008629691,0.0017006918,0.002395354,0.004027823,0.0071576876,0.0027463709,0.002141938,0.005011373],"category_scores_gemma":[0.014327209,0.0014397003,0.0033105277,0.0024096246,0.011673656,0.022978691,0.0046887132,0.009199568,0.00030748118],"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.000036313697,0.000039266306,0.0002749646,0.000032892905,0.000014776491,0.000075565455,0.00053929264,0.00081596576,0.00021459612,0.9957991,0.00023260844,0.0019245117],"study_design_scores_gemma":[0.000018410981,0.0000060875195,0.00008985114,0.000007487206,0.000012886566,0.000046316596,0.00007603985,0.002480205,0.00023923749,0.99642247,0.00059455534,0.0000063747457],"about_ca_topic_score_codex":0.0023881292,"about_ca_topic_score_gemma":0.002382235,"teacher_disagreement_score":0.0071576876,"about_ca_system_score_codex":0.0034814354,"about_ca_system_score_gemma":0.0015853228,"threshold_uncertainty_score":0.025259674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56689775,0.0013149596,0.23550747,0.005216973,0.0010388753,0.00009273491,0.0003450154,0.00044439777,0.18914177],"genre_scores_gemma":[0.977136,0.00020447775,0.012346354,0.00022108114,0.00030851876,0.000032714408,0.00011725026,0.00006407235,0.009569463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900347,0.00023754276,0.00005890371,0.00017784633,0.00029203825,0.00023016956],"domain_scores_gemma":[0.9956649,0.0020140938,0.00046494373,0.0006525838,0.0006302804,0.00057330896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002081132,0.0005083154,0.000873235,0.003498039,0.0033500444,0.0052593052,0.0011391307,0.0015272138,0.004407252],"category_scores_gemma":[0.0063094897,0.00040770974,0.0010939045,0.0024359468,0.009243348,0.011153929,0.0025322782,0.0032281594,0.00037354592],"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.000015004928,0.000008236046,0.0001762959,0.000004212173,0.0000012899853,0.0000273837,0.00018267824,0.00008772893,0.0001335259,0.99813557,0.00020104364,0.0010270146],"study_design_scores_gemma":[0.000008107355,0.000015342332,0.00037124444,0.000008744415,0.000008019743,0.000055695138,0.00025188288,0.0020317014,0.00026090958,0.9951988,0.0017761682,0.00001349174],"about_ca_topic_score_codex":0.00174654,"about_ca_topic_score_gemma":0.00135495,"teacher_disagreement_score":0.0052593052,"about_ca_system_score_codex":0.0017618638,"about_ca_system_score_gemma":0.00079984876,"threshold_uncertainty_score":0.014743745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4090371,0.0018198921,0.43426883,0.0030890654,0.0006635586,0.00010381415,0.0009705957,0.00046456355,0.14958242],"genre_scores_gemma":[0.89832383,0.000864798,0.039863605,0.0005141794,0.0006589419,0.00012150516,0.0005714334,0.0003025224,0.058779158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920577,0.00015573388,0.00005089323,0.00020784757,0.00025110945,0.00012868445],"domain_scores_gemma":[0.9980831,0.0009886813,0.0001647778,0.00029196014,0.00028686773,0.00018460977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012201065,0.0006006672,0.0013053754,0.0022702236,0.0027795765,0.0038358255,0.001144675,0.001123641,0.010581306],"category_scores_gemma":[0.0027892697,0.000799813,0.0012772749,0.0023480342,0.0040519224,0.010246629,0.002225905,0.003509772,0.0011846274],"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.000014419589,0.0000062459485,0.000052272204,0.000007837299,0.000003430392,0.000014982508,0.00007422601,0.00025126577,0.00021674989,0.9978035,0.00030957986,0.001245429],"study_design_scores_gemma":[0.000008251232,0.0000066962075,0.00008328754,0.00000360203,0.0000061236665,0.0000349616,0.00002506985,0.001702856,0.00021795163,0.9964167,0.0014894567,0.0000050944827],"about_ca_topic_score_codex":0.0013682526,"about_ca_topic_score_gemma":0.001387976,"teacher_disagreement_score":0.010581306,"about_ca_system_score_codex":0.0018837218,"about_ca_system_score_gemma":0.00060879445,"threshold_uncertainty_score":0.035398006},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28593203,0.0044595837,0.4806644,0.0076469346,0.0012468381,0.000079232355,0.00061538146,0.00053547753,0.21882015],"genre_scores_gemma":[0.92893046,0.0011481479,0.036312453,0.0006707128,0.0009388966,0.00011039423,0.0003181547,0.00015986132,0.0314108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981281,0.0005740035,0.00016564156,0.0004638173,0.00047345826,0.00019501828],"domain_scores_gemma":[0.9936778,0.003755592,0.0003398163,0.0011462995,0.0005527662,0.0005277148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027786104,0.0007287043,0.0017432717,0.0023593013,0.003734031,0.0045247297,0.0009895939,0.0014787018,0.008639893],"category_scores_gemma":[0.0052354136,0.0011126773,0.0021944197,0.0018095227,0.0075260084,0.012818281,0.005065335,0.0047123693,0.0009507037],"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.0000106645275,0.0000046045548,0.00006002909,0.000011242244,0.00000472885,0.000026738742,0.00010995782,0.00016844216,0.00014799985,0.99851435,0.00016757006,0.0007735414],"study_design_scores_gemma":[0.0000071867853,0.0000036244282,0.000049650098,0.000004101465,0.0000043570813,0.000055960038,0.000028992396,0.00060145074,0.00009156154,0.99799734,0.0011518877,0.000003899484],"about_ca_topic_score_codex":0.00056486344,"about_ca_topic_score_gemma":0.000783188,"teacher_disagreement_score":0.008639893,"about_ca_system_score_codex":0.001667325,"about_ca_system_score_gemma":0.00086232956,"threshold_uncertainty_score":0.028903365},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0992574,0.001212909,0.1609061,0.0065542697,0.0010281525,0.00009809882,0.002479927,0.001082967,0.72738016],"genre_scores_gemma":[0.75280136,0.0011460559,0.038577385,0.0015551016,0.0007830489,0.00014661116,0.0032342644,0.0006546338,0.20110151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.00015149462,0.00004869417,0.00028206533,0.0002179732,0.00014756569],"domain_scores_gemma":[0.9988122,0.0002212532,0.00012208302,0.00023137478,0.0004078366,0.00020530363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006425134,0.00067626004,0.00065647694,0.0035466233,0.0032658018,0.005087009,0.0008442255,0.0012823726,0.049289502],"category_scores_gemma":[0.002061993,0.0004033708,0.0008975368,0.0018032187,0.0030035675,0.0066529545,0.002838497,0.002205392,0.0057936893],"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.000011963962,0.0000053238414,0.00005717128,0.000010997297,0.0000026484634,0.000018809356,0.000055383192,0.00013370543,0.00016632325,0.9944185,0.002331943,0.002787264],"study_design_scores_gemma":[0.000009388897,0.000012678801,0.00016440848,0.000011944506,0.000007224329,0.0001320743,0.00013909364,0.0015600576,0.00037430957,0.95746857,0.040110193,0.00001003992],"about_ca_topic_score_codex":0.0017004343,"about_ca_topic_score_gemma":0.0017735992,"teacher_disagreement_score":0.049289502,"about_ca_system_score_codex":0.002243805,"about_ca_system_score_gemma":0.00095947494,"threshold_uncertainty_score":0.16488981},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37831077,0.0065441797,0.45306984,0.0041962606,0.0013425121,0.00012317862,0.00094910455,0.0007915505,0.15467252],"genre_scores_gemma":[0.9402161,0.0011765534,0.025743224,0.0004955334,0.00083554024,0.00014128548,0.00052898115,0.00019937902,0.03066327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680364,0.00078520423,0.0002827552,0.00070114294,0.000842917,0.0005841776],"domain_scores_gemma":[0.9889516,0.0063951695,0.0006215352,0.0013127029,0.00163484,0.0010841963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00422081,0.0009906518,0.0016294608,0.00612438,0.004959197,0.009635049,0.0021461903,0.0026440963,0.006129595],"category_scores_gemma":[0.007884547,0.0019313027,0.0022130727,0.003712736,0.009447448,0.018755918,0.0057479083,0.006370349,0.00084665325],"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.000028416576,0.000011204562,0.0002560821,0.000017053775,0.0000070194906,0.00004684945,0.00033588114,0.00012531682,0.00022566818,0.9973442,0.0002617794,0.0013405387],"study_design_scores_gemma":[0.000019793732,0.000014169301,0.00030595344,0.000013794104,0.00002175173,0.0001267649,0.00019574148,0.00095559325,0.0005342013,0.99414235,0.0036524835,0.00001733713],"about_ca_topic_score_codex":0.0014308977,"about_ca_topic_score_gemma":0.0014407227,"teacher_disagreement_score":0.009635049,"about_ca_system_score_codex":0.0029780976,"about_ca_system_score_gemma":0.0010285832,"threshold_uncertainty_score":0.022322059},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25069585,0.004092955,0.24185976,0.008674261,0.0013416264,0.00013850408,0.000649372,0.00030130454,0.49224633],"genre_scores_gemma":[0.86986643,0.0020094875,0.039444383,0.0013008043,0.00097375026,0.00020751408,0.00061508967,0.00024033932,0.08534228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873906,0.00048572372,0.000075982796,0.00024251505,0.0002857632,0.00017104283],"domain_scores_gemma":[0.99785334,0.0009664402,0.00022450177,0.00029616125,0.0003613311,0.0002982001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015041678,0.00077474915,0.0012106011,0.0036459798,0.005024107,0.0057403045,0.0012394045,0.0021485852,0.014123476],"category_scores_gemma":[0.0054023247,0.0009883351,0.0011268128,0.002885077,0.00607563,0.017099025,0.0055125384,0.0050246627,0.0012325987],"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.0000065081476,0.0000032746473,0.000051079118,0.0000071667914,0.0000017367205,0.00002620936,0.00018961063,0.000047578065,0.00004267405,0.9983827,0.00040173926,0.0008396899],"study_design_scores_gemma":[0.000004124985,0.0000059112153,0.000067922825,0.0000072038033,0.000003869356,0.00008033117,0.0001556858,0.00029382046,0.000048900958,0.9959941,0.0033335348,0.0000044970107],"about_ca_topic_score_codex":0.0008002219,"about_ca_topic_score_gemma":0.0009119209,"teacher_disagreement_score":0.014123476,"about_ca_system_score_codex":0.0015793886,"about_ca_system_score_gemma":0.0004828143,"threshold_uncertainty_score":0.047247708},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055302083,0.005893091,0.43936118,0.0136762215,0.0014950527,0.000055331966,0.00053452345,0.00041618707,0.48326623],"genre_scores_gemma":[0.8564414,0.0040820143,0.07230932,0.0038629733,0.0022116618,0.00018113681,0.00046164606,0.00045902736,0.059990752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991961,0.00027513749,0.000035308596,0.0002515248,0.00015389192,0.000088101144],"domain_scores_gemma":[0.99894744,0.00050607143,0.00006100272,0.00019362198,0.00020662615,0.00008532348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018045667,0.00076110056,0.0011268428,0.0018973245,0.0015752668,0.0033745384,0.000983694,0.0015196124,0.011024925],"category_scores_gemma":[0.002435313,0.0004686154,0.0013151284,0.0011638231,0.0063603153,0.010237821,0.004571928,0.004278568,0.0012197986],"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.0000045386428,0.00000346687,0.00002716263,0.000010913044,0.000002942547,0.000018271048,0.00005145966,0.00007386668,0.00009423171,0.9979457,0.0004924154,0.0012749392],"study_design_scores_gemma":[0.00000729287,0.000004955433,0.000058115747,0.0000063457946,0.0000034460843,0.000041826723,0.000026344562,0.00034762852,0.00009727361,0.99495256,0.0044510136,0.0000031237792],"about_ca_topic_score_codex":0.00041504388,"about_ca_topic_score_gemma":0.00037271925,"teacher_disagreement_score":0.011024925,"about_ca_system_score_codex":0.0011358054,"about_ca_system_score_gemma":0.0005240284,"threshold_uncertainty_score":0.036882043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3715369,0.0036730042,0.3170388,0.008183982,0.00045813268,0.00010753799,0.0010280105,0.00047391595,0.2974998],"genre_scores_gemma":[0.9721495,0.0005934409,0.013557629,0.0002193444,0.00037742627,0.000070846945,0.00032807287,0.0000599517,0.01264379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903715,0.00038492234,0.000059538706,0.00014806249,0.00025220605,0.0001180518],"domain_scores_gemma":[0.9977296,0.0012961506,0.000215659,0.0003329379,0.00021031318,0.0002154436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015248777,0.00075425004,0.0011855684,0.0018107418,0.002270542,0.007078392,0.0020192387,0.0019367731,0.009584235],"category_scores_gemma":[0.003176111,0.0008135177,0.0012306331,0.0021290428,0.00740865,0.010579529,0.0020555905,0.0038616778,0.00063891493],"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.0000045344145,0.0000058701735,0.0000757542,0.0000059818035,0.0000020759728,0.000016810223,0.00006733934,0.00026837454,0.0000357017,0.9990834,0.00011282735,0.00032141278],"study_design_scores_gemma":[0.0000063005286,0.0000019290328,0.000040166768,0.0000027204683,0.0000030077938,0.000013502385,0.00004085097,0.001457495,0.000024591087,0.99803203,0.0003748608,0.0000025795616],"about_ca_topic_score_codex":0.0020701657,"about_ca_topic_score_gemma":0.0023089084,"teacher_disagreement_score":0.009584235,"about_ca_system_score_codex":0.0022521324,"about_ca_system_score_gemma":0.00095438515,"threshold_uncertainty_score":0.03206253},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12889168,0.01054667,0.11379643,0.013874962,0.0011952778,0.000052442192,0.0008619397,0.00048255402,0.7302979],"genre_scores_gemma":[0.81918395,0.0036594665,0.015897173,0.0013987884,0.0015105892,0.00010125298,0.00049626693,0.00020228986,0.1575502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944395,0.00013847348,0.000026292577,0.00014796946,0.00015483172,0.0000883861],"domain_scores_gemma":[0.99921846,0.0002502773,0.000094181356,0.000116287796,0.00018496579,0.00013573047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010067228,0.00087006023,0.0010636816,0.004474557,0.0024340483,0.003298672,0.0008909654,0.0017054318,0.016763352],"category_scores_gemma":[0.0025445677,0.0006031038,0.0006831657,0.0018024044,0.0037443887,0.0072380453,0.0028430829,0.003377861,0.0019267227],"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.000003735026,0.0000030940512,0.000041525742,0.0000069083953,0.000002185578,0.000009873996,0.000051908024,0.00004895374,0.00007820234,0.99775785,0.0006989613,0.0012969101],"study_design_scores_gemma":[0.000006140671,0.000005229612,0.00024718,0.000009738128,0.0000065454683,0.00008319963,0.000060115515,0.0006315235,0.0001458027,0.9836776,0.015118791,0.000007993462],"about_ca_topic_score_codex":0.001239329,"about_ca_topic_score_gemma":0.0013874698,"teacher_disagreement_score":0.016763352,"about_ca_system_score_codex":0.002268903,"about_ca_system_score_gemma":0.00057282526,"threshold_uncertainty_score":0.05607903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032509156,0.002635363,0.91554475,0.0017751274,0.00032869156,0.00018896295,0.00044567345,0.0013864343,0.045185927],"genre_scores_gemma":[0.59272,0.0020521558,0.36255616,0.0009312111,0.00050664594,0.00038548996,0.0012363755,0.00053147355,0.039080545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977247,0.00068941346,0.00019011975,0.00045663325,0.0005304146,0.000408727],"domain_scores_gemma":[0.997422,0.0013531942,0.00015285204,0.0005723532,0.0003533993,0.00014615487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00312236,0.0012158921,0.0013348572,0.0033701165,0.0032879643,0.0056549055,0.002692002,0.002384406,0.015045059],"category_scores_gemma":[0.0074224714,0.0012011926,0.0024117436,0.002207228,0.0040185275,0.012941726,0.006303594,0.005201523,0.0020518377],"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.000026544174,0.000013451266,0.00007845601,0.000026935866,0.000012859081,0.00004772773,0.00018211099,0.0023152295,0.00026750463,0.9873125,0.0011007376,0.008615824],"study_design_scores_gemma":[0.000009495286,0.0000052462756,0.000028697845,0.000015456822,0.00001062021,0.00002542047,0.00005513742,0.009326467,0.00019353072,0.98655975,0.0037572605,0.0000129185255],"about_ca_topic_score_codex":0.0041079996,"about_ca_topic_score_gemma":0.005977805,"teacher_disagreement_score":0.015045059,"about_ca_system_score_codex":0.0030954222,"about_ca_system_score_gemma":0.0012902442,"threshold_uncertainty_score":0.0503307},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008034651,0.0011875537,0.8422709,0.0034004797,0.006607504,0.0001479976,0.0035230124,0.006949049,0.12787889],"genre_scores_gemma":[0.29021552,0.0022125354,0.5065764,0.003733251,0.0022065805,0.0006118801,0.007837164,0.014372717,0.17223395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956921,0.001354443,0.00067693164,0.0007248384,0.0010527516,0.00049898674],"domain_scores_gemma":[0.9892218,0.0044087274,0.00045224393,0.0033104392,0.0023563474,0.00025041477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059150127,0.0015452235,0.0011552233,0.001827769,0.0031773911,0.0072348495,0.0031965568,0.0018270443,0.034156807],"category_scores_gemma":[0.017559962,0.0016777912,0.002036953,0.0020998819,0.0036038905,0.017314661,0.0042426204,0.007137509,0.018605443],"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.00013121635,0.000026026531,0.00034393588,0.00030642908,0.000016409014,0.0002418424,0.00059871614,0.0005078697,0.0013279336,0.9341355,0.03400988,0.028354123],"study_design_scores_gemma":[0.000044454548,0.000032973367,0.00022100579,0.00025637122,0.000060033304,0.000570611,0.00027135716,0.004118618,0.008112191,0.6665876,0.31965685,0.00006786297],"about_ca_topic_score_codex":0.0017593045,"about_ca_topic_score_gemma":0.0029840914,"teacher_disagreement_score":0.034156807,"about_ca_system_score_codex":0.0023150207,"about_ca_system_score_gemma":0.0022234165,"threshold_uncertainty_score":0.11426586},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39177144,0.0016253203,0.53407294,0.0011165955,0.00031564376,0.00014176624,0.0011061155,0.0009102208,0.068939984],"genre_scores_gemma":[0.93137205,0.00052569545,0.045761745,0.00030017464,0.00022904285,0.000231366,0.001094705,0.00023556595,0.020249665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707246,0.0005992652,0.0003310077,0.00093666225,0.00068776857,0.00037279993],"domain_scores_gemma":[0.98999715,0.004023966,0.0013182423,0.0013903709,0.0022788483,0.0009914117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026893038,0.0014080529,0.0013778107,0.002600254,0.002341082,0.006423091,0.0013006099,0.0012724955,0.007958324],"category_scores_gemma":[0.0070865504,0.0016191555,0.0017365979,0.0027645535,0.0061986977,0.019681644,0.005227361,0.0032035962,0.0013165909],"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.00015518702,0.000031380572,0.0006771553,0.00006593556,0.000033735316,0.00025402548,0.00068109296,0.0005968248,0.0012424634,0.99059206,0.0004755929,0.005194552],"study_design_scores_gemma":[0.000030408308,0.000089842775,0.0003912341,0.000016123215,0.00003015616,0.0004830458,0.0004323271,0.0044906097,0.0019545238,0.98774034,0.0043224837,0.00001890902],"about_ca_topic_score_codex":0.0007505056,"about_ca_topic_score_gemma":0.00067259127,"teacher_disagreement_score":0.007958324,"about_ca_system_score_codex":0.0013662538,"about_ca_system_score_gemma":0.00080346095,"threshold_uncertainty_score":0.026623249},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016021315,0.00078743545,0.83353394,0.0069550937,0.0012162315,0.00014332813,0.0027782193,0.0027597083,0.1358047],"genre_scores_gemma":[0.57216346,0.0010377069,0.3553521,0.0027537143,0.0010649248,0.0006043338,0.004184153,0.0016868433,0.061152816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979625,0.0006165263,0.00019346761,0.00041306103,0.00050746335,0.00030698185],"domain_scores_gemma":[0.9972247,0.00079911214,0.00015563915,0.00046386634,0.0009410756,0.00041568538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029593038,0.00059358904,0.00053584715,0.001905851,0.0033702126,0.006648333,0.0020939142,0.0017502868,0.01843592],"category_scores_gemma":[0.0027563297,0.00072236225,0.0013729524,0.0018575885,0.004069494,0.008337702,0.0037993342,0.003929178,0.004486644],"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.000011981167,0.000011657728,0.00006409966,0.000017648095,0.0000021055505,0.000025758201,0.00026310925,0.00012205601,0.00041086247,0.993316,0.002816192,0.0029386058],"study_design_scores_gemma":[0.000027526416,0.000023206461,0.0001959638,0.00003920816,0.000012883199,0.00016292998,0.0005419973,0.0026332128,0.0013364417,0.9008144,0.09418301,0.000029240358],"about_ca_topic_score_codex":0.0040747095,"about_ca_topic_score_gemma":0.004518458,"teacher_disagreement_score":0.01843592,"about_ca_system_score_codex":0.0027659487,"about_ca_system_score_gemma":0.0020983736,"threshold_uncertainty_score":0.061674297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23060995,0.0006495367,0.69654536,0.0040310966,0.00025679253,0.00011507693,0.00036817873,0.0006097319,0.06681419],"genre_scores_gemma":[0.9184683,0.0002555964,0.0709565,0.00053407473,0.00021268481,0.000081334605,0.00027443675,0.00023794934,0.008979027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930727,0.002318632,0.0004959854,0.0013984974,0.0016070677,0.0011071179],"domain_scores_gemma":[0.9443503,0.040474072,0.002066067,0.008226182,0.0027154365,0.0021679294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009276629,0.00081054907,0.0025970666,0.0021023543,0.0032620851,0.0066342177,0.003827775,0.0042316797,0.0075505176],"category_scores_gemma":[0.047065,0.0017186179,0.002488024,0.0015352952,0.008520769,0.018597322,0.011399848,0.008144773,0.0009343219],"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.00004300145,0.000021651684,0.00038981062,0.00003257055,0.000018017381,0.000112542824,0.00018386073,0.001990454,0.00023493348,0.99433017,0.00039847192,0.0022445386],"study_design_scores_gemma":[0.000015376909,0.000006450898,0.000072874296,0.0000112850275,0.000010741386,0.000039581453,0.00004282417,0.010404225,0.00018569393,0.9888465,0.000355693,0.000008697106],"about_ca_topic_score_codex":0.0014908591,"about_ca_topic_score_gemma":0.0025795924,"teacher_disagreement_score":0.009276629,"about_ca_system_score_codex":0.0016728338,"about_ca_system_score_gemma":0.002222396,"threshold_uncertainty_score":0.049060106},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02551917,0.0018195546,0.8569147,0.0076632085,0.0019609067,0.00011143344,0.0007732779,0.0018704154,0.10336728],"genre_scores_gemma":[0.5718663,0.0023576661,0.3811129,0.004390546,0.0026620866,0.0002549154,0.0017135309,0.0015226635,0.03411942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555284,0.0014009416,0.0004053436,0.0010551376,0.0012499443,0.0003358353],"domain_scores_gemma":[0.99173284,0.0027084448,0.00021849404,0.0033077626,0.001612326,0.00042016056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005498878,0.0009935063,0.0013867704,0.0021154608,0.002438762,0.0061654905,0.0024993857,0.0018342398,0.01136368],"category_scores_gemma":[0.011586687,0.0011249636,0.0026974522,0.0014677382,0.008865772,0.022888856,0.009701872,0.010672113,0.0027286808],"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.00003182557,0.000024106212,0.00009670075,0.00004983946,0.000017620241,0.000033469947,0.00015565677,0.0003100914,0.000329275,0.98718387,0.0020534392,0.009714132],"study_design_scores_gemma":[0.000007791368,0.000003903511,0.000020945172,0.00001033476,0.00000938851,0.00003681458,0.00001857555,0.0010965704,0.00025731584,0.9941115,0.004419128,0.000007655783],"about_ca_topic_score_codex":0.00045426894,"about_ca_topic_score_gemma":0.0007461285,"teacher_disagreement_score":0.01136368,"about_ca_system_score_codex":0.0015280697,"about_ca_system_score_gemma":0.0014348639,"threshold_uncertainty_score":0.038015306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33969384,0.0014008624,0.55650055,0.0071387,0.0007331924,0.00018385956,0.0018430775,0.0017068104,0.09079913],"genre_scores_gemma":[0.9396556,0.0009561305,0.021965783,0.0015154919,0.0009266521,0.00043184555,0.0014852076,0.00043961767,0.032623544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762815,0.00064013625,0.000106537474,0.0009018969,0.00032689507,0.0003963553],"domain_scores_gemma":[0.99342304,0.003096357,0.0010211923,0.00090324436,0.0006127821,0.00094343803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015107968,0.0014504652,0.0020377152,0.0024364719,0.002357428,0.00510264,0.0016627959,0.0021939196,0.0140116615],"category_scores_gemma":[0.0055628116,0.0009930094,0.0019737396,0.0015651784,0.005193956,0.011774469,0.00488823,0.003540454,0.0024238937],"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.000086368585,0.000047167836,0.0003902347,0.000066989094,0.000026315118,0.00018477612,0.00041199062,0.00087346474,0.0012646806,0.99000376,0.0018634554,0.004780697],"study_design_scores_gemma":[0.00004044112,0.00005479636,0.0003481307,0.000013964432,0.00001759894,0.00039369846,0.00014353763,0.004921339,0.0009997057,0.9899194,0.0031148938,0.00003261703],"about_ca_topic_score_codex":0.0005838953,"about_ca_topic_score_gemma":0.00043987628,"teacher_disagreement_score":0.0140116615,"about_ca_system_score_codex":0.0006176744,"about_ca_system_score_gemma":0.0008305823,"threshold_uncertainty_score":0.04687363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37059414,0.0075848387,0.37140223,0.0054518394,0.0006311672,0.000045902827,0.0007364427,0.00019413795,0.24335933],"genre_scores_gemma":[0.9505098,0.0018711719,0.020722505,0.00034875292,0.0004114847,0.00007918723,0.00044323487,0.000059122918,0.025554769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991604,0.00026538677,0.00006763177,0.00024863274,0.000177781,0.00008006976],"domain_scores_gemma":[0.9972656,0.0014884569,0.00026432675,0.0003790056,0.0002945945,0.0003081394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011166316,0.0005224035,0.0009352905,0.00206659,0.0026289432,0.00355909,0.0009747159,0.0011407873,0.0066885855],"category_scores_gemma":[0.0041178316,0.0004685357,0.00089761347,0.0019421396,0.0063371016,0.010572643,0.0041822894,0.0033058315,0.0004195259],"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.0000068984828,0.0000026646794,0.000050592032,0.0000074344234,0.000002190819,0.000012495351,0.000084917025,0.000116990974,0.000043192067,0.9985245,0.0001331868,0.0010149576],"study_design_scores_gemma":[0.0000031860725,0.0000024061435,0.000065402055,0.0000030246592,0.000003461755,0.000025595697,0.00005639343,0.00040142957,0.00004000434,0.9982083,0.0011888221,0.000002074071],"about_ca_topic_score_codex":0.00090345804,"about_ca_topic_score_gemma":0.00090179854,"teacher_disagreement_score":0.0066885855,"about_ca_system_score_codex":0.0010336648,"about_ca_system_score_gemma":0.00039085234,"threshold_uncertainty_score":0.022375584},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012363125,0.0027630925,0.0006877261,0.11783517,0.86421543,0.00003816631,0.0009365678,0.00033797,0.013062285],"genre_scores_gemma":[0.010047843,0.012780672,0.0031336062,0.1664243,0.30639392,0.00025711695,0.003122412,0.001194179,0.496646],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961953,0.00064714235,0.0005313246,0.0006462915,0.0015637876,0.00041615785],"domain_scores_gemma":[0.980682,0.0040110806,0.0006326452,0.001063588,0.012811696,0.0007989598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029591674,0.0023532137,0.002420853,0.003944058,0.0049302736,0.0038986614,0.0039539495,0.006872013,0.09798762],"category_scores_gemma":[0.031935003,0.0012910235,0.0023973433,0.002504852,0.0031705133,0.004879917,0.0027249127,0.010209233,0.06464235],"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.000011244209,0.000004078594,0.000019936475,0.000044417247,0.0000049762534,0.000046940906,0.000011327689,0.000018364854,0.000019439929,0.0010975357,0.99719197,0.0015297369],"study_design_scores_gemma":[0.000026187814,0.000018018216,0.00069769827,0.00016453257,0.000028803383,0.0001581659,0.00006249396,0.00019904246,0.00021906952,0.0052400935,0.9931404,0.00004550419],"about_ca_topic_score_codex":0.03035968,"about_ca_topic_score_gemma":0.040004928,"teacher_disagreement_score":0.09798762,"about_ca_system_score_codex":0.0066016787,"about_ca_system_score_gemma":0.0043537463,"threshold_uncertainty_score":0.32780123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02675246,0.0012107496,0.91219735,0.007939999,0.0007021958,0.00039261463,0.0016983759,0.0033725302,0.04573378],"genre_scores_gemma":[0.5727255,0.001747341,0.39317304,0.0044813547,0.0014304788,0.0011891259,0.0030975374,0.0022317683,0.019923948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98784256,0.004769697,0.00067122077,0.001401867,0.0042245747,0.0010900763],"domain_scores_gemma":[0.8962344,0.08766724,0.0014977377,0.009514568,0.0040162965,0.0010696343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007570582,0.0032264981,0.002142134,0.0027505034,0.002454196,0.008648285,0.0062145917,0.0030052888,0.024454046],"category_scores_gemma":[0.05831847,0.003164476,0.0037550658,0.0032610684,0.005964531,0.017709171,0.011013867,0.013304638,0.004108591],"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.00041492327,0.00030696814,0.00052177114,0.0007510166,0.00017583976,0.0002379434,0.0006213732,0.019653903,0.0039553763,0.91424453,0.01305568,0.046060544],"study_design_scores_gemma":[0.000105281186,0.00003407753,0.00010798198,0.00010050084,0.000098192206,0.000075012525,0.00006872713,0.03328498,0.003829312,0.9566602,0.005604452,0.000031228836],"about_ca_topic_score_codex":0.0011735008,"about_ca_topic_score_gemma":0.0030173296,"teacher_disagreement_score":0.024454046,"about_ca_system_score_codex":0.0040002875,"about_ca_system_score_gemma":0.0033429705,"threshold_uncertainty_score":0.08180696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.628912,0.0033073477,0.15759888,0.0077893375,0.00066093286,0.000077214936,0.0006824359,0.00040407182,0.20056784],"genre_scores_gemma":[0.97846025,0.0005347642,0.006565832,0.0002716359,0.00033941277,0.000040426043,0.00013849465,0.00006785297,0.013581328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991394,0.00023029663,0.000048630805,0.0002514153,0.00018606927,0.00014416833],"domain_scores_gemma":[0.9991014,0.0004285718,0.000075143806,0.00012373284,0.00014714575,0.00012406155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012257483,0.00049411715,0.00097542704,0.002003915,0.0026494407,0.0028188291,0.0008673589,0.0012775937,0.005835732],"category_scores_gemma":[0.0024867249,0.00043497497,0.00068090856,0.0017464327,0.0057874303,0.007462282,0.0038956534,0.0023495324,0.00049606455],"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.000018741805,0.000007337548,0.00011814081,0.000011151546,0.0000033999072,0.000030030942,0.00023565837,0.00012102251,0.00018817949,0.99738103,0.00025347542,0.0016317283],"study_design_scores_gemma":[0.00001182399,0.00001008903,0.00020163326,0.0000039280712,0.000007015752,0.00004080917,0.000077213874,0.00072155014,0.00026092635,0.99615544,0.0025025231,0.0000069964826],"about_ca_topic_score_codex":0.001067138,"about_ca_topic_score_gemma":0.00059459184,"teacher_disagreement_score":0.005835732,"about_ca_system_score_codex":0.0014414535,"about_ca_system_score_gemma":0.00057895744,"threshold_uncertainty_score":0.019522488},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04306709,0.0008856469,0.49747196,0.0052500777,0.0016603213,0.00011226139,0.0007999158,0.00068216166,0.45007053],"genre_scores_gemma":[0.6395156,0.00097300485,0.2077912,0.0037938363,0.0011841846,0.00032033338,0.0011454973,0.0008930327,0.14438337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983103,0.00044351,0.00008961707,0.00048607695,0.00043522796,0.00023524085],"domain_scores_gemma":[0.9979785,0.0006146317,0.00009310168,0.00042284172,0.0006765019,0.0002144724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022017802,0.00058312784,0.0007849486,0.0010982874,0.0029310416,0.0036375988,0.0012080537,0.001635567,0.01360488],"category_scores_gemma":[0.0027517816,0.00064985675,0.0015866138,0.0007973121,0.0030636308,0.0058012092,0.0040658317,0.004542785,0.0035655962],"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.000011549229,0.0000065957256,0.000033396977,0.000012145715,0.000003545212,0.0000137309635,0.000029415784,0.00007706741,0.0002591265,0.99566156,0.0019675677,0.0019241624],"study_design_scores_gemma":[0.000021428497,0.00002006975,0.00008951193,0.000016013273,0.000007675373,0.000098060176,0.00003900784,0.0023721538,0.0006676501,0.98205537,0.01460272,0.000010403275],"about_ca_topic_score_codex":0.0008874912,"about_ca_topic_score_gemma":0.0017722212,"teacher_disagreement_score":0.01360488,"about_ca_system_score_codex":0.0013800123,"about_ca_system_score_gemma":0.0017632884,"threshold_uncertainty_score":0.045512855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6783046,0.0005030152,0.11712806,0.0027245632,0.00085262134,0.00013876182,0.0003926444,0.00053068146,0.19942503],"genre_scores_gemma":[0.96490556,0.00012792456,0.008722437,0.00041060778,0.00039703384,0.0000571555,0.00030139048,0.000059322072,0.025018495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986846,0.00033015994,0.000083125975,0.0002244412,0.00035307131,0.00032454848],"domain_scores_gemma":[0.9981273,0.0007414505,0.00022287235,0.0002574018,0.00026479195,0.00038625373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082064926,0.0007260387,0.0009921904,0.0017911837,0.002511306,0.0038877658,0.0011299219,0.0011747472,0.01078417],"category_scores_gemma":[0.0023888452,0.00041668036,0.0009846438,0.0008746856,0.00514015,0.0058129784,0.0032415034,0.00297402,0.0013082119],"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.00010602617,0.00003638378,0.00013870923,0.000016990027,0.000015332618,0.00011570783,0.00038923303,0.00037577713,0.0010585632,0.9954684,0.00038032778,0.0018984481],"study_design_scores_gemma":[0.00003259946,0.00004846302,0.00015761417,0.0000058891815,0.000014227043,0.00012904248,0.00023768387,0.001001274,0.0011332614,0.99465394,0.0025706824,0.000015226955],"about_ca_topic_score_codex":0.0006101095,"about_ca_topic_score_gemma":0.0005607143,"teacher_disagreement_score":0.01078417,"about_ca_system_score_codex":0.0010698925,"about_ca_system_score_gemma":0.0008942338,"threshold_uncertainty_score":0.036076665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7121437,0.000600862,0.1463723,0.0019528382,0.00019207313,0.00010831278,0.00042953715,0.00031616839,0.13788413],"genre_scores_gemma":[0.98356116,0.0001502904,0.0074267723,0.00028169862,0.00022459292,0.000052090865,0.00037396152,0.00006465525,0.007864721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991947,0.00014615571,0.00005291773,0.00022136726,0.00021805773,0.00016676677],"domain_scores_gemma":[0.99769634,0.0011825145,0.00022384714,0.00023140345,0.00027556048,0.00039034162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009164944,0.00050773093,0.0009449215,0.0020688903,0.0013818891,0.0022552838,0.0008876646,0.0010035215,0.008008262],"category_scores_gemma":[0.0026872146,0.00036830758,0.0012957797,0.0011593997,0.0038150141,0.0053527094,0.003519657,0.00260626,0.00054249354],"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.00010858813,0.000054499837,0.00093228533,0.00003762463,0.0000143830175,0.00022322865,0.00067255297,0.0004271661,0.0032303683,0.9896526,0.0006104691,0.004036176],"study_design_scores_gemma":[0.000040999614,0.000086456486,0.0014300613,0.000017190407,0.000027503167,0.00031555566,0.00037488624,0.006996654,0.0016052037,0.98579293,0.003291411,0.000021063433],"about_ca_topic_score_codex":0.000866814,"about_ca_topic_score_gemma":0.0006248087,"teacher_disagreement_score":0.008008262,"about_ca_system_score_codex":0.0009465484,"about_ca_system_score_gemma":0.00043662108,"threshold_uncertainty_score":0.02679032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3086602,0.0032128126,0.5250616,0.0017106091,0.00039074203,0.00007975193,0.00085077534,0.0005827561,0.1594509],"genre_scores_gemma":[0.9087427,0.0011276389,0.040193297,0.00036356668,0.00025564968,0.0001327456,0.00057431834,0.0002018648,0.048408117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993235,0.00022626897,0.00003957528,0.0001254755,0.00017199967,0.000113168855],"domain_scores_gemma":[0.99874806,0.00049633265,0.0001239361,0.00021815034,0.00025912147,0.00015446915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010117028,0.0006590045,0.00087878655,0.0015881713,0.0011638447,0.0032726214,0.0011944211,0.0010164169,0.009255447],"category_scores_gemma":[0.0025533864,0.0005820631,0.00066495436,0.001347979,0.002042863,0.007971941,0.0016843365,0.0024088877,0.0012071035],"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.000013769434,0.000006393265,0.000046021236,0.000010258174,0.0000025047227,0.000012993644,0.000063539665,0.00067108375,0.0002847218,0.99746907,0.00023610031,0.0011836383],"study_design_scores_gemma":[0.0000074892578,0.000011247513,0.000083557046,0.0000112000735,0.000005010578,0.00003463705,0.00004415594,0.007721958,0.00036068357,0.989077,0.0026354673,0.000007693735],"about_ca_topic_score_codex":0.0013602348,"about_ca_topic_score_gemma":0.0011590845,"teacher_disagreement_score":0.009255447,"about_ca_system_score_codex":0.0016839339,"about_ca_system_score_gemma":0.00074049825,"threshold_uncertainty_score":0.030962527},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17382066,0.012035205,0.18209773,0.079212554,0.0041391957,0.00006559315,0.00056592224,0.0008368808,0.54722625],"genre_scores_gemma":[0.9114521,0.002866679,0.022265755,0.00689916,0.0008314633,0.0000640473,0.00017686203,0.00034050853,0.05510342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991947,0.00019751984,0.000029723988,0.00018893383,0.00022401063,0.00016509286],"domain_scores_gemma":[0.99865156,0.0005606619,0.00013724228,0.00024114401,0.00023914537,0.00017019203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013872829,0.00030201825,0.0005607869,0.0010099476,0.0039697443,0.0032830408,0.0007894566,0.0011940342,0.007765146],"category_scores_gemma":[0.004432856,0.00015547125,0.00052091584,0.0010522703,0.0054254225,0.011255021,0.0018782385,0.0028454347,0.0015137828],"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.000039808234,0.0000067490787,0.00035803777,0.00002604461,0.000004409319,0.000043074255,0.0005344771,0.000075696444,0.00020520184,0.98669654,0.0029775184,0.009032512],"study_design_scores_gemma":[0.000011125875,0.00004031757,0.0009887267,0.00006584427,0.000016963315,0.0001919544,0.0012010315,0.0006180317,0.00090339757,0.880338,0.11560214,0.000022530081],"about_ca_topic_score_codex":0.0016776745,"about_ca_topic_score_gemma":0.0022535801,"teacher_disagreement_score":0.007765146,"about_ca_system_score_codex":0.0017148097,"about_ca_system_score_gemma":0.0007468072,"threshold_uncertainty_score":0.025977015},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18309487,0.0040696035,0.66202444,0.029825903,0.001819019,0.0002671204,0.0024878054,0.001474589,0.11493671],"genre_scores_gemma":[0.82780373,0.0016772634,0.14112608,0.004490906,0.0025271287,0.00040623275,0.001807297,0.00045661954,0.01970478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937943,0.0013630472,0.00045469476,0.002090469,0.0015549804,0.00074248936],"domain_scores_gemma":[0.9578413,0.034184404,0.0012389807,0.0033448092,0.0021190913,0.0012714001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005014182,0.0013385963,0.0025247938,0.0027719408,0.0041687298,0.0069024754,0.0060501737,0.0038015554,0.009424397],"category_scores_gemma":[0.02552609,0.002040135,0.0046884133,0.0026620151,0.0101795215,0.031800848,0.0077651534,0.013127602,0.00092571904],"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.00012134763,0.00009099774,0.0006059211,0.00016809125,0.000044700344,0.00020028757,0.0003009306,0.0046951673,0.0006165842,0.979352,0.0054350845,0.008368935],"study_design_scores_gemma":[0.000034704568,0.000011459172,0.00011058875,0.000019460964,0.000023917382,0.000064187414,0.00005008465,0.012753257,0.0003534005,0.9843748,0.002187301,0.00001674611],"about_ca_topic_score_codex":0.0028324286,"about_ca_topic_score_gemma":0.003382743,"teacher_disagreement_score":0.009424397,"about_ca_system_score_codex":0.004377716,"about_ca_system_score_gemma":0.002634171,"threshold_uncertainty_score":0.03176278},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033854406,0.002716658,0.17337166,0.0046317363,0.0015909451,0.00008503603,0.0017001076,0.0008928462,0.78115666],"genre_scores_gemma":[0.49264666,0.002772107,0.059467442,0.00095488416,0.0010674122,0.00022576557,0.0020211264,0.00039922015,0.4404454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918824,0.0001841425,0.00006892422,0.0002226682,0.0002481131,0.00008783191],"domain_scores_gemma":[0.9988218,0.0003243189,0.00007274909,0.00023975845,0.0003883522,0.00015290636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079294434,0.0007021169,0.000658533,0.0027989512,0.0025243186,0.0043497817,0.00070425024,0.0008670159,0.03015957],"category_scores_gemma":[0.002441542,0.00052290695,0.0006239637,0.002336895,0.0025431616,0.007790825,0.0020786112,0.0035579908,0.008400262],"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.000007784119,0.0000047731296,0.00004716781,0.000012906785,0.0000015045481,0.000010604517,0.000097361575,0.00006113686,0.00016744895,0.9909705,0.0024963873,0.0061223735],"study_design_scores_gemma":[0.000004311764,0.000005737842,0.00011682654,0.000016636659,0.000003738438,0.00009478674,0.00010246173,0.0004192058,0.00036787562,0.9402473,0.058615644,0.000005458008],"about_ca_topic_score_codex":0.0007902462,"about_ca_topic_score_gemma":0.0008434324,"teacher_disagreement_score":0.03015957,"about_ca_system_score_codex":0.0015751657,"about_ca_system_score_gemma":0.0007695481,"threshold_uncertainty_score":0.100893795},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010989306,0.014723243,0.010845151,0.03658034,0.21826445,0.00032526455,0.011110513,0.0016154051,0.7054367],"genre_scores_gemma":[0.0054722438,0.00496245,0.0024590143,0.0055590156,0.025186641,0.00015745939,0.0052819005,0.0008026199,0.95011866],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992619,0.00012034353,0.00004179159,0.00012469693,0.00039378338,0.00005739027],"domain_scores_gemma":[0.9959066,0.00069620257,0.00012529943,0.00043386008,0.0023182894,0.0005197704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012816222,0.0009577396,0.00065656897,0.003711916,0.0025043339,0.003422,0.0011550362,0.00091832265,0.3837277],"category_scores_gemma":[0.009138111,0.0002851477,0.00056995515,0.0024615629,0.00067079306,0.002639626,0.0019117784,0.0028733462,0.26268855],"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.000017871813,0.000014579329,0.00006264249,0.00006336548,0.0000018042232,0.000020038704,0.000041632302,0.000042395204,0.00007356184,0.007913016,0.95949703,0.03225203],"study_design_scores_gemma":[0.0000032715866,0.0000060155844,0.00017184847,0.00007094871,0.0000018475354,0.000024983008,0.000040089923,0.000031303454,0.000083067214,0.005708114,0.9938547,0.0000039212077],"about_ca_topic_score_codex":0.003940021,"about_ca_topic_score_gemma":0.005912708,"teacher_disagreement_score":0.3837277,"about_ca_system_score_codex":0.0020313438,"about_ca_system_score_gemma":0.0018743986,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010779751,0.015102653,0.009656578,0.03664313,0.22193192,0.00030456154,0.010019218,0.0014831054,0.7037808],"genre_scores_gemma":[0.005232237,0.0049336227,0.0021867394,0.005413225,0.025308097,0.00014345575,0.0047978438,0.0007404147,0.9512443],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992962,0.000114022776,0.000039814884,0.000119739525,0.00037309265,0.000057163852],"domain_scores_gemma":[0.9960083,0.00066214084,0.00012547424,0.00041750944,0.00224338,0.0005431771],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001255659,0.00095614354,0.0006422376,0.0036952046,0.0024715178,0.0033986564,0.0011333207,0.0009219759,0.38229138],"category_scores_gemma":[0.008749585,0.000276618,0.00054127176,0.0024649187,0.0006538682,0.002638268,0.0018805292,0.00280464,0.25896245],"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.000018576113,0.000014466263,0.00006314291,0.00006304784,0.0000017164529,0.00001971429,0.000040885945,0.000039941413,0.00007644716,0.0076025194,0.9592896,0.032769907],"study_design_scores_gemma":[0.0000031549391,0.0000060127372,0.00016982217,0.00006771596,0.0000017147873,0.000023955105,0.000039179376,0.00002948414,0.000079615915,0.0051572523,0.9944184,0.00000362954],"about_ca_topic_score_codex":0.0037895613,"about_ca_topic_score_gemma":0.0057277563,"teacher_disagreement_score":0.6177086,"about_ca_system_score_codex":0.0019711251,"about_ca_system_score_gemma":0.0018632094,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0213422,0.00028297628,0.9190298,0.0019238277,0.00047220665,0.000056358807,0.00017137082,0.0011338056,0.05558754],"genre_scores_gemma":[0.6842364,0.00071036327,0.28247094,0.0014454483,0.0005155907,0.00020929742,0.00040270295,0.0012175731,0.028791603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968022,0.0012507188,0.00022402864,0.00062680314,0.000619923,0.000476307],"domain_scores_gemma":[0.9926813,0.0027419014,0.00023645583,0.003307511,0.00075289694,0.00028000138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036659632,0.0008596072,0.0013392818,0.0024120535,0.002083645,0.0033801235,0.002118745,0.001960118,0.010020218],"category_scores_gemma":[0.015705427,0.00084917486,0.0021714515,0.0028933121,0.007133961,0.010517062,0.00987888,0.0047578863,0.0014141882],"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.000013011946,0.0000050725985,0.000037175138,0.000012623668,0.0000031302407,0.000015672102,0.000078106605,0.000572761,0.00021036297,0.99319,0.00054155756,0.0053204964],"study_design_scores_gemma":[0.000007106068,0.0000058180294,0.000024118674,0.000007225679,0.000008524298,0.00002541422,0.00003237682,0.0051513934,0.0005512699,0.9910419,0.0031368968,0.000007987616],"about_ca_topic_score_codex":0.0015009394,"about_ca_topic_score_gemma":0.0010556168,"teacher_disagreement_score":0.010020218,"about_ca_system_score_codex":0.0020573607,"about_ca_system_score_gemma":0.0011798958,"threshold_uncertainty_score":0.033520997},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28301114,0.0020630474,0.23651499,0.0049086204,0.0009437611,0.00010229565,0.0006787298,0.0008440322,0.47093338],"genre_scores_gemma":[0.9223688,0.0006444783,0.027337633,0.00076001394,0.0006146164,0.000096331554,0.000300194,0.00026678527,0.047611065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989906,0.0003222195,0.000057528865,0.00023063968,0.00023284508,0.00016615918],"domain_scores_gemma":[0.9978466,0.0010260697,0.00013666767,0.0005594476,0.00018901733,0.00024214864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013615368,0.0005177315,0.0012034235,0.0019005093,0.0027410057,0.0032017343,0.0011222262,0.0015610028,0.01056632],"category_scores_gemma":[0.0041829273,0.00070914207,0.0014958477,0.001189345,0.0043699,0.0070918133,0.0040746494,0.002687588,0.0011754748],"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.000011271897,0.0000039513816,0.000037546917,0.000006361763,0.0000022599265,0.000019445934,0.00006377621,0.00032184704,0.00012005071,0.9983108,0.00032264853,0.00078005774],"study_design_scores_gemma":[0.0000068325603,0.0000033425745,0.00005137314,0.0000039146207,0.0000035500136,0.000027043305,0.000032182506,0.0012093857,0.000117827556,0.9968599,0.0016786279,0.0000058952664],"about_ca_topic_score_codex":0.0015524551,"about_ca_topic_score_gemma":0.0017123878,"teacher_disagreement_score":0.01056632,"about_ca_system_score_codex":0.0016078516,"about_ca_system_score_gemma":0.0007253655,"threshold_uncertainty_score":0.03534788},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0669182,0.0091393525,0.4987834,0.011952226,0.006782741,0.000083861974,0.0006442291,0.0005750964,0.4051209],"genre_scores_gemma":[0.67209905,0.005056426,0.19675317,0.0036601932,0.008261355,0.00024836083,0.0006001471,0.0010670508,0.11225421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872005,0.00042527012,0.00008481232,0.00032787197,0.00034053955,0.00010150803],"domain_scores_gemma":[0.99781513,0.0010913276,0.00014197669,0.0004366139,0.00028754957,0.00022741838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030195853,0.0012259883,0.001164622,0.0031336395,0.002118139,0.003131848,0.0021344929,0.0017284269,0.01221904],"category_scores_gemma":[0.0053557386,0.00061812403,0.0014639393,0.004422651,0.006038402,0.010805822,0.0031312853,0.005814907,0.001868079],"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.0000110070005,0.0000058113333,0.000053277952,0.000012911193,0.0000029884498,0.000018791336,0.000074694864,0.00019881604,0.00017254437,0.992924,0.0014453026,0.0050797714],"study_design_scores_gemma":[0.000004775482,0.0000070513265,0.000088043926,0.000007774811,0.000005364796,0.00003759755,0.000021031305,0.0012928285,0.0001611437,0.9886367,0.009730696,0.000006997427],"about_ca_topic_score_codex":0.00065433234,"about_ca_topic_score_gemma":0.0007710316,"teacher_disagreement_score":0.01221904,"about_ca_system_score_codex":0.0022222297,"about_ca_system_score_gemma":0.00060525775,"threshold_uncertainty_score":0.040876746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73863524,0.0004807408,0.22779307,0.0004988044,0.000052962037,0.00005287382,0.00021110498,0.0002532581,0.032021984],"genre_scores_gemma":[0.96873003,0.00015045262,0.024283329,0.000060844144,0.000050549006,0.00004052649,0.00014780102,0.00004893513,0.006487574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929965,0.00013434174,0.000035210363,0.00015950145,0.00020165449,0.00016952096],"domain_scores_gemma":[0.9992632,0.00022550266,0.00013573874,0.00012095582,0.0001220713,0.00013249805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011890936,0.00045304556,0.00043101166,0.00090943376,0.00088012347,0.0012224552,0.0005849969,0.0004033923,0.0021347792],"category_scores_gemma":[0.0013211186,0.0002633877,0.00073717214,0.0006101409,0.0025718696,0.004306318,0.0023509848,0.0013951934,0.00032172506],"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.000038091373,0.00002224339,0.0006787928,0.000034611552,0.000009721163,0.00028098084,0.0004107612,0.0014742687,0.004715586,0.9881604,0.00019418144,0.0039804024],"study_design_scores_gemma":[0.000034981495,0.000188951,0.0017452801,0.000038598584,0.000037206693,0.0013052603,0.0007260432,0.026963225,0.014673877,0.9407897,0.01345754,0.00003935946],"about_ca_topic_score_codex":0.0005441344,"about_ca_topic_score_gemma":0.0005867794,"teacher_disagreement_score":0.0021347792,"about_ca_system_score_codex":0.001062484,"about_ca_system_score_gemma":0.000331496,"threshold_uncertainty_score":0.007708907},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35326412,0.005835606,0.39253077,0.0043552653,0.0015187596,0.00017896615,0.0007325425,0.0008296188,0.24075438],"genre_scores_gemma":[0.93914664,0.0011785766,0.03333982,0.00041911702,0.00044827868,0.00009871631,0.00025250268,0.00014266798,0.024973644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990138,0.0003027175,0.000076912074,0.00024998753,0.00019053284,0.00016603095],"domain_scores_gemma":[0.9979761,0.0009588686,0.0002571479,0.00028451954,0.00027017784,0.00025322134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016990451,0.0006679247,0.0009062682,0.0026413866,0.0029503664,0.0050542117,0.0012735376,0.0013849542,0.004929995],"category_scores_gemma":[0.0034139988,0.0008512959,0.0009732929,0.0020074665,0.0053908024,0.013329436,0.003514578,0.003468569,0.0006483328],"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.00004557573,0.000009577512,0.000109774315,0.00002039305,0.0000047909007,0.000060572565,0.00018824595,0.0002401836,0.00023507666,0.9969668,0.00021001336,0.0019090084],"study_design_scores_gemma":[0.000023818626,0.000010730593,0.000051659397,0.000012807553,0.0000079681195,0.00006946946,0.00011476867,0.0004920375,0.00026719834,0.99689376,0.0020514815,0.0000043049395],"about_ca_topic_score_codex":0.00090163783,"about_ca_topic_score_gemma":0.0008213776,"teacher_disagreement_score":0.0050542117,"about_ca_system_score_codex":0.001926069,"about_ca_system_score_gemma":0.0006285036,"threshold_uncertainty_score":0.016492486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8028717,0.00076632755,0.117184415,0.0011193773,0.00019901452,0.00007930979,0.00041974089,0.0003512368,0.077008955],"genre_scores_gemma":[0.9790323,0.0002620278,0.007178946,0.00012917309,0.00020480463,0.00008894835,0.000351682,0.000051652703,0.012700453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985341,0.00039457544,0.000107458574,0.000331254,0.00034696356,0.00028556862],"domain_scores_gemma":[0.99651873,0.00176296,0.00039086113,0.00033653132,0.00028265876,0.00070828607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012608147,0.0006667414,0.0012494201,0.002407561,0.0029014824,0.007587683,0.0015300697,0.0010597248,0.010081056],"category_scores_gemma":[0.0029546223,0.00092505215,0.0017546003,0.0018927095,0.0036122976,0.0062098172,0.003637718,0.0023471285,0.0005242147],"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.00007048185,0.000041535426,0.0005413814,0.000018109922,0.000022181,0.0002164804,0.00047078557,0.00076830294,0.00094643806,0.99507385,0.0002583916,0.0015720848],"study_design_scores_gemma":[0.000039962426,0.000033638134,0.000554902,0.00001009324,0.000026147485,0.00022307604,0.00031453997,0.0057239966,0.0006663175,0.9907829,0.0016085481,0.000015867996],"about_ca_topic_score_codex":0.00095101993,"about_ca_topic_score_gemma":0.000935771,"teacher_disagreement_score":0.010081056,"about_ca_system_score_codex":0.0013326401,"about_ca_system_score_gemma":0.00047932603,"threshold_uncertainty_score":0.033724487},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17783302,0.002423702,0.425906,0.005196354,0.0009306779,0.00007135167,0.0006059752,0.00094709184,0.38608584],"genre_scores_gemma":[0.8723907,0.00074995955,0.06951392,0.0010563338,0.00045158633,0.000096450516,0.000498025,0.00035029041,0.054892737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865013,0.00047057882,0.00005932818,0.00020874379,0.0003818776,0.00022941243],"domain_scores_gemma":[0.9972531,0.0012368247,0.00016454847,0.0004300356,0.00064456515,0.0002709057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018731279,0.00061700214,0.0010748145,0.002518236,0.0028487812,0.004248783,0.0018194381,0.0012756215,0.010664864],"category_scores_gemma":[0.0041301986,0.00087199104,0.0011133209,0.0024712556,0.00557179,0.00883725,0.0032537314,0.005037418,0.001298285],"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.000004475617,0.0000038191874,0.000028628288,0.0000037508403,0.0000013648923,0.00000793638,0.00007307073,0.00014974293,0.0000749153,0.998694,0.00024934186,0.00070898887],"study_design_scores_gemma":[0.000003827346,0.0000017571564,0.000044533757,0.0000041725675,0.0000028944348,0.000013546867,0.000038749164,0.0013809606,0.00006909203,0.99669456,0.0017424941,0.000003390055],"about_ca_topic_score_codex":0.0042700786,"about_ca_topic_score_gemma":0.005137327,"teacher_disagreement_score":0.010664864,"about_ca_system_score_codex":0.0032417236,"about_ca_system_score_gemma":0.0011401193,"threshold_uncertainty_score":0.035677493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029543662,0.00048091722,0.9290957,0.002039631,0.00045065765,0.00007777363,0.00032826402,0.0016738167,0.036309537],"genre_scores_gemma":[0.55959827,0.0011887453,0.40945318,0.0011840035,0.0003903338,0.0003365029,0.00084819586,0.0020340856,0.024966717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667203,0.0014246872,0.00022749713,0.000727453,0.0005807969,0.00036755606],"domain_scores_gemma":[0.9906199,0.0041905213,0.00038717513,0.0038372036,0.00052669575,0.00043849184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004633286,0.0008262439,0.00069979817,0.0015184488,0.0027349321,0.005186713,0.0031425178,0.002400196,0.012529005],"category_scores_gemma":[0.012930712,0.0013461084,0.0017454015,0.0025620258,0.0069142785,0.018151887,0.008817528,0.005637967,0.0034644557],"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.000029567955,0.000017552164,0.00012490028,0.000044547476,0.0000047283374,0.000034141016,0.00056062354,0.00045378818,0.00067169016,0.98173654,0.0018178474,0.014504018],"study_design_scores_gemma":[0.000017357384,0.000014691177,0.000078130404,0.000028477229,0.000013434818,0.00006792206,0.000112027796,0.0024119082,0.0013472451,0.98148924,0.014400954,0.00001851081],"about_ca_topic_score_codex":0.0008718586,"about_ca_topic_score_gemma":0.00068731874,"teacher_disagreement_score":0.012529005,"about_ca_system_score_codex":0.001505838,"about_ca_system_score_gemma":0.0014569126,"threshold_uncertainty_score":0.041913748},"labels":[],"label_agreement":null}]}