{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":680,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":680,"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":"8fffe93618d3","filters":{"topic":"Advanced Algebra and Logic"}},"results":[{"id":"W206333455","doi":"10.1007/978-3-0348-0018-1","title":"Lattice Theory: Foundation","year":2011,"lang":"en","type":"book","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":698,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of Manitoba","funders":"","keywords":"Foundation (evidence); Lattice (music); Theoretical physics; Physics; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.02774404454014674,"gpt":0.2415382978423221,"spread":0.2137942533021754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001552751,0.0001506613,0.0001396175,0.0000637021,0.00006045412,0.00006273763,0.0007892178,0.0001279744,0.0007879259],"category_scores_gemma":[0.00001687084,0.0001183732,0.0000579033,0.0000493699,0.00003719813,0.000343897,0.0002082911,0.0001621405,0.002832917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004704705,"about_ca_system_score_gemma":0.000136645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.076201e-7,"about_ca_topic_score_gemma":0.000002295899,"domain_scores_codex":[0.9992326,0.00003040463,0.0001242948,0.0003268015,0.0001352461,0.0001506155],"domain_scores_gemma":[0.9991405,0.000101316,0.00009756792,0.0005637308,0.00004998696,0.00004688708],"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":[8.834281e-7,0.00000487821,2.593621e-7,0.00000519911,0.000007173855,0.000004275902,0.0000576011,3.549126e-7,6.667545e-7,0.9297315,0.00415648,0.06603068],"study_design_scores_gemma":[0.00003243797,0.0000208878,0.000005808595,0.000008028678,0.000004627847,0.000003854118,7.940639e-7,0.00009338145,0.00001267113,0.6584779,0.3412232,0.0001163447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[1.993927e-7,0.00005230134,0.4799827,0.00002873861,0.0002355818,0.00005145492,1.740509e-7,0.0001544192,0.5194944],"genre_scores_gemma":[0.00007230456,0.00002187374,0.04893176,0.0007123623,0.0001340328,0.000005115045,0.00001045701,0.00001125036,0.9501008],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.431051,"threshold_uncertainty_score":0.9979435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W60726562","doi":"10.1007/978-94-017-0452-6_4","title":"Basic Many-Valued Logic","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":154,"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":"Axiom; Computer science; Autoepistemic logic; Philosophy of logic; Dynamic logic (digital electronics); Many-valued logic; Independence (probability theory); Propositional calculus; Intermediate logic; Epistemology; Mathematics; Multimodal logic; Theoretical computer science; Programming language; Description logic; Philosophy; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0326006419618631,"gpt":0.2449626669036918,"spread":0.2123620249418287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009184219,0.000374287,0.0003561811,0.0001423453,0.00009463068,0.000089119,0.001260348,0.0002751872,0.002285328],"category_scores_gemma":[0.00000814293,0.0002959159,0.0001869212,0.00005613286,0.00006712033,0.0002346172,0.0004152142,0.0003435739,0.003112779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000584705,"about_ca_system_score_gemma":0.00004979134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002511623,"about_ca_topic_score_gemma":0.00000412007,"domain_scores_codex":[0.9983261,0.00001105,0.0002744799,0.0007152204,0.0003268869,0.0003462815],"domain_scores_gemma":[0.9986222,0.00004728751,0.0001416667,0.0009988718,0.00006171602,0.0001282318],"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.000001123161,0.000007084551,0.000001098496,0.000005868982,0.00001226834,0.000150205,0.0000102662,0.000009327772,0.000002889797,0.970208,0.003070481,0.02652141],"study_design_scores_gemma":[0.0001016394,0.00005613276,0.00000793827,0.00001976433,0.000006828866,0.00005393623,8.409698e-7,0.0007036736,0.000009897964,0.64495,0.3537682,0.000321153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[6.70877e-7,0.000284308,0.4219355,0.0002565335,0.0002773348,0.0001024057,9.722222e-7,0.0003076756,0.5768346],"genre_scores_gemma":[0.0003549592,0.0001959552,0.03490597,0.002638637,0.000247602,0.000005645079,0.000007537192,0.00002902524,0.9616147],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3870295,"threshold_uncertainty_score":0.9999493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1120761376","doi":"10.1201/9781315273686","title":"Universal Algebra and Applications in Theoretical Computer Science","year":2018,"lang":"en","type":"book","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Algebra over a field; Computer science; Universal algebra; Computational science; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.00669435618951095,"gpt":0.2273005559057519,"spread":0.2206061997162409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002289875,0.0001854624,0.0001959704,0.0002689701,0.0001760713,0.0001398313,0.001244791,0.0001206517,0.00006249149],"category_scores_gemma":[0.000007665507,0.0001491082,0.00002918439,0.0003380067,0.002109149,0.0003685358,0.0009206761,0.0002129991,0.00008102132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001128571,"about_ca_system_score_gemma":0.0003102184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001125188,"about_ca_topic_score_gemma":0.000004497809,"domain_scores_codex":[0.9985462,0.00001819431,0.0001603244,0.0007231307,0.0002590023,0.0002930804],"domain_scores_gemma":[0.9990082,0.0001443201,0.00005568901,0.0005771519,0.00008104864,0.0001335372],"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":[5.395596e-7,0.00001089777,0.000009058585,0.000004724073,0.000001548844,0.000006184277,0.00006183723,0.000002324894,0.000001905267,0.9878577,0.000585384,0.01145792],"study_design_scores_gemma":[0.0001383938,0.0000774052,0.0001525057,0.00002500535,0.000003404147,0.00002000149,0.00000511499,0.01166906,0.00002354302,0.9467167,0.04089715,0.0002716985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002967177,0.00003942576,0.692736,0.00008916794,0.00007897183,0.0001777882,0.000001093971,0.0000885315,0.3067593],"genre_scores_gemma":[0.05728201,0.000180007,0.6427557,0.002735696,0.001610491,0.00006789688,0.00003326532,0.00007498368,0.29526],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05725234,"threshold_uncertainty_score":0.7771246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986537785","doi":"10.1006/jctb.2000.1970","title":"Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations)","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Duality (order theory); Homomorphism; Mathematics; Pure mathematics; Order (exchange); Property (philosophy); Algebra over a field","retraction":null,"screen_n_in":null,"score":{"opus":0.009783662731557273,"gpt":0.2455368811306554,"spread":0.2357532183990981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009771413,0.0001597983,0.0003283426,0.00007795526,0.0002516337,0.0002325043,0.0004539204,0.00008050492,0.00007394526],"category_scores_gemma":[0.0002190788,0.0001296422,0.0001136507,0.0001387772,0.0001277786,0.001521496,0.0000586959,0.0002002462,0.000001810116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002559139,"about_ca_system_score_gemma":0.00006097835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.225379e-7,"about_ca_topic_score_gemma":1.197485e-7,"domain_scores_codex":[0.9986852,0.0002304525,0.000477849,0.0001752481,0.000213176,0.0002180421],"domain_scores_gemma":[0.9985201,0.0005407712,0.0004000482,0.0002493685,0.0001800293,0.0001097257],"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.0004730359,0.00003846184,0.00006478113,0.00001467622,0.00003252685,0.000007776893,0.0008451231,0.0000141704,0.0008898285,0.9499159,0.00001512158,0.04768856],"study_design_scores_gemma":[0.000909583,0.0004739944,0.003534597,0.00002586611,0.00001641209,0.0001381038,0.00007480578,0.00004485275,0.001749957,0.9753985,0.01747488,0.0001584126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8976755,0.000529296,0.09284859,0.0008661821,0.006670489,0.0002825234,0.00001830551,0.00007054066,0.001038551],"genre_scores_gemma":[0.9931034,0.0001631208,0.005454609,0.0002137849,0.0009012442,0.000003940236,0.000002395259,0.00001192836,0.0001455706],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09542789,"threshold_uncertainty_score":0.5286655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1520950860","doi":"10.1007/978-3-662-04943-3","title":"Boolean Functions and Computation Models","year":2002,"lang":"en","type":"book","venue":"Texts in theoretical computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computation; Boolean function; Theoretical computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01847183979169236,"gpt":0.24875104320274,"spread":0.2302792034110476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007220143,0.0003919444,0.0004230661,0.0005642145,0.0003747599,0.0004738712,0.001837165,0.0002002331,0.00003345945],"category_scores_gemma":[0.00003181414,0.0003501635,0.00007340513,0.0007224746,0.002928856,0.001108093,0.001453541,0.000640201,0.0001105899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002210098,"about_ca_system_score_gemma":0.000204561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.703746e-7,"about_ca_topic_score_gemma":0.000001188245,"domain_scores_codex":[0.996669,0.00007598563,0.0004529793,0.001374919,0.0007759252,0.0006511942],"domain_scores_gemma":[0.9983494,0.0003156468,0.0001435061,0.0007600967,0.0001456557,0.000285666],"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.000001689113,0.00003297149,0.000001262434,0.00001361987,0.000002534235,0.00002842223,0.0002254379,0.004187532,0.000001821256,0.866866,0.0006791281,0.1279596],"study_design_scores_gemma":[0.0001197361,0.0000863379,0.0000218834,0.00005988252,0.000003130695,0.00004989413,0.000001140629,0.480796,0.00000240909,0.5181897,0.0004345684,0.0002353466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00006346917,0.0002689945,0.8217499,0.0002519041,0.0005640418,0.000251127,0.000003654663,0.000181539,0.1766654],"genre_scores_gemma":[0.4805455,0.0001509826,0.472649,0.001961361,0.000678231,0.00004136209,0.00002003597,0.00008090731,0.04387259],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4804821,"threshold_uncertainty_score":0.999895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000595177","doi":"10.1007/s10988-013-9130-8","title":"Constraints on the lexicalization of logical operators","year":2013,"lang":"en","type":"article","venue":"Linguistics and Philosophy","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Israel Science Foundation; Bar-Ilan University","keywords":"Markedness; Lexicalization; Implicature; Computer science; Linguistics; Negation; Philosophy of language; Axiom; Horn clause; Mathematics; Natural language processing; Pragmatics; Artificial intelligence; Programming language; Philosophy; Epistemology; Logic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.02995590427606405,"gpt":0.2463815541406155,"spread":0.2164256498645515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000535424,0.0000606902,0.00007514359,0.00001673026,0.00007213364,0.00003718792,0.0001814471,0.00002984516,0.00004603626],"category_scores_gemma":[0.0004141413,0.00003485259,0.00001767926,0.0000793884,0.0001464039,0.00001423388,0.0000560912,0.00006504221,0.00001775245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002492167,"about_ca_system_score_gemma":0.000008939031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001795031,"about_ca_topic_score_gemma":5.918629e-8,"domain_scores_codex":[0.9995802,0.0000230968,0.000109703,0.0001233255,0.00008673782,0.00007694103],"domain_scores_gemma":[0.9995281,0.0001399567,0.00003851942,0.0001599192,0.00009296953,0.00004057109],"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":[6.00648e-7,0.00001798323,0.0001400915,0.000003329976,0.000002374475,0.000001030346,0.00004788591,0.00002687053,0.00003072634,0.9974868,0.00006823894,0.002174112],"study_design_scores_gemma":[0.00006672716,0.00009578146,0.0005085632,0.00001218967,0.000001599341,9.878914e-7,0.000003938295,0.005806485,0.0002974232,0.9916748,0.00147195,0.00005957912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.06667566,0.0003714977,0.4555238,0.009045327,0.001606087,0.0007694402,0.00001636305,0.0001702844,0.4658216],"genre_scores_gemma":[0.9953065,0.00001144884,0.003302575,0.001180704,0.0001840147,0.000003728172,8.888463e-7,0.000002195504,0.000007963181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9286308,"threshold_uncertainty_score":0.1421247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007471451","doi":"10.1007/s00233-005-0540-y","title":"The Category of S-Posets","year":2005,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Monotone polygon; Action (physics); Cartesian closed category; Set (abstract data type); Closed category; Pure mathematics; Algebra over a field; Combinatorics; Discrete mathematics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.005953063401598615,"gpt":0.222598641082001,"spread":0.2166455776804024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001336446,0.00007072696,0.00007715078,0.0000212335,0.0001460072,0.00002659709,0.0007090484,0.00002972987,0.000006018881],"category_scores_gemma":[0.00001880451,0.00004441085,0.00005037234,0.0001484838,0.00005781736,0.0002586124,0.0001761581,0.00007828739,0.0000639631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001609518,"about_ca_system_score_gemma":0.0000197755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006447698,"about_ca_topic_score_gemma":0.00005149528,"domain_scores_codex":[0.9992858,0.00001923675,0.0001452232,0.0001473891,0.0001392049,0.0002631987],"domain_scores_gemma":[0.9993414,0.00009130054,0.00006690125,0.0004331759,0.00002720661,0.00004000914],"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.000003176282,0.00002639721,0.0004474676,0.000002891882,0.000007085267,0.000001884385,0.0002632379,0.00009716211,0.001560315,0.7442783,0.006056686,0.2472554],"study_design_scores_gemma":[0.0005116762,0.0002172055,0.005900766,0.00001759173,0.00000629981,0.00004176974,0.0003593749,0.01956838,0.03389518,0.2510579,0.688056,0.0003678371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08386606,0.007638411,0.8245633,0.02926006,0.001209331,0.0004300225,0.00000451626,0.0004704449,0.05255783],"genre_scores_gemma":[0.9918603,0.00005451448,0.006401075,0.000592306,0.00005301604,0.000005685724,6.596704e-7,0.000004304586,0.00102817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9079942,"threshold_uncertainty_score":0.1811022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142792844","doi":"10.1109/icpr.1994.576970","title":"A theoretical analysis of the application of majority voting to pattern recognition","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voting; Computer science; Majority rule; Variety (cybernetics); Machine learning; Artificial intelligence; Order (exchange); Pattern recognition (psychology); Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01735304487194541,"gpt":0.2411527481238169,"spread":0.2237997032518715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001044382,0.00003568972,0.00009085646,0.00005762737,0.00002427714,0.000006006416,0.0002842458,0.0000175301,0.0001141895],"category_scores_gemma":[0.00003388997,0.00002244223,0.00006654312,0.0008939006,0.0000348234,0.00005599471,0.00009140295,0.00003146169,0.00001063917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000618538,"about_ca_system_score_gemma":0.000001522821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001262082,"about_ca_topic_score_gemma":0.00001582786,"domain_scores_codex":[0.9995158,0.00003336131,0.0001382555,0.000129071,0.0001170502,0.00006640975],"domain_scores_gemma":[0.9995462,0.0000637796,0.00006396639,0.0002513756,0.00005434766,0.00002037919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.670648e-7,0.00006564108,0.008020692,0.000005675197,0.00003758718,1.055405e-7,0.0003371879,0.0004241843,0.001162834,0.4690551,0.00001065672,0.5208794],"study_design_scores_gemma":[0.00006520086,0.00003152475,0.02899706,0.00000562143,0.00006528983,6.005681e-7,0.00002258215,0.9150778,0.008672297,0.04697913,0.00001480863,0.00006805719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1130302,0.000004025575,0.8845267,0.0004856407,0.00001473339,0.00006896339,0.000001480651,0.00001596932,0.001852345],"genre_scores_gemma":[0.9885765,6.802194e-7,0.01116607,0.0002341604,0.000006795686,0.000005317733,5.835418e-7,0.000001045665,0.000008847183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9146537,"threshold_uncertainty_score":0.1250295,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053204108","doi":"10.1007/s00012-015-0327-2","title":"Characterizations of several Maltsev conditions","year":2015,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Unary operation; Mathematics; Congruence (geometry); Affine transformation; Type (biology); Pure mathematics; Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02284963998595889,"gpt":0.2414328027809453,"spread":0.2185831627949864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000630029,0.00009037914,0.0001257305,0.0001196041,0.000065971,0.00002489389,0.0004897266,0.00004195459,0.00005701572],"category_scores_gemma":[0.00003452639,0.00009038527,0.00004817787,0.0004763542,0.00007732659,0.0009013531,0.0001366275,0.0000642564,0.00006034461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003611653,"about_ca_system_score_gemma":0.0001119946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002362211,"about_ca_topic_score_gemma":0.00000487069,"domain_scores_codex":[0.9992915,0.00004253225,0.0001409896,0.0001930094,0.0001634925,0.0001684568],"domain_scores_gemma":[0.999217,0.00004059776,0.00009430339,0.0003633845,0.0001475449,0.0001371602],"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.000003329691,0.00004783526,0.0003501166,0.000003322794,0.00001612142,0.00001723278,0.000942867,0.0003010876,0.0006979579,0.9955508,0.001529986,0.0005393201],"study_design_scores_gemma":[0.007362682,0.001310893,0.06519289,0.0001433042,0.0001502714,0.0002826187,0.003208061,0.06816855,0.02017055,0.6595023,0.1720428,0.002465122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1509719,0.00004365655,0.8272172,0.001803138,0.0004711822,0.000165878,0.0000531938,0.00029895,0.01897483],"genre_scores_gemma":[0.9876282,0.000008246056,0.01110281,0.0003418596,0.0000349889,0.000002523542,0.00004347546,0.000006423246,0.0008314888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8366562,"threshold_uncertainty_score":0.3685804,"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":"W2148544922","doi":"10.1016/s0022-4049(02)00139-1","title":"On the quantisation of spaces","year":2002,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":58,"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; Unital; Pure mathematics; Space (punctuation); Topological space; Commutative property; Invariant (physics); Von Neumann architecture; Embedding; Algebra over a field","retraction":null,"screen_n_in":null,"score":{"opus":0.02097188276001035,"gpt":0.2273270454957179,"spread":0.2063551627357076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001865143,0.00006686417,0.0001308076,0.00005415601,0.00006151569,0.00004248724,0.0002729427,0.00002850369,0.00003600219],"category_scores_gemma":[0.0000220216,0.00003660942,0.0000420555,0.0001407586,0.00003934159,0.0001390707,0.00003340021,0.000132767,0.000007587584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004784386,"about_ca_system_score_gemma":0.000005928121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.63662e-7,"about_ca_topic_score_gemma":3.36834e-7,"domain_scores_codex":[0.9994188,0.00001921519,0.0001970727,0.0000773076,0.0002003807,0.00008725662],"domain_scores_gemma":[0.9993684,0.0001619473,0.0002687453,0.000130194,0.00003403876,0.00003667568],"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.000005074713,0.00003536817,0.00002830394,0.000004250319,0.00001103504,0.000003218619,0.0004703447,0.00006948732,0.002332076,0.9756962,0.001345552,0.0199991],"study_design_scores_gemma":[0.0008339336,0.000641523,0.003668357,0.00006840329,0.00002557179,0.0001246417,0.0005153571,0.002511654,0.02138686,0.9663967,0.003605696,0.0002213315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9065355,0.0007742015,0.08121923,0.006341301,0.0001656006,0.00009180175,4.781519e-7,0.00001305548,0.004858834],"genre_scores_gemma":[0.9970144,0.0001040098,0.002356004,0.0004123644,0.00007191781,7.66341e-7,4.821536e-8,0.000002660528,0.00003780709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09047893,"threshold_uncertainty_score":0.1492889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963602153","doi":"10.1142/s0218196709004956","title":"ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Distributivity; Idempotence; Congruence (geometry); EXPTIME; Variety (cybernetics); Modularity (biology); Congruence relation; Polynomial; Algebra over a field; Universal algebra; Time complexity; Pure mathematics; Discrete mathematics; Computational complexity theory; Distributive property; Algorithm; PSPACE","retraction":null,"screen_n_in":null,"score":{"opus":0.03230162631810712,"gpt":0.3002791238380374,"spread":0.2679774975199303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001672348,0.00006764202,0.0001087002,0.0001265594,0.00006083825,0.0000617854,0.000436702,0.00002047791,0.000009821109],"category_scores_gemma":[0.00005171297,0.00004565755,0.00006285431,0.00009062862,0.0001013261,0.0004442495,0.00003361728,0.0001129403,0.000003443213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002037158,"about_ca_system_score_gemma":0.00003169125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.459046e-7,"about_ca_topic_score_gemma":2.034603e-7,"domain_scores_codex":[0.9991506,0.00004977693,0.000295979,0.00008469215,0.0003498283,0.00006907008],"domain_scores_gemma":[0.999047,0.0001967498,0.0003428756,0.00007140239,0.0003040287,0.00003793908],"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.00001887904,0.00007036714,0.00003811118,9.135228e-7,0.00002512899,0.00001051165,0.0001724434,0.001488993,0.0003985481,0.9814778,0.0002572506,0.01604104],"study_design_scores_gemma":[0.0003244134,0.0002988103,0.02786759,0.00003385733,0.000004292369,0.0001055406,0.00002956435,0.01095327,0.0007621691,0.9595235,0.00004762482,0.00004940194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.574016,0.00009819144,0.4086106,0.01630421,0.000444953,0.0000544228,0.000003339635,0.00001325431,0.0004550294],"genre_scores_gemma":[0.9934506,0.00002305025,0.004726863,0.001688639,0.00009873844,4.099641e-7,0.000002175036,0.000001713139,0.000007774279],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4194346,"threshold_uncertainty_score":0.1861861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037775432","doi":"10.1016/s0022-4049(02)00140-8","title":"Distributive laws and factorization","year":2002,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Mount Allison University","funders":"","keywords":"Distributive property; Factorization; Mathematics; Monad (category theory); Extension (predicate logic); Algebra over a field; Pure mathematics; Computer science; Functor; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01304248990676374,"gpt":0.215605964805732,"spread":0.2025634748989683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008308107,0.00008698075,0.0001503152,0.00004517724,0.00008482095,0.00008384955,0.00015358,0.00004304286,0.00001402963],"category_scores_gemma":[0.00001311455,0.00006340613,0.00002505685,0.0001322386,0.0000350353,0.000319811,0.00006099026,0.0001365247,0.000003726829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001008093,"about_ca_system_score_gemma":0.000005768539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.478841e-7,"about_ca_topic_score_gemma":4.075585e-7,"domain_scores_codex":[0.9994268,0.00001209875,0.0001812939,0.0001187955,0.0001398063,0.0001212081],"domain_scores_gemma":[0.9995667,0.00004577608,0.0001665297,0.0000821301,0.00004138424,0.00009743272],"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.00001018871,0.00009507564,0.0007575904,0.00001543807,0.00003466693,0.00002979613,0.001236884,0.00001749727,0.003678645,0.7874588,0.001237856,0.2054275],"study_design_scores_gemma":[0.003890946,0.0008613232,0.02816605,0.00007931616,0.00007969813,0.0008057866,0.0007992939,0.003029752,0.01387902,0.9159819,0.03156436,0.000862573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2635408,0.001472287,0.7317573,0.001122939,0.0001754975,0.00008881564,0.000002928716,0.00002796594,0.001811426],"genre_scores_gemma":[0.9956065,0.0002257048,0.003810522,0.0001922901,0.0001231115,8.302592e-7,5.359742e-7,0.000003324255,0.00003719306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7320657,"threshold_uncertainty_score":0.2585627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2318083694","doi":"10.4153/cjm-2011-087-3","title":"Finitely Related Algebras In CongruenceDistributive Varieties Have Near UnanimityTerms","year":2011,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Grantová Agentura České Republiky","keywords":"Unanimity; Mathematics; Decidability; Congruence (geometry); Distributive property; Constraint satisfaction problem; Equivalence (formal languages); Variety (cybernetics); Finitely-generated abelian group; Bounded function; Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03318852489675269,"gpt":0.2198954753888746,"spread":0.1867069504921219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000418589,0.0001364435,0.0002753471,0.0001978259,0.0001040597,0.00009537779,0.0008179797,0.00009641297,0.00008778896],"category_scores_gemma":[0.0003818954,0.0001154623,0.00009388513,0.0002970072,0.0001850073,0.0004703017,0.00003516036,0.0003371859,0.0000288578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001258903,"about_ca_system_score_gemma":0.0008314691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004823027,"about_ca_topic_score_gemma":0.003832827,"domain_scores_codex":[0.9987779,0.00004646261,0.0005420473,0.0001257762,0.0001635543,0.0003442384],"domain_scores_gemma":[0.9986883,0.0001217532,0.0003522227,0.0002605901,0.0001880854,0.0003890275],"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.00000548547,0.0001063962,0.01204048,0.00004438499,0.00007626021,0.002394805,0.04634554,0.000111788,0.00002005727,0.9350088,0.0005019932,0.003344075],"study_design_scores_gemma":[0.0005768175,0.0002987107,0.02019517,0.0001893397,0.0000224992,0.0008077548,0.001907538,0.003593082,0.0006880247,0.9705251,0.0008669526,0.0003290041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6270701,0.0005959566,0.3551544,0.0007130466,0.001021215,0.0002706108,0.00001868732,0.00004080808,0.01511516],"genre_scores_gemma":[0.9429577,0.000009025245,0.0567978,0.0001242792,0.00001535911,0.000001149381,6.610546e-7,0.000008564432,0.00008547179],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3158876,"threshold_uncertainty_score":0.4708415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W597985463","doi":"10.1090/fim/015","title":"Lectures on Algebraic Model Theory","year":2001,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Congruence (geometry); Differential (mechanical device); Mathematics; Algebra over a field; Algebraic number; Pure mathematics; Bibliography; Differential algebraic geometry; Differential algebra; Algebraic theory; Computer science; Differential equation; Ordinary differential equation; Mathematical analysis; Physics; Differential algebraic equation; Geometry; Library science","retraction":null,"screen_n_in":null,"score":{"opus":0.01442383377223438,"gpt":0.2472990325612446,"spread":0.2328751987890103,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003335828,0.0006845997,0.0009376259,0.00005976793,0.0002468708,0.0001406201,0.001702358,0.0002924667,0.00008615353],"category_scores_gemma":[0.0000712934,0.0005324836,0.0008538251,0.0001116342,0.0009874443,0.00007841572,0.0004488877,0.0009689521,0.000458198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002573548,"about_ca_system_score_gemma":0.0003565213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.404967e-7,"about_ca_topic_score_gemma":4.115183e-7,"domain_scores_codex":[0.9969972,0.00008810552,0.0004864598,0.0009502604,0.0007433271,0.0007346746],"domain_scores_gemma":[0.9969387,0.0009407417,0.0004078895,0.001369822,0.00006518381,0.0002776427],"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.000005295909,0.00005010506,7.077467e-8,0.0000521919,0.0001009999,0.00001408293,0.001039744,0.0001771582,0.00001164168,0.9346989,0.02006121,0.0437886],"study_design_scores_gemma":[0.0001423185,0.0002018969,4.660005e-7,0.0001151796,0.0000428865,0.00002309978,0.00004072575,0.02644532,0.00003735749,0.9594927,0.01284026,0.0006177573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00001583873,0.0000404915,0.5212365,0.0001620616,0.0000400507,0.0002228104,0.000004167891,0.0003467463,0.4779313],"genre_scores_gemma":[0.001651217,0.00004133022,0.1466662,0.01166265,0.0002959394,0.00009224944,0.00001031931,0.0001233001,0.8394567],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.3745703,"threshold_uncertainty_score":0.9997126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2594244112","doi":"10.2307/2586531","title":"A finite basis theorem for residually finite, congruence meet-semidistributive varieties","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Congruence (geometry); Mathematics; Variety (cybernetics); Pure mathematics; Finitely-generated abelian group; Algebra over a field; Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01719232462789122,"gpt":0.2566598042498143,"spread":0.2394674796219231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007907827,0.0002432172,0.0004800592,0.000140193,0.0002310064,0.0001626838,0.001294602,0.0001262092,0.0001855199],"category_scores_gemma":[0.0006973513,0.0001756733,0.0002580309,0.0004631262,0.0001733168,0.0007491341,0.00009068415,0.0002770544,0.00002938791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007165383,"about_ca_system_score_gemma":0.0002203978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003966687,"about_ca_topic_score_gemma":0.000002625745,"domain_scores_codex":[0.9980091,0.0001367639,0.000663056,0.0003030812,0.0004138938,0.0004740431],"domain_scores_gemma":[0.9971274,0.001381885,0.0004651418,0.0003863486,0.0004540693,0.0001851611],"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.0003159993,0.0002789243,0.0004341415,0.00004867939,0.0001652506,0.0002488523,0.002484798,0.01079664,0.0005467692,0.9245266,0.004296575,0.05585681],"study_design_scores_gemma":[0.001242815,0.001151775,0.002174788,0.00008695051,0.00005032439,0.0002749703,0.0002071778,0.004549904,0.002325149,0.9735354,0.01399416,0.0004065457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02385336,0.001415844,0.9596629,0.003394949,0.0005022628,0.0003285301,0.00004288645,0.0001003443,0.01069892],"genre_scores_gemma":[0.9614234,0.0004147394,0.03536341,0.001706525,0.0002862003,0.00001427319,0.000002900871,0.00001328193,0.0007752561],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.93757,"threshold_uncertainty_score":0.7163749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1522943816","doi":"10.1090/s0002-9939-02-06413-4","title":"Local indicability in ordered groups: Braids and elementary amenable groups","year":2002,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Braid; Mathematics; Mathematics education; Pure mathematics; Geography; Archaeology","retraction":null,"screen_n_in":null,"score":{"opus":0.01126839082288246,"gpt":0.2256046901699161,"spread":0.2143362993470336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004162253,0.0001674241,0.0003804453,0.00002553954,0.0000919547,0.00005179905,0.0007937867,0.00003855548,0.0000359469],"category_scores_gemma":[0.0001206823,0.0001135704,0.0001399092,0.0008573596,0.0009275275,0.0003938036,0.0006329567,0.0002476645,0.000005729335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007658392,"about_ca_system_score_gemma":0.000007802208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001506777,"about_ca_topic_score_gemma":8.160096e-7,"domain_scores_codex":[0.9985409,0.00001433739,0.0003632242,0.0003763918,0.0003418188,0.0003632909],"domain_scores_gemma":[0.9992256,0.0001610001,0.0002701996,0.0002005453,0.00004944031,0.00009322068],"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.00003481449,0.002402478,0.0807212,0.001322468,0.0001920113,0.000002484245,0.02983058,0.00003141788,0.008066321,0.7763111,0.00394641,0.09713873],"study_design_scores_gemma":[0.0007208528,0.0003427085,0.02222669,0.0001041815,0.00002449236,0.00002597682,0.005528232,0.08648496,0.00200691,0.881936,0.0001909745,0.0004080879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9476467,0.00006921063,0.04887076,0.002068854,0.00001613465,0.0002660797,0.000001213366,0.00006742943,0.0009935868],"genre_scores_gemma":[0.9244661,0.00004244971,0.07453787,0.0008745618,0.00001440036,0.00002423968,1.131369e-7,0.000008601583,0.00003171124],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1056248,"threshold_uncertainty_score":0.4631266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1585415359","doi":"10.1023/a:1021966832558","title":"A Compendium of Continuous Lattices in MIZAR","year":2002,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Compendium; Mathematical proof; Programming language; Computer science; Correctness; Simple (philosophy); Proof assistant; Calculus (dental); Mathematics; Linguistics; Philosophy; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.01328968098320752,"gpt":0.2462505761073052,"spread":0.2329608951240977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003214743,0.00009093823,0.0003183918,0.0002155396,0.00003295872,0.00004026073,0.0005057639,0.00004871143,0.00003212862],"category_scores_gemma":[0.0001377457,0.00007163137,0.00007464003,0.0004056394,0.00003303591,0.0005143932,0.00006270823,0.0001971938,0.000008179494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002855073,"about_ca_system_score_gemma":0.00002115121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005582528,"about_ca_topic_score_gemma":0.000001646897,"domain_scores_codex":[0.9988952,0.00007544737,0.0004932018,0.0001033659,0.000238129,0.0001946997],"domain_scores_gemma":[0.9989174,0.0001398177,0.000617979,0.0001505492,0.000110262,0.00006398138],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003383255,0.005138068,0.1817645,0.0006857764,0.001045289,0.01426158,0.04445181,0.1299058,0.1046976,0.1927511,0.01870295,0.3062572],"study_design_scores_gemma":[0.001977592,0.0005011848,0.03483288,0.0008267308,0.00002018812,0.001256597,0.0002683625,0.9530478,0.00460038,0.00138159,0.001027004,0.0002596959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9681269,0.002857081,0.02505003,0.0004702558,0.0004318061,0.00007420857,6.749723e-7,0.0001711503,0.002817927],"genre_scores_gemma":[0.9484464,0.00007484588,0.05135549,0.00005002049,0.00003139588,3.391631e-7,9.583783e-8,0.000005173503,0.00003621761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.823142,"threshold_uncertainty_score":0.2921042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241161039","doi":"10.1111/j.0013-0427.2005.00410.x","title":"Consistent Rationalizability","year":2005,"lang":"en","type":"article","venue":"Economica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Università Bocconi","keywords":"Rationalizability; Binary relation; Mathematics; Consistency (knowledge bases); Extension (predicate logic); Completeness (order theory); Preference relation; Element (criminal law); Preference; Relation (database); Mathematical economics; Maximal element; Set (abstract data type); Pure mathematics; Discrete mathematics; Computer science; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01015380130086226,"gpt":0.2131362981509792,"spread":0.2029824968501169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007193234,0.0000427501,0.00005935451,0.00001399389,0.00004462729,0.00003345643,0.0002272195,0.00001482202,0.0001974519],"category_scores_gemma":[0.00001164599,0.00004055598,0.00003169215,0.00002403047,0.00002382052,0.0002908685,0.00006247939,0.00002920343,0.0006909221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004634241,"about_ca_system_score_gemma":0.0000267987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.179799e-7,"about_ca_topic_score_gemma":0.000005021576,"domain_scores_codex":[0.9995888,0.00001207279,0.0001111416,0.0001748185,0.00002193513,0.00009126282],"domain_scores_gemma":[0.9996302,0.00003987067,0.00002968503,0.0002501731,0.00001056738,0.00003948234],"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.000001360203,0.00003520322,0.0007833726,0.000001252022,0.000004883363,5.252176e-7,0.00008657619,0.001468177,0.0001047676,0.962591,0.002267704,0.03265519],"study_design_scores_gemma":[0.0004586678,0.0000408856,0.01979194,0.000002321454,0.000002134391,0.00001731321,0.000009152417,0.07781118,0.003034058,0.155081,0.7434635,0.0002878142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3393349,0.0002819987,0.5367809,0.02247152,0.0005692617,0.0002371328,0.000003767025,0.0003753644,0.09994521],"genre_scores_gemma":[0.9482847,0.000002919067,0.0498911,0.001270671,0.00008794506,0.000006298102,9.861313e-7,0.000001680741,0.00045364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.80751,"threshold_uncertainty_score":0.8880636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138244417","doi":"10.1016/j.topol.2009.03.038","title":"Ordered topological structures","year":2009,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":36,"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; Topological space; Set (abstract data type); Topology (electrical circuits); Order (exchange); Metric (unit); Metric space; Pure mathematics; Combinatorics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01419787685314485,"gpt":0.2792253692887519,"spread":0.265027492435607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003329705,0.00006741186,0.00008512017,0.00002906524,0.000203551,0.00001681846,0.0002772132,0.00007178723,0.00005947712],"category_scores_gemma":[0.00001443072,0.00005264437,0.00001524071,0.0001305133,0.00006626861,0.0001006401,0.00005099941,0.00008825791,0.00002947071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004266173,"about_ca_system_score_gemma":0.00001005512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.989927e-7,"about_ca_topic_score_gemma":0.000001003849,"domain_scores_codex":[0.9994809,0.00001877527,0.00008875717,0.0002291963,0.00003558253,0.0001467892],"domain_scores_gemma":[0.9996426,0.00004838973,0.00002867846,0.0002041092,0.00002282984,0.00005337357],"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":[9.597613e-7,0.00001583496,0.0000190435,5.777764e-7,0.000001455643,8.337213e-7,0.000037743,0.000004505591,0.0004498307,0.9584917,0.00007775741,0.04089972],"study_design_scores_gemma":[0.0001017059,0.00007708005,0.009002747,3.689048e-7,0.000002368092,0.00004036275,0.00001494915,0.0004202798,0.0005865399,0.969495,0.0201752,0.00008336919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02978371,0.001637876,0.9375934,0.0171301,0.00006641839,0.0002879668,0.000002201332,0.0002790551,0.01321926],"genre_scores_gemma":[0.9835228,0.0000840073,0.01392408,0.002125698,0.00005134408,0.00002649935,0.00000215804,0.000001200711,0.0002621502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9537392,"threshold_uncertainty_score":0.2146775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W154866314","doi":"10.1007/978-3-319-06413-0_3","title":"Planar Semimodular Lattices: Structure and Diagrams","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Planar; Combinatorics; Mathematics; Computer science; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.01133303463871531,"gpt":0.2050776591154408,"spread":0.1937446244767255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005200047,0.0002959892,0.0003062568,0.00006614851,0.00007901937,0.0001091277,0.000579652,0.0002746884,0.0001382305],"category_scores_gemma":[0.000007393565,0.0002203064,0.00005643394,0.00001979173,0.0000698951,0.0001371666,0.0001826165,0.0002805747,0.00006162957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001369435,"about_ca_system_score_gemma":0.00001692539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002637875,"about_ca_topic_score_gemma":0.00001962878,"domain_scores_codex":[0.9988502,0.00000949341,0.0001692934,0.0005569082,0.0002055479,0.0002085056],"domain_scores_gemma":[0.9990362,0.00007878843,0.0001143955,0.000615987,0.00003201227,0.0001226488],"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":[6.304076e-7,9.593015e-7,0.00001105776,0.00002151424,0.00001619478,0.0000187828,0.00003833904,0.000005661097,0.00001106718,0.962563,0.0005629354,0.0367499],"study_design_scores_gemma":[0.00010413,0.0000549166,0.00003620298,0.00003718576,0.00001217653,0.00003427832,0.000001097473,0.0009109339,0.00002547055,0.7428368,0.2556041,0.0003426681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00006739464,0.001041534,0.6279401,0.0003107469,0.0003454179,0.0001718898,0.00001156801,0.0002764413,0.3698349],"genre_scores_gemma":[0.03988808,0.0003772967,0.08397581,0.00368483,0.0006740435,0.000004473667,0.00005374798,0.00007293884,0.8712688],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5439643,"threshold_uncertainty_score":0.8983834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1590000758","doi":"10.2298/fil1602469p","title":"Proximal relator spaces","year":2016,"lang":"it","type":"article","venue":"Filomat","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Mathematics; Closure (psychology); Space (punctuation); Extension (predicate logic); Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01660230729304342,"gpt":0.2366894592841708,"spread":0.2200871519911274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001580537,0.0002497524,0.0002431494,0.00007175552,0.0001784192,0.000153631,0.0008086146,0.000139923,0.001052974],"category_scores_gemma":[0.0001179928,0.0001521926,0.0001105278,0.0002744155,0.0001457427,0.0008691795,0.0004100312,0.0001273509,0.005828534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006543461,"about_ca_system_score_gemma":0.00008436441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003017996,"about_ca_topic_score_gemma":0.000001495895,"domain_scores_codex":[0.9981336,0.00007544526,0.000265596,0.0006231712,0.0003254362,0.0005767682],"domain_scores_gemma":[0.9986524,0.000171954,0.0001549433,0.0007618706,0.00006267764,0.000196164],"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.00005381652,0.0002338598,0.006823366,0.0000721254,0.00007265829,0.0003034344,0.001366941,0.000009056955,0.009961247,0.7793127,0.02417512,0.1776156],"study_design_scores_gemma":[0.003100659,0.001366887,0.03788442,0.0009089014,0.00005979141,0.0002872059,0.0001029475,0.003266157,0.02354211,0.1955851,0.7318646,0.002031199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3015226,0.002749841,0.5794618,0.04179303,0.007283157,0.001218627,0.00009101838,0.001525296,0.06435467],"genre_scores_gemma":[0.9562056,0.00009705115,0.01682763,0.0004338868,0.0004613615,0.00001997574,0.000001010552,0.00002434584,0.02592911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7076895,"threshold_uncertainty_score":0.9998602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026224392","doi":"10.1016/s0022-4049(01)00098-6","title":"Free μ-lattices","year":2002,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Unary operation; Mathematics; Decidability; Equivalence relation; Lattice (music); Combinatorics; Partially ordered set; Class (philosophy); Equivalence (formal languages); Discrete mathematics; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01730136863860692,"gpt":0.2263319497077195,"spread":0.2090305810691126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000147522,0.0001069044,0.0001953808,0.00008468225,0.00008694171,0.0001039582,0.0006415966,0.00004945225,0.00006440402],"category_scores_gemma":[0.00001916096,0.00007666701,0.00005639716,0.0001761524,0.00003832893,0.0004062447,0.0001352668,0.0002050436,0.0000178951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008034875,"about_ca_system_score_gemma":0.000008184882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.303331e-7,"about_ca_topic_score_gemma":5.63972e-7,"domain_scores_codex":[0.999184,0.0000132674,0.0002604734,0.0001375344,0.0002280853,0.0001766201],"domain_scores_gemma":[0.9993008,0.00006637081,0.0002297544,0.0002376066,0.00004122558,0.0001241763],"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.000008656213,0.0001113105,0.0001663326,0.00001865971,0.00004649211,0.00008223586,0.0009663541,0.00004691401,0.002329757,0.8125024,0.01177128,0.1719496],"study_design_scores_gemma":[0.002140789,0.0004464753,0.002872414,0.00004839386,0.00004887603,0.0007673216,0.0002585374,0.001750621,0.00485332,0.9404075,0.0459148,0.0004909194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5003417,0.01230342,0.4208289,0.01626244,0.001102839,0.0002727716,0.000003948986,0.0001660019,0.04871796],"genre_scores_gemma":[0.9790584,0.0002129833,0.01924264,0.001043622,0.0002798853,0.000001175589,8.356056e-8,0.000005808755,0.0001554217],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4787167,"threshold_uncertainty_score":0.312639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055594915","doi":"10.4153/cjm-2009-023-2","title":"A Subalgebra Intersection Property for Congruence Distributive Varieties","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Unary operation; Distributive property; Idempotence; Subalgebra; Congruence (geometry); Property (philosophy); Pure mathematics; Intersection (aeronautics); Affine transformation; Algebra over a field; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01698646704635338,"gpt":0.2320665790006097,"spread":0.2150801119542563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002524709,0.00009116198,0.0001731508,0.00009961947,0.0001226769,0.0001177652,0.0004779497,0.00004098865,0.000007016612],"category_scores_gemma":[0.0003304691,0.00005953203,0.0001002208,0.0001494923,0.00005014046,0.0004021896,0.000008072121,0.0001192011,0.000003506456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001379203,"about_ca_system_score_gemma":0.0005008293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006171748,"about_ca_topic_score_gemma":0.0009445283,"domain_scores_codex":[0.9992903,0.0000156151,0.0002771391,0.00008932634,0.0001048575,0.0002227428],"domain_scores_gemma":[0.9989901,0.00007559814,0.0002232043,0.0001550758,0.0002991068,0.0002568709],"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.000008395502,0.0000669441,0.0001538948,0.00005149468,0.0000435266,0.00009301373,0.005215342,0.00009274483,0.0003012902,0.9546295,0.003696269,0.03564759],"study_design_scores_gemma":[0.0005057866,0.001059513,0.0009878696,0.0001607232,0.000031969,0.0007352411,0.001026882,0.009434624,0.001483714,0.9779801,0.006314675,0.0002788632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0140161,0.0001132054,0.9836093,0.001438905,0.0002972572,0.0001302163,0.000005453637,0.00001187031,0.0003777492],"genre_scores_gemma":[0.9362673,0.000003147247,0.06324065,0.0002791939,0.00006429548,0.000001880479,6.532241e-7,0.000003756916,0.0001391094],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9222512,"threshold_uncertainty_score":0.2427646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045590994","doi":"10.1002/malq.200810012","title":"Commutative rings whose ideals form an MV‐algebra","year":2009,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Commutative ring; Commutative algebra; Noncommutative ring; Class (philosophy); Semiprime ring; Pure mathematics; Commutative property; Maximal ideal; Artinian ring; Von Neumann regular ring; Local ring; Lattice (music); Ideal (ethics); Unit (ring theory); Ring (chemistry); Algebra over a field; Combinatorics; Law; Chemistry; Noetherian","retraction":null,"screen_n_in":null,"score":{"opus":0.01908106264099546,"gpt":0.2846295600378421,"spread":0.2655484973968466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004242483,0.0003045572,0.0004494589,0.00009339861,0.000214812,0.0002682339,0.001261443,0.0001174452,0.0001232018],"category_scores_gemma":[0.00005659034,0.0002262994,0.0001267512,0.0003265738,0.0001128776,0.001182194,0.00005826464,0.0002724779,0.0007034583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004544725,"about_ca_system_score_gemma":0.00002457789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001682831,"about_ca_topic_score_gemma":0.000001680572,"domain_scores_codex":[0.9978664,0.000116932,0.0005013812,0.0005208501,0.0003908165,0.0006036164],"domain_scores_gemma":[0.9982809,0.0002890257,0.0001560997,0.0008997314,0.00008317409,0.0002910541],"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.000005505086,0.000288211,0.00000518594,0.00001431762,0.000006683093,0.00004782284,0.005301832,0.000004057802,0.0002771064,0.9282324,0.00009941198,0.06571745],"study_design_scores_gemma":[0.0003239572,0.002330983,0.0009764706,0.00003017943,0.000007782734,0.00007499706,0.0004119144,0.01047836,0.000171517,0.9847748,0.00009769565,0.0003213822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07807998,0.00004717589,0.9039285,0.002390895,0.00007322254,0.0003178546,0.000002192226,0.0005726551,0.01458757],"genre_scores_gemma":[0.8508739,0.000001315151,0.1465193,0.002351776,0.00005783132,0.00002228148,0.000003809224,0.00001008246,0.0001596114],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7727939,"threshold_uncertainty_score":0.9228222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3010545200","doi":"10.1007/jhep03(2021)124","title":"Two more fermionic minimal models","year":2021,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Minimal models; Minimal model; Unitary state; Symmetry (geometry); Unitarity; Work (physics); Type (biology); Global symmetry","retraction":null,"screen_n_in":null,"score":{"opus":0.01923568601799346,"gpt":0.2514655330656547,"spread":0.2322298470476612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006273476,0.0001145541,0.0002338681,0.00003354968,0.0000693102,0.00006531565,0.0005003245,0.00003024688,0.000005944005],"category_scores_gemma":[0.000008865134,0.00009380533,0.0001549666,0.0003076616,0.00002855131,0.0009010658,0.0001549228,0.0001579893,0.000002970592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003924159,"about_ca_system_score_gemma":0.0001933482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000046738,"about_ca_topic_score_gemma":0.00000179428,"domain_scores_codex":[0.9989986,0.00004567541,0.000273139,0.0001605622,0.0003259966,0.0001960104],"domain_scores_gemma":[0.99903,0.00005572293,0.0002450903,0.0002900175,0.0002792345,0.00009991258],"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.000004800266,0.00007892441,0.000005072221,0.000002051741,0.0000244721,0.000248604,0.00007744903,0.05141343,0.0004284405,0.9346097,0.0001446166,0.01296252],"study_design_scores_gemma":[0.00045585,0.00007378254,0.00008505156,0.00001880187,0.00001153026,0.0002440892,0.00002110208,0.01277817,0.01475085,0.9708747,0.0005612565,0.0001248143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04378872,0.0005895786,0.9537429,0.0007069348,0.0004786592,0.000006764246,5.48974e-7,0.00001963738,0.0006662213],"genre_scores_gemma":[0.9529858,0.0001054068,0.04541345,0.0007099437,0.0005143244,6.79324e-7,0.000001049287,0.000008362528,0.0002609617],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9091971,"threshold_uncertainty_score":0.382527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2996968996","doi":"10.1007/978-3-030-27093-3","title":"Combinatorial Set Theory of C*-Algebras","year":2019,"lang":"en","type":"book","venue":"Springer monographs in mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":32,"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":"Set (abstract data type); Realm; Operator (biology); Set theory; Commutative property; Doors; Algebra over a field; Mathematics; Bitwise operation; Computer science; Pure mathematics; Political science; Programming language; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.02094504116464215,"gpt":0.2443450422390622,"spread":0.22340000107442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008037275,0.000443846,0.0008934186,0.0006078842,0.00003767713,0.00005571383,0.001928622,0.0004187316,0.00003569618],"category_scores_gemma":[0.00008158659,0.0004109531,0.0004074295,0.0004037934,0.0001719608,0.0002257188,0.0006318269,0.0006176719,0.00009815096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000789578,"about_ca_system_score_gemma":0.0002108995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.083221e-7,"about_ca_topic_score_gemma":0.000001052232,"domain_scores_codex":[0.9976388,0.00007599169,0.0008186451,0.0005339279,0.0005233229,0.0004093455],"domain_scores_gemma":[0.9970064,0.0005840017,0.0006563198,0.001586901,0.00009154947,0.00007484474],"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.000004814951,0.0001047206,0.00006847199,0.0004773772,0.00006465877,0.00001344587,0.001195323,0.00002496967,0.000008627771,0.9960223,0.0007133159,0.001301951],"study_design_scores_gemma":[0.0003974629,0.00008741002,0.00004403554,0.0004816449,0.00002914703,0.000005060928,0.00004326272,0.0004869509,0.0001177997,0.9935219,0.004367695,0.000417689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.003129198,0.002758446,0.266476,0.00004586593,0.005212327,0.001804409,0.00004945585,0.000461336,0.7200629],"genre_scores_gemma":[0.1135274,0.001741532,0.516611,0.0005373748,0.001142977,0.0002656506,0.0001371691,0.0006998544,0.3653371],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.3547258,"threshold_uncertainty_score":0.9998342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119670110","doi":"10.1007/s00500-007-0185-8","title":"On some properties of quasi-MV algebras and $$\\sqrt{^{\\prime}}$$ quasi-MV algebras. Part II","year":2007,"lang":"en","type":"article","venue":"Soft Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Institute of Population and Public Health; Generalitat de Catalunya","keywords":"Prime (order theory); Mathematics; Pure mathematics; Non-associative algebra; Representation (politics); Algebra over a field; Combinatorics; Algebra representation","retraction":null,"screen_n_in":null,"score":{"opus":0.0207798165463184,"gpt":0.2446420167734175,"spread":0.2238622002270991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001144476,0.0004146827,0.0005601054,0.0002472476,0.0006060015,0.0001108459,0.0009549976,0.0001632748,0.00001101681],"category_scores_gemma":[0.0003034246,0.0003497499,0.0001373571,0.0005237095,0.0002676951,0.0006046189,0.000933014,0.0004090379,0.00003867449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006369213,"about_ca_system_score_gemma":0.0001015205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003305043,"about_ca_topic_score_gemma":0.00001013098,"domain_scores_codex":[0.9967685,0.0001036057,0.0007743579,0.0008731858,0.0005921355,0.0008881934],"domain_scores_gemma":[0.9980221,0.0004362476,0.0003957981,0.000760584,0.0001359534,0.0002492574],"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.00008221121,0.0009411505,0.002552505,0.0002119765,0.0001046516,0.00007981408,0.005363562,0.0005632113,0.01076965,0.6383995,0.0004199935,0.3405118],"study_design_scores_gemma":[0.006633831,0.007917511,0.01492802,0.00300473,0.0001347205,0.0005006049,0.001844741,0.1596145,0.2952294,0.4956488,0.009125339,0.005417849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7422122,0.001542667,0.2540342,0.0004445818,0.0006506442,0.0002653631,0.000001350389,0.0003900864,0.0004588164],"genre_scores_gemma":[0.9852693,0.00002309033,0.0133467,0.0008805873,0.0002824014,0.000003564051,0.000002623493,0.00003351764,0.0001582352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3350939,"threshold_uncertainty_score":0.9998955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046052042","doi":"10.1007/s00493-006-0013-2","title":"Canonical Partitions Of Universal Structures","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Algebra and Logic","field":"Computer Science","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 Calgary","funders":"","keywords":"Mathematics; Countable set; Combinatorics; Equivalence relation; Homogeneous; Equivalence (formal languages); Omega; Characterization (materials science); Discrete mathematics; Binary number; Equivalence class (music); Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.007565791298253982,"gpt":0.2151086045218966,"spread":0.2075428132236426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002501726,0.00005834628,0.00009349357,0.00003795384,0.00006320143,0.00001297079,0.000368757,0.0000308436,0.00001762102],"category_scores_gemma":[0.00001020499,0.00005220924,0.00003817253,0.0002762553,0.00005127569,0.0001331977,0.00009502238,0.0000626287,0.000007989491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003159548,"about_ca_system_score_gemma":0.00005031387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003664828,"about_ca_topic_score_gemma":0.000003767088,"domain_scores_codex":[0.9994786,0.00002132238,0.000109346,0.0001408629,0.0001143508,0.0001354626],"domain_scores_gemma":[0.9995626,0.00004662611,0.00004810125,0.0002617406,0.00004416723,0.0000368142],"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.556956e-7,0.00004293162,0.0004801155,0.000002043449,0.000001996882,0.000006859243,0.00001821999,0.0001022425,0.0002510518,0.9971648,0.001382037,0.0005469783],"study_design_scores_gemma":[0.0002320527,0.00005874484,0.0127142,0.000002379069,0.000003015696,0.000004610594,0.000005597235,0.0004059628,0.002724015,0.9749373,0.00882996,0.00008223011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3371052,0.0008415082,0.5933576,0.001549044,0.001409003,0.0002271012,0.000008230849,0.000475682,0.06502657],"genre_scores_gemma":[0.9954699,0.000003237363,0.004297834,0.00002954221,0.00001837115,0.000001742867,0.000001605614,0.000002620332,0.0001751368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6583647,"threshold_uncertainty_score":0.2129031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091429712","doi":"10.1007/s00012-011-0104-9","title":"A new look at the Jordan-Hölder theorem for semimodular lattices","year":2010,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Congruence (geometry); Prime (order theory); Combinatorics; Lattice (music); Interval (graph theory); Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.008923169779203205,"gpt":0.2280015782004117,"spread":0.2190784084212085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002100145,0.0001949673,0.0001612993,0.00006435625,0.000387053,0.0001291144,0.001423362,0.00009793995,0.0002755528],"category_scores_gemma":[0.00006707998,0.0001334745,0.0001423045,0.0003125568,0.0001409206,0.0006719431,0.0003972935,0.0002176228,0.0001075656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003471249,"about_ca_system_score_gemma":0.0001003288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006048347,"about_ca_topic_score_gemma":0.0002999814,"domain_scores_codex":[0.9987409,0.00004381344,0.0001456702,0.0004579397,0.0002137566,0.0003979055],"domain_scores_gemma":[0.9983319,0.0003881193,0.0001079326,0.0009367702,0.00007812397,0.0001571465],"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.00001239023,0.00001575958,0.0001093128,0.000004993023,0.00003159096,0.00001101487,0.0009835738,0.00002982065,0.003646057,0.9656039,0.01114303,0.0184086],"study_design_scores_gemma":[0.001169199,0.0001365716,0.0004839136,0.0000128738,0.0000531999,0.00004821004,0.000248524,0.005198475,0.01470606,0.4738582,0.5035822,0.000502614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1700132,0.000391619,0.8029694,0.01300375,0.001423086,0.000718189,0.00001468376,0.0004349133,0.01103117],"genre_scores_gemma":[0.8905541,0.00002878121,0.08263516,0.003025165,0.0005286387,0.00001965386,0.00001740013,0.0000438013,0.02314731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7205409,"threshold_uncertainty_score":0.5442932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086699431","doi":"10.1007/pl00000344","title":"Natural dualities for quasivarieties generated by a finite commutative ring","year":2001,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Queen's University","funders":"","keywords":"Commutative ring; Mathematics; Jacobson radical; Prime (order theory); Equivalence (formal languages); Ring (chemistry); Commutative property; Dual (grammatical number); Pure mathematics; Primary ideal; Combinatorics; Discrete mathematics; Algebra over a field; Principal ideal ring","retraction":null,"screen_n_in":null,"score":{"opus":0.01555149793469895,"gpt":0.2421788011705883,"spread":0.2266273032358894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001171303,0.000209034,0.00021541,0.000109567,0.0003448874,0.0001510197,0.0006887899,0.0000693779,0.00002542271],"category_scores_gemma":[0.00008410557,0.0001989799,0.00009256406,0.000440462,0.0001285518,0.001031305,0.0001797116,0.0001559733,0.00001574527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007157893,"about_ca_system_score_gemma":0.00005007018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001114783,"about_ca_topic_score_gemma":0.00003551999,"domain_scores_codex":[0.9987722,0.00009312321,0.000185069,0.0003633741,0.0001801739,0.0004060327],"domain_scores_gemma":[0.9987761,0.00051254,0.0001071003,0.0003547009,0.0001618494,0.00008765497],"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.00005736226,0.00006190213,0.0001513174,0.00001593217,0.00009829016,0.00005217265,0.009007632,0.0004378466,0.001631178,0.9749992,0.008310813,0.005176299],"study_design_scores_gemma":[0.005731429,0.0009581859,0.0005392146,0.00009653901,0.00009319825,0.0001091449,0.01055166,0.1854865,0.02429973,0.4400612,0.3296501,0.002423154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09746667,0.000936983,0.8955415,0.001946968,0.0004556105,0.0002965748,0.00004840421,0.0004731342,0.002834085],"genre_scores_gemma":[0.9754775,0.00009097418,0.01876882,0.001155662,0.00006660079,0.00001856598,0.00009051365,0.00001874405,0.004312575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8780109,"threshold_uncertainty_score":0.8114164,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985762660","doi":"10.1080/03081080601084112","title":"On Tate's trace","year":2007,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"TRACE (psycholinguistics); Mathematics; Subject (documents); Algebra over a field; Pure mathematics; Computer science; Linguistics; Philosophy; Library science","retraction":null,"screen_n_in":null,"score":{"opus":0.01217836327322993,"gpt":0.2713606514743936,"spread":0.2591822882011637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000328446,0.0001829221,0.0001716741,0.0001008841,0.0001430978,0.00005004779,0.0003405684,0.00008879819,0.00002163451],"category_scores_gemma":[0.00009349485,0.000149107,0.00006131729,0.0002401268,0.00006799989,0.000241663,0.0001127593,0.0002233421,0.0001784462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001298245,"about_ca_system_score_gemma":0.00001686797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007130141,"about_ca_topic_score_gemma":0.000007583277,"domain_scores_codex":[0.9987133,0.00002368697,0.0002296478,0.0004407598,0.0002035482,0.0003890683],"domain_scores_gemma":[0.9990616,0.0002450058,0.00005538272,0.0003945907,0.00004729116,0.0001961057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001110317,0.0003124592,0.000487659,0.00003021965,0.00003051013,0.0002125815,0.001224929,0.0003114731,0.003668967,0.4352697,0.0004778413,0.5578626],"study_design_scores_gemma":[0.008279842,0.002288943,0.03758683,0.0001458143,0.0000499049,0.0003361785,0.0004508701,0.5007645,0.14132,0.1254504,0.1803751,0.002951538],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.328016,0.0003156107,0.6669832,0.0003771097,0.0003527966,0.0001686121,0.000002596741,0.0003116527,0.003472479],"genre_scores_gemma":[0.9269645,0.00003759977,0.07075504,0.001088056,0.0001909839,0.000003148385,0.000003051315,0.00001555937,0.0009420751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5989485,"threshold_uncertainty_score":0.6080409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965001312","doi":"10.1007/s11083-011-9234-0","title":"MV-semirings and their Sheaf Representations","year":2011,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Semiring; Sheaf; Commutative property; Equivalence (formal languages); Representation (politics); Pure mathematics; Idempotence; Algebra over a field; Prime (order theory); Categorical variable; Kleene algebra; Class (philosophy); Discrete mathematics; Combinatorics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02919570014018854,"gpt":0.2387230834537752,"spread":0.2095273833135867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003679817,0.00004931607,0.00004669483,0.00002287999,0.0000656261,0.00002266286,0.0001785351,0.00001752024,0.00006866358],"category_scores_gemma":[0.00001716995,0.00003617489,0.00001126255,0.0001411248,0.00003095857,0.0002544839,0.0001103356,0.00004326399,0.00004611561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002749531,"about_ca_system_score_gemma":0.000008274113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001332702,"about_ca_topic_score_gemma":0.00000397798,"domain_scores_codex":[0.99963,0.000009712917,0.00005516044,0.0001680451,0.0000348207,0.0001022875],"domain_scores_gemma":[0.9996617,0.00002286812,0.0000180304,0.0002343893,0.00002598324,0.00003703626],"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.000005439517,0.0001051223,0.01302215,0.0000106769,0.00002235585,0.00001848738,0.01685938,0.00001798198,0.002123571,0.7820012,0.002203208,0.1836105],"study_design_scores_gemma":[0.0007534077,0.00016292,0.1575336,0.00002152557,0.000007361484,0.0001048199,0.000730181,0.01006966,0.01437464,0.7732766,0.04234521,0.0006200824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07969365,0.0001892953,0.8711616,0.0005878744,0.0001414158,0.00007551722,4.950912e-7,0.0001485144,0.04800167],"genre_scores_gemma":[0.9407535,0.00001933679,0.05770281,0.0004532785,0.000020419,0.00000821565,4.172637e-7,0.000003838772,0.00103814],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8610599,"threshold_uncertainty_score":0.1475169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155437720","doi":"10.1017/bsl.2015.10","title":"HEINRICH BEHMANN’S 1921 LECTURE ON THE DECISION PROBLEM AND THE ALGEBRA OF LOGIC","year":2015,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Habilitation; Axiom; Decision problem; Algebra over a field; Modal logic; Computer science; Order (exchange); Decision table; Calculus (dental); Mathematics; Algorithm; Artificial intelligence; Philosophy; Modal; Pure mathematics; Humanities","retraction":null,"screen_n_in":null,"score":{"opus":0.01949970764137757,"gpt":0.2356669271798566,"spread":0.216167219538479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001111414,0.0002197049,0.0003872977,0.00006651633,0.0001342893,0.00004746941,0.001230753,0.0001070427,0.00006673733],"category_scores_gemma":[0.0004747412,0.00009793389,0.0001039347,0.0003152564,0.0004439328,0.00003828501,0.0004648147,0.0002482696,0.00006247869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001905567,"about_ca_system_score_gemma":0.00004884781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003777357,"about_ca_topic_score_gemma":0.000003168865,"domain_scores_codex":[0.9981891,0.0002552385,0.00039297,0.0003921019,0.0004776492,0.0002929364],"domain_scores_gemma":[0.9976367,0.001046554,0.0002839096,0.0007740992,0.0001703796,0.00008831544],"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.00008886391,0.00008975525,0.00007490905,0.00001557339,0.00001876313,0.000006086485,0.001003039,0.0006174722,0.000057965,0.9780898,0.007010552,0.0129272],"study_design_scores_gemma":[0.001322767,0.000477817,0.0007985702,0.00006071308,0.00001622766,0.00004911815,0.0001607272,0.0005468705,0.0005970313,0.9775267,0.01826034,0.0001831445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.260148,0.01778811,0.3939173,0.1990141,0.001116549,0.003997485,0.00001336299,0.0004528688,0.1235523],"genre_scores_gemma":[0.9815909,0.0001652798,0.01430238,0.003623084,0.00006453139,0.00003631263,9.344323e-7,0.000009975501,0.0002065916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7214429,"threshold_uncertainty_score":0.3993628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093448135","doi":"10.1016/s0012-365x(00)00166-7","title":"On generalized constraints and certificates","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Calgary","keywords":"Mathematics; Boolean function; Boolean expression; Permutation (music); Constant (computer programming); Discrete mathematics; Parity function; Set (abstract data type); Complete Boolean algebra; Maximum satisfiability problem; Boolean network; Two-element Boolean algebra; Product term; Standard Boolean model; Combinatorics; And-inverter graph; Algebra over a field; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02833773675154287,"gpt":0.2662817561944066,"spread":0.2379440194428637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000826278,0.0001062147,0.0001313136,0.00003580478,0.00007682171,0.00008423157,0.0002559395,0.00003053235,0.0000428843],"category_scores_gemma":[0.00005427833,0.00007798274,0.00003761018,0.0001086252,0.00009569291,0.0001180403,0.00007540843,0.0000577413,0.00006497286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007306614,"about_ca_system_score_gemma":0.000006493547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.487221e-7,"about_ca_topic_score_gemma":3.951264e-7,"domain_scores_codex":[0.9993471,0.00001577346,0.0001467689,0.0001959486,0.0001230781,0.0001713205],"domain_scores_gemma":[0.9994277,0.0001127708,0.00005585746,0.0003182932,0.00001698825,0.0000684304],"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.000001638373,0.0000299906,0.00003817731,0.00001207235,0.000008057644,0.00001704071,0.0005181787,0.00002347743,0.0004447138,0.9899907,0.0001491869,0.008766741],"study_design_scores_gemma":[0.0003330145,0.00006551841,0.0001975718,0.00003431228,0.000007157513,0.00008555307,0.0001021473,0.04410649,0.001138531,0.9527902,0.0009189729,0.0002205501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1365429,0.00009958637,0.8492246,0.001120073,0.00007996584,0.0001321045,0.000002085906,0.0001626121,0.01263603],"genre_scores_gemma":[0.8856231,0.00004294583,0.1135916,0.0003431459,0.00001801561,0.000008316136,0.000001707065,0.000007703454,0.0003634648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7490802,"threshold_uncertainty_score":0.3180044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053628678","doi":"10.4153/cjm-2001-015-6","title":"<i>R</i>-Diagonal Elements and Freeness With Amalgamation","year":2001,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; Canadian Mathematical Society; National Science Foundation","keywords":"Diagonal; Mathematics; Class (philosophy); Element (criminal law); Pure mathematics; Algebra over a field; Geometry; Artificial intelligence; Law; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01277090885064501,"gpt":0.2074198811738972,"spread":0.1946489723232522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000186832,0.00007160628,0.0001192836,0.0001185188,0.00007945666,0.00008693084,0.0002750147,0.00002267059,0.00001369195],"category_scores_gemma":[0.00002836495,0.00005276541,0.00002314717,0.0001505058,0.00003722854,0.0003591916,0.00001164325,0.00008137075,0.000004006805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003418904,"about_ca_system_score_gemma":0.0002369059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003670099,"about_ca_topic_score_gemma":0.001576834,"domain_scores_codex":[0.9993986,0.00001283663,0.0002186272,0.00006527071,0.0001420716,0.0001625237],"domain_scores_gemma":[0.9992716,0.00004089012,0.0001919076,0.0001262519,0.0001112353,0.0002581449],"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.00002191809,0.00024143,0.1222438,0.0002737537,0.0003657395,0.003524957,0.01264357,0.001341461,0.0007260742,0.6837243,0.002145196,0.1727478],"study_design_scores_gemma":[0.007010359,0.002711554,0.1151871,0.001650427,0.0002946809,0.02964967,0.003829054,0.05828225,0.00179886,0.7138728,0.06356441,0.002148734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4495384,0.0002105867,0.5489166,0.0005312013,0.0000756442,0.00004748932,9.700707e-7,0.000006029095,0.0006730618],"genre_scores_gemma":[0.8367889,0.00002265127,0.1628246,0.000251324,0.0000473386,8.594675e-7,3.218721e-7,0.000005734764,0.00005833095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3872505,"threshold_uncertainty_score":0.2151711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078516608","doi":"10.1016/s0022-4049(01)00097-4","title":"A basic distributive law","year":2002,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Distributive property; Monad (category theory); Mathematics; Pure mathematics; Context (archaeology); Law; Algebra over a field; Functor; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01344918317022743,"gpt":0.2179630683649356,"spread":0.2045138851947082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001336935,0.0001171848,0.0002150782,0.000047333,0.0001136992,0.0000935826,0.0003689649,0.00004996713,0.0000452201],"category_scores_gemma":[0.000009562578,0.00008493066,0.00006720769,0.0001869459,0.00006411937,0.0003441927,0.00009135873,0.0002303823,0.00002497996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001629989,"about_ca_system_score_gemma":0.000008964623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.897756e-7,"about_ca_topic_score_gemma":9.915188e-7,"domain_scores_codex":[0.9991705,0.00001668024,0.0002528001,0.0001519999,0.0002085547,0.0001993957],"domain_scores_gemma":[0.9993849,0.00006325608,0.0002055874,0.0001572733,0.00005136167,0.000137644],"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.000005660358,0.00005702624,0.00002993302,0.000005342892,0.00002017904,0.00004466932,0.0003235837,0.000009900228,0.0008312579,0.9621031,0.001491175,0.03507822],"study_design_scores_gemma":[0.002158742,0.0005600803,0.001758808,0.00005662598,0.00005226904,0.0009052301,0.0002934925,0.0009689428,0.01000096,0.9218941,0.06078779,0.0005629603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3000039,0.005071046,0.6309256,0.006244096,0.0007037544,0.0003066497,0.000009356569,0.0001306898,0.05660488],"genre_scores_gemma":[0.9933197,0.00008224417,0.005394767,0.0009343151,0.000187295,0.000001716738,3.27901e-7,0.000004940613,0.00007465782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6933158,"threshold_uncertainty_score":0.3463372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040487904","doi":"10.1016/j.disc.2009.04.009","title":"Generalizations of Świerczkowski’s lemma and the arity gap of finite functions","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":27,"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":"Arity; Mathematics; Unary operation; Lemma (botany); Generalization; Discrete mathematics; Projection (relational algebra); Finite set; Characterization (materials science); Combinatorics; Set (abstract data type); Algorithm; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02387652398591051,"gpt":0.2539666835169974,"spread":0.2300901595310869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001760552,0.00007828134,0.0001833227,0.00003974859,0.00008795111,0.00002247167,0.0002790922,0.00002770453,0.000008829398],"category_scores_gemma":[0.0001323691,0.00004848073,0.00007168605,0.0002394938,0.0001449458,0.0001367892,0.00007333217,0.00005560767,0.000002267297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003756214,"about_ca_system_score_gemma":0.000015383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002590431,"about_ca_topic_score_gemma":0.000002573169,"domain_scores_codex":[0.9993617,0.0000344322,0.0002605973,0.00010819,0.000136402,0.00009869503],"domain_scores_gemma":[0.9991392,0.000206719,0.0001599003,0.0004021162,0.00006375882,0.00002827777],"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.000001972686,0.00003648381,0.00003361618,0.00002242587,0.000009799109,2.923845e-7,0.001377884,0.0006689515,0.0001371579,0.9964957,0.00006475842,0.001150952],"study_design_scores_gemma":[0.0004452658,0.0000634043,0.000762272,0.00003216188,0.00003181867,0.00000735964,0.0001976845,0.1335772,0.0005552176,0.8640478,0.0001841346,0.00009569457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01328606,0.000187315,0.9808003,0.0008514374,0.00004109571,0.0001345933,0.000007673112,0.00002870922,0.004662828],"genre_scores_gemma":[0.9202912,0.00004978895,0.07929002,0.000121517,0.00001461275,0.000004625664,0.000002903435,0.000003250432,0.0002220969],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9070051,"threshold_uncertainty_score":0.1976987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964472717","doi":"10.1007/s11225-005-2805-6","title":"Representations of monadic MV -algebras","year":2005,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Subalgebra; Mathematics; Finitely-generated abelian group; Algebra over a field; Pure mathematics; Characterization (materials science); Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0224064972674812,"gpt":0.2806372452550117,"spread":0.2582307479875305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000900188,0.00008944515,0.0001456822,0.00005645369,0.0001070971,0.00001702781,0.000518484,0.00003129128,0.00007003408],"category_scores_gemma":[0.00006738936,0.00007068959,0.00006033311,0.0003671106,0.00007218263,0.0002471068,0.00020775,0.00007702786,0.0001262153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001738227,"about_ca_system_score_gemma":0.00003551914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007251322,"about_ca_topic_score_gemma":0.00001311284,"domain_scores_codex":[0.9991177,0.00003587085,0.0001979005,0.0002767184,0.0001743379,0.0001974439],"domain_scores_gemma":[0.9992704,0.00009990958,0.00008518931,0.0004285069,0.00005697717,0.00005899418],"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.000002733573,0.0001388733,0.002210591,0.000004662068,0.00001847045,0.00001040802,0.0007367485,0.0006427734,0.0008478049,0.957705,0.001838832,0.03584317],"study_design_scores_gemma":[0.001706017,0.0006342376,0.3258326,0.00002407112,0.00004269197,0.0000485257,0.0006056521,0.003655215,0.009329366,0.5824766,0.07472108,0.0009239003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1475683,0.002638087,0.5622276,0.008349626,0.0004934638,0.0005419576,0.000008096589,0.0005367156,0.2776362],"genre_scores_gemma":[0.9536628,0.00004810025,0.04545415,0.0003577976,0.00007588112,0.00001650076,0.000001126656,0.000003338018,0.00038033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8060945,"threshold_uncertainty_score":0.2882638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004738733","doi":"10.1017/s1446788708000311","title":"VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS","year":2008,"lang":"en","type":"article","venue":"Journal of the Australian Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Subvariety; Simple (philosophy); Variety (cybernetics); Set (abstract data type); Exponent; Pure mathematics; Discrete mathematics; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04081405847437331,"gpt":0.2583620564928636,"spread":0.2175479980184903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003540948,0.000155234,0.0003059972,0.00001208246,0.0003142177,0.00007259918,0.001257746,0.00009052134,0.00009500603],"category_scores_gemma":[0.00007909406,0.00008908526,0.0004481997,0.0003022722,0.0002143376,0.000355541,0.0001845636,0.0004101809,0.00002827215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006183968,"about_ca_system_score_gemma":0.00005689074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001467097,"about_ca_topic_score_gemma":1.161442e-7,"domain_scores_codex":[0.9984778,0.00008224328,0.000498838,0.0001368636,0.0005048614,0.00029945],"domain_scores_gemma":[0.9988564,0.0001405942,0.0003620356,0.0003641329,0.000128999,0.0001478187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009808092,0.0004268304,0.0007469292,0.00007721828,0.0002316328,0.00004351047,0.004617407,0.0005071646,0.01844351,0.09977119,0.874517,0.0006077958],"study_design_scores_gemma":[0.001649512,0.0004262895,0.004514786,0.0001060852,0.00009336233,0.003708125,0.0006978984,0.01495587,0.02533949,0.8964982,0.05123196,0.0007784272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3148639,0.0001219954,0.6767448,0.007447111,0.000284487,0.0001398118,0.000005752491,0.00006084592,0.0003313951],"genre_scores_gemma":[0.897733,0.00003851773,0.09828245,0.001200547,0.0001559816,0.00000186441,6.975316e-7,0.00001245485,0.002574467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.823285,"threshold_uncertainty_score":0.3632791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963598054","doi":"10.1007/s11083-012-9281-1","title":"Notes on Planar Semimodular Lattices. VII. Resections of Planar Semimodular Lattices","year":2012,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Distributive property; Planar; Combinatorics; Mathematics; Distributive lattice; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02726602632467901,"gpt":0.2746508667821295,"spread":0.2473848404574505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002757596,0.000207658,0.0002495956,0.0001486688,0.0001887151,0.0000444487,0.0006080627,0.0001214368,0.00008983003],"category_scores_gemma":[0.0001499544,0.0001705975,0.00007410537,0.0005624507,0.00007695486,0.0007151967,0.00008563826,0.0002339737,0.0002361554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002988025,"about_ca_system_score_gemma":0.00003444629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005324796,"about_ca_topic_score_gemma":0.00002638967,"domain_scores_codex":[0.998466,0.00008226647,0.0002524407,0.0003599568,0.0003526976,0.0004866626],"domain_scores_gemma":[0.9985669,0.000309027,0.0001505099,0.0007249483,0.00009504997,0.0001535994],"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.00008854272,0.001608813,0.0547708,0.00026323,0.0003520294,0.00006981719,0.005671402,0.005295278,0.0191228,0.8674049,0.006987042,0.03836528],"study_design_scores_gemma":[0.004614715,0.00224722,0.1614975,0.0007156759,0.0003062643,0.0002464449,0.0009260192,0.0325875,0.1168948,0.1330758,0.5425383,0.004349744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4316029,0.003030782,0.5310137,0.004312546,0.002190883,0.000588735,0.00004574224,0.0006488899,0.02656581],"genre_scores_gemma":[0.9676263,0.0000498157,0.03098469,0.0005934353,0.0002496828,0.0000148994,0.00000999614,0.00001975193,0.0004513886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7343292,"threshold_uncertainty_score":0.6956766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W17485640","doi":"10.70930/tac/3t10x9pb","title":"On extensions of lax monads","year":2004,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Universidade de Coimbra","keywords":"Monad (category theory); Ultrafilter; Mathematics; Pure mathematics; Morphism; Descent (aeronautics); Extension (predicate logic); Section (typography); Tensor product; Algebra over a field; Discrete mathematics; Computer science; Functor","retraction":null,"screen_n_in":null,"score":{"opus":0.007629653076829406,"gpt":0.2417868340842249,"spread":0.2341571810073955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001227196,0.00005213534,0.00009012427,0.00004155982,0.00007651849,0.000005803817,0.0002171548,0.00002103686,0.000004197485],"category_scores_gemma":[0.00002101673,0.00004168996,0.0000199484,0.0001815099,0.0001896256,0.0000957048,0.00005428202,0.00003793825,0.00000465506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003550578,"about_ca_system_score_gemma":0.00002239494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003110716,"about_ca_topic_score_gemma":6.465995e-7,"domain_scores_codex":[0.9996295,0.00001714703,0.0001101736,0.0001169646,0.00006179841,0.00006440732],"domain_scores_gemma":[0.9993885,0.000160971,0.00006071894,0.0003137654,0.00004939918,0.00002665268],"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.000007099243,0.00004231029,0.000005189128,0.000006843713,0.000003067805,1.482319e-7,0.0002285096,0.0003058496,0.001395936,0.9867466,0.000004088417,0.01125432],"study_design_scores_gemma":[0.00009959549,0.00005097469,0.0003164913,0.000004043583,0.000003331556,0.000002487072,0.0001031135,0.00001016056,0.0244654,0.974517,0.000383921,0.00004342068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05884279,0.0003010957,0.9370677,0.0002006921,0.0000138988,0.0001050912,0.00000271925,0.00003532353,0.003430736],"genre_scores_gemma":[0.9952672,0.00004180151,0.004493277,0.0000690759,0.000009888447,0.00003046823,0.000001413689,0.000002288497,0.00008458013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9364244,"threshold_uncertainty_score":0.1700068,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2738364938","doi":"10.4153/s0008414x19000397","title":"On the Combinatorics of Gentle Algebras","year":2019,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Université de Sherbrooke","funders":"","keywords":"Bijection; Basis (linear algebra); Construct (python library); Torsion (gastropod); Realization (probability); Algebra over a field","retraction":null,"screen_n_in":null,"score":{"opus":0.01407944305457705,"gpt":0.203820856828005,"spread":0.189741413773428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000317724,0.0000663681,0.0001550109,0.00009702474,0.00004427111,0.00003144889,0.000783099,0.00002908354,0.0000830848],"category_scores_gemma":[0.000159354,0.00004096198,0.00008583615,0.0001867914,0.00003444577,0.0001054217,0.00001869265,0.0001435003,0.00006081715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000448048,"about_ca_system_score_gemma":0.0003137513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001850125,"about_ca_topic_score_gemma":0.00006989198,"domain_scores_codex":[0.9993383,0.00002384805,0.0002517718,0.00005393621,0.0001853407,0.0001468477],"domain_scores_gemma":[0.9988587,0.0002680163,0.000274671,0.0003199899,0.0001204704,0.0001581273],"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":[2.844963e-7,0.00001755975,0.0001951787,0.00001516304,0.00001326177,0.00001342198,0.0005882877,0.0001001682,0.00003953107,0.9975504,0.001206702,0.000260043],"study_design_scores_gemma":[0.000209759,0.0002337182,0.0004029797,0.0001034661,0.000009070374,0.00009593307,0.000301625,0.001863829,0.001274093,0.9933189,0.002091731,0.00009494698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9030275,0.0003475117,0.08482271,0.001631932,0.0009087411,0.000150696,0.000002445759,0.000006670508,0.009101814],"genre_scores_gemma":[0.9936925,0.000004882646,0.005799986,0.0002698183,0.00001633389,3.095016e-7,6.55235e-8,0.000005329494,0.000210816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09066499,"threshold_uncertainty_score":0.1670381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166460071","doi":"10.1109/3477.938269","title":"A decomposition of fuzzy relations","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Fuzzy logic; Fuzzy number; Fuzzy classification; Decomposition; Defuzzification; Fuzzy set operations; Fuzzy mathematics; Fuzzy set; Algebra over a field; Algorithm; Computer science; Artificial intelligence; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01729282291372276,"gpt":0.2487628811630452,"spread":0.2314700582493224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001952618,0.0002856679,0.0003580465,0.0002381578,0.0002401581,0.0001269332,0.0003931475,0.0001700908,0.00003783356],"category_scores_gemma":[0.000004374388,0.0002816253,0.0001257462,0.0004797274,0.0001465048,0.0002565838,0.000008478349,0.0002712341,0.0001300125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005517574,"about_ca_system_score_gemma":0.00003847908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007191818,"about_ca_topic_score_gemma":0.0000576001,"domain_scores_codex":[0.9979511,0.000139035,0.0006140614,0.0005271828,0.0003931322,0.0003754138],"domain_scores_gemma":[0.9985828,0.0001783367,0.000221063,0.0006633968,0.0001401612,0.0002141923],"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.0002592548,0.003139563,0.002152292,0.0004089276,0.0006549111,0.0002087691,0.007067498,0.2434606,0.01040643,0.60003,0.003993293,0.1282185],"study_design_scores_gemma":[0.01431428,0.00787693,0.0203546,0.003048131,0.001173652,0.003576827,0.002562434,0.5664695,0.04744405,0.09796152,0.2275149,0.007703177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09185944,0.0005648844,0.8938904,0.0002822892,0.001009556,0.0004316516,0.00001915145,0.0001931354,0.01174952],"genre_scores_gemma":[0.9915554,0.0005189138,0.003207882,0.00009623733,0.00007678827,0.00005504011,0.00000392631,0.0000255993,0.004460248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8996959,"threshold_uncertainty_score":0.9999636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038424818","doi":"10.1017/s0963548303005765","title":"Canonical Vertex Partitions","year":2003,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Arity; Countable set; Mathematics; Vertex (graph theory); Partition (number theory); Signature (topology); Binary number; Discrete mathematics; Finite set; Combinatorics; Graph; Arithmetic; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02439963554927065,"gpt":0.248925663942766,"spread":0.2245260283934953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006880916,0.0001824738,0.0002295122,0.00005247443,0.0004151883,0.0001166655,0.0007416909,0.00008376783,0.00001358444],"category_scores_gemma":[0.0006955836,0.0001802649,0.0001005582,0.0007854282,0.00009028997,0.0003044379,0.0002918284,0.0003026451,0.00006290432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001889292,"about_ca_system_score_gemma":0.0002071169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004067031,"about_ca_topic_score_gemma":0.000002140096,"domain_scores_codex":[0.9980252,0.0002369607,0.0003622069,0.0005954234,0.0002726606,0.0005075476],"domain_scores_gemma":[0.9983349,0.0003585834,0.00009984901,0.0008518306,0.0001663223,0.0001885361],"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":[5.094182e-7,0.0001937034,0.003101192,0.00001396479,0.000005104559,0.000006484927,0.000142631,0.0004540422,0.00002897139,0.9934159,0.0001245959,0.002512909],"study_design_scores_gemma":[0.0003166535,0.00007081941,0.001924307,0.00001212183,0.000003641524,0.00002248078,0.000009196969,0.01094547,0.000482451,0.9820704,0.003906776,0.0002356102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1793166,0.0002295216,0.8040189,0.0004359621,0.001525171,0.0003150163,6.33796e-7,0.0005784532,0.01357978],"genre_scores_gemma":[0.9678646,0.000002871717,0.03184771,0.0001961802,0.00001649452,0.000008273503,0.000001241255,0.000008812219,0.00005386667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7885479,"threshold_uncertainty_score":0.7350989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037036822","doi":"10.1007/s11229-009-9667-9","title":"On the creative role of axiomatics. The discovery of lattices by Schröder, Dedekind, Birkhoff, and others","year":2009,"lang":"en","type":"article","venue":"Synthese","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":24,"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":"Dedekind cut; Axiom; Epistemology; Philosophy of science; Philosophy of language; Metaphysics; Perspective (graphical); Mathematics; Axiomatic system; Algebra over a field; Calculus (dental); Philosophy; Computer science; Pure mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.008420275351095527,"gpt":0.2279796315742306,"spread":0.2195593562231351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002043581,0.00009267742,0.0001335123,0.00002819988,0.00007655057,0.00004255037,0.0005071942,0.0000260703,0.000009032313],"category_scores_gemma":[0.0001632619,0.00004325053,0.00003937394,0.0001597795,0.0001830865,0.0002453116,0.00005910974,0.00006646652,0.000003435585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005877865,"about_ca_system_score_gemma":0.00001466274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002364979,"about_ca_topic_score_gemma":0.000003823404,"domain_scores_codex":[0.9993235,0.00009062309,0.0001417169,0.0001478289,0.0001724872,0.0001238395],"domain_scores_gemma":[0.998602,0.0008181494,0.0001445374,0.0003932397,0.00002195089,0.00002016782],"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.00003479129,0.0002009603,0.0003154065,0.00001538209,0.00005460601,0.00000165253,0.005716841,0.0001103836,0.02977164,0.8925809,0.0002613162,0.07093608],"study_design_scores_gemma":[0.0003383578,0.0006199334,0.007054891,0.0002185443,0.0000321258,0.000007074866,0.004850945,0.01038305,0.2771155,0.6983919,0.0006911387,0.0002966021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9620834,0.001226842,0.02626438,0.002496272,0.00003430904,0.0002149822,0.00001006117,0.000026493,0.007643251],"genre_scores_gemma":[0.9985906,0.0000380478,0.0009668948,0.0002711718,0.000008175048,0.000004138311,1.660477e-7,0.000003674103,0.0001171323],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2473439,"threshold_uncertainty_score":0.1763705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082754577","doi":"10.1016/j.aim.2007.11.008","title":"Ghosts in modular representation theory","year":2007,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Modular design; Representation (politics); Algebra over a field; Representation theory; Pure mathematics; Computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01318076718387868,"gpt":0.3109328257629224,"spread":0.2977520585790437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794072,0.00009830337,0.0001514769,0.0001559183,0.00002596001,0.00002009348,0.0004420227,0.0000405948,0.000007797128],"category_scores_gemma":[0.0002233866,0.00008793388,0.00003233007,0.0005780982,0.00003999444,0.0009021072,0.00009870347,0.0001213345,0.00002424341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004734387,"about_ca_system_score_gemma":0.000009331187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001111787,"about_ca_topic_score_gemma":0.00003089169,"domain_scores_codex":[0.9989484,0.00003714364,0.000332485,0.000237403,0.0001862558,0.0002583337],"domain_scores_gemma":[0.998978,0.0004603096,0.00009906125,0.0004090322,0.00002116294,0.00003244264],"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.000004082559,0.0001000283,0.001679765,0.00003001311,0.000001431977,0.00006115506,0.001843375,0.003566229,0.0001894063,0.8970188,0.000001613063,0.09550404],"study_design_scores_gemma":[0.0002121233,0.00001705734,0.003644709,0.00004920441,8.852942e-7,0.00000962364,0.0003657194,0.01336402,0.001233021,0.9806891,0.0002977394,0.0001167589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04963563,0.001237363,0.9384082,0.00004559761,0.0001535085,0.00014657,1.870823e-7,0.00006236122,0.01031056],"genre_scores_gemma":[0.6886599,0.000201364,0.3108844,0.00009584149,0.00002177402,0.000009345342,7.269439e-7,0.000006940394,0.0001196594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6390243,"threshold_uncertainty_score":0.358584,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2609553806","doi":"10.1090/crmm/013/07","title":"Tilings, 𝐶*-algebras, and 𝐾-theory","year":2000,"lang":"en","type":"book-chapter","venue":"CRM monograph series","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.009761516551065644,"gpt":0.2003399792815027,"spread":0.190578462730437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001282322,0.0004611327,0.0004249013,0.0002927598,0.0002433271,0.0002061776,0.0006838134,0.0003097465,0.0002144441],"category_scores_gemma":[0.000007245455,0.0004267164,0.0001725156,0.00008966702,0.0004740738,0.0006473358,0.0002562383,0.0003710546,0.00008474023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001184664,"about_ca_system_score_gemma":0.00003973164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001240921,"about_ca_topic_score_gemma":0.000004341126,"domain_scores_codex":[0.9984177,0.00002194545,0.000302935,0.0007109312,0.0002086328,0.0003378346],"domain_scores_gemma":[0.998815,0.00007956241,0.0001515613,0.0007548986,0.00004557939,0.0001533786],"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.00001834255,0.00000540223,0.00001073568,0.00002168797,0.00003667174,0.00003993808,0.0002404412,0.000001683904,0.000004859412,0.9125355,0.0002411791,0.08684358],"study_design_scores_gemma":[0.00008787605,0.00009919564,0.00005723552,0.00006079982,0.00001908667,0.00007061614,0.00001284577,0.00001300534,0.00004990306,0.7656793,0.2334556,0.00039458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0007065396,0.01931182,0.02045679,0.0002850678,0.0005766301,0.0003612742,0.00002264617,0.000839269,0.95744],"genre_scores_gemma":[0.03414585,0.03884847,0.05082689,0.003001413,0.0009189261,0.00009249258,0.0001095458,0.0003112152,0.8717452],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2332144,"threshold_uncertainty_score":0.9998184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913086526","doi":"10.1023/a:1026218512171","title":"Hazard Algebras","year":2003,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":23,"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":"Hazard; SIGNAL (programming language); Ternary operation; Computer science; Energy (signal processing); Algorithm; Computer engineering; Electronic engineering; Arithmetic; Mathematics; Engineering; Programming language; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.06146538210206001,"gpt":0.3461092963738174,"spread":0.2846439142717574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004438117,0.0001884546,0.0003156759,0.0001695946,0.0001187915,0.0000815906,0.0007155038,0.0001064735,0.00001195117],"category_scores_gemma":[0.0002637323,0.0001577451,0.000075093,0.0006679855,0.0000287326,0.0008925032,0.00009801015,0.0001784051,0.00009813369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152817,"about_ca_system_score_gemma":0.00007572812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002337735,"about_ca_topic_score_gemma":6.325272e-7,"domain_scores_codex":[0.9965067,0.001904205,0.0004336936,0.0003882115,0.0002094701,0.0005577064],"domain_scores_gemma":[0.998606,0.0005241366,0.0001249741,0.0005932113,0.00004255553,0.0001091813],"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.000005856682,0.00002051716,0.0001825978,0.000040602,0.000006553938,0.00004269385,0.0003242118,0.000953078,0.0007628666,0.9512054,0.00006070937,0.04639496],"study_design_scores_gemma":[0.003982078,0.001252385,0.003207546,0.0005854858,0.00003570845,0.001826781,0.001785115,0.258876,0.2326982,0.4599449,0.03296933,0.002836499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003710575,0.0003852797,0.9818558,0.00001829881,0.0008789003,0.0003279936,2.703487e-7,0.0002515458,0.01591083],"genre_scores_gemma":[0.1684431,0.000003017731,0.8312141,0.0000920517,0.00002688547,0.00006281566,1.428893e-7,0.00001042184,0.0001474203],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4912604,"threshold_uncertainty_score":0.6432659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966370644","doi":"10.1007/s00012-008-2089-6","title":"A note on planar semimodular lattices","year":2008,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Planar; Simple (philosophy); Product (mathematics); Combinatorics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01666100391834197,"gpt":0.2261664119373824,"spread":0.2095054080190405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000628277,0.0001709418,0.0001643709,0.0001395795,0.0002541343,0.00003123842,0.0008371192,0.00007476032,0.00004591965],"category_scores_gemma":[0.0000275327,0.0001564678,0.00007894004,0.0004199116,0.00009033614,0.0006728491,0.00009998331,0.0001606884,0.0003254203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005404274,"about_ca_system_score_gemma":0.00005361765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003863759,"about_ca_topic_score_gemma":0.000009287935,"domain_scores_codex":[0.9988036,0.00005089372,0.0001241891,0.0004260318,0.0002730768,0.0003222548],"domain_scores_gemma":[0.9990167,0.0001307964,0.00007218317,0.0006072405,0.00004131629,0.0001317714],"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.00002332254,0.0001116604,0.0005348561,0.000007869386,0.00003642728,0.001255044,0.002438649,0.0003789596,0.0008703016,0.9788283,0.006067802,0.00944685],"study_design_scores_gemma":[0.005752953,0.002251054,0.02477755,0.0001925789,0.00008593578,0.0009146309,0.0005743289,0.03448068,0.03055327,0.2316092,0.6651528,0.003655029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4001192,0.00034304,0.5320786,0.004564309,0.0008666391,0.0003426307,0.00001602842,0.00135937,0.06031026],"genre_scores_gemma":[0.9801201,0.00008147158,0.01679023,0.001800922,0.00008743745,0.000002261722,0.000006670386,0.00001326467,0.001097624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.747219,"threshold_uncertainty_score":0.6380572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}