{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002662512,0.0001914514,0.0003093501,0.00007057281,0.0001218707,0.00005884354,0.0005855887,0.0001611688,0.00003032598],"category_scores_gemma":[0.00003177568,0.0001342605,0.00009080536,0.0002570524,0.0001767876,0.0001125854,0.0002694066,0.0001616646,0.00007070661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008593856,"about_ca_system_score_gemma":0.00003745865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006111426,"about_ca_topic_score_gemma":0.00001094923,"domain_scores_codex":[0.9987577,0.00002456452,0.0002360437,0.0004349615,0.0001697128,0.0003770574],"domain_scores_gemma":[0.9992945,0.00005731967,0.0001133825,0.0003456331,0.00006360328,0.0001255861],"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.000008495204,0.0001277471,0.00005544951,0.00001664885,0.00001292523,0.00001569788,0.0002635648,0.00008053468,0.001098268,0.9892764,0.0002508639,0.008793385],"study_design_scores_gemma":[0.0004378773,0.0003410444,0.003674815,0.00001247184,0.000007177808,0.00003281726,0.00009225133,0.0001877649,0.003403974,0.9901419,0.001411976,0.0002559797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.449946,0.006882268,0.296472,0.01539967,0.0004770716,0.0007368505,0.000009419148,0.0006299989,0.2294467],"genre_scores_gemma":[0.9882945,0.0003423399,0.008872933,0.002277149,0.00004146448,0.00001404903,0.000003284062,0.000005320642,0.0001489969],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5383484,"threshold_uncertainty_score":0.5474983,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001894999,0.0000866488,0.0001426655,0.00003114134,0.00006486274,0.0000538207,0.0001637954,0.00007932853,0.00009491134],"category_scores_gemma":[0.000003200863,0.00006586387,0.00001922247,0.0001410233,0.00005311792,0.00009800569,0.00003645863,0.00005144517,0.0001014516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001646649,"about_ca_system_score_gemma":0.00001027445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008884436,"about_ca_topic_score_gemma":5.825175e-7,"domain_scores_codex":[0.9993677,0.0000220045,0.0001419411,0.0002297488,0.00009335573,0.0001452633],"domain_scores_gemma":[0.9996374,0.00002131634,0.0000623874,0.0001914744,0.00003769584,0.00004975014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000553606,0.00009698061,0.0001563926,0.00003809313,0.00002644555,0.000002924568,0.0004949687,0.00000584818,0.00408795,0.5722576,0.02692079,0.3958566],"study_design_scores_gemma":[0.0007819408,0.0006565843,0.01112023,0.00001011104,0.00001970204,0.00002430752,0.00004163729,0.0004422331,0.006685629,0.1795821,0.8000988,0.0005367424],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5594219,0.01230953,0.008980909,0.01538704,0.0008193484,0.001676973,0.000006735272,0.0006587873,0.4007388],"genre_scores_gemma":[0.9960889,0.0002562891,0.000508955,0.0005994037,0.00009078009,0.000005200286,0.000004376504,0.000003878112,0.002442272],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.773178,"threshold_uncertainty_score":0.2685851,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003687532,0.0001501468,0.0002129524,0.00007342456,0.0001124402,0.00002986207,0.000412325,0.0001029469,0.00001809378],"category_scores_gemma":[0.00002344887,0.0001148455,0.00004647603,0.000357427,0.000089002,0.0001343736,0.0001844542,0.0001237707,0.00002307996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002657154,"about_ca_system_score_gemma":0.00001286713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001884921,"about_ca_topic_score_gemma":0.000009666287,"domain_scores_codex":[0.9989021,0.000008189721,0.0002388362,0.0003216902,0.0001730748,0.0003560939],"domain_scores_gemma":[0.9992772,0.0001120837,0.0001139171,0.0003110972,0.00008103996,0.0001047142],"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.00001292177,0.00007092131,0.0001339779,0.00002172867,0.00001076358,0.00001299161,0.0002051892,0.0002351188,0.0007259092,0.9638133,0.0009149446,0.03384222],"study_design_scores_gemma":[0.0003720648,0.0002382371,0.006333617,0.0000137908,0.000006740372,0.00001933507,0.0001609768,0.0006568787,0.009126477,0.9622175,0.02047753,0.0003768777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03709961,0.001251621,0.9261997,0.002632349,0.0001080208,0.0001931418,0.000001967064,0.0001349903,0.03237859],"genre_scores_gemma":[0.9635456,0.0002434579,0.03203328,0.003966919,0.00006959767,0.000004867027,0.000001881044,0.000005702227,0.0001287002],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.926446,"threshold_uncertainty_score":0.4683265,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004549701,0.00008327502,0.0002153317,0.00001723678,0.00005240136,0.000003096048,0.0001431807,0.0001219563,0.0001041036],"category_scores_gemma":[0.00008101198,0.00005137723,0.00005874024,0.00007802014,0.0003041906,0.00001611585,0.00006063689,0.00008341484,0.000002829939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002318559,"about_ca_system_score_gemma":0.00001456454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003843537,"about_ca_topic_score_gemma":0.00002221865,"domain_scores_codex":[0.9993359,0.00007354099,0.0002478584,0.0001176003,0.00009809911,0.0001270013],"domain_scores_gemma":[0.9993646,0.0001618949,0.0001843546,0.0002265141,0.00003975208,0.00002289219],"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.00002609525,0.00008150576,0.0003737723,0.0000344639,0.00002939312,2.269941e-7,0.0005305827,0.000002182464,0.001361301,0.9920946,0.001072668,0.004393246],"study_design_scores_gemma":[0.0001815693,0.00003951944,0.003055425,0.00000736865,0.00002388547,0.000007952206,0.0002070659,0.00000422173,0.0290561,0.9662254,0.001134803,0.00005661673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9642168,0.0001805706,0.0001824534,0.004964009,0.00003179775,0.0001690799,0.00001027908,0.00001167862,0.03023331],"genre_scores_gemma":[0.9982066,0.00003779826,0.0005628013,0.001022917,0.00005559361,0.000007777304,0.00000106451,0.000003809078,0.0001016682],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03398975,"threshold_uncertainty_score":0.2095103,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002739177,0.0001230112,0.0003053165,0.00008831382,0.00004256563,0.00001258187,0.0003283655,0.0001128473,0.000004052175],"category_scores_gemma":[0.0000215503,0.00008830326,0.00005272167,0.0002503621,0.0001205101,0.0000614075,0.00009811854,0.0001269432,0.0000118411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003240372,"about_ca_system_score_gemma":0.00002719957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009206922,"about_ca_topic_score_gemma":0.0000067725,"domain_scores_codex":[0.9989923,0.00002681367,0.0002784718,0.0002724344,0.0002047428,0.0002252774],"domain_scores_gemma":[0.999413,0.00007987925,0.0001395167,0.0002629575,0.00004773925,0.00005693193],"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.00002143372,0.0002800606,0.0006641306,0.00005739131,0.00001050377,0.00002179182,0.0006602566,0.0000484613,0.0006343769,0.9760092,0.001345893,0.02024649],"study_design_scores_gemma":[0.001716283,0.002395117,0.0246624,0.00004091529,0.000009992124,0.00005833666,0.0002260046,0.001795496,0.03650777,0.923324,0.008560605,0.000703063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7658982,0.00137925,0.09467657,0.002744077,0.000327744,0.001400722,0.000003699313,0.0001535546,0.1334162],"genre_scores_gemma":[0.9986053,0.00009144114,0.0007646056,0.0003690761,0.00003518426,0.00001656434,0.000001338935,0.000004077012,0.0001124244],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2327071,"threshold_uncertainty_score":0.3600902,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002348768,0.000127394,0.0002113856,0.00008862328,0.0001260415,0.00003500819,0.0003508316,0.00005266953,0.00001213411],"category_scores_gemma":[0.00002747753,0.0001083685,0.0000388837,0.0003450822,0.000079743,0.0001360478,0.0002969578,0.00009232189,0.00002428339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005700705,"about_ca_system_score_gemma":0.00002088944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000107649,"about_ca_topic_score_gemma":0.00000336973,"domain_scores_codex":[0.9989423,0.00001878502,0.0002022163,0.0004200372,0.0001823253,0.0002344034],"domain_scores_gemma":[0.9993307,0.00003809048,0.00006237905,0.0003844381,0.00009049903,0.00009387808],"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.00005347619,0.0003916351,0.0007335478,0.0001115687,0.00005830777,0.00002975093,0.006280714,0.004084668,0.01335985,0.7218298,0.03617804,0.2168886],"study_design_scores_gemma":[0.0007369177,0.001174323,0.05593351,0.00001820007,0.00001843021,0.0003088987,0.0004003007,0.003024457,0.2458084,0.6146452,0.07658147,0.001349878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6995391,0.0005778499,0.2690671,0.02536469,0.0004708943,0.0004471224,0.000002445378,0.0002781773,0.004252707],"genre_scores_gemma":[0.9767657,0.00005910971,0.02176875,0.0008254322,0.0004767411,0.00001450334,0.000001565127,0.000004611539,0.00008357694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2772267,"threshold_uncertainty_score":0.441914,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005195019,0.00006257524,0.0001177132,0.0000215305,0.00009365572,0.00001524745,0.0004104715,0.00003898121,0.000001348321],"category_scores_gemma":[0.00003092963,0.00004006203,0.00002935966,0.0001650689,0.0002429073,0.00007307107,0.0001081473,0.00006751297,0.000002683842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000193513,"about_ca_system_score_gemma":0.00002026995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000476492,"about_ca_topic_score_gemma":0.000002218238,"domain_scores_codex":[0.9993976,0.00002405089,0.0001898391,0.0001317384,0.0001359885,0.0001207391],"domain_scores_gemma":[0.9994164,0.00003869394,0.0001420612,0.0003070624,0.00006750844,0.00002828164],"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.000007608223,0.00003201104,0.000006402338,0.00001645213,0.000005755901,1.397064e-7,0.00024067,0.00008445304,0.001993702,0.9762177,0.00005313356,0.02134199],"study_design_scores_gemma":[0.00012521,0.0001100882,0.00166049,0.000008106408,0.000002213326,0.000002094854,0.00005348753,0.0005919159,0.2279961,0.7684931,0.000896144,0.00006107985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.149903,0.0009343997,0.8313518,0.006010938,0.0001173652,0.0004961643,0.000005232147,0.00006154648,0.01111957],"genre_scores_gemma":[0.820749,0.00006294469,0.1788664,0.000283313,0.00001866791,0.000007789207,7.3281e-7,0.000002039379,0.000009153697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.670846,"threshold_uncertainty_score":0.1633682,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001782749,0.0001049097,0.0002748093,0.0001226162,0.00003203024,0.000002119391,0.00009413752,0.0001091933,0.00008066984],"category_scores_gemma":[0.0001244567,0.00007716788,0.00004866986,0.0001663438,0.0001026083,0.00001948083,0.00001519567,0.0001054556,0.000002719411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001266667,"about_ca_system_score_gemma":0.000005801081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.109268e-7,"about_ca_topic_score_gemma":4.020408e-7,"domain_scores_codex":[0.9994126,0.00001854445,0.000197527,0.0001316475,0.00009682305,0.0001428877],"domain_scores_gemma":[0.9993251,0.0003041971,0.0001485971,0.0001561731,0.0000320092,0.00003395212],"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.0001014076,0.00008761427,0.00001133688,0.00003403936,0.00001887939,0.000001655556,0.0001015104,0.00003365876,0.001085663,0.9844493,0.001590943,0.01248395],"study_design_scores_gemma":[0.000185203,0.0002950141,0.00143697,0.000008197011,0.00001157949,0.000002197639,0.000120004,0.000001246586,0.02562026,0.972133,0.0001111078,0.00007522979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9610868,0.0006463859,0.002991843,0.000587206,0.00002929848,0.000177775,0.00001453467,0.00003112415,0.03443509],"genre_scores_gemma":[0.9970577,0.0000862956,0.001773181,0.000948795,0.00002313494,0.000001402334,0.000002330921,0.000004781635,0.0001023515],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03597098,"threshold_uncertainty_score":0.3146815,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001525867,0.00007073492,0.0001978175,0.00002960689,0.00002285938,7.205758e-7,0.00007615889,0.00006990488,0.0001592865],"category_scores_gemma":[0.00003014165,0.00005421814,0.00003383121,0.00004017035,0.0001989269,0.00002052557,0.00001944431,0.00006101232,0.000004676887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":4.819723e-7,"about_ca_system_score_gemma":0.000005474836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001046974,"about_ca_topic_score_gemma":0.000001738335,"domain_scores_codex":[0.9995878,0.00001515779,0.0001547734,0.00009031649,0.00004624081,0.0001057594],"domain_scores_gemma":[0.9996256,0.0001022011,0.0001046173,0.000113789,0.00002776692,0.0000260895],"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.0001344591,0.00007739446,0.00008830267,0.00005908535,0.00003202696,0.000001610725,0.0007525216,9.976047e-7,0.002360677,0.9943487,0.0004495466,0.00169468],"study_design_scores_gemma":[0.0001187452,0.0001230937,0.0003825086,0.000008636462,0.00001681732,0.000003334734,0.0003626165,7.528022e-7,0.07409975,0.9246764,0.0001496653,0.00005764042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8762546,0.0004288591,0.002708024,0.0001336492,0.00003903987,0.0001422922,0.00001283736,0.00002991828,0.1202507],"genre_scores_gemma":[0.9949741,0.00008176424,0.00456086,0.0002190304,0.00001404192,0.000003588118,0.000001392817,0.000005041726,0.0001401592],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1201106,"threshold_uncertainty_score":0.2210952,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002430291,0.0001151942,0.0002834535,0.00004849147,0.00005744086,0.00004115848,0.0002990701,0.00007092598,0.000003741107],"category_scores_gemma":[0.000006195875,0.00008370479,0.00003413691,0.0001489349,0.0001525093,0.0001193487,0.0001289566,0.00005464879,0.000003379952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001433523,"about_ca_system_score_gemma":0.00002429137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000058025,"about_ca_topic_score_gemma":0.0000242005,"domain_scores_codex":[0.999185,0.00001753277,0.0002206661,0.0002478309,0.0001464857,0.0001824344],"domain_scores_gemma":[0.9994954,0.00003725463,0.000139583,0.0001952267,0.00007122654,0.00006127277],"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.00001047039,0.00006901406,0.0005496145,0.0001326021,0.00001843794,0.00000362866,0.000399661,0.00003547266,0.003466704,0.971377,0.00003600369,0.02390135],"study_design_scores_gemma":[0.0009624351,0.0007565286,0.009554355,0.00002834872,0.00001888753,0.00006083639,0.0006239793,0.0001034752,0.01708054,0.9665913,0.003805551,0.000413766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8278141,0.004628747,0.1557623,0.0016581,0.0001792934,0.0005151358,0.000004442088,0.0001055322,0.00933236],"genre_scores_gemma":[0.997321,0.0001192506,0.002228017,0.0002638308,0.00003324308,0.00001074589,0.000001654399,0.000003426406,0.00001885581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1695069,"threshold_uncertainty_score":0.3413382,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000476563,0.0003011381,0.000318959,0.00007389033,0.0003573931,0.00006754318,0.0003176702,0.0005872598,0.0001927935],"category_scores_gemma":[0.0001502099,0.0003073198,0.0002378445,0.0001187191,0.0004640677,0.0002660287,0.0002489689,0.0004247911,0.0001926294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003812368,"about_ca_system_score_gemma":0.00006932156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001104266,"about_ca_topic_score_gemma":0.0000755741,"domain_scores_codex":[0.9981981,0.00005008148,0.0005108936,0.0004316877,0.0002962035,0.0005130438],"domain_scores_gemma":[0.9985831,0.0003394534,0.0003687558,0.0005280868,0.00004879809,0.000131833],"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.0004060829,0.0001943054,0.000002885558,0.0001552661,0.0001732466,0.00004943863,0.0008727508,0.0001079181,0.001644242,0.9938036,0.001674588,0.0009156545],"study_design_scores_gemma":[0.001857183,0.00110409,0.00008200311,0.0002297526,0.0003623833,0.0003631549,0.002811201,0.02888277,0.06873435,0.8767061,0.0178164,0.00105066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.987388,0.0004898786,0.001782213,0.001189264,0.0002158255,0.00008743567,0.00004397842,0.0001021529,0.008701283],"genre_scores_gemma":[0.9922345,0.0004215565,0.004547267,0.001861939,0.000317663,0.00009379161,0.00006027407,0.00005433493,0.000408647],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1170976,"threshold_uncertainty_score":0.9999379,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002721115,0.0001073379,0.0002171085,0.00002535902,0.00006675281,0.000003418367,0.00007544404,0.0001067169,0.00007504768],"category_scores_gemma":[0.00002215312,0.00008533693,0.00003642424,0.0000427919,0.00008889069,0.00006490751,0.00004158372,0.00009819232,0.00001556856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001518524,"about_ca_system_score_gemma":0.000003208256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.787365e-7,"about_ca_topic_score_gemma":6.514624e-7,"domain_scores_codex":[0.9993917,0.00001682194,0.0001604089,0.0001087604,0.00006019416,0.000262158],"domain_scores_gemma":[0.9995189,0.000157044,0.00009750417,0.0001438888,0.00001621109,0.00006648951],"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.00007190893,0.0002093863,0.0005742253,0.0001495147,0.00006750124,8.552097e-7,0.001447936,0.000001956903,0.01693417,0.9290698,0.0426633,0.008809417],"study_design_scores_gemma":[0.0002344807,0.0000415372,0.0002925313,0.00001217622,0.00002021988,0.000004724314,0.0004942004,0.000002836048,0.05638042,0.9402142,0.002160583,0.0001421364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9559171,0.001096521,0.008791693,0.0009037076,0.00007487945,0.0002320709,0.00001967545,0.00004643539,0.03291791],"genre_scores_gemma":[0.9962833,0.00006639396,0.002027164,0.001253166,0.00005488142,0.00001269888,0.000008440772,0.00001047093,0.0002834696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04050272,"threshold_uncertainty_score":0.3479939,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001224988,0.0001185236,0.0001881257,0.00006551918,0.00008636613,0.0001050841,0.000276783,0.00007510297,0.000002580641],"category_scores_gemma":[0.00001027151,0.00009526262,0.00003393001,0.0001658754,0.00004117615,0.0005864451,0.0001022708,0.0000938254,0.00003390357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005205284,"about_ca_system_score_gemma":0.00002034161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002648295,"about_ca_topic_score_gemma":0.000002065265,"domain_scores_codex":[0.9992076,0.00001067382,0.0002513895,0.00017497,0.0001636222,0.0001917016],"domain_scores_gemma":[0.9994528,0.00003390827,0.0001593529,0.000239744,0.00004599683,0.00006817539],"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.000005067889,0.0000213079,0.00002889981,0.00001777849,0.00001202206,0.000001967751,0.0005256978,0.002455759,0.0009478039,0.9756157,0.0001408944,0.02022712],"study_design_scores_gemma":[0.0005215828,0.0001206361,0.002738882,0.00004808203,0.000007693538,0.000009841121,0.0004552524,0.0004864232,0.008126805,0.9835542,0.003651761,0.0002788369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2222431,0.001197056,0.7649759,0.00123283,0.0001725543,0.0002491509,0.000008780105,0.000155482,0.009765195],"genre_scores_gemma":[0.9908563,0.00009037932,0.007407361,0.001564178,0.00005477393,0.000007823987,0.000009873979,0.000003053754,0.000006266201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7686132,"threshold_uncertainty_score":0.3884697,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006945374,0.0002105476,0.0003301757,0.00009401215,0.000167044,0.00008337636,0.0003591754,0.0001251909,0.00003082498],"category_scores_gemma":[0.00007279895,0.0001575319,0.0001010411,0.0002600834,0.00005903708,0.00008210124,0.00004737105,0.0001051094,0.00001816976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008522916,"about_ca_system_score_gemma":0.00006779804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001394889,"about_ca_topic_score_gemma":0.000002661241,"domain_scores_codex":[0.9987236,0.00005801821,0.0002355298,0.000443835,0.0001619472,0.0003770483],"domain_scores_gemma":[0.9989749,0.0002203166,0.0001603414,0.0004028738,0.0001257667,0.000115853],"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.00002978931,0.00006953688,0.00003483322,0.00009419621,0.00001790482,0.000002720319,0.0001924715,0.00008634455,0.0004592948,0.9939314,0.001422016,0.003659478],"study_design_scores_gemma":[0.009004458,0.004060923,0.001814389,0.0008386232,0.0001470961,0.0001271363,0.00191453,0.09509612,0.2540942,0.5283641,0.1011674,0.00337114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02466185,0.001397502,0.4044332,0.0007857677,0.000331335,0.001059013,0.00002173426,0.0003276412,0.566982],"genre_scores_gemma":[0.9871406,0.000008885666,0.01111951,0.001259226,0.00005897962,0.00005904061,0.000004129067,0.00001269256,0.0003369389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9624788,"threshold_uncertainty_score":0.6423965,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.003576549,0.002047721,0.001631795,0.0006551255,0.002404458,0.0009403226,0.002530616,0.004042462,0.002060617],"category_scores_gemma":[0.002291656,0.002642759,0.002186744,0.001098195,0.002590865,0.001413917,0.002020373,0.00276821,0.002355661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004263971,"about_ca_system_score_gemma":0.0008357306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004543143,"about_ca_topic_score_gemma":0.0003546916,"domain_scores_codex":[0.9872757,0.000630965,0.003452634,0.002912248,0.002074553,0.003653881],"domain_scores_gemma":[0.9884349,0.00378398,0.003671168,0.002299185,0.0005368345,0.001273995],"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.002008111,0.001037803,0.00001918967,0.002252313,0.002482534,0.0003381798,0.003067028,0.001325823,0.00330277,0.9505645,0.02647679,0.007124961],"study_design_scores_gemma":[0.006042073,0.004934154,0.00007893774,0.002129886,0.003718668,0.00100335,0.01190054,0.09234294,0.215747,0.6461647,0.01129221,0.004645641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9751652,0.005331391,0.002454947,0.001731914,0.001482853,0.0006349206,0.001329575,0.0006034591,0.01126575],"genre_scores_gemma":[0.976805,0.002818442,0.009683186,0.004296441,0.002296134,0.001661412,0.001226195,0.0007750356,0.0004381205],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3043998,"threshold_uncertainty_score":0.9995325,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225872,0.0001656351,0.0003088853,0.00006466902,0.000122544,0.00009694496,0.0003851033,0.0001268713,0.000002981911],"category_scores_gemma":[0.00001547109,0.0001240591,0.00008272191,0.000173813,0.00006848651,0.000106721,0.0001180192,0.00007224579,0.00001195764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003888294,"about_ca_system_score_gemma":0.00002672383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002589934,"about_ca_topic_score_gemma":0.000007330136,"domain_scores_codex":[0.9988793,0.00001831664,0.0002522767,0.0003643194,0.0001441305,0.0003417124],"domain_scores_gemma":[0.9992332,0.0001013146,0.0001446004,0.0003055499,0.0001472851,0.00006806357],"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.000009534488,0.00008235754,0.000092059,0.00006740776,0.00001104049,0.000002891219,0.0000683336,0.0003297402,0.001017014,0.9798746,0.01599715,0.002447925],"study_design_scores_gemma":[0.001001776,0.0005239816,0.002671854,0.00004326629,0.00002697625,0.00003585768,0.0001599652,0.01596799,0.01147344,0.924083,0.04337981,0.0006320842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08352382,0.02157333,0.7251241,0.001859769,0.0007188805,0.001501476,0.00004059503,0.0004131463,0.1652449],"genre_scores_gemma":[0.9945988,0.0001515396,0.003852997,0.0003876033,0.0002377309,0.00004972854,0.000008916211,0.000007881765,0.0007047998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.911075,"threshold_uncertainty_score":0.5058982,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008990453,0.0003926545,0.0003634109,0.0001158975,0.0004871042,0.0004723232,0.0008800487,0.0006150442,0.00003021952],"category_scores_gemma":[0.00008236388,0.0004140924,0.0004089195,0.0003646985,0.0002725936,0.000410546,0.0005020144,0.0003769347,0.0001779164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005960608,"about_ca_system_score_gemma":0.0002028605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003510063,"about_ca_topic_score_gemma":0.000129939,"domain_scores_codex":[0.9968776,0.00005935982,0.0007192104,0.0007982061,0.0006186753,0.0009269402],"domain_scores_gemma":[0.9979944,0.0002652387,0.0005840648,0.0008201269,0.0001041657,0.000231974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001330998,0.0002504616,0.00001992138,0.0003345505,0.0001538065,0.0001027287,0.0003550999,0.0001305899,0.002018627,0.9925328,0.002610696,0.001357607],"study_design_scores_gemma":[0.002870643,0.002222291,0.000373052,0.0001359443,0.0004492781,0.000683366,0.0009493872,0.8133727,0.03333487,0.1021925,0.04168118,0.001734788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8680885,0.001332271,0.1149325,0.001808986,0.0008315092,0.0002740355,0.00006451341,0.0003072433,0.01236042],"genre_scores_gemma":[0.9916065,0.0001907584,0.00574602,0.001183379,0.0006691755,0.0002292649,0.0001376878,0.00007032949,0.0001668603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8903403,"threshold_uncertainty_score":0.9998311,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002688461,0.0001144684,0.0002224366,0.00004497874,0.000126028,0.000005908802,0.00007787494,0.0001161077,0.00004828234],"category_scores_gemma":[0.0000504347,0.00009058549,0.00006883442,0.00007028544,0.0000942995,0.00003835643,0.00001782987,0.0000882387,0.000004355738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002968294,"about_ca_system_score_gemma":0.000009116667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.19513e-7,"about_ca_topic_score_gemma":0.000009488415,"domain_scores_codex":[0.9993438,0.00001914904,0.0001856136,0.0001693994,0.00007151487,0.0002105846],"domain_scores_gemma":[0.9994134,0.0002310507,0.0001047082,0.0001441984,0.00005845783,0.00004818424],"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.0001575578,0.0001647805,0.00005390606,0.00009572617,0.00005120699,0.000002163485,0.000191666,0.0000261625,0.001584647,0.9814451,0.004620411,0.01160662],"study_design_scores_gemma":[0.0002065827,0.00006089191,0.0001348847,0.00001240495,0.00003204111,0.00001638947,0.0002943841,0.000009862119,0.008918533,0.9771273,0.01307937,0.0001074153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7749343,0.002675394,0.08183041,0.01755213,0.0001702434,0.00268438,0.00006638622,0.0003479675,0.1197388],"genre_scores_gemma":[0.9912468,0.0003890877,0.006729657,0.0006673576,0.00007659618,0.0001171712,0.000006917883,0.00001330785,0.0007530781],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2163125,"threshold_uncertainty_score":0.3693969,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004247983,0.002002775,0.001046972,0.0007972883,0.002826602,0.001418857,0.00314919,0.005100581,0.03789891],"category_scores_gemma":[0.002206426,0.00318286,0.002812272,0.001553318,0.003658821,0.002100951,0.002481275,0.003319059,0.003315843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003055239,"about_ca_system_score_gemma":0.001790212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005705454,"about_ca_topic_score_gemma":0.001023099,"domain_scores_codex":[0.9845666,0.0006041238,0.003970148,0.003293615,0.003427396,0.004138152],"domain_scores_gemma":[0.9860979,0.003322198,0.004364077,0.004114076,0.0003989365,0.001702767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004515963,0.001248277,0.00001510675,0.002704422,0.002664403,0.001905104,0.003183577,0.002099256,0.006869734,0.9225389,0.04915521,0.003100063],"study_design_scores_gemma":[0.004483964,0.004005911,0.0001746926,0.001914577,0.003453817,0.00256933,0.006486391,0.2675898,0.6913072,0.007097648,0.007311943,0.003604692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8284016,0.002975061,0.002911671,0.001286039,0.002272458,0.0001762518,0.0008327067,0.0004542941,0.1606899],"genre_scores_gemma":[0.9779071,0.003287523,0.006258302,0.003246973,0.003302529,0.001475065,0.00274901,0.001142211,0.0006313203],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9154412,"threshold_uncertainty_score":0.9996178,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003500081,0.0001211312,0.0003359461,0.00002490086,0.00005823236,0.000003651779,0.0001461026,0.0001213445,0.0000898832],"category_scores_gemma":[0.00005935536,0.00008119085,0.00007927987,0.00009809676,0.0002340579,0.0000397513,0.0000320395,0.00008955655,0.000009149116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001887388,"about_ca_system_score_gemma":0.00001070894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002984967,"about_ca_topic_score_gemma":0.00002879783,"domain_scores_codex":[0.9991692,0.00004487219,0.0003444488,0.0001377194,0.0001078371,0.0001959056],"domain_scores_gemma":[0.9990293,0.0004615935,0.0001778517,0.0002244411,0.00005957964,0.00004724659],"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.0006016804,0.000156221,0.0001081524,0.0001239277,0.0001020017,0.000001608584,0.002419582,0.00002043345,0.01028037,0.9754956,0.003916389,0.006773978],"study_design_scores_gemma":[0.0004965122,0.000103795,0.0001771176,0.00003181848,0.00003955661,0.000007383765,0.0007876059,0.000006967436,0.0283367,0.965083,0.004813315,0.0001162151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9850715,0.0005698457,0.001121867,0.001760018,0.00001979696,0.0003013718,0.00005767143,0.00001821839,0.01107967],"genre_scores_gemma":[0.9961307,0.0001636612,0.002765534,0.0005782465,0.00004057125,0.0000126796,0.00000357514,0.00001111481,0.0002939247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01805633,"threshold_uncertainty_score":0.3310867,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004896318,0.0001039377,0.0003502247,0.00003282206,0.00003260563,0.000003409413,0.0001393914,0.0001912499,0.00032809],"category_scores_gemma":[0.0001076355,0.00007999355,0.00004721705,0.00007946353,0.0003267758,0.0000382949,0.00006510707,0.0001048903,0.000008462198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001593191,"about_ca_system_score_gemma":0.00001984564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001604439,"about_ca_topic_score_gemma":0.000001640606,"domain_scores_codex":[0.9992059,0.00009232008,0.0002913194,0.0001590269,0.00008704214,0.0001643947],"domain_scores_gemma":[0.9990563,0.0003747387,0.0001469242,0.0002601453,0.0001172486,0.00004459066],"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.00005605843,0.0001536362,0.00008414149,0.00007708366,0.00004082203,5.09933e-7,0.0003180728,0.000002528576,0.0008401296,0.9957088,0.001274983,0.001443274],"study_design_scores_gemma":[0.0002154741,0.0001758041,0.0002423515,0.000005774977,0.00001879532,0.000002699023,0.000190066,0.00001809879,0.005968331,0.993035,0.00005355978,0.00007410648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9490385,0.0001783847,0.0005055143,0.0004504629,0.0001173336,0.0002910192,0.000005158151,0.00002629872,0.04938731],"genre_scores_gemma":[0.9990775,0.00006161604,0.0004665373,0.0002599743,0.00003874214,0.00001957506,0.000002998202,0.000007092193,0.00006595405],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.050039,"threshold_uncertainty_score":0.3592355,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009059447,0.00008815731,0.0002267897,0.00003789445,0.00004996858,0.00000633012,0.0001507672,0.00007549062,0.000003654792],"category_scores_gemma":[0.0002557537,0.00005647937,0.00002758392,0.0001003418,0.0001664635,0.0000600758,0.00006308989,0.0001252104,8.058175e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001967899,"about_ca_system_score_gemma":0.00001276229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003030884,"about_ca_topic_score_gemma":0.00001435963,"domain_scores_codex":[0.9992698,0.00007338385,0.0002636917,0.0001205941,0.0001149839,0.0001574966],"domain_scores_gemma":[0.9990552,0.000526509,0.0001869575,0.0001665964,0.00003928122,0.00002543341],"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.00005216545,0.00005991048,0.0002728026,0.00009546812,0.00001047382,0.000003133889,0.007313272,0.0003603996,0.001775437,0.9882451,0.0001611264,0.001650718],"study_design_scores_gemma":[0.0002088244,0.00006224362,0.0001466718,0.0000540186,0.000008730514,0.000005492078,0.008247054,0.0002186581,0.01126367,0.9795747,0.0001348947,0.00007504093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9732835,0.0006686869,0.006432468,0.0003403643,0.00002438758,0.0002217781,0.000002533971,0.00001428531,0.01901205],"genre_scores_gemma":[0.9964746,0.00002737706,0.003183597,0.0002046696,0.00003505802,0.00001145769,0.000001477684,0.000005264288,0.00005654024],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02319111,"threshold_uncertainty_score":0.2303162,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170437,0.0002075813,0.0004683327,0.0001815787,0.00005343305,0.00001113358,0.0004893062,0.0001063716,0.0005293174],"category_scores_gemma":[0.000170255,0.0001693291,0.0001153014,0.0002449627,0.0001383134,0.00005108904,0.0004350481,0.0001669446,0.00002561192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006971107,"about_ca_system_score_gemma":0.00001416845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002589005,"about_ca_topic_score_gemma":0.00003026076,"domain_scores_codex":[0.9982583,0.00006960457,0.0005290965,0.0003097024,0.000412526,0.0004207725],"domain_scores_gemma":[0.9985875,0.0003456359,0.0001962207,0.0006035662,0.0001078482,0.0001591693],"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.0006630558,0.0007516063,0.0003227624,0.0005060945,0.0001519785,0.000009793598,0.003442533,0.000002280324,0.01334584,0.9687694,0.006615323,0.00541935],"study_design_scores_gemma":[0.0009139496,0.0008992863,0.002154982,0.0000736443,0.0000452062,0.000002693767,0.00101079,0.000009232768,0.0294484,0.9646839,0.0005268656,0.0002310375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9659773,0.0002776367,0.005285887,0.0005008735,0.00004972681,0.001069663,0.00009457546,0.00004983849,0.02669453],"genre_scores_gemma":[0.9903703,0.00008740988,0.00866343,0.0005934087,0.00004664664,0.00007375063,0.000009405865,0.00002634983,0.0001292855],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02656525,"threshold_uncertainty_score":0.690504,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004716328,0.0002209097,0.0005116873,0.0001238755,0.0000543543,0.00005908319,0.0006817048,0.0001316775,0.00006340755],"category_scores_gemma":[0.00002405187,0.000183914,0.0001173738,0.0004288022,0.0002430635,0.0001870639,0.0003936978,0.0001686521,0.0000244407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009774223,"about_ca_system_score_gemma":0.00009300754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001243139,"about_ca_topic_score_gemma":0.000004589253,"domain_scores_codex":[0.9982885,0.00004909111,0.0003986669,0.0005739111,0.0003454434,0.0003444347],"domain_scores_gemma":[0.9985897,0.0001623332,0.0002660384,0.0006513125,0.0002273721,0.0001032557],"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.00006037094,0.0004190106,0.00835396,0.000217774,0.000103205,0.000006342444,0.0006877877,0.0001318361,0.006753301,0.9001328,0.0006325808,0.08250106],"study_design_scores_gemma":[0.001414448,0.001498495,0.06551909,0.00006981385,0.00003034787,0.00006185555,0.0003466641,0.00195741,0.0244281,0.9014381,0.00246995,0.0007657036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9088429,0.000757718,0.03097631,0.001007317,0.0004154667,0.001004,0.00001913132,0.0001197711,0.05685743],"genre_scores_gemma":[0.9953024,0.00002548459,0.004169327,0.0003277469,0.00004855257,0.00001264093,0.000002357588,0.000008297839,0.0001031462],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08645958,"threshold_uncertainty_score":0.7499795,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003808665,0.0001589077,0.0003839054,0.0001538729,0.00002997876,0.00004399126,0.0005875963,0.00009306012,0.00001440164],"category_scores_gemma":[0.00001690953,0.0001329634,0.00006186606,0.0003323286,0.0001240365,0.0002235319,0.0003448294,0.0001416908,0.000001794302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008722255,"about_ca_system_score_gemma":0.00003615569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000261785,"about_ca_topic_score_gemma":0.00003519727,"domain_scores_codex":[0.9986891,0.00003901916,0.0004029207,0.0003771527,0.0002172208,0.0002746092],"domain_scores_gemma":[0.9992039,0.0001012771,0.0001414015,0.0004152794,0.00007456334,0.00006354444],"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.00002717024,0.0002467962,0.0001937542,0.00008559404,0.00002543119,0.000002855046,0.001401434,0.02090149,0.001760982,0.8353411,0.000209968,0.1398034],"study_design_scores_gemma":[0.0002719951,0.0001126115,0.001713691,0.00001524978,0.000004083169,0.000006087153,0.00005765904,0.1016483,0.009539631,0.8862959,0.0001735053,0.000161248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6049093,0.002292802,0.3747418,0.002426623,0.0001109901,0.0005362618,0.000009417442,0.00009731857,0.0148755],"genre_scores_gemma":[0.9491158,0.00005824742,0.05031708,0.0004468301,0.00003028811,0.000008927112,0.000001180053,0.000004921214,0.00001673316],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3442065,"threshold_uncertainty_score":0.542209,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005567574,0.0000837847,0.0001980792,0.0000129026,0.0001605907,0.00000405983,0.0002163624,0.00006756878,0.00001581105],"category_scores_gemma":[0.0001806467,0.0000227177,0.00006865936,0.00006874899,0.0009915212,0.00002290551,0.00006059853,0.00005745385,7.984777e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":9.322254e-7,"about_ca_system_score_gemma":0.00001348359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002126998,"about_ca_topic_score_gemma":0.00002009716,"domain_scores_codex":[0.9993439,0.0001054296,0.0002454116,0.00008586684,0.0001056208,0.0001137905],"domain_scores_gemma":[0.998609,0.0007845042,0.0002470907,0.0002734287,0.00007319906,0.00001276025],"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.0003547704,0.00006075664,0.0001135387,0.00005699819,0.00009145497,1.48733e-7,0.0008815894,0.00001552576,0.00564636,0.983242,0.005214609,0.004322303],"study_design_scores_gemma":[0.00047438,0.00005006771,0.0001345285,0.00003025491,0.00003146052,0.000001636349,0.0004227577,0.000004815836,0.04247306,0.9517803,0.004553554,0.00004324602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8407923,0.007114345,0.05148811,0.07248555,0.0003767907,0.003811428,0.0001613329,0.00009011685,0.02368],"genre_scores_gemma":[0.9984396,0.0005862784,0.00006725558,0.0004777111,0.00001651587,0.00001682539,9.041508e-7,0.000005618988,0.0003892934],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1576473,"threshold_uncertainty_score":0.3653301,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004512476,0.00007516819,0.0001852904,0.00002764682,0.00005728007,0.000006283098,0.00004738735,0.00006016053,0.00004387848],"category_scores_gemma":[0.00004944034,0.00004878908,0.00002007558,0.00003335481,0.0004530359,0.00003874766,0.00002442557,0.00009681292,0.000001817928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001223694,"about_ca_system_score_gemma":0.000005001165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003303506,"about_ca_topic_score_gemma":0.00002219247,"domain_scores_codex":[0.999498,0.00005670582,0.0001671726,0.00009777711,0.00005428527,0.0001260574],"domain_scores_gemma":[0.9994931,0.0003245612,0.00007507278,0.00007513251,0.00001324828,0.0000189013],"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.0001963127,0.00003075445,0.00008394243,0.00002422934,0.00000976568,0.000001561098,0.0008988035,0.0000160379,0.0002309332,0.9960408,0.0001930361,0.002273818],"study_design_scores_gemma":[0.0008345703,0.00002910034,0.0002824019,0.00001391944,0.00001056507,0.000007583876,0.001003802,0.0000564821,0.00311519,0.9941458,0.0004392334,0.00006131687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9903824,0.0008040202,0.002643961,0.00301036,0.00001435848,0.000161938,0.000004871461,0.00001240366,0.002965716],"genre_scores_gemma":[0.9976897,0.0002430787,0.0007509132,0.001144514,0.00005175688,0.00001449139,0.000001695361,0.000003974023,0.00009986486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00730734,"threshold_uncertainty_score":0.1989561,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004690864,0.00008993113,0.0001930985,0.00004070007,0.00005272227,0.00008132576,0.0003317185,0.00003890037,0.00002059414],"category_scores_gemma":[0.000008738023,0.00005111684,0.00005587751,0.0002360991,0.00007882638,0.0001164487,0.00006236816,0.00005791772,0.00001291331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":9.656295e-7,"about_ca_system_score_gemma":0.00001207938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003361025,"about_ca_topic_score_gemma":0.000007270352,"domain_scores_codex":[0.9992915,0.00002495578,0.0002125107,0.0001586491,0.0001568516,0.0001555128],"domain_scores_gemma":[0.9993215,0.000083428,0.0001635456,0.0003462764,0.00005076542,0.00003450522],"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":[7.434334e-7,0.00005237326,0.00003955045,0.0000485987,0.00001622397,5.9454e-7,0.001143598,0.000001953062,0.0002205909,0.9888175,0.001697408,0.007960923],"study_design_scores_gemma":[0.0001453214,0.00007961586,0.0001038267,0.00001316295,0.000009363473,0.000007672806,0.001237688,0.00007461714,0.0379464,0.9194468,0.04080548,0.0001300288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08652288,0.0376187,0.3195678,0.02181665,0.001827347,0.003166024,0.000004810802,0.0003313517,0.5291445],"genre_scores_gemma":[0.9962572,0.0002124886,0.001758577,0.0009905506,0.00001948236,0.00001137344,2.906338e-7,0.000003410024,0.0007465612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9097344,"threshold_uncertainty_score":0.2084484,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002116989,0.0001370558,0.0002370156,0.00005123682,0.00008505145,0.00004771077,0.0004460805,0.0001126067,0.00002450698],"category_scores_gemma":[0.00001978294,0.00009645322,0.00006490452,0.0001857867,0.00007844726,0.00008779622,0.0001078898,0.0001148948,0.00003200215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003039246,"about_ca_system_score_gemma":0.00001565978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001295601,"about_ca_topic_score_gemma":0.000002378285,"domain_scores_codex":[0.9990782,0.00002157306,0.0001756198,0.0003171217,0.0001269822,0.0002805487],"domain_scores_gemma":[0.999463,0.00004674515,0.00007980697,0.0002707258,0.00004508111,0.00009470506],"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.000008278234,0.0001023574,0.00005279047,0.000006593832,0.000006927524,0.000008160215,0.0002251284,0.000007737825,0.001443963,0.9341959,0.00139984,0.06254227],"study_design_scores_gemma":[0.0003297693,0.0006049924,0.01852149,0.00001115807,0.000007600288,0.00002575082,0.00008084496,0.001196976,0.003861847,0.9704722,0.00457938,0.0003080075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4467596,0.006071214,0.1082167,0.016455,0.0002944372,0.000529587,0.000005228388,0.0005009399,0.4211673],"genre_scores_gemma":[0.9927858,0.0002441096,0.003944074,0.002734546,0.00003642098,0.00000402809,0.000002006792,0.00000239421,0.0002466571],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5460262,"threshold_uncertainty_score":0.3933248,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001752362,0.00008027213,0.0001852019,0.00002616195,0.00005736032,0.000003796186,0.0000628944,0.00007517892,0.00004696695],"category_scores_gemma":[0.00001627725,0.00006091661,0.00003724784,0.00004782499,0.0001703731,0.0000265078,0.00002150604,0.00007072731,0.000005930553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001069749,"about_ca_system_score_gemma":0.00000641461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003751642,"about_ca_topic_score_gemma":0.000006156959,"domain_scores_codex":[0.9995232,0.00001753118,0.0001399592,0.0001175188,0.00006289977,0.000138897],"domain_scores_gemma":[0.9996614,0.0001242623,0.00007150595,0.00009898592,0.00002290584,0.00002097236],"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.00001997803,0.00002886365,0.0001047715,0.00002574755,0.00001171048,0.000003779536,0.00004823964,0.00001296075,0.001495693,0.9947952,0.002329489,0.00112358],"study_design_scores_gemma":[0.00009122249,0.00003475404,0.0003009185,0.000004972797,0.00001086707,0.000007444648,0.000172696,0.000001785894,0.009197835,0.9886984,0.001407337,0.00007182929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8275531,0.001196003,0.00345687,0.001024198,0.00004742406,0.0001577377,0.00001243592,0.00006332833,0.1664889],"genre_scores_gemma":[0.9961686,0.00004925092,0.002955438,0.0002915884,0.00007941234,0.000007098305,0.000003383101,0.000004809998,0.0004404439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1686155,"threshold_uncertainty_score":0.2484107,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002342067,0.0001127008,0.0003785185,0.00004264511,0.00004216519,0.00001010154,0.00009496755,0.00007485284,0.0001349332],"category_scores_gemma":[0.0001131307,0.00007315994,0.00008236689,0.0001684487,0.0003068704,0.00003115084,0.00004379778,0.0000728399,0.000004990159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000176148,"about_ca_system_score_gemma":0.00001099595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002978132,"about_ca_topic_score_gemma":0.000001793354,"domain_scores_codex":[0.9992325,0.0000167145,0.0003282641,0.0001301113,0.0001546847,0.0001377332],"domain_scores_gemma":[0.9993377,0.0002229212,0.0001289053,0.0001597285,0.00009440193,0.0000563696],"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.00002974983,0.000160474,7.012518e-7,0.0002366894,0.00006017702,8.601136e-7,0.0002560942,0.0000670137,0.0008999713,0.9977461,0.00003791498,0.0005042321],"study_design_scores_gemma":[0.0001651617,0.0000646546,0.000004937564,0.00004651138,0.00006366517,0.000001720794,0.0001953759,0.00010206,0.02004191,0.9792235,0.00000680706,0.00008364375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6214271,0.0004697373,0.1934299,0.002895032,0.00002498318,0.0004520238,0.00005843498,0.00009997543,0.1811428],"genre_scores_gemma":[0.995324,0.00005930977,0.004373472,0.0001592754,0.0000158848,0.000008515573,0.000004662619,0.000006783656,0.0000480995],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3738969,"threshold_uncertainty_score":0.2983376,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001872132,0.0001241009,0.000227215,0.00005929362,0.0001026097,0.00003457979,0.0005416535,0.00008462359,0.0000118316],"category_scores_gemma":[0.00002415756,0.00009198036,0.00005717609,0.0001924429,0.0001074716,0.00009257921,0.0001853617,0.00008124452,0.00003611797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001589572,"about_ca_system_score_gemma":0.0000218965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002110497,"about_ca_topic_score_gemma":0.000004043688,"domain_scores_codex":[0.9990985,0.00002367813,0.0001908725,0.0002705966,0.0001729042,0.0002434327],"domain_scores_gemma":[0.9992471,0.00005855164,0.0001064795,0.0004626026,0.00004535624,0.00007994962],"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.000008680815,0.00007775964,0.000641803,0.0000289511,0.00002957074,0.00002275571,0.0004610209,0.000005810908,0.0005557292,0.9716067,0.006683499,0.01987777],"study_design_scores_gemma":[0.0006523705,0.0005285177,0.005413712,0.000006574688,0.00001385476,0.0001596079,0.00008488265,0.0002539091,0.0148262,0.9471596,0.03040969,0.0004910719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4802872,0.01809725,0.3019891,0.009052474,0.00129116,0.001479456,0.00001009091,0.0009437495,0.1868495],"genre_scores_gemma":[0.996473,0.0001749214,0.002160268,0.0008036976,0.00009553242,0.00001332743,0.000001721042,0.000005178075,0.0002723353],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5161858,"threshold_uncertainty_score":0.375085,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001213514,0.0001869859,0.0004351489,0.00008672527,0.00006237739,0.00003685696,0.0007798163,0.0001207926,0.00001958566],"category_scores_gemma":[0.00009516915,0.0001482441,0.00009805701,0.0003197169,0.0003645839,0.0001144519,0.0004422488,0.0002813073,0.000002690172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003670849,"about_ca_system_score_gemma":0.00005082562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009991586,"about_ca_topic_score_gemma":0.00001779872,"domain_scores_codex":[0.998404,0.00006052278,0.0004298495,0.0004870273,0.0003305258,0.0002880645],"domain_scores_gemma":[0.9985188,0.0001965231,0.0002112698,0.0007599739,0.0002016175,0.0001118589],"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.00005292859,0.0007867811,0.003086519,0.0003670985,0.00004686465,0.000003645216,0.00126197,0.0002936005,0.03579343,0.8193616,0.0001510497,0.1387945],"study_design_scores_gemma":[0.0003136972,0.0002226509,0.01806349,0.0000189641,0.00001059719,0.00001320346,0.00003839179,0.003816914,0.157575,0.8194903,0.0001706171,0.0002662355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9229974,0.0002369881,0.06849564,0.00116032,0.0001590461,0.0004872477,0.000004052302,0.00008661061,0.006372763],"genre_scores_gemma":[0.9815841,0.000005632921,0.01816491,0.0001606325,0.00005437211,0.00001849959,8.677149e-7,0.000005760729,0.000005265195],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1385282,"threshold_uncertainty_score":0.6045218,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001484263,0.001227045,0.00183868,0.0003695685,0.0009141869,0.0008374027,0.006338838,0.001256234,0.00006834718],"category_scores_gemma":[0.0002800763,0.0008762414,0.0005156161,0.0006264466,0.0005380692,0.0002523647,0.003158448,0.00176155,0.0003673201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004988393,"about_ca_system_score_gemma":0.0002827404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008016596,"about_ca_topic_score_gemma":0.0004312064,"domain_scores_codex":[0.9937679,0.0002108632,0.001045516,0.002262293,0.00130346,0.001409957],"domain_scores_gemma":[0.9935285,0.0002316259,0.001405996,0.003687475,0.000601153,0.000545209],"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.00003580557,0.0002190483,0.00003828447,0.0002518493,0.0001218902,0.00009124876,0.0004447177,0.0001504015,0.00004731453,0.01773285,0.9337453,0.04712128],"study_design_scores_gemma":[0.0004224373,0.0005006069,0.004640921,0.0002361252,0.0001098462,0.0001008866,0.0002275182,0.002213362,0.000238132,0.07796944,0.9116006,0.001740096],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002969058,0.06390344,0.2828426,0.19986,0.1690227,0.01903981,0.002354661,0.003341294,0.2566664],"genre_scores_gemma":[0.4884567,0.01184851,0.06208464,0.09126795,0.0346263,0.003025625,0.001584147,0.000806907,0.3062992],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.4854876,"threshold_uncertainty_score":0.9993688,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001720321,0.0001192039,0.0002934713,0.00004078491,0.00006320386,0.00001039745,0.0001331089,0.0001341872,0.001159014],"category_scores_gemma":[0.000045479,0.00009233774,0.00004620722,0.00006313028,0.0002348045,0.00003319861,0.00006946843,0.0001132204,0.000113498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001100103,"about_ca_system_score_gemma":0.00000821018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009965406,"about_ca_topic_score_gemma":0.000007096733,"domain_scores_codex":[0.999237,0.00003422652,0.0002436951,0.0001699124,0.00007659719,0.0002385734],"domain_scores_gemma":[0.9994051,0.0001835349,0.0001102151,0.0001943146,0.00004554163,0.00006126166],"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.00001016467,0.00008532072,0.0003419908,0.0000477894,0.0000372469,0.000002347697,0.0002232465,2.636369e-7,0.003285194,0.9657062,0.02572368,0.004536592],"study_design_scores_gemma":[0.0001592734,0.0000930637,0.001820173,0.000005643668,0.00001262237,0.00001420933,0.0002467847,0.000005133651,0.0085628,0.9874144,0.001560102,0.0001058392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9487253,0.0002113778,0.0002430634,0.004079551,0.00004224261,0.0002570362,0.00000327226,0.00005151622,0.04638664],"genre_scores_gemma":[0.9959149,0.00004271893,0.001522221,0.001821276,0.0000572702,0.00004661712,0.000003293608,0.0000086538,0.0005831023],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04718954,"threshold_uncertainty_score":0.9997541,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008661819,0.000113804,0.0003120805,0.00004903448,0.00006118532,0.000004180256,0.00006441875,0.0001303893,0.00002626869],"category_scores_gemma":[0.0006660867,0.00009086532,0.00002992749,0.00008877205,0.0003341194,0.00003741473,0.00007579276,0.0001510251,0.000002440611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002321891,"about_ca_system_score_gemma":0.000008815748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002847276,"about_ca_topic_score_gemma":0.00004085061,"domain_scores_codex":[0.9991783,0.00008998686,0.0002566633,0.0002353501,0.0000589695,0.000180658],"domain_scores_gemma":[0.9985582,0.00102403,0.00008202369,0.0002425458,0.00003711001,0.0000561438],"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.00006013929,0.0001094179,0.003253365,0.00007811563,0.000006302282,8.162232e-7,0.0002729661,0.000004625629,0.0003768964,0.9870946,0.0001134417,0.008629267],"study_design_scores_gemma":[0.0002365462,0.00006575214,0.02969715,0.0000103426,0.000007845855,0.000003455438,0.0001674134,0.00001478074,0.0008137099,0.9685402,0.0003507974,0.00009200915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9922138,0.0002113909,0.001409669,0.0008590015,0.00001383185,0.0001877803,0.000003515336,0.00002206337,0.005078886],"genre_scores_gemma":[0.9960211,0.00007639417,0.002860296,0.00098158,0.00001421054,0.00001740141,0.000001764361,0.000005820052,0.00002144398],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02644378,"threshold_uncertainty_score":0.370538,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004565486,0.0001053176,0.0002379736,0.00002490538,0.0001281542,0.0000108652,0.00005825537,0.00006391589,0.00005808695],"category_scores_gemma":[0.000009675537,0.00006696864,0.00002743615,0.00004221882,0.0003709523,0.00004679026,0.0000231599,0.00009728649,0.000001987374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000237774,"about_ca_system_score_gemma":0.000005751589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002942456,"about_ca_topic_score_gemma":0.00003872543,"domain_scores_codex":[0.9994203,0.00004533703,0.0001708825,0.0001256942,0.00007790954,0.0001598036],"domain_scores_gemma":[0.9994512,0.0002720864,0.0001164474,0.0001162648,0.00002132924,0.00002271631],"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.0001401284,0.00004720483,0.00008939648,0.0000366815,0.00002440896,0.000001333078,0.0001250261,0.00003834933,0.0003651569,0.9917877,0.007109099,0.0002354604],"study_design_scores_gemma":[0.0007850439,0.00003421103,0.0002261508,0.000008158027,0.00002711759,0.000008326013,0.000524197,0.00006725693,0.002396357,0.9942572,0.001585066,0.00008090138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9541903,0.002908552,0.004754997,0.005003398,0.00003452309,0.0005389098,0.00006100633,0.00004740175,0.03246088],"genre_scores_gemma":[0.9978513,0.0002495882,0.0004428856,0.00108411,0.00005367145,0.00001007422,0.00003159955,0.000006806206,0.0002700119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04366092,"threshold_uncertainty_score":0.2730902,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005028744,0.0001885647,0.0003793504,0.0001412478,0.00006155675,0.00005970639,0.0005439385,0.00007940787,0.000003233351],"category_scores_gemma":[0.00001407937,0.0001449543,0.00003858876,0.0007433317,0.00006628732,0.00009631972,0.0001480049,0.0001313661,0.0000120528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001091953,"about_ca_system_score_gemma":0.00003073994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009835194,"about_ca_topic_score_gemma":0.00001150239,"domain_scores_codex":[0.9986206,0.000059892,0.0002414902,0.0005618903,0.0001924003,0.0003237247],"domain_scores_gemma":[0.9990487,0.0001696177,0.00008640872,0.0004769561,0.0001009501,0.0001174079],"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.00008375167,0.0006508806,0.001146993,0.00007277575,0.00001746091,0.00001688578,0.0004086224,0.002266879,0.003929566,0.6870929,0.0001508784,0.3041624],"study_design_scores_gemma":[0.001064131,0.001982819,0.2189915,0.00006957286,0.00001194281,0.00003392845,0.0001091639,0.0009786283,0.01215782,0.7621297,0.001794324,0.0006765691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2168543,0.000462302,0.7703086,0.004221965,0.00003195359,0.00172793,0.000004614211,0.0001660689,0.006222219],"genre_scores_gemma":[0.9756477,0.00001730147,0.02257014,0.001590226,0.00003055668,0.0001274371,0.000002193666,0.000004740072,0.000009647506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7587935,"threshold_uncertainty_score":0.5911066,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005487843,0.0001555692,0.0003338733,0.00005357217,0.0001011907,0.00003609273,0.0007449241,0.00006444275,0.000009895264],"category_scores_gemma":[0.00001496389,0.000107144,0.00006762442,0.0003099395,0.0005921813,0.0001417139,0.0005067746,0.0001368224,0.000002143162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006707255,"about_ca_system_score_gemma":0.00002996215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008456047,"about_ca_topic_score_gemma":0.00008734502,"domain_scores_codex":[0.9985943,0.00007025049,0.0004040147,0.000320686,0.0002132882,0.0003974302],"domain_scores_gemma":[0.9991322,0.00009337888,0.0001743612,0.000437597,0.00008486667,0.00007757617],"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.0000482422,0.0002843884,0.001942368,0.0000485727,0.00001994228,0.00000458311,0.001606396,0.0002237675,0.0002684329,0.9730418,0.0002277359,0.02228372],"study_design_scores_gemma":[0.0002696153,0.0002626761,0.1283192,0.00001328322,0.000004029383,0.00001061691,0.0002725894,0.004269319,0.006965409,0.8590758,0.0003599425,0.0001774985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8490435,0.002153828,0.1253837,0.005093072,0.0004810697,0.001128606,0.00001954499,0.0001669773,0.01652966],"genre_scores_gemma":[0.983899,0.0001188725,0.01572019,0.0002093576,0.00002555819,0.00000899172,0.000001471652,0.000004272517,0.00001231242],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1348554,"threshold_uncertainty_score":0.4369206,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001910041,0.0001426693,0.000279202,0.00009770974,0.00009492685,0.00001358495,0.0001163504,0.0001892078,0.0003410155],"category_scores_gemma":[0.00009394324,0.0001156744,0.00004669197,0.00008993861,0.0002270552,0.00005083811,0.00005714594,0.0003403374,0.000007134905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001612671,"about_ca_system_score_gemma":0.00002215236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003599137,"about_ca_topic_score_gemma":0.0001264726,"domain_scores_codex":[0.9992183,0.00002508825,0.0002546105,0.0001918058,0.00007699172,0.0002332295],"domain_scores_gemma":[0.9993608,0.000244835,0.0001142568,0.000196879,0.00002942855,0.0000538215],"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.0001425271,0.00009799917,0.0005510402,0.00003596318,0.00002510876,0.000002555278,0.0002588745,0.000003944869,0.01735155,0.9793344,0.001047444,0.001148561],"study_design_scores_gemma":[0.0003705008,0.00006688766,0.005415384,0.000004884373,0.00001529528,0.000006726812,0.0003218653,0.000003976753,0.007311286,0.9851702,0.001184799,0.000128167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9782562,0.00007948443,0.0005502849,0.0003102267,0.00009344723,0.0001460379,0.00001474387,0.00003348303,0.02051606],"genre_scores_gemma":[0.9965435,0.00001855869,0.002430889,0.000356755,0.00008464169,0.0000139346,0.00001013283,0.00001150098,0.0005300465],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01998601,"threshold_uncertainty_score":0.4717064,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008952327,0.00008924018,0.0002109387,0.00002779172,0.0001014535,0.000003471836,0.0001032833,0.00008803583,0.00002184153],"category_scores_gemma":[0.0001199715,0.00005841159,0.00004515193,0.00009082658,0.0002114109,0.00004641544,0.0000350039,0.00006126279,0.000001303299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001313674,"about_ca_system_score_gemma":0.0000086106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.156564e-7,"about_ca_topic_score_gemma":0.000001177106,"domain_scores_codex":[0.9993544,0.00007210371,0.0002178472,0.0001483269,0.00007342479,0.0001338516],"domain_scores_gemma":[0.9985708,0.001005868,0.0001482899,0.0001920256,0.00005671068,0.00002629561],"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.0004895973,0.0001300847,0.00002925898,0.0001211189,0.00002892856,3.056675e-7,0.000892136,0.000005948992,0.1003949,0.8888866,0.0004179424,0.008603168],"study_design_scores_gemma":[0.0002099872,0.0001459647,0.001676304,0.000007187782,0.00002296315,0.000001196988,0.001111272,0.0001435657,0.04784367,0.9485233,0.0002448361,0.00006973084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9846038,0.00007460519,0.0142669,0.0004164005,0.00002813456,0.0003776847,0.00008852771,0.0000368329,0.0001071815],"genre_scores_gemma":[0.9989951,0.00008156239,0.0003949854,0.0002570494,0.00003041883,0.00005082679,0.0001006595,0.000009277908,0.00008008101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0596367,"threshold_uncertainty_score":0.2381956,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007825018,0.0002217671,0.0003277153,0.00009186613,0.0001829858,0.0003103403,0.001085649,0.00008096106,0.00001572394],"category_scores_gemma":[0.00004432715,0.0001494157,0.00009586081,0.0005026557,0.00009984698,0.0002052274,0.0005668299,0.0001724137,0.00001857856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001304337,"about_ca_system_score_gemma":0.00004624785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001464547,"about_ca_topic_score_gemma":0.00004526222,"domain_scores_codex":[0.9981983,0.00006099041,0.0003407906,0.0005781277,0.0003785866,0.0004432415],"domain_scores_gemma":[0.9986319,0.0002147683,0.000125219,0.0007326844,0.0001184181,0.0001770054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001067235,0.0005512996,0.00005621243,0.00005257367,0.00007932127,0.00000903371,0.009223608,0.01770158,0.006344687,0.1331095,0.01395906,0.8188064],"study_design_scores_gemma":[0.008874752,0.00351453,0.02238073,0.0003188267,0.0001720705,0.0001870539,0.006984411,0.07995606,0.3530809,0.1926219,0.3272055,0.004703315],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.811783,0.002035904,0.05325609,0.127053,0.0006332352,0.001421053,0.00001397738,0.0002457333,0.003557995],"genre_scores_gemma":[0.9857971,0.0001325708,0.005496624,0.008194678,0.0002228654,0.00003680048,0.000002641322,0.000008340101,0.0001084014],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8141031,"threshold_uncertainty_score":0.6092994,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000154252,0.0001177203,0.0002322549,0.00003564829,0.00006993922,0.000007009794,0.00007224284,0.0001075616,0.0001108827],"category_scores_gemma":[0.00005175601,0.00006597363,0.0000239444,0.00003768753,0.0002658971,0.00005502584,0.0000520963,0.00005997497,0.000002533939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001120171,"about_ca_system_score_gemma":0.000006553364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.489889e-7,"about_ca_topic_score_gemma":0.000006828112,"domain_scores_codex":[0.9994453,0.00001802705,0.0001427874,0.0001580143,0.00006262281,0.0001732265],"domain_scores_gemma":[0.9994181,0.0002657841,0.00009980532,0.0001370179,0.00002554321,0.0000537429],"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.00005413212,0.00001872624,0.0001293784,0.00004340167,0.00002538138,0.000001691761,0.0001956941,4.560204e-7,0.001961104,0.982329,0.0003286555,0.01491234],"study_design_scores_gemma":[0.0002801509,0.00006058577,0.001045295,0.00001410621,0.00001400666,0.000009426072,0.0003398717,6.032893e-7,0.01569369,0.9817359,0.0007044931,0.0001018855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9746787,0.0006610648,0.003556095,0.002170295,0.00003604928,0.0001567537,0.00001734244,0.00004297155,0.01868073],"genre_scores_gemma":[0.9976431,0.0003137914,0.001345102,0.0003556167,0.00004720509,0.000006066823,0.000001020198,0.000008093305,0.0002799648],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02296444,"threshold_uncertainty_score":0.2690327,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001316465,0.0003402804,0.0008461502,0.0001305469,0.0000668685,0.0000246972,0.00030727,0.0009288794,0.0002534334],"category_scores_gemma":[0.0002785173,0.0002911005,0.00008062313,0.0001068181,0.0006691549,0.00004244586,0.000767114,0.0006758336,0.0000156873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001069613,"about_ca_system_score_gemma":0.00008066648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004709987,"about_ca_topic_score_gemma":0.00009894848,"domain_scores_codex":[0.998125,0.0001636988,0.000559945,0.0005959446,0.0001866391,0.0003687388],"domain_scores_gemma":[0.9983915,0.0005248226,0.0003792877,0.0005255821,0.00008397952,0.00009481731],"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.0005990079,0.0003313884,0.004637416,0.0008675024,0.0001403042,0.00003715839,0.00138082,0.000004376762,0.0002642845,0.9782668,0.01126342,0.002207559],"study_design_scores_gemma":[0.0003660489,0.0001469744,0.006797271,0.00005830531,0.00004387501,0.0000151995,0.0000989258,0.000009926737,0.001101967,0.9898668,0.001212262,0.0002824403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9870177,0.0005567964,0.0004599082,0.0008527871,0.0005272154,0.0005124935,0.00006180193,0.00004335722,0.009967937],"genre_scores_gemma":[0.9971529,0.0004383362,0.0008334667,0.0009283466,0.0002957006,0.00005672007,0.00001890605,0.00001699055,0.0002585802],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01160004,"threshold_uncertainty_score":0.9999541,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002371204,0.00007775939,0.0001205011,0.00004895958,0.00007517494,0.000009472425,0.00003493648,0.00004834473,0.00009832465],"category_scores_gemma":[0.0003063265,0.00006391111,0.00002318373,0.0002225047,0.00004710936,0.00003434406,0.00001201188,0.00007338334,0.00004981583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005367573,"about_ca_system_score_gemma":0.00002133473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007640078,"about_ca_topic_score_gemma":0.00003159686,"domain_scores_codex":[0.9993643,0.00002111936,0.0002048815,0.0001643647,0.0001433069,0.0001020069],"domain_scores_gemma":[0.9993538,0.0002390676,0.00008412408,0.0001623054,0.0001409604,0.00001973844],"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.00007976838,0.0002546971,0.0001125072,0.00003364944,0.00001173297,2.83863e-7,0.00005849023,0.0006210301,0.00124514,0.9765357,0.02056484,0.0004821974],"study_design_scores_gemma":[0.0002031381,0.0001154421,0.002795064,0.00001343565,0.00001538616,0.000001242889,0.00004700017,0.000064546,0.003833287,0.9887155,0.004103596,0.00009232725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8613842,0.0001504432,0.001292967,0.007518814,0.00007373789,0.0006606951,0.00004082041,0.00009833173,0.12878],"genre_scores_gemma":[0.9966831,0.000007132407,0.002090867,0.0001834155,0.00008537516,0.00002516619,0.00005255762,0.000007198461,0.0008651712],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1352989,"threshold_uncertainty_score":0.2606219,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002191963,0.0001183418,0.0001869599,0.00005103546,0.0000422454,0.00001371776,0.0001144141,0.00007137631,0.000178935],"category_scores_gemma":[0.00001044062,0.00009589156,0.00003799121,0.000132008,0.00008178407,0.00006250507,0.00005017336,0.00008430907,0.000932186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002542969,"about_ca_system_score_gemma":0.000009648156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002123005,"about_ca_topic_score_gemma":0.000009293471,"domain_scores_codex":[0.99925,0.00001259627,0.0001656344,0.0001961821,0.0001455942,0.000229972],"domain_scores_gemma":[0.9995884,0.00002533138,0.00008927516,0.000182082,0.00003858125,0.00007628217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000280676,0.0005782284,0.0006932016,0.0001005296,0.0001340684,0.000004421687,0.001119519,0.0009053596,0.2612036,0.3979335,0.2393355,0.09771139],"study_design_scores_gemma":[0.001190339,0.000255946,0.01343299,0.00003085865,0.0000546056,0.00001483307,0.0004758423,0.0001109496,0.4127714,0.077171,0.4938337,0.0006575807],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8511137,0.001716252,0.00004586154,0.002385085,0.00001290701,0.0002377368,0.00003255668,0.0001109633,0.1443449],"genre_scores_gemma":[0.9971067,0.0001022401,0.0007545599,0.001442766,0.0001087243,0.00001283036,0.000007753692,0.00001988319,0.0004445849],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3207625,"threshold_uncertainty_score":0.9998457,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003367482,0.0002017772,0.0005331067,0.00008099738,0.00007621421,0.000009308735,0.0001477164,0.000147156,0.00007387804],"category_scores_gemma":[0.00006848777,0.0001568975,0.00008363205,0.0001383731,0.0003167292,0.00006757078,0.00002936622,0.0001626458,0.000007122997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000377428,"about_ca_system_score_gemma":0.00002166932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001398954,"about_ca_topic_score_gemma":0.00001446294,"domain_scores_codex":[0.9988956,0.00005573063,0.0003580882,0.0002563419,0.0001517373,0.0002824548],"domain_scores_gemma":[0.9990001,0.0001754706,0.0004038696,0.000283931,0.00008867978,0.00004790058],"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.0002392685,0.0003734755,0.0008068273,0.0003700498,0.00008822959,0.00001017958,0.0002795159,0.000159421,0.02508877,0.9592071,0.0129471,0.000430078],"study_design_scores_gemma":[0.0003461966,0.0001015252,0.002266547,0.00003734539,0.00004270137,0.00001013058,0.0004204568,0.000004053697,0.1538392,0.8410745,0.001683256,0.0001741297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9707887,0.001093455,0.0004144171,0.001852844,0.00007119324,0.0003288928,0.00004270356,0.00005862176,0.0253492],"genre_scores_gemma":[0.9981784,0.00006628304,0.0007861663,0.0001712281,0.0001792716,0.000003045766,0.00001390182,0.00001604871,0.000585703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1287504,"threshold_uncertainty_score":0.6398093,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001708204,0.00007001589,0.0001767165,0.00003137055,0.00007095039,0.000002345469,0.00005746241,0.0000508801,0.00000613106],"category_scores_gemma":[0.00002715612,0.00003887323,0.00002277084,0.0001185856,0.0002608111,0.00001899504,0.0000452639,0.00006635298,5.579521e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":4.144779e-7,"about_ca_system_score_gemma":0.000004565934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.666082e-7,"about_ca_topic_score_gemma":0.000007300685,"domain_scores_codex":[0.9996152,0.00001718893,0.0001084479,0.00009186485,0.0000599089,0.0001073717],"domain_scores_gemma":[0.9995412,0.000213516,0.00009009561,0.0001183328,0.00002034582,0.00001648893],"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.00005701781,0.00001462616,0.0007434628,0.0001257182,0.00003062854,0.000001077483,0.0007446631,0.00001176724,0.001519889,0.9948179,0.0005723878,0.001360901],"study_design_scores_gemma":[0.0001779652,0.00006073747,0.00178804,0.00002989928,0.00001709807,0.000003974218,0.001305012,0.00000464194,0.01341767,0.9829938,0.0001498852,0.00005130478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9961335,0.0003216424,0.0002334957,0.0006395021,0.00001318379,0.0001352181,0.000005356186,0.00002267956,0.002495435],"genre_scores_gemma":[0.9989027,0.000213663,0.000497977,0.000204301,0.000008090646,0.000006490772,9.779735e-7,0.000005775029,0.0001600298],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01189778,"threshold_uncertainty_score":0.1585204,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002093329,0.00009072758,0.0002952419,0.00005000398,0.00002422614,0.000003357116,0.00008231222,0.00008558654,0.0001003968],"category_scores_gemma":[0.0000323701,0.00006986774,0.00004951368,0.0000734409,0.0001752446,0.00002971448,0.00002762438,0.00007651298,0.000002764616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001804801,"about_ca_system_score_gemma":0.00001637446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001989071,"about_ca_topic_score_gemma":0.000003304027,"domain_scores_codex":[0.9993904,0.00001614651,0.0002589585,0.0001142997,0.00009625512,0.0001238995],"domain_scores_gemma":[0.9994198,0.0002457875,0.0001426654,0.0001226588,0.00004396921,0.00002512225],"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.00008705501,0.0001190462,0.00008319539,0.0006740392,0.0001402471,0.000009290806,0.0007903222,0.00002029223,0.03090167,0.9617109,0.002053621,0.003410266],"study_design_scores_gemma":[0.0001115312,0.000112128,0.00005414538,0.00007067917,0.00003272451,0.00001201308,0.0004139165,0.000005252373,0.1541912,0.8442352,0.0006975278,0.00006364681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9787874,0.005147183,0.001113515,0.000210739,0.00007200328,0.0001680351,0.00007082769,0.00002647583,0.01440384],"genre_scores_gemma":[0.9976128,0.0006118256,0.001263006,0.0001126031,0.0000205603,0.000004554627,0.000004420625,0.000008273278,0.0003619619],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1232895,"threshold_uncertainty_score":0.2849124,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007099166,0.0001056712,0.0002990119,0.00003828197,0.00006798845,0.000002906569,0.0001510598,0.0001024942,0.0001333211],"category_scores_gemma":[0.00004679238,0.00006457102,0.00004706625,0.0001626207,0.000243726,0.00005119183,0.00004398932,0.00009983085,0.00000907376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001607775,"about_ca_system_score_gemma":0.000011671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000477809,"about_ca_topic_score_gemma":0.000002640802,"domain_scores_codex":[0.9992431,0.0000544634,0.0002398299,0.0001539141,0.0001432057,0.0001654965],"domain_scores_gemma":[0.9987614,0.0006055014,0.0001757685,0.0003514849,0.0000776704,0.00002813616],"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.0001121087,0.0001392429,0.00002430203,0.00005610677,0.00002621136,0.000001120965,0.0003583495,0.001223389,0.006262804,0.9899676,0.001411154,0.0004176464],"study_design_scores_gemma":[0.0001399448,0.00009164542,0.0000567661,0.00002709544,0.00001549131,0.000001736891,0.001514457,0.0004560535,0.04039847,0.9571838,0.00005015358,0.00006436126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9685668,0.00006995529,0.002240326,0.0003578448,0.00002266347,0.0002164023,0.0000231016,0.00003271529,0.02847017],"genre_scores_gemma":[0.9984816,0.0001798455,0.0006535467,0.0003460633,0.00001660255,0.00001211964,0.000005829919,0.00001193367,0.0002924979],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03413567,"threshold_uncertainty_score":0.263313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}