{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":65,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":65,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"68074938eee5","filters":{"venue":"Annals of Pure and Applied Logic"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Philip Kremer","is_ca":true},{"name":"Grigori Mint︠s︡","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03988905272719816,"gpt":0.2942966727551921,"spread":0.2544076200279939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009585489,0.0005242287,0.0006139164,0.001857402,0.001816265,0.004702372,0.0007156749,0.001070561,0.01433399],"category_scores_gemma":[0.002147745,0.0003417621,0.0005808533,0.001454246,0.004475961,0.007284318,0.001845357,0.003208598,0.002172613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002590013,"about_ca_system_score_gemma":0.001075169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001259899,"about_ca_topic_score_gemma":0.001234228,"domain_scores_codex":[0.999329,0.0001947265,0.00003204811,0.0001815803,0.0002046692,0.00005804868],"domain_scores_gemma":[0.9990552,0.0003079332,0.00006241144,0.0002303203,0.0002273176,0.0001167742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003057447,0.000002145618,0.00001874037,0.000005471686,0.000001307923,0.000005953217,0.00003268386,0.0001029862,0.0000556647,0.9957853,0.001779037,0.002207688],"study_design_scores_gemma":[0.000002971654,0.000003053262,0.00003855913,0.000007037108,0.000003092434,0.00003115869,0.00003453489,0.0007315335,0.0000920392,0.9686474,0.03040571,0.000003009422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02941241,0.01343364,0.2478905,0.02287766,0.001909036,0.00005201001,0.001106939,0.0006297525,0.6826881],"genre_scores_gemma":[0.7681749,0.007751324,0.05032687,0.002609022,0.002296155,0.0001396231,0.001344474,0.0003300947,0.1670276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01433399,"threshold_uncertainty_score":0.047952,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stephen J. Bellantoni","is_ca":true},{"name":"Karl-Heinz Niggl","is_ca":false},{"name":"Helmut Schwichtenberg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03763477329273652,"gpt":0.2673608311565192,"spread":0.2297260578637827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003495387,0.0006828666,0.001774927,0.001705566,0.002271158,0.006903004,0.002156753,0.002042198,0.008195356],"category_scores_gemma":[0.01146892,0.0009442911,0.001658568,0.003385049,0.010964,0.01881939,0.003128476,0.00957246,0.001157534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005054296,"about_ca_system_score_gemma":0.001837928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003640538,"about_ca_topic_score_gemma":0.003664682,"domain_scores_codex":[0.9972319,0.0007935326,0.0001313923,0.0006667422,0.0006589328,0.0005174687],"domain_scores_gemma":[0.9901968,0.006898188,0.0005673873,0.001382572,0.0005726783,0.0003822566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002401282,0.00001167257,0.000155869,0.00002762781,0.000003918994,0.00001687321,0.0001465722,0.0005044283,0.0001093191,0.9938973,0.0008819198,0.004220529],"study_design_scores_gemma":[0.000007173195,0.000003329749,0.00006384966,0.000006888783,0.000005012852,0.00002886811,0.00002092439,0.0009432351,0.00007359438,0.996974,0.001867743,0.000005395189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1922522,0.03288512,0.5121935,0.02215133,0.001392186,0.0000572852,0.0006445677,0.001434437,0.2369893],"genre_scores_gemma":[0.9217505,0.005804919,0.04377659,0.001409893,0.001758883,0.00005665264,0.0003101535,0.0002483128,0.02488406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008195356,"threshold_uncertainty_score":0.03667164,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Matthias Baaz","is_ca":false},{"name":"Norbert Preining","is_ca":false},{"name":"Richard Zach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04747162189864145,"gpt":0.2948686843336565,"spread":0.247397062435015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001287335,0.0005110389,0.0007260505,0.001661958,0.002026989,0.004189869,0.0009808999,0.0008705192,0.007322615],"category_scores_gemma":[0.001978238,0.0005117581,0.000765266,0.001685795,0.003803296,0.009724985,0.001599461,0.003370052,0.001044479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001723671,"about_ca_system_score_gemma":0.001026043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007870878,"about_ca_topic_score_gemma":0.001146473,"domain_scores_codex":[0.9993538,0.0001407923,0.00003824254,0.0001324588,0.0002504686,0.00008430696],"domain_scores_gemma":[0.9988673,0.000540064,0.00006399776,0.0001873003,0.0002070086,0.0001344392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008908724,0.000005495157,0.00004518566,0.00001223006,0.000003374512,0.00001172762,0.00007400373,0.0001198599,0.0001217761,0.9955444,0.001007685,0.003045406],"study_design_scores_gemma":[0.000003446139,0.000002012881,0.00004170395,0.000004615641,0.000004241941,0.00002745881,0.0000189996,0.0005925493,0.0001811299,0.9931264,0.00599378,0.000003640636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1051061,0.0162437,0.4925861,0.01553479,0.001562848,0.0000567293,0.0009789394,0.001331339,0.3665994],"genre_scores_gemma":[0.8745167,0.005159471,0.06296078,0.001152376,0.001371692,0.00003912505,0.000633656,0.0001601779,0.05400594],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007322615,"threshold_uncertainty_score":0.02449656,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Bernhard Banaschewski","is_ca":true},{"name":"Christopher J. Mulvey","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07318049852209535,"gpt":0.3400861599043922,"spread":0.2669056613822968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001804567,0.0007611006,0.001126843,0.001897324,0.001575267,0.003374538,0.000983694,0.001519612,0.01102492],"category_scores_gemma":[0.002435313,0.0004686154,0.001315128,0.001163823,0.006360315,0.01023782,0.004571928,0.004278568,0.001219799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135805,"about_ca_system_score_gemma":0.0005240284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004150439,"about_ca_topic_score_gemma":0.0003727193,"domain_scores_codex":[0.9991961,0.0002751375,0.0000353086,0.0002515248,0.0001538919,0.00008810114],"domain_scores_gemma":[0.9989474,0.0005060714,0.00006100272,0.000193622,0.0002066262,0.00008532348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004538643,0.00000346687,0.00002716263,0.00001091304,0.000002942547,0.00001827105,0.00005145966,0.00007386668,0.00009423171,0.9979457,0.0004924154,0.001274939],"study_design_scores_gemma":[0.00000729287,0.000004955433,0.00005811575,0.000006345795,0.000003446084,0.00004182672,0.00002634456,0.0003476285,0.00009727361,0.9949526,0.004451014,0.000003123779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05530208,0.005893091,0.4393612,0.01367622,0.001495053,0.00005533197,0.0005345235,0.0004161871,0.4832662],"genre_scores_gemma":[0.8564414,0.004082014,0.07230932,0.003862973,0.002211662,0.0001811368,0.0004616461,0.0004590274,0.05999075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01102492,"threshold_uncertainty_score":0.03688204,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pavel Hrubeš","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05842729758352427,"gpt":0.282818869212485,"spread":0.2243915716289607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02523203,0.001195229,0.002304612,0.006143659,0.004232652,0.009609416,0.005764653,0.00304957,0.01246022],"category_scores_gemma":[0.1308807,0.002629826,0.00197808,0.005234892,0.009846141,0.0439074,0.00699814,0.009114046,0.001236802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006934152,"about_ca_system_score_gemma":0.003219859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001312748,"about_ca_topic_score_gemma":0.002029258,"domain_scores_codex":[0.9856902,0.005519768,0.001293893,0.001905381,0.004161568,0.001429087],"domain_scores_gemma":[0.6131442,0.3394998,0.01735666,0.01287177,0.01005911,0.007068382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006459662,0.00008829011,0.003695753,0.0002667654,0.00008056129,0.00009533263,0.001242411,0.007515704,0.0006216113,0.9605599,0.001835811,0.02335182],"study_design_scores_gemma":[0.00003215938,0.0000331965,0.0005354412,0.00006398036,0.00005054568,0.00004325381,0.0001317354,0.01009699,0.0003813787,0.9873967,0.001207497,0.00002727219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3840699,0.01692446,0.5312909,0.01399066,0.0009723459,0.0002124865,0.002017082,0.001262436,0.0492598],"genre_scores_gemma":[0.9063351,0.005045577,0.07211572,0.001022866,0.001776201,0.0003259604,0.001032173,0.0009342864,0.0114121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02523203,"threshold_uncertainty_score":0.1334413,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"J.R.B. Cockett","is_ca":true},{"name":"Pieter Hofstra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04680070270485933,"gpt":0.2678986461075334,"spread":0.2210979434026741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009962759,0.0008434203,0.001160726,0.003413511,0.002420883,0.004061549,0.001088877,0.001590359,0.02450617],"category_scores_gemma":[0.003371249,0.0007146199,0.0009830587,0.004009274,0.006549979,0.007167874,0.002855367,0.005910259,0.007090834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002645588,"about_ca_system_score_gemma":0.001608251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001175622,"about_ca_topic_score_gemma":0.001502803,"domain_scores_codex":[0.9990609,0.0002903557,0.00005238811,0.0002343226,0.0002702248,0.00009175252],"domain_scores_gemma":[0.9984879,0.0008200911,0.00004514267,0.0002570912,0.0002596666,0.0001300638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000043884,0.000006306965,0.00004730584,0.00006171776,0.000004013813,0.00001393399,0.0001623869,0.0001463268,0.0001085771,0.9651636,0.02227498,0.01200637],"study_design_scores_gemma":[0.000002259357,0.000004473044,0.00009874615,0.00003927135,0.000003712501,0.00005874529,0.00003477676,0.0002460569,0.00008366782,0.7678422,0.2315794,0.000006688062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.006748931,0.1374633,0.1927157,0.03642326,0.01877081,0.00008750962,0.00151127,0.001194773,0.6050844],"genre_scores_gemma":[0.3426507,0.07511504,0.09080631,0.01535342,0.04456965,0.0006179149,0.00143879,0.001331715,0.4281164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02450617,"threshold_uncertainty_score":0.08198136,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Mathematics; Algebra over a field; Linear algebra; Discrete mathematics; Pure mathematics","authors":[{"name":"Michael Soltys","is_ca":true},{"name":"Stephen Cook","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1354314574645376,"gpt":0.3439368107145531,"spread":0.2085053532500155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005319368,0.0007041737,0.001823578,0.002111021,0.002427089,0.008533891,0.002846845,0.002111983,0.01226134],"category_scores_gemma":[0.03758774,0.001376018,0.001890085,0.00253034,0.006009982,0.02807445,0.003235223,0.0088194,0.001057464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005158889,"about_ca_system_score_gemma":0.003802861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002352126,"about_ca_topic_score_gemma":0.001925585,"domain_scores_codex":[0.9911106,0.003365231,0.000432348,0.001069881,0.003168424,0.0008535782],"domain_scores_gemma":[0.9081988,0.08108294,0.001931366,0.005094805,0.002332071,0.001360039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001422427,0.00007168738,0.0007451163,0.0001452992,0.00004911361,0.00004666682,0.0003514129,0.00828471,0.000567382,0.9717646,0.003624824,0.01420696],"study_design_scores_gemma":[0.00001795111,0.00000807495,0.0001928579,0.00001212402,0.00001594436,0.00002220885,0.00002798326,0.01712928,0.0002797732,0.9809668,0.001316039,0.00001097861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2873068,0.0112015,0.5169069,0.04800533,0.0007858751,0.0001691373,0.001864024,0.001226606,0.132534],"genre_scores_gemma":[0.9492985,0.002507616,0.03642552,0.0009010686,0.001310009,0.0001547018,0.0005716531,0.0002565013,0.008574462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01226134,"threshold_uncertainty_score":0.04101825,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Alexander Berenstein","is_ca":false},{"name":"Evgueni Vassiliev","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07450086488067305,"gpt":0.3445336953701432,"spread":0.2700328304894701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001504168,0.0007747491,0.001210601,0.00364598,0.005024107,0.005740304,0.001239405,0.002148585,0.01412348],"category_scores_gemma":[0.005402325,0.0009883351,0.001126813,0.002885077,0.00607563,0.01709902,0.005512538,0.005024663,0.001232599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001579389,"about_ca_system_score_gemma":0.0004828143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008002219,"about_ca_topic_score_gemma":0.0009119209,"domain_scores_codex":[0.9987391,0.0004857237,0.0000759828,0.000242515,0.0002857632,0.0001710428],"domain_scores_gemma":[0.9978533,0.0009664402,0.0002245018,0.0002961612,0.0003613311,0.0002982001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006508148,0.000003274647,0.00005107912,0.000007166791,0.00000173672,0.00002620936,0.0001896106,0.00004757807,0.00004267405,0.9983827,0.0004017393,0.0008396899],"study_design_scores_gemma":[0.000004124985,0.000005911215,0.00006792283,0.000007203803,0.000003869356,0.00008033117,0.0001556858,0.0002938205,0.00004890096,0.9959941,0.003333535,0.000004497011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2506959,0.004092955,0.2418598,0.008674261,0.001341626,0.0001385041,0.000649372,0.0003013045,0.4922463],"genre_scores_gemma":[0.8698664,0.002009487,0.03944438,0.001300804,0.0009737503,0.0002075141,0.0006150897,0.0002403393,0.08534228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01412348,"threshold_uncertainty_score":0.04724771,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Dilip Raghavan","is_ca":false},{"name":"Stevo Todorčević","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1596725945252372,"gpt":0.3416737533701869,"spread":0.1820011588449497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00422081,0.0009906518,0.001629461,0.00612438,0.004959197,0.009635049,0.00214619,0.002644096,0.006129595],"category_scores_gemma":[0.007884547,0.001931303,0.002213073,0.003712736,0.009447448,0.01875592,0.005747908,0.006370349,0.0008466532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002978098,"about_ca_system_score_gemma":0.001028583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001430898,"about_ca_topic_score_gemma":0.001440723,"domain_scores_codex":[0.9968036,0.0007852042,0.0002827552,0.0007011429,0.000842917,0.0005841776],"domain_scores_gemma":[0.9889516,0.00639517,0.0006215352,0.001312703,0.00163484,0.001084196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002841658,0.00001120456,0.0002560821,0.00001705378,0.000007019491,0.00004684945,0.0003358811,0.0001253168,0.0002256682,0.9973442,0.0002617794,0.001340539],"study_design_scores_gemma":[0.00001979373,0.0000141693,0.0003059534,0.0000137941,0.00002175173,0.0001267649,0.0001957415,0.0009555932,0.0005342013,0.9941424,0.003652483,0.00001733713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3783108,0.00654418,0.4530698,0.004196261,0.001342512,0.0001231786,0.0009491045,0.0007915505,0.1546725],"genre_scores_gemma":[0.9402161,0.001176553,0.02574322,0.0004955334,0.0008355402,0.0001412855,0.0005289812,0.000199379,0.03066327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009635049,"threshold_uncertainty_score":0.02232206,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Richard Blute","is_ca":true},{"name":"Masahiro Hamano","is_ca":false},{"name":"Philip Scott","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0718893980317534,"gpt":0.279939365076578,"spread":0.2080499670448246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005633467,0.0006282889,0.001883204,0.003279063,0.003589849,0.00760353,0.002241764,0.002295922,0.01008407],"category_scores_gemma":[0.01976725,0.001348381,0.002117347,0.002554855,0.01057516,0.02105524,0.007379969,0.007609473,0.0009339552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002647489,"about_ca_system_score_gemma":0.001826916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001255606,"about_ca_topic_score_gemma":0.001295099,"domain_scores_codex":[0.9943036,0.001524642,0.0005822145,0.001256116,0.001592285,0.0007410987],"domain_scores_gemma":[0.9758055,0.01452521,0.001360326,0.003842335,0.002978952,0.001487801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006025225,0.00002155025,0.0004156985,0.00004617793,0.00002214968,0.00005926497,0.000307059,0.0004811479,0.0003434612,0.9939055,0.0006343205,0.003703408],"study_design_scores_gemma":[0.00001478664,0.000006455874,0.0001276236,0.000009565069,0.00001084095,0.00004200732,0.00007728723,0.001191065,0.0002763339,0.9975326,0.0007002882,0.00001119034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4073161,0.002951889,0.4620314,0.01083005,0.0005292986,0.0001539589,0.001227291,0.0007795522,0.1141805],"genre_scores_gemma":[0.9580919,0.0006312921,0.02606289,0.001070915,0.0005883868,0.0001307872,0.0004465228,0.0001620552,0.01281518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01008407,"threshold_uncertainty_score":0.03373456,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Salma Kuhlmann","is_ca":true},{"name":"Saharon Shelah","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03017010441414629,"gpt":0.2832738904449643,"spread":0.253103786030818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008140082,0.00104301,0.0007575012,0.002127941,0.0008057722,0.004651579,0.002156802,0.001249558,0.4552853],"category_scores_gemma":[0.003846684,0.0008402017,0.0006718545,0.003340279,0.000583102,0.006899014,0.001611924,0.002624275,0.3380972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001912929,"about_ca_system_score_gemma":0.001044749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005059446,"about_ca_topic_score_gemma":0.005778739,"domain_scores_codex":[0.9995327,0.00008716622,0.0000538941,0.00007433479,0.0002087805,0.00004316576],"domain_scores_gemma":[0.9981136,0.000533946,0.0001202866,0.0005014272,0.0005828763,0.0001477913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007050468,0.00002899606,0.0001459679,0.0002678593,0.000007243851,0.00004349139,0.0001283852,0.0003146872,0.001966647,0.09061112,0.8608825,0.04553259],"study_design_scores_gemma":[0.00003570162,0.000009559923,0.0004742287,0.00006030711,0.000005491278,0.0001136786,0.00004486292,0.001986802,0.004580445,0.04006837,0.9525893,0.00003121935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.002314565,0.0005107031,0.2265634,0.006355255,0.001274906,0.0002502937,0.1317185,0.1054882,0.5255241],"genre_scores_gemma":[0.04175233,0.001935407,0.1611448,0.003089036,0.0010792,0.0007097613,0.1769965,0.08859453,0.5246984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4552853,"threshold_uncertainty_score":0.7769694,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Miloš S. Kurilić","is_ca":false},{"name":"Stevo Todorčević","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08136030827582773,"gpt":0.3570536708259919,"spread":0.2756933625501641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00277861,0.0007287043,0.001743272,0.002359301,0.003734031,0.00452473,0.0009895939,0.001478702,0.008639893],"category_scores_gemma":[0.005235414,0.001112677,0.00219442,0.001809523,0.007526008,0.01281828,0.005065335,0.004712369,0.0009507037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001667325,"about_ca_system_score_gemma":0.0008623296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005648634,"about_ca_topic_score_gemma":0.000783188,"domain_scores_codex":[0.9981281,0.0005740035,0.0001656416,0.0004638173,0.0004734583,0.0001950183],"domain_scores_gemma":[0.9936778,0.003755592,0.0003398163,0.0011463,0.0005527662,0.0005277148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001066453,0.000004604555,0.00006002909,0.00001124224,0.00000472885,0.00002673874,0.0001099578,0.0001684422,0.0001479998,0.9985144,0.0001675701,0.0007735414],"study_design_scores_gemma":[0.000007186785,0.000003624428,0.0000496501,0.000004101465,0.000004357081,0.00005596004,0.0000289924,0.0006014507,0.00009156154,0.9979973,0.001151888,0.000003899484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.285932,0.004459584,0.4806644,0.007646935,0.001246838,0.00007923236,0.0006153815,0.0005354775,0.2188202],"genre_scores_gemma":[0.9289305,0.001148148,0.03631245,0.0006707128,0.0009388966,0.0001103942,0.0003181547,0.0001598613,0.0314108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008639893,"threshold_uncertainty_score":0.02890337,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ivo Düntsch","is_ca":true},{"name":"Ewa Orłowska","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03007391690818214,"gpt":0.2580779595995045,"spread":0.2280040426913223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302272,0.0007914886,0.001439364,0.003160706,0.002115017,0.007813755,0.001208678,0.002157087,0.008002457],"category_scores_gemma":[0.007435151,0.0007841277,0.001277362,0.004181773,0.004282802,0.01351876,0.002749407,0.004680836,0.001249841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002786871,"about_ca_system_score_gemma":0.001326492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001072382,"about_ca_topic_score_gemma":0.0008833324,"domain_scores_codex":[0.9980197,0.0006242157,0.0001525931,0.0002242351,0.0007981712,0.0001809777],"domain_scores_gemma":[0.9967698,0.00204819,0.0002519864,0.0002573579,0.0004513473,0.0002213966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003809532,0.000003186038,0.00002073981,0.00001389084,0.00000235935,0.00001492438,0.00004479089,0.0001514277,0.00005398101,0.9981729,0.0003815366,0.001136396],"study_design_scores_gemma":[0.000002421852,0.000001160616,0.000009614926,0.00000342217,0.000002353888,0.00001978211,0.00001138632,0.0009824436,0.00004339103,0.9977822,0.00113984,0.000002144182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1173307,0.01923583,0.6098264,0.01943042,0.001836459,0.00016814,0.001352558,0.0005925545,0.2302269],"genre_scores_gemma":[0.8947834,0.009400022,0.0520535,0.00219573,0.002595051,0.0002191514,0.0008402397,0.0001495064,0.03776328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008002457,"threshold_uncertainty_score":0.02677089,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Antonina Kolokolova","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03015922952910509,"gpt":0.2645998596941179,"spread":0.2344406301650128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002179967,0.0008987808,0.001986417,0.002042701,0.002383061,0.006029017,0.003532184,0.001693218,0.008442881],"category_scores_gemma":[0.005992429,0.001069031,0.003359507,0.001723483,0.003609185,0.009100276,0.005377519,0.004462021,0.002594102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002973073,"about_ca_system_score_gemma":0.002781891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009750141,"about_ca_topic_score_gemma":0.01221394,"domain_scores_codex":[0.9970805,0.0004452426,0.0003688605,0.0007664689,0.0009288924,0.000410086],"domain_scores_gemma":[0.9970359,0.001262814,0.0001347183,0.0007490487,0.0005827881,0.0002349255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001701742,0.00007694906,0.0004061487,0.0001512966,0.00004404693,0.0001594061,0.0005260601,0.009541546,0.003083827,0.9481313,0.003799767,0.03390947],"study_design_scores_gemma":[0.0001280528,0.00007902539,0.000234928,0.00004236513,0.0001314222,0.0001300497,0.0001071226,0.168494,0.005704373,0.8072465,0.01761406,0.00008815381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01117423,0.0001486298,0.9778706,0.0004341248,0.0001561874,0.0001444063,0.0004118698,0.002368222,0.007291675],"genre_scores_gemma":[0.3104464,0.0002498509,0.6765533,0.0004340131,0.0001714345,0.0003094969,0.001117294,0.0005114898,0.01020685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009750141,"threshold_uncertainty_score":0.02824426,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Finitary; Countable set; Mathematics; Separable space; Discrete mathematics; Quotient; Pure mathematics; Mathematical analysis","authors":[{"name":"Christopher J. Eagle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03643875998669305,"gpt":0.2794287398301802,"spread":0.2429899798434871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005915013,0.001545224,0.001155223,0.001827769,0.003177391,0.00723485,0.003196557,0.001827044,0.03415681],"category_scores_gemma":[0.01755996,0.001677791,0.002036953,0.002099882,0.003603891,0.01731466,0.00424262,0.007137509,0.01860544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002315021,"about_ca_system_score_gemma":0.002223416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001759305,"about_ca_topic_score_gemma":0.002984091,"domain_scores_codex":[0.9956921,0.001354443,0.0006769316,0.0007248384,0.001052752,0.0004989867],"domain_scores_gemma":[0.9892218,0.004408727,0.0004522439,0.003310439,0.002356347,0.0002504148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001312164,0.00002602653,0.0003439359,0.0003064291,0.00001640901,0.0002418424,0.0005987161,0.0005078697,0.001327934,0.9341355,0.03400988,0.02835412],"study_design_scores_gemma":[0.00004445455,0.00003297337,0.0002210058,0.0002563712,0.0000600333,0.000570611,0.0002713572,0.004118618,0.008112191,0.6665876,0.3196568,0.00006786297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008034651,0.001187554,0.8422709,0.00340048,0.006607504,0.0001479976,0.003523012,0.006949049,0.1278789],"genre_scores_gemma":[0.2902155,0.002212535,0.5065764,0.003733251,0.00220658,0.0006118801,0.007837164,0.01437272,0.172234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03415681,"threshold_uncertainty_score":0.1142659,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Emil Jeřábek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04791883066781888,"gpt":0.2739468383898415,"spread":0.2260280077220226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00312236,0.001215892,0.001334857,0.003370116,0.003287964,0.005654905,0.002692002,0.002384406,0.01504506],"category_scores_gemma":[0.007422471,0.001201193,0.002411744,0.002207228,0.004018527,0.01294173,0.006303594,0.005201523,0.002051838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003095422,"about_ca_system_score_gemma":0.001290244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004108,"about_ca_topic_score_gemma":0.005977805,"domain_scores_codex":[0.9977247,0.0006894135,0.0001901198,0.0004566332,0.0005304146,0.000408727],"domain_scores_gemma":[0.997422,0.001353194,0.000152852,0.0005723532,0.0003533993,0.0001461549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002654417,0.00001345127,0.00007845601,0.00002693587,0.00001285908,0.00004772773,0.000182111,0.00231523,0.0002675046,0.9873125,0.001100738,0.008615824],"study_design_scores_gemma":[0.000009495286,0.000005246276,0.00002869784,0.00001545682,0.00001062021,0.00002542047,0.00005513742,0.009326467,0.0001935307,0.9865597,0.003757261,0.00001291853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03250916,0.002635363,0.9155447,0.001775127,0.0003286916,0.0001889629,0.0004456734,0.001386434,0.04518593],"genre_scores_gemma":[0.59272,0.002052156,0.3625562,0.0009312111,0.0005066459,0.00038549,0.001236376,0.0005314735,0.03908055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01504506,"threshold_uncertainty_score":0.0503307,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Linear logic; Multiplicative function; Mathematics; Completeness (order theory); Discrete mathematics; Mathematical analysis","authors":[{"name":"Masahiro Hamano","is_ca":false},{"name":"Philip Scott","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02572994973243501,"gpt":0.2535003448029045,"spread":0.2277703950704695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959304,0.000593589,0.0005358472,0.001905851,0.003370213,0.006648333,0.002093914,0.001750287,0.01843592],"category_scores_gemma":[0.00275633,0.0007223623,0.001372952,0.001857589,0.004069494,0.008337702,0.003799334,0.003929178,0.004486644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002765949,"about_ca_system_score_gemma":0.002098374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004074709,"about_ca_topic_score_gemma":0.004518458,"domain_scores_codex":[0.9979625,0.0006165263,0.0001934676,0.000413061,0.0005074634,0.0003069818],"domain_scores_gemma":[0.9972247,0.0007991121,0.0001556392,0.0004638663,0.0009410756,0.0004156854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001198117,0.00001165773,0.00006409966,0.0000176481,0.00000210555,0.0000257582,0.0002631093,0.000122056,0.0004108625,0.993316,0.002816192,0.002938606],"study_design_scores_gemma":[0.00002752642,0.00002320646,0.0001959638,0.00003920816,0.0000128832,0.00016293,0.0005419973,0.002633213,0.001336442,0.9008144,0.09418301,0.00002924036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01602132,0.0007874354,0.8335339,0.006955094,0.001216231,0.0001433281,0.002778219,0.002759708,0.1358047],"genre_scores_gemma":[0.5721635,0.001037707,0.3553521,0.002753714,0.001064925,0.0006043338,0.004184153,0.001686843,0.06115282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01843592,"threshold_uncertainty_score":0.0616743,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Basis (linear algebra); Calculus (dental); Geometry","authors":[{"name":"Ilijas Farah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1746205063929031,"gpt":0.37335779319423,"spread":0.1987372868013269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070561,0.00104158,0.001586724,0.001835208,0.002801588,0.003277829,0.001424912,0.002414789,0.01028593],"category_scores_gemma":[0.002890103,0.0006165395,0.001578868,0.001159272,0.004319231,0.006222265,0.003800764,0.004461333,0.0009312255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001705777,"about_ca_system_score_gemma":0.001494045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00229845,"about_ca_topic_score_gemma":0.001476803,"domain_scores_codex":[0.999511,0.0001205715,0.00002527212,0.00009246318,0.0001095294,0.0001412493],"domain_scores_gemma":[0.9990042,0.0003653264,0.000124535,0.00009865632,0.0001188662,0.0002884435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000132183,0.000006305511,0.00004285572,0.0000104646,0.000003477223,0.00001494451,0.00006126581,0.0006391772,0.00009466094,0.9977654,0.0005711272,0.0007771145],"study_design_scores_gemma":[0.000008243289,0.000007481167,0.00004583085,0.00000716777,0.000003026215,0.00001494134,0.00006501564,0.005855343,0.0000662028,0.9932005,0.0007198278,0.000006493133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4298151,0.002543235,0.4069329,0.00685148,0.001122181,0.0001119607,0.0005985032,0.000602056,0.1514226],"genre_scores_gemma":[0.9181256,0.001344884,0.02860402,0.0007271831,0.000623393,0.0001433349,0.0005117275,0.0002570748,0.04966274],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01028593,"threshold_uncertainty_score":0.03440988,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Lipschitz continuity; Order (exchange); Scroll; Algorithm; Discrete mathematics; Pure mathematics; Theology","authors":[{"name":"Andreas Fischer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02750163434388047,"gpt":0.2733949552202487,"spread":0.2458933208763682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008240595,0.0007943189,0.000729137,0.001552195,0.001093327,0.004081029,0.00104893,0.0007221843,0.2709052],"category_scores_gemma":[0.002401946,0.0006110286,0.0008115488,0.00193629,0.0008355747,0.005001587,0.00197934,0.001935889,0.2262001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001850953,"about_ca_system_score_gemma":0.001442028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004382798,"about_ca_topic_score_gemma":0.006241262,"domain_scores_codex":[0.999511,0.00009140634,0.00005023086,0.0001010023,0.0001739032,0.00007239012],"domain_scores_gemma":[0.9990746,0.0001793005,0.00005307952,0.0002434364,0.0002992167,0.0001503363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000158075,0.0000493019,0.0003737777,0.0002489184,0.00001026494,0.00008439706,0.0003370334,0.0003702461,0.004998235,0.1965743,0.7166698,0.08012562],"study_design_scores_gemma":[0.00002601496,0.00001438738,0.0005626754,0.00003606942,0.000007316356,0.00009391436,0.00007650695,0.0009870073,0.003466684,0.05735293,0.9373507,0.00002568348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.005036149,0.0004063767,0.1997397,0.004512899,0.0009372361,0.0002829809,0.03097098,0.04520387,0.7129098],"genre_scores_gemma":[0.07845039,0.001485784,0.1584721,0.001423579,0.0006904633,0.000474175,0.06083766,0.03704445,0.6611214],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2709052,"threshold_uncertainty_score":0.9062681,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Arnold W. Miller","is_ca":false},{"name":"Juris Steprāns","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06568592897368486,"gpt":0.3603924315277249,"spread":0.29470650255404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002495656,0.0012028,0.002651019,0.001306798,0.002807796,0.00634171,0.002362185,0.003646456,0.01542812],"category_scores_gemma":[0.01666423,0.001543294,0.00181979,0.001149128,0.0047073,0.01570197,0.004068161,0.004342951,0.002009836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001380401,"about_ca_system_score_gemma":0.0009333608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004610227,"about_ca_topic_score_gemma":0.0004714669,"domain_scores_codex":[0.9974331,0.0005167634,0.000325103,0.0005550071,0.0007132708,0.0004567134],"domain_scores_gemma":[0.9754125,0.0171349,0.001683863,0.001468952,0.001299594,0.003000174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002637171,0.0003311307,0.00545394,0.0004151419,0.0001602989,0.001070779,0.001616792,0.007750541,0.0453031,0.9127812,0.003596399,0.01888347],"study_design_scores_gemma":[0.0003690966,0.0005891705,0.005652114,0.00007906481,0.0002104755,0.001777488,0.001525387,0.03988625,0.03306827,0.9099577,0.006753127,0.0001318755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8976281,0.0002955827,0.07101943,0.002349978,0.0003088185,0.00008880963,0.0007461364,0.0004355531,0.02712757],"genre_scores_gemma":[0.9614811,0.00027116,0.02771301,0.0002594887,0.0003962098,0.0001893186,0.001413651,0.0003032379,0.007972774],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01542812,"threshold_uncertainty_score":0.0516122,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pieter Hofstra","is_ca":true},{"name":"Michael A. Warren","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07758309245407317,"gpt":0.326762809574957,"spread":0.2491797171208838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001524878,0.00075425,0.001185568,0.001810742,0.002270542,0.007078392,0.002019239,0.001936773,0.009584235],"category_scores_gemma":[0.003176111,0.0008135177,0.001230633,0.002129043,0.00740865,0.01057953,0.002055591,0.003861678,0.0006389149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002252132,"about_ca_system_score_gemma":0.0009543851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002070166,"about_ca_topic_score_gemma":0.002308908,"domain_scores_codex":[0.9990371,0.0003849223,0.00005953871,0.0001480625,0.0002522061,0.0001180518],"domain_scores_gemma":[0.9977296,0.001296151,0.000215659,0.0003329379,0.0002103132,0.0002154436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004534415,0.000005870173,0.0000757542,0.000005981803,0.000002075973,0.00001681022,0.00006733934,0.0002683745,0.0000357017,0.9990834,0.0001128274,0.0003214128],"study_design_scores_gemma":[0.000006300529,0.000001929033,0.00004016677,0.000002720468,0.000003007794,0.00001350238,0.00004085097,0.001457495,0.00002459109,0.998032,0.0003748608,0.000002579562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3715369,0.003673004,0.3170388,0.008183982,0.0004581327,0.000107538,0.001028011,0.0004739159,0.2974998],"genre_scores_gemma":[0.9721495,0.0005934409,0.01355763,0.0002193444,0.0003774263,0.00007084695,0.0003280729,0.0000599517,0.01264379],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009584235,"threshold_uncertainty_score":0.03206253,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"David Asperó","is_ca":false},{"name":"Miguel Ángel Mota","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.239504839658985,"gpt":0.4015562130680431,"spread":0.1620513734090581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009276629,0.0008105491,0.002597067,0.002102354,0.003262085,0.006634218,0.003827775,0.00423168,0.007550518],"category_scores_gemma":[0.047065,0.001718618,0.002488024,0.001535295,0.008520769,0.01859732,0.01139985,0.008144773,0.0009343219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001672834,"about_ca_system_score_gemma":0.002222396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001490859,"about_ca_topic_score_gemma":0.002579592,"domain_scores_codex":[0.9930727,0.002318632,0.0004959854,0.001398497,0.001607068,0.001107118],"domain_scores_gemma":[0.9443503,0.04047407,0.002066067,0.008226182,0.002715437,0.002167929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004300145,0.00002165168,0.0003898106,0.00003257055,0.00001801738,0.0001125428,0.0001838607,0.001990454,0.0002349335,0.9943302,0.0003984719,0.002244539],"study_design_scores_gemma":[0.00001537691,0.000006450898,0.0000728743,0.00001128503,0.00001074139,0.00003958145,0.00004282417,0.01040423,0.0001856939,0.9888465,0.000355693,0.000008697106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.23061,0.0006495367,0.6965454,0.004031097,0.0002567925,0.0001150769,0.0003681787,0.0006097319,0.06681419],"genre_scores_gemma":[0.9184683,0.0002555964,0.0709565,0.0005340747,0.0002126848,0.00008133461,0.0002744368,0.0002379493,0.008979027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009276629,"threshold_uncertainty_score":0.04906011,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Alexei Myasnikov","is_ca":true},{"name":"Mahmood Sohrabi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2261126910258873,"gpt":0.3534014375907391,"spread":0.1272887465648518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008206493,0.0007260387,0.0009921904,0.001791184,0.002511306,0.003887766,0.001129922,0.001174747,0.01078417],"category_scores_gemma":[0.002388845,0.0004166804,0.0009846438,0.0008746856,0.00514015,0.005812978,0.003241503,0.00297402,0.001308212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001069893,"about_ca_system_score_gemma":0.0008942338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006101095,"about_ca_topic_score_gemma":0.0005607143,"domain_scores_codex":[0.9986846,0.0003301599,0.00008312597,0.0002244412,0.0003530713,0.0003245485],"domain_scores_gemma":[0.9981273,0.0007414505,0.0002228723,0.0002574018,0.0002647919,0.0003862537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001060262,0.00003638378,0.0001387092,0.00001699003,0.00001533262,0.0001157078,0.000389233,0.0003757771,0.001058563,0.9954684,0.0003803278,0.001898448],"study_design_scores_gemma":[0.00003259946,0.00004846302,0.0001576142,0.000005889181,0.00001422704,0.0001290425,0.0002376839,0.001001274,0.001133261,0.9946539,0.002570682,0.00001522695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6783046,0.0005030152,0.1171281,0.002724563,0.0008526213,0.0001387618,0.0003926444,0.0005306815,0.199425],"genre_scores_gemma":[0.9649056,0.0001279246,0.008722437,0.0004106078,0.0003970338,0.0000571555,0.0003013905,0.00005932207,0.02501849],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01078417,"threshold_uncertainty_score":0.03607666,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Moritz Müller","is_ca":false},{"name":"Ján Pich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03561292216084491,"gpt":0.2667928805127758,"spread":0.2311799583519309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007570582,0.003226498,0.002142134,0.002750503,0.002454196,0.008648285,0.006214592,0.003005289,0.02445405],"category_scores_gemma":[0.05831847,0.003164476,0.003755066,0.003261068,0.005964531,0.01770917,0.01101387,0.01330464,0.004108591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004000288,"about_ca_system_score_gemma":0.003342971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001173501,"about_ca_topic_score_gemma":0.00301733,"domain_scores_codex":[0.9878426,0.004769697,0.0006712208,0.001401867,0.004224575,0.001090076],"domain_scores_gemma":[0.8962344,0.08766724,0.001497738,0.009514568,0.004016296,0.001069634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004149233,0.0003069681,0.0005217711,0.0007510166,0.0001758398,0.0002379434,0.0006213732,0.0196539,0.003955376,0.9142445,0.01305568,0.04606054],"study_design_scores_gemma":[0.0001052812,0.00003407753,0.000107982,0.0001005008,0.00009819221,0.00007501253,0.00006872713,0.03328498,0.003829312,0.9566602,0.005604452,0.00003122884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02675246,0.00121075,0.9121974,0.007939999,0.0007021958,0.0003926146,0.001698376,0.00337253,0.04573378],"genre_scores_gemma":[0.5727255,0.001747341,0.393173,0.004481355,0.001430479,0.001189126,0.003097537,0.002231768,0.01992395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02445405,"threshold_uncertainty_score":0.08180696,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Neil Thapen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04767424812238859,"gpt":0.2869142189680694,"spread":0.2392399708456808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001627084,0.0009495595,0.001159811,0.002104115,0.00244849,0.007571345,0.001811588,0.00231826,0.007564279],"category_scores_gemma":[0.006666654,0.001229673,0.001820829,0.002280229,0.006186408,0.01390237,0.003220293,0.005700434,0.0008667525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002681061,"about_ca_system_score_gemma":0.001291889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002165361,"about_ca_topic_score_gemma":0.00266358,"domain_scores_codex":[0.9982256,0.0006502931,0.0001433212,0.0002784782,0.0004553427,0.0002470504],"domain_scores_gemma":[0.995586,0.00262256,0.0004166429,0.0006849726,0.0004916897,0.0001980167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001819294,0.000009201525,0.00007158543,0.0000207521,0.000005899646,0.00004149813,0.000245783,0.001021649,0.0002444714,0.9968965,0.0003451026,0.001079485],"study_design_scores_gemma":[0.000007747765,0.000003131336,0.0000266044,0.000007499444,0.000005427906,0.00001457911,0.00004914807,0.002484241,0.0001437647,0.996347,0.0009066604,0.000004163748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2453651,0.002144336,0.6321393,0.00645435,0.0004733761,0.0001595381,0.001517305,0.001959652,0.109787],"genre_scores_gemma":[0.9279338,0.0006603868,0.05810006,0.0006059537,0.0003012205,0.0001568316,0.001132538,0.000231653,0.01087757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007571345,"threshold_uncertainty_score":0.02530503,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Miloš S. Kurilić","is_ca":false},{"name":"Stevo Todorčević","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0890163147516098,"gpt":0.3153717330286391,"spread":0.2263554182770293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510797,0.001450465,0.002037715,0.002436472,0.002357428,0.00510264,0.001662796,0.00219392,0.01401166],"category_scores_gemma":[0.005562812,0.0009930094,0.00197374,0.001565178,0.005193956,0.01177447,0.00488823,0.003540454,0.002423894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006176744,"about_ca_system_score_gemma":0.0008305823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005838953,"about_ca_topic_score_gemma":0.0004398763,"domain_scores_codex":[0.9976282,0.0006401362,0.0001065375,0.0009018969,0.0003268951,0.0003963553],"domain_scores_gemma":[0.993423,0.003096357,0.001021192,0.0009032444,0.0006127821,0.000943438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008636859,0.00004716784,0.0003902347,0.00006698909,0.00002631512,0.0001847761,0.0004119906,0.0008734647,0.001264681,0.9900038,0.001863455,0.004780697],"study_design_scores_gemma":[0.00004044112,0.00005479636,0.0003481307,0.00001396443,0.00001759894,0.0003936985,0.0001435376,0.004921339,0.0009997057,0.9899194,0.003114894,0.00003261703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3396938,0.001400862,0.5565006,0.0071387,0.0007331924,0.0001838596,0.001843077,0.00170681,0.09079913],"genre_scores_gemma":[0.9396556,0.0009561305,0.02196578,0.001515492,0.0009266521,0.0004318455,0.001485208,0.0004396177,0.03262354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01401166,"threshold_uncertainty_score":0.04687363,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Isaac Gorelic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06100663339937409,"gpt":0.3483265469893879,"spread":0.2873199135900139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002599915,0.0004926853,0.001156954,0.001944432,0.003441172,0.00569727,0.000864128,0.00180325,0.005868353],"category_scores_gemma":[0.005797253,0.0009234516,0.001021937,0.002412425,0.007374068,0.01307304,0.002605655,0.004887752,0.0006097026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002142849,"about_ca_system_score_gemma":0.001440885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002091052,"about_ca_topic_score_gemma":0.003528592,"domain_scores_codex":[0.9986801,0.0004145378,0.0001354466,0.0002847542,0.0002554644,0.0002296189],"domain_scores_gemma":[0.9919049,0.005329189,0.0004468111,0.000727109,0.001043926,0.0005479489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003253439,0.00001201213,0.0002790128,0.00001668468,0.000004070443,0.00005321413,0.0001690901,0.0003016675,0.0002244748,0.9974588,0.0002523554,0.001196065],"study_design_scores_gemma":[0.00001136913,0.000006080145,0.0001737849,0.000007272138,0.000006999713,0.0000432747,0.00008473131,0.000907827,0.0002708182,0.9970374,0.001444833,0.000005676422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5473564,0.003038274,0.1904743,0.005307497,0.0004073214,0.0000720734,0.0006990389,0.0003137158,0.2523316],"genre_scores_gemma":[0.9768842,0.0006923034,0.009988216,0.0002787962,0.0002826352,0.00004957727,0.0003533351,0.00007447265,0.01139647],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005868353,"threshold_uncertainty_score":0.01963156,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"J. Lambek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05969010755121887,"gpt":0.2905512454920389,"spread":0.23086113794082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004215486,0.0004486514,0.001217404,0.002424683,0.003792564,0.01506901,0.001217355,0.003286025,0.007180307],"category_scores_gemma":[0.01097828,0.0004843587,0.0006564779,0.003452878,0.02108774,0.02781909,0.001948438,0.007012646,0.001520524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002520165,"about_ca_system_score_gemma":0.002578989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002850566,"about_ca_topic_score_gemma":0.001972418,"domain_scores_codex":[0.9972921,0.001565526,0.00009748718,0.0003837864,0.0004801683,0.0001809246],"domain_scores_gemma":[0.9912322,0.005369477,0.0006421821,0.0009942194,0.001055199,0.0007066203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001858959,0.00001389816,0.0002871168,0.00007346921,0.00001283816,0.00002293676,0.0004490014,0.0001983849,0.00006745065,0.9771782,0.01280313,0.008874964],"study_design_scores_gemma":[0.000004761151,0.000003609025,0.0001800692,0.00006682056,0.000005197332,0.00002917379,0.0003733772,0.0002319247,0.00002503939,0.9476112,0.0514616,0.000007308774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.0218089,0.2018025,0.03709956,0.5772589,0.008668941,0.00001975085,0.0008453598,0.0001888455,0.1523073],"genre_scores_gemma":[0.7558591,0.1305848,0.01488505,0.04046277,0.03360472,0.0001280366,0.0005118279,0.0002198772,0.02374383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01506901,"threshold_uncertainty_score":0.02402049,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Philip Kremer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03521211998771567,"gpt":0.2953889388376347,"spread":0.260176818849919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006425134,0.00067626,0.0006564769,0.003546623,0.003265802,0.005087009,0.0008442255,0.001282373,0.0492895],"category_scores_gemma":[0.002061993,0.0004033708,0.0008975368,0.001803219,0.003003567,0.006652955,0.002838497,0.002205392,0.005793689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002243805,"about_ca_system_score_gemma":0.0009594749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001700434,"about_ca_topic_score_gemma":0.001773599,"domain_scores_codex":[0.9991522,0.0001514946,0.00004869417,0.0002820653,0.0002179732,0.0001475657],"domain_scores_gemma":[0.9988122,0.0002212532,0.000122083,0.0002313748,0.0004078366,0.0002053036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001196396,0.000005323841,0.00005717128,0.0000109973,0.000002648463,0.00001880936,0.00005538319,0.0001337054,0.0001663233,0.9944185,0.002331943,0.002787264],"study_design_scores_gemma":[0.000009388897,0.0000126788,0.0001644085,0.00001194451,0.000007224329,0.0001320743,0.0001390936,0.001560058,0.0003743096,0.9574686,0.04011019,0.00001003992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0992574,0.001212909,0.1609061,0.00655427,0.001028153,0.00009809882,0.002479927,0.001082967,0.7273802],"genre_scores_gemma":[0.7528014,0.001146056,0.03857739,0.001555102,0.0007830489,0.0001466112,0.003234264,0.0006546338,0.2011015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0492895,"threshold_uncertainty_score":0.1648898,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"István Juhász","is_ca":false},{"name":"William Weiss","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07796418073834574,"gpt":0.3447096966707588,"spread":0.2667455159324131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007929443,0.0007021169,0.000658533,0.002798951,0.002524319,0.004349782,0.0007042502,0.0008670159,0.03015957],"category_scores_gemma":[0.002441542,0.000522907,0.0006239637,0.002336895,0.002543162,0.007790825,0.002078611,0.003557991,0.008400262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001575166,"about_ca_system_score_gemma":0.0007695481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007902462,"about_ca_topic_score_gemma":0.0008434324,"domain_scores_codex":[0.9991882,0.0001841425,0.00006892422,0.0002226682,0.0002481131,0.00008783191],"domain_scores_gemma":[0.9988218,0.0003243189,0.00007274909,0.0002397584,0.0003883522,0.0001529064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007784119,0.00000477313,0.00004716781,0.00001290678,0.000001504548,0.00001060452,0.00009736158,0.00006113686,0.0001674489,0.9909705,0.002496387,0.006122374],"study_design_scores_gemma":[0.000004311764,0.000005737842,0.0001168265,0.00001663666,0.000003738438,0.00009478674,0.0001024617,0.0004192058,0.0003678756,0.9402473,0.05861564,0.000005458008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03385441,0.002716658,0.1733717,0.004631736,0.001590945,0.00008503603,0.001700108,0.0008928462,0.7811567],"genre_scores_gemma":[0.4926467,0.002772107,0.05946744,0.0009548842,0.001067412,0.0002257656,0.002021126,0.0003992202,0.4404454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03015957,"threshold_uncertainty_score":0.1008938,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Carsten Butz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07420537336851178,"gpt":0.314725394603388,"spread":0.2405200212348762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002548537,0.0009624509,0.001328869,0.002388653,0.002667551,0.006097461,0.001836505,0.002138411,0.01108553],"category_scores_gemma":[0.006489975,0.001414596,0.002078003,0.002552771,0.006372701,0.01501712,0.003221475,0.004597456,0.0009775511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003178295,"about_ca_system_score_gemma":0.001639401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002425048,"about_ca_topic_score_gemma":0.003353684,"domain_scores_codex":[0.9976083,0.001085067,0.0001523515,0.0003054856,0.0006096814,0.0002391194],"domain_scores_gemma":[0.9939174,0.003905264,0.0003721565,0.0008265509,0.0006675101,0.0003111116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008101073,0.000006836467,0.00006143621,0.00001560475,0.000008090118,0.00001106671,0.0001613153,0.000430492,0.00005995612,0.9982931,0.000340885,0.0006031907],"study_design_scores_gemma":[0.000003869894,0.000001777529,0.00002327881,0.000003310133,0.000003683519,0.00000804682,0.0000219364,0.001229333,0.00003225944,0.9981047,0.0005653234,0.000002364768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2054012,0.00482122,0.5294406,0.01247437,0.0003787841,0.0001177316,0.001341559,0.001022132,0.2450024],"genre_scores_gemma":[0.954681,0.000991716,0.02803845,0.0007596143,0.0003777699,0.0001121752,0.000679981,0.0001201887,0.01423921],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01108553,"threshold_uncertainty_score":0.03708482,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Klaus Aehlig","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06935606317556205,"gpt":0.2697775510396174,"spread":0.2004214878640554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002352545,0.000701525,0.001184444,0.001534845,0.002169978,0.006508763,0.001604071,0.001520495,0.01013884],"category_scores_gemma":[0.007187265,0.00124328,0.001102837,0.002465615,0.00582246,0.01279984,0.003570665,0.008913203,0.003679537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002018008,"about_ca_system_score_gemma":0.001911978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007980038,"about_ca_topic_score_gemma":0.0009176194,"domain_scores_codex":[0.9975421,0.0004939691,0.0001654591,0.0006755773,0.0009367479,0.0001862184],"domain_scores_gemma":[0.9954489,0.001797975,0.000182715,0.001709655,0.0006494912,0.0002113137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002316496,0.00001762734,0.000221361,0.00003616805,0.00000747559,0.00002565609,0.0001414927,0.0004471241,0.000306053,0.9640256,0.007965245,0.02678316],"study_design_scores_gemma":[0.000007411096,0.000007217303,0.0001007277,0.00002136519,0.00001262725,0.0001019649,0.00002640954,0.001912906,0.0004771247,0.9593092,0.03801264,0.00001043793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03537958,0.01832183,0.6975647,0.01400195,0.004418625,0.00005197448,0.0007524213,0.002276753,0.2272321],"genre_scores_gemma":[0.6499417,0.014872,0.1552722,0.003733105,0.007111441,0.000165149,0.001321011,0.001533165,0.1660502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01013884,"threshold_uncertainty_score":0.03391778,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Chris J. Conidis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04048729888383151,"gpt":0.2811536320011267,"spread":0.2406663331172952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004250488,0.001248507,0.002013579,0.003077142,0.004016656,0.005718455,0.003840776,0.003404357,0.008769649],"category_scores_gemma":[0.02078198,0.001274267,0.003093167,0.002568451,0.0139337,0.01559109,0.007788422,0.009341216,0.001126085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004535824,"about_ca_system_score_gemma":0.002007098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001442865,"about_ca_topic_score_gemma":0.001083878,"domain_scores_codex":[0.995509,0.001198401,0.0002465356,0.0008282717,0.001739875,0.0004779099],"domain_scores_gemma":[0.9839883,0.01122298,0.0005374363,0.001946759,0.001590833,0.0007136084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001062986,0.00001074609,0.00005246729,0.00001749594,0.000006859172,0.00002256646,0.00006713677,0.000407664,0.0001139171,0.9972528,0.0007935906,0.001244199],"study_design_scores_gemma":[0.000009845783,0.000005843645,0.00005431214,0.00000869242,0.000005354862,0.00002504808,0.00001735438,0.002741317,0.0001746714,0.9955884,0.001361685,0.000007526422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09178384,0.003426168,0.6610458,0.03300532,0.002626038,0.0001158625,0.0006645177,0.0009744113,0.206358],"genre_scores_gemma":[0.9184222,0.0008295919,0.0595847,0.003171802,0.001820097,0.0002397046,0.0002520549,0.0002899352,0.01538989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008769649,"threshold_uncertainty_score":0.03290987,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Discrete mathematics; Artificial intelligence; Computer science; Mathematical economics; Calculus (dental); Medicine","authors":[{"name":"S. Barry Cooper","is_ca":false},{"name":"Leo Harrington","is_ca":false},{"name":"A. H. Lachlan","is_ca":true},{"name":"Steffen Lempp","is_ca":false},{"name":"Robert I. Soare","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1098005144807524,"gpt":0.3076933068725218,"spread":0.1978927923917694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959167,0.002353214,0.002420853,0.003944058,0.004930274,0.003898661,0.00395395,0.006872013,0.09798762],"category_scores_gemma":[0.031935,0.001291023,0.002397343,0.002504852,0.003170513,0.004879917,0.002724913,0.01020923,0.06464235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006601679,"about_ca_system_score_gemma":0.004353746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03035968,"about_ca_topic_score_gemma":0.04000493,"domain_scores_codex":[0.9961953,0.0006471424,0.0005313246,0.0006462915,0.001563788,0.0004161579],"domain_scores_gemma":[0.980682,0.004011081,0.0006326452,0.001063588,0.0128117,0.0007989598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001124421,0.000004078594,0.00001993647,0.00004441725,0.000004976253,0.00004694091,0.00001132769,0.00001836485,0.00001943993,0.001097536,0.997192,0.001529737],"study_design_scores_gemma":[0.00002618781,0.00001801822,0.0006976983,0.0001645326,0.00002880338,0.0001581659,0.00006249396,0.0001990425,0.0002190695,0.005240093,0.9931404,0.00004550419],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0001236313,0.002763093,0.0006877261,0.1178352,0.8642154,0.00003816631,0.0009365678,0.00033797,0.01306229],"genre_scores_gemma":[0.01004784,0.01278067,0.003133606,0.1664243,0.3063939,0.0002571169,0.003122412,0.001194179,0.496646],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.09798762,"threshold_uncertainty_score":0.3278012,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Steve Awodey","is_ca":false},{"name":"Pieter Hofstra","is_ca":true},{"name":"Michael A. Warren","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08336237303201456,"gpt":0.3310391692860479,"spread":0.2476767962540333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006723,0.0008700602,0.001063682,0.004474557,0.002434048,0.003298672,0.0008909654,0.001705432,0.01676335],"category_scores_gemma":[0.002544568,0.0006031038,0.0006831657,0.001802404,0.003744389,0.007238045,0.002843083,0.003377861,0.001926723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002268903,"about_ca_system_score_gemma":0.0005728253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001239329,"about_ca_topic_score_gemma":0.00138747,"domain_scores_codex":[0.9994439,0.0001384735,0.00002629258,0.0001479695,0.0001548317,0.0000883861],"domain_scores_gemma":[0.9992185,0.0002502773,0.00009418136,0.0001162878,0.0001849658,0.0001357305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003735026,0.000003094051,0.00004152574,0.000006908395,0.000002185578,0.000009873996,0.00005190802,0.00004895374,0.00007820234,0.9977579,0.0006989613,0.00129691],"study_design_scores_gemma":[0.000006140671,0.000005229612,0.00024718,0.000009738128,0.000006545468,0.00008319963,0.00006011552,0.0006315235,0.0001458027,0.9836776,0.01511879,0.000007993462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1288917,0.01054667,0.1137964,0.01387496,0.001195278,0.00005244219,0.0008619397,0.000482554,0.7302979],"genre_scores_gemma":[0.8191839,0.003659467,0.01589717,0.001398788,0.001510589,0.000101253,0.0004962669,0.0002022899,0.1575502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01676335,"threshold_uncertainty_score":0.05607903,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alexandra Shlapentokh","is_ca":false},{"name":"Carlos R. Videla","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07480024261852344,"gpt":0.3446670335556944,"spread":0.269866790937171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004586184,0.0008629691,0.001700692,0.002395354,0.004027823,0.007157688,0.002746371,0.002141938,0.005011373],"category_scores_gemma":[0.01432721,0.0014397,0.003310528,0.002409625,0.01167366,0.02297869,0.004688713,0.009199568,0.0003074812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003481435,"about_ca_system_score_gemma":0.001585323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002388129,"about_ca_topic_score_gemma":0.002382235,"domain_scores_codex":[0.9962103,0.001149031,0.0003112624,0.001040995,0.0007853275,0.0005030124],"domain_scores_gemma":[0.9811489,0.01541087,0.0007238311,0.001243279,0.0008597708,0.0006133144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000363137,0.00003926631,0.0002749646,0.00003289291,0.00001477649,0.00007556545,0.0005392926,0.0008159658,0.0002145961,0.9957991,0.0002326084,0.001924512],"study_design_scores_gemma":[0.00001841098,0.00000608752,0.00008985114,0.000007487206,0.00001288657,0.0000463166,0.00007603985,0.002480205,0.0002392375,0.9964225,0.0005945553,0.000006374746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5010436,0.004694442,0.3729578,0.00946188,0.0004234742,0.0001406989,0.0007700855,0.0005296568,0.1099783],"genre_scores_gemma":[0.9700014,0.0007568905,0.01909387,0.0004818729,0.0003474142,0.0001105153,0.0005219482,0.00007470112,0.008611411],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007157688,"threshold_uncertainty_score":0.02525967,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Lúcia R. Junqueira","is_ca":false},{"name":"Paul Larson","is_ca":false},{"name":"Franklin D. Tall","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04715921338892022,"gpt":0.320140168865827,"spread":0.2729809554769068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002160291,0.0004911132,0.0008812735,0.001492429,0.002291809,0.003479245,0.0009281028,0.002043393,0.007015355],"category_scores_gemma":[0.004319712,0.0006185453,0.0009471533,0.001556209,0.007494358,0.01316223,0.003649326,0.003617644,0.0005675796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512053,"about_ca_system_score_gemma":0.0007921454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00156661,"about_ca_topic_score_gemma":0.001688213,"domain_scores_codex":[0.9991314,0.0002840923,0.00006350203,0.0002047727,0.0001813475,0.0001348947],"domain_scores_gemma":[0.9948426,0.003495134,0.0003075452,0.0006193318,0.000406864,0.0003285519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001332631,0.000007556273,0.0001434385,0.00001424063,0.000003561401,0.00003176853,0.0001450928,0.0001729609,0.0001464186,0.997973,0.0002862324,0.001062328],"study_design_scores_gemma":[0.000005893775,0.000004876749,0.0000619723,0.000004909638,0.000002846949,0.00002223585,0.00004705392,0.0006356139,0.00009907273,0.9984256,0.0006872389,0.000002649913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5129781,0.00716396,0.2575497,0.01126248,0.000376284,0.0000651595,0.0008817147,0.0003294627,0.2093932],"genre_scores_gemma":[0.9764356,0.001209929,0.01046298,0.0004368943,0.0002912622,0.00006460112,0.0003235859,0.00004704832,0.0107282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007015355,"threshold_uncertainty_score":0.02346867,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Farzad Didehvar","is_ca":false},{"name":"Kaveh Ghasemloo","is_ca":true},{"name":"Massoud Pourmahdian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0318717696874971,"gpt":0.2976856607751662,"spread":0.2658138910876691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007104914,0.001168253,0.002165431,0.005568322,0.001885503,0.008156025,0.002543283,0.001866005,0.00926304],"category_scores_gemma":[0.02911102,0.0008971294,0.001940842,0.005639798,0.006104406,0.01327987,0.004191347,0.005929017,0.0011315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003736902,"about_ca_system_score_gemma":0.001306028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00208998,"about_ca_topic_score_gemma":0.001624022,"domain_scores_codex":[0.9952295,0.002495547,0.000275825,0.0005919485,0.001105515,0.0003017262],"domain_scores_gemma":[0.9665164,0.0276252,0.001225345,0.001637406,0.001999702,0.0009959204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002741912,0.00003055553,0.0002563546,0.00008109125,0.00001243265,0.00003305142,0.0002104569,0.005420202,0.0001401292,0.9700884,0.00167458,0.02202535],"study_design_scores_gemma":[0.00001327963,0.00002420576,0.0001942059,0.00003842156,0.00002329335,0.00006466451,0.0001082011,0.05456672,0.0003856492,0.9404883,0.004075284,0.00001785593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02758002,0.005650407,0.8858369,0.004260049,0.0003235168,0.00007674427,0.0002893035,0.0006780074,0.07530499],"genre_scores_gemma":[0.6850929,0.005116212,0.2826432,0.0009571149,0.002109181,0.0002658661,0.0004677287,0.0006350133,0.02271272],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00926304,"threshold_uncertainty_score":0.03757483,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Barbara F. Csima","is_ca":true},{"name":"Reed Solomon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1172421709811333,"gpt":0.2690373915610357,"spread":0.1517952205799024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002983819,0.0008076695,0.001833659,0.003056199,0.002698149,0.009842716,0.002819211,0.002269984,0.008206192],"category_scores_gemma":[0.0208656,0.0008066641,0.001263227,0.00310353,0.008318858,0.0224452,0.004479866,0.005435451,0.0005859455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004303566,"about_ca_system_score_gemma":0.001921656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001519048,"about_ca_topic_score_gemma":0.001386126,"domain_scores_codex":[0.997206,0.0008216631,0.0001452934,0.0004469021,0.0009867735,0.0003932649],"domain_scores_gemma":[0.9724425,0.02251101,0.001362361,0.001497947,0.0008945774,0.001291638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001107587,0.0000428756,0.0008582147,0.00004719124,0.00001362409,0.00005822462,0.0004368511,0.004954077,0.0002671063,0.9893884,0.0006821468,0.003140468],"study_design_scores_gemma":[0.0000169296,0.000007454323,0.000129697,0.000005035125,0.000006139313,0.00002710642,0.00005798005,0.008146461,0.0001498654,0.9910487,0.0003960897,0.00000864287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8127604,0.002314407,0.1161999,0.01116316,0.000306115,0.0000846266,0.0006657033,0.0003549293,0.05615078],"genre_scores_gemma":[0.9880682,0.0004824135,0.005647186,0.0001833123,0.0003977758,0.00005891971,0.0002195485,0.00004647333,0.004896183],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009842716,"threshold_uncertainty_score":0.03122467,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andreas Fischer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06128211050150189,"gpt":0.3294251231486668,"spread":0.2681430126471649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007385623,0.0006953044,0.0008233602,0.001153812,0.002172058,0.003067761,0.001029826,0.001054578,0.004281885],"category_scores_gemma":[0.00251443,0.0006512176,0.001067954,0.001073313,0.004104129,0.00904825,0.00330918,0.004844232,0.0006038078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001736832,"about_ca_system_score_gemma":0.0007237038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001583222,"about_ca_topic_score_gemma":0.001705232,"domain_scores_codex":[0.9993679,0.0001408047,0.00003410719,0.0001310472,0.0001598922,0.0001663268],"domain_scores_gemma":[0.998796,0.0006823454,0.00009307279,0.0001331214,0.0001081227,0.0001872737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002985153,0.00000873052,0.00008697516,0.00001143868,0.000002557668,0.00004401394,0.0001262909,0.0002702637,0.0004516224,0.9971848,0.000212695,0.001570804],"study_design_scores_gemma":[0.000009587535,0.000009375735,0.000131536,0.000006678271,0.000005625975,0.00004248355,0.00006864745,0.00154568,0.0003975217,0.9963763,0.00139985,0.000006594552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4757671,0.001903005,0.297522,0.004877397,0.0004428522,0.0000548988,0.000349129,0.0005434448,0.2185402],"genre_scores_gemma":[0.9607006,0.0005218221,0.02073971,0.000386972,0.000140358,0.00003781271,0.0001543692,0.0001090803,0.01720922],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004281885,"threshold_uncertainty_score":0.01432431,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alexi Block Gorman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08079708343801577,"gpt":0.3528783710157186,"spread":0.2720812875777028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009164944,0.0005077309,0.0009449215,0.00206889,0.001381889,0.002255284,0.0008876646,0.001003521,0.008008262],"category_scores_gemma":[0.002687215,0.0003683076,0.00129578,0.0011594,0.003815014,0.005352709,0.003519657,0.00260626,0.0005424935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009465484,"about_ca_system_score_gemma":0.0004366211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000866814,"about_ca_topic_score_gemma":0.0006248087,"domain_scores_codex":[0.9991947,0.0001461557,0.00005291773,0.0002213673,0.0002180577,0.0001667668],"domain_scores_gemma":[0.9976963,0.001182514,0.0002238471,0.0002314035,0.0002755605,0.0003903416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001085881,0.00005449984,0.0009322853,0.00003762463,0.00001438302,0.0002232286,0.000672553,0.0004271661,0.003230368,0.9896526,0.0006104691,0.004036176],"study_design_scores_gemma":[0.00004099961,0.00008645649,0.001430061,0.00001719041,0.00002750317,0.0003155557,0.0003748862,0.006996654,0.001605204,0.9857929,0.003291411,0.00002106343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7121437,0.000600862,0.1463723,0.001952838,0.0001920731,0.0001083128,0.0004295371,0.0003161684,0.1378841],"genre_scores_gemma":[0.9835612,0.0001502904,0.007426772,0.0002816986,0.0002245929,0.00005209087,0.0003739615,0.00006465525,0.007864721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008008262,"threshold_uncertainty_score":0.02679032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Eric Allender","is_ca":false},{"name":"Harry Buhrman","is_ca":false},{"name":"Michal Koucký","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0468738684075537,"gpt":0.2898112070779778,"spread":0.2429373386704241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001825587,0.0008018348,0.002051078,0.0009366575,0.002612763,0.005739216,0.002244055,0.003075045,0.02431296],"category_scores_gemma":[0.02104072,0.0007496533,0.002072011,0.001256182,0.004172837,0.01485883,0.003843332,0.004727285,0.005824235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001299445,"about_ca_system_score_gemma":0.00274793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00140165,"about_ca_topic_score_gemma":0.001561204,"domain_scores_codex":[0.9967912,0.001086168,0.0001637707,0.0006123285,0.0006793282,0.0006672634],"domain_scores_gemma":[0.9908018,0.005312159,0.0002726619,0.002655882,0.0005941086,0.0003635036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001313502,0.00009029101,0.0001664752,0.0001383111,0.00003119053,0.00005281108,0.0001603942,0.004106557,0.0006105336,0.9683959,0.01103732,0.01507886],"study_design_scores_gemma":[0.0000182579,0.000008695797,0.00004547538,0.0000159608,0.00001227102,0.00002222461,0.00004194117,0.005663271,0.0003671032,0.9904096,0.003385857,0.000009359544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2488906,0.003536722,0.4343458,0.04707644,0.003115794,0.0003144298,0.002339186,0.004274467,0.2561066],"genre_scores_gemma":[0.8602511,0.001599237,0.08556551,0.003941559,0.001531683,0.0003447471,0.001948456,0.001453527,0.04336412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02431296,"threshold_uncertainty_score":0.08133489,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Douglas Bridges","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06685076243352794,"gpt":0.3393181430546364,"spread":0.2724673806211084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001116632,0.0005224035,0.0009352905,0.00206659,0.002628943,0.00355909,0.0009747159,0.001140787,0.006688586],"category_scores_gemma":[0.004117832,0.0004685357,0.0008976135,0.00194214,0.006337102,0.01057264,0.004182289,0.003305831,0.0004195259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001033665,"about_ca_system_score_gemma":0.0003908523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000903458,"about_ca_topic_score_gemma":0.0009017985,"domain_scores_codex":[0.9991604,0.0002653868,0.00006763177,0.0002486327,0.000177781,0.00008006976],"domain_scores_gemma":[0.9972656,0.001488457,0.0002643268,0.0003790056,0.0002945945,0.0003081394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006898483,0.000002664679,0.00005059203,0.000007434423,0.000002190819,0.00001249535,0.00008491702,0.000116991,0.00004319207,0.9985245,0.0001331868,0.001014958],"study_design_scores_gemma":[0.000003186072,0.000002406143,0.00006540206,0.000003024659,0.000003461755,0.0000255957,0.00005639343,0.0004014296,0.00004000434,0.9982083,0.001188822,0.000002074071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3705941,0.007584839,0.3714022,0.005451839,0.0006311672,0.00004590283,0.0007364427,0.0001941379,0.2433593],"genre_scores_gemma":[0.9505098,0.001871172,0.0207225,0.0003487529,0.0004114847,0.00007918723,0.0004432349,0.00005912292,0.02555477],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006688586,"threshold_uncertainty_score":0.02237558,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Levon Haykazyan","is_ca":true},{"name":"Rahim Moosa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09581153663591728,"gpt":0.3524762071483105,"spread":0.2566646705123932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225748,0.0004941172,0.000975427,0.002003915,0.002649441,0.002818829,0.0008673589,0.001277594,0.005835732],"category_scores_gemma":[0.002486725,0.000434975,0.0006809086,0.001746433,0.00578743,0.007462282,0.003895653,0.002349532,0.0004960645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001441453,"about_ca_system_score_gemma":0.0005789574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001067138,"about_ca_topic_score_gemma":0.0005945918,"domain_scores_codex":[0.9991394,0.0002302966,0.00004863081,0.0002514153,0.0001860693,0.0001441683],"domain_scores_gemma":[0.9991014,0.0004285718,0.00007514381,0.0001237328,0.0001471458,0.0001240616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000187418,0.000007337548,0.0001181408,0.00001115155,0.000003399907,0.00003003094,0.0002356584,0.0001210225,0.0001881795,0.997381,0.0002534754,0.001631728],"study_design_scores_gemma":[0.00001182399,0.00001008903,0.0002016333,0.000003928071,0.000007015752,0.00004080917,0.00007721387,0.0007215501,0.0002609263,0.9961554,0.002502523,0.000006996483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.628912,0.003307348,0.1575989,0.007789338,0.0006609329,0.00007721494,0.0006824359,0.0004040718,0.2005678],"genre_scores_gemma":[0.9784603,0.0005347642,0.006565832,0.0002716359,0.0003394128,0.00004042604,0.0001384947,0.00006785297,0.01358133],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005835732,"threshold_uncertainty_score":0.01952249,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jean A. Larson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1085329148009525,"gpt":0.3278589232304541,"spread":0.2193260084295016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001220106,0.0006006672,0.001305375,0.002270224,0.002779576,0.003835825,0.001144675,0.001123641,0.01058131],"category_scores_gemma":[0.00278927,0.000799813,0.001277275,0.002348034,0.004051922,0.01024663,0.002225905,0.003509772,0.001184627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001883722,"about_ca_system_score_gemma":0.0006087944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001368253,"about_ca_topic_score_gemma":0.001387976,"domain_scores_codex":[0.9992058,0.0001557339,0.00005089323,0.0002078476,0.0002511094,0.0001286844],"domain_scores_gemma":[0.9980831,0.0009886813,0.0001647778,0.0002919601,0.0002868677,0.0001846098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001441959,0.000006245948,0.0000522722,0.000007837299,0.000003430392,0.00001498251,0.00007422601,0.0002512658,0.0002167499,0.9978035,0.0003095799,0.001245429],"study_design_scores_gemma":[0.000008251232,0.000006696207,0.00008328754,0.00000360203,0.000006123666,0.0000349616,0.00002506985,0.001702856,0.0002179516,0.9964167,0.001489457,0.000005094483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4090371,0.001819892,0.4342688,0.003089065,0.0006635586,0.0001038141,0.0009705957,0.0004645635,0.1495824],"genre_scores_gemma":[0.8983238,0.000864798,0.03986361,0.0005141794,0.0006589419,0.0001215052,0.0005714334,0.0003025224,0.05877916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01058131,"threshold_uncertainty_score":0.03539801,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Computer science","authors":[{"name":"Bernhard Banaschewski","is_ca":true},{"name":"Thierry Coquand","is_ca":false},{"name":"Giovanni Sambin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07169535233512939,"gpt":0.3167645551071711,"spread":0.2450692027720417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001281622,0.0009577396,0.000656569,0.003711916,0.002504334,0.003422,0.001155036,0.0009183227,0.3837277],"category_scores_gemma":[0.009138111,0.0002851477,0.0005699552,0.002461563,0.0006707931,0.002639626,0.001911778,0.002873346,0.2626885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002031344,"about_ca_system_score_gemma":0.001874399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003940021,"about_ca_topic_score_gemma":0.005912708,"domain_scores_codex":[0.9992619,0.0001203435,0.00004179159,0.0001246969,0.0003937834,0.00005739027],"domain_scores_gemma":[0.9959066,0.0006962026,0.0001252994,0.0004338601,0.002318289,0.0005197704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001787181,0.00001457933,0.00006264249,0.00006336548,0.000001804223,0.0000200387,0.0000416323,0.0000423952,0.00007356184,0.007913016,0.959497,0.03225203],"study_design_scores_gemma":[0.000003271587,0.000006015584,0.0001718485,0.00007094871,0.000001847535,0.00002498301,0.00004008992,0.00003130345,0.00008306721,0.005708114,0.9938547,0.000003921208],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"editorial","genre_scores_codex":[0.001098931,0.01472324,0.01084515,0.03658034,0.2182644,0.0003252646,0.01111051,0.001615405,0.7054367],"genre_scores_gemma":[0.005472244,0.00496245,0.002459014,0.005559016,0.02518664,0.0001574594,0.005281901,0.0008026199,0.9501187],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.3837277,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Compact space; Relatively compact subspace; Compact disc; Computer science; Pure mathematics; Physics","authors":[{"name":"Juris Steprāns","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0884580073405187,"gpt":0.3463021221392212,"spread":0.2578441147987025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002689304,0.001408053,0.001377811,0.002600254,0.002341082,0.006423091,0.00130061,0.001272495,0.007958324],"category_scores_gemma":[0.00708655,0.001619156,0.001736598,0.002764554,0.006198698,0.01968164,0.005227361,0.003203596,0.001316591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001366254,"about_ca_system_score_gemma":0.0008034609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007505056,"about_ca_topic_score_gemma":0.0006725913,"domain_scores_codex":[0.9970725,0.0005992652,0.0003310077,0.0009366623,0.0006877686,0.0003727999],"domain_scores_gemma":[0.9899971,0.004023966,0.001318242,0.001390371,0.002278848,0.0009914117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000155187,0.00003138057,0.0006771553,0.00006593556,0.00003373532,0.0002540255,0.000681093,0.0005968248,0.001242463,0.9905921,0.0004755929,0.005194552],"study_design_scores_gemma":[0.00003040831,0.00008984278,0.0003912341,0.00001612321,0.00003015616,0.0004830458,0.0004323271,0.00449061,0.001954524,0.9877403,0.004322484,0.00001890902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.3917714,0.00162532,0.5340729,0.001116595,0.0003156438,0.0001417662,0.001106116,0.0009102208,0.06893998],"genre_scores_gemma":[0.931372,0.0005256954,0.04576175,0.0003001746,0.0002290429,0.000231366,0.001094705,0.000235566,0.02024966],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.007958324,"threshold_uncertainty_score":0.02662325,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Osvaldo Guzmán","is_ca":false},{"name":"Stevo Todorčević","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07347100660882844,"gpt":0.3252654999441475,"spread":0.2517944933353191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001361537,0.0005177315,0.001203423,0.001900509,0.002741006,0.003201734,0.001122226,0.001561003,0.01056632],"category_scores_gemma":[0.004182927,0.0007091421,0.001495848,0.001189345,0.0043699,0.007091813,0.004074649,0.002687588,0.001175475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001607852,"about_ca_system_score_gemma":0.0007253655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001552455,"about_ca_topic_score_gemma":0.001712388,"domain_scores_codex":[0.9989906,0.0003222195,0.00005752886,0.0002306397,0.0002328451,0.0001661592],"domain_scores_gemma":[0.9978466,0.00102607,0.0001366677,0.0005594476,0.0001890173,0.0002421486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000112719,0.000003951382,0.00003754692,0.000006361763,0.000002259927,0.00001944593,0.00006377621,0.000321847,0.0001200507,0.9983108,0.0003226485,0.0007800577],"study_design_scores_gemma":[0.00000683256,0.000003342574,0.00005137314,0.000003914621,0.000003550014,0.0000270433,0.00003218251,0.001209386,0.0001178276,0.9968599,0.001678628,0.000005895266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.2830111,0.002063047,0.236515,0.00490862,0.0009437611,0.0001022956,0.0006787298,0.0008440322,0.4709334],"genre_scores_gemma":[0.9223688,0.0006444783,0.02733763,0.0007600139,0.0006146164,0.00009633155,0.000300194,0.0002667853,0.04761107],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01056632,"threshold_uncertainty_score":0.03534788,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Countable set; Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Miloš S. Kurilić","is_ca":false},{"name":"Stevo Todorčević","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07543598530810063,"gpt":0.3617738189368878,"spread":0.2863378336287872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001260815,0.0006667414,0.00124942,0.002407561,0.002901482,0.007587683,0.00153007,0.001059725,0.01008106],"category_scores_gemma":[0.002954622,0.0009250522,0.0017546,0.00189271,0.003612298,0.006209817,0.003637718,0.002347128,0.0005242147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00133264,"about_ca_system_score_gemma":0.000479326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009510199,"about_ca_topic_score_gemma":0.000935771,"domain_scores_codex":[0.9985341,0.0003945754,0.0001074586,0.000331254,0.0003469636,0.0002855686],"domain_scores_gemma":[0.9965187,0.00176296,0.0003908611,0.0003365313,0.0002826588,0.0007082861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007048185,0.00004153543,0.0005413814,0.00001810992,0.000022181,0.0002164804,0.0004707856,0.0007683029,0.0009464381,0.9950739,0.0002583916,0.001572085],"study_design_scores_gemma":[0.00003996243,0.00003363813,0.000554902,0.00001009324,0.00002614749,0.000223076,0.00031454,0.005723997,0.0006663175,0.9907829,0.001608548,0.000015868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8028717,0.0007663275,0.1171844,0.001119377,0.0001990145,0.00007930979,0.0004197409,0.0003512368,0.07700896],"genre_scores_gemma":[0.9790323,0.0002620278,0.007178946,0.0001291731,0.0002048046,0.00008894835,0.000351682,0.0000516527,0.01270045],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01008106,"threshold_uncertainty_score":0.03372449,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Christopher J. Eagle","is_ca":true},{"name":"Clovis Hamel","is_ca":true},{"name":"Sandra Müller","is_ca":false},{"name":"Franklin D. Tall","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1478129913710508,"gpt":0.3812278666988754,"spread":0.2334148753278246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005014182,0.001338596,0.002524794,0.002771941,0.00416873,0.006902475,0.006050174,0.003801555,0.009424397],"category_scores_gemma":[0.02552609,0.002040135,0.004688413,0.002662015,0.01017952,0.03180085,0.007765153,0.0131276,0.000925719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004377716,"about_ca_system_score_gemma":0.002634171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002832429,"about_ca_topic_score_gemma":0.003382743,"domain_scores_codex":[0.9937943,0.001363047,0.0004546948,0.002090469,0.00155498,0.0007424894],"domain_scores_gemma":[0.9578413,0.0341844,0.001238981,0.003344809,0.002119091,0.0012714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001213476,0.00009099774,0.0006059211,0.0001680913,0.00004470034,0.0002002876,0.0003009306,0.004695167,0.0006165842,0.979352,0.005435084,0.008368935],"study_design_scores_gemma":[0.00003470457,0.00001145917,0.0001105887,0.00001946096,0.00002391738,0.00006418741,0.00005008465,0.01275326,0.0003534005,0.9843748,0.002187301,0.00001674611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1830949,0.004069604,0.6620244,0.0298259,0.001819019,0.0002671204,0.002487805,0.001474589,0.1149367],"genre_scores_gemma":[0.8278037,0.001677263,0.1411261,0.004490906,0.002527129,0.0004062327,0.001807297,0.0004566195,0.01970478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009424397,"threshold_uncertainty_score":0.03176278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}