{"meta":{"query_hash":"8fffe93618d3","filters":{"topic":"Advanced Algebra and Logic"},"cohort_total":680,"direct_labels_cover":0,"predictions_cover":680,"exported":680,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/8fffe93618d3","api":"https://metacan.xera.ac/api/v1/cohort?topic=Advanced+Algebra+and+Logic"},"results":[{"id":"W1007501148","doi":"10.1016/j.jalgebra.2015.04.041","title":"Dual closure operators and their applications","year":2015,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Closure operator; Closure (psychology); Categorical variable; Algebra over a field; Torsion (gastropod); Dual (grammatical number); Pure mathematics; Quotient; Homological algebra; Universal algebra; Topology (electrical circuits); Functor; Combinatorics","score_opus":0.018737348473189693,"score_gpt":0.2447554025008863,"score_spread":0.2260180540276966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1007501148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28763092,0.0024070223,0.70613426,0.0024174175,0.00030120832,0.000095721676,0.0000011929179,0.000034735716,0.0009775009],"genre_scores_gemma":[0.97778606,0.00003963485,0.021427548,0.00042003073,0.0002658866,0.0000023639268,2.0142649e-7,0.0000047934523,0.000053490425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993942,0.0000331476,0.00021077105,0.00010179312,0.0001451585,0.00011495819],"domain_scores_gemma":[0.99927264,0.00004456855,0.00014459499,0.00017114096,0.00017571209,0.00019131984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027718095,0.00007922105,0.00013895196,0.000070660884,0.000056150613,0.00007966042,0.00032300886,0.000034620818,0.000003238659],"category_scores_gemma":[0.000031637366,0.000051246294,0.000042342075,0.00019650861,0.00003802887,0.000535755,0.0000961205,0.00014919703,0.00001031925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003106564,0.0002475794,0.005348193,0.000017514598,0.0001186627,0.00011137073,0.0053408747,0.00031323507,0.0023114874,0.8057277,0.009471236,0.17096107],"study_design_scores_gemma":[0.0026622855,0.001355909,0.0074999975,0.000051613097,0.000029661442,0.0035660125,0.0016370629,0.0019944685,0.0071983044,0.7856539,0.1877327,0.0006181049],"about_ca_topic_score_codex":4.837907e-7,"about_ca_topic_score_gemma":5.983454e-7,"teacher_disagreement_score":0.69015515,"about_ca_system_score_codex":0.00001853788,"about_ca_system_score_gemma":0.000100855985,"threshold_uncertainty_score":0.20897631},"labels":[],"label_agreement":null},{"id":"W110992842","doi":"","title":"A Construction of Layered Relative Difference Sets Using Galois Rings.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.014225800978947642,"score_gpt":0.23799301514880405,"score_spread":0.2237672141698564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110992842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92491055,0.000081710554,0.072690144,0.000046150486,0.00074479455,0.00009004033,0.0000014902159,0.000086442786,0.001348698],"genre_scores_gemma":[0.96223223,0.0000032444889,0.037695497,0.000015389343,0.000004541302,0.0000027498008,0.0000012567618,0.000005607831,0.00003947094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990896,0.000050579918,0.00022270498,0.00025924298,0.00018645488,0.0001914038],"domain_scores_gemma":[0.9993079,0.00007347834,0.00018583829,0.00029756266,0.00009728374,0.000037973863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076560296,0.000116747746,0.00017904092,0.00006863036,0.00009730186,0.00002795466,0.0003111669,0.000060886643,0.000005032089],"category_scores_gemma":[0.000029642371,0.000110882276,0.000048942227,0.0003607855,0.0000962581,0.00037784013,0.00012566187,0.000114982344,0.0000063960006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031642203,0.000041873347,0.007477903,0.0000064324818,0.000006602265,0.0000052266428,0.000115520634,0.00014567559,0.0039559193,0.98698646,0.000012705999,0.0012424897],"study_design_scores_gemma":[0.0004331399,0.00005362517,0.021776872,0.000027646798,0.000005344822,0.000018598155,0.00001504967,0.010471326,0.0075912606,0.9594445,0.000027762579,0.00013482354],"about_ca_topic_score_codex":0.00008091157,"about_ca_topic_score_gemma":0.0000027165038,"teacher_disagreement_score":0.037321717,"about_ca_system_score_codex":0.000054834214,"about_ca_system_score_gemma":0.000039427694,"threshold_uncertainty_score":0.4521648},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Algebra over a field; Computer science; Universal algebra; Computational science; Mathematics; Pure mathematics","score_opus":0.00669435618951095,"score_gpt":0.22730055590575188,"score_spread":0.22060619971624093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1120761376","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002967177,0.000039425762,0.692736,0.000089167945,0.00007897183,0.00017778816,0.0000010939714,0.0000885315,0.30675933],"genre_scores_gemma":[0.05728201,0.00018000705,0.6427557,0.0027356956,0.0016104914,0.00006789688,0.000033265318,0.000074983676,0.29525998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854624,0.000018194314,0.00016032442,0.00072313065,0.0002590023,0.00029308037],"domain_scores_gemma":[0.99900824,0.00014432007,0.000055689008,0.0005771519,0.00008104864,0.00013353716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022898747,0.00018546243,0.00019597037,0.0002689701,0.00017607128,0.00013983135,0.001244791,0.00012065169,0.00006249149],"category_scores_gemma":[0.000007665507,0.00014910821,0.000029184386,0.00033800674,0.0021091485,0.0003685358,0.0009206761,0.00021299913,0.000081021324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.395596e-7,0.000010897775,0.0000090585845,0.000004724073,0.0000015488444,0.0000061842766,0.00006183723,0.000002324894,0.0000019052668,0.9878577,0.000585384,0.011457925],"study_design_scores_gemma":[0.00013839378,0.000077405195,0.00015250566,0.000025005353,0.0000034041473,0.000020001486,0.0000051149905,0.011669061,0.000023543022,0.9467167,0.040897153,0.0002716985],"about_ca_topic_score_codex":0.0000011251883,"about_ca_topic_score_gemma":0.0000044978087,"teacher_disagreement_score":0.057252336,"about_ca_system_score_codex":0.00011285712,"about_ca_system_score_gemma":0.00031021837,"threshold_uncertainty_score":0.7771246},"labels":[],"label_agreement":null},{"id":"W114247093","doi":"10.1142/9789812810908_0015","title":"ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES","year":2001,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Context (archaeology); Computer science; History","score_opus":0.025946313613565152,"score_gpt":0.25085237313481246,"score_spread":0.22490605952124731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114247093","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015362295,0.00080267637,0.012157133,0.00013395805,0.0017682987,0.00032344635,0.000039361985,0.00022094663,0.9844006],"genre_scores_gemma":[0.018994821,0.0000022585198,0.002932174,0.0003629219,0.00011908592,0.000012014297,0.000017168615,0.000038301354,0.97752124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971829,0.000039240535,0.00049806247,0.0010424544,0.0008196588,0.00041768298],"domain_scores_gemma":[0.9965445,0.00016021315,0.00042749147,0.0025433977,0.000171989,0.00015245458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003849907,0.00042179698,0.00057605625,0.00066683826,0.00024281752,0.00020939863,0.002587461,0.00015194058,0.00033058837],"category_scores_gemma":[0.000023741808,0.00036698687,0.000276584,0.0001113113,0.00050858705,0.00010326487,0.00062122545,0.00036818747,0.00018581314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000989479,0.00001564655,0.0000012883861,0.000022876002,0.000026085461,0.00007918419,0.00021601618,0.000020458128,0.00019083898,0.94696295,0.018577896,0.03387687],"study_design_scores_gemma":[0.00050649006,0.00004902049,0.0000046617447,0.0002093016,0.00001835533,0.000011521944,0.000009205617,0.00017444827,0.0013387504,0.45311043,0.54413205,0.00043574654],"about_ca_topic_score_codex":0.000005427098,"about_ca_topic_score_gemma":0.0005799345,"teacher_disagreement_score":0.5255542,"about_ca_system_score_codex":0.000066956294,"about_ca_system_score_gemma":0.00012108032,"threshold_uncertainty_score":0.9998782},"labels":[],"label_agreement":null},{"id":"W11695991","doi":"10.1007/978-3-642-21070-9_12","title":"An Algebraic Approach to Preference Relations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Preference; Algebraic structure; Class (philosophy); Duality (order theory); Algebraic number; Computer science; Algebra over a field; Theoretical computer science; Mathematics; Discrete mathematics; Pure mathematics; Artificial intelligence; Statistics","score_opus":0.04178812623367741,"score_gpt":0.24609227321308771,"score_spread":0.2043041469794103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11695991","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008624849,0.00016014851,0.9618887,0.00018142333,0.00082387356,0.00052832643,0.000003973207,0.00032177527,0.03600556],"genre_scores_gemma":[0.23192257,0.000010562766,0.7656527,0.001513578,0.0002502302,0.000025380468,0.0000074615373,0.000033122065,0.0005843953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956879,0.00003766893,0.000493037,0.0022003883,0.0008028775,0.00077812816],"domain_scores_gemma":[0.996581,0.00018839704,0.0002187585,0.002356866,0.00022988392,0.00042508286],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005516761,0.00058099563,0.00049113086,0.00091125834,0.00035060255,0.00040684972,0.005467387,0.00034506962,0.00003811949],"category_scores_gemma":[0.0000706519,0.0005169899,0.00010365382,0.0009287383,0.00046534368,0.0012669727,0.0012084944,0.0008700781,0.00023387298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038038588,0.000075674776,0.000029284507,0.000012751799,0.0000058414107,0.000017213528,0.0017725549,0.031031273,0.000083108665,0.54172,0.000019079647,0.42522943],"study_design_scores_gemma":[0.00014601872,0.00034298695,0.0005745345,0.00012321783,0.000006981885,0.00005737653,2.0076429e-7,0.13757195,0.00041144365,0.85855323,0.0012938763,0.00091821107],"about_ca_topic_score_codex":0.0000140926095,"about_ca_topic_score_gemma":0.000028917988,"teacher_disagreement_score":0.42431122,"about_ca_system_score_codex":0.00021243248,"about_ca_system_score_gemma":0.00045222862,"threshold_uncertainty_score":0.9999135},"labels":[],"label_agreement":null},{"id":"W124187445","doi":"","title":"Cahit-Equitability of Coronas.","year":2004,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.014257956042743361,"score_gpt":0.25799665734737043,"score_spread":0.24373870130462708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124187445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98616755,0.0011630951,0.0045983996,0.0007057539,0.0038404255,0.00030785587,0.000011050288,0.00012605543,0.003079806],"genre_scores_gemma":[0.9970782,0.00007624949,0.0025997062,0.0001401558,0.000014154882,0.000008990656,0.0000029246692,0.000017257058,0.000062395615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776167,0.00010074274,0.0005241979,0.00061340275,0.000469432,0.0005305782],"domain_scores_gemma":[0.99806094,0.0001604644,0.0002804041,0.0011242168,0.00018838052,0.00018561684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037109316,0.00028763694,0.00046711674,0.00007931936,0.0001581811,0.00007990604,0.0011516422,0.0001709863,0.000054988555],"category_scores_gemma":[0.00013629935,0.0002819224,0.00017559061,0.00051784335,0.0003565773,0.0005104849,0.00052561716,0.00029227728,0.00017035523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001358619,0.0004698211,0.004576141,0.00008516425,0.000025428038,0.000024436786,0.00059086026,0.0004409249,0.00061719894,0.9880163,0.00004608001,0.005094048],"study_design_scores_gemma":[0.0014567953,0.00049794855,0.03461776,0.00008561634,0.000020247768,0.000011167348,0.000044981596,0.00019250883,0.0059350296,0.9560164,0.0008077712,0.00031378056],"about_ca_topic_score_codex":0.0000980646,"about_ca_topic_score_gemma":0.0000048501865,"teacher_disagreement_score":0.031999916,"about_ca_system_score_codex":0.00018899076,"about_ca_system_score_gemma":0.00030599555,"threshold_uncertainty_score":0.9999633},"labels":[],"label_agreement":null},{"id":"W12813696","doi":"10.25596/jalc-2002-083","title":"Maximal and Minimal Partial Clones","year":2002,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Cardinality (data modeling); Intersection (aeronautics); Combinatorics; Mathematics; Set (abstract data type); Partial function; clone (Java method); Element (criminal law); Discrete mathematics; Computer science; Biology; Genetics; Gene","score_opus":0.021406086907278337,"score_gpt":0.20084994107979312,"score_spread":0.1794438541725148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12813696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7031816,0.0028223975,0.2108268,0.009426309,0.001713494,0.0006622043,0.000029166578,0.0013526411,0.0699854],"genre_scores_gemma":[0.97788006,0.00020993278,0.017241811,0.0004580977,0.00021593715,0.0000032187866,0.0000031974648,0.00001531428,0.0039724144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983142,0.000059775644,0.00018286826,0.0006117138,0.00030144438,0.0005300038],"domain_scores_gemma":[0.9990583,0.00006935123,0.00008950248,0.0004891623,0.000057365123,0.00023633447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009305716,0.0002454194,0.00025424568,0.00014441209,0.00034097806,0.0001179944,0.0007851856,0.00011963762,0.0002069868],"category_scores_gemma":[0.000023692095,0.00024002531,0.00009161516,0.00036928724,0.00016047592,0.0019800323,0.000601933,0.00020310112,0.00039126904],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016478555,0.0007178052,0.005457971,0.000119053926,0.00024425058,0.0022302857,0.01145523,0.00030889196,0.0037281571,0.60122603,0.022540616,0.3518069],"study_design_scores_gemma":[0.010027735,0.0024880453,0.04386573,0.00014225894,0.00037847742,0.00093465927,0.005425989,0.158062,0.0043824054,0.027964912,0.7418551,0.004472685],"about_ca_topic_score_codex":0.000020581454,"about_ca_topic_score_gemma":0.000007922168,"teacher_disagreement_score":0.7193145,"about_ca_system_score_codex":0.00006606345,"about_ca_system_score_gemma":0.00002758302,"threshold_uncertainty_score":0.9787949},"labels":[],"label_agreement":null},{"id":"W136012852","doi":"","title":"The Simplest D4-octics","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.01009982259076918,"score_gpt":0.2575961244464726,"score_spread":0.24749630185570343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136012852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028649254,0.00005790118,0.93889195,0.001067591,0.00021125947,0.00003109959,4.261625e-8,0.00011505758,0.056760166],"genre_scores_gemma":[0.94962645,0.00001576093,0.04566649,0.0012346173,0.000075152886,8.6783825e-7,1.226363e-7,0.000002522705,0.0033780404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995047,0.0000069460516,0.00008288366,0.00010315833,0.00009961719,0.0002027101],"domain_scores_gemma":[0.99936634,0.00024756897,0.00001991105,0.00029918394,0.000023556162,0.000043456504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024415992,0.000042153024,0.000031670435,0.000011962434,0.00018850475,0.000065782304,0.00048720196,0.000015754036,0.000007217023],"category_scores_gemma":[0.000033750868,0.000022754482,0.000019314133,0.00015615943,0.000029616462,0.00012652446,0.00011239745,0.000053950105,0.000103162914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.0198685e-7,0.0000047032945,0.00015341431,2.371268e-7,0.0000010141911,0.0000050945987,0.00003510129,0.000009634149,0.000052366504,0.87810004,0.00045285767,0.12118503],"study_design_scores_gemma":[0.00015137278,0.00006309427,0.009981451,0.0000014043964,0.0000014198071,0.000030401285,0.00014135316,0.005477259,0.0039442806,0.3210714,0.65896344,0.00017313307],"about_ca_topic_score_codex":0.0000026423888,"about_ca_topic_score_gemma":0.00004182681,"teacher_disagreement_score":0.9467615,"about_ca_system_score_codex":0.000009235252,"about_ca_system_score_gemma":0.0000106575235,"threshold_uncertainty_score":0.14498451},"labels":[],"label_agreement":null},{"id":"W136375977","doi":"10.1007/978-3-0348-0018-1_6","title":"Varieties of Lattices","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Distributive property; Congruence (geometry); Mathematics; Variety (cybernetics); Simplicity; Congruence relation; Universal algebra; Lattice (music); Pure mathematics; Distributive lattice; Algebra over a field; Congruence lattice problem; Physics; Geometry; Statistics","score_opus":0.03631667698331478,"score_gpt":0.2217723118105456,"score_spread":0.18545563482723082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136375977","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.316696e-7,0.00036166338,0.23673059,0.000029146377,0.00014797981,0.000036382684,8.0578366e-7,0.00007154595,0.7626209],"genre_scores_gemma":[0.004368221,0.00013045043,0.03676281,0.00016537173,0.000041720436,0.0000011881134,0.0000010906737,0.000010293016,0.95851886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938434,0.0000033046717,0.00016353783,0.00021725158,0.00013537289,0.0000961948],"domain_scores_gemma":[0.9992805,0.000040601833,0.0001424251,0.0004477251,0.000056291246,0.000032438653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044655342,0.00013516234,0.00020081524,0.000060642084,0.000021390033,0.0000137856405,0.00065321266,0.00011869794,0.0007467078],"category_scores_gemma":[0.0000035561925,0.000102389655,0.00007377716,0.000013592462,0.0000744451,0.00015846279,0.00023324508,0.000105371815,0.00017007688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.0589505e-7,0.0000034845043,0.0000014227014,0.000013391533,0.000012183152,0.000003653786,0.00008809691,5.6622605e-7,0.0000030161984,0.98711294,0.00029843446,0.012462123],"study_design_scores_gemma":[0.000028316696,0.00005136002,0.0000120883815,0.000014982106,0.0000059071103,0.0000027554618,0.0000010687145,0.000025697143,0.00014567822,0.8891817,0.11040609,0.0001244],"about_ca_topic_score_codex":0.0000050205567,"about_ca_topic_score_gemma":0.00000359,"teacher_disagreement_score":0.19996779,"about_ca_system_score_codex":0.0000048105353,"about_ca_system_score_gemma":0.000027852233,"threshold_uncertainty_score":0.8175926},"labels":[],"label_agreement":null},{"id":"W141084851","doi":"10.1007/bfb0033564","title":"Subdirect sum decomposition of finite dimensional pseudomodules","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Decomposition; Mathematics; Pure mathematics; Chemistry","score_opus":0.00955477486420151,"score_gpt":0.2395372365058419,"score_spread":0.2299824616416404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141084851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062815927,0.0015703496,0.9621531,0.0015847287,0.00029626858,0.0002802295,0.000026813983,0.000059599864,0.03340075],"genre_scores_gemma":[0.9802556,0.00022451257,0.017155606,0.0021252334,0.00008174765,0.0000068391623,0.0000165908,0.000004026037,0.00012985666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986764,0.00002122305,0.00048356858,0.00022615722,0.0004042952,0.00018833288],"domain_scores_gemma":[0.9986561,0.0006427752,0.00036923029,0.00016917133,0.00011497058,0.000047746697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037596707,0.00020312767,0.0003141402,0.00039668404,0.00014250298,0.000117191565,0.00038854868,0.00016340488,0.00002805573],"category_scores_gemma":[0.00011355878,0.00015218185,0.00006705681,0.00013585277,0.00026234452,0.002248292,0.00008173287,0.00019184116,0.000014012356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034170025,0.000013782028,0.00013950144,0.00004280511,0.000016840666,0.0000020164773,0.000499523,0.053100117,0.00012418462,0.45150414,0.000022430042,0.4945005],"study_design_scores_gemma":[0.001557607,0.0004535799,0.0014783276,0.0003236908,0.000022134578,0.000049844104,0.000004372518,0.54522026,0.00072140247,0.4295581,0.01988961,0.00072107685],"about_ca_topic_score_codex":0.000009157291,"about_ca_topic_score_gemma":0.000026234484,"teacher_disagreement_score":0.97962743,"about_ca_system_score_codex":0.000025581141,"about_ca_system_score_gemma":0.00008400886,"threshold_uncertainty_score":0.62057954},"labels":[],"label_agreement":null},{"id":"W1493045621","doi":"10.4153/cmb-2014-061-8","title":"On Finite Groups with Dismantlable Subgroup Lattices","year":2014,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.012717080985450482,"score_gpt":0.2130368889691304,"score_spread":0.2003198079836799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493045621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017743692,0.00012628558,0.89038324,0.013503564,0.00037240164,0.0007060716,0.000030032801,0.00033348138,0.07680125],"genre_scores_gemma":[0.93601584,0.000010704656,0.053419963,0.0055013183,0.00020479318,0.0001513191,0.000031859323,0.00006776271,0.0045964126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749416,0.0001024173,0.0003536993,0.0008776286,0.00039133572,0.00078076986],"domain_scores_gemma":[0.99667335,0.0008048012,0.00017612182,0.0014399808,0.00007138322,0.0008343719],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003448178,0.00045525492,0.0005590212,0.00021814006,0.000192088,0.0003876265,0.0016593632,0.0002906152,0.0019647125],"category_scores_gemma":[0.00030315653,0.00034665124,0.00011457561,0.0001651462,0.00014135074,0.000053221014,0.00038600666,0.00078626623,0.010268142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059391205,0.000048633956,0.00001128484,0.00027535303,0.00002941536,0.00018436437,0.00020676426,0.0017029215,7.350391e-7,0.9885567,0.008010915,0.0009670082],"study_design_scores_gemma":[0.00029825105,0.00021653515,0.000073724914,0.0007058498,0.000030193076,0.000030391888,0.00001956829,0.026591646,0.000021700664,0.9182938,0.052890655,0.0008277205],"about_ca_topic_score_codex":0.0003596777,"about_ca_topic_score_gemma":0.0009780197,"teacher_disagreement_score":0.9182722,"about_ca_system_score_codex":0.00016645093,"about_ca_system_score_gemma":0.0002618478,"threshold_uncertainty_score":0.99989855},"labels":[],"label_agreement":null},{"id":"W1500479573","doi":"10.5539/jmr.v7n2p142","title":"Algebraic Properties of the Category of Q-P Quantale Modules","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algebraic number; Pure mathematics; Algebra over a field; Discrete mathematics; Mathematical analysis","score_opus":0.24598621943764892,"score_gpt":0.3670921156803278,"score_spread":0.12110589624267887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500479573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9504542,0.0014431864,0.045979504,0.00069711485,0.00015522016,0.00014090103,5.555256e-7,0.0000056971817,0.0011236283],"genre_scores_gemma":[0.9806032,0.00004103602,0.019115353,0.000007816279,0.000033727716,0.0000014452635,1.8469104e-8,0.000005943579,0.00019142122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977669,0.00018957006,0.0005077033,0.00007495083,0.0012711971,0.00018965526],"domain_scores_gemma":[0.9978769,0.0001872396,0.00039367753,0.0004396508,0.0010163663,0.00008617753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026751978,0.000066687244,0.00024807715,0.00017484168,0.000052493324,0.00002923682,0.0015189426,0.0000378112,0.0000038320673],"category_scores_gemma":[0.0008170888,0.000034026416,0.00009856741,0.00040875963,0.00026638652,0.00027382257,0.00039122038,0.00030549752,0.000006026174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000643642,0.0017281369,0.00075025734,0.0010645057,0.00014589255,0.0000364154,0.029412651,0.0018640938,0.19615945,0.7587244,0.00352885,0.0065209805],"study_design_scores_gemma":[0.0006375365,0.00065198157,0.00049759354,0.00053300353,0.00001046064,0.00024702447,0.0049133096,0.0169662,0.353793,0.6213453,0.0002831622,0.00012143575],"about_ca_topic_score_codex":0.0000074729273,"about_ca_topic_score_gemma":0.000002641391,"teacher_disagreement_score":0.15763353,"about_ca_system_score_codex":0.000039288276,"about_ca_system_score_gemma":0.0003630717,"threshold_uncertainty_score":0.28225985},"labels":[],"label_agreement":null},{"id":"W1502069907","doi":"10.1090/s0002-9947-00-02628-3","title":"On the endomorphism monoids of (uniquely) complemented lattices","year":2000,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Endomorphism; Monoid; Mathematics; Lattice (music); Combinatorics; Free monoid; Pure mathematics; Syntactic monoid; Discrete mathematics; Physics","score_opus":0.019299704627861604,"score_gpt":0.2569099510438707,"score_spread":0.2376102464160091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502069907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22228935,0.000011024138,0.77150184,0.0038254403,0.000019311015,0.00021315568,0.000009009689,0.000050465187,0.0020803788],"genre_scores_gemma":[0.9519968,0.000026650167,0.047096573,0.00060862605,0.0000038150843,0.000018358724,1.8640432e-7,0.0000061497417,0.0002428646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990739,0.00009616757,0.00025602285,0.00014315343,0.00026704368,0.00016371769],"domain_scores_gemma":[0.99843895,0.00069539115,0.0001739229,0.0006222285,0.000033954213,0.00003556951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019390062,0.00010547286,0.00023916038,0.000011399975,0.00018025181,0.00001219501,0.00090155104,0.000017564991,0.00058937754],"category_scores_gemma":[0.000014312329,0.000055951255,0.0003243835,0.0005145084,0.00065969577,0.000086989596,0.00001944281,0.00016556229,0.000017530732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026645379,0.0008004206,0.00002013655,0.00006955252,0.0002252685,3.8884826e-7,0.0038508829,0.0026646613,0.0037528768,0.9463699,0.00059744244,0.041621845],"study_design_scores_gemma":[0.00053403014,0.00049573526,0.0011005285,0.00009840706,0.00009554271,0.000011852688,0.0011381025,0.101839714,0.01523817,0.8785748,0.00059723353,0.00027590911],"about_ca_topic_score_codex":0.000022145758,"about_ca_topic_score_gemma":0.0000010057742,"teacher_disagreement_score":0.7297074,"about_ca_system_score_codex":0.0000172085,"about_ca_system_score_gemma":0.000018390536,"threshold_uncertainty_score":0.64532703},"labels":[],"label_agreement":null},{"id":"W150214721","doi":"","title":"On the Co-circuits of a Splitting Matroid.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Matroid partitioning; Graphic matroid; Discrete mathematics","score_opus":0.02112876898355665,"score_gpt":0.2430824634807771,"score_spread":0.22195369449722047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150214721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9855714,0.000073816125,0.0033726299,0.00039887996,0.00056653697,0.00011874673,6.830519e-7,0.000089307454,0.009808024],"genre_scores_gemma":[0.9990353,0.000009028823,0.00046854655,0.00034628637,0.0000053297094,0.0000073481224,4.218882e-7,0.000006038562,0.00012171328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991245,0.00005915749,0.00016857545,0.00020306365,0.00024376147,0.00020089647],"domain_scores_gemma":[0.9989167,0.0003629554,0.00010424482,0.0005265541,0.00004684662,0.00004272289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018326333,0.00009617786,0.00013224724,0.000037713482,0.0001910422,0.000015658237,0.0007218608,0.00003331455,0.00001377522],"category_scores_gemma":[0.00010620933,0.00006640397,0.000057987385,0.0002735287,0.000078979516,0.00014046731,0.00009167739,0.00013539713,0.00008655466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011803207,0.00004689253,0.00060872955,0.0000030264796,0.000005282319,0.0000141647315,0.00036011895,0.00002059558,0.00046212043,0.99669945,0.0008308334,0.00094761397],"study_design_scores_gemma":[0.0003171286,0.00013966464,0.0040511973,0.000017359836,0.0000017476142,0.000026678928,0.000022418408,0.00079729874,0.006833887,0.9872223,0.00045705924,0.00011326552],"about_ca_topic_score_codex":0.0000035528712,"about_ca_topic_score_gemma":1.2922987e-7,"teacher_disagreement_score":0.013463912,"about_ca_system_score_codex":0.000019847335,"about_ca_system_score_gemma":0.000035115103,"threshold_uncertainty_score":0.27078754},"labels":[],"label_agreement":null},{"id":"W1510655993","doi":"10.2178/bsl/1182353937","title":"Itay Neeman and Jindřich Zapletal. <i>Proper forcings and absoluteness in L(ℝ)</i>. <b>Commentationes mathematicae Universitatis Carolinae</b>, vol. 39 (1998), pp. 281–301. - Itay Neeman and Jindřich Zapletal. <i>Proper forcing and L(ℝ)</i>. The journal of symbolic logic, vol. 66 (2001), pp. 801–810.","year":2002,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Absoluteness; Mathematics; Forcing (mathematics); Philosophy; Epistemology; Mathematical analysis","score_opus":0.014844312322958178,"score_gpt":0.2116670115056542,"score_spread":0.19682269918269601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510655993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93103206,0.036968265,0.014450954,0.012227385,0.0005877366,0.0019932217,0.000025581916,0.00013552766,0.0025792345],"genre_scores_gemma":[0.9778683,0.009183751,0.010016273,0.0020843593,0.00017602362,0.000038494458,0.000005083693,0.000060965627,0.0005667592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566185,0.00048375438,0.0013122135,0.0008854227,0.00068763713,0.0009691366],"domain_scores_gemma":[0.9966175,0.0008954029,0.0008999917,0.00068852666,0.0005315185,0.00036705972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017328872,0.0007345621,0.0014338823,0.00038106923,0.0005803525,0.0002794356,0.001001748,0.0002833938,0.00012568585],"category_scores_gemma":[0.00045863516,0.00050642266,0.0001627386,0.00067433814,0.001223167,0.00065675616,0.00086425577,0.00063167757,0.000022514558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026630946,0.004490318,0.05605289,0.009306139,0.0024778373,0.0016329748,0.17673045,0.003031046,0.01576109,0.5186036,0.08731608,0.12193449],"study_design_scores_gemma":[0.09361608,0.011321,0.08977579,0.0069798636,0.0035677808,0.014741723,0.06736541,0.092183016,0.004924808,0.5089573,0.09426936,0.012297864],"about_ca_topic_score_codex":0.0003760258,"about_ca_topic_score_gemma":0.000049766306,"teacher_disagreement_score":0.10963662,"about_ca_system_score_codex":0.00008224681,"about_ca_system_score_gemma":0.000053865275,"threshold_uncertainty_score":0.99973875},"labels":[],"label_agreement":null},{"id":"W1510672616","doi":"10.1023/a:1006279127474","title":"A Hyperbase for Binary Lattice Hyperidentities","year":2000,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Arity; Variety (cybernetics); Identity (music); Binary relation; Combinatorics; Binary number; Discrete mathematics; Mathematics; Set (abstract data type); Computer science; Physics; Arithmetic; Programming language","score_opus":0.01094980265880392,"score_gpt":0.26148411851399683,"score_spread":0.2505343158551929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510672616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94990367,0.0013679094,0.045782495,0.00063891086,0.00047869328,0.000096691045,0.0000017896698,0.0004016152,0.0013282432],"genre_scores_gemma":[0.76419175,0.00013200754,0.23440456,0.00029063853,0.00020222642,0.000003789327,7.75366e-7,0.00001456645,0.0007596867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990658,0.000041123625,0.00032847314,0.00012729598,0.00020493887,0.00023235772],"domain_scores_gemma":[0.99921006,0.00016177147,0.00021908988,0.00017072137,0.0001434562,0.000094893185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030865482,0.000107098545,0.0002111736,0.000110308,0.00015735181,0.00012879654,0.00047690346,0.000047000827,0.000057979625],"category_scores_gemma":[0.00011640376,0.00008507427,0.00013000869,0.00024349091,0.000028953682,0.00096485915,0.00003328784,0.00013311916,0.000021151887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009533056,0.0013864646,0.0023497622,0.0004558018,0.00091513677,0.0044939485,0.0093901185,0.09356059,0.045651335,0.14007998,0.04543446,0.6553291],"study_design_scores_gemma":[0.0026111654,0.0012453493,0.0067983237,0.00065041106,0.00008845578,0.0040842784,0.0003462834,0.93591136,0.0046117804,0.010451918,0.032638274,0.00056241796],"about_ca_topic_score_codex":0.0000022306701,"about_ca_topic_score_gemma":2.8661455e-7,"teacher_disagreement_score":0.8423508,"about_ca_system_score_codex":0.0000370719,"about_ca_system_score_gemma":0.00008209394,"threshold_uncertainty_score":0.3469228},"labels":[],"label_agreement":null},{"id":"W1512582237","doi":"10.1090/s0002-9939-05-08306-1","title":"Quarter-stratifiability in ordered spaces","year":2005,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Mathematics; Geography; Archaeology","score_opus":0.00920487906332469,"score_gpt":0.24530945196928755,"score_spread":0.23610457290596287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512582237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96623206,0.00001810003,0.021689108,0.007843445,0.000017103994,0.00021431744,7.08587e-7,0.000081862534,0.0039033163],"genre_scores_gemma":[0.83042437,0.0000046691002,0.16915438,0.00033228841,0.000023669201,0.000014282528,3.6720987e-8,0.000004536725,0.00004175496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888074,0.000008863687,0.00030282073,0.0002686173,0.00027477456,0.00026419986],"domain_scores_gemma":[0.99927497,0.00012323372,0.0002680446,0.00020563956,0.0000727645,0.000055365323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035332097,0.00012638271,0.00029271154,0.000014114872,0.00006364325,0.000057700803,0.00093206594,0.000028336428,0.000010995844],"category_scores_gemma":[0.00014329539,0.0000803697,0.00018066348,0.0006684336,0.00041184685,0.00035150247,0.00023284704,0.00017260715,0.000010548019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000156269,0.0009817136,0.01645714,0.00033490194,0.000046871326,2.474434e-7,0.013090662,0.00008292725,0.022798369,0.91988176,0.0024895666,0.023820218],"study_design_scores_gemma":[0.0004470294,0.00019433018,0.021741455,0.00009708741,0.000014065527,0.000012888583,0.0041399417,0.06727305,0.013370283,0.89174867,0.0005544745,0.0004067393],"about_ca_topic_score_codex":0.000005985714,"about_ca_topic_score_gemma":0.0000012349606,"teacher_disagreement_score":0.14746527,"about_ca_system_score_codex":0.000052655236,"about_ca_system_score_gemma":0.000022008813,"threshold_uncertainty_score":0.3277381},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computation; Boolean function; Theoretical computer science; Algorithm","score_opus":0.01847183979169236,"score_gpt":0.24875104320273997,"score_spread":0.2302792034110476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520950860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006346917,0.00026899448,0.8217499,0.0002519041,0.00056404184,0.00025112697,0.000003654663,0.00018153898,0.17666537],"genre_scores_gemma":[0.48054552,0.00015098255,0.472649,0.001961361,0.000678231,0.000041362095,0.00002003597,0.00008090731,0.043872587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996669,0.000075985634,0.00045297926,0.0013749193,0.00077592523,0.00065119425],"domain_scores_gemma":[0.9983494,0.00031564684,0.00014350614,0.0007600967,0.0001456557,0.00028566603],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007220143,0.00039194437,0.00042306609,0.00056421454,0.00037475993,0.0004738712,0.0018371647,0.00020023313,0.00003345945],"category_scores_gemma":[0.000031814136,0.00035016352,0.00007340513,0.0007224746,0.0029288563,0.0011080931,0.0014535408,0.00064020103,0.00011058991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016891125,0.000032971493,0.0000012624342,0.000013619865,0.0000025342347,0.000028422226,0.00022543786,0.0041875322,0.0000018212559,0.866866,0.0006791281,0.1279596],"study_design_scores_gemma":[0.00011973611,0.000086337895,0.0000218834,0.000059882525,0.0000031306947,0.000049894126,0.0000011406295,0.48079604,0.0000024090903,0.51818967,0.0004345684,0.00023534658],"about_ca_topic_score_codex":7.703746e-7,"about_ca_topic_score_gemma":0.0000011882452,"teacher_disagreement_score":0.48048207,"about_ca_system_score_codex":0.00022100979,"about_ca_system_score_gemma":0.000204561,"threshold_uncertainty_score":0.99989504},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011268390822882465,"score_gpt":0.22560469016991608,"score_spread":0.2143362993470336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522943816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94764674,0.00006921063,0.048870757,0.0020688542,0.000016134652,0.0002660797,0.0000012133664,0.00006742943,0.0009935868],"genre_scores_gemma":[0.9244661,0.00004244971,0.074537866,0.0008745618,0.000014400359,0.000024239684,1.1313691e-7,0.0000086015825,0.00003171124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854094,0.00001433739,0.00036322424,0.0003763918,0.00034181878,0.00036329092],"domain_scores_gemma":[0.9992256,0.00016100006,0.00027019958,0.0002005453,0.000049440314,0.00009322068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004162253,0.0001674241,0.0003804453,0.00002553954,0.0000919547,0.000051799052,0.00079378666,0.000038555478,0.0000359469],"category_scores_gemma":[0.000120682336,0.00011357039,0.00013990921,0.0008573596,0.0009275275,0.00039380364,0.0006329567,0.0002476645,0.0000057293355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003481449,0.0024024777,0.0807212,0.0013224678,0.00019201128,0.0000024842445,0.029830584,0.000031417883,0.008066321,0.7763111,0.0039464096,0.097138725],"study_design_scores_gemma":[0.0007208528,0.00034270852,0.022226695,0.00010418154,0.000024492356,0.000025976824,0.005528232,0.08648496,0.0020069103,0.88193595,0.00019097453,0.00040808794],"about_ca_topic_score_codex":0.000015067766,"about_ca_topic_score_gemma":8.1600956e-7,"teacher_disagreement_score":0.10562484,"about_ca_system_score_codex":0.00007658392,"about_ca_system_score_gemma":0.000007802208,"threshold_uncertainty_score":0.4631266},"labels":[],"label_agreement":null},{"id":"W1523412023","doi":"10.1007/978-3-642-04639-1_16","title":"Cardinal Addition in Distributive Allegories","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Distributive property; Cardinality (data modeling); Computer science; Allegory; Relation (database); Function (biology); Algorithm; Discrete mathematics; Mathematics; Data mining; Pure mathematics; Art history","score_opus":0.011664409496717314,"score_gpt":0.23461490272197455,"score_spread":0.22295049322525723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523412023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005655733,0.00044687034,0.99184465,0.0006617402,0.00086373586,0.00027307446,0.000016477848,0.00012857896,0.005708314],"genre_scores_gemma":[0.5623217,0.0001460599,0.43348658,0.0023429543,0.000980474,0.000023403669,0.00006382766,0.000037177164,0.00059777836],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966984,0.00003565508,0.00043450308,0.0013911139,0.0007553879,0.0006849879],"domain_scores_gemma":[0.99831486,0.00030365284,0.00020536604,0.000888675,0.00015613051,0.0001312884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044323,0.00047564734,0.0005251804,0.00060377934,0.00018355815,0.0002926764,0.0021763705,0.00027653394,0.000021195174],"category_scores_gemma":[0.00008562365,0.000433856,0.00012059774,0.00070945936,0.0005478686,0.00085071736,0.00067798264,0.0008587404,0.000033643046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063614343,0.000024911124,0.000042048574,0.000009518752,0.000004171633,0.00025697018,0.00038285693,0.014618162,0.000020643298,0.12217499,0.000027330483,0.86243206],"study_design_scores_gemma":[0.00030210995,0.00027163827,0.001715014,0.00029466566,0.0000042768324,0.000085348875,3.2089406e-7,0.07259732,0.00034535484,0.9196105,0.0040203575,0.00075308076],"about_ca_topic_score_codex":0.000010704017,"about_ca_topic_score_gemma":0.00008976911,"teacher_disagreement_score":0.86167896,"about_ca_system_score_codex":0.0004408657,"about_ca_system_score_gemma":0.0003540723,"threshold_uncertainty_score":0.99981135},"labels":[],"label_agreement":null},{"id":"W1529894088","doi":"10.1023/a:1012495106338","title":"A Kripke Semantics for the Logic of Gelfand Quantales","year":2001,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Gödel's completeness theorem; Soundness; Completeness (order theory); Discrete mathematics; Axiom; Kripke semantics; Intermediate logic; Algebra over a field; Pure mathematics; Calculus (dental); Computer science; Description logic; Programming language","score_opus":0.048895351071703536,"score_gpt":0.298588028206924,"score_spread":0.24969267713522045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529894088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021959981,0.0024965424,0.9645724,0.0036156918,0.0003488593,0.0005041253,0.000005299824,0.00011011515,0.006386985],"genre_scores_gemma":[0.9801644,0.00053683587,0.018547058,0.00045866793,0.000071216695,0.000040261337,8.5070985e-7,0.000004468829,0.00017624692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991246,0.000028253196,0.00018864976,0.0002514903,0.00014958231,0.00025742204],"domain_scores_gemma":[0.998883,0.0004937537,0.00010749914,0.0004055217,0.00007627627,0.00003391691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019571972,0.00011868534,0.0001938141,0.000028907985,0.00022535615,0.000028430108,0.00072915974,0.000039855116,0.000011525452],"category_scores_gemma":[0.00010147199,0.000064336506,0.00009845145,0.00027347755,0.00012745068,0.000099694276,0.00021360198,0.00006966283,0.000013131102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018563984,0.00012629267,0.002019058,0.000015258071,0.00004157899,0.00001626881,0.0004502837,0.00024257903,0.00042216323,0.9839071,0.0008046273,0.01193624],"study_design_scores_gemma":[0.0018738835,0.0015793137,0.05944368,0.00003857953,0.00008899763,0.000114714414,0.0013013287,0.010650952,0.0011296297,0.8136019,0.109464705,0.0007123187],"about_ca_topic_score_codex":0.000003864252,"about_ca_topic_score_gemma":0.000015245248,"teacher_disagreement_score":0.9582044,"about_ca_system_score_codex":0.000009763323,"about_ca_system_score_gemma":0.000025371352,"threshold_uncertainty_score":0.26235667},"labels":[],"label_agreement":null},{"id":"W1530821313","doi":"10.3968/j.pam.1925252820120401.1500","title":"The Convergence of Filters on Quantales and Its Hausdorffness","year":2012,"lang":"en","type":"article","venue":"Progress in applied mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hausdorff space; Ideal (ethics); Property (philosophy); Completeness (order theory); Filter (signal processing); Pure mathematics; Hausdorff distance; Convergence (economics); Algebra over a field; Computer science; Mathematical analysis; Computer vision; Epistemology","score_opus":0.02709540517168492,"score_gpt":0.2815276521150952,"score_spread":0.25443224694341027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530821313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8188599,0.011066874,0.1617984,0.0005593148,0.00066106307,0.0014591494,0.000003924467,0.00021006266,0.005381363],"genre_scores_gemma":[0.9594085,0.00009763885,0.040372554,0.000025001182,0.000013664118,0.0000642545,2.3435587e-7,0.0000058677524,0.000012284879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924237,0.000011466713,0.00020950199,0.00012454655,0.00017311156,0.00023900474],"domain_scores_gemma":[0.9992549,0.00028792428,0.00012765422,0.00026940208,0.000014349801,0.00004580778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030661232,0.000100259436,0.0001410321,0.00003284343,0.00007012607,0.000025937292,0.0004174695,0.00003240189,0.0000017840432],"category_scores_gemma":[0.000022914797,0.00006399731,0.000019571515,0.00015248849,0.0001233874,0.00009531303,0.00016474882,0.0000799715,0.000011557244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004181928,0.00010281609,0.00051570474,0.00008957068,0.0000049150844,6.026102e-7,0.001282935,0.000005677486,0.00013177063,0.97318757,0.000007661852,0.024666615],"study_design_scores_gemma":[0.0020679387,0.00031603556,0.00938151,0.0005795031,0.000040337945,0.00006367787,0.002940817,0.11868554,0.17339657,0.68905634,0.0020984595,0.0013732557],"about_ca_topic_score_codex":7.533524e-8,"about_ca_topic_score_gemma":2.6618787e-7,"teacher_disagreement_score":0.2841312,"about_ca_system_score_codex":0.000009396495,"about_ca_system_score_gemma":0.000007455471,"threshold_uncertainty_score":0.26097345},"labels":[],"label_agreement":null},{"id":"W1535252952","doi":"10.1007/978-3-540-78913-0_7","title":"On the Structure of Demonic Refinement Algebras with Enabledness and Termination","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Divergence (linguistics); Algebra over a field; Kleene algebra; Operator (biology); Set (abstract data type); Domain (mathematical analysis); Computer science; Mathematics; Pure mathematics; Discrete mathematics; Programming language; Mathematical analysis","score_opus":0.010897801008861006,"score_gpt":0.2161452656313804,"score_spread":0.2052474646225194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535252952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096657155,0.0003258249,0.987884,0.00075387233,0.0002959601,0.00035271395,0.000003390359,0.00004444372,0.00067408395],"genre_scores_gemma":[0.92072105,0.00007262969,0.077940024,0.0010644882,0.00007843234,0.0000029065625,0.0000019101876,0.000016013943,0.00010255343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769866,0.000028776687,0.00029534855,0.00089219736,0.0007438357,0.0003411875],"domain_scores_gemma":[0.9980637,0.0004897832,0.0002974235,0.0009267095,0.00015316892,0.000069236215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021190023,0.0003658251,0.0003453716,0.000335584,0.00025540034,0.000113058086,0.0015562235,0.00015165146,0.000013093129],"category_scores_gemma":[0.00004873791,0.00021253749,0.000041214214,0.00040614294,0.00082709384,0.00027644495,0.00051738555,0.0004974769,0.0000019968707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023400988,0.00003918509,0.00007625664,0.000068992216,0.000022214215,0.00010821199,0.0017671713,0.02478831,0.0011164937,0.31669462,0.000031279822,0.65526384],"study_design_scores_gemma":[0.00068218895,0.001260619,0.0012359195,0.0008680213,0.000018248065,0.00039105644,8.792583e-7,0.111555,0.019709125,0.86252785,0.0007138442,0.0010372291],"about_ca_topic_score_codex":0.0000043831924,"about_ca_topic_score_gemma":0.00003774875,"teacher_disagreement_score":0.9110553,"about_ca_system_score_codex":0.00010223096,"about_ca_system_score_gemma":0.00024129722,"threshold_uncertainty_score":0.86670274},"labels":[],"label_agreement":null},{"id":"W1542569653","doi":"10.1090/s0002-9939-02-06460-2","title":"A proof of a partition theorem for [ℚ]ⁿ","year":2002,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Partition (number theory); Algorithm; Class (philosophy); Computer science; Annotation; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.01997122170346638,"score_gpt":0.2475283934426009,"score_spread":0.22755717173913453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542569653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32119656,0.000059597147,0.66820055,0.0035852897,0.00003540684,0.0008093772,0.000004962169,0.00009924379,0.0060090045],"genre_scores_gemma":[0.83649766,0.0000056872946,0.16313039,0.00020613709,0.000017852235,0.000047950605,4.676295e-8,0.000005896396,0.00008839215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920535,0.000003779726,0.00023668988,0.00016378981,0.00021111032,0.00017927476],"domain_scores_gemma":[0.99914587,0.00013325282,0.0004016295,0.00013890777,0.00014388225,0.000036490874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021164874,0.00008811724,0.00024880804,0.000009636439,0.00006407921,0.000016083859,0.00062661007,0.000020383382,0.00000985149],"category_scores_gemma":[0.0001900476,0.00005336709,0.0002755547,0.00038338653,0.00039587216,0.00015983198,0.00015566872,0.00006340149,0.0000016978074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005232791,0.00023648242,0.00013022982,0.0003018506,0.00003231107,1.6145101e-8,0.002838109,0.0000066285106,0.008959085,0.9774154,0.0016852971,0.008389362],"study_design_scores_gemma":[0.00016669066,0.00019686572,0.00013123949,0.000060231872,0.00001862866,0.000004069988,0.00038445386,0.06250426,0.04437648,0.8919046,0.00015406893,0.00009841338],"about_ca_topic_score_codex":4.3958934e-7,"about_ca_topic_score_gemma":1.6397554e-8,"teacher_disagreement_score":0.5153011,"about_ca_system_score_codex":0.000015502614,"about_ca_system_score_gemma":0.0000051338416,"threshold_uncertainty_score":0.21762468},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Planar; Combinatorics; Mathematics; Computer science; Computer graphics (images)","score_opus":0.011333034638715309,"score_gpt":0.20507765911544085,"score_spread":0.19374462447672552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154866314","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006739464,0.001041534,0.6279401,0.00031074692,0.00034541788,0.00017188977,0.000011568009,0.0002764413,0.36983487],"genre_scores_gemma":[0.03988808,0.0003772967,0.083975814,0.0036848302,0.00067404355,0.000004473667,0.000053747975,0.00007293884,0.8712688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988502,0.00000949341,0.00016929343,0.0005569082,0.00020554788,0.0002085056],"domain_scores_gemma":[0.9990362,0.000078788435,0.000114395545,0.000615987,0.000032012274,0.00012264877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052000465,0.00029598924,0.00030625684,0.00006614851,0.00007901937,0.00010912774,0.00057965197,0.00027468844,0.0001382305],"category_scores_gemma":[0.0000073935653,0.00022030638,0.00005643394,0.00001979173,0.000069895104,0.00013716663,0.00018261647,0.00028057475,0.000061629566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.304076e-7,9.593015e-7,0.0000110577585,0.000021514237,0.00001619478,0.0000187828,0.00003833904,0.0000056610966,0.000011067176,0.962563,0.0005629354,0.036749903],"study_design_scores_gemma":[0.00010412997,0.0000549166,0.000036202982,0.000037185757,0.000012176532,0.000034278324,0.000001097473,0.0009109339,0.000025470546,0.7428368,0.25560415,0.00034266812],"about_ca_topic_score_codex":0.0000026378755,"about_ca_topic_score_gemma":0.00001962878,"teacher_disagreement_score":0.5439643,"about_ca_system_score_codex":0.000013694347,"about_ca_system_score_gemma":0.000016925393,"threshold_uncertainty_score":0.8983834},"labels":[],"label_agreement":null},{"id":"W1560329072","doi":"10.1017/cbo9780511615559.002","title":"Basic Logic","year":2003,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science","score_opus":0.025749487127089837,"score_gpt":0.19639890914145153,"score_spread":0.1706494220143617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560329072","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048832712,0.00022089765,0.11298686,0.00004318641,0.00038756756,0.0002288435,0.00002543489,0.0002918011,0.8858105],"genre_scores_gemma":[0.00017964904,0.00008887812,0.003283409,0.000666042,0.00006833909,4.6589656e-7,0.0000095042915,0.000027034816,0.9956767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983517,0.000042950385,0.0001659124,0.00078625855,0.00027745808,0.00037575144],"domain_scores_gemma":[0.99835193,0.00006299263,0.00020803644,0.0010573028,0.000117835756,0.00020190903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000076795135,0.00041296284,0.000388759,0.00017362779,0.00021723566,0.000071198825,0.001483323,0.0003388192,0.0000063081975],"category_scores_gemma":[0.000007601591,0.00045393946,0.00023556003,0.000014901769,0.00017663512,0.00021255756,0.00062461407,0.0004926759,0.00007416801],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062138897,0.0000060532825,2.8401354e-7,0.000020377633,0.000035530633,0.0005328975,0.000012971515,0.000005307394,0.000012276161,0.97506833,0.021890387,0.0024093736],"study_design_scores_gemma":[0.00032481735,0.000059375805,0.0000028457964,0.000047107944,0.000043583197,0.00004529767,0.000003888123,0.000102626356,0.00016440974,0.0017773473,0.9968896,0.00053910684],"about_ca_topic_score_codex":0.000007668538,"about_ca_topic_score_gemma":4.127232e-7,"teacher_disagreement_score":0.9749992,"about_ca_system_score_codex":0.00016619035,"about_ca_system_score_gemma":0.00008356262,"threshold_uncertainty_score":0.9997912},"labels":[],"label_agreement":null},{"id":"W1562670678","doi":"10.3233/fi-2010-264","title":"Structures with Multirelations, their Discrete Dualities and Applications","year":2010,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Duality (order theory); Class (philosophy); Dual (grammatical number); Mathematics; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.006596488771713494,"score_gpt":0.2245322349275121,"score_spread":0.2179357461557986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562670678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10537922,0.000046353438,0.88339645,0.00059593504,0.00010013613,0.00046912127,0.000022104572,0.00022376582,0.009766915],"genre_scores_gemma":[0.8979328,0.0000074436352,0.101320766,0.00045638118,0.000037604,0.00008484429,0.000014123743,0.000004466358,0.00014156483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994206,0.000008334497,0.0001750394,0.00011539961,0.00012008601,0.00016058589],"domain_scores_gemma":[0.9993623,0.00008602269,0.00008003105,0.000365757,0.00002687162,0.0000790228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006371306,0.00010923128,0.000092164824,0.0000523829,0.00024816304,0.00020482088,0.0002848064,0.000033814056,0.00003236362],"category_scores_gemma":[0.000008814778,0.00006988932,0.00001587863,0.00012296917,0.00013819797,0.0010502859,0.00013250981,0.0001577455,0.000023492476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021704234,0.00000775374,0.0013445633,0.000018940756,0.000012052278,2.6317392e-7,0.002450826,0.00003267136,0.000092772425,0.9650582,0.00005979407,0.030919991],"study_design_scores_gemma":[0.0021030323,0.00036995663,0.07181369,0.00004731788,0.000034286917,0.0002888224,0.0072476673,0.04587956,0.002981265,0.5157206,0.35220426,0.0013095686],"about_ca_topic_score_codex":0.0000042190277,"about_ca_topic_score_gemma":0.000013115304,"teacher_disagreement_score":0.7925536,"about_ca_system_score_codex":0.000007566493,"about_ca_system_score_gemma":0.000021972564,"threshold_uncertainty_score":0.28500035},"labels":[],"label_agreement":null},{"id":"W1576998182","doi":"10.3765/salt.v18i0.2490","title":"Indeterminate NPIs and Scope","year":2008,"lang":"en","type":"article","venue":"Proceedings from Semantics and Linguistic Theory","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Indeterminate; Scope (computer science); Computer science; Natural language processing; Mathematics; Programming language; Pure mathematics","score_opus":0.010452183399970894,"score_gpt":0.20645641208638887,"score_spread":0.19600422868641798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576998182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9251623,0.0024162652,0.06417514,0.0001637187,0.0003608753,0.00013674586,0.0000040615196,0.00019142269,0.0073894556],"genre_scores_gemma":[0.97950464,0.0006197916,0.019214446,0.0002544114,0.00020704385,0.0000041856147,8.664073e-7,0.000011566265,0.00018301727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990451,0.000008760106,0.00017017088,0.00040872104,0.0001314216,0.00023585676],"domain_scores_gemma":[0.99940175,0.00015901323,0.000088618704,0.00012047879,0.000104833445,0.00012531967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019823469,0.00016180686,0.00019757342,0.00006825525,0.0002700632,0.00011179424,0.00027152608,0.00006289609,0.000005772073],"category_scores_gemma":[0.00044210453,0.00013872725,0.000022449114,0.00011755953,0.00019349316,0.00014376685,0.00028505002,0.00014942068,0.0000068841546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014505121,0.00002999577,0.005052814,0.000046099856,0.000018195877,0.00007051055,0.004963633,3.576883e-7,0.0010119077,0.97678924,0.00005018812,0.011952547],"study_design_scores_gemma":[0.00040482893,0.00011015841,0.010086731,0.0000902912,0.000023679457,0.00014512989,0.00011523519,0.005777927,0.001809409,0.9783521,0.0027264033,0.00035809702],"about_ca_topic_score_codex":0.000007779084,"about_ca_topic_score_gemma":4.06908e-7,"teacher_disagreement_score":0.054342356,"about_ca_system_score_codex":0.000007112048,"about_ca_system_score_gemma":0.000017873665,"threshold_uncertainty_score":0.5657133},"labels":[],"label_agreement":null},{"id":"W1583392911","doi":"10.1090/tran/6509","title":"A finite basis theorem for difference-term varieties with a finite residual bound","year":2015,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Algorithm; Annotation; Type (biology); Artificial intelligence; Computer science; Mathematics; Biology","score_opus":0.029554324646319564,"score_gpt":0.26267140571646586,"score_spread":0.23311708107014628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583392911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02977201,0.000018139832,0.9677887,0.001687864,0.000039391598,0.00027362767,0.00001771739,0.00008710994,0.0003154174],"genre_scores_gemma":[0.7727583,0.000007409034,0.22633943,0.000317823,0.00002033745,0.000078410405,6.675581e-7,0.000012726272,0.00046488628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988366,0.00006590418,0.00024046,0.0002487498,0.00033427833,0.00027402365],"domain_scores_gemma":[0.99793625,0.0010180451,0.00019832022,0.0006195675,0.000120507575,0.000107322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023947474,0.00016964728,0.00033710682,0.000019484782,0.00022337401,0.00006277194,0.0007774768,0.00003587989,0.000013399051],"category_scores_gemma":[0.00008196202,0.00009719703,0.00027079508,0.00045855608,0.0009030422,0.00016136882,0.000040513936,0.00016425393,0.0000044178773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005411082,0.0021998896,0.0006261341,0.00065326155,0.0011421236,0.000003465503,0.06038844,0.015725724,0.0012012343,0.86097103,0.0012990583,0.05524851],"study_design_scores_gemma":[0.0010096356,0.0010149856,0.0009927897,0.000081301914,0.00016600612,0.000019481475,0.002908454,0.0849636,0.0021247705,0.90608627,0.00022865605,0.00040403166],"about_ca_topic_score_codex":0.000010508097,"about_ca_topic_score_gemma":0.000003352276,"teacher_disagreement_score":0.7429863,"about_ca_system_score_codex":0.000037471335,"about_ca_system_score_gemma":0.00011425365,"threshold_uncertainty_score":0.39635798},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013289680983207519,"score_gpt":0.2462505761073052,"score_spread":0.23296089512409768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585415359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9681269,0.0028570811,0.025050025,0.00047025582,0.00043180608,0.00007420857,6.749723e-7,0.00017115034,0.0028179272],"genre_scores_gemma":[0.9484464,0.000074845884,0.051355492,0.00005002049,0.000031395884,3.3916308e-7,9.5837834e-8,0.0000051735033,0.000036217607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889517,0.00007544737,0.00049320183,0.00010336591,0.00023812901,0.00019469966],"domain_scores_gemma":[0.9989174,0.00013981774,0.000617979,0.0001505492,0.000110262044,0.00006398138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003214743,0.00009093823,0.00031839177,0.00021553958,0.000032958724,0.000040260733,0.00050576386,0.000048711427,0.000032128624],"category_scores_gemma":[0.00013774574,0.000071631366,0.00007464003,0.00040563938,0.000033035914,0.0005143932,0.00006270823,0.00019719377,0.000008179494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033832554,0.005138068,0.18176453,0.0006857764,0.0010452892,0.014261584,0.044451807,0.1299058,0.104697555,0.19275111,0.018702948,0.30625722],"study_design_scores_gemma":[0.0019775915,0.0005011848,0.034832884,0.0008267308,0.000020188123,0.001256597,0.00026836246,0.9530478,0.0046003796,0.0013815903,0.0010270044,0.0002596959],"about_ca_topic_score_codex":0.000005582528,"about_ca_topic_score_gemma":0.0000016468972,"teacher_disagreement_score":0.823142,"about_ca_system_score_codex":0.00002855073,"about_ca_system_score_gemma":0.000021151209,"threshold_uncertainty_score":0.29210424},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016602307293043416,"score_gpt":0.23668945928417076,"score_spread":0.22008715199112736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590000758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30152255,0.0027498412,0.5794618,0.041793026,0.007283157,0.0012186273,0.00009101838,0.0015252955,0.064354666],"genre_scores_gemma":[0.9562056,0.000097051154,0.016827634,0.00043388683,0.00046136152,0.000019975743,0.0000010105522,0.000024345842,0.025929112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981336,0.00007544526,0.00026559597,0.0006231712,0.00032543624,0.0005767682],"domain_scores_gemma":[0.9986524,0.000171954,0.00015494334,0.0007618706,0.00006267764,0.000196164],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015805369,0.0002497524,0.0002431494,0.000071755516,0.00017841921,0.00015363104,0.0008086146,0.00013992304,0.001052974],"category_scores_gemma":[0.00011799282,0.00015219259,0.00011052779,0.00027441548,0.00014574267,0.0008691795,0.00041003124,0.0001273509,0.005828534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005381652,0.00023385977,0.006823366,0.000072125404,0.00007265829,0.00030343438,0.0013669408,0.000009056955,0.009961247,0.77931273,0.02417512,0.17761563],"study_design_scores_gemma":[0.0031006585,0.0013668865,0.037884418,0.00090890145,0.00005979141,0.00028720588,0.00010294751,0.003266157,0.023542106,0.19558513,0.7318646,0.0020311987],"about_ca_topic_score_codex":0.0000030179956,"about_ca_topic_score_gemma":0.0000014958953,"teacher_disagreement_score":0.70768946,"about_ca_system_score_codex":0.00006543461,"about_ca_system_score_gemma":0.00008436441,"threshold_uncertainty_score":0.9998602},"labels":[],"label_agreement":null},{"id":"W1590450717","doi":"10.1007/s00012-004-1881-1","title":"Finite lattices and congruences. A survey","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Congruence lattice problem; Distributive property; Lattice (music); Mathematics; Pure mathematics; Distributive lattice; Congruence (geometry); Geometry; Physics","score_opus":0.01764012204360151,"score_gpt":0.23445736788783395,"score_spread":0.21681724584423243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590450717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58877236,0.00198117,0.3815132,0.0070758937,0.00052181917,0.0003472965,0.000037564736,0.0008278989,0.018922785],"genre_scores_gemma":[0.98498476,0.00012519106,0.013022703,0.0009348532,0.00004547689,0.0000013298181,0.000006294787,0.0000063571642,0.0008730263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905944,0.00008687802,0.00011898222,0.000341679,0.00014390663,0.0002491406],"domain_scores_gemma":[0.99906445,0.00036921343,0.0000661588,0.00031871357,0.00006057894,0.00012087562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019895789,0.00012655591,0.00013610425,0.00008937533,0.00012643191,0.00011132671,0.00052855164,0.000051805102,0.00005410462],"category_scores_gemma":[0.00007391608,0.00011602462,0.00002782064,0.00035173,0.00011118028,0.0012059786,0.00019987226,0.00009702299,0.00007108565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017898714,0.000080109756,0.018973043,0.0000130418275,0.00006016155,0.000081034355,0.0023977128,0.00055199664,0.00014264157,0.84557045,0.0024250813,0.12968685],"study_design_scores_gemma":[0.0043199365,0.0006222843,0.31747985,0.000093029346,0.00007213806,0.00012663689,0.00072812923,0.14526632,0.0030861218,0.08201947,0.4435207,0.0026653905],"about_ca_topic_score_codex":0.00018654761,"about_ca_topic_score_gemma":0.0005713168,"teacher_disagreement_score":0.76355094,"about_ca_system_score_codex":0.000023381192,"about_ca_system_score_gemma":0.00003846688,"threshold_uncertainty_score":0.47313467},"labels":[],"label_agreement":null},{"id":"W1595871249","doi":"10.2178/bsl/1182353878","title":"Uri Abraham, Matatyahu Rubin, and Saharon Shelah. <i>On the consistency of some partition theorems for continuous colorings, and the structure of ℵ<sub>1</sub>-dense real order types</i>. Annals of pure and applied logic, vol. 29 (1985), pp. 123–206.","year":2002,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Annals; Partition (number theory); Mathematics; Consistency (knowledge bases); Order (exchange); Combinatorics; Discrete mathematics; Geography; Archaeology","score_opus":0.017671323722904385,"score_gpt":0.21870396308966514,"score_spread":0.20103263936676075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595871249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9854304,0.0055349753,0.00086569344,0.0044219373,0.00012941481,0.0013869145,0.00009548713,0.00004235621,0.0020928185],"genre_scores_gemma":[0.9947961,0.0030358203,0.00094620895,0.00108862,0.00004961194,0.00003327136,0.000004872151,0.0000143146835,0.00003116085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830806,0.00014628166,0.0005580181,0.0004193894,0.0002687225,0.00029952568],"domain_scores_gemma":[0.9977323,0.0008391009,0.0006018913,0.0004693457,0.00029068906,0.00006669398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052488496,0.0002621071,0.00067368767,0.000060785405,0.00014447219,0.00003021021,0.000380214,0.00015766331,0.000039035298],"category_scores_gemma":[0.0002686138,0.00015020967,0.00008137475,0.00017722114,0.0011567798,0.000055431003,0.00016220077,0.00017387384,0.0000022445024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033273053,0.00011680652,0.000121320445,0.00024802875,0.00007605557,0.0000024928693,0.0010461491,0.00006826071,0.02937763,0.96248317,0.0027939142,0.0033334217],"study_design_scores_gemma":[0.0041534505,0.001499805,0.0047261366,0.00019991802,0.00014496608,0.00006829553,0.0008541059,0.0005415178,0.14996767,0.83492523,0.00240461,0.00051431754],"about_ca_topic_score_codex":0.000018468581,"about_ca_topic_score_gemma":0.0000043652926,"teacher_disagreement_score":0.12755798,"about_ca_system_score_codex":0.0000060008674,"about_ca_system_score_gemma":0.000017763883,"threshold_uncertainty_score":0.61253726},"labels":[],"label_agreement":null},{"id":"W1598187630","doi":"10.1007/978-3-540-78913-0_21","title":"Cardinality in Allegories","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Allegory; Cardinality (data modeling); Injective function; Mathematics; Axiom; Surjective function; Context (archaeology); Uniqueness; Function (biology); Discrete mathematics; Combinatorics; Computer science; Geometry; Geography; Mathematical analysis","score_opus":0.020434325466337083,"score_gpt":0.24559236156755584,"score_spread":0.22515803610121876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598187630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002040506,0.0012011025,0.98852634,0.00055959984,0.0013365065,0.00026384258,0.0000022994802,0.00015080631,0.007755433],"genre_scores_gemma":[0.48902857,0.00048719504,0.5065833,0.0024420184,0.0006744815,0.00001809557,0.000005365148,0.000045239034,0.00071577885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962288,0.00004059375,0.0005146565,0.0015975637,0.00087794,0.0007404171],"domain_scores_gemma":[0.99776506,0.00034934038,0.00019608636,0.0013993597,0.00014109712,0.00014905701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005629324,0.0005073121,0.00063152786,0.0007056804,0.00020935785,0.00021003098,0.003200233,0.0002979753,0.000013428393],"category_scores_gemma":[0.00008751785,0.00045764443,0.00013907619,0.0007577923,0.00090268714,0.0007500006,0.0013484037,0.0009389704,0.00004496996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009005738,0.000051398438,0.00063023745,0.00004189796,0.000010871396,0.0010819138,0.002343953,0.04985126,0.00003662795,0.09675011,0.00006904328,0.84912366],"study_design_scores_gemma":[0.0005696852,0.0002529085,0.0025871147,0.00035852328,0.0000050686995,0.00038899027,3.8713202e-7,0.12393862,0.00065575476,0.8567947,0.012820882,0.0016273309],"about_ca_topic_score_codex":0.000034640703,"about_ca_topic_score_gemma":0.00014917615,"teacher_disagreement_score":0.84749633,"about_ca_system_score_codex":0.00032352092,"about_ca_system_score_gemma":0.0005069442,"threshold_uncertainty_score":0.9997875},"labels":[],"label_agreement":null},{"id":"W1600248067","doi":"10.2307/421214","title":"Bart Jacobs. Categorical logic and type theory. Studies in logic and the foundations of mathematics, vol. 141. Elsevier, Amsterdam etc. 1999, xvii + 760 pp.","year":2000,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Categorical variable; Type (biology); Content (measure theory); Mathematics; Computer science; Mathematics education; Statistics; Mathematical analysis","score_opus":0.030897928812136363,"score_gpt":0.2875145548437843,"score_spread":0.2566166260316479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600248067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46072087,0.3282501,0.047847785,0.051353343,0.0024438477,0.007011916,0.000036148867,0.0009890398,0.10134694],"genre_scores_gemma":[0.9721239,0.013005344,0.012065282,0.0011832723,0.00006730533,0.000057426056,0.0000032814012,0.000016590973,0.0014775731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978419,0.0003262508,0.0006846093,0.00049199024,0.0002796189,0.0003756197],"domain_scores_gemma":[0.9977667,0.0011356343,0.00025917572,0.00057835726,0.00018982858,0.000070335176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011011896,0.00029221273,0.0007548717,0.00009547959,0.00017572317,0.000047351547,0.0006663542,0.00012109322,0.0002630074],"category_scores_gemma":[0.0006501573,0.00017699265,0.00008881041,0.0004243258,0.0012710635,0.00008551829,0.0003757871,0.00023924415,0.00006924788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058057994,0.00029997862,0.0002890468,0.00020277931,0.00006795344,0.000019932075,0.0035728144,0.00013256309,0.000040674386,0.95868915,0.0011288199,0.03549824],"study_design_scores_gemma":[0.0015022302,0.00032584308,0.0014376809,0.00009868848,0.00005346882,0.00009727171,0.0014849694,0.00089700357,0.00004810755,0.9789431,0.01479382,0.00031780242],"about_ca_topic_score_codex":0.00003592386,"about_ca_topic_score_gemma":0.00000959021,"teacher_disagreement_score":0.5114031,"about_ca_system_score_codex":0.000030171359,"about_ca_system_score_gemma":0.000036848298,"threshold_uncertainty_score":0.721755},"labels":[],"label_agreement":null},{"id":"W1607885199","doi":"10.1023/a:1005238330484","title":"Completeness Theorems via the Double Dual Functor","year":2000,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Agencia Nacional de Promoción Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Universidad de Chile; Pontificia Universidad Católica de Chile; Université de Montréal","keywords":"Łukasiewicz logic; Propositional calculus; Mathematics; Completeness (order theory); Calculus (dental); Distributive property; Functor; Monoidal t-norm logic; Propositional variable; Algebra over a field; Zeroth-order logic; Many-valued logic; Discrete mathematics; Pure mathematics; Computer science; Intermediate logic; Substructural logic; Artificial intelligence","score_opus":0.027078596386552512,"score_gpt":0.24369137655492515,"score_spread":0.21661278016837263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607885199","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17818168,0.0020537868,0.3446078,0.009626714,0.0016989309,0.0012305283,0.000010163234,0.0011850721,0.46140534],"genre_scores_gemma":[0.99531144,0.00004330077,0.0019060905,0.0014591047,0.000185318,0.00004239479,0.000001954638,0.0000066174985,0.0010437685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987491,0.0000746684,0.0001732935,0.00038399373,0.0002444407,0.00037452902],"domain_scores_gemma":[0.9990643,0.00015435333,0.00004828583,0.0006265721,0.00004085157,0.000065600434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020668971,0.0001673167,0.000187719,0.000019461268,0.00045918245,0.00009286169,0.0009056379,0.00004106,0.0006248831],"category_scores_gemma":[0.000007782217,0.00008760867,0.000079196776,0.0003525504,0.00016497092,0.00018955402,0.0002278586,0.00015037796,0.000752884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047465,0.00013648474,0.00032741498,0.0000036456993,0.000038171318,0.000053980366,0.0008825215,0.0004717933,0.00035950373,0.89586264,0.0019753315,0.09984107],"study_design_scores_gemma":[0.0023717736,0.00062597863,0.063652895,0.000013794319,0.000029594174,0.00013003229,0.00023321727,0.0023601626,0.00044494434,0.52682954,0.40237424,0.00093381613],"about_ca_topic_score_codex":0.000012985397,"about_ca_topic_score_gemma":0.000008542876,"teacher_disagreement_score":0.8171298,"about_ca_system_score_codex":0.00001745452,"about_ca_system_score_gemma":0.000026376312,"threshold_uncertainty_score":0.96770525},"labels":[],"label_agreement":null},{"id":"W1608635114","doi":"10.1090/s0002-9939-05-08066-4","title":"$HSP\\not = SHPS$ for commutative rings with identity","year":2005,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Identity (music); Commutative ring; Mathematics; Commutative property; Class (philosophy); Subclass; Combinatorics; Algebraic number; Discrete mathematics; Physics; Mathematical analysis; Computer science; Biology","score_opus":0.014469224069581118,"score_gpt":0.27229565498376634,"score_spread":0.2578264309141852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608635114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44339073,0.000013681369,0.5491433,0.005098279,0.000015222044,0.0004237505,0.0000032929477,0.0001227169,0.0017890219],"genre_scores_gemma":[0.6008754,0.0000041220005,0.39793396,0.0010071372,0.00003146316,0.000040231636,9.007723e-8,0.000009150839,0.00009847235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988304,0.0000050619183,0.00024044584,0.0002646461,0.00036522347,0.00029425687],"domain_scores_gemma":[0.9988833,0.000220723,0.00042513254,0.00018516884,0.00021349713,0.00007218618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032893193,0.00015497087,0.000331789,0.0000130997705,0.00019800768,0.00008298108,0.0012438217,0.000024336749,0.0000047533053],"category_scores_gemma":[0.00013259692,0.00009159747,0.00023761837,0.00048208772,0.00060674315,0.00073590706,0.0003833846,0.00015509925,0.000007517288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027994874,0.00021282461,0.0005655058,0.00021892006,0.00009318643,7.2114254e-8,0.005858767,0.000033063083,0.0040656766,0.9819222,0.001181187,0.0058205985],"study_design_scores_gemma":[0.00088765565,0.0005556138,0.004316893,0.00018125658,0.00008537408,0.000030727308,0.0034389712,0.044999707,0.043762404,0.90009516,0.001104087,0.00054213044],"about_ca_topic_score_codex":0.0000031926709,"about_ca_topic_score_gemma":5.1179995e-7,"teacher_disagreement_score":0.15748465,"about_ca_system_score_codex":0.000058151836,"about_ca_system_score_gemma":0.000021515085,"threshold_uncertainty_score":0.37352362},"labels":[],"label_agreement":null},{"id":"W1611875164","doi":"10.1016/j.apal.2007.03.001","title":"First-order Gödel logics","year":2007,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Uncountable set; Negation; Mathematics; Interpretation (philosophy); Order (exchange); Combinatorics; Discrete mathematics; Finite set; Countable set; Computer science; Mathematical analysis","score_opus":0.04747162189864145,"score_gpt":0.2948686843336565,"score_spread":0.24739706243501502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1611875164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037099607,0.0012516206,0.92619973,0.002632349,0.00010802082,0.00019314178,0.0000019670642,0.00013499026,0.03237859],"genre_scores_gemma":[0.9635456,0.0002434579,0.03203328,0.0039669187,0.00006959767,0.000004867027,0.0000018810435,0.0000057022266,0.00012870015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890214,0.0000081897215,0.00023883616,0.00032169023,0.00017307476,0.0003560939],"domain_scores_gemma":[0.9992772,0.00011208375,0.00011391707,0.0003110972,0.00008103996,0.000104714185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036875316,0.00015014676,0.00021295236,0.00007342456,0.00011244022,0.000029862073,0.000412325,0.00010294694,0.00001809378],"category_scores_gemma":[0.000023448873,0.00011484554,0.000046476027,0.000357427,0.000089002,0.00013437356,0.00018445415,0.00012377075,0.000023079961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012921767,0.00007092131,0.00013397785,0.000021728669,0.00001076358,0.000012991605,0.00020518918,0.0002351188,0.0007259092,0.9638133,0.0009149446,0.033842217],"study_design_scores_gemma":[0.00037206477,0.00023823707,0.0063336175,0.000013790799,0.0000067403716,0.00001933507,0.00016097676,0.0006568787,0.009126477,0.96221745,0.020477526,0.0003768777],"about_ca_topic_score_codex":0.0000018849214,"about_ca_topic_score_gemma":0.000009666287,"teacher_disagreement_score":0.92644596,"about_ca_system_score_codex":0.0000026571538,"about_ca_system_score_gemma":0.000012867133,"threshold_uncertainty_score":0.46832654},"labels":[],"label_agreement":null},{"id":"W16581075","doi":"10.1016/j.injury.2006.02.038","title":"Graph Operations and Point-Distinguishing Chromatic Indices.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Graph; Windmill graph; Friendship graph; Combinatorics; Line graph; Voltage graph","score_opus":0.009737606395186975,"score_gpt":0.23673656357332248,"score_spread":0.2269989571781355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16581075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97615856,0.0005695847,0.016798716,0.001607953,0.000750153,0.00016340261,8.332866e-7,0.00028992008,0.0036608889],"genre_scores_gemma":[0.9722116,0.00001549233,0.027189089,0.00046241473,0.000016730482,0.00001083138,0.0000017366127,0.000006609855,0.00008548316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917585,0.000036060854,0.00017157148,0.00026188308,0.00014436616,0.00021024836],"domain_scores_gemma":[0.9994403,0.000075945376,0.000043993517,0.00030519415,0.000039941464,0.00009459171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016221043,0.00010950479,0.00012363469,0.00007402908,0.00026360713,0.00020818805,0.00039823054,0.000040102634,0.000011318996],"category_scores_gemma":[0.000107602486,0.000102027385,0.00002644231,0.0002840154,0.000046176985,0.0008396844,0.00017642851,0.000124352,0.000048494592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.6191187e-7,0.00003788109,0.00057724764,0.0000063748785,0.0000062851846,0.000006408181,0.000777288,0.00014676979,0.00017531868,0.99016696,0.00026676114,0.007832313],"study_design_scores_gemma":[0.00068672636,0.00008237059,0.0060460046,0.000034784833,0.000008034052,0.000041515148,0.000051913776,0.026248077,0.0006184017,0.9641167,0.0017747313,0.00029075702],"about_ca_topic_score_codex":0.000010307895,"about_ca_topic_score_gemma":0.000015684747,"teacher_disagreement_score":0.026101308,"about_ca_system_score_codex":0.000026779991,"about_ca_system_score_gemma":0.000026074145,"threshold_uncertainty_score":0.41605562},"labels":[],"label_agreement":null},{"id":"W170880581","doi":"","title":"On geometric lattices and matroids of arbitrary cardinality.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cardinality (data modeling); Matroid; Mathematics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.008565139494594108,"score_gpt":0.22572710296828427,"score_spread":0.21716196347369016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170880581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989193,0.00072833075,0.0024455357,0.00012646905,0.00047737235,0.00007274601,0.0000014232572,0.00007393532,0.006881155],"genre_scores_gemma":[0.9970394,0.000013794645,0.0027559444,0.00007932868,0.0000068608033,0.000003577704,0.0000011633077,0.000005299627,0.00009465352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916136,0.00003847566,0.00016951514,0.00024525035,0.00020741014,0.00017801387],"domain_scores_gemma":[0.9993074,0.0001978256,0.000085449334,0.000326239,0.000038491442,0.000044621735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001462555,0.00010345731,0.0001778118,0.0001590594,0.00006023973,0.00003663245,0.00032100917,0.00004339765,0.0000039136044],"category_scores_gemma":[0.00002809717,0.000091965274,0.00004427009,0.00061160635,0.00005363869,0.00024194256,0.00011303472,0.000095201045,0.000010729689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003268774,0.000064797925,0.0056939144,0.00001428689,0.0000060488555,0.000009485357,0.00001878575,0.000029854173,0.000111164256,0.9922786,0.0002479943,0.0015217942],"study_design_scores_gemma":[0.00035012222,0.00016927221,0.038020026,0.000010663303,0.0000052033374,0.0000078419835,0.000004874226,0.0003139021,0.0014522604,0.9592737,0.00028202703,0.00011009802],"about_ca_topic_score_codex":0.00004085855,"about_ca_topic_score_gemma":7.507623e-7,"teacher_disagreement_score":0.033004895,"about_ca_system_score_codex":0.00001545124,"about_ca_system_score_gemma":0.000015784071,"threshold_uncertainty_score":0.37502348},"labels":[],"label_agreement":null},{"id":"W1737867972","doi":"10.1090/s0002-9939-05-07581-7","title":"Algebraic isomorphisms and 𝒥-subspace lattices","year":2005,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subspace topology; Isomorphism (crystallography); Mathematics; Algebraic number; Combinatorics; Banach space; Rank (graph theory); Lattice (music); Space (punctuation); Discrete mathematics; Physics; Crystal structure; Mathematical analysis; Crystallography","score_opus":0.0096618621322246,"score_gpt":0.23622480279060823,"score_spread":0.22656294065838362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1737867972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9432406,0.0001783835,0.036915045,0.014355662,0.000034020308,0.00022451398,9.852481e-7,0.00016482007,0.0048860125],"genre_scores_gemma":[0.75546277,0.000042444353,0.24291772,0.0013035664,0.000054325912,0.000009245002,3.3906417e-8,0.000008317675,0.00020156144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900997,0.0000051409033,0.00020352453,0.00025645227,0.00027670685,0.0002482087],"domain_scores_gemma":[0.99924,0.00013049388,0.00030589476,0.00016321367,0.000074644435,0.00008579939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022303668,0.00013647455,0.0002700454,0.000012377131,0.00012871902,0.000068227855,0.000777456,0.000027291491,0.000012037386],"category_scores_gemma":[0.00009852081,0.00008551572,0.00014800567,0.00038783092,0.0005933771,0.00038597628,0.00047253884,0.00014459468,0.000015667325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043560817,0.00014793228,0.0016150546,0.00014507769,0.000053125994,1.2696084e-7,0.0040505026,0.0000056253234,0.008830137,0.9652466,0.003504586,0.016396835],"study_design_scores_gemma":[0.0004948383,0.00023871475,0.008755628,0.00013487675,0.00006588081,0.00007358922,0.0021409704,0.051168848,0.015781714,0.91642976,0.004142546,0.00057261257],"about_ca_topic_score_codex":0.0000016259893,"about_ca_topic_score_gemma":1.0721447e-7,"teacher_disagreement_score":0.20600267,"about_ca_system_score_codex":0.000023053124,"about_ca_system_score_gemma":0.000011571101,"threshold_uncertainty_score":0.348723},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.007629653076829406,"score_gpt":0.2417868340842249,"score_spread":0.2341571810073955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17485640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058842786,0.00030109574,0.9370677,0.00020069205,0.000013898803,0.00010509115,0.0000027192496,0.00003532353,0.0034307365],"genre_scores_gemma":[0.9952672,0.000041801508,0.0044932766,0.0000690759,0.0000098884475,0.000030468227,0.000001413689,0.0000022884972,0.000084580126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996295,0.00001714703,0.00011017362,0.00011696461,0.00006179841,0.000064407315],"domain_scores_gemma":[0.9993885,0.00016097102,0.00006071894,0.0003137654,0.000049399183,0.000026652682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001227196,0.000052135336,0.00009012427,0.000041559822,0.00007651849,0.0000058038167,0.00021715483,0.00002103686,0.000004197485],"category_scores_gemma":[0.000021016733,0.000041689964,0.000019948397,0.00018150991,0.00018962564,0.0000957048,0.00005428202,0.000037938255,0.00000465506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070992432,0.000042310287,0.0000051891284,0.000006843713,0.0000030678054,1.4823193e-7,0.00022850963,0.00030584956,0.0013959359,0.9867466,0.0000040884174,0.01125432],"study_design_scores_gemma":[0.00009959549,0.00005097469,0.0003164913,0.0000040435834,0.000003331556,0.0000024870722,0.000103113474,0.000010160557,0.024465404,0.97451705,0.00038392103,0.000043420678],"about_ca_topic_score_codex":0.0000031107159,"about_ca_topic_score_gemma":6.465995e-7,"teacher_disagreement_score":0.93642443,"about_ca_system_score_codex":0.000003550578,"about_ca_system_score_gemma":0.000022394941,"threshold_uncertainty_score":0.17000675},"labels":[],"label_agreement":null},{"id":"W1754526136","doi":"10.1023/a:1022817724019","title":"Lattice tensor products. III - Congruences","year":2003,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Manitoba","funders":"","keywords":"Mathematics; Tensor product; Lattice (music); Combinatorics; Pure mathematics; Discrete mathematics; Physics","score_opus":0.02017604329278247,"score_gpt":0.25771252412873125,"score_spread":0.23753648083594878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1754526136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11505974,0.0018891883,0.6298264,0.037711047,0.0065848543,0.0029944512,0.000013952898,0.002807826,0.20311253],"genre_scores_gemma":[0.8177474,0.00004610448,0.1729876,0.0013242039,0.000118412994,0.00006223037,0.0000023399025,0.000029113082,0.0076825605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959462,0.00020724806,0.00066954887,0.0011934254,0.000940107,0.0010434455],"domain_scores_gemma":[0.9972972,0.00041805822,0.00036344997,0.0013700527,0.00022379882,0.00032739795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017116427,0.00038756183,0.00048133233,0.00024732648,0.00061886804,0.00038687157,0.002537264,0.00024092541,0.00018329071],"category_scores_gemma":[0.0018240691,0.0003050673,0.0001279455,0.0019694082,0.00040779973,0.001822114,0.00042596934,0.0007124165,0.0005542989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002935253,0.00018988829,0.00012986196,0.00007835231,0.000037381586,0.000016085669,0.0011661622,0.000009368803,0.0080593685,0.9774316,0.011731859,0.0011471622],"study_design_scores_gemma":[0.0014750967,0.00023101688,0.0010561225,0.00017725435,0.00013114735,0.00049617764,0.00068780215,0.008045683,0.064246565,0.63979167,0.28169906,0.0019623835],"about_ca_topic_score_codex":0.0000027012143,"about_ca_topic_score_gemma":0.000001093445,"teacher_disagreement_score":0.7026877,"about_ca_system_score_codex":0.00006385282,"about_ca_system_score_gemma":0.00020499217,"threshold_uncertainty_score":0.99994016},"labels":[],"label_agreement":null},{"id":"W1778647798","doi":"10.1109/ismvl.1999.779699","title":"Maximal chains of partial clones containing all idempotent partial functions","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Idempotence; clone (Java method); Partial function; Combinatorics; Mathematics; Partially ordered set; Construct (python library); Set (abstract data type); Chain (unit); Discrete mathematics; Pure mathematics; Computer science; Physics; Biology; Genetics; Gene","score_opus":0.03502998046839575,"score_gpt":0.2618691643195354,"score_spread":0.22683918385113963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778647798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062184256,0.00007543138,0.93120116,0.000468825,0.00041967747,0.00010033069,0.000001225663,0.00013602295,0.0054130824],"genre_scores_gemma":[0.9741612,0.000006386868,0.024788043,0.00045192512,0.000060862352,0.000015385254,0.0000016023938,0.000005511449,0.00050910434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885315,0.00007382653,0.0002744237,0.00029360774,0.00018444116,0.00032057497],"domain_scores_gemma":[0.99936634,0.00006953511,0.00008857096,0.0003164657,0.000054008997,0.00010507219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020912073,0.000119874814,0.00017570746,0.000050849347,0.000100435485,0.00003076642,0.00026016662,0.00004812049,0.0001165215],"category_scores_gemma":[0.000052182844,0.00009813733,0.00008647977,0.00018655646,0.000056347002,0.0002914634,0.0000800472,0.000092475915,0.00005015084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019041065,0.0000930672,0.0015687612,0.0000036750819,0.000023134106,0.000013368616,0.00028838022,0.0012229914,0.0014821633,0.9894708,0.00017575528,0.0056388997],"study_design_scores_gemma":[0.008190259,0.0049592108,0.023671081,0.00008392079,0.00017152628,0.00041414995,0.0026660918,0.23252194,0.18949474,0.14195342,0.39276245,0.003111202],"about_ca_topic_score_codex":0.000014064878,"about_ca_topic_score_gemma":0.000009523832,"teacher_disagreement_score":0.91197693,"about_ca_system_score_codex":0.000016561145,"about_ca_system_score_gemma":0.000051276635,"threshold_uncertainty_score":0.4001924},"labels":[],"label_agreement":null},{"id":"W1795260059","doi":"10.1016/j.topol.2015.12.020","title":"Topological categories, quantaloids and Isbell adjunctions","year":2015,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Functor; Category theory; Sheaf; Categorical variable; Context (archaeology); Mathematics; Topology (electrical circuits); Field (mathematics); Pure mathematics; Geography; Combinatorics","score_opus":0.03544656605365604,"score_gpt":0.2763685848199252,"score_spread":0.24092201876626917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795260059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07829306,0.005967748,0.89091617,0.0097162295,0.00023048958,0.0004343768,0.000007821106,0.00033664663,0.014097434],"genre_scores_gemma":[0.9924479,0.00023716857,0.0055209585,0.0006745545,0.00006723054,0.00011913086,0.000005964275,0.0000031356026,0.0009239236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993637,0.000030776693,0.00011062418,0.0002845844,0.00004781829,0.00016250499],"domain_scores_gemma":[0.9994811,0.00007825137,0.000033311586,0.00021198635,0.000050693507,0.00014469211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009110009,0.00008464373,0.00010732512,0.00004003449,0.00024132611,0.000023557432,0.00018770537,0.00008764952,0.000017493945],"category_scores_gemma":[0.000028711198,0.0000694579,0.000010219751,0.0001741631,0.0002066735,0.00017840044,0.00016187031,0.00011086227,0.000057887846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001945069,0.000027500117,0.0003329247,0.0000018031332,0.0000034439033,0.0000010881283,0.00019173887,0.0000030652386,0.00011235395,0.994111,0.0002823222,0.004930803],"study_design_scores_gemma":[0.00039964437,0.0002560839,0.0036119092,0.0000012053181,0.00001032652,0.00023020968,0.0005192365,0.0014465229,0.00035474933,0.85851,0.134439,0.00022108499],"about_ca_topic_score_codex":0.000015677319,"about_ca_topic_score_gemma":0.00001585137,"teacher_disagreement_score":0.9141549,"about_ca_system_score_codex":0.000010695473,"about_ca_system_score_gemma":0.00003318091,"threshold_uncertainty_score":0.2832411},"labels":[],"label_agreement":null},{"id":"W1808067255","doi":"10.1023/a:1013891106032","title":"Isotone Maps as Maps of Congruences. II. Concrete Maps","year":2001,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics","score_opus":0.01619548855773027,"score_gpt":0.26385203391132467,"score_spread":0.2476565453535944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1808067255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3825482,0.0027211383,0.30792248,0.047937185,0.0063939868,0.0044855517,0.00025248958,0.0027833036,0.24495563],"genre_scores_gemma":[0.9150844,0.00028721555,0.06920111,0.0019004063,0.00020763176,0.00008535318,0.000039663835,0.000057151596,0.013137055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99490756,0.00016678864,0.0011572263,0.001184489,0.0013815791,0.0012023366],"domain_scores_gemma":[0.99641484,0.0004717735,0.0007676271,0.001610931,0.00025547727,0.0004793602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015653571,0.0005081381,0.00083370035,0.00042155603,0.00062781764,0.00020079844,0.0039511044,0.00042155842,0.00037932373],"category_scores_gemma":[0.0007249064,0.00043188443,0.00028436305,0.002136435,0.0007905859,0.0017005829,0.0015948224,0.0008758249,0.00056980556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002981674,0.00017909608,0.0004047478,0.00019291729,0.00012511214,0.00010654257,0.0026443682,0.000020489126,0.040496904,0.8885285,0.06383089,0.0034406001],"study_design_scores_gemma":[0.0015787511,0.0005317037,0.00033975308,0.0003369591,0.00011655896,0.00063341716,0.00050071016,0.005137068,0.03662946,0.75393057,0.19885294,0.0014121014],"about_ca_topic_score_codex":0.000017858438,"about_ca_topic_score_gemma":0.000002592719,"teacher_disagreement_score":0.5325362,"about_ca_system_score_codex":0.00008973848,"about_ca_system_score_gemma":0.0002151353,"threshold_uncertainty_score":0.9998133},"labels":[],"label_agreement":null},{"id":"W1808907315","doi":"10.3968/j.sms.1923845220120402.1876","title":"The Category of L-fuzzy Quantales","year":2012,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coproduct; Mathematics; Element (criminal law); Monoid; Unital; Pure mathematics; Algebra over a field; Fuzzy logic; Computer science; Artificial intelligence","score_opus":0.12116504519491236,"score_gpt":0.39101736106613727,"score_spread":0.26985231587122493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1808907315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6358358,0.050612833,0.15152709,0.005391771,0.0023970404,0.0006915078,0.0000010939331,0.00020883864,0.153334],"genre_scores_gemma":[0.98034805,0.00022630536,0.019293047,0.0000421804,0.000026288291,0.0000134078755,1.1811296e-8,0.0000012293684,0.000049508184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896806,0.000056576504,0.00022869911,0.00013069114,0.00028177822,0.00033417915],"domain_scores_gemma":[0.9984465,0.0012313566,0.00007007111,0.00019162388,0.000025448348,0.000034993605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013989905,0.000072450785,0.00015504101,0.000032946587,0.00027871897,0.00002207499,0.00079245196,0.000015320327,0.0000028115717],"category_scores_gemma":[0.00056103134,0.00003437646,0.00003220708,0.0004653449,0.0015788799,0.00033453974,0.00035850494,0.000056270397,0.000026510606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.8751887e-7,0.000034510664,0.0011684154,0.000017286568,0.0000038095193,4.562779e-7,0.0022505547,0.000005720499,0.00003066379,0.99356496,0.000057541194,0.0028656968],"study_design_scores_gemma":[0.000038801863,0.00004197791,0.0017701036,0.000027858516,0.0000016172098,0.000006115283,0.0040493296,0.0005903314,0.00037394068,0.99285233,0.00017989156,0.00006769411],"about_ca_topic_score_codex":0.0000015909758,"about_ca_topic_score_gemma":0.0000054851253,"teacher_disagreement_score":0.34451222,"about_ca_system_score_codex":0.000015249272,"about_ca_system_score_gemma":0.000015286687,"threshold_uncertainty_score":0.5817449},"labels":[],"label_agreement":null},{"id":"W1816937868","doi":"10.3233/fun-2005-67404","title":"First and Second Order Recursion on Abstract Data Types","year":2005,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Recursion (computer science); Order (exchange); Computer science; Mathematics; Algorithm; Business","score_opus":0.03276109681091978,"score_gpt":0.27124038571001485,"score_spread":0.2384792888990951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1816937868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47155908,0.0009546766,0.1753555,0.021240333,0.0015958111,0.0014979356,0.00022166639,0.0010158636,0.32655916],"genre_scores_gemma":[0.8839068,0.00009511602,0.10892762,0.005702524,0.00013310275,0.000008984155,0.00005920524,0.000009633008,0.0011570175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992163,0.0000058109927,0.00022327111,0.00018415159,0.0001685248,0.00020192857],"domain_scores_gemma":[0.99899036,0.00008859702,0.00008110563,0.00073629606,0.00001906462,0.00008459826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014876101,0.000111456095,0.00010375744,0.000055835146,0.00015156293,0.0001713964,0.0007091636,0.00003792473,0.0005117624],"category_scores_gemma":[0.000036365534,0.00008773226,0.000011613076,0.00012571643,0.00003791448,0.0021003964,0.00045628543,0.00011829111,0.00077031826],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004417064,0.0002738383,0.0005635255,0.00024271895,0.000061745886,0.0000105072095,0.0047884434,0.0008688404,0.00005437766,0.14278819,0.06550018,0.78480345],"study_design_scores_gemma":[0.0004714485,0.00015007272,0.0045465603,0.000051854164,0.00000396362,0.000021555727,0.000103906634,0.04910703,0.0002120897,0.0026605213,0.9424333,0.00023768833],"about_ca_topic_score_codex":0.0000018239236,"about_ca_topic_score_gemma":0.000021844075,"teacher_disagreement_score":0.87693316,"about_ca_system_score_codex":0.000028589655,"about_ca_system_score_gemma":0.000019416273,"threshold_uncertainty_score":0.990114},"labels":[],"label_agreement":null},{"id":"W1831015891","doi":"10.3968/j.pam.1925252820120102.005","title":"The Coproduct of Unital Quantales","year":2011,"lang":"en","type":"article","venue":"Progress in applied mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coproduct; Unital; Mathematics; Monoid; Element (criminal law); Pure mathematics; Algebra over a field","score_opus":0.040422438626237255,"score_gpt":0.26329460493627815,"score_spread":0.2228721663100409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831015891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19020817,0.0058162734,0.64129764,0.0003481354,0.00062477984,0.0020147816,0.0000036262386,0.0005457358,0.15914084],"genre_scores_gemma":[0.6936838,0.000020562657,0.306226,0.0000067224273,0.000007946266,0.00004045644,2.0912626e-7,0.0000041816756,0.000010119441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922395,0.000009004152,0.00025959243,0.00015511541,0.0001619349,0.00019040627],"domain_scores_gemma":[0.999189,0.000106275475,0.00014360297,0.0005117843,0.00002458715,0.0000247386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028433502,0.00009287583,0.00013902268,0.000037193153,0.000060692473,0.000021760174,0.0008003658,0.000029557483,0.0000025402885],"category_scores_gemma":[0.000020880514,0.000058368496,0.000029672827,0.00025196624,0.00022671402,0.000062875406,0.0001511579,0.00008734883,0.000011745534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030726999,0.00013598299,0.0002143012,0.00004220705,0.0000056750237,0.0000024070318,0.0022010624,0.0000010255638,0.00003613242,0.93407947,0.000007660853,0.06327103],"study_design_scores_gemma":[0.00020191637,0.00005079728,0.00083743915,0.000031891155,0.0000049188125,0.000010872972,0.00063121965,0.0027691792,0.014741374,0.9804428,0.00012677757,0.00015078484],"about_ca_topic_score_codex":3.7917079e-7,"about_ca_topic_score_gemma":0.0000021842027,"teacher_disagreement_score":0.50347567,"about_ca_system_score_codex":0.000008983921,"about_ca_system_score_gemma":0.000017591172,"threshold_uncertainty_score":0.23801982},"labels":[],"label_agreement":null},{"id":"W185541708","doi":"","title":"Identities and Generating Functions for Certain Classes of F-Partitions.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.015082864726527779,"score_gpt":0.24592150832248705,"score_spread":0.23083864359595926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185541708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96910226,0.0003696743,0.027866293,0.00022713175,0.00053861976,0.0001387803,0.000005285293,0.00008018797,0.0016717836],"genre_scores_gemma":[0.9889627,0.000041927833,0.0096804965,0.000085287946,0.000009393455,0.000034946275,0.0000034968314,0.000004434622,0.0011773076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947894,0.00002069329,0.0001416647,0.00015681711,0.000074355055,0.00012754348],"domain_scores_gemma":[0.9995874,0.000113036906,0.000039980667,0.00017196324,0.000053041273,0.00003453292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007416169,0.00006423234,0.000097828466,0.0000364699,0.00017863691,0.00005212641,0.00014310276,0.000026503536,0.000033246833],"category_scores_gemma":[0.00002853544,0.0000623061,0.000032464235,0.00013513699,0.00004602314,0.00035329405,0.000032335476,0.000037263388,0.000006900306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002456222,0.000036073325,0.0004067288,0.000012036035,0.000008555964,7.7595985e-7,0.00015280045,0.00033698604,0.0006254986,0.98650014,0.0013283519,0.010589566],"study_design_scores_gemma":[0.00039794826,0.00012740298,0.0009488039,0.000010848204,0.0000074844684,0.000006319841,0.00006250245,0.008547875,0.0014253356,0.9851571,0.0032019275,0.00010650722],"about_ca_topic_score_codex":0.000005194139,"about_ca_topic_score_gemma":0.0000034682068,"teacher_disagreement_score":0.019860465,"about_ca_system_score_codex":0.000009265979,"about_ca_system_score_gemma":0.000020514786,"threshold_uncertainty_score":0.2540769},"labels":[],"label_agreement":null},{"id":"W1868260886","doi":"10.1142/s0218196715500265","title":"Existence of finite bases for quasi-equations of unary algebras with 0","year":2015,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Unary operation; Mathematics; Subalgebra; Ideal (ethics); Algebra over a field; Pure mathematics; Function (biology); Discrete mathematics","score_opus":0.043092913822301106,"score_gpt":0.30626776460558985,"score_spread":0.2631748507832887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868260886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17601497,0.00019215347,0.8227233,0.0006503212,0.00024310149,0.00007134317,0.0000057386574,0.00000778438,0.000091280526],"genre_scores_gemma":[0.8675825,0.000016606848,0.13219956,0.00011265906,0.00006563032,0.0000023071566,0.0000053757526,0.0000043204436,0.000011012674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988596,0.000041345786,0.00045780616,0.00011791657,0.00044270727,0.0000806107],"domain_scores_gemma":[0.99716914,0.000536154,0.0006813727,0.00007859213,0.0014611509,0.000073615236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027632999,0.00008701487,0.00019091288,0.00021811061,0.000026223559,0.000034003722,0.00037503132,0.000027781956,0.0000015743519],"category_scores_gemma":[0.00021510213,0.00006823551,0.00006183883,0.0001640209,0.00007717344,0.00064962276,0.000052790958,0.00006115336,5.0546527e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062925986,0.0006301093,0.0039792573,0.0000634608,0.00032678465,0.0000402443,0.003508577,0.047372326,0.0007084249,0.8027993,0.00023998719,0.13970229],"study_design_scores_gemma":[0.0040408717,0.0042815832,0.006709493,0.00036199443,0.00006454491,0.00031368562,0.0008372678,0.2646089,0.0052408474,0.7128642,0.00038658912,0.00028999988],"about_ca_topic_score_codex":0.0000055226974,"about_ca_topic_score_gemma":0.0000021640242,"teacher_disagreement_score":0.69156754,"about_ca_system_score_codex":0.000024362675,"about_ca_system_score_gemma":0.00017720829,"threshold_uncertainty_score":0.27825636},"labels":[],"label_agreement":null},{"id":"W188201746","doi":"","title":"Model-theoretic characterization of Asher and Vieu's ontology of mereotopology","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Soundness; Axiom; Characterization (materials science); Mathematics; Completeness (order theory); Extension (predicate logic); Representation (politics); Graph; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.01877590047522054,"score_gpt":0.22937668772149636,"score_spread":0.21060078724627582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188201746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47344714,0.000017709639,0.52456886,0.00012358068,0.00002509466,0.0000330891,3.7401688e-7,0.000013461658,0.0017706793],"genre_scores_gemma":[0.97783506,0.00006912981,0.02171571,0.00015713608,0.000004620634,0.0000022685606,0.0000010185663,0.0000021523917,0.00021288387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995405,0.000028264436,0.00015177047,0.0001360393,0.00005254492,0.000090857386],"domain_scores_gemma":[0.9996556,0.000026685753,0.000079533675,0.00017272307,0.00004244696,0.000023017557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042017116,0.000052622152,0.00015066545,0.000047387846,0.000022801367,0.0000013098908,0.0001601427,0.000041941017,0.000029879042],"category_scores_gemma":[0.000010241949,0.000041836298,0.000017253753,0.00008564742,0.00020952208,0.00013394207,0.0000706952,0.000029723957,0.0000017009359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047773738,0.000027083775,0.0013537494,0.00000911756,0.00000411651,0.000002066564,0.00041152694,0.000058934478,0.05813338,0.9372616,0.0000036292877,0.0027300206],"study_design_scores_gemma":[0.0009128082,0.00054177205,0.049157303,0.00001340353,0.000011331483,0.00024347033,0.000031121297,0.43706295,0.115443826,0.39608878,0.0001749481,0.00031828892],"about_ca_topic_score_codex":0.000004477256,"about_ca_topic_score_gemma":0.000002406816,"teacher_disagreement_score":0.5411728,"about_ca_system_score_codex":0.000002787925,"about_ca_system_score_gemma":0.000018663186,"threshold_uncertainty_score":0.17060347},"labels":[],"label_agreement":null},{"id":"W1883814555","doi":"10.1007/978-3-642-02614-0_15","title":"Reasoning with Generic Cases in the Arithmetic of Abstract Matrices","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Representation (politics); Computer science; Rectangle; Simple (philosophy); Matrix (chemical analysis); Matrix representation; Function (biology); Sequence (biology); Term (time); Theoretical computer science; Matrix multiplication; Algorithm; Arithmetic; Algebra over a field; Mathematics; Group (periodic table); Pure mathematics","score_opus":0.018333896347060043,"score_gpt":0.24484278651880026,"score_spread":0.22650889017174022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883814555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022162816,0.0017248457,0.9924817,0.0003459412,0.0002076062,0.00028142743,0.0000015568846,0.00005051181,0.0026901215],"genre_scores_gemma":[0.6499692,0.00009485598,0.34887803,0.00086134294,0.00013592078,0.000004925261,0.0000013200317,0.000012700743,0.00004166772],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973345,0.00003146646,0.00041605256,0.0009073835,0.0008347647,0.00047587958],"domain_scores_gemma":[0.99775046,0.00071956223,0.00035515262,0.0010060385,0.00010774462,0.00006103914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704999,0.0003756289,0.00043535762,0.00061247393,0.00013093706,0.00023359834,0.0030216868,0.00014417821,0.0000054188754],"category_scores_gemma":[0.000064391796,0.00023339626,0.00007177925,0.0010596429,0.00047958558,0.00045926447,0.00029579268,0.00062092446,0.0000048118395],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007864092,0.000047145695,0.00015486822,0.000035375917,0.000004929753,0.00077337015,0.000882337,0.07256772,0.0000448888,0.022468599,0.0000035302808,0.90300936],"study_design_scores_gemma":[0.0012112096,0.0025964119,0.024752691,0.0032239517,0.00004960872,0.0036928074,0.0000059832487,0.303643,0.0022040901,0.65379256,0.0019465312,0.002881171],"about_ca_topic_score_codex":0.00003665095,"about_ca_topic_score_gemma":0.00012514328,"teacher_disagreement_score":0.9001282,"about_ca_system_score_codex":0.00009218775,"about_ca_system_score_gemma":0.00027873373,"threshold_uncertainty_score":0.9517624},"labels":[],"label_agreement":null},{"id":"W1895874346","doi":"10.1109/ismvl.2015.34","title":"Hereditarily Rigid Relations: Dedicated to Professor I.G. Rosenberg on the Occasion of His 80-th Birthday","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Unary operation; Mathematics; Identity (music); Constant (computer programming); Identity function; Set (abstract data type); Relation (database); Pure mathematics; Combinatorics; Computer science; Data mining; Physics","score_opus":0.04572771165848033,"score_gpt":0.27249379065363827,"score_spread":0.22676607899515794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1895874346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35553357,0.00026015163,0.5700366,0.041898753,0.0018201763,0.0010989626,0.0000068799063,0.000614591,0.028730359],"genre_scores_gemma":[0.9712448,0.0000034284317,0.022506274,0.0012473509,0.00008039797,0.000028519178,0.0000027519848,0.000008342889,0.0048781233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987822,0.00010062518,0.00024613162,0.00028552825,0.00037557114,0.0002098985],"domain_scores_gemma":[0.9987332,0.00022401859,0.00010296958,0.00063023577,0.00016241522,0.0001471605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039944908,0.00011805574,0.00013407752,0.00007277541,0.000108650966,0.000028274939,0.0006938191,0.000062514766,0.00005030162],"category_scores_gemma":[0.0003298556,0.000066662105,0.000041047995,0.0006451552,0.00004562591,0.00027577378,0.00020651687,0.00014505746,0.00050447247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038009934,0.00020465434,0.0008565378,0.000005928876,0.000018038005,0.000011232791,0.0017143416,0.0011822229,0.0012675258,0.8790363,0.10739662,0.008268582],"study_design_scores_gemma":[0.0031959242,0.0039927564,0.03435058,0.0003150358,0.000041166517,0.000056125304,0.0020007438,0.058420837,0.04969798,0.6099287,0.23636924,0.001630889],"about_ca_topic_score_codex":0.00002774558,"about_ca_topic_score_gemma":0.000020035572,"teacher_disagreement_score":0.6157113,"about_ca_system_score_codex":0.000054204673,"about_ca_system_score_gemma":0.00010812079,"threshold_uncertainty_score":0.6484141},"labels":[],"label_agreement":null},{"id":"W189872696","doi":"10.1007/978-0-387-77487-9_8","title":"Elementary Properties of Algebraic Constructions","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Algebraic number; Mathematics; Algebra over a field; Calculus (dental); Computer science; Pure mathematics","score_opus":0.02802944685802695,"score_gpt":0.20418381671407082,"score_spread":0.17615436985604388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189872696","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017152414,0.002341973,0.06338567,0.0002680184,0.00044796022,0.00028090185,0.000008110703,0.0002463376,0.9328495],"genre_scores_gemma":[0.039149094,0.0019449113,0.092882544,0.00094439526,0.00020722556,0.00001784354,0.000014852181,0.000045487108,0.86479366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897116,0.000006524264,0.0003160798,0.00032353224,0.00022761212,0.0001550654],"domain_scores_gemma":[0.9991886,0.000016067825,0.00016009467,0.0005009787,0.000081281025,0.000052957923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000027595337,0.0002063322,0.00027511897,0.0001254788,0.00008733949,0.000012887894,0.0005405186,0.00010395208,0.00035086446],"category_scores_gemma":[0.000003680845,0.00015997754,0.00012179196,0.00003446637,0.00024886595,0.00020712367,0.0002336826,0.00016785643,0.00009584659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014706027,0.000009052001,0.000004287194,0.000019716766,0.000041068048,0.000011152634,0.000076719065,0.0000047320873,0.0001682027,0.97782075,0.0024504487,0.019392425],"study_design_scores_gemma":[0.00061702344,0.00034472664,0.000032317945,0.00033945983,0.000054310225,0.00067095103,0.000050922343,0.00040676916,0.011661611,0.42116094,0.563365,0.0012960074],"about_ca_topic_score_codex":0.0000071207637,"about_ca_topic_score_gemma":0.00000690788,"teacher_disagreement_score":0.5609145,"about_ca_system_score_codex":0.00002572129,"about_ca_system_score_gemma":0.00010190634,"threshold_uncertainty_score":0.6523695},"labels":[],"label_agreement":null},{"id":"W1902838168","doi":"10.1016/j.jpaa.2015.10.005","title":"Chu connections and back diagonals between <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">Q</mml:mi></mml:math>-distributors","year":2015,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Morphism; Diagonal; Algebra over a field; Combinatorics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.02255807380097516,"score_gpt":0.24189502179094247,"score_spread":0.2193369479899673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902838168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9740838,0.000735855,0.021426916,0.0009383085,0.0005369917,0.000057606896,0.000034131015,0.0000586443,0.0021277927],"genre_scores_gemma":[0.9923018,0.00020442852,0.0058638137,0.0006795666,0.00081142713,0.000021049183,0.000019080071,0.000037420345,0.00006141987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978499,0.000051262145,0.00062755606,0.00041989103,0.00056358724,0.00048780738],"domain_scores_gemma":[0.99811095,0.00027343226,0.0006335927,0.00040500716,0.00009516746,0.00048182879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006985109,0.00028514554,0.00033179362,0.000120425335,0.00036823077,0.0004201867,0.00056248694,0.0002869546,0.000035042496],"category_scores_gemma":[0.00012195457,0.0002800238,0.00019770535,0.00030660178,0.00019008742,0.0007375142,0.0003880066,0.00053184334,0.0001846084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005214864,0.000068021254,0.000065065025,0.00004886863,0.00014783801,0.000101389145,0.00054823444,0.0001033024,0.0006147156,0.99248254,0.0026912652,0.0030766053],"study_design_scores_gemma":[0.015006489,0.00608737,0.009935861,0.0012990797,0.0018266964,0.008854155,0.0069795633,0.3814389,0.0446066,0.37130836,0.14810948,0.0045474237],"about_ca_topic_score_codex":0.000012778647,"about_ca_topic_score_gemma":0.000008144598,"teacher_disagreement_score":0.6211742,"about_ca_system_score_codex":0.000017630391,"about_ca_system_score_gemma":0.00023316673,"threshold_uncertainty_score":0.9999652},"labels":[],"label_agreement":null},{"id":"W191831150","doi":"","title":"On toughness and fractional f-factors.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Mental toughness; Composite material; Materials science; Medicine; Physical therapy","score_opus":0.01748583521772142,"score_gpt":0.23772211262947615,"score_spread":0.22023627741175472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191831150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902302,0.00006544126,0.005763462,0.0002105033,0.0013200367,0.000052499312,5.3804206e-7,0.0001191129,0.0022382308],"genre_scores_gemma":[0.99868375,0.00001788689,0.0008078176,0.00026255418,0.000006941762,0.0000041270564,0.0000012655144,0.0000047864205,0.00021085153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999317,0.00002247447,0.000085923355,0.00024173778,0.00017939061,0.00015347719],"domain_scores_gemma":[0.99944705,0.00017076591,0.000037236445,0.00023849666,0.000030741794,0.00007569302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004012181,0.00009623242,0.000099242774,0.00004209344,0.00021267054,0.000024968496,0.0002367399,0.000041760944,0.000016873873],"category_scores_gemma":[0.00004008181,0.000081919425,0.00002476529,0.0001497047,0.00004925901,0.0003369595,0.00008551079,0.000118067874,0.000045545195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026645102,0.000053516836,0.0034825925,0.0000012643549,0.0000037656687,0.000021775779,0.0001440058,0.000019510084,0.000038206726,0.9949633,0.0007894291,0.0004799855],"study_design_scores_gemma":[0.00037015617,0.0001153279,0.055360083,0.00000454491,0.0000011085054,0.00003325828,0.0000076130736,0.0005323537,0.00062777434,0.9407832,0.0020228946,0.00014170642],"about_ca_topic_score_codex":0.0000042270494,"about_ca_topic_score_gemma":2.631106e-7,"teacher_disagreement_score":0.054180104,"about_ca_system_score_codex":0.000022440012,"about_ca_system_score_gemma":0.000025558302,"threshold_uncertainty_score":0.33405772},"labels":[],"label_agreement":null},{"id":"W1922059135","doi":"10.1109/ismvl.1989.37820","title":"Chain-based Ockham algebras","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Generalization; Distributive property; Negation; Class (philosophy); Heyting algebra; Algebra over a field; Boolean algebra; Chain (unit); Mathematics; Computer science; Pure mathematics; Discrete mathematics; Programming language; Artificial intelligence; Physics","score_opus":0.012583946138351305,"score_gpt":0.22632827191144197,"score_spread":0.21374432577309066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922059135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055045877,0.00006558326,0.9243885,0.0005270061,0.00019750146,0.00006382972,1.1802646e-7,0.00027234168,0.06898052],"genre_scores_gemma":[0.855999,0.0000012131184,0.13912559,0.0032169716,0.000016599803,0.000006944864,3.4208202e-7,0.000004498332,0.0016288304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992518,0.000037799837,0.000097673874,0.00024960894,0.00013140035,0.00023171256],"domain_scores_gemma":[0.9994019,0.00006071323,0.00002554001,0.00040451429,0.000026471449,0.000080808546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010830626,0.00008913782,0.00008171453,0.000046464847,0.00007738556,0.000044071603,0.0003687684,0.000031034622,0.00018918737],"category_scores_gemma":[0.0000447544,0.000069578986,0.000042602307,0.00027070518,0.0000220045,0.00015386411,0.000030066672,0.000061184866,0.00027761457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.9936685e-7,0.000026515607,0.00025028037,0.0000015056739,0.000001618595,0.000008657752,0.000020729749,0.00021159463,0.00021257863,0.9924362,0.00047992935,0.0063500414],"study_design_scores_gemma":[0.0015912026,0.00031504178,0.0030556426,0.000014251826,0.000005840873,0.00004382324,0.00005404199,0.059755236,0.092423536,0.6450884,0.19665292,0.0010000707],"about_ca_topic_score_codex":0.0000018054035,"about_ca_topic_score_gemma":0.000002326207,"teacher_disagreement_score":0.85049444,"about_ca_system_score_codex":0.000014390726,"about_ca_system_score_gemma":0.000049562066,"threshold_uncertainty_score":0.35682663},"labels":[],"label_agreement":null},{"id":"W1924161485","doi":"10.1142/s0218196704001748","title":"DETERMINING WHETHER ${\\mathsf V}({\\bf A})$ HAS A MODEL COMPANION IS UNDECIDABLE","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Undecidable problem; Mathematics; Variety (cybernetics); Class (philosophy); Algebra over a field; Discrete mathematics; Pure mathematics; Combinatorics; Decidability; Computer science","score_opus":0.033980348212504216,"score_gpt":0.29141136943402707,"score_spread":0.25743102122152284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924161485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26700228,0.00011249484,0.72977203,0.0024621314,0.00038670131,0.00003965849,9.310222e-7,0.000024857127,0.0001988989],"genre_scores_gemma":[0.88940734,0.000033334094,0.10935539,0.0010508011,0.00011974585,0.0000012106935,0.0000014098813,0.000007627611,0.000023138387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998748,0.000025958889,0.0004084469,0.00018652799,0.00048800345,0.00014303827],"domain_scores_gemma":[0.99898905,0.00006489542,0.00037215077,0.000089509274,0.0003944945,0.00008993193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018618313,0.00012780174,0.00017161467,0.00021373271,0.00010601031,0.00033600256,0.0005137777,0.0000496036,0.0000053970493],"category_scores_gemma":[0.000023295745,0.00011207147,0.000083305036,0.00012357967,0.000050356433,0.0011496935,0.000118994954,0.0001538691,0.000009805704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070885726,0.00032829455,0.0011941127,0.00001639196,0.00022619257,0.00019478043,0.0079156635,0.5817773,0.002784339,0.22346514,0.00048926653,0.18153764],"study_design_scores_gemma":[0.0014367135,0.00016509727,0.0021971306,0.00009783977,0.0000108897675,0.00055376935,0.000088250155,0.42920163,0.0011099278,0.56477565,0.00019893625,0.00016415052],"about_ca_topic_score_codex":0.0000043978985,"about_ca_topic_score_gemma":0.0000015373475,"teacher_disagreement_score":0.62240505,"about_ca_system_score_codex":0.00009492644,"about_ca_system_score_gemma":0.00014314408,"threshold_uncertainty_score":0.4570142},"labels":[],"label_agreement":null},{"id":"W193563330","doi":"","title":"On A Characterization of Balanced Matroids.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Characterization (materials science); Mathematics; Combinatorics; Nanotechnology; Materials science","score_opus":0.008279321690776286,"score_gpt":0.2237761111528669,"score_spread":0.21549678946209064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193563330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9724319,0.000010580541,0.024251897,0.00022222052,0.00083457946,0.000085569074,8.0849213e-7,0.000101656566,0.002060768],"genre_scores_gemma":[0.9988357,0.000018507522,0.00074760325,0.00022158741,0.0000045539355,0.0000066261014,0.00000435216,0.000005340472,0.00015574842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993407,0.0000262654,0.00014213382,0.00018649054,0.00015453446,0.00014985235],"domain_scores_gemma":[0.99943787,0.00003936764,0.000091856746,0.00034359135,0.00004588057,0.000041435553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006445012,0.000081697544,0.00012297538,0.00005503487,0.000041794425,0.000019470037,0.00036771587,0.00003496311,0.000015930946],"category_scores_gemma":[0.000023811417,0.00007459206,0.00003395118,0.00031820853,0.000018866796,0.00024503193,0.000061790335,0.000062262545,0.000053109357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008319066,0.00007083764,0.00081041385,0.0000032393116,0.0000033619062,0.0000070788733,0.00006931671,0.000010819225,0.021113183,0.9739669,0.000035075867,0.003901434],"study_design_scores_gemma":[0.00065299997,0.00024584777,0.031336453,0.000022096712,0.000002139249,0.000008065248,0.0000032822131,0.0027499383,0.009499519,0.9545746,0.0007604862,0.00014461484],"about_ca_topic_score_codex":0.0000013584779,"about_ca_topic_score_gemma":1.4410816e-7,"teacher_disagreement_score":0.030526038,"about_ca_system_score_codex":0.000018798013,"about_ca_system_score_gemma":0.000014918172,"threshold_uncertainty_score":0.3041776},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Distributive property; Planar; Combinatorics; Mathematics; Distributive lattice; Computer science; Pure mathematics","score_opus":0.027266026324679008,"score_gpt":0.2746508667821295,"score_spread":0.24738484045745052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963598054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43160287,0.0030307819,0.5310137,0.0043125455,0.0021908826,0.000588735,0.00004574224,0.0006488899,0.02656581],"genre_scores_gemma":[0.96762633,0.0000498157,0.030984689,0.00059343525,0.00024968275,0.000014899402,0.00000999614,0.000019751928,0.00045138857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846596,0.000082266466,0.0002524407,0.00035995682,0.00035269756,0.00048666255],"domain_scores_gemma":[0.99856687,0.00030902703,0.00015050992,0.0007249483,0.00009504997,0.00015359938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002757596,0.00020765798,0.0002495956,0.00014866877,0.00018871512,0.000044448698,0.0006080627,0.000121436846,0.000089830035],"category_scores_gemma":[0.00014995445,0.00017059754,0.000074105374,0.00056245073,0.00007695486,0.00071519666,0.00008563826,0.00023397371,0.00023615536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008854272,0.0016088132,0.0547708,0.00026323,0.00035202937,0.000069817186,0.005671402,0.005295278,0.019122804,0.86740494,0.006987042,0.038365282],"study_design_scores_gemma":[0.0046147155,0.0022472204,0.16149752,0.0007156759,0.0003062643,0.00024644495,0.0009260192,0.0325875,0.11689485,0.13307579,0.5425383,0.004349744],"about_ca_topic_score_codex":0.00005324796,"about_ca_topic_score_gemma":0.000026389665,"teacher_disagreement_score":0.73432916,"about_ca_system_score_codex":0.000029880253,"about_ca_system_score_gemma":0.000034446293,"threshold_uncertainty_score":0.6956766},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032301626318107124,"score_gpt":0.3002791238380374,"score_spread":0.2679774975199303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963602153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57401603,0.00009819144,0.40861058,0.01630421,0.00044495304,0.0000544228,0.000003339635,0.000013254315,0.00045502943],"genre_scores_gemma":[0.99345064,0.000023050252,0.0047268635,0.0016886389,0.00009873844,4.099641e-7,0.0000021750357,0.0000017131391,0.000007774279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915063,0.00004977693,0.000295979,0.00008469215,0.0003498283,0.00006907008],"domain_scores_gemma":[0.999047,0.00019674978,0.00034287563,0.00007140239,0.00030402865,0.000037939084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016723477,0.00006764202,0.000108700195,0.00012655942,0.00006083825,0.0000617854,0.00043670202,0.000020477906,0.0000098211085],"category_scores_gemma":[0.00005171297,0.000045657547,0.000062854306,0.00009062862,0.00010132614,0.0004442495,0.00003361728,0.000112940295,0.0000034432126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018879038,0.00007036714,0.000038111182,9.135228e-7,0.00002512899,0.000010511652,0.00017244335,0.0014889932,0.00039854806,0.9814778,0.00025725065,0.016041037],"study_design_scores_gemma":[0.00032441335,0.00029881028,0.02786759,0.000033857326,0.0000042923693,0.00010554062,0.000029564351,0.010953266,0.00076216913,0.9595235,0.000047624817,0.000049401944],"about_ca_topic_score_codex":9.459046e-7,"about_ca_topic_score_gemma":2.0346026e-7,"teacher_disagreement_score":0.41943464,"about_ca_system_score_codex":0.000020371584,"about_ca_system_score_gemma":0.000031691252,"threshold_uncertainty_score":0.18618608},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022406497267481205,"score_gpt":0.2806372452550117,"score_spread":0.2582307479875305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964472717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14756829,0.0026380874,0.5622276,0.008349626,0.00049346377,0.00054195756,0.000008096589,0.0005367156,0.2776362],"genre_scores_gemma":[0.95366275,0.000048100253,0.045454152,0.0003577976,0.00007588112,0.000016500764,0.0000011266562,0.0000033380181,0.00038033005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911773,0.00003587085,0.00019790046,0.00027671843,0.00017433793,0.00019744392],"domain_scores_gemma":[0.99927044,0.00009990958,0.000085189306,0.00042850693,0.000056977166,0.00005899418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090018795,0.00008944515,0.00014568216,0.000056453693,0.00010709709,0.000017027809,0.000518484,0.000031291278,0.00007003408],"category_scores_gemma":[0.00006738936,0.00007068959,0.000060333114,0.00036711062,0.00007218263,0.00024710677,0.00020774997,0.000077027864,0.00012621525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027335727,0.00013887329,0.0022105905,0.000004662068,0.000018470448,0.000010408018,0.0007367485,0.0006427734,0.0008478049,0.95770496,0.0018388317,0.03584317],"study_design_scores_gemma":[0.001706017,0.0006342376,0.32583264,0.00002407112,0.000042691972,0.000048525704,0.00060565205,0.0036552148,0.009329366,0.5824766,0.07472108,0.00092390034],"about_ca_topic_score_codex":0.0000072513217,"about_ca_topic_score_gemma":0.000013112842,"teacher_disagreement_score":0.80609447,"about_ca_system_score_codex":0.00001738227,"about_ca_system_score_gemma":0.000035519137,"threshold_uncertainty_score":0.2882638},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029195700140188536,"score_gpt":0.23872308345377524,"score_spread":0.2095273833135867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965001312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079693645,0.00018929529,0.8711616,0.00058787444,0.00014141579,0.000075517215,4.950912e-7,0.00014851439,0.048001673],"genre_scores_gemma":[0.9407535,0.000019336794,0.057702806,0.0004532785,0.000020419002,0.00000821565,4.1726366e-7,0.0000038387725,0.00103814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963,0.000009712917,0.000055160443,0.00016804508,0.000034820703,0.00010228752],"domain_scores_gemma":[0.9996617,0.000022868117,0.000018030398,0.00023438931,0.000025983241,0.000037036265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003679817,0.00004931607,0.00004669483,0.000022879989,0.000065626096,0.000022662862,0.0001785351,0.000017520244,0.000068663576],"category_scores_gemma":[0.000017169952,0.00003617489,0.000011262546,0.0001411248,0.000030958574,0.00025448392,0.00011033563,0.00004326399,0.00004611561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054395173,0.000105122286,0.013022152,0.000010676902,0.000022355853,0.000018487379,0.01685938,0.000017981976,0.002123571,0.7820012,0.0022032077,0.18361045],"study_design_scores_gemma":[0.00075340766,0.00016292003,0.15753357,0.00002152557,0.000007361484,0.000104819934,0.000730181,0.010069656,0.014374638,0.7732766,0.04234521,0.00062008237],"about_ca_topic_score_codex":0.000013327023,"about_ca_topic_score_gemma":0.00000397798,"teacher_disagreement_score":0.8610599,"about_ca_system_score_codex":0.000002749531,"about_ca_system_score_gemma":0.0000082741135,"threshold_uncertainty_score":0.14751692},"labels":[],"label_agreement":null},{"id":"W1965558340","doi":"10.1142/s1005386707000193","title":"A Characterization of P-Compatible Varieties","year":2007,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Variety (cybernetics); Algebraic variety; Normalization (sociology); Partition (number theory); Pure mathematics; Algebra over a field; Compatibility (geochemistry); Algebraic number; Combinatorics; Discrete mathematics","score_opus":0.009111031601453183,"score_gpt":0.22811233300535994,"score_spread":0.21900130140390675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965558340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38969612,0.00002998196,0.60690236,0.00015130744,0.00031884073,0.00010708845,0.0000013439926,0.000105714644,0.0026872386],"genre_scores_gemma":[0.98622036,0.000010880277,0.012858017,0.00033989758,0.00006316727,0.0000061200617,0.0000073839137,0.000008188178,0.00048599992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988854,0.000025944373,0.0003077993,0.000247695,0.00024910193,0.00028408715],"domain_scores_gemma":[0.9991504,0.00008193084,0.0001689434,0.00040901374,0.00011669189,0.00007300658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032103408,0.00011931225,0.00018788774,0.00013813737,0.000083616964,0.000039078343,0.00052414305,0.00006080657,0.000032990265],"category_scores_gemma":[0.00003049559,0.00011175174,0.000057901125,0.0006865668,0.000060336304,0.0005415639,0.00014769599,0.00007835356,0.000034072884],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021050571,0.00010121285,0.0017614772,0.000022035925,0.000016534026,0.000011900222,0.00090726215,0.000009528647,0.25812474,0.72845566,0.00008359944,0.010485031],"study_design_scores_gemma":[0.0011519052,0.00049900566,0.14916198,0.00004121494,0.000019767585,0.000036569723,0.0001398778,0.0030942743,0.71745694,0.11386816,0.013848292,0.000682034],"about_ca_topic_score_codex":0.000008007246,"about_ca_topic_score_gemma":0.000007703064,"teacher_disagreement_score":0.6145875,"about_ca_system_score_codex":0.000022923108,"about_ca_system_score_gemma":0.000052018757,"threshold_uncertainty_score":0.45571035},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Planar; Simple (philosophy); Product (mathematics); Combinatorics; Computer science; Geometry","score_opus":0.01666100391834197,"score_gpt":0.22616641193738243,"score_spread":0.20950540801904047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966370644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40011916,0.00034303995,0.53207856,0.004564309,0.0008666391,0.00034263072,0.00001602842,0.0013593703,0.060310256],"genre_scores_gemma":[0.9801201,0.00008147158,0.016790228,0.0018009217,0.000087437445,0.0000022617216,0.0000066703856,0.000013264667,0.0010976243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880356,0.00005089372,0.00012418912,0.00042603182,0.0002730768,0.00032225478],"domain_scores_gemma":[0.9990167,0.00013079637,0.00007218317,0.00060724054,0.000041316285,0.0001317714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000628277,0.00017094181,0.0001643709,0.00013957948,0.00025413433,0.00003123842,0.00083711924,0.00007476032,0.000045919653],"category_scores_gemma":[0.000027532697,0.00015646781,0.000078940044,0.0004199116,0.000090336136,0.0006728491,0.000099983314,0.00016068842,0.0003254203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002332254,0.000111660396,0.0005348561,0.000007869386,0.00003642728,0.0012550439,0.002438649,0.0003789596,0.00087030156,0.97882825,0.006067802,0.00944685],"study_design_scores_gemma":[0.005752953,0.002251054,0.024777554,0.00019257894,0.00008593578,0.0009146309,0.00057432894,0.034480676,0.030553266,0.23160923,0.6651528,0.0036550292],"about_ca_topic_score_codex":0.000038637594,"about_ca_topic_score_gemma":0.0000092879345,"teacher_disagreement_score":0.747219,"about_ca_system_score_codex":0.00005404274,"about_ca_system_score_gemma":0.000053617652,"threshold_uncertainty_score":0.63805723},"labels":[],"label_agreement":null},{"id":"W1966402460","doi":"10.1016/j.apal.2008.09.019","title":"Definable principal congruences and solvability","year":2008,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Congruence relation; Mathematics; Principal (computer security); Pure mathematics; Discrete mathematics; Computer science","score_opus":0.06344789465245204,"score_gpt":0.2813684653132636,"score_spread":0.21792057066081155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966402460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9771578,0.0014005982,0.01197287,0.00080857985,0.00003320415,0.00014478392,0.0000017827282,0.00005913167,0.008421266],"genre_scores_gemma":[0.9914446,0.0004980814,0.0071133235,0.0008458367,0.000019713621,0.000010177281,7.9814964e-7,0.0000024207798,0.00006506511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916244,0.000016538985,0.0001635581,0.0003137744,0.00011981869,0.00022387347],"domain_scores_gemma":[0.99950796,0.00007212383,0.0000770811,0.00021627329,0.00004496713,0.00008160312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017662116,0.00011116559,0.00020475793,0.000032594657,0.00015244084,0.000020471653,0.0002246593,0.00005728233,0.0000072047155],"category_scores_gemma":[0.000020492389,0.0000837278,0.00002674994,0.00013576674,0.00025263338,0.00017157957,0.00017211765,0.00008068397,0.000004392414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014386444,0.000079038684,0.0052128616,0.00004299335,0.000011369168,0.000014853906,0.0005462052,0.00005522814,0.0011149577,0.9777843,0.00033749317,0.014786314],"study_design_scores_gemma":[0.00040583662,0.00033375525,0.07416921,0.00001116091,0.000005956435,0.00008361412,0.0001621392,0.0003607634,0.012627576,0.90731174,0.0041746697,0.00035359224],"about_ca_topic_score_codex":0.000006950348,"about_ca_topic_score_gemma":0.0000042000456,"teacher_disagreement_score":0.07047257,"about_ca_system_score_codex":0.0000016003459,"about_ca_system_score_gemma":0.000024534822,"threshold_uncertainty_score":0.34143206},"labels":[],"label_agreement":null},{"id":"W1966739573","doi":"10.1007/s00012-012-0216-x","title":"Multi-algebras as tolerance quotients of algebras","year":2012,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Algebra over a field; Quotient; Subalgebra; Cellular algebra; Jordan algebra; Algebra representation; Pure mathematics; Division algebra; Quotient algebra","score_opus":0.016911401736501207,"score_gpt":0.2473548434995312,"score_spread":0.23044344176303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966739573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76279205,0.0014420105,0.2246533,0.00041666013,0.0015437062,0.00041642142,0.0000149136495,0.00050481706,0.008216126],"genre_scores_gemma":[0.9536002,0.000067466375,0.044503983,0.0007322626,0.00012048275,0.000007037968,0.000010443575,0.000029041426,0.0009290753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9975831,0.00013156986,0.00041557354,0.00053427427,0.0004995051,0.0008360083],"domain_scores_gemma":[0.99797577,0.00014687506,0.00029444002,0.0010361297,0.00016384744,0.00038294785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025244168,0.00034545505,0.00041359942,0.00025856256,0.0001759061,0.000047613314,0.0015222867,0.0001563783,0.00019700409],"category_scores_gemma":[0.00010054376,0.00033552185,0.00019988463,0.00095779524,0.00019795485,0.0024119532,0.00048495407,0.00023532301,0.0004215998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030492229,0.0006383748,0.018314255,0.00004259647,0.000100015735,0.000037686743,0.004327433,0.00010314455,0.0052485378,0.95829284,0.001253161,0.011611449],"study_design_scores_gemma":[0.019228034,0.0024787677,0.32461077,0.0006977515,0.00046565654,0.0006145679,0.005330402,0.018831193,0.28828484,0.13965304,0.19117697,0.008628013],"about_ca_topic_score_codex":0.00013126068,"about_ca_topic_score_gemma":0.0000116453075,"teacher_disagreement_score":0.8186398,"about_ca_system_score_codex":0.00009152645,"about_ca_system_score_gemma":0.0000933763,"threshold_uncertainty_score":0.9999097},"labels":[],"label_agreement":null},{"id":"W1967244337","doi":"10.1107/s0108767305088902","title":"On the incompleteness of atomic models","year":2005,"lang":"en","type":"article","venue":"Acta Crystallographica Section A Foundations of Crystallography","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Biological and Environmental Research; National Institutes of Health; U.S. Department of Energy","keywords":"Computer science","score_opus":0.02011911387309644,"score_gpt":0.24264595680421233,"score_spread":0.22252684293111588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967244337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4257521,0.00007615191,0.5663851,0.0025462399,0.00022663875,0.0004546758,0.0000141795135,0.00020862003,0.0043363334],"genre_scores_gemma":[0.9900422,0.00009711278,0.0092638815,0.0004103389,0.00005739906,0.000077020304,0.000014012734,0.000020588717,0.00001740953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976362,0.00019967608,0.0007381189,0.00050895015,0.00055779633,0.00035923716],"domain_scores_gemma":[0.9970713,0.00063894555,0.0005795851,0.0012259119,0.0003855283,0.00009871088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004971434,0.00029282013,0.0003736391,0.0012270572,0.000392252,0.00008406257,0.0013963738,0.00014101194,0.00006748567],"category_scores_gemma":[0.00007939933,0.0002246338,0.0004953854,0.003169682,0.00058315013,0.0011559484,0.00020360366,0.00030514598,6.229735e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049588554,0.00051138934,0.00035937756,0.00002936728,0.00019649089,8.296014e-7,0.00040831498,0.009515252,0.075958386,0.9107692,0.00041865822,0.0017831469],"study_design_scores_gemma":[0.0012014506,0.00072524406,0.005742561,0.00009347985,0.00007566049,0.00003981565,0.00027630766,0.050200075,0.00073964224,0.9076649,0.0325504,0.0006904507],"about_ca_topic_score_codex":0.00002204195,"about_ca_topic_score_gemma":0.00007308388,"teacher_disagreement_score":0.56429017,"about_ca_system_score_codex":0.000030355084,"about_ca_system_score_gemma":0.00007871707,"threshold_uncertainty_score":0.91603005},"labels":[],"label_agreement":null},{"id":"W1970529442","doi":"10.1007/s00012-006-1988-7","title":"The inflation class operator","year":2007,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge; University of Calgary","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Operator (biology); Class (philosophy); Operator algebra; Algebraic number; Shift operator; Algebra over a field; Pure mathematics; Identity (music); Monoid; Quasinormal operator; Compact operator; Combinatorics; Discrete mathematics; Finite-rank operator; Computer science; Mathematical analysis; Extension (predicate logic); Chemistry","score_opus":0.00699703669167074,"score_gpt":0.22218824491310019,"score_spread":0.21519120822142945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970529442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117795676,0.00023790328,0.8481153,0.0029521512,0.00068620074,0.00018021476,0.0000010291432,0.00035784766,0.029673627],"genre_scores_gemma":[0.993155,0.000034415672,0.005022324,0.00073365116,0.00009335015,0.0000011248229,0.0000021379205,0.0000068561126,0.000951138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914074,0.00003392067,0.00013602329,0.00021238194,0.00018558027,0.00029137472],"domain_scores_gemma":[0.9991169,0.00022488926,0.00005826884,0.00043859746,0.00007550166,0.00008585993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031898796,0.00009497937,0.000068141264,0.000057278194,0.00038209514,0.00011746921,0.0007344228,0.000049907605,0.0000115736675],"category_scores_gemma":[0.00004343509,0.000067307505,0.000042996824,0.00044137106,0.00007251229,0.0006966142,0.00015546786,0.00011181282,0.0000898064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005219,0.000007080104,0.00026562903,6.828405e-7,0.000007910751,0.000020707595,0.00030825852,0.000034863006,0.0005235479,0.96000767,0.0007786539,0.038039785],"study_design_scores_gemma":[0.00096411555,0.00017381004,0.018903973,0.000013735813,0.000014399134,0.000032300442,0.0009160773,0.0065364586,0.013720464,0.09394994,0.8641912,0.00058355083],"about_ca_topic_score_codex":0.000014899514,"about_ca_topic_score_gemma":0.00006867613,"teacher_disagreement_score":0.8753593,"about_ca_system_score_codex":0.000060545357,"about_ca_system_score_gemma":0.000041048363,"threshold_uncertainty_score":0.29388055},"labels":[],"label_agreement":null},{"id":"W1971739409","doi":"10.1016/j.jlap.2010.07.018","title":"Cardinality functions in allegories","year":2010,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Cardinality (data modeling); Allegory; Injective function; Mathematics; Axiom; Surjective function; Context (archaeology); Uniqueness; Function (biology); Discrete mathematics; Computer science","score_opus":0.01280502869069286,"score_gpt":0.24862872365524233,"score_spread":0.23582369496454947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971739409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66655666,0.0013373839,0.32681224,0.0037957919,0.0006866248,0.00013009676,2.773674e-7,0.000041461757,0.0006394501],"genre_scores_gemma":[0.98123866,0.00004874323,0.018344687,0.00018799116,0.00012797535,0.000002198539,1.4017895e-7,0.0000030578067,0.000046551424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913,0.00008874187,0.0002862844,0.000104324696,0.0001732179,0.0002174302],"domain_scores_gemma":[0.9992573,0.00019935869,0.00019097952,0.00020502684,0.00007249409,0.000074843534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012015571,0.00009804357,0.00017648247,0.00007282787,0.00016896673,0.000077494886,0.00048365805,0.000045960882,0.0000064508695],"category_scores_gemma":[0.00013079708,0.000054947428,0.000058585778,0.00027785476,0.00015782105,0.00040643185,0.00013502037,0.0005206804,0.0000024617646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003949652,0.00013835468,0.013201291,0.000018476872,0.000045749122,0.000086819,0.0025074726,0.00007380333,0.0019218179,0.44386122,0.00014279799,0.53796273],"study_design_scores_gemma":[0.0013972976,0.0008981025,0.06738612,0.000058495527,0.00006845752,0.0032736796,0.0029412515,0.000900199,0.00048413782,0.8816898,0.040405348,0.0004971106],"about_ca_topic_score_codex":0.000010254939,"about_ca_topic_score_gemma":0.00003316284,"teacher_disagreement_score":0.5374656,"about_ca_system_score_codex":0.000008957809,"about_ca_system_score_gemma":0.000042426713,"threshold_uncertainty_score":0.22621262},"labels":[],"label_agreement":null},{"id":"W1971891649","doi":"10.1093/analys/anu067","title":"Intensionality and variable objects","year":2014,"lang":"en","type":"article","venue":"Analysis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Variable (mathematics); Media studies; Regional science; Political science; Sociology; Library science; Computer science; Mathematics","score_opus":0.0047214807477269465,"score_gpt":0.20463774666156442,"score_spread":0.1999162659138375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971891649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026296195,0.00005382588,0.96926284,0.0002690769,0.000030458665,0.000012459811,2.2246272e-7,0.000048804777,0.0040261284],"genre_scores_gemma":[0.948633,0.0000050237595,0.050153233,0.00094754336,0.000017007824,0.0000012513874,0.0000014294168,0.0000011348623,0.00024034937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994796,0.000038473027,0.00007647597,0.00021464164,0.000088759334,0.000102030695],"domain_scores_gemma":[0.9994859,0.00008958446,0.000029660087,0.00029830652,0.000046362275,0.000050169896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019238365,0.000049403123,0.00012899001,0.00007968418,0.00006497919,0.000039912775,0.00017463342,0.000019488036,0.000021652188],"category_scores_gemma":[0.00008005521,0.000038683986,0.000044866778,0.0007845684,0.00001991781,0.00015300667,0.000117262935,0.000038196704,0.00001623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016959809,0.000030897292,0.017211158,0.000005334145,0.00028840976,0.0000034756806,0.0001973616,0.0015563604,0.00050173566,0.95763904,0.00022175201,0.02234279],"study_design_scores_gemma":[0.00017408426,0.00004622182,0.069269665,0.0000039302463,0.00027265048,0.0000053515455,0.000024877414,0.54653466,0.0003601761,0.37759355,0.005479773,0.00023504776],"about_ca_topic_score_codex":0.0000374772,"about_ca_topic_score_gemma":0.00001619307,"teacher_disagreement_score":0.9223368,"about_ca_system_score_codex":0.000004898975,"about_ca_system_score_gemma":0.0000062542026,"threshold_uncertainty_score":0.15774871},"labels":[],"label_agreement":null},{"id":"W1972299658","doi":"10.1142/s0218196709005342","title":"THE DIMENSION OF A VARIETY AND THE KERNEL OF A HYPERSUBSTITUTION","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Variety (cybernetics); Dimension (graph theory); Kernel (algebra); Pure mathematics; Cardinality (data modeling); Complex dimension; Dimension function; Type (biology); Class (philosophy); Connection (principal bundle); Algebra over a field; Discrete mathematics; Hausdorff dimension; Computer science; Geometry; Artificial intelligence","score_opus":0.007575781180236461,"score_gpt":0.25167290188888297,"score_spread":0.2440971207086465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972299658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52860916,0.0008408351,0.46749955,0.0026899267,0.00022977086,0.000044818036,3.3804537e-7,0.0000035962805,0.00008199185],"genre_scores_gemma":[0.99442536,0.0003064883,0.0050559714,0.00016137064,0.000045143257,3.0200098e-7,3.6541655e-7,0.0000010930262,0.0000039207926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992313,0.00004521465,0.0003125975,0.00006717907,0.00029284135,0.00005089472],"domain_scores_gemma":[0.99885136,0.00027085582,0.00042116403,0.000057449273,0.00037688436,0.000022312755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003769285,0.000053203774,0.000110114874,0.0000530527,0.000069593756,0.00004483982,0.00026164652,0.000019696741,3.3864177e-7],"category_scores_gemma":[0.00007207838,0.000028203105,0.000049756236,0.00008274643,0.00014520955,0.00027062974,0.000046929377,0.00007597455,1.502864e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022858691,0.000041541516,0.0002483924,0.0000027477047,0.000054046162,0.000004363256,0.0011093178,0.0017112697,0.0011747939,0.8153086,0.000028267732,0.18008812],"study_design_scores_gemma":[0.002868822,0.00040355686,0.058408543,0.00008123323,0.000028253644,0.00038747967,0.00019604445,0.10089005,0.0017037092,0.8348112,0.00013867528,0.00008244262],"about_ca_topic_score_codex":0.0000042878733,"about_ca_topic_score_gemma":6.0722795e-7,"teacher_disagreement_score":0.46581617,"about_ca_system_score_codex":0.000010516227,"about_ca_system_score_gemma":0.000031390035,"threshold_uncertainty_score":0.11500893},"labels":[],"label_agreement":null},{"id":"W1974118124","doi":"10.1016/j.jalgebra.2004.07.015","title":"Construction of regulating subgroups in almost completely decomposable groups","year":2004,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Constructive; Maple; Integer (computer science); Group (periodic table); Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Computer science; Programming language","score_opus":0.01384596014498012,"score_gpt":0.24057934465252925,"score_spread":0.22673338450754912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974118124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83104074,0.00029941095,0.16771032,0.0005095976,0.00020551952,0.000043391985,3.1240558e-7,0.000010369817,0.00018034983],"genre_scores_gemma":[0.8035879,0.0000335751,0.19625811,0.00006673626,0.000047126698,3.1431793e-7,1.9815816e-7,0.0000041577487,0.0000018389317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885833,0.000042171745,0.00056750816,0.00013126066,0.0002264571,0.00017424193],"domain_scores_gemma":[0.9990658,0.000095259646,0.00050620857,0.000152923,0.00010665488,0.00007312855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034176957,0.00009657236,0.000277559,0.00019834941,0.000049863007,0.000033274307,0.00032873437,0.000045061675,0.0000058261016],"category_scores_gemma":[0.00005800023,0.00008385091,0.00006329055,0.000356867,0.000092397284,0.0007449828,0.000091693175,0.00019937157,0.0000016099226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004372715,0.00012860041,0.014997003,0.00004180368,0.000027426991,0.00008918473,0.0011853416,0.0041925497,0.01254141,0.93083787,0.000014471115,0.03590063],"study_design_scores_gemma":[0.0025726582,0.0006374922,0.08257193,0.00029987813,0.000011723671,0.0025454792,0.00043468457,0.0023665088,0.013147593,0.8950413,0.00012276325,0.00024797634],"about_ca_topic_score_codex":0.000010794447,"about_ca_topic_score_gemma":0.000009672851,"teacher_disagreement_score":0.067574926,"about_ca_system_score_codex":0.000058891717,"about_ca_system_score_gemma":0.000063896594,"threshold_uncertainty_score":0.34193408},"labels":[],"label_agreement":null},{"id":"W1974513041","doi":"10.1142/s0218196704001785","title":"INVOLUTED SEMILATTICES AND UNCERTAINTY IN TERNARY ALGEBRAS","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semilattice; Mathematics; Ternary operation; Involution (esoterism); Binary operation; Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Semigroup; Computer science","score_opus":0.012103922351947892,"score_gpt":0.2727965309903978,"score_spread":0.2606926086384499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974513041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74550575,0.00056909554,0.2513494,0.0020895086,0.0003572598,0.000040963307,6.6049455e-7,0.000015174702,0.0000721905],"genre_scores_gemma":[0.9779823,0.00019136856,0.021194661,0.00051458366,0.00010480214,0.0000010394025,0.0000019723625,0.000004377391,0.0000049051787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899817,0.00003756978,0.00037005253,0.00016780506,0.0003111071,0.00011528589],"domain_scores_gemma":[0.99930894,0.00010002011,0.00026150438,0.00005589256,0.00019769165,0.00007596346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020274585,0.00010456554,0.00014949772,0.00028503724,0.000038054346,0.00013528895,0.00034120277,0.000042935106,0.00000177748],"category_scores_gemma":[0.00004267943,0.00009081033,0.000034645134,0.00015408263,0.00005309115,0.0009649512,0.00012007852,0.00015507897,0.0000017295165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022202375,0.00042587763,0.031458087,0.000037355443,0.0002395255,0.0010779653,0.0071856705,0.11184753,0.0023116427,0.478149,0.000093943476,0.36695138],"study_design_scores_gemma":[0.002563536,0.00028912278,0.1444924,0.00017429353,0.0000092410655,0.001013149,0.00021977883,0.039897267,0.00023235704,0.810743,0.00015815739,0.0002077228],"about_ca_topic_score_codex":0.000025506037,"about_ca_topic_score_gemma":0.000013543649,"teacher_disagreement_score":0.36674365,"about_ca_system_score_codex":0.00007150262,"about_ca_system_score_gemma":0.000067405716,"threshold_uncertainty_score":0.3703138},"labels":[],"label_agreement":null},{"id":"W1974524636","doi":"10.1007/s11083-008-9103-7","title":"Abelian ℓ-Groups with Strong Unit and Perfect MV-Algebras","year":2008,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Abelian group; Mathematics; Rank of an abelian group; Unit (ring theory); Functor; Rank (graph theory); Elementary abelian group; Pure mathematics; Class (philosophy); Unit interval; Group (periodic table); Algebra over a field; Combinatorics; Computer science; Physics","score_opus":0.0173793824275137,"score_gpt":0.22306140824120535,"score_spread":0.20568202581369166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974524636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7251464,0.0002683602,0.2693354,0.0004126984,0.000061879575,0.00008557668,5.0205193e-7,0.00013593303,0.0045532244],"genre_scores_gemma":[0.9731625,0.00003838241,0.025553737,0.00031469317,0.000038575865,0.0000059612903,0.0000011274299,0.000008821231,0.0008762227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999254,0.000023670515,0.000075091135,0.0002776799,0.00013684847,0.0002327258],"domain_scores_gemma":[0.99951684,0.000033633958,0.00003059983,0.0002893596,0.000045965913,0.00008361477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004624562,0.00011553901,0.0001081774,0.000047664995,0.00020213758,0.00003877049,0.00024109126,0.0000330932,0.000044808505],"category_scores_gemma":[0.0000100174175,0.00008366605,0.00001363243,0.00033867374,0.00009443766,0.00035999503,0.00009473447,0.00011116081,0.000061019047],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059306876,0.00030696965,0.20738912,0.000055982444,0.000108323395,0.000718068,0.0053356234,0.000986754,0.0012134113,0.6630412,0.0015487159,0.119236566],"study_design_scores_gemma":[0.00767207,0.0034583418,0.8092408,0.00015987115,0.000063467036,0.0032314754,0.0007933296,0.032719124,0.0036431372,0.04574913,0.08991307,0.0033561806],"about_ca_topic_score_codex":0.000010108267,"about_ca_topic_score_gemma":0.000017441349,"teacher_disagreement_score":0.61729205,"about_ca_system_score_codex":0.000007851086,"about_ca_system_score_gemma":0.00004160645,"threshold_uncertainty_score":0.34118024},"labels":[],"label_agreement":null},{"id":"W1976341314","doi":"10.1006/aama.1999.0661","title":"The Strong Independence Theorem for Automorphism Groups and Congruence Lattices of Arbitrary Lattices","year":2000,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Automorphism; Lattice (music); Algebraic number; Congruence (geometry); Independence (probability theory); Pure mathematics; Combinatorics; Automorphism group; Discrete mathematics; Algebra over a field; Mathematical analysis; Geometry","score_opus":0.011915912193873772,"score_gpt":0.26285717354385507,"score_spread":0.2509412613499813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976341314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1507138,0.010194351,0.7988009,0.00035618735,0.00025575442,0.0016669476,0.0000150961305,0.00023892339,0.03775805],"genre_scores_gemma":[0.7471268,0.0010273744,0.25159684,0.000076165605,0.000019981313,0.0000917712,7.222965e-7,0.000010376119,0.000049946397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865097,0.000017751647,0.00041929964,0.00032338608,0.00026635407,0.0003222502],"domain_scores_gemma":[0.9973764,0.0018377358,0.00024155968,0.00046311558,0.00003127917,0.000049916576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000500269,0.00017933125,0.00027267152,0.00004315039,0.00017235037,0.000072580544,0.0008863863,0.00006519749,0.000008295067],"category_scores_gemma":[0.000058918286,0.00012420166,0.000041446965,0.00022842796,0.00035641485,0.0005750202,0.00011067659,0.00016628731,0.0000047049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015701919,0.00004414621,0.00007447177,0.00012154049,0.0000061824344,0.0000015894565,0.00065847184,0.00033331112,0.000084238905,0.91568923,0.0000017219493,0.08296941],"study_design_scores_gemma":[0.00037452677,0.00007287657,0.00022085845,0.00006912009,0.000009720753,0.000009972646,0.00039638762,0.024718512,0.0008591655,0.9717832,0.0013036083,0.00018202982],"about_ca_topic_score_codex":0.0000011539681,"about_ca_topic_score_gemma":0.000020080593,"teacher_disagreement_score":0.596413,"about_ca_system_score_codex":0.000014697982,"about_ca_system_score_gemma":0.000029838468,"threshold_uncertainty_score":0.5064797},"labels":[],"label_agreement":null},{"id":"W1976557122","doi":"10.1016/j.laa.2005.08.004","title":"Bimonotone linear inequalities and sublattices of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">R</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>","year":2005,"lang":"lv","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Cartesian product; Countable set; Intersection (aeronautics); Regular polygon; Polyhedron; Solution set; Product (mathematics); Linear inequality; Combinatorics; Discrete mathematics; Set (abstract data type); Pure mathematics; Inequality; Mathematical analysis; Geometry","score_opus":0.02293987659600345,"score_gpt":0.2558426898380681,"score_spread":0.2329028132420647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976557122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5826373,0.0036381693,0.008456015,0.0018138122,0.001216052,0.000095777985,0.00040525704,0.00030907037,0.40142852],"genre_scores_gemma":[0.978868,0.0030770418,0.010593731,0.0017126342,0.0024695962,0.0014019716,0.00077698834,0.0004862418,0.00061376736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9916143,0.00031035766,0.002026451,0.002036025,0.0019110105,0.002101869],"domain_scores_gemma":[0.99256366,0.0015585236,0.001967611,0.0025326547,0.00026045297,0.0011170887],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013871539,0.00087854994,0.00041038485,0.00054566667,0.0017736834,0.0014116355,0.0023506791,0.001839531,0.23699448],"category_scores_gemma":[0.00072545087,0.0015917331,0.0010603142,0.0015104779,0.0017172559,0.0023008843,0.002243453,0.0014372991,0.0015807112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006916885,0.00037288677,0.00001990554,0.0011478403,0.00092047197,0.00027558362,0.0030866708,0.0016826288,0.0021976975,0.9372919,0.047276,0.005036681],"study_design_scores_gemma":[0.0020888436,0.0012463876,0.00017633595,0.00058445823,0.00092015765,0.00091192685,0.0016546247,0.2122441,0.76952535,0.00040551863,0.008775838,0.0014664734],"about_ca_topic_score_codex":0.0009668981,"about_ca_topic_score_gemma":0.00066886103,"teacher_disagreement_score":0.9368864,"about_ca_system_score_codex":0.000012082429,"about_ca_system_score_gemma":0.0012508333,"threshold_uncertainty_score":0.99962497},"labels":[],"label_agreement":null},{"id":"W1976660742","doi":"10.1016/j.ejc.2013.07.008","title":"Finite dimensional scattered posets","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Calgary","funders":"","keywords":"Star product; Mathematics; Product (mathematics); Combinatorics; Characterization (materials science); Pure mathematics; Discrete mathematics; Geometry; Physics; Optics","score_opus":0.011568501039543027,"score_gpt":0.20436805959664706,"score_spread":0.19279955855710404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976660742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3321199,0.00092488626,0.64311796,0.0041710613,0.0039717713,0.00015152336,8.483021e-7,0.000108781314,0.015433264],"genre_scores_gemma":[0.98986137,0.000015805139,0.008949335,0.0007517751,0.00009482625,2.8953724e-7,3.6259826e-7,0.000013106451,0.00031315224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864,0.00025507255,0.000402711,0.00013363095,0.00035727612,0.00021132913],"domain_scores_gemma":[0.99869543,0.0001386571,0.00034715634,0.0002905821,0.00033998102,0.00018821507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044821796,0.000121854166,0.00016972353,0.00012126992,0.00009034003,0.00012869432,0.0009861192,0.000014527764,0.000047055415],"category_scores_gemma":[0.00010749878,0.000094447176,0.000097672426,0.00027738378,0.00003328958,0.00074741367,0.00022061386,0.00026247842,0.0004808278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041946063,0.0013983672,0.0059078676,0.000050411527,0.00020796819,0.0040739565,0.0017353684,0.0047582346,0.0072683217,0.71262825,0.09385689,0.16807239],"study_design_scores_gemma":[0.0062764105,0.0034744442,0.19160421,0.0002718584,0.000043062235,0.0021187358,0.00007725048,0.014160831,0.002631161,0.70878446,0.06916408,0.0013934638],"about_ca_topic_score_codex":2.8975666e-7,"about_ca_topic_score_gemma":1.5598612e-8,"teacher_disagreement_score":0.6577414,"about_ca_system_score_codex":0.000027361475,"about_ca_system_score_gemma":0.000038252267,"threshold_uncertainty_score":0.61802286},"labels":[],"label_agreement":null},{"id":"W1976744475","doi":"10.4064/cm101-2-3","title":"Almost ff-universal and q-universal varieties of modular 0-lattices","year":2004,"lang":"en","type":"article","venue":"Colloquium Mathematicum","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Mathematics; Functor; Variety (cybernetics); Modular design; Pure mathematics; Type (biology); Combinatorics; Discrete mathematics; Computer science","score_opus":0.010451755605865424,"score_gpt":0.21653916963001596,"score_spread":0.20608741402415054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976744475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30624592,0.0003065034,0.68636364,0.00082469266,0.00020833637,0.00024968004,0.0000036746708,0.00016027298,0.005637268],"genre_scores_gemma":[0.90101904,0.00002305884,0.09833559,0.000066937624,0.000021719325,0.0000039271026,8.549072e-7,0.000010018805,0.0005188787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898607,0.000025424468,0.0002165139,0.00028675963,0.00024381015,0.00024144756],"domain_scores_gemma":[0.99915534,0.00008238775,0.000156677,0.00043385307,0.00007771186,0.000094043484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014105748,0.00016272672,0.000274822,0.000102728394,0.00012642037,0.00006447505,0.0005483047,0.000067851055,0.00002200949],"category_scores_gemma":[0.000046295187,0.00014535832,0.000058378242,0.00030350155,0.00019300872,0.0006915836,0.00031065743,0.0000877997,0.000020374318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007797522,0.0001059892,0.00004003288,0.00012689043,0.000030262301,0.000036068173,0.0036603396,0.0005542761,0.0031571907,0.9917679,0.00007844275,0.0004348402],"study_design_scores_gemma":[0.0016595506,0.0004036822,0.0008472538,0.00014497373,0.000055367174,0.00010082174,0.0021618959,0.012954432,0.009447741,0.9707914,0.00093576097,0.00049709895],"about_ca_topic_score_codex":0.000012884031,"about_ca_topic_score_gemma":0.0000038861394,"teacher_disagreement_score":0.5947731,"about_ca_system_score_codex":0.00004128927,"about_ca_system_score_gemma":0.00007439774,"threshold_uncertainty_score":0.59275407},"labels":[],"label_agreement":null},{"id":"W1978084520","doi":"10.1007/s00012-006-1955-3","title":"The Mysterious 2-Crown","year":2006,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Distributive property; sort; Crown (dentistry); Mathematics; Class (philosophy); Combinatorics; Algebra over a field; Pure mathematics; Arithmetic; Computer science; Artificial intelligence; Orthodontics","score_opus":0.004232950841620176,"score_gpt":0.1858695007013873,"score_spread":0.18163654985976713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978084520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11732808,0.0016463061,0.7546129,0.008823948,0.0016105847,0.00040834144,0.0000062324157,0.0013046596,0.114258915],"genre_scores_gemma":[0.98982805,0.000032617925,0.004175222,0.0004466013,0.00011955781,0.0000036513773,0.0000034474872,0.000009853467,0.0053809816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905056,0.000048544825,0.00013272272,0.00026318018,0.00018109161,0.0003239118],"domain_scores_gemma":[0.9991184,0.00013293885,0.00006807991,0.0005833758,0.00004666955,0.000050577473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000974746,0.0001197577,0.00009218643,0.00004444458,0.0004153795,0.0001842864,0.0010262612,0.000041449715,0.000014124895],"category_scores_gemma":[0.000012170739,0.00008334404,0.00006668888,0.00034778012,0.0001082955,0.0004797775,0.00021198102,0.00009331449,0.00012780631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003708706,0.00001297505,0.00009840742,0.0000011922122,0.0000067632413,0.00004602564,0.00009719316,0.00004729818,0.00030123518,0.979329,0.0055490173,0.014507168],"study_design_scores_gemma":[0.00069019524,0.00011027032,0.0062117814,0.000011188245,0.0000126858695,0.000068684276,0.0001932706,0.0031347512,0.0024928723,0.2676069,0.7189881,0.00047927102],"about_ca_topic_score_codex":0.00012629405,"about_ca_topic_score_gemma":0.000096514734,"teacher_disagreement_score":0.8725,"about_ca_system_score_codex":0.000046083023,"about_ca_system_score_gemma":0.000036409154,"threshold_uncertainty_score":0.33986714},"labels":[],"label_agreement":null},{"id":"W1978955535","doi":"10.1007/s10485-007-9069-4","title":"Perfect MV-algebras and their Logic","year":2007,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Theory of computation; Mathematics; Łukasiewicz logic; Algebra over a field; Pure mathematics; Discrete mathematics; Many-valued logic; Computer science; Algorithm; Theoretical computer science; Substructural logic","score_opus":0.010664704866595456,"score_gpt":0.23026695239363706,"score_spread":0.2196022475270416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978955535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07382245,0.00045483792,0.9137276,0.00019623611,0.00015892673,0.00016326373,2.6672552e-7,0.00026782093,0.011208639],"genre_scores_gemma":[0.99266934,0.000018391172,0.005980218,0.0011150811,0.00016347245,0.000007305072,0.000002562424,0.000010739381,0.000032910524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985991,0.000019752402,0.00020413798,0.000521607,0.00017424145,0.00048117],"domain_scores_gemma":[0.99913466,0.0002107133,0.000065652355,0.0003729281,0.000023155788,0.00019291847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019961703,0.00024079517,0.00023040127,0.000072410745,0.00021113864,0.00009359203,0.00056456524,0.00012546367,0.00003122144],"category_scores_gemma":[0.000020318577,0.00015488763,0.00005049383,0.0003510535,0.00011546684,0.00012101919,0.00026485216,0.00025728717,0.000022006672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007932076,0.000009210793,0.00009937061,0.000004465398,0.0000076751985,0.000012207197,0.0001853544,0.000017008788,0.0031275072,0.90285176,0.000107093736,0.093570404],"study_design_scores_gemma":[0.00021893313,0.00005789799,0.013442571,2.2596986e-7,0.0000032051776,0.00006232937,0.00007272103,0.00014343539,0.006855503,0.97634315,0.0025609205,0.00023908739],"about_ca_topic_score_codex":0.0000065985687,"about_ca_topic_score_gemma":0.0000047105245,"teacher_disagreement_score":0.91884685,"about_ca_system_score_codex":0.0000369315,"about_ca_system_score_gemma":0.000016420827,"threshold_uncertainty_score":0.63161343},"labels":[],"label_agreement":null},{"id":"W1979137583","doi":"10.1023/a:1020850910989","title":"Lattice tensor products. II","year":2002,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Manitoba","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Lattice (music); Tensor product; Combinatorics; Pure mathematics; Discrete mathematics; Crystal structure; Physics; Crystallography","score_opus":0.030212872203410193,"score_gpt":0.24410594913980044,"score_spread":0.21389307693639026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979137583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110793196,0.003225917,0.43794882,0.21239012,0.0063655823,0.0035200398,0.000025233076,0.0055333036,0.22019775],"genre_scores_gemma":[0.78343946,0.00009069033,0.18753251,0.002302293,0.0003377921,0.00006804298,0.00000271042,0.000044731223,0.02618175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961121,0.00010516298,0.000620065,0.0011695107,0.00095210515,0.001041064],"domain_scores_gemma":[0.99734014,0.00024553481,0.0003099883,0.0016088826,0.0001736859,0.00032178406],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00088281516,0.00037910978,0.00043544747,0.00027640496,0.00091413426,0.0002749398,0.003062284,0.0002468373,0.00043243403],"category_scores_gemma":[0.0010189371,0.00030656395,0.00014002658,0.002021485,0.00028396994,0.0018069543,0.0013024177,0.0007917337,0.0014482144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004814721,0.0010334536,0.0001111813,0.00023133955,0.00009031643,0.000046917183,0.0062994137,0.000019758627,0.021433866,0.77532154,0.17857432,0.01683307],"study_design_scores_gemma":[0.0014959531,0.00047967295,0.0011697583,0.00022772406,0.00015780654,0.0005679888,0.00024429034,0.14068519,0.024073891,0.2950814,0.5333008,0.0025155202],"about_ca_topic_score_codex":9.088189e-7,"about_ca_topic_score_gemma":3.292388e-7,"teacher_disagreement_score":0.6726463,"about_ca_system_score_codex":0.00006820824,"about_ca_system_score_gemma":0.000037625035,"threshold_uncertainty_score":0.99993867},"labels":[],"label_agreement":null},{"id":"W1980015886","doi":"10.1007/s00500-003-0319-6","title":"Two iterative methods of decomposition of a fuzzy relation for image compression/decompression processing","year":2003,"lang":"en","type":"article","venue":"Soft Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decomposition; Relation (database); Fuzzy logic; Compression (physics); Mathematics; Image compression; Image processing; Decomposition method (queueing theory); Rank (graph theory); Algorithm; Image (mathematics); Mathematical optimization; Dual (grammatical number); Computer science; Artificial intelligence; Data mining; Discrete mathematics; Combinatorics; Chemistry; Physics","score_opus":0.02381070850222276,"score_gpt":0.38199526694975566,"score_spread":0.3581845584475329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980015886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04091706,0.0003491363,0.9567948,0.000028635215,0.00020784867,0.00030132153,0.0000016360387,0.000087905086,0.0013116618],"genre_scores_gemma":[0.49222904,7.46486e-7,0.507712,0.000021085809,0.000018552068,0.0000036744823,0.0000033342956,0.000006343256,0.0000052371806],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832916,0.00033877217,0.0005463309,0.00036553672,0.00018129827,0.00023891346],"domain_scores_gemma":[0.9979689,0.0007591691,0.0006213401,0.0002640213,0.00033435982,0.0000522217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007428365,0.00016147898,0.00032689035,0.0001352242,0.0002541699,0.000046182715,0.00032154057,0.000058598056,0.0000027383903],"category_scores_gemma":[0.0002074943,0.00014168373,0.00010591391,0.00038215148,0.00006510462,0.00056462904,0.00013012307,0.0001282161,7.537046e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051354065,0.00025681002,0.0010865895,0.0003908164,0.00003016976,0.0000027526823,0.004803461,0.027469639,0.4408995,0.1652068,0.000039978273,0.3597621],"study_design_scores_gemma":[0.0010795196,0.00014691564,0.0010654562,0.0005106673,0.000015121799,0.00001728828,0.00012134863,0.6463391,0.24262731,0.10774407,0.0000991468,0.00023401903],"about_ca_topic_score_codex":0.0000020804632,"about_ca_topic_score_gemma":2.6656843e-7,"teacher_disagreement_score":0.6188695,"about_ca_system_score_codex":0.000028579567,"about_ca_system_score_gemma":0.000058175505,"threshold_uncertainty_score":0.5777695},"labels":[],"label_agreement":null},{"id":"W1981159076","doi":"10.1142/s0218196709005408","title":"PRIMITIVE POSITIVE FORMULAS PREVENTING A FINITE BASIS OF QUASI-EQUATIONS","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mathematics; Unary operation; Finite graph; Basis (linear algebra); Graph; Algebra over a field; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.013717427279730004,"score_gpt":0.2857477762662141,"score_spread":0.2720303489864841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981159076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17772268,0.00011646908,0.8203357,0.0012630197,0.00019978885,0.000055923614,0.0000024626452,0.000010838346,0.00029313326],"genre_scores_gemma":[0.95545685,0.000032853062,0.044108294,0.00029439633,0.000088241155,6.3799365e-7,0.0000042476545,0.0000027687208,0.000011692783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989046,0.000055848403,0.00044418726,0.000121969424,0.0003783997,0.00009501714],"domain_scores_gemma":[0.9982264,0.0003591347,0.00058845896,0.000055477834,0.0007189723,0.00005155707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020997571,0.000088569286,0.00015727698,0.00024327301,0.000053207492,0.000074987605,0.00031582595,0.000032068383,0.000003270015],"category_scores_gemma":[0.00015738014,0.000078865545,0.00009178947,0.0001628312,0.000027081429,0.0009115781,0.000048949754,0.00010496876,0.0000014280765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076210796,0.0003684037,0.0006341344,0.0000067318497,0.0001624873,0.00004411674,0.0031257852,0.008619665,0.0016855279,0.34553385,0.00003086003,0.6397122],"study_design_scores_gemma":[0.0019912522,0.0018279278,0.10473573,0.00034634818,0.000044941025,0.00029498685,0.00032444426,0.23375574,0.009197631,0.6471298,0.00005591819,0.00029534046],"about_ca_topic_score_codex":0.0000020213604,"about_ca_topic_score_gemma":6.107557e-7,"teacher_disagreement_score":0.7777342,"about_ca_system_score_codex":0.000037330225,"about_ca_system_score_gemma":0.00006340257,"threshold_uncertainty_score":0.32160437},"labels":[],"label_agreement":null},{"id":"W1981329023","doi":"10.1016/j.apal.2003.11.009","title":"Boolean algebras arising from information systems","year":2004,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Interior algebra; Mathematics; Stone's representation theorem for Boolean algebras; Modal operator; Complete Boolean algebra; Boolean algebras canonically defined; Free Boolean algebra; Connection (principal bundle); Set (abstract data type); Algebra over a field; Modal; Discrete mathematics; Two-element Boolean algebra; Pure mathematics; Modal logic; Computer science; Subalgebra; Division algebra; Algebra representation","score_opus":0.03007391690818214,"score_gpt":0.25807795959950447,"score_spread":0.22800404269132232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981329023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22224307,0.0011970559,0.7649759,0.0012328298,0.00017255433,0.00024915094,0.0000087801045,0.00015548202,0.009765195],"genre_scores_gemma":[0.9908563,0.00009037932,0.007407361,0.0015641782,0.000054773933,0.000007823987,0.000009873979,0.0000030537542,0.000006266201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992076,0.000010673818,0.00025138955,0.00017496997,0.00016362223,0.00019170156],"domain_scores_gemma":[0.9994528,0.000033908265,0.00015935292,0.00023974401,0.000045996825,0.00006817539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012249876,0.00011852359,0.00018812575,0.000065519176,0.000086366126,0.00010508409,0.00027678304,0.000075102966,0.0000025806405],"category_scores_gemma":[0.000010271512,0.00009526262,0.000033930006,0.00016587543,0.000041176154,0.0005864451,0.00010227079,0.0000938254,0.00003390357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005067889,0.000021307898,0.000028899809,0.000017778488,0.000012022065,0.0000019677514,0.00052569783,0.0024557593,0.0009478039,0.9756157,0.00014089438,0.020227123],"study_design_scores_gemma":[0.0005215828,0.000120636054,0.0027388823,0.000048082027,0.0000076935385,0.000009841121,0.00045525245,0.00048642323,0.008126805,0.9835542,0.0036517614,0.00027883687],"about_ca_topic_score_codex":0.000026482952,"about_ca_topic_score_gemma":0.0000020652653,"teacher_disagreement_score":0.7686132,"about_ca_system_score_codex":0.0000052052837,"about_ca_system_score_gemma":0.000020341611,"threshold_uncertainty_score":0.3884697},"labels":[],"label_agreement":null},{"id":"W1981966241","doi":"10.1007/s11787-013-0084-y","title":"A Reduction Theorem for the Kripke–Joyal Semantics: Forcing Over an Arbitrary Category can Always be Replaced by Forcing Over a Complete Heyting Algebra","year":2013,"lang":"en","type":"article","venue":"Logica Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; The King's University; Western University","funders":"University of Calgary","keywords":"Mathematics; Forcing (mathematics); Kripke semantics; Order (exchange); Algebra over a field; Combinatorics; Pure mathematics; Intermediate logic; Mathematical analysis; Description logic","score_opus":0.02164358199467545,"score_gpt":0.23439529236127887,"score_spread":0.21275171036660342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981966241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3152608,0.00030749437,0.67051816,0.0060233297,0.00075250043,0.0018702735,0.00006574045,0.000812689,0.0043890215],"genre_scores_gemma":[0.9812746,0.000033162076,0.015808862,0.0019596582,0.00021202311,0.000057798108,0.00006540067,0.00003780696,0.000550711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975926,0.00015662695,0.0003527105,0.00083579007,0.00032821688,0.00073403004],"domain_scores_gemma":[0.9980709,0.00038702166,0.00031205727,0.0009161466,0.00012858208,0.00018529235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039165784,0.0003563365,0.00034547923,0.00011526429,0.0009291789,0.0003261572,0.0011280978,0.00014906046,0.000110369605],"category_scores_gemma":[0.00006401156,0.00026197603,0.00019120063,0.0003876699,0.00019485713,0.0015151905,0.00031627537,0.00033056107,0.0000062100635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008277145,0.000111724636,0.00021257332,0.00004539206,0.00012833635,0.000024595578,0.006663002,0.0013197646,0.033987068,0.93848467,0.011503874,0.0074362257],"study_design_scores_gemma":[0.0027894273,0.00090373476,0.0016619207,0.00009076006,0.00014609429,0.00013940754,0.008137463,0.5739971,0.0048019923,0.39041337,0.015377366,0.0015413427],"about_ca_topic_score_codex":0.001254889,"about_ca_topic_score_gemma":0.000081354454,"teacher_disagreement_score":0.6660138,"about_ca_system_score_codex":0.00015976434,"about_ca_system_score_gemma":0.00006864552,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W1983147651","doi":"10.1016/j.jalgebra.2010.10.012","title":"Maximal T-spaces of a free associative algebra","year":2010,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Bijection; Associative property; Maximal element; Associative algebra; Lattice (music); Singleton; Element (criminal law); Maximal ideal; Ideal (ethics); Unitary state; Combinatorics; Incidence algebra; Discrete mathematics; Pure mathematics; Set (abstract data type); Algebra over a field; Division algebra; Algebra representation","score_opus":0.009695783247799737,"score_gpt":0.24238426957853532,"score_spread":0.23268848633073558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983147651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8996484,0.00033580477,0.09276812,0.0031165248,0.0014395175,0.00009184883,0.0000053624217,0.000040865103,0.002553534],"genre_scores_gemma":[0.9095879,0.000028191353,0.089679904,0.00026675538,0.0003025325,0.0000011460843,2.6079445e-7,0.000010851076,0.00012242072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982451,0.00007450363,0.0005862383,0.00018808403,0.0006051824,0.00030088346],"domain_scores_gemma":[0.99751323,0.00028897662,0.0011053676,0.00048631555,0.0004365743,0.00016955446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064432126,0.00017017643,0.00042589204,0.00021392098,0.000080195554,0.00008689798,0.0017393617,0.0001219194,0.00008345706],"category_scores_gemma":[0.000606171,0.00013040596,0.00024701474,0.00041758586,0.000116212446,0.0010502525,0.00029712322,0.00066542474,0.000015603908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008248542,0.00050374854,0.00846832,0.000034295055,0.00030125974,0.00024124379,0.0038740598,0.000037812268,0.07470351,0.86340886,0.006686041,0.041658364],"study_design_scores_gemma":[0.0024222336,0.0013836991,0.05700006,0.00008661483,0.0000646519,0.0005423282,0.00039236931,0.0008791451,0.058266856,0.8724427,0.005990913,0.0005284358],"about_ca_topic_score_codex":0.00000489716,"about_ca_topic_score_gemma":0.000013051488,"teacher_disagreement_score":0.04853174,"about_ca_system_score_codex":0.000031277832,"about_ca_system_score_gemma":0.00017832585,"threshold_uncertainty_score":0.53178006},"labels":[],"label_agreement":null},{"id":"W1984195282","doi":"10.1007/s11225-005-4649-5","title":"Frames and MV-algebras","year":2005,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Embedding; Topological space; Algebra over a field; Pure mathematics; Class (philosophy); Generalization; Lattice (music); Discrete mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.014600127020419244,"score_gpt":0.2458044305026107,"score_spread":0.23120430348219145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984195282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30513942,0.010418434,0.48586133,0.019916004,0.00064644223,0.00053774595,0.0000037048826,0.0012123091,0.17626463],"genre_scores_gemma":[0.94423866,0.00016021615,0.05349673,0.0016729069,0.00012700385,0.000010929631,3.347649e-7,0.000003590162,0.00028964173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991768,0.000025566645,0.00011314884,0.0003224755,0.00012371286,0.00023831525],"domain_scores_gemma":[0.9995122,0.00008239953,0.0000378383,0.0002677772,0.000023494958,0.00007630352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008478612,0.000111947964,0.00013605002,0.000033443368,0.00015469031,0.000060435515,0.00034985246,0.000042715612,0.000039592942],"category_scores_gemma":[0.000042754786,0.00008151354,0.000029629344,0.00016867903,0.00006854241,0.00026955528,0.00030142805,0.00010458123,0.00015070415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021809615,0.00006039378,0.0017998453,0.0000032978467,0.000013090572,0.00001686388,0.0005796122,0.000030762447,0.00016041714,0.8742778,0.002501574,0.12055421],"study_design_scores_gemma":[0.0010518462,0.00050262315,0.14450562,0.000017842498,0.000016498809,0.00007029118,0.00024204058,0.0016748604,0.001009048,0.4746072,0.3754374,0.0008647201],"about_ca_topic_score_codex":0.0000014752943,"about_ca_topic_score_gemma":0.000005064942,"teacher_disagreement_score":0.63909924,"about_ca_system_score_codex":0.000012769035,"about_ca_system_score_gemma":0.000016567452,"threshold_uncertainty_score":0.3324026},"labels":[],"label_agreement":null},{"id":"W1984451547","doi":"10.4153/cmb-2004-019-3","title":"Congruence Class Sizes in Finite Sectionally Complemented Lattices","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Congruence relation; Congruence (geometry); Mathematics; Pure mathematics; Lattice (music); Geometry; Physics","score_opus":0.015754152679092297,"score_gpt":0.2372715319518552,"score_spread":0.2215173792727629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984451547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12852116,0.00017914655,0.7368015,0.07429365,0.00036769905,0.00079505047,0.00003215096,0.0003206808,0.05868899],"genre_scores_gemma":[0.9663328,0.0000032580654,0.029971477,0.0032801384,0.000030000081,0.000026868314,0.000004034144,0.000008755143,0.00034268014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874,0.00003705203,0.00027657344,0.0003037317,0.00018762884,0.00045501362],"domain_scores_gemma":[0.9989603,0.00030484,0.000049758168,0.00029191253,0.00005041882,0.0003427616],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020178061,0.00013813598,0.00018572502,0.00014902845,0.00010911561,0.00009705405,0.0005602004,0.000058559355,0.0015062919],"category_scores_gemma":[0.00029213782,0.0001289688,0.00004120309,0.0003094016,0.00008887681,0.00010104982,0.00006270507,0.00017623806,0.003456446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001610385,0.000040772476,0.00014285326,0.000024742674,0.0000059259164,0.00013887591,0.00023909629,0.0013392606,0.000033046028,0.99709016,0.00038883672,0.00055480987],"study_design_scores_gemma":[0.0010304891,0.00008533968,0.0022659292,0.00016862553,0.000005130496,0.000062290426,0.00018098582,0.008917566,0.00016272692,0.92467684,0.061987378,0.00045672152],"about_ca_topic_score_codex":0.0010271791,"about_ca_topic_score_gemma":0.010376061,"teacher_disagreement_score":0.83781165,"about_ca_system_score_codex":0.00021004234,"about_ca_system_score_gemma":0.00025045555,"threshold_uncertainty_score":0.99940646},"labels":[],"label_agreement":null},{"id":"W1984879634","doi":"10.1007/s00012-006-2019-4","title":"Irresponsibility indicates an inability to be strong","year":2006,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Unary operation; Mathematics; Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.015972081886952517,"score_gpt":0.2505046902607032,"score_spread":0.2345326083737507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984879634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8348586,0.00002485562,0.15914673,0.0024813672,0.00013149051,0.00023136733,0.000011650744,0.00040369708,0.0027102404],"genre_scores_gemma":[0.9770596,7.6337454e-7,0.021910723,0.00065814174,0.000058930644,0.0000060694324,0.000017087952,0.000010268566,0.00027841836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812937,0.00018543721,0.00022514153,0.0007395777,0.00028274875,0.00043770098],"domain_scores_gemma":[0.99841046,0.00014323663,0.000077702294,0.0010393566,0.000100189,0.00022903815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003332636,0.00019816194,0.00019929688,0.00017958376,0.00020050947,0.0001100168,0.0011703091,0.000084180676,0.000068258116],"category_scores_gemma":[0.00008105338,0.00019268188,0.000073828254,0.0007916194,0.0001209406,0.0013414734,0.00037459465,0.0001529256,0.00004979409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043351956,0.00029650217,0.009703673,0.000008078053,0.0000116258325,0.000066485954,0.0011324219,0.0005023411,0.0015151367,0.97626996,0.0011895113,0.009260925],"study_design_scores_gemma":[0.0014444641,0.0010966249,0.45250943,0.000018005692,0.000036578243,0.000035328634,0.0013142035,0.004553581,0.018237315,0.47680867,0.04232246,0.0016233433],"about_ca_topic_score_codex":0.0006572072,"about_ca_topic_score_gemma":0.00046654767,"teacher_disagreement_score":0.4994613,"about_ca_system_score_codex":0.00016589378,"about_ca_system_score_gemma":0.000109513705,"threshold_uncertainty_score":0.7857339},"labels":[],"label_agreement":null},{"id":"W1985716702","doi":"10.1016/j.jalgebra.2004.09.002","title":"Properly stratified endomorphism algebras","year":2004,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Endomorphism; Mathematics; Analogy; Pure mathematics; Algebra over a field; Linguistics","score_opus":0.014710777665785766,"score_gpt":0.23394761990865298,"score_spread":0.2192368422428672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985716702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3585351,0.00087475695,0.63268375,0.004199399,0.0010487747,0.000164518,8.552989e-7,0.000089841546,0.0024029792],"genre_scores_gemma":[0.92053485,0.000044286626,0.07831442,0.0007023532,0.00027702784,0.0000019689435,3.3332608e-7,0.000011464264,0.00011329487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834824,0.000050604267,0.0005740373,0.000211691,0.0004991455,0.0003162974],"domain_scores_gemma":[0.998677,0.00005857862,0.00045538062,0.00036651272,0.00023077261,0.00021176336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034897748,0.00017807956,0.0003087199,0.00017318643,0.00011255399,0.00015584008,0.0011183355,0.00007207402,0.00004052302],"category_scores_gemma":[0.000092221075,0.0001282373,0.00017881267,0.00037122043,0.0000712413,0.0013330493,0.00009597864,0.00037163007,0.00008274529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038113158,0.000268501,0.00010018936,0.000014514812,0.00007703033,0.00087269506,0.0010727695,0.0009419682,0.017379168,0.9451514,0.0005656607,0.03351797],"study_design_scores_gemma":[0.0038569618,0.0017981179,0.0034112611,0.00012716904,0.00003375273,0.0029486085,0.00013942926,0.00014909147,0.04549264,0.9360834,0.0054484718,0.0005111259],"about_ca_topic_score_codex":0.0000035897874,"about_ca_topic_score_gemma":0.000002587543,"teacher_disagreement_score":0.56199974,"about_ca_system_score_codex":0.00008397403,"about_ca_system_score_gemma":0.0003259289,"threshold_uncertainty_score":0.5229365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01217836327322993,"score_gpt":0.2713606514743936,"score_spread":0.2591822882011637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985762660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32801595,0.0003156107,0.6669832,0.0003771097,0.00035279663,0.00016861211,0.000002596741,0.0003116527,0.0034724793],"genre_scores_gemma":[0.92696446,0.00003759977,0.07075504,0.0010880564,0.00019098395,0.0000031483848,0.0000030513152,0.000015559373,0.0009420751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987133,0.000023686967,0.00022964782,0.0004407598,0.00020354822,0.00038906827],"domain_scores_gemma":[0.99906164,0.0002450058,0.00005538272,0.0003945907,0.000047291156,0.00019610573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032844595,0.00018292211,0.00017167407,0.00010088406,0.00014309779,0.000050047787,0.00034056837,0.00008879819,0.000021634505],"category_scores_gemma":[0.000093494855,0.00014910704,0.00006131729,0.00024012684,0.00006799989,0.00024166297,0.00011275927,0.00022334207,0.00017844616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011103166,0.0003124592,0.00048765895,0.00003021965,0.000030510135,0.00021258151,0.0012249285,0.00031147312,0.0036689672,0.43526968,0.00047784127,0.55786264],"study_design_scores_gemma":[0.008279842,0.0022889427,0.03758683,0.00014581427,0.000049904902,0.00033617852,0.00045087008,0.5007645,0.14132005,0.12545045,0.18037511,0.0029515382],"about_ca_topic_score_codex":0.0000071301406,"about_ca_topic_score_gemma":0.000007583277,"teacher_disagreement_score":0.59894854,"about_ca_system_score_codex":0.000012982453,"about_ca_system_score_gemma":0.00001686797,"threshold_uncertainty_score":0.60804087},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009783662731557273,"score_gpt":0.24553688113065542,"score_spread":0.23575321839909813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986537785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8976755,0.000529296,0.09284859,0.0008661821,0.0066704894,0.00028252343,0.000018305514,0.000070540664,0.0010385506],"genre_scores_gemma":[0.9931034,0.0001631208,0.005454609,0.00021378492,0.0009012442,0.000003940236,0.000002395259,0.0000119283595,0.00014557056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868524,0.00023045245,0.00047784898,0.00017524806,0.00021317598,0.00021804211],"domain_scores_gemma":[0.9985201,0.00054077123,0.0004000482,0.00024936846,0.00018002932,0.00010972568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009771413,0.00015979826,0.00032834258,0.00007795526,0.00025163367,0.00023250433,0.0004539204,0.00008050492,0.00007394526],"category_scores_gemma":[0.00021907884,0.0001296422,0.00011365069,0.0001387772,0.00012777859,0.001521496,0.0000586959,0.00020024624,0.0000018101165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047303594,0.000038461836,0.00006478113,0.000014676222,0.00003252685,0.000007776893,0.0008451231,0.000014170401,0.0008898285,0.94991595,0.000015121581,0.047688562],"study_design_scores_gemma":[0.000909583,0.00047399435,0.0035345973,0.000025866106,0.00001641209,0.00013810385,0.00007480578,0.000044852753,0.0017499574,0.97539854,0.017474882,0.00015841264],"about_ca_topic_score_codex":4.2253785e-7,"about_ca_topic_score_gemma":1.197485e-7,"teacher_disagreement_score":0.095427886,"about_ca_system_score_codex":0.000025591393,"about_ca_system_score_gemma":0.00006097835,"threshold_uncertainty_score":0.52866554},"labels":[],"label_agreement":null},{"id":"W1987233195","doi":"10.1007/pl00000332","title":"Regular congruence-preserving extensions of lattices","year":2001,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Congruence (geometry); Lattice (music); Tilde; Extension (predicate logic); Zero (linguistics); Complete lattice; Pure mathematics; Combinatorics; Discrete mathematics; Geometry; Physics; Computer science; Quantum mechanics","score_opus":0.015770960103597163,"score_gpt":0.23575891718592767,"score_spread":0.21998795708233052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987233195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6821048,0.0008604148,0.28413984,0.0029940214,0.00046394364,0.00022970217,0.000005598195,0.00043322615,0.028768439],"genre_scores_gemma":[0.9777554,0.00015048779,0.020640833,0.00031031444,0.000033997083,0.0000015150363,0.0000029644239,0.000008816793,0.0010956309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989029,0.00006121517,0.0001872153,0.0003311382,0.00023591863,0.00028156897],"domain_scores_gemma":[0.9987029,0.00015502475,0.00012873345,0.00075612724,0.00014723768,0.000109983965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001189074,0.00012917072,0.00019097274,0.0001376227,0.00012552577,0.00003635472,0.0010986031,0.00006122184,0.00013378733],"category_scores_gemma":[0.00007733484,0.000120353325,0.000079595586,0.00067635113,0.00011984876,0.001060655,0.00037461362,0.00009931172,0.000029216366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011771727,0.000068476365,0.0025160678,0.000013613859,0.000040049268,0.00025136673,0.00086096587,0.0003537369,0.00519864,0.97883195,0.001529346,0.010324003],"study_design_scores_gemma":[0.0031792664,0.0007061777,0.039392438,0.00037453056,0.0001483408,0.000369564,0.0033688585,0.052488007,0.028337922,0.70241046,0.16726057,0.0019638832],"about_ca_topic_score_codex":0.00013707514,"about_ca_topic_score_gemma":0.00003812757,"teacher_disagreement_score":0.29565063,"about_ca_system_score_codex":0.000024457348,"about_ca_system_score_gemma":0.00004794212,"threshold_uncertainty_score":0.4907866},"labels":[],"label_agreement":null},{"id":"W1987286443","doi":"10.1007/s00012-005-1918-0","title":"Full does not imply strong, does it?","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Duality (order theory); Mathematics; Bounded function; Compact space; Distributive property; Strong duality; Pure mathematics; Weak duality; Perturbation function; Variety (cybernetics); Mathematical analysis; Convex analysis; Regular polygon; Optimization problem","score_opus":0.010067588780890575,"score_gpt":0.23172936830307253,"score_spread":0.22166177952218197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987286443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30739656,0.00021275552,0.61019564,0.04597954,0.0018722919,0.0005347672,0.00006696417,0.0016733411,0.03206817],"genre_scores_gemma":[0.9644684,0.0000632645,0.028265895,0.0027411776,0.00032002048,0.0000045732168,0.00000777151,0.000018523882,0.0041103237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982567,0.00006364006,0.00023496735,0.00058967515,0.00031496218,0.0005400758],"domain_scores_gemma":[0.99869204,0.000116283954,0.00011932073,0.000793301,0.00008179061,0.00019725543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012797078,0.00025119883,0.0002242401,0.0001520265,0.00021600907,0.00014276794,0.0013075727,0.00009735846,0.00032785302],"category_scores_gemma":[0.000026909034,0.00016565906,0.00012692217,0.00034620933,0.00010990488,0.0017321233,0.00038067318,0.00020011576,0.00029371775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003400661,0.000090593116,0.00016870922,0.000009417362,0.000052205876,0.000077833654,0.0019140182,0.00021614178,0.004060194,0.9311765,0.0034493885,0.058751],"study_design_scores_gemma":[0.0029556956,0.0006761043,0.0016843815,0.00006494789,0.00008244607,0.000086594046,0.0028672647,0.01421476,0.07575844,0.0697614,0.82970816,0.0021397832],"about_ca_topic_score_codex":0.000058794787,"about_ca_topic_score_gemma":0.00035265193,"teacher_disagreement_score":0.8614151,"about_ca_system_score_codex":0.000109293054,"about_ca_system_score_gemma":0.00007042862,"threshold_uncertainty_score":0.675538},"labels":[],"label_agreement":null},{"id":"W1987579327","doi":"10.1142/s0218196707004189","title":"MINIMAL SEMIGROUPS GENERATING VARIETIES WITH COMPLEX SUBVARIETY LATTICES","year":2007,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Semigroup; Lattice (music); Variety (cybernetics); Pure mathematics; Property (philosophy); Statistics","score_opus":0.01865502722225417,"score_gpt":0.2790667050779938,"score_spread":0.26041167785573965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987579327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4188344,0.00009563921,0.58029246,0.00037150062,0.00022540915,0.000023791803,4.0542326e-7,0.00001454503,0.00014184995],"genre_scores_gemma":[0.82156754,0.00001555758,0.17767161,0.00044325556,0.00027924226,3.9384253e-7,0.0000035747235,0.000005138296,0.000013687615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99879444,0.00003319533,0.00038081728,0.00015465323,0.0004944433,0.00014242824],"domain_scores_gemma":[0.9987453,0.00018095649,0.00040151857,0.00006224381,0.00052805885,0.00008188175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042247074,0.0001128534,0.00013854416,0.00015593154,0.000097006625,0.00023612785,0.00038235166,0.00003674567,0.000005025097],"category_scores_gemma":[0.000028717863,0.00008828599,0.000044331988,0.00013191174,0.00006162908,0.00066309626,0.00008725789,0.00013580575,0.0000015327622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007802121,0.00043283927,0.044878203,0.00004189465,0.0007324194,0.0008458824,0.008787017,0.035223823,0.019233126,0.47800994,0.0007848581,0.4102498],"study_design_scores_gemma":[0.0059254426,0.003055156,0.50473005,0.0002325283,0.000092782364,0.0068456223,0.0020348064,0.326183,0.0075395326,0.13884152,0.0033748785,0.0011446793],"about_ca_topic_score_codex":0.0000047231774,"about_ca_topic_score_gemma":0.0000072720172,"teacher_disagreement_score":0.45985186,"about_ca_system_score_codex":0.00003103644,"about_ca_system_score_gemma":0.000049792965,"threshold_uncertainty_score":0.3600198},"labels":[],"label_agreement":null},{"id":"W1988444556","doi":"10.1007/s10998-014-0035-2","title":"An extension theorem for planar semimodular lattices","year":2014,"lang":"en","type":"article","venue":"Periodica Mathematica Hungarica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Congruence relation; Distributive lattice; Extension (predicate logic); Distributive property; Lattice (music); Planar; Congruence lattice problem; Congruence (geometry); Combinatorics; Map of lattices; Pure mathematics; Geometry; Reciprocal lattice","score_opus":0.017607465361436737,"score_gpt":0.26627495726408873,"score_spread":0.248667491902652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988444556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015382189,0.0000797853,0.97839916,0.0011478581,0.00013140237,0.0003546079,0.0000034035966,0.00043624185,0.0040653246],"genre_scores_gemma":[0.63624644,0.0000063338675,0.36279464,0.00063418766,0.00010975949,0.000066581866,0.0000059421186,0.000020403644,0.000115741124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818057,0.000108158274,0.00032990705,0.00062351866,0.0003103695,0.00044747384],"domain_scores_gemma":[0.9978228,0.0004758668,0.0001615994,0.0012418223,0.00009036289,0.00020751255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006645162,0.00023574846,0.00036146733,0.000089656896,0.00043973312,0.00027589538,0.001198498,0.000098219236,0.000045940604],"category_scores_gemma":[0.0003300623,0.00018089882,0.000116169285,0.00019625414,0.00012528487,0.0005051827,0.00010102018,0.00013101636,0.000114261326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011355266,0.00020155832,0.000025789213,0.00009601864,0.00001581485,0.0000038451512,0.0019413364,0.000036883688,0.0061423136,0.9681819,0.0004967925,0.02284639],"study_design_scores_gemma":[0.0004000075,0.00045107605,0.00038797554,0.000048388934,0.000026943268,0.00003516408,0.000110181856,0.31136033,0.0015428676,0.6652941,0.019932926,0.0004100337],"about_ca_topic_score_codex":0.0000014137115,"about_ca_topic_score_gemma":0.0000010837588,"teacher_disagreement_score":0.6208642,"about_ca_system_score_codex":0.000019761655,"about_ca_system_score_gemma":0.000031369924,"threshold_uncertainty_score":0.737684},"labels":[],"label_agreement":null},{"id":"W1990392078","doi":"10.1090/s0002-9947-2014-06357-5","title":"On finite additive 2-bases","year":2014,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"CHIST-ERA; Agence Nationale de la Recherche","keywords":"Mathematics; Pure mathematics","score_opus":0.01414964800859458,"score_gpt":0.25342138197827835,"score_spread":0.23927173396968376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990392078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014229632,0.000017577706,0.9797852,0.0024006285,0.00017130129,0.00023088334,0.000057584017,0.00008187998,0.003025318],"genre_scores_gemma":[0.94917315,0.000052679767,0.047627717,0.0020711534,0.00005619061,0.000024726101,8.4674866e-7,0.000021894852,0.0009716618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980494,0.00023486743,0.0004186817,0.0004011496,0.0004968013,0.00039910138],"domain_scores_gemma":[0.9953633,0.0029871992,0.00042194678,0.0010038777,0.00009026903,0.00013338552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875302,0.00027834915,0.00054033095,0.000026312777,0.00039227345,0.000045280714,0.0010347721,0.00006165986,0.0002625777],"category_scores_gemma":[0.00021800933,0.00018584718,0.00090460887,0.000822377,0.0015198094,0.00014603036,0.000050082304,0.00044687942,0.00016542761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008949076,0.002897132,0.000021368378,0.0003971875,0.00061511894,0.0000015420458,0.008083714,0.02703666,0.00069462246,0.74146426,0.004149119,0.21454978],"study_design_scores_gemma":[0.0007750692,0.0017661751,0.00080628647,0.0005194642,0.00031220328,0.0000148029885,0.0015030293,0.38259938,0.006212832,0.6017527,0.0029912312,0.0007468398],"about_ca_topic_score_codex":0.000019004017,"about_ca_topic_score_gemma":0.0000015026492,"teacher_disagreement_score":0.9349435,"about_ca_system_score_codex":0.000061124854,"about_ca_system_score_gemma":0.000062299885,"threshold_uncertainty_score":0.7578628},"labels":[],"label_agreement":null},{"id":"W1991966037","doi":"10.1016/j.topol.2011.09.049","title":"Lax algebra meets topology","year":2012,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Monad (category theory); Closure (psychology); Category of topological spaces; Topological space; Compact space; Compact-open topology; Metric space; Algebraic number; Algebra over a field; Context (archaeology); Axiom; Pure mathematics; Set (abstract data type); Topology (electrical circuits); Discrete mathematics; Topological tensor product; Functor; Combinatorics; Functional analysis; Computer science","score_opus":0.017256625004516947,"score_gpt":0.27768906248423697,"score_spread":0.26043243747972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991966037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041640557,0.009095071,0.8950685,0.020661222,0.00045234073,0.00052938075,0.000006043975,0.00041115368,0.032135714],"genre_scores_gemma":[0.9881634,0.0001633239,0.009180081,0.0014853457,0.00016156664,0.0001510328,0.000003777355,0.0000043183923,0.00068717165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992719,0.000038179023,0.00012046105,0.00022108156,0.00004194388,0.00030643307],"domain_scores_gemma":[0.9994014,0.00011303639,0.000046107438,0.00029693585,0.00002633775,0.00011621197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103544786,0.000088696324,0.00011349335,0.00004881687,0.00024263447,0.000010961302,0.0003141589,0.00009727281,0.00010301763],"category_scores_gemma":[0.000016587734,0.00007820166,0.000021087455,0.00015794762,0.00011997014,0.0002772209,0.00016302259,0.000104927625,0.0002710773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.112893e-7,0.000037600246,0.00037817052,0.0000024273668,0.000005177796,3.2813043e-7,0.00016939557,8.436143e-7,0.00039991408,0.98620075,0.0002559033,0.012548766],"study_design_scores_gemma":[0.0003187925,0.0000838831,0.012425202,0.000002010569,0.000017368107,0.00020321098,0.00009615224,0.0004894145,0.003352671,0.40578088,0.57690215,0.00032823594],"about_ca_topic_score_codex":0.0000036258743,"about_ca_topic_score_gemma":0.0000033243814,"teacher_disagreement_score":0.94652283,"about_ca_system_score_codex":0.000008933619,"about_ca_system_score_gemma":0.0000139935055,"threshold_uncertainty_score":0.34842408},"labels":[],"label_agreement":null},{"id":"W1992217715","doi":"10.1142/s0218196713500343","title":"COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS","year":2013,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"","keywords":"Mathematics; Idempotence; Arity; Class (philosophy); Universal algebra; Unary operation; Algebra over a field; Constraint satisfaction problem; Discrete mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.021491115994086853,"score_gpt":0.2859370068847025,"score_spread":0.26444589089061565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992217715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34620517,0.00008374347,0.6510643,0.0017906049,0.00047393228,0.00007310075,0.0000048945576,0.000018311126,0.00028596897],"genre_scores_gemma":[0.9175495,0.000015841251,0.08191811,0.00038167535,0.00009873116,0.0000024389715,0.000013559708,0.000004873409,0.00001526558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986036,0.000062134226,0.00056214945,0.00014653616,0.0005110156,0.00011458657],"domain_scores_gemma":[0.99788755,0.0002076445,0.0005637724,0.00007654374,0.0011732093,0.00009129967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014812218,0.00011168838,0.0002007514,0.00026102547,0.000066754445,0.0001320901,0.000496199,0.00004118946,0.000054398643],"category_scores_gemma":[0.000044407545,0.000100111276,0.000088551045,0.00015695118,0.0001617843,0.0010394548,0.00011357655,0.00013456678,0.00001640209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002765228,0.00030682638,0.0031985322,0.000017926352,0.00024641358,0.000041348823,0.0010714256,0.0419537,0.0010052776,0.891934,0.0011216396,0.059075266],"study_design_scores_gemma":[0.0007526545,0.00017893322,0.09748842,0.000039552586,0.000009934128,0.00041424736,0.00007751169,0.11414961,0.0002098039,0.786491,0.00007431885,0.0001140519],"about_ca_topic_score_codex":0.000022490754,"about_ca_topic_score_gemma":0.0000011764687,"teacher_disagreement_score":0.5713443,"about_ca_system_score_codex":0.000037940586,"about_ca_system_score_gemma":0.00008087112,"threshold_uncertainty_score":0.40824196},"labels":[],"label_agreement":null},{"id":"W1992765863","doi":"10.1007/s00012-004-1900-2","title":"The saga of the High School Identities","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Variety (cybernetics); Exponentiation; Mathematics; Algebra over a field; Mathematics education; Arithmetic; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.006800735700056975,"score_gpt":0.19542823182409422,"score_spread":0.18862749612403723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992765863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8222342,0.0020873153,0.10495455,0.02999306,0.0021748128,0.00059896725,0.000015259571,0.00046594447,0.037475888],"genre_scores_gemma":[0.9904509,0.00011239289,0.0022432562,0.00059279177,0.00008942428,0.0000020738248,5.2361213e-7,0.0000061113024,0.0065025254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913275,0.000069623165,0.0001484107,0.00017646179,0.00025682556,0.0002159357],"domain_scores_gemma":[0.998899,0.0001464238,0.000112262685,0.000722227,0.00006780664,0.000052321728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001230796,0.00009710328,0.00009429325,0.000037239348,0.0003311045,0.00008090147,0.0016468522,0.00003606248,0.00005252369],"category_scores_gemma":[0.00005925479,0.00005530824,0.00009029221,0.00037225135,0.00019198332,0.00067664793,0.00039170228,0.00012396509,0.00005971547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002672399,0.000012318443,0.0003511601,0.000002021107,0.000017719167,0.0000022076454,0.00025592267,0.0001372713,0.00020039587,0.9857417,0.004340004,0.008936641],"study_design_scores_gemma":[0.0016924898,0.00017855207,0.050376747,0.00007903828,0.00007006948,0.00005221438,0.0017396674,0.003591686,0.03972369,0.5897337,0.31196004,0.0008020911],"about_ca_topic_score_codex":0.000061860475,"about_ca_topic_score_gemma":0.000090986025,"teacher_disagreement_score":0.39600796,"about_ca_system_score_codex":0.000051081992,"about_ca_system_score_gemma":0.000068713416,"threshold_uncertainty_score":0.30602887},"labels":[],"label_agreement":null},{"id":"W1993834297","doi":"10.1007/s00012-015-0322-7","title":"A quasi-Mal’cev condition with unexpected application","year":2015,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Congruence relation; Abelian group; Closure (psychology); Pure mathematics; Algebra over a field; Law","score_opus":0.01214190103620052,"score_gpt":0.2258082026972083,"score_spread":0.21366630166100778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993834297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06956652,0.000057971676,0.9224335,0.000895336,0.000095939016,0.0002136466,0.0000038197177,0.0005042425,0.006229058],"genre_scores_gemma":[0.9821734,0.000004937014,0.016960049,0.0003858044,0.00005472283,0.0000152193215,0.000044508834,0.000011894988,0.0003494771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893165,0.000056403376,0.00011883307,0.00038735406,0.00026927932,0.00023648808],"domain_scores_gemma":[0.99897146,0.000045723926,0.00010728085,0.00051845296,0.0001768147,0.000180242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008589233,0.00014534428,0.0001385293,0.00011880727,0.00009373409,0.00006249535,0.00052315,0.00006162347,0.000013577704],"category_scores_gemma":[0.00001981486,0.00012554595,0.0000314684,0.0007163117,0.00007827966,0.0009771754,0.000090842535,0.000100346544,0.00013887927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030668885,0.00013736128,0.00043931397,0.000004618553,0.000026192165,0.000049964467,0.0016142152,0.00023868994,0.00056044507,0.98834366,0.001551627,0.0070032342],"study_design_scores_gemma":[0.014409094,0.006158632,0.009863036,0.00014777396,0.00020602348,0.000528382,0.009716758,0.11654135,0.019709693,0.59488076,0.22391403,0.003924475],"about_ca_topic_score_codex":0.00011403698,"about_ca_topic_score_gemma":0.00005890429,"teacher_disagreement_score":0.9126069,"about_ca_system_score_codex":0.00010670428,"about_ca_system_score_gemma":0.00010617849,"threshold_uncertainty_score":0.5119615},"labels":[],"label_agreement":null},{"id":"W1994612227","doi":"10.1007/s00012-010-0089-9","title":"Positive universal classes in locally finite varieties","year":2010,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Universal algebra; Pure mathematics; Sequence (biology); Algebra over a field; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.006166005409803572,"score_gpt":0.20725774698813926,"score_spread":0.20109174157833568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994612227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27370018,0.00007692409,0.6728574,0.0033378077,0.0011835615,0.00032076484,0.000016909356,0.000577339,0.0479291],"genre_scores_gemma":[0.9842126,0.000026519872,0.014255862,0.000666155,0.000055655255,0.0000021262135,0.000009746275,0.000013511429,0.00075783563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986401,0.00007308978,0.00017404801,0.0004714495,0.00022888885,0.00041239333],"domain_scores_gemma":[0.99880457,0.00035012743,0.00008206818,0.00052222103,0.000105811894,0.00013520478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001292615,0.0002072846,0.00020062055,0.0002802066,0.00014302584,0.00010441779,0.0010201103,0.00014906294,0.0000956921],"category_scores_gemma":[0.00007951744,0.00020877927,0.000073865616,0.0007790357,0.00020242139,0.0013889731,0.0003238583,0.00047905362,0.00008468677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018190472,0.00006313702,0.0014170582,0.000003554395,0.00001546019,0.00028809533,0.0014941278,0.00016820786,0.0010400874,0.99026936,0.00024859744,0.004974111],"study_design_scores_gemma":[0.0074255327,0.0012887045,0.10598133,0.0001398387,0.000082246755,0.00020637047,0.005286329,0.062537976,0.017965276,0.698967,0.09645997,0.0036594714],"about_ca_topic_score_codex":0.00019925878,"about_ca_topic_score_gemma":0.00061414915,"teacher_disagreement_score":0.7105124,"about_ca_system_score_codex":0.00006320957,"about_ca_system_score_gemma":0.00016223204,"threshold_uncertainty_score":0.8513771},"labels":[],"label_agreement":null},{"id":"W1994928089","doi":"10.1016/s0012-365x(03)00094-3","title":"A permutation group determined by an ordered set","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Permutation group; Combinatorics; Involution (esoterism); Symmetric group; Distributive lattice; Permutation (music); Primitive permutation group; Cyclic permutation; Finite group; Alternating group; Partial permutation; Discrete mathematics; Derangement; Group (periodic table); Lattice (music); Distributive property; Pure mathematics","score_opus":0.019251208069037167,"score_gpt":0.27033289119287995,"score_spread":0.25108168312384277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994928089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074471794,0.000050197723,0.92255753,0.000060475068,0.00007301671,0.00015193949,0.0000056804993,0.00015833824,0.0024709993],"genre_scores_gemma":[0.76344,0.000004361132,0.23607722,0.00016785237,0.0000118638545,0.00002118253,0.000023333037,0.000014312031,0.00023983743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902976,0.000060414903,0.00021754141,0.00026128913,0.00019600117,0.00023497263],"domain_scores_gemma":[0.9992161,0.000067298715,0.00010396308,0.00048380243,0.000033226715,0.00009564624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016754218,0.00014575513,0.00015563206,0.00003761845,0.00010860176,0.00012413264,0.0003932136,0.000048089056,0.000028825561],"category_scores_gemma":[0.000093061964,0.00012009678,0.00005479952,0.00020188901,0.000031195505,0.00053080585,0.000043033328,0.00006993764,0.000044155484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026226626,0.00019461835,0.00008323759,0.0000782775,0.000020411968,0.000020000129,0.006900673,0.000089732006,0.006081608,0.9796608,0.0004643304,0.006403666],"study_design_scores_gemma":[0.0008445875,0.00034666903,0.00009400727,0.00003760697,0.000025537007,0.00010145755,0.0011436873,0.24265501,0.0053414563,0.7451977,0.0035220652,0.0006901895],"about_ca_topic_score_codex":0.0000011996265,"about_ca_topic_score_gemma":0.000003090373,"teacher_disagreement_score":0.68896824,"about_ca_system_score_codex":0.00001861503,"about_ca_system_score_gemma":0.000015736536,"threshold_uncertainty_score":0.48974046},"labels":[],"label_agreement":null},{"id":"W1995021079","doi":"10.1007/s00012-010-0092-1","title":"Rings and Gödel algebras","year":2010,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Subcategory; Morphism; Pure mathematics; Algebraic structure; Semiring; Ring theory; Ring (chemistry); Algebra over a field; Combinatorics; Commutative ring; Commutative property","score_opus":0.004920701982063427,"score_gpt":0.19895304459751662,"score_spread":0.19403234261545318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995021079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8482499,0.00012445915,0.129601,0.002495739,0.00071878947,0.00016249473,0.0000035558674,0.00060547254,0.018038554],"genre_scores_gemma":[0.96543336,0.00003178827,0.032868702,0.00085390295,0.00008034988,0.0000025147397,0.0000025254549,0.00001269477,0.0007141662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891526,0.000022963035,0.0001263306,0.00044444564,0.00017083735,0.00032014473],"domain_scores_gemma":[0.99905056,0.000089531706,0.000064121705,0.0005507329,0.000054340468,0.00019074502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113413094,0.00016702212,0.00014857523,0.0001250527,0.00017992592,0.000118707474,0.00071268727,0.000096421994,0.000081169084],"category_scores_gemma":[0.000042630076,0.00015751865,0.00004763135,0.0003293473,0.0001482275,0.0010331523,0.00036263655,0.00028937752,0.00007858472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023927528,0.000018526043,0.0010191377,0.000003773795,0.000010715803,0.000041427436,0.00044078837,0.0000018196089,0.0047669318,0.9736961,0.00059483864,0.019403564],"study_design_scores_gemma":[0.0024761558,0.00032208188,0.04818865,0.00003112185,0.000050455295,0.0004231311,0.00045509244,0.009590601,0.018627705,0.68055403,0.23751959,0.0017613526],"about_ca_topic_score_codex":0.000051662035,"about_ca_topic_score_gemma":0.000050784984,"teacher_disagreement_score":0.29314202,"about_ca_system_score_codex":0.000013244036,"about_ca_system_score_gemma":0.000038769627,"threshold_uncertainty_score":0.6423424},"labels":[],"label_agreement":null},{"id":"W19966199","doi":"10.3899/jrheum.090307","title":"Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation","year":2005,"lang":"en","type":"article","venue":"The Journal of Rheumatology","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Negation; Predicate functor logic; Negation as failure; Algebra over a field; Predicate logic; Mathematics; T-norm; Calculus (dental); Algebraic number; Norm (philosophy); Autoepistemic logic; Discrete mathematics; Computer science; Pure mathematics; Multimodal logic; Fuzzy logic; Programming language; Artificial intelligence; Description logic; Epistemology; Fuzzy set; Medicine","score_opus":0.015033505963469687,"score_gpt":0.24743210342513164,"score_spread":0.23239859746166194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19966199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52558756,0.00027487942,0.4696972,0.0041330876,0.00011717354,0.00006321236,1.59541e-7,0.0000174916,0.00010922701],"genre_scores_gemma":[0.982348,0.00007391432,0.016876727,0.00066076615,0.000020036467,0.0000017950499,2.1021289e-7,0.00000544598,0.000013056501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987767,0.0003286052,0.0003058973,0.00011146668,0.00025214464,0.00022519023],"domain_scores_gemma":[0.99865407,0.00035338564,0.00048873475,0.0003137719,0.0001264764,0.000063552216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079625245,0.000112805894,0.00019092161,0.00008840697,0.00024471505,0.000041213058,0.0010572607,0.000048371076,0.000013527075],"category_scores_gemma":[0.00005091714,0.000049767063,0.00004271384,0.00020296131,0.000136022,0.00058218057,0.00007797808,0.0003508518,0.000010817886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009850237,0.00048821417,0.05689987,0.000021938431,0.0001998259,0.00007103754,0.011105898,0.14671732,0.0013107536,0.66683286,0.0004197369,0.11494754],"study_design_scores_gemma":[0.0058883433,0.005454747,0.067471355,0.0002185494,0.00014649743,0.033378948,0.0037731945,0.54757714,0.003506893,0.32962602,0.0020304944,0.0009278105],"about_ca_topic_score_codex":0.000022347782,"about_ca_topic_score_gemma":0.00013012317,"teacher_disagreement_score":0.4567605,"about_ca_system_score_codex":0.00006031341,"about_ca_system_score_gemma":0.00011096367,"threshold_uncertainty_score":0.20294419},"labels":[],"label_agreement":null},{"id":"W1997721056","doi":"10.1007/s00605-007-0468-2","title":"The shrinking principle and the axiom of choice","year":2007,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Axiom of choice; Constructive set theory; Zermelo–Fraenkel set theory; Mathematics; Urelement; Axiom; Equivalence (formal languages); Constructive; Simple (philosophy); Constructive proof; Set theory; Discrete mathematics; Set (abstract data type); Mathematical economics; Calculus (dental); Pure mathematics; Computer science; Geometry; Process (computing); Epistemology","score_opus":0.013921935771715232,"score_gpt":0.29204729835963333,"score_spread":0.2781253625879181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997721056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21860956,0.064580485,0.6887264,0.0063976273,0.0026549252,0.0019934762,0.00000941984,0.00024568258,0.016782422],"genre_scores_gemma":[0.98647183,0.0010062868,0.009994208,0.00040989392,0.00038708423,0.000024421131,0.0000011304894,0.000034113982,0.0016710276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725443,0.00015562135,0.00080866774,0.00047509914,0.0006471131,0.0006590514],"domain_scores_gemma":[0.99424887,0.0037118418,0.0006169124,0.0011658291,0.0001394292,0.00011711944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033452641,0.0003178876,0.00044370382,0.000076634446,0.00080982095,0.00025352,0.0015830665,0.00011693564,0.000019261926],"category_scores_gemma":[0.0005753803,0.00016716374,0.00017287546,0.000507261,0.0008838181,0.00028086276,0.00097108306,0.0004112029,0.000065656895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055709144,0.00006916728,0.00029632388,0.000116874246,0.00008769546,0.000014597953,0.0044696373,0.000053658558,0.00015006357,0.93809515,0.000116624266,0.056474507],"study_design_scores_gemma":[0.0032752114,0.00019942272,0.014726988,0.00042063236,0.00016689212,0.00008854288,0.00083829125,0.05137483,0.0038724404,0.7738562,0.15039392,0.0007865987],"about_ca_topic_score_codex":0.00002701929,"about_ca_topic_score_gemma":0.000038439888,"teacher_disagreement_score":0.76786226,"about_ca_system_score_codex":0.000039731305,"about_ca_system_score_gemma":0.00005331644,"threshold_uncertainty_score":0.68167394},"labels":[],"label_agreement":null},{"id":"W1999417206","doi":"10.1007/s11225-005-0291-5","title":"On relative universality and Q-universality","year":2004,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Universality (dynamical systems); Mathematics; Computational linguistics; Discrete mathematics; Linguistics; Philosophy; Physics; Quantum mechanics","score_opus":0.016570444681276147,"score_gpt":0.2384107521854373,"score_spread":0.22184030750416117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999417206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23328622,0.00022996157,0.60096633,0.004800484,0.00027236485,0.00031563104,0.00000583691,0.00041578492,0.15970738],"genre_scores_gemma":[0.98987305,0.000040360013,0.009483968,0.00046302113,0.000015687508,0.0000019314223,6.3079824e-7,0.0000025878442,0.00011873966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991452,0.00005709833,0.00008594055,0.00038045784,0.00013769332,0.00019357115],"domain_scores_gemma":[0.9994222,0.00012360267,0.00005214863,0.000288309,0.000034321896,0.00007941909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001138224,0.0001161504,0.00013860929,0.000035948535,0.00021382187,0.000024893941,0.00028727474,0.00004628686,0.000009989325],"category_scores_gemma":[0.00005928313,0.00009073133,0.000036114645,0.00024007511,0.0001293746,0.00034312057,0.00023653201,0.00014532708,0.00004735388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007295447,0.00005078353,0.00021299253,0.0000015772908,0.000011179048,0.000041982938,0.00060438487,0.00014928781,0.000020537429,0.99747914,0.00003842121,0.0013824444],"study_design_scores_gemma":[0.000759378,0.00034046045,0.047905505,0.000009799644,0.0000062116947,0.000004821864,0.00020075477,0.000032047195,0.00008165022,0.9487878,0.0016856737,0.00018588855],"about_ca_topic_score_codex":0.000018953233,"about_ca_topic_score_gemma":0.000009141576,"teacher_disagreement_score":0.75658685,"about_ca_system_score_codex":0.00008515699,"about_ca_system_score_gemma":0.000042857642,"threshold_uncertainty_score":0.36999163},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02995590427606405,"score_gpt":0.2463815541406155,"score_spread":0.21642564986455146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000595177","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066675656,0.00037149768,0.4555238,0.009045327,0.0016060866,0.0007694402,0.00001636305,0.00017028442,0.46582156],"genre_scores_gemma":[0.9953065,0.000011448842,0.003302575,0.0011807036,0.00018401469,0.0000037281718,8.888463e-7,0.0000021955043,0.000007963181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995802,0.000023096802,0.00010970297,0.00012332553,0.00008673782,0.000076941025],"domain_scores_gemma":[0.99952805,0.00013995668,0.000038519418,0.00015991919,0.00009296953,0.000040571093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000535424,0.0000606902,0.00007514359,0.000016730257,0.00007213364,0.000037187918,0.00018144715,0.00002984516,0.000046036257],"category_scores_gemma":[0.00041414125,0.00003485259,0.000017679264,0.0000793884,0.00014640388,0.000014233884,0.000056091205,0.00006504221,0.00001775245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.00648e-7,0.000017983228,0.00014009149,0.000003329976,0.0000023744747,0.0000010303457,0.000047885915,0.000026870528,0.000030726336,0.99748677,0.000068238944,0.0021741122],"study_design_scores_gemma":[0.00006672716,0.00009578146,0.00050856324,0.000012189673,0.000001599341,9.878914e-7,0.0000039382953,0.005806485,0.00029742316,0.9916748,0.0014719496,0.00005957912],"about_ca_topic_score_codex":0.0000017950309,"about_ca_topic_score_gemma":5.9186288e-8,"teacher_disagreement_score":0.9286308,"about_ca_system_score_codex":0.0000024921671,"about_ca_system_score_gemma":0.0000089390305,"threshold_uncertainty_score":0.14212474},"labels":[],"label_agreement":null},{"id":"W2001037801","doi":"10.1093/jigpal/jzl025","title":"A Modal Extension of Weak Generalisation Predicate Logic","year":2006,"lang":"fr","type":"article","venue":"Logic Journal of IGPL","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Modal logic; Modal; Predicate (mathematical logic); Mathematical proof; Extension (predicate logic); Mathematics; Axiom; Intuitionistic logic; Normal modal logic; Corollary; Predicate logic; Kripke semantics; Intermediate logic; Dynamic logic (digital electronics); Computer science; Algebra over a field; Discrete mathematics; Theoretical computer science; Pure mathematics; Description logic; Programming language; Linear logic","score_opus":0.04059399223811998,"score_gpt":0.2641512149283162,"score_spread":0.22355722269019623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001037801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05034665,0.024069507,0.8897648,0.009979916,0.0031636152,0.00016732258,0.000008289635,0.000030523122,0.022469388],"genre_scores_gemma":[0.91477376,0.0008255898,0.08080088,0.00051543914,0.001195121,0.0000012465704,0.000003104912,0.000012615396,0.0018722285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718803,0.0002852306,0.001126442,0.00030836475,0.0006498649,0.00044206373],"domain_scores_gemma":[0.99723077,0.00013316853,0.0014714914,0.00037446676,0.00064138597,0.00014871843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083058106,0.00025154377,0.0005234087,0.00020735699,0.0001209507,0.000067286244,0.0007259448,0.0002093351,0.00012131246],"category_scores_gemma":[0.00014939305,0.00019538411,0.00029467774,0.00046292203,0.00027198784,0.0008662344,0.00016299362,0.00042064948,0.000030478282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056186178,0.0003934356,0.00019120869,0.00005500682,0.00003039869,0.00025381078,0.00019598914,0.042831168,0.01546244,0.91845506,0.002889893,0.019185422],"study_design_scores_gemma":[0.0010949147,0.0012948646,0.015940418,0.00026555525,0.00008108256,0.0015865841,0.000064027496,0.028730232,0.0031848953,0.94129217,0.0061822445,0.00028303728],"about_ca_topic_score_codex":0.00007884749,"about_ca_topic_score_gemma":0.00001019093,"teacher_disagreement_score":0.8644271,"about_ca_system_score_codex":0.00010155256,"about_ca_system_score_gemma":0.00018432434,"threshold_uncertainty_score":0.7967533},"labels":[],"label_agreement":null},{"id":"W2001758601","doi":"10.2178/bsl/1174668216","title":"Incompleteness in a General Setting","year":2007,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematical proof; Predicate (mathematical logic); Mathematics; Property (philosophy); Formal system; Syntax; Gödel's incompleteness theorems; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical economics; Calculus (dental); Linguistics; Computer science; Epistemology; Programming language; Philosophy; Gödel","score_opus":0.012466839931354714,"score_gpt":0.25313755626364387,"score_spread":0.24067071633228915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001758601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47249687,0.00054911396,0.48685288,0.0040806117,0.0003622379,0.0003082972,0.0000017286252,0.00021697035,0.035131294],"genre_scores_gemma":[0.8952947,0.000011440323,0.10284947,0.0015407825,0.00008793359,0.000006298338,0.000001472621,0.0000070288993,0.00020082724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985892,0.000053159747,0.0003968718,0.00032890614,0.00020375576,0.00042809223],"domain_scores_gemma":[0.99922687,0.0001632352,0.00013323822,0.00035746684,0.000048743663,0.00007041902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005926424,0.00013811153,0.00024634867,0.00016367242,0.00005027494,0.000019496267,0.0007114557,0.00007253049,0.0000761631],"category_scores_gemma":[0.00008167109,0.00011966391,0.000060725008,0.0003589679,0.000065225155,0.000045296903,0.00027052397,0.00014220648,0.00008199413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028023818,0.00027830875,0.010974071,0.000071042625,0.000013424346,0.00030578973,0.0011944714,0.0014425957,0.0063914456,0.8611356,0.0012401268,0.11692512],"study_design_scores_gemma":[0.0035882902,0.0005500789,0.38558012,0.00022565643,0.000012310929,0.00029274487,0.0005153982,0.0069132703,0.0123636685,0.4115628,0.17678088,0.0016147589],"about_ca_topic_score_codex":0.000091001006,"about_ca_topic_score_gemma":0.000009990446,"teacher_disagreement_score":0.44957277,"about_ca_system_score_codex":0.000035616868,"about_ca_system_score_gemma":0.00002494651,"threshold_uncertainty_score":0.48797527},"labels":[],"label_agreement":null},{"id":"W2002498893","doi":"10.2478/s11533-008-0060-6","title":"Equational spectrum of Hilbert varieties","year":2008,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Commutative property; Pure mathematics; Class (philosophy); Spectrum (functional analysis); Set (abstract data type); Hilbert's fourteenth problem; Equational logic; Algebra over a field; Discrete mathematics; Hilbert space; Projective Hilbert space; Reproducing kernel Hilbert space; Computer science","score_opus":0.05494513687573987,"score_gpt":0.2745515147663646,"score_spread":0.2196063778906247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002498893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005649703,0.000032026528,0.947403,0.00044144606,0.00006615326,0.00013227631,9.943814e-7,0.000024685498,0.046249725],"genre_scores_gemma":[0.5099463,0.0000121340245,0.48738968,0.00010066108,0.000018418106,0.000007202416,0.0000013009465,0.000004867521,0.0025194641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999366,0.000012612588,0.00019330357,0.00012171473,0.00019614084,0.000110252346],"domain_scores_gemma":[0.9993468,0.00012308144,0.000111216235,0.00035434304,0.000034399414,0.00003018589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013070664,0.00006774445,0.00014868694,0.000027315424,0.000086142274,0.000037823138,0.0010027318,0.00002300033,0.000107857304],"category_scores_gemma":[0.000049318864,0.000055171928,0.000038318893,0.00015296187,0.000054406533,0.00036685672,0.00039507475,0.000044940938,0.00008235871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.218262e-7,0.000078698,0.00006162119,0.00001139997,0.0000071548525,0.0000042620673,0.0011128726,0.000070332215,0.0000709877,0.9979178,0.00031524326,0.00034894576],"study_design_scores_gemma":[0.00014280864,0.000044467244,0.00043574124,0.000011824993,0.0000026319492,0.00004947082,0.000035054974,0.011705186,0.0019938834,0.98471016,0.000773858,0.00009489963],"about_ca_topic_score_codex":0.000005373911,"about_ca_topic_score_gemma":0.0000017591944,"teacher_disagreement_score":0.5042966,"about_ca_system_score_codex":0.000010468514,"about_ca_system_score_gemma":0.00005974437,"threshold_uncertainty_score":0.22498459},"labels":[],"label_agreement":null},{"id":"W2002735710","doi":"10.1007/s00012-010-0071-6","title":"Closed classes of functions, generalized constraints, and clusters","year":2010,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Galois connection; Permutation (music); Connection (principal bundle); Galois theory; Class (philosophy); Algebra over a field; Cyclic permutation","score_opus":0.00751340625836686,"score_gpt":0.211873476797552,"score_spread":0.20436007053918515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002735710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7941619,0.00010153251,0.19765058,0.001057011,0.0006677387,0.00015924923,0.000013856741,0.00019084578,0.005997302],"genre_scores_gemma":[0.9694504,0.000040870527,0.029783247,0.00030939287,0.000037133497,0.0000016468633,0.0000067725505,0.0000070306373,0.00036349098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991865,0.00004107817,0.00015843107,0.0002874913,0.00013438822,0.00019210688],"domain_scores_gemma":[0.9992211,0.000115216215,0.00010099766,0.00038417947,0.00007338586,0.00010511824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009335962,0.00012369225,0.00016913061,0.00012290424,0.00009886834,0.000038675797,0.00037137797,0.00008157501,0.00009955118],"category_scores_gemma":[0.000038998216,0.00011511616,0.000053794374,0.00026770477,0.00035905675,0.00047408132,0.00015068811,0.00016073407,0.000010074236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013060688,0.00004093984,0.0013646183,0.00001248301,0.000039543313,0.000019781683,0.00042097742,0.000014784142,0.020573635,0.94142854,0.0012235205,0.034848098],"study_design_scores_gemma":[0.023085004,0.0018070915,0.09887506,0.00018787141,0.0004745622,0.0007864042,0.007332373,0.042774804,0.097071245,0.3638054,0.3586617,0.005138446],"about_ca_topic_score_codex":0.000040947827,"about_ca_topic_score_gemma":0.000050998173,"teacher_disagreement_score":0.5776231,"about_ca_system_score_codex":0.000010392798,"about_ca_system_score_gemma":0.00006319962,"threshold_uncertainty_score":0.4694301},"labels":[],"label_agreement":null},{"id":"W2002737042","doi":"10.1142/s1793557109000029","title":"IDENTITIES IN BIREGULAR LEFTMOST GRAPH VARIETIES OF TYPE (2,0)","year":2009,"lang":"en","type":"article","venue":"Asian-European Journal of Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mahasarakham University; McMaster University","keywords":"Mathematics; Graph; Combinatorics; Voltage graph; Vertex-transitive graph; Discrete mathematics; Graph algebra; Variety (cybernetics); Integral graph; Symmetric graph; Line graph","score_opus":0.014500592829322152,"score_gpt":0.2299382444649527,"score_spread":0.21543765163563056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002737042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22162159,0.0015416718,0.7509816,0.0015048563,0.00055365416,0.00012893202,0.0000011236949,0.00005554319,0.023610996],"genre_scores_gemma":[0.8867833,0.00012675195,0.11275965,0.0001341532,0.000056052802,6.345803e-8,1.8541343e-7,0.000009733178,0.00013009962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998612,0.00013226547,0.00066724984,0.00009758679,0.00032229203,0.00016862231],"domain_scores_gemma":[0.99887335,0.00007317275,0.0005149788,0.0003053245,0.00017319762,0.00005998638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081833,0.000121259334,0.00029200106,0.00017306824,0.000035284123,0.000061982144,0.0008578661,0.000020845631,0.000011249196],"category_scores_gemma":[0.00017617342,0.000096610696,0.00012054262,0.0003931907,0.00006043913,0.00046932558,0.000070090944,0.00017781807,0.000015110499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003222061,0.0010338761,0.0009767042,0.00020431764,0.00011131551,0.0015812974,0.021730408,0.001110721,0.005207771,0.90224105,0.0028852199,0.06288511],"study_design_scores_gemma":[0.0011527974,0.0016134635,0.019183572,0.0006199311,0.000042327294,0.00093728234,0.002160317,0.0008686488,0.002274902,0.96970296,0.0010476826,0.00039609586],"about_ca_topic_score_codex":2.296051e-7,"about_ca_topic_score_gemma":4.21592e-7,"teacher_disagreement_score":0.6651617,"about_ca_system_score_codex":0.000014825538,"about_ca_system_score_gemma":0.00004038022,"threshold_uncertainty_score":0.393967},"labels":[],"label_agreement":null},{"id":"W2002848440","doi":"10.1007/s00012-010-0070-7","title":"The variety generated by planar modular lattices","year":2010,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Variety (cybernetics); Mathematics; Modular design; Planar; Algebra over a field; Pure mathematics; Computer science; Programming language; Computer graphics (images)","score_opus":0.005528904384876259,"score_gpt":0.1993370940675357,"score_spread":0.19380818968265942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002848440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45172122,0.00085637433,0.5217413,0.010033646,0.0024492976,0.00038644322,0.000034254226,0.0010178981,0.011759593],"genre_scores_gemma":[0.98323464,0.000098351455,0.013675972,0.0010114084,0.00011822332,0.000004759446,0.000021212507,0.000016424197,0.0018190088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988863,0.00005862101,0.0001333035,0.0003548857,0.00021787049,0.00034901674],"domain_scores_gemma":[0.99882716,0.00016481787,0.00008343833,0.00072534557,0.000074381605,0.00012483576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001737937,0.00015456337,0.00011194452,0.00003567387,0.0005300062,0.00021742911,0.0013500397,0.00009523783,0.000034827142],"category_scores_gemma":[0.00003728893,0.00010955033,0.00005746079,0.00038516324,0.00014593762,0.0006587249,0.00014259224,0.00029903624,0.00007007269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051998354,0.000029011524,0.00013580486,0.0000017335201,0.00003670399,0.000027968823,0.00031055222,0.00003767444,0.02566816,0.9503866,0.01437625,0.008984386],"study_design_scores_gemma":[0.00077092816,0.00012170156,0.0010420643,0.000005227554,0.000027649852,0.0000371797,0.00020270396,0.034730457,0.019059325,0.103799015,0.83956075,0.00064297597],"about_ca_topic_score_codex":0.00007981722,"about_ca_topic_score_gemma":0.00009056287,"teacher_disagreement_score":0.84658754,"about_ca_system_score_codex":0.000017652354,"about_ca_system_score_gemma":0.000049409166,"threshold_uncertainty_score":0.4467333},"labels":[],"label_agreement":null},{"id":"W2004467358","doi":"10.1016/j.jmp.2014.01.002","title":"The pseudo-transitivity of preference relations: Strict and weak -Ferrers properties","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Psychology","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Transitive relation; Preference; Mathematics; Mathematical economics; Combinatorics; Statistics","score_opus":0.048548410739758394,"score_gpt":0.28735070579641253,"score_spread":0.23880229505665412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004467358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16911615,0.00029207478,0.82197344,0.0036662063,0.00015219217,0.00006863484,1.6392751e-7,0.000009802558,0.0047213086],"genre_scores_gemma":[0.9721176,0.000081526036,0.02757939,0.00011914345,0.000029452645,0.0000015454744,1.9580588e-8,0.000003066389,0.00006825056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989434,0.00022632063,0.00041620922,0.000105475636,0.00017521923,0.00013340013],"domain_scores_gemma":[0.9986453,0.00067445845,0.00027607768,0.00024042222,0.00010424657,0.000059515492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010422852,0.00007471621,0.00021526049,0.00005141121,0.00007734619,0.000024428013,0.0004060149,0.00005342184,0.000006415626],"category_scores_gemma":[0.00059203786,0.000039143353,0.000053202504,0.00011446926,0.00022184898,0.00021443845,0.000043581425,0.0002130675,0.0000072048097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083546154,0.00022890487,0.000267184,0.000053758267,0.000047048565,0.000003969434,0.0010464233,0.000065369175,0.0040730764,0.92788553,0.0005749712,0.0656702],"study_design_scores_gemma":[0.0005469918,0.0006584126,0.013171494,0.00009828145,0.000019237787,0.0004266235,0.00007383464,0.0069504506,0.0004764884,0.976365,0.0011134512,0.000099782286],"about_ca_topic_score_codex":1.472489e-7,"about_ca_topic_score_gemma":4.903801e-7,"teacher_disagreement_score":0.80300146,"about_ca_system_score_codex":0.000006689833,"about_ca_system_score_gemma":0.000020058473,"threshold_uncertainty_score":0.15962197},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04081405847437331,"score_gpt":0.2583620564928636,"score_spread":0.21754799801849029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004738733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31486386,0.00012199541,0.67674476,0.007447111,0.000284487,0.00013981177,0.0000057524912,0.000060845923,0.0003313951],"genre_scores_gemma":[0.89773303,0.000038517726,0.09828245,0.0012005466,0.00015598157,0.00000186441,6.975316e-7,0.000012454852,0.0025744673],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847776,0.000082243285,0.000498838,0.00013686359,0.00050486135,0.00029945004],"domain_scores_gemma":[0.9988564,0.00014059425,0.00036203564,0.00036413292,0.00012899896,0.00014781873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035409478,0.00015523403,0.00030599724,0.0000120824625,0.00031421767,0.000072599185,0.0012577458,0.00009052134,0.000095006035],"category_scores_gemma":[0.00007909406,0.00008908526,0.0004481997,0.00030227224,0.00021433758,0.000355541,0.00018456359,0.00041018095,0.000028272148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009808092,0.0004268304,0.0007469292,0.000077218276,0.00023163283,0.000043510467,0.004617407,0.00050716463,0.018443512,0.09977119,0.874517,0.0006077958],"study_design_scores_gemma":[0.0016495119,0.00042628945,0.0045147864,0.000106085194,0.00009336233,0.0037081253,0.00069789845,0.014955871,0.025339488,0.8964982,0.051231958,0.00077842723],"about_ca_topic_score_codex":0.0000014670975,"about_ca_topic_score_gemma":1.16144186e-7,"teacher_disagreement_score":0.82328504,"about_ca_system_score_codex":0.00006183968,"about_ca_system_score_gemma":0.000056890738,"threshold_uncertainty_score":0.36327913},"labels":[],"label_agreement":null},{"id":"W2005119283","doi":"10.1017/s0960129511000053","title":"Domains occur among spaces as strict algebras among lax","year":2011,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Monad (category theory); Mathematics; Pure mathematics; Compact-open topology; Topological space; Algebra over a field; Topology (electrical circuits); Topological tensor product; Functor; Combinatorics; Functional analysis","score_opus":0.018982194511927127,"score_gpt":0.252168824692303,"score_spread":0.2331866301803759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005119283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41679162,0.000024485144,0.579706,0.000058300597,0.00036102327,0.00019575651,6.1462134e-7,0.00016935267,0.002692858],"genre_scores_gemma":[0.73087484,0.0000021856695,0.26878327,0.00023925143,0.000062767525,0.000011928504,2.8096125e-7,0.000009193266,0.000016252456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964786,0.00010748685,0.00051622087,0.0010520702,0.000930303,0.000915316],"domain_scores_gemma":[0.99793863,0.00026115967,0.00019406603,0.001146881,0.00009151158,0.0003677405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085358176,0.0003536755,0.00039092635,0.0003754164,0.00032500835,0.0005062949,0.0038259423,0.00009978003,0.00011854932],"category_scores_gemma":[0.00022527263,0.00026608104,0.00009931217,0.0017935373,0.0012534757,0.0017154925,0.0015163008,0.00035436635,0.00008038988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053953604,0.00009751889,0.012264931,0.000025857184,0.0000070808996,0.00017629194,0.0039463523,0.000297471,0.00006037943,0.96183056,0.000053433756,0.021234727],"study_design_scores_gemma":[0.000221521,0.00009141584,0.12951215,0.00004124286,0.0000036178224,0.0000683191,0.00004650927,0.083971255,0.0013699579,0.78431153,0.00001550864,0.00034696198],"about_ca_topic_score_codex":0.000050052684,"about_ca_topic_score_gemma":0.000019406778,"teacher_disagreement_score":0.31408325,"about_ca_system_score_codex":0.000097674034,"about_ca_system_score_gemma":0.000113331866,"threshold_uncertainty_score":0.99997914},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005953063401598615,"score_gpt":0.222598641082001,"score_spread":0.21664557768040238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007471451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08386606,0.0076384107,0.8245633,0.029260062,0.0012093305,0.00043002245,0.00000451626,0.0004704449,0.05255783],"genre_scores_gemma":[0.9918603,0.000054514483,0.0064010746,0.000592306,0.000053016043,0.0000056857243,6.596704e-7,0.0000043045857,0.00102817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928576,0.000019236746,0.00014522324,0.00014738909,0.00013920492,0.00026319866],"domain_scores_gemma":[0.9993414,0.00009130054,0.00006690125,0.00043317588,0.00002720661,0.000040009145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013364459,0.000070726965,0.000077150784,0.0000212335,0.00014600718,0.00002659709,0.00070904836,0.000029729872,0.000006018881],"category_scores_gemma":[0.000018804505,0.000044410852,0.000050372342,0.00014848377,0.000057817364,0.00025861245,0.00017615812,0.00007828739,0.0000639631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031762816,0.000026397214,0.00044746764,0.0000028918819,0.000007085267,0.0000018843855,0.00026323792,0.00009716211,0.001560315,0.74427825,0.006056686,0.24725544],"study_design_scores_gemma":[0.00051167625,0.0002172055,0.0059007662,0.000017591734,0.00000629981,0.000041769745,0.00035937494,0.019568378,0.03389518,0.25105792,0.688056,0.00036783714],"about_ca_topic_score_codex":0.0000064476976,"about_ca_topic_score_gemma":0.000051495284,"teacher_disagreement_score":0.9079942,"about_ca_system_score_codex":0.000016095179,"about_ca_system_score_gemma":0.000019775498,"threshold_uncertainty_score":0.1811022},"labels":[],"label_agreement":null},{"id":"W2007485755","doi":"10.1142/s0218196700000212","title":"DUALITY OF NORMALLY PRESENTED VARIETIES","year":2000,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Variety (cybernetics); Nilpotent; Duality (order theory); Type (biology); Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.01010103049099289,"score_gpt":0.270395409861572,"score_spread":0.26029437937057914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007485755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5259277,0.00015107477,0.47187775,0.00093201286,0.0002760181,0.000027890583,0.000001184601,0.000011731364,0.00079459365],"genre_scores_gemma":[0.983855,0.00009052584,0.015716782,0.00017094983,0.00009295888,4.3385637e-7,0.0000019417519,0.000002633909,0.00006875448],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898654,0.00005228226,0.00039188226,0.000094433984,0.00040050843,0.00007433473],"domain_scores_gemma":[0.9990764,0.000096994416,0.0002790531,0.000061796934,0.00043902177,0.00004670753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018897308,0.00006952371,0.00012923642,0.00011082103,0.000030287698,0.00006645327,0.00039095964,0.000028107876,0.000031057403],"category_scores_gemma":[0.000026824004,0.000058779107,0.00005860247,0.00010130226,0.000048992188,0.00070613134,0.0000524926,0.00008741894,0.0000032279124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024176543,0.00029959425,0.0045146323,0.000020704256,0.00025600576,0.000083820334,0.0023789995,0.016235406,0.0009957172,0.22097659,0.0004064703,0.7535903],"study_design_scores_gemma":[0.0028704607,0.00088837475,0.19287568,0.00012877739,0.00003544431,0.0010892767,0.00019085177,0.094344266,0.004400094,0.69902813,0.0037834544,0.0003651767],"about_ca_topic_score_codex":0.0000064124197,"about_ca_topic_score_gemma":7.0454615e-7,"teacher_disagreement_score":0.7532251,"about_ca_system_score_codex":0.000014765572,"about_ca_system_score_gemma":0.000044426157,"threshold_uncertainty_score":0.23969425},"labels":[],"label_agreement":null},{"id":"W2008276841","doi":"10.1007/s10485-004-3884-7","title":"Configurations in Coproducts of Priestley Spaces","year":2005,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Univerzita Karlova v Praze","keywords":"Coproduct; Mathematics; Combinatorics; Variety (cybernetics); Bounded function; Discrete mathematics; Context (archaeology); Type (biology); Partially ordered set; Order (exchange); Pure mathematics; Mathematical analysis","score_opus":0.010660538582705728,"score_gpt":0.23607148993089533,"score_spread":0.22541095134818961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008276841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24453835,0.00063510286,0.7272758,0.004001142,0.00031414436,0.00055654155,0.0000018162326,0.00024458958,0.022432512],"genre_scores_gemma":[0.9870361,0.000010338283,0.012603634,0.0002035972,0.00008737261,0.000013187569,0.0000029471526,0.000004458593,0.000038347578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910325,0.00001548568,0.00021488324,0.00028586667,0.00017606553,0.00020442711],"domain_scores_gemma":[0.99947065,0.000059467846,0.00007766064,0.00030676575,0.00003102044,0.000054420932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059075413,0.00011053288,0.00017238119,0.00006805486,0.00004793653,0.000032814878,0.0004290431,0.000057205234,0.000038666814],"category_scores_gemma":[0.000026444892,0.00008709912,0.000022869222,0.00041698723,0.00007528129,0.00014951744,0.000077323726,0.00012949239,0.0000146171315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003681156,0.000018637895,0.000069246154,0.0000043663226,0.0000028949748,0.0000015264231,0.00028405045,0.0014798519,0.0076609636,0.9636294,0.0001869165,0.026658444],"study_design_scores_gemma":[0.00036374276,0.0000356369,0.01793312,6.5129865e-7,0.0000032374207,0.000009525505,0.00006623483,0.00058002124,0.04554982,0.92679024,0.008459905,0.00020789393],"about_ca_topic_score_codex":0.000016801556,"about_ca_topic_score_gemma":0.000025528252,"teacher_disagreement_score":0.74249774,"about_ca_system_score_codex":0.000030831143,"about_ca_system_score_gemma":0.00003848697,"threshold_uncertainty_score":0.3551799},"labels":[],"label_agreement":null},{"id":"W2008418270","doi":"10.1145/1182553.1182565","title":"WWCA 2006 abstracts","year":2006,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"George (robot); Library science; China; State (computer science); Sociology; Political science; Art history; History; Law; Mathematics; Computer science; Algorithm","score_opus":0.027499002313740084,"score_gpt":0.2826450610855237,"score_spread":0.2551460587717836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008418270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033049587,0.0016927505,0.94222,0.008922114,0.00046155634,0.0003407431,0.0000045739976,0.0006495603,0.012659131],"genre_scores_gemma":[0.55679196,0.00006155561,0.44232228,0.00060908287,0.000079619895,0.000028409922,0.000018999242,0.000009643777,0.00007843603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982811,0.00014809292,0.00054391415,0.00041846815,0.00021098596,0.00039742776],"domain_scores_gemma":[0.99335253,0.0005715871,0.00015289843,0.005775036,0.00008373455,0.00006423459],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00030983292,0.00020257689,0.00021691382,0.0002392485,0.0002422058,0.00018939852,0.0071363742,0.000091324306,0.000011039829],"category_scores_gemma":[0.0000423506,0.00020683178,0.00007734227,0.0008223806,0.00014029759,0.0007287186,0.003068369,0.00037940606,0.0002380412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027407293,0.0006586153,0.0052194484,0.000011668934,0.000014929158,0.000029619752,0.00032204902,0.005828421,0.00016885165,0.8241491,0.0077930004,0.15580161],"study_design_scores_gemma":[0.0007636135,0.000070213304,0.14777422,0.00005556786,0.0000058746664,0.00006150169,0.000009947232,0.0820557,0.00030077717,0.7161434,0.052145537,0.00061361585],"about_ca_topic_score_codex":0.0001841191,"about_ca_topic_score_gemma":0.0002588941,"teacher_disagreement_score":0.5237424,"about_ca_system_score_codex":0.00007657473,"about_ca_system_score_gemma":0.00006276262,"threshold_uncertainty_score":0.99823546},"labels":[],"label_agreement":null},{"id":"W2008497909","doi":"10.1515/integ.2011.044","title":"Projective p-Orderings and Homogeneous Integer-Valued Polynomials","year":2011,"lang":"en","type":"article","venue":"Integers","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Homogeneous; Integer (computer science); Projective test; Combinatorics; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.028492758242884962,"score_gpt":0.22258107384100045,"score_spread":0.19408831559811549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008497909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22920537,0.00049192004,0.7278387,0.00023069048,0.00064158515,0.0003721363,0.0000025214003,0.0004398498,0.040777232],"genre_scores_gemma":[0.9614393,0.000017358803,0.03779556,0.00039017285,0.00003335793,0.0000234406,2.9506097e-7,0.000010229061,0.00029026758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903107,0.000038813974,0.00016497278,0.00038919278,0.000105532345,0.0002704359],"domain_scores_gemma":[0.99942,0.00004355459,0.00007253366,0.0003143224,0.000056711375,0.000092867325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012666792,0.00015326972,0.00016966488,0.000103137165,0.00008100266,0.000050226914,0.0004612896,0.000059043625,0.000030486513],"category_scores_gemma":[0.000076298165,0.00012677127,0.000048819715,0.00020189132,0.000119996264,0.00034920865,0.00021952293,0.00014203036,0.00005126711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015647846,0.00030460602,0.0020779765,0.00005120599,0.00019211699,0.00041106556,0.050380994,0.000028909068,0.012129227,0.5441347,0.0016775621,0.38845518],"study_design_scores_gemma":[0.0040445793,0.0040642903,0.018038087,0.00034064776,0.00011013155,0.0020711613,0.006879656,0.027911305,0.38503456,0.52457947,0.022382881,0.0045432094],"about_ca_topic_score_codex":0.00013411736,"about_ca_topic_score_gemma":0.000014194586,"teacher_disagreement_score":0.73223394,"about_ca_system_score_codex":0.00003783612,"about_ca_system_score_gemma":0.000044171196,"threshold_uncertainty_score":0.51695824},"labels":[],"label_agreement":null},{"id":"W2008543934","doi":"10.1142/s021819671100673x","title":"THE LATTICE OF ALTER EGOS","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Galois connection; Mathematics; Duality (order theory); Lattice (music); Connection (principal bundle); Algebra over a field; Algebraic number; Pure mathematics; Complete lattice; Set (abstract data type); Universal algebra; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.022893004127309997,"score_gpt":0.272628341209779,"score_spread":0.24973533708246903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008543934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27029952,0.00032454808,0.7270021,0.00068156054,0.00078791234,0.00003151727,4.0277962e-7,0.000008226712,0.0008642263],"genre_scores_gemma":[0.9750649,0.00008274473,0.024584228,0.00016381315,0.000082735845,4.784225e-7,2.7717024e-7,0.0000024630651,0.000018409877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992381,0.00003874397,0.00030636272,0.00007110347,0.00027700665,0.00006873844],"domain_scores_gemma":[0.99895877,0.00015470135,0.0003583632,0.00006341812,0.00042884704,0.00003591663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022106593,0.000054851283,0.0000811579,0.00007644102,0.000048170627,0.000050765306,0.00049524667,0.000018642408,0.0000040028967],"category_scores_gemma":[0.000039491268,0.000035660618,0.000048841273,0.00007136021,0.00005348829,0.0004457622,0.00007916828,0.000078680074,0.000002593807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086230495,0.00009324629,0.0016380487,0.0000048478455,0.00014677574,0.000040565472,0.0026395174,0.00024057632,0.00045449255,0.59789276,0.00018004532,0.3965829],"study_design_scores_gemma":[0.0010259325,0.00048685313,0.052226048,0.000063665655,0.000021620168,0.0005645285,0.00026565403,0.019494196,0.0067878254,0.91770846,0.0011973239,0.00015790538],"about_ca_topic_score_codex":0.0000032634662,"about_ca_topic_score_gemma":8.7793745e-7,"teacher_disagreement_score":0.7047653,"about_ca_system_score_codex":0.000011366004,"about_ca_system_score_gemma":0.000030755942,"threshold_uncertainty_score":0.14541978},"labels":[],"label_agreement":null},{"id":"W2008875404","doi":"10.1006/jabr.2001.8914","title":"On the Partially Ordered Monoid Generated by the Operators H, S, P, Ps on Classes of Algebras","year":2001,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Unary operation; Abelian group; Monoid; Closure (psychology); Countable set; Semigroup; Stone's representation theorem for Boolean algebras; Type (biology); Pure mathematics; Combinatorics; Subalgebra; Discrete mathematics; Algebra over a field; Two-element Boolean algebra; Algebra representation","score_opus":0.017836970343950424,"score_gpt":0.24534549076346487,"score_spread":0.22750852041951444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008875404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95432806,0.0006381741,0.03224215,0.011253037,0.00051339035,0.00016344029,0.0000024504923,0.000028153616,0.00083116256],"genre_scores_gemma":[0.99432504,0.00027052264,0.0010484367,0.0039703706,0.00018191009,0.0000043151035,7.32048e-7,0.000015108133,0.00018358098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979661,0.00028694226,0.0006127635,0.00021794921,0.0006024494,0.00031377038],"domain_scores_gemma":[0.99794966,0.00053703337,0.00056018855,0.00057145895,0.00026662176,0.000115048904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006240441,0.00021820997,0.00030765028,0.00009681883,0.0002461082,0.00014927081,0.0015590045,0.000076091404,0.00009465064],"category_scores_gemma":[0.0002623614,0.00010357397,0.00016568658,0.0006328618,0.00011965283,0.00036538555,0.0001014535,0.00046192665,0.00003125868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041597956,0.0010138339,0.0010413827,0.0000119352935,0.00038975803,0.00022436838,0.0013983846,0.011681617,0.041393876,0.7963011,0.107672125,0.038455606],"study_design_scores_gemma":[0.0061600483,0.011010795,0.010374877,0.0004771051,0.00020269175,0.00132913,0.0012470145,0.024009928,0.48382092,0.3704171,0.08910343,0.0018469683],"about_ca_topic_score_codex":0.0000058139453,"about_ca_topic_score_gemma":0.0000073723763,"teacher_disagreement_score":0.44242704,"about_ca_system_score_codex":0.00004235346,"about_ca_system_score_gemma":0.00015822434,"threshold_uncertainty_score":0.4223624},"labels":[],"label_agreement":null},{"id":"W2010716453","doi":"10.1305/ndjfl/1117755151","title":"A Deontic Counterpart of Lewis's S1","year":2005,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Deontic logic; Soundness; Normal modal logic; Modal logic; Modal; Completeness (order theory); Schema (genetic algorithms); Philosophy; Epistemology; Accessibility relation; Calculus (dental); Computer science; Mathematics; Linguistics","score_opus":0.012090972521747225,"score_gpt":0.24930683359058384,"score_spread":0.2372158610688366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010716453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3198997,0.0013335781,0.67183036,0.0015792485,0.00054409966,0.000100703146,0.0000041833887,0.00004101328,0.0046670963],"genre_scores_gemma":[0.94347674,0.000069571186,0.05545556,0.0006907922,0.00019895111,7.8148344e-7,6.5608793e-7,0.000005074435,0.00010188941],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984784,0.000038150825,0.00062090193,0.00012717412,0.00040029042,0.00033505895],"domain_scores_gemma":[0.9987093,0.00007462821,0.000601923,0.0002661556,0.00022807562,0.00011989364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034891503,0.00014284084,0.00033430374,0.00013946928,0.000065016124,0.00004295104,0.0009102991,0.00006624107,0.000079442216],"category_scores_gemma":[0.00006254762,0.000101137455,0.00019078975,0.00024090265,0.0000651013,0.0018246768,0.00013360917,0.00026320064,0.000069799906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042232336,0.0013999351,0.007281313,0.00015706178,0.00026160612,0.00058200926,0.0036721814,0.021478187,0.015254072,0.33425564,0.009028858,0.60620683],"study_design_scores_gemma":[0.017524848,0.017549774,0.0702679,0.001344141,0.00046216263,0.01525637,0.0010530818,0.1511909,0.07494953,0.24999952,0.39669237,0.0037094087],"about_ca_topic_score_codex":0.0000016955454,"about_ca_topic_score_gemma":0.000005261907,"teacher_disagreement_score":0.623577,"about_ca_system_score_codex":0.0000542949,"about_ca_system_score_gemma":0.00008667563,"threshold_uncertainty_score":0.4124266},"labels":[],"label_agreement":null},{"id":"W2010786529","doi":"10.1142/s0218196708004792","title":"CORRIGENDUM: \"MINIMAL SEMIGROUPS GENERATING VARIETIES WITH COMPLEX SUBVARIETY LATTICES\"","year":2008,"lang":"en","type":"erratum","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Pure mathematics; Algebra over a field; Variety (cybernetics); Statistics","score_opus":0.028872833159636967,"score_gpt":0.267831293975929,"score_spread":0.23895846081629202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010786529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011372521,0.001482564,0.9682522,0.00083196023,0.016297037,0.00012714206,0.000011894341,0.000061424136,0.0015632936],"genre_scores_gemma":[0.61768407,0.003534894,0.3526926,0.0035505036,0.010380833,0.00001523327,0.00056752097,0.00013386071,0.011440455],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972591,0.00011176126,0.00077482924,0.00040546592,0.0011923468,0.00025651348],"domain_scores_gemma":[0.99688816,0.00011978703,0.0014048493,0.00017116418,0.0012653163,0.00015072811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023945558,0.00036541352,0.00048287224,0.00034361734,0.00022110104,0.00047322715,0.0010596218,0.00021911973,0.000014603698],"category_scores_gemma":[0.0000507429,0.00029966803,0.00014774593,0.00021058098,0.00014965975,0.0008099257,0.00025461093,0.00079199753,0.0000053276312],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054814556,0.00058076676,0.002722448,0.00018108454,0.0022492167,0.002807388,0.0076822625,0.018540803,0.0005472532,0.06692549,0.78886795,0.10834721],"study_design_scores_gemma":[0.007072817,0.00510642,0.045996472,0.0013800574,0.00037749772,0.026739951,0.0008365475,0.61647457,0.0002650185,0.059718516,0.23270695,0.0033251927],"about_ca_topic_score_codex":0.000013845809,"about_ca_topic_score_gemma":0.000009374615,"teacher_disagreement_score":0.6155596,"about_ca_system_score_codex":0.00010473907,"about_ca_system_score_gemma":0.00044475755,"threshold_uncertainty_score":0.9999455},"labels":[],"label_agreement":null},{"id":"W2011631939","doi":"10.1017/s1446788700003815","title":"Mono-unary algebras are strongly dualizable","year":2002,"lang":"en","type":"article","venue":"Journal of the Australian Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Strong","keywords":"Unary operation; Mathematics; Rank (graph theory); Injective function; Arity; Duality (order theory); Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.040075877366048944,"score_gpt":0.25920680842705024,"score_spread":0.2191309310610013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011631939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32361108,0.00073784846,0.6046015,0.063932925,0.0015688618,0.0005650206,0.000007976237,0.00021207034,0.004762722],"genre_scores_gemma":[0.8426429,0.00004639668,0.14683047,0.0009878902,0.0003157201,0.0000031106078,1.00632356e-7,0.00001972937,0.009153692],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983408,0.00008014844,0.0005235676,0.00016134526,0.0005363071,0.00035785275],"domain_scores_gemma":[0.9985488,0.00013595611,0.0005334985,0.0005035143,0.00009866435,0.00017953687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039877233,0.00017006001,0.00032177655,0.0000186612,0.00019357512,0.00012960806,0.0014737742,0.00010127125,0.00036918107],"category_scores_gemma":[0.00010741463,0.00009855064,0.0006036393,0.00031919673,0.000120559824,0.0005638186,0.0002323839,0.00046049381,0.00011191009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000122195115,0.0016029587,0.0024315235,0.00035196258,0.00054707134,0.0001643059,0.0069588996,0.0032236318,0.001799757,0.43070322,0.547592,0.0046124873],"study_design_scores_gemma":[0.0013895474,0.0003268612,0.00514831,0.0004703622,0.00013115992,0.0013100983,0.0014488631,0.039660167,0.0027477522,0.9294424,0.01726227,0.0006622254],"about_ca_topic_score_codex":4.1015448e-7,"about_ca_topic_score_gemma":1.14954766e-7,"teacher_disagreement_score":0.5303297,"about_ca_system_score_codex":0.00007596857,"about_ca_system_score_gemma":0.000019058045,"threshold_uncertainty_score":0.40422738},"labels":[],"label_agreement":null},{"id":"W2011685121","doi":"10.1006/jmaa.1999.6623","title":"The Going Up and Going Down Theorems in MV-algebras and Abelian l-groups","year":2000,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Abelian group; Mathematics; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.006495619755580975,"score_gpt":0.24025152766363728,"score_spread":0.2337559079080563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011685121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3578134,0.0016209144,0.6365472,0.0025899867,0.000007277942,0.000120871584,7.9222303e-7,0.000011870965,0.0012876589],"genre_scores_gemma":[0.9834795,0.0013055999,0.014870871,0.00010941851,0.000039700346,0.000012050901,2.3045206e-7,0.000003590235,0.00017903508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910045,0.000042674896,0.0004095868,0.00015429448,0.00015162845,0.00014137955],"domain_scores_gemma":[0.9990301,0.0004837656,0.00015030714,0.00019481994,0.000035368783,0.00010564325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005932553,0.00008927035,0.00025261354,0.0001142421,0.00023897714,0.00020352437,0.00023546378,0.000031050102,0.000021836076],"category_scores_gemma":[0.000032265565,0.00005062353,0.00007006303,0.00060908165,0.00012400311,0.00020923869,0.000059353755,0.00014632696,0.0000059774125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046688347,0.00005918951,0.0012973355,0.00001582097,0.00010404945,0.000002748502,0.00051581627,0.00006298476,0.00014532926,0.77162987,0.00001586003,0.22614636],"study_design_scores_gemma":[0.00025593248,0.000038593105,0.008862572,0.000034011275,0.0001615739,0.00009440985,0.00020104086,0.038570013,0.000046853736,0.9498279,0.0017868284,0.00012026151],"about_ca_topic_score_codex":0.0000011304752,"about_ca_topic_score_gemma":0.000009507544,"teacher_disagreement_score":0.62566614,"about_ca_system_score_codex":0.000008937586,"about_ca_system_score_gemma":0.000010060531,"threshold_uncertainty_score":0.20643677},"labels":[],"label_agreement":null},{"id":"W2012135231","doi":"10.1093/jigpal/jzi021","title":"The Complexity of Propositional Proofs with the Substitution Rule","year":2005,"lang":"en","type":"article","venue":"Logic Journal of IGPL","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Substitution (logic); Propositional calculus; Computer science; Mathematical economics; Mathematics; Programming language","score_opus":0.028526494624495802,"score_gpt":0.25016137416984974,"score_spread":0.22163487954535394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012135231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03452084,0.0012265196,0.91923726,0.031080697,0.00017783538,0.0001864476,0.0000013913638,0.000019604862,0.013549434],"genre_scores_gemma":[0.96305233,0.00002205709,0.036447454,0.00028162653,0.00014437574,0.000001640536,2.4202245e-7,0.0000017251425,0.00004856272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999171,0.000070902366,0.00021856687,0.000074620526,0.0003299727,0.0001349094],"domain_scores_gemma":[0.9991501,0.00008322257,0.00033779797,0.000173887,0.0002203833,0.000034621073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040646046,0.00006803662,0.00010442759,0.000023156448,0.00027080538,0.000043737033,0.0006456665,0.000019503794,0.000008011687],"category_scores_gemma":[0.000023888431,0.000026195816,0.000055918223,0.00015502195,0.00045006143,0.00030551356,0.00005096695,0.00018114991,0.0000050414287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003128361,0.000051299947,0.000037266072,0.0000023779237,0.000013684523,0.000006756498,0.00011856027,0.0016383298,0.00037581273,0.9889718,0.00015550049,0.008597283],"study_design_scores_gemma":[0.0008827207,0.00090108404,0.024156695,0.000059449187,0.000024397761,0.0013395348,0.00012880929,0.004379199,0.0059752227,0.9502535,0.011727765,0.00017161369],"about_ca_topic_score_codex":9.0618664e-7,"about_ca_topic_score_gemma":0.000008502916,"teacher_disagreement_score":0.92853147,"about_ca_system_score_codex":0.000032007505,"about_ca_system_score_gemma":0.00009349699,"threshold_uncertainty_score":0.20828433},"labels":[],"label_agreement":null},{"id":"W2012307294","doi":"10.1007/s00236-009-0109-4","title":"Embedding mappings and splittings with applications","year":2009,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Embedding; Equivalence relation; Injective function; Axiom; Algebraic number; Relation algebra; Mathematics; Relation (database); Theory of computation; Equivalence (formal languages); Algebra over a field; Isomorphism (crystallography); Algebraic analysis; Discrete mathematics; Theoretical computer science; Computer science; Pure mathematics; Algorithm","score_opus":0.005333039337177925,"score_gpt":0.22375549677563328,"score_spread":0.21842245743845534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012307294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022519032,0.000021193913,0.9549217,0.0020128575,0.000009576347,0.00019493011,3.461855e-7,0.00019223186,0.020128123],"genre_scores_gemma":[0.7935231,0.000007388228,0.20469408,0.0016979726,0.000013133788,0.000013879292,0.0000010278844,0.0000016276307,0.00004780642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947256,0.0000033005124,0.00014460787,0.00010210219,0.000106262705,0.0001711933],"domain_scores_gemma":[0.9995353,0.000038489303,0.00007308596,0.00025700146,0.00002753869,0.00006857702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006932207,0.00007907588,0.000083629144,0.00004768594,0.000130342,0.00012591695,0.00028366165,0.000022813207,0.0000037702387],"category_scores_gemma":[0.000011565179,0.000058288653,0.000011486044,0.00019330771,0.000028638815,0.0011486964,0.00006139013,0.00007705178,0.000026587115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040921673,0.000031237312,0.00015351798,0.00004275204,0.000010526016,0.0000027188164,0.0038021381,0.00006682728,0.00029407212,0.72911847,0.0004924618,0.2659812],"study_design_scores_gemma":[0.0022523608,0.0012391106,0.024213377,0.0002798228,0.00004230495,0.0007672638,0.0015794263,0.2886449,0.002199281,0.30489022,0.3719674,0.0019245271],"about_ca_topic_score_codex":4.050934e-7,"about_ca_topic_score_gemma":7.269573e-8,"teacher_disagreement_score":0.771004,"about_ca_system_score_codex":0.000009188374,"about_ca_system_score_gemma":0.0000139272015,"threshold_uncertainty_score":0.23769423},"labels":[],"label_agreement":null},{"id":"W2013323319","doi":"10.1007/s11083-004-0024-9","title":"Semilattice Operations Generated by Lattice Terms","year":2004,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Semilattice; Mathematics; Lattice (music); Bounded function; Congruence lattice problem; Ternary operation; Combinatorics; Modular design; Distributive lattice; Discrete mathematics; Algebra over a field; Pure mathematics; Distributive property; Computer science; Physics; Mathematical analysis","score_opus":0.01041645394985028,"score_gpt":0.24297338184617168,"score_spread":0.2325569278963214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013323319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044400666,0.00017250143,0.9471916,0.003168376,0.0001984275,0.00008604621,0.0000025506688,0.00019376595,0.004586099],"genre_scores_gemma":[0.719156,0.000032504155,0.2711488,0.005784071,0.000096525735,0.000023428984,0.000018315986,0.000014489584,0.003725832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933046,0.000017966087,0.00010571301,0.00024407153,0.00010942987,0.00019237545],"domain_scores_gemma":[0.9995299,0.000016023709,0.000016363067,0.0003085906,0.000064808926,0.000064296444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004993793,0.000090663336,0.00007374363,0.0000245116,0.0001636411,0.00010700817,0.0003470898,0.00004174341,0.00005782199],"category_scores_gemma":[0.00002734589,0.00007619305,0.000017555094,0.00039048013,0.000024245224,0.000456969,0.00007652484,0.00009029934,0.00035712545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004693341,0.00041463756,0.00024424397,0.000013433946,0.00004810935,0.000065898064,0.0016379695,0.1068373,0.06005865,0.7988449,0.008217227,0.023612982],"study_design_scores_gemma":[0.0076276553,0.0006911758,0.0034396406,0.000101220256,0.00008136687,0.00035524892,0.00019236734,0.2510503,0.13078792,0.20114838,0.40104464,0.0034801112],"about_ca_topic_score_codex":0.000016439117,"about_ca_topic_score_gemma":0.000014645173,"teacher_disagreement_score":0.67604274,"about_ca_system_score_codex":0.000025942838,"about_ca_system_score_gemma":0.000045589637,"threshold_uncertainty_score":0.45902443},"labels":[],"label_agreement":null},{"id":"W2013367964","doi":"10.1007/s00012-008-2079-8","title":"Which freely generated lattices contain F(3)?","year":2008,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Joins; Mathematics; Cardinality (data modeling); Lattice (music); Combinatorics; Complete lattice; Order (exchange); Discrete mathematics; Computer science; Physics; Data mining; Condensed matter physics","score_opus":0.019854425876827706,"score_gpt":0.21932253338267818,"score_spread":0.19946810750585048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013367964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6113856,0.00047699423,0.34950426,0.0028045648,0.0006030793,0.00025654383,0.000010319298,0.0010632534,0.033895403],"genre_scores_gemma":[0.9806817,0.00009860143,0.016751654,0.0008482108,0.00008844665,0.000003361981,0.000012856874,0.00001398598,0.0015011759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986196,0.00009052668,0.00017826528,0.00046562793,0.00025538442,0.000390566],"domain_scores_gemma":[0.9988662,0.000101648504,0.00009648675,0.0005920287,0.00018189945,0.00016171277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009741981,0.00019226185,0.0002039331,0.00013507943,0.00031837416,0.000058397334,0.0009747455,0.00009251899,0.000101517224],"category_scores_gemma":[0.000048817274,0.00018099006,0.00006365281,0.0009530226,0.00009242359,0.0010943592,0.00021514534,0.00016404706,0.00019690419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000177321,0.00010308565,0.0033540754,0.0000075623357,0.00007422167,0.00048728377,0.0020393194,0.000444537,0.002742642,0.9794455,0.0074796374,0.0038043726],"study_design_scores_gemma":[0.014351828,0.0024409762,0.11432127,0.00016410495,0.00020968201,0.0020283093,0.0022874929,0.16077697,0.075304255,0.19180666,0.42893037,0.0073780953],"about_ca_topic_score_codex":0.00014569669,"about_ca_topic_score_gemma":0.00014966118,"teacher_disagreement_score":0.7876389,"about_ca_system_score_codex":0.00005774245,"about_ca_system_score_gemma":0.00012389586,"threshold_uncertainty_score":0.738056},"labels":[],"label_agreement":null},{"id":"W2015799517","doi":"10.1006/jnth.2002.2794","title":"The Product of Like-Indexed Terms in Binary Recurrences","year":2002,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Binary number; Product (mathematics); Pure mathematics; Combinatorics; Arithmetic; Geometry","score_opus":0.016607308809126482,"score_gpt":0.24988055693861186,"score_spread":0.23327324812948538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015799517","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9175536,0.012201682,0.023485033,0.006489747,0.0051916423,0.00042094933,0.0000060844013,0.000066602894,0.034584656],"genre_scores_gemma":[0.99592924,0.00031322858,0.003009651,0.000095917705,0.000114095645,0.0000015287204,7.061485e-8,0.0000038090034,0.0005324811],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988804,0.00021415288,0.00038707655,0.00011154298,0.00023934967,0.00016746986],"domain_scores_gemma":[0.99878335,0.0004406925,0.0003871423,0.0002711098,0.00007473332,0.000042954794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009154757,0.00008088696,0.0001668623,0.00006340936,0.000064789056,0.000030991006,0.0008546594,0.0000246969,0.00013311721],"category_scores_gemma":[0.00017549531,0.000045016346,0.00008005732,0.00031625005,0.000111100846,0.00042747892,0.00008886905,0.00024281461,0.000020688762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017042368,0.0007373947,0.0153695205,0.000041217172,0.00008316692,0.00031459524,0.005673589,0.00033123133,0.0015610406,0.19782561,0.018085746,0.75980645],"study_design_scores_gemma":[0.00096230337,0.00051161693,0.024421524,0.00033383796,0.000014570551,0.0009371704,0.00048658502,0.001537079,0.0016650686,0.9357112,0.033090614,0.00032842706],"about_ca_topic_score_codex":5.4182186e-7,"about_ca_topic_score_gemma":0.0000012365184,"teacher_disagreement_score":0.75947803,"about_ca_system_score_codex":0.000019561288,"about_ca_system_score_gemma":0.000023910603,"threshold_uncertainty_score":0.18357132},"labels":[],"label_agreement":null},{"id":"W2016727077","doi":"10.1016/j.topol.2011.04.015","title":"Closure operators and their middle-interchange law","year":2011,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Closure (psychology); Mathematics; Closure operator; Operator (biology); Binary operation; Pure mathematics; Order (exchange); Calculus (dental); Algebra over a field; Discrete mathematics; Law; Political science; Business; Closed set","score_opus":0.05069652935025596,"score_gpt":0.24831067910386254,"score_spread":0.19761414975360658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016727077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23517352,0.007921373,0.69453025,0.004338842,0.00021114519,0.00086537556,0.00002136207,0.00038888535,0.056549255],"genre_scores_gemma":[0.99493855,0.00014293146,0.0035622583,0.0010377382,0.000031243595,0.00009723358,0.0000014554743,0.0000031091638,0.00018545565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999546,0.00002135651,0.000075195676,0.0002183033,0.00001701292,0.00012213837],"domain_scores_gemma":[0.99966675,0.000035301124,0.000022745427,0.00019400803,0.000023462246,0.000057714093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000507694,0.00007252604,0.00008139741,0.00002383811,0.0001946016,0.000012289407,0.00020367783,0.000058075886,0.000029744499],"category_scores_gemma":[0.0000030547512,0.000054132775,0.000011846785,0.00007922321,0.00013830472,0.00014601904,0.00013065475,0.00007400459,0.000025813973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.930676e-7,0.000017692428,0.00014917803,0.00000340527,0.0000044158687,4.7325403e-7,0.0012966237,5.5623644e-8,0.00014220037,0.99346745,0.000014981807,0.0049025435],"study_design_scores_gemma":[0.000445598,0.00026557714,0.0053003933,0.000010967265,0.0000134101165,0.00016719231,0.0006860072,0.0007895022,0.011216052,0.89079523,0.089901716,0.00040834115],"about_ca_topic_score_codex":0.00001296146,"about_ca_topic_score_gemma":0.00003168758,"teacher_disagreement_score":0.759765,"about_ca_system_score_codex":0.0000028677755,"about_ca_system_score_gemma":0.000005912544,"threshold_uncertainty_score":0.22074704},"labels":[],"label_agreement":null},{"id":"W2017243423","doi":"10.1007/s00012-014-0305-0","title":"On varieties of modular ortholattices that are generated by their finite-dimensional members","year":2014,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Variety (cybernetics); Mathematics; Modular design; Combinatorics; Modular form; Representation (politics); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science","score_opus":0.011826816973745723,"score_gpt":0.19577432434994438,"score_spread":0.18394750737619867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017243423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8125605,0.00024363096,0.18274292,0.000933027,0.00038249063,0.00015005986,0.000043690856,0.0002632438,0.0026804362],"genre_scores_gemma":[0.9946449,0.000018345847,0.0038079673,0.0010653156,0.000023165161,0.0000020679074,0.000030224573,0.000014562905,0.0003934933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864846,0.00015193912,0.00016974233,0.00042825518,0.00032802785,0.0002735641],"domain_scores_gemma":[0.9985184,0.00045278337,0.0002179073,0.00057007256,0.00011186318,0.00012894707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017083518,0.00022125395,0.0002648827,0.00012831263,0.0001534359,0.000048221664,0.0006849801,0.00010071355,0.00010485919],"category_scores_gemma":[0.000089796216,0.00018138615,0.00009413311,0.0003617288,0.00013633585,0.00055222027,0.00017923854,0.0001508908,0.000014928734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004740055,0.000169908,0.0007703593,0.000025720043,0.00012190431,0.000024722,0.0011405403,0.029098127,0.0039200215,0.9557679,0.0053188,0.0035945468],"study_design_scores_gemma":[0.0033236758,0.0013010427,0.0036281326,0.00018543273,0.00009768111,0.000021501774,0.0010757309,0.498038,0.13676988,0.30852944,0.045052156,0.0019773443],"about_ca_topic_score_codex":0.000050334504,"about_ca_topic_score_gemma":0.0000128412075,"teacher_disagreement_score":0.6472385,"about_ca_system_score_codex":0.000027573316,"about_ca_system_score_gemma":0.00003666413,"threshold_uncertainty_score":0.73967123},"labels":[],"label_agreement":null},{"id":"W2017672011","doi":"10.1016/j.jlap.2007.10.002","title":"Distributive contact lattices: Topological representations","year":2007,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Brock University","funders":"","keywords":"Mathematics; Axiom; Topological space; Algebraic structure; Complement (music); Distributive property; Generalization; Distributive lattice; Relation algebra; Complete Boolean algebra; Lattice (music); Algebra over a field; Pure mathematics; Two-element Boolean algebra; Algebra representation","score_opus":0.025402097568723185,"score_gpt":0.3030405959196174,"score_spread":0.2776384983508942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017672011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14691538,0.0015171223,0.8484676,0.0021099858,0.00017192742,0.00012311993,5.2139563e-7,0.000039944003,0.000654414],"genre_scores_gemma":[0.9741975,0.000109972796,0.0251186,0.0004106796,0.000121861405,0.000001092844,5.508947e-7,0.0000030705407,0.00003669141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988123,0.00011157265,0.00039394436,0.00013386707,0.0002326323,0.0003156485],"domain_scores_gemma":[0.99838334,0.0008108038,0.0003674215,0.00019166467,0.000118436255,0.00012835464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015946396,0.00011699642,0.00019857512,0.000056206278,0.00027842817,0.000086705375,0.0005795786,0.000051580337,0.000008739283],"category_scores_gemma":[0.00025598062,0.00006174485,0.00007757584,0.00028816427,0.00017274312,0.0003996061,0.0001687607,0.00030520768,0.0000031204888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006306236,0.00011118838,0.0033964622,0.000008306827,0.000057974314,0.00018326679,0.0015807496,0.000015949621,0.0005159654,0.7647047,0.00006104192,0.22930132],"study_design_scores_gemma":[0.0017157012,0.0023929426,0.08715095,0.00009753745,0.00014254285,0.0035025694,0.007097828,0.00050461164,0.001971777,0.8836022,0.011293492,0.00052786816],"about_ca_topic_score_codex":0.0000051535008,"about_ca_topic_score_gemma":0.000004010794,"teacher_disagreement_score":0.82728213,"about_ca_system_score_codex":0.000024832667,"about_ca_system_score_gemma":0.000028426879,"threshold_uncertainty_score":0.2517882},"labels":[],"label_agreement":null},{"id":"W2018059473","doi":"10.1007/s00012-012-0191-2","title":"Isotone maps on lattices","year":2012,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Lattice (music); Disjoint sets; Homomorphism; Combinatorics; Disjoint union (topology); Complete lattice; Variety (cybernetics); Map of lattices; Discrete mathematics; Physics; Condensed matter physics; Reciprocal lattice; Universality (dynamical systems); Quantum mechanics","score_opus":0.01629098248887304,"score_gpt":0.23447245911469522,"score_spread":0.21818147662582218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018059473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37562102,0.0016023244,0.34332618,0.007318697,0.0035085245,0.0006137651,0.000023336253,0.0020541928,0.26593196],"genre_scores_gemma":[0.98664016,0.000027792263,0.010141424,0.0015431512,0.00016657775,0.0000028348036,0.0000057614025,0.000011224321,0.0014610827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894494,0.000052863565,0.000106815336,0.00025298382,0.00021087899,0.0004315148],"domain_scores_gemma":[0.9990904,0.00011712499,0.00006643853,0.0005170275,0.000029511999,0.0001795122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121752884,0.00014595174,0.00012829226,0.00011395315,0.0001297432,0.000048826227,0.00067062746,0.000060056787,0.00010442839],"category_scores_gemma":[0.000022508924,0.00012935697,0.00006251586,0.00036660378,0.000051958308,0.0013263407,0.00017408346,0.00012769981,0.0007178912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050115195,0.000075528085,0.00077806093,0.000003465524,0.000014623084,0.0000142296585,0.00066384394,0.000016315606,0.00015890793,0.9858862,0.0031580084,0.009225769],"study_design_scores_gemma":[0.0021289585,0.00069136906,0.020910269,0.00007478173,0.000061797866,0.00008003291,0.00090225576,0.001711345,0.017463084,0.16564268,0.78858656,0.0017468944],"about_ca_topic_score_codex":0.000016062004,"about_ca_topic_score_gemma":0.0000027324036,"teacher_disagreement_score":0.82024354,"about_ca_system_score_codex":0.000047242673,"about_ca_system_score_gemma":0.000018038229,"threshold_uncertainty_score":0.9227279},"labels":[],"label_agreement":null},{"id":"W2018773302","doi":"10.1016/s0165-0114(97)00368-0","title":"Two properties of fuzzy subquasigroups of a quasigroup","year":2000,"lang":"en","type":"article","venue":"Fuzzy Sets and Systems","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quasigroup; Mathematics; Fuzzy logic; Algebra over a field; Pure mathematics; Artificial intelligence; Computer science","score_opus":0.024907907460317978,"score_gpt":0.23708891520754474,"score_spread":0.21218100774722676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018773302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805888,0.006196792,0.0028342789,0.000076587356,0.00021504555,0.0002947318,0.000007321767,0.00006844565,0.009718023],"genre_scores_gemma":[0.99842256,0.000096775664,0.0009442955,0.000029843683,0.00004736344,0.000014386661,9.574179e-7,0.000007196916,0.00043661767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987741,0.00009405855,0.0004005914,0.00027059487,0.00024437523,0.00021624455],"domain_scores_gemma":[0.99934304,0.00003776529,0.00013982966,0.00033785834,0.0000668655,0.00007465365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024764743,0.00013753299,0.00035355537,0.00006592939,0.0000625986,0.000045053814,0.0003583464,0.000049202696,0.0000072752873],"category_scores_gemma":[0.000011085743,0.00009677465,0.000055778586,0.00021144681,0.00009243348,0.000295855,0.000059046408,0.000067770874,0.000012066862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015798761,0.00055871834,0.007518353,0.0018333306,0.00015904251,0.000053560147,0.01308461,0.001818029,0.054854807,0.7451349,0.00066244544,0.1741642],"study_design_scores_gemma":[0.032456774,0.016003856,0.11859086,0.012493086,0.00046725667,0.003360852,0.020333888,0.36332655,0.08765452,0.24538983,0.0880224,0.011900109],"about_ca_topic_score_codex":0.00025574394,"about_ca_topic_score_gemma":0.000011820754,"teacher_disagreement_score":0.49974507,"about_ca_system_score_codex":0.0000091582315,"about_ca_system_score_gemma":0.000026211275,"threshold_uncertainty_score":0.3946356},"labels":[],"label_agreement":null},{"id":"W2021396458","doi":"10.1007/s11050-015-9113-0","title":"Experimental investigations of ambiguity: the case of most","year":2015,"lang":"en","type":"article","venue":"Natural Language Semantics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Superlative; Quantifier (linguistics); Ambiguity; Predicate (mathematical logic); Philosophy of language; Linguistics; Computer science; Semantics (computer science); Epistemology; Philosophy; Programming language; Metaphysics","score_opus":0.022921182445520716,"score_gpt":0.29362107315337366,"score_spread":0.27069989070785294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021396458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98624885,0.0033314119,0.009029945,0.00044533468,0.0002847203,0.00010278722,0.0000054663365,0.000040559677,0.000510952],"genre_scores_gemma":[0.98204494,0.00000127731,0.017620549,0.00020519466,0.000031736527,0.0000014817184,0.000002808377,0.0000034411526,0.00008858227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994571,0.000040025596,0.0001493306,0.00010711032,0.00014061367,0.00010580352],"domain_scores_gemma":[0.99935704,0.000059444603,0.00009862836,0.00034365512,0.00009122833,0.00004998589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011297324,0.00006916004,0.00010550672,0.000033093376,0.000044161847,0.000015209727,0.00036086302,0.00003012466,0.0000026150167],"category_scores_gemma":[0.00014062616,0.00004379748,0.000033444892,0.00029519876,0.0001241157,0.00016265981,0.00017230184,0.00010843658,0.000002821215],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001648438,0.00030339425,0.00060597656,0.00007385622,0.000073423274,0.0019547853,0.062368397,0.00059607305,0.17373274,0.7276081,0.0021742594,0.030492514],"study_design_scores_gemma":[0.00088827964,0.00024975708,0.0003210492,0.000045880155,0.00002786554,0.0015126859,0.016539829,0.063897446,0.9040495,0.011825222,0.0003172863,0.00032519194],"about_ca_topic_score_codex":0.00013189469,"about_ca_topic_score_gemma":0.000035732217,"teacher_disagreement_score":0.73031676,"about_ca_system_score_codex":0.000013556225,"about_ca_system_score_gemma":0.000040339768,"threshold_uncertainty_score":0.17860094},"labels":[],"label_agreement":null},{"id":"W2022377559","doi":"10.1007/s10773-013-1963-y","title":"n-Orthodistributivity in Orthomodular Lattices","year":2014,"lang":"en","type":"article","venue":"International Journal of Theoretical Physics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Distributivity; Mathematics; Distributive property; Lattice (music); Generalization; Pure mathematics; Simple (philosophy); Class (philosophy); Algebra over a field; Distributive lattice; Physics; Computer science; Mathematical analysis","score_opus":0.00804013686132003,"score_gpt":0.26862279380484166,"score_spread":0.2605826569435216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022377559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08072775,0.000019014202,0.9152735,0.0014602733,0.0005208467,0.000018674931,0.000001379866,0.000010543805,0.0019680576],"genre_scores_gemma":[0.9817606,0.000008146755,0.017561218,0.0003275453,0.0003337018,4.6373935e-7,8.116211e-7,0.000003412113,0.000004089298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895805,0.000112149595,0.00027067418,0.00011337772,0.00041616132,0.00012960545],"domain_scores_gemma":[0.99908954,0.00029281032,0.00018154805,0.0001419802,0.000229634,0.000064495835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005103425,0.00007714808,0.00015001156,0.00004884351,0.00001725188,0.000067470224,0.0009719459,0.000029918536,0.000014416502],"category_scores_gemma":[0.00032645772,0.000060205133,0.00009732341,0.00011852752,0.00012801611,0.000451456,0.00014935536,0.0002110095,0.000010989583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001423914,0.000091584,0.0015987308,0.0000012119297,0.000012787335,0.000032689695,0.000043285047,0.00067829754,0.00017324144,0.94720966,0.000012838844,0.050131418],"study_design_scores_gemma":[0.00032318948,0.000070456685,0.0031303023,0.000023753806,0.0000029752127,0.000035622033,0.000003858529,0.020234745,0.0015670336,0.973746,0.00078888884,0.00007316692],"about_ca_topic_score_codex":5.786818e-7,"about_ca_topic_score_gemma":3.8508173e-7,"teacher_disagreement_score":0.90103287,"about_ca_system_score_codex":0.00004054804,"about_ca_system_score_gemma":0.000028095417,"threshold_uncertainty_score":0.24550942},"labels":[],"label_agreement":null},{"id":"W2025761490","doi":"10.1007/s00012-004-1849-1","title":"Finitely generated varieties of distributive double p-algebras universal modulo a group","year":2004,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Modulo; Endomorphism; Distributive property; Monoid; Variety (cybernetics); Group (periodic table); Pure mathematics; Finitely-generated abelian group; Combinatorics; Discrete mathematics","score_opus":0.01361636197668277,"score_gpt":0.21421249994318922,"score_spread":0.20059613796650644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025761490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3055554,0.00022263268,0.6882744,0.00065644097,0.00035750942,0.00027697397,0.000054214383,0.0004216562,0.0041807527],"genre_scores_gemma":[0.98319733,0.0000642063,0.016136399,0.00018721346,0.00005195213,0.0000045677225,0.000079468184,0.000021480764,0.0002574042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804926,0.00007184152,0.0003264813,0.00062779844,0.00039672566,0.00052792043],"domain_scores_gemma":[0.99849266,0.00009434501,0.00023913536,0.00073567114,0.00024580874,0.00019239142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014008897,0.00032449776,0.00038226342,0.00024382067,0.00022571154,0.000080625374,0.0012351917,0.00016453971,0.000062377585],"category_scores_gemma":[0.000028065435,0.00032088516,0.00017065533,0.001389947,0.00030711674,0.0014142268,0.00043269742,0.00024362831,0.000045706172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007451315,0.00014615612,0.00012840172,0.000011959399,0.0000794628,0.00011353219,0.0013748923,0.0019503019,0.001953609,0.9930172,0.00017091136,0.0009790557],"study_design_scores_gemma":[0.016177801,0.0019782211,0.006732097,0.00014788006,0.00020010484,0.000117506475,0.002845075,0.0050303987,0.11264278,0.83796144,0.013725449,0.0024412693],"about_ca_topic_score_codex":0.00052117626,"about_ca_topic_score_gemma":0.00007188653,"teacher_disagreement_score":0.67764187,"about_ca_system_score_codex":0.00022786229,"about_ca_system_score_gemma":0.00022068339,"threshold_uncertainty_score":0.9999243},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01730136863860692,"score_gpt":0.2263319497077195,"score_spread":0.20903058106911257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026224392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5003417,0.0123034185,0.4208289,0.01626244,0.001102839,0.00027277158,0.0000039489855,0.00016600195,0.04871796],"genre_scores_gemma":[0.9790584,0.00021298332,0.019242644,0.0010436224,0.00027988528,0.0000011755892,8.3560565e-8,0.0000058087553,0.00015542169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999184,0.000013267396,0.00026047343,0.00013753437,0.00022808532,0.00017662006],"domain_scores_gemma":[0.99930084,0.000066370805,0.0002297544,0.00023760655,0.000041225576,0.00012417625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014752205,0.00010690438,0.00019538078,0.00008468225,0.000086941705,0.00010395821,0.0006415966,0.00004945225,0.00006440402],"category_scores_gemma":[0.00001916096,0.00007666701,0.000056397155,0.00017615236,0.000038328926,0.00040624474,0.0001352668,0.0002050436,0.0000178951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008656213,0.000111310466,0.00016633255,0.000018659714,0.000046492107,0.000082235856,0.0009663541,0.00004691401,0.0023297567,0.8125024,0.011771277,0.17194961],"study_design_scores_gemma":[0.0021407893,0.00044647534,0.0028724144,0.000048393864,0.00004887603,0.0007673216,0.00025853736,0.001750621,0.0048533203,0.9404075,0.0459148,0.0004909194],"about_ca_topic_score_codex":1.303331e-7,"about_ca_topic_score_gemma":5.63972e-7,"teacher_disagreement_score":0.47871667,"about_ca_system_score_codex":0.0000080348755,"about_ca_system_score_gemma":0.000008184882,"threshold_uncertainty_score":0.312639},"labels":[],"label_agreement":null},{"id":"W2027759179","doi":"10.1016/j.fss.2014.09.014","title":"Discrete dualities for n -potent MTL-algebras and 2-potent BL-algebras","year":2014,"lang":"en","type":"article","venue":"Fuzzy Sets and Systems","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Bulgarian National Science Fund","keywords":"Mathematics; Algebra over a field; Embedding; Duality (order theory); Pure mathematics; Lattice (music); Mathematical proof; Frame (networking); Computer science; Artificial intelligence","score_opus":0.02018932975635026,"score_gpt":0.2486468473021848,"score_spread":0.22845751754583454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027759179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31254953,0.007175794,0.6666828,0.0027984087,0.002997104,0.0016480081,0.00007506446,0.0004738292,0.0055994927],"genre_scores_gemma":[0.9946334,0.00009231435,0.0035617584,0.00035089618,0.00028341616,0.000093571995,0.00001216604,0.000019332916,0.00095315155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815714,0.00013092643,0.00038182372,0.00059640745,0.00026770215,0.0004659853],"domain_scores_gemma":[0.9988277,0.00023866896,0.00015169066,0.00047124608,0.00007876208,0.0002319381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005475945,0.00026586012,0.00040823547,0.00008518184,0.00034750244,0.00043572029,0.00033576135,0.00010168872,0.0000013979492],"category_scores_gemma":[0.000065799046,0.00019675324,0.00007455208,0.00010842635,0.000102433434,0.0004022307,0.00022171375,0.0001024897,0.000011462545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015246471,0.000025435053,0.0008470434,0.00030908166,0.000042596737,0.00000769407,0.0013344854,0.0001129202,0.00014973684,0.96936363,0.0014522017,0.026339902],"study_design_scores_gemma":[0.0049975486,0.0023677847,0.023658128,0.00067017024,0.00012524387,0.00064163894,0.0029691784,0.20902622,0.000549635,0.5586759,0.19351232,0.0028062214],"about_ca_topic_score_codex":0.00005576042,"about_ca_topic_score_gemma":0.000010890715,"teacher_disagreement_score":0.68208385,"about_ca_system_score_codex":0.000022276237,"about_ca_system_score_gemma":0.000022521159,"threshold_uncertainty_score":0.80233645},"labels":[],"label_agreement":null},{"id":"W2027839270","doi":"10.1007/s00012-005-1887-3","title":"Orthomodular lattices and permutable congruences","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Permutable prime; Congruence relation; Mathematics; Congruence (geometry); Variety (cybernetics); Pure mathematics; Algebra over a field; Statistics","score_opus":0.007507227788094312,"score_gpt":0.2109526959673796,"score_spread":0.20344546817928527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027839270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8633415,0.0023063212,0.104743026,0.006420941,0.0002774935,0.00021287792,0.0000052753144,0.00058067386,0.022111867],"genre_scores_gemma":[0.9715423,0.00014961364,0.026425662,0.0007099343,0.00007004095,0.0000017712457,0.0000022050751,0.0000066039547,0.0010918448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990708,0.00003022302,0.000112362264,0.00035913876,0.00015777073,0.00026966253],"domain_scores_gemma":[0.9993936,0.00006461076,0.00005816221,0.0003178155,0.00004611699,0.00011973135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009586783,0.00012980093,0.00013779839,0.00008231893,0.00017534268,0.000122623,0.0004950269,0.000050531282,0.00007628975],"category_scores_gemma":[0.000015583224,0.00011664483,0.000034230812,0.0002657726,0.00011052553,0.0016706497,0.00018990322,0.00009022529,0.00005651018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035393275,0.000031635227,0.0027196985,0.000007750477,0.000024270548,0.000053207063,0.0011723271,0.00016674517,0.00041830906,0.94388723,0.00047748993,0.051037814],"study_design_scores_gemma":[0.0024213258,0.0004471185,0.019024746,0.00007240892,0.00008359369,0.0002800574,0.0017704458,0.06489597,0.009579448,0.122353494,0.77727914,0.0017922322],"about_ca_topic_score_codex":0.0000547294,"about_ca_topic_score_gemma":0.00006664722,"teacher_disagreement_score":0.82153374,"about_ca_system_score_codex":0.00002469088,"about_ca_system_score_gemma":0.00003478492,"threshold_uncertainty_score":0.47566378},"labels":[],"label_agreement":null},{"id":"W2028134761","doi":"10.1142/s1005386710000623","title":"A Universal Variety of Point Algebras","year":2010,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Variety (cybernetics); Mathematics; Reduct; Class (philosophy); Point (geometry); Set (abstract data type); Pure mathematics; Algebra over a field; Type (biology); Discrete mathematics; Computer science; Rough set","score_opus":0.0056149036584472655,"score_gpt":0.2120336172816754,"score_spread":0.20641871362322814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028134761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5542621,0.0000953553,0.41754767,0.0021388095,0.002389253,0.00041375804,0.000009560543,0.00051513454,0.022628365],"genre_scores_gemma":[0.946125,0.000008888668,0.052753247,0.0005030627,0.000095551964,0.0000059157765,0.0000028817706,0.000015110111,0.0004903967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983952,0.00004944332,0.00031923753,0.00047979588,0.00033871148,0.00041762862],"domain_scores_gemma":[0.9983424,0.00015495653,0.00017748633,0.0009823061,0.00015945546,0.00018339035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002719659,0.00021152964,0.00029690057,0.00013775528,0.0001311839,0.0000613356,0.0013105401,0.00014267683,0.00018921048],"category_scores_gemma":[0.00009982784,0.00019567231,0.00014986187,0.00075795606,0.00019058878,0.0007669553,0.00046394826,0.00035850576,0.000096091215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011234794,0.0001008165,0.000523946,0.000010059063,0.000024852803,0.000025176818,0.00048371742,0.000011655171,0.03042226,0.96345496,0.0010370694,0.0038942543],"study_design_scores_gemma":[0.003040804,0.00085278245,0.01955024,0.000040616425,0.00006509367,0.00023112271,0.0004060899,0.009352778,0.11905843,0.811257,0.03465851,0.001486536],"about_ca_topic_score_codex":0.000034134744,"about_ca_topic_score_gemma":0.000046393463,"teacher_disagreement_score":0.39186287,"about_ca_system_score_codex":0.000024123672,"about_ca_system_score_gemma":0.00019279703,"threshold_uncertainty_score":0.7979286},"labels":[],"label_agreement":null},{"id":"W2028603410","doi":"10.1017/s0960129510000538","title":"Foreword: special issue on coalgebraic logic","year":2011,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Leibniz-Gemeinschaft; Engineering and Physical Sciences Research Council","keywords":"Enthusiasm; Event (particle physics); China; Computer science; Epistemology; Political science; Psychology; Philosophy; Law; Physics; Social psychology; Quantum mechanics","score_opus":0.030146234668675533,"score_gpt":0.26804793781392194,"score_spread":0.23790170314524642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028603410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016707739,0.000013981961,0.964842,0.00022931892,0.0013513911,0.00025179423,0.000001195399,0.0001715552,0.016430983],"genre_scores_gemma":[0.560692,0.0000012800642,0.43711814,0.00142608,0.0007086712,0.000009765018,2.5013662e-7,0.0000082238,0.000035571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972543,0.000052594376,0.00040093585,0.00086536474,0.0007132766,0.00071354065],"domain_scores_gemma":[0.998489,0.00017783948,0.00010462118,0.00095158414,0.00006116521,0.00021579595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004779021,0.00027274244,0.00030752036,0.00029378862,0.00022177567,0.0001602773,0.0031244014,0.0000704686,0.000505549],"category_scores_gemma":[0.00011876297,0.00019778378,0.00007257365,0.0011481169,0.0006553197,0.00064105925,0.00088665035,0.0002890181,0.00029082215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052052687,0.000074032265,0.00008893588,0.000010225742,0.0000013814446,0.00005980854,0.00090840925,0.00014230733,0.000015469524,0.8809514,0.000215291,0.117527515],"study_design_scores_gemma":[0.00019994688,0.00016245026,0.0063683246,0.000026755864,0.0000012482251,0.00006499967,0.000007727986,0.07705616,0.0009796631,0.91461724,0.00025899327,0.00025649247],"about_ca_topic_score_codex":0.0000025696902,"about_ca_topic_score_gemma":0.000002668491,"teacher_disagreement_score":0.5439843,"about_ca_system_score_codex":0.000085336185,"about_ca_system_score_gemma":0.000067589055,"threshold_uncertainty_score":0.8065388},"labels":[],"label_agreement":null},{"id":"W2030586439","doi":"10.1007/s10474-005-0223-x","title":"Notes on sectionally complemented lattices. II","year":2005,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Homomorphism; Complement (music); Distributive property; Lattice (music); Congruence (geometry); Distributive lattice; Pure mathematics; Combinatorics; Discrete mathematics; Geometry; Physics","score_opus":0.028339100693139413,"score_gpt":0.28740428151125896,"score_spread":0.2590651808181196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030586439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08636266,0.00020049588,0.76048934,0.09736591,0.001714244,0.0011650693,0.000026217975,0.0017708086,0.050905257],"genre_scores_gemma":[0.89622176,0.000013906509,0.09773099,0.0035553244,0.00030390226,0.000039406947,0.000008404335,0.00002330445,0.0021030311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966011,0.00008941176,0.00060375745,0.0008785475,0.0010283325,0.0007988581],"domain_scores_gemma":[0.99779934,0.00056107686,0.0003112852,0.00093426777,0.00011539818,0.00027864226],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00089437567,0.00035165,0.0003641856,0.00031368187,0.0009625944,0.00023251283,0.0021556916,0.00018517426,0.00042555603],"category_scores_gemma":[0.00040980452,0.00028239956,0.0001638137,0.0010809682,0.00017790223,0.0012648912,0.00090096105,0.00069400674,0.00078147335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011062502,0.0007041697,0.00011124181,0.00004741061,0.00007487007,0.0000065213635,0.0016630563,0.00036405787,0.010219586,0.94804466,0.02330248,0.015450867],"study_design_scores_gemma":[0.0021572954,0.000603993,0.0037647285,0.00025910948,0.000097971395,0.00016043213,0.00013771976,0.2483453,0.03001641,0.2578671,0.45465335,0.0019365934],"about_ca_topic_score_codex":0.000001704287,"about_ca_topic_score_gemma":0.0000064323026,"teacher_disagreement_score":0.8098591,"about_ca_system_score_codex":0.00012394124,"about_ca_system_score_gemma":0.00007726287,"threshold_uncertainty_score":0.99999654},"labels":[],"label_agreement":null},{"id":"W2030729535","doi":"10.1145/1412700.1412704","title":"Joint review of general lattice theory (second edition) and the congruences of a finite lattice","year":2008,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Lattice (music); Mathematics; Pure mathematics; Physics","score_opus":0.0288947469895576,"score_gpt":0.25715995591052787,"score_spread":0.22826520892097027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030729535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5374971,0.18853214,0.2113334,0.022643726,0.0018861106,0.0023448777,0.000056410296,0.00024772124,0.035458513],"genre_scores_gemma":[0.9000993,0.033202358,0.050104123,0.015213746,0.00026687668,0.00003959238,0.000005577801,0.000014457049,0.0010539741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885166,0.0002428916,0.00035819793,0.00020627935,0.00019369216,0.00014725371],"domain_scores_gemma":[0.99744016,0.001462193,0.0002853078,0.00066002336,0.00010398434,0.000048320864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055153767,0.000111698726,0.00032783145,0.0000343218,0.000095474585,0.000011797052,0.0006615368,0.000031954405,0.00012042853],"category_scores_gemma":[0.0010092856,0.000067220564,0.00008567322,0.00022696352,0.00041355717,0.00037009557,0.0002436996,0.00011359857,0.000010185825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005730861,0.0000993306,0.0005337755,0.0013872624,0.00009099463,0.000033755707,0.0023937891,0.000030819654,0.0012803721,0.95962924,0.004760839,0.029702533],"study_design_scores_gemma":[0.0033771906,0.0005289801,0.01519985,0.00240496,0.00015080895,0.0003282024,0.00022009607,0.0017675562,0.016300142,0.9280222,0.03098891,0.000711087],"about_ca_topic_score_codex":0.0000225014,"about_ca_topic_score_gemma":0.0000073841666,"teacher_disagreement_score":0.3626022,"about_ca_system_score_codex":0.000005241337,"about_ca_system_score_gemma":0.000059424,"threshold_uncertainty_score":0.2741175},"labels":[],"label_agreement":null},{"id":"W2031207925","doi":"10.1007/s10485-006-9037-4","title":"More on Configurations in Priestley Spaces, and Some New Problems","year":2006,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Distributive property; Coproduct; Class (philosophy); Mathematics; Theory of computation; Element (criminal law); Pure mathematics; Algebra over a field; Computer science; Law; Political science; Algorithm; Artificial intelligence","score_opus":0.009882696356753306,"score_gpt":0.22167352392592446,"score_spread":0.21179082756917114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031207925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16873516,0.001210994,0.79528916,0.009068019,0.00041173256,0.0012797777,0.000002894706,0.0005977247,0.023404526],"genre_scores_gemma":[0.9960275,0.000010183622,0.00318409,0.00048339795,0.0001269392,0.000020309417,0.000008109684,0.0000070275196,0.00013243889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901736,0.000011520646,0.00017050887,0.00037210766,0.00017502577,0.00025347032],"domain_scores_gemma":[0.99956256,0.000059342063,0.000053159456,0.00022893626,0.000010098105,0.00008592869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000032875905,0.00015223517,0.00015690489,0.000068682384,0.00009019837,0.000117100935,0.00026648186,0.00007881754,0.000011827601],"category_scores_gemma":[0.0000075114726,0.00011618911,0.000017994018,0.00026370073,0.000063411026,0.00014954974,0.00006905011,0.0001779135,0.000008918904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034246475,0.000013487402,0.000114243645,0.0000040422715,0.0000017467554,0.0000055687965,0.0001092146,0.002117601,0.0011796427,0.9880889,0.0006286814,0.007733464],"study_design_scores_gemma":[0.0003240499,0.000033276498,0.028589537,7.2680257e-7,0.0000017418316,0.000007580698,0.000015122202,0.00037116985,0.0009477905,0.9656261,0.003925503,0.00015739423],"about_ca_topic_score_codex":0.00014780833,"about_ca_topic_score_gemma":0.000044425728,"teacher_disagreement_score":0.8272923,"about_ca_system_score_codex":0.000035151523,"about_ca_system_score_gemma":0.00003743245,"threshold_uncertainty_score":0.47380546},"labels":[],"label_agreement":null},{"id":"W2032028343","doi":"10.1016/j.jlap.2014.02.005","title":"Relational style laws and constructs of linear algebra","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebra over a field; Converse; Axiom; Relation (database); Context (archaeology); Domain (mathematical analysis); Symmetric algebra; Commutative property; Intersection (aeronautics); Pure mathematics; Algebra representation; Cellular algebra; Computer science","score_opus":0.048905873530747115,"score_gpt":0.3410464175587398,"score_spread":0.2921405440279927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032028343","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16776201,0.000967823,0.83045524,0.0003648223,0.00013145838,0.00007275544,2.1891519e-7,0.000012981558,0.00023267677],"genre_scores_gemma":[0.34047845,0.00005235699,0.6592976,0.00010091733,0.000057029396,0.0000012209417,1.6153271e-7,0.000003074855,0.000009199147],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998194,0.00046146492,0.0006710013,0.00022101909,0.00023436919,0.00021814073],"domain_scores_gemma":[0.99792767,0.0012307707,0.00045488664,0.00013017117,0.00011081883,0.000145705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024815153,0.00013442896,0.00042878557,0.00014851216,0.00007379947,0.000040904393,0.00025989718,0.00010217896,0.000010151309],"category_scores_gemma":[0.0010114054,0.000092076254,0.0000710078,0.00030891338,0.00024244454,0.00034716728,0.00018369782,0.00035064926,3.731905e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001219985,0.000052026815,0.003274667,0.000023250219,0.000010512396,0.00001212394,0.00017901536,0.000015929169,0.00074716954,0.36311066,0.0000018795589,0.63256055],"study_design_scores_gemma":[0.002105927,0.0012824979,0.020516347,0.00019710352,0.000027905813,0.0009166683,0.00018673105,0.01379529,0.0022112718,0.94943273,0.008979052,0.00034849852],"about_ca_topic_score_codex":0.0000012247892,"about_ca_topic_score_gemma":5.6147684e-7,"teacher_disagreement_score":0.63221204,"about_ca_system_score_codex":0.000009668355,"about_ca_system_score_gemma":0.000028293056,"threshold_uncertainty_score":0.37547606},"labels":[],"label_agreement":null},{"id":"W2032297891","doi":"10.48550/arxiv.1309.6712","title":"The order of principal congruences of a bounded lattice","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Bounded function; Lattice (music); Mathematics; Principal (computer security); Pure mathematics; Order (exchange); Physics; Computer science; Mathematical analysis","score_opus":0.057812636879906176,"score_gpt":0.19627198416134492,"score_spread":0.13845934728143874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032297891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68484694,0.00014773177,0.31098622,0.00008935636,0.00039985057,0.00025845063,0.000004298427,0.00005846642,0.003208683],"genre_scores_gemma":[0.9948519,0.00018438083,0.003939707,0.000026850932,0.000018798459,8.8464e-7,0.0000013181283,0.0000057285188,0.0009704636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988033,0.00011172037,0.00023296272,0.00050238386,0.00010653829,0.0002430814],"domain_scores_gemma":[0.99774647,0.00030905378,0.0004708649,0.001025817,0.00037656975,0.00007119822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020326402,0.00018128274,0.00028485,0.00008213047,0.00013130452,0.00005039071,0.0022111821,0.00014054516,0.00001931746],"category_scores_gemma":[0.00008217803,0.00014160141,0.00012548434,0.00046437824,0.0003521725,0.00026318195,0.0015815707,0.0002945021,0.000020051248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012142155,0.00004463146,0.0011741061,0.000053663607,0.00006481533,0.00001716553,0.00019987993,0.021148777,0.000040233546,0.9766429,0.000024801157,0.00057690113],"study_design_scores_gemma":[0.00042808737,0.00011130572,0.0029327557,0.00009503128,0.000058543632,0.000003288236,0.00020067875,0.1980708,0.0007404683,0.79560167,0.0013935361,0.0003638394],"about_ca_topic_score_codex":0.00021266106,"about_ca_topic_score_gemma":0.00009031381,"teacher_disagreement_score":0.31000495,"about_ca_system_score_codex":0.000040321585,"about_ca_system_score_gemma":0.00024035746,"threshold_uncertainty_score":0.57743376},"labels":[],"label_agreement":null},{"id":"W2034379253","doi":"10.1163/15685349-12341246","title":"The Role of Discrete Terms in the Theory of the Properties of Terms","year":2013,"lang":"en","type":"article","venue":"Vivarium","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Simple (philosophy); Proposition; Term (time); Context (archaeology); Subject (documents); Mathematics; Epistemology; Computer science; Philosophy","score_opus":0.00789648875801882,"score_gpt":0.18964541108151808,"score_spread":0.18174892232349926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034379253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96185017,0.00096518383,0.009119662,0.0030371468,0.0002961546,0.00089467684,0.0000036554047,0.000029001034,0.023804357],"genre_scores_gemma":[0.99945515,0.00000922543,0.00022729798,0.00010798352,0.000013793528,0.000024355024,8.165557e-8,0.0000034299471,0.0001586831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913484,0.00017839613,0.00022464721,0.00011408699,0.00019993665,0.00014807076],"domain_scores_gemma":[0.9989236,0.0001455505,0.00015370485,0.00072991994,0.000035988098,0.000011239458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034313533,0.00007577364,0.00011500101,0.000020970903,0.00006984459,0.000025780195,0.0015871917,0.000026257916,0.000004577885],"category_scores_gemma":[0.0000621131,0.000025579106,0.00006362159,0.00021100392,0.0003012972,0.00018060493,0.00029040538,0.00010048743,0.0000034014076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013317226,0.00006585015,0.005105068,0.000025458005,0.0000145027225,2.925543e-7,0.007275233,0.000099737554,0.13168189,0.83571345,0.000028105242,0.019977093],"study_design_scores_gemma":[0.00018304009,0.00010732059,0.111151114,0.00006938279,0.0000067120686,0.0000044231565,0.00163257,0.0029551464,0.19344847,0.6895473,0.0007861361,0.00010840392],"about_ca_topic_score_codex":0.00005919751,"about_ca_topic_score_gemma":0.000007718233,"teacher_disagreement_score":0.14616618,"about_ca_system_score_codex":0.000004850555,"about_ca_system_score_gemma":0.00001947249,"threshold_uncertainty_score":0.29494235},"labels":[],"label_agreement":null},{"id":"W2036486445","doi":"10.1142/s0218196705002323","title":"HOW FINITE IS A THREE-ELEMENT UNARY ALGEBRA?","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Unary operation; Mathematics; Duality (order theory); Connection (principal bundle); Class (philosophy); Element (criminal law); Rank (graph theory); Algebra over a field; Pure mathematics; Discrete mathematics; Combinatorics; Geometry; Computer science","score_opus":0.016194796174388626,"score_gpt":0.2693054178421257,"score_spread":0.25311062166773707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036486445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096603625,0.000609755,0.87902844,0.022829922,0.00061805634,0.0000627622,0.0000023619427,0.000030223473,0.0002148421],"genre_scores_gemma":[0.937254,0.00010455028,0.059943054,0.0020945114,0.0005179697,0.000001841385,0.0000034687516,0.000007097779,0.000073467345],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861646,0.00003591167,0.00038429082,0.0002030134,0.00060165767,0.00015868952],"domain_scores_gemma":[0.99878395,0.0001329726,0.0004155724,0.000102173166,0.00045888906,0.00010645563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020156728,0.00014231092,0.00016798738,0.00024858897,0.00007460004,0.00036784206,0.0006071084,0.0000456863,0.00001705299],"category_scores_gemma":[0.000037281196,0.00012146399,0.000101190584,0.00014608949,0.0000397191,0.0014914019,0.00015518925,0.0001675819,0.000012207014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049378592,0.00014914658,0.001476086,0.000006743534,0.00018569392,0.000091581496,0.0011324397,0.004885874,0.00024234477,0.11876069,0.0013469395,0.8716731],"study_design_scores_gemma":[0.0029091833,0.0007455261,0.017331034,0.00013678553,0.00003951532,0.00097119843,0.00019349658,0.35733894,0.002405138,0.59177643,0.025635006,0.00051775435],"about_ca_topic_score_codex":0.0000016801652,"about_ca_topic_score_gemma":0.0000031213383,"teacher_disagreement_score":0.8711553,"about_ca_system_score_codex":0.00006823591,"about_ca_system_score_gemma":0.0000619401,"threshold_uncertainty_score":0.4953158},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008420275351095527,"score_gpt":0.2279796315742306,"score_spread":0.21955935622313508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037036822","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9620834,0.0012268424,0.026264375,0.0024962719,0.000034309043,0.00021498221,0.00001006117,0.000026492999,0.0076432507],"genre_scores_gemma":[0.9985906,0.0000380478,0.00096689485,0.0002711718,0.000008175048,0.0000041383114,1.6604773e-7,0.000003674103,0.0001171323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993235,0.00009062309,0.00014171685,0.00014782892,0.00017248715,0.00012383949],"domain_scores_gemma":[0.998602,0.0008181494,0.00014453744,0.00039323972,0.000021950895,0.000020167823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002043581,0.000092677416,0.00013351225,0.000028199876,0.00007655057,0.00004255037,0.0005071942,0.000026070298,0.000009032313],"category_scores_gemma":[0.00016326194,0.000043250526,0.00003937394,0.00015977949,0.00018308646,0.0002453116,0.00005910974,0.00006646652,0.0000034355849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034791286,0.0002009603,0.00031540653,0.000015382093,0.00005460601,0.0000016525304,0.0057168407,0.000110383575,0.029771645,0.8925809,0.0002613162,0.07093608],"study_design_scores_gemma":[0.00033835784,0.00061993336,0.007054891,0.00021854433,0.0000321258,0.000007074866,0.0048509445,0.01038305,0.2771155,0.69839185,0.00069113873,0.0002966021],"about_ca_topic_score_codex":0.000023649787,"about_ca_topic_score_gemma":0.000003823404,"teacher_disagreement_score":0.24734385,"about_ca_system_score_codex":0.000005877865,"about_ca_system_score_gemma":0.000014662744,"threshold_uncertainty_score":0.17637052},"labels":[],"label_agreement":null},{"id":"W2037098825","doi":"10.1556/sscmath.40.2003.1-2.1","title":"On the independence theorem of related structures for modular (arguesian) lattices","year":2003,"lang":"en","type":"article","venue":"Studia Scientiarum Mathematicarum Hungarica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Distributive lattice; Lattice (music); Congruence lattice problem; Automorphism; Modular design; Distributive property; Pure mathematics; Finite group; Discrete mathematics; Combinatorics; Group (periodic table)","score_opus":0.015900575664666024,"score_gpt":0.2512910510276654,"score_spread":0.2353904753629994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037098825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069295555,0.00046912543,0.87763417,0.0022003266,0.00089848717,0.0016456508,0.00001285352,0.00023191664,0.047611896],"genre_scores_gemma":[0.9522604,0.0000069408966,0.047164716,0.00018317242,0.000010941366,0.00006060734,8.092353e-7,0.000015832013,0.00029660418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974665,0.00019618672,0.0004711586,0.0005971502,0.0007473249,0.0005216644],"domain_scores_gemma":[0.9969337,0.0013132663,0.00035847444,0.0011261903,0.00017932155,0.00008905142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015802145,0.00025408345,0.00036092522,0.00014506119,0.0005519631,0.00013894758,0.0015759658,0.000094842064,0.00006054732],"category_scores_gemma":[0.0012627391,0.0001531026,0.00018527702,0.00089393416,0.00034068176,0.0002882075,0.00022590088,0.00023750043,0.00003256972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034362658,0.0000937371,0.000020927031,0.000033158016,0.000051595754,0.0000017948479,0.001158197,0.00019806057,0.00087152416,0.99695104,0.00024490096,0.0003716087],"study_design_scores_gemma":[0.0002848432,0.00014422924,0.00022732175,0.00003957707,0.000031943517,0.000009729969,0.0003037892,0.0054456186,0.008581902,0.9843396,0.00038933763,0.00020209102],"about_ca_topic_score_codex":8.824382e-7,"about_ca_topic_score_gemma":0.0000011620382,"teacher_disagreement_score":0.88296485,"about_ca_system_score_codex":0.000027490978,"about_ca_system_score_gemma":0.0001037954,"threshold_uncertainty_score":0.6243343},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013042489906763745,"score_gpt":0.21560596480573202,"score_spread":0.20256347489896828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037775432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2635408,0.001472287,0.73175734,0.001122939,0.00017549754,0.00008881564,0.000002928716,0.000027965938,0.0018114262],"genre_scores_gemma":[0.9956065,0.00022570479,0.0038105221,0.00019229011,0.00012311147,8.302592e-7,5.359742e-7,0.000003324255,0.000037193062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994268,0.0000120987515,0.00018129394,0.00011879549,0.00013980626,0.00012120814],"domain_scores_gemma":[0.99956673,0.000045776083,0.00016652969,0.0000821301,0.000041384235,0.00009743272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083081075,0.00008698075,0.00015031522,0.00004517724,0.000084820946,0.000083849554,0.00015358004,0.00004304286,0.00001402963],"category_scores_gemma":[0.000013114546,0.00006340613,0.000025056846,0.00013223857,0.0000350353,0.00031981102,0.000060990256,0.00013652473,0.0000037268292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010188709,0.000095075644,0.0007575904,0.000015438069,0.00003466693,0.00002979613,0.0012368844,0.000017497274,0.0036786455,0.78745884,0.0012378561,0.20542751],"study_design_scores_gemma":[0.0038909458,0.0008613232,0.028166048,0.00007931616,0.00007969813,0.00080578664,0.0007992939,0.0030297523,0.013879018,0.9159819,0.03156436,0.00086257304],"about_ca_topic_score_codex":1.4788412e-7,"about_ca_topic_score_gemma":4.0755847e-7,"teacher_disagreement_score":0.7320657,"about_ca_system_score_codex":0.000010080926,"about_ca_system_score_gemma":0.0000057685393,"threshold_uncertainty_score":0.25856268},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024399635549270653,"score_gpt":0.24892566394276597,"score_spread":0.2245260283934953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038424818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17931662,0.00022952155,0.80401886,0.00043596214,0.0015251706,0.00031501625,6.3379605e-7,0.0005784532,0.0135797765],"genre_scores_gemma":[0.9678646,0.0000028717168,0.031847708,0.00019618018,0.00001649452,0.000008273503,0.0000012412553,0.000008812219,0.00005386667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980252,0.00023696065,0.00036220692,0.0005954234,0.00027266063,0.00050754764],"domain_scores_gemma":[0.9983349,0.0003585834,0.00009984901,0.00085183064,0.00016632232,0.00018853614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006880916,0.00018247381,0.00022951215,0.00005247443,0.00041518832,0.0001166655,0.0007416909,0.00008376783,0.000013584445],"category_scores_gemma":[0.00069558364,0.00018026489,0.00010055816,0.00078542816,0.00009028997,0.0003044379,0.0002918284,0.00030264514,0.00006290432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.0941816e-7,0.00019370337,0.003101192,0.000013964788,0.0000051045595,0.0000064849273,0.00014263096,0.00045404217,0.000028971393,0.9934159,0.00012459588,0.0025129088],"study_design_scores_gemma":[0.00031665352,0.00007081941,0.001924307,0.000012121833,0.000003641524,0.000022480785,0.000009196969,0.010945466,0.000482451,0.98207045,0.0039067757,0.00023561025],"about_ca_topic_score_codex":0.0000040670307,"about_ca_topic_score_gemma":0.0000021400958,"teacher_disagreement_score":0.78854793,"about_ca_system_score_codex":0.0001889292,"about_ca_system_score_gemma":0.00020711687,"threshold_uncertainty_score":0.7350989},"labels":[],"label_agreement":null},{"id":"W2038808199","doi":"10.1007/s10485-006-9019-6","title":"Universality of Coproducts in Categories of Lax Algebras","year":2006,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Coproduct; Mathematics; Functor; Concrete category; Pure mathematics; Universality (dynamical systems); Inverse; Category of topological spaces; Topological space; Topological tensor product","score_opus":0.006520437979729841,"score_gpt":0.20587926899741646,"score_spread":0.19935883101768662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038808199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68119425,0.00043780025,0.30411807,0.0003831059,0.00027511182,0.00035867371,0.0000037105788,0.00013681424,0.013092456],"genre_scores_gemma":[0.9960397,0.000006135691,0.0038250173,0.000043876873,0.00004586194,0.0000031246086,0.000007155445,0.0000052584396,0.000023898043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987254,0.000030311297,0.00035941528,0.0003634646,0.00026503752,0.0002563811],"domain_scores_gemma":[0.9992237,0.00007305276,0.00017624711,0.00042612257,0.00005860532,0.000042283085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100440935,0.00015645003,0.00033038473,0.00010390813,0.00003483536,0.0000125469705,0.000612122,0.000089769244,0.000014430191],"category_scores_gemma":[0.000017429275,0.00012857416,0.00004642233,0.000751193,0.00015480278,0.00012706872,0.000121344856,0.00014155637,0.0000018921338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015124767,0.000042584586,0.00083004474,0.000018577137,0.000004290689,0.0000054404727,0.00012890407,0.0008475558,0.011360192,0.9837194,0.000102536585,0.0029253326],"study_design_scores_gemma":[0.000280609,0.00003825422,0.058821004,5.2639706e-7,0.0000037680625,0.0000028948018,0.000044234854,0.0000587601,0.057046898,0.88338935,0.0001855846,0.00012813481],"about_ca_topic_score_codex":0.0003121365,"about_ca_topic_score_gemma":0.0000318089,"teacher_disagreement_score":0.3148454,"about_ca_system_score_codex":0.000045490644,"about_ca_system_score_gemma":0.00005581259,"threshold_uncertainty_score":0.52431023},"labels":[],"label_agreement":null},{"id":"W2039314707","doi":"10.1155/2008/362068","title":"Green′s‐Like Relations on Algebras and Varieties","year":2008,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Artificial intelligence; Computer science; Mathematics; Machine learning","score_opus":0.03365938198875921,"score_gpt":0.2797046915566829,"score_spread":0.24604530956792373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039314707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2512278,0.0002576643,0.7343081,0.0059163766,0.0003178164,0.00008267747,0.0000012659755,0.00002935938,0.007858925],"genre_scores_gemma":[0.77156913,0.00016268212,0.22766903,0.00033414472,0.000066617715,0.000001638572,9.7142554e-8,0.0000035628887,0.00019307907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986727,0.000018378842,0.00038396142,0.000141093,0.00065536157,0.00012848248],"domain_scores_gemma":[0.99884725,0.0005499527,0.00025472892,0.00009562974,0.00014794523,0.00010446933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000497428,0.000102815764,0.00018459557,0.00015633697,0.00019712395,0.00012327607,0.00059541396,0.000035964684,0.000031613858],"category_scores_gemma":[0.00023685605,0.00006635984,0.00004996799,0.00012994156,0.00037628147,0.0005167928,0.00015657295,0.00012337661,0.00001436181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019046679,0.00011326085,0.000090847294,0.000010313659,0.000019516043,0.00003561437,0.0013733625,0.000021655676,0.00006721081,0.99644905,0.00017481235,0.0016424701],"study_design_scores_gemma":[0.00021588942,0.00022183075,0.00047160452,0.00007008279,0.0000067530955,0.0016209036,0.0002620322,0.011552121,0.00011207389,0.98497623,0.00039186445,0.00009858272],"about_ca_topic_score_codex":0.0000013604332,"about_ca_topic_score_gemma":5.212442e-7,"teacher_disagreement_score":0.52034134,"about_ca_system_score_codex":0.00001461852,"about_ca_system_score_gemma":0.000047949994,"threshold_uncertainty_score":0.27060756},"labels":[],"label_agreement":null},{"id":"W2039591492","doi":"10.1090/s0894-0347-08-00614-0","title":"The structure of locally finite varieties with polynomially many models","year":2008,"lang":"en","type":"article","venue":"Journal of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Annotation; Algorithm; Type (biology); Semantics (computer science); Computer science; Mathematics; Artificial intelligence; Programming language; Biology","score_opus":0.011239613662604179,"score_gpt":0.21787551810814124,"score_spread":0.20663590444553706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039591492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12976529,0.00009302266,0.867706,0.0020825644,0.00006487775,0.000070801165,0.0000010339619,0.000011307359,0.00020508772],"genre_scores_gemma":[0.8522438,0.00008759865,0.14684682,0.0006469835,0.000053990236,4.3618874e-7,2.54023e-8,0.00000783715,0.00011252361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985995,0.00007874606,0.00041551964,0.00010598052,0.00057927595,0.00022093572],"domain_scores_gemma":[0.99783677,0.00056649675,0.00089683523,0.00044010495,0.00018255864,0.00007726432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022974428,0.00013347086,0.0003549042,0.00001169038,0.00029403775,0.000040122028,0.0013999364,0.000029006942,0.000004456032],"category_scores_gemma":[0.00008153537,0.00005413309,0.000321733,0.00034916244,0.0010482256,0.00024025515,0.00021138013,0.00034844238,0.0000010207399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028519027,0.00042399357,0.00069799897,0.000119527416,0.00089121837,0.000044328503,0.018503753,0.07553333,0.0052030883,0.881584,0.0062050438,0.010508563],"study_design_scores_gemma":[0.0004954346,0.0006459217,0.0018978232,0.000077230725,0.000052998657,0.00076758827,0.0009846727,0.093630984,0.0013827976,0.89953023,0.000311887,0.00022242086],"about_ca_topic_score_codex":0.0000024444992,"about_ca_topic_score_gemma":5.8380147e-7,"teacher_disagreement_score":0.7224785,"about_ca_system_score_codex":0.00003602738,"about_ca_system_score_gemma":0.00017434335,"threshold_uncertainty_score":0.38622308},"labels":[],"label_agreement":null},{"id":"W2040201739","doi":"10.1007/s00012-004-1898-5","title":"Irredundant self-dual bases for self-dual lattice varieties","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Dual (grammatical number); Lattice (music); Mathematics; Variety (cybernetics); Complete lattice; Dual purpose; Finitely-generated abelian group; Algebra over a field; Pure mathematics; Combinatorics; Physics; Condensed matter physics; Statistics; Engineering","score_opus":0.011710415895006336,"score_gpt":0.22813608235036575,"score_spread":0.2164256664553594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040201739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13353647,0.0010452603,0.8215824,0.014731442,0.0019135948,0.0014987568,0.00011912774,0.0060852547,0.019487696],"genre_scores_gemma":[0.60196745,0.00011077271,0.39203045,0.0030932538,0.0006469788,0.000028926066,0.00003400791,0.000048665985,0.0020395056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979707,0.00008454521,0.00028470127,0.0006634974,0.00035152712,0.00064504246],"domain_scores_gemma":[0.99834746,0.00045149433,0.00014731726,0.000665148,0.00017522211,0.00021334765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022770406,0.00031738335,0.00029280627,0.00017362436,0.0004372536,0.00019841777,0.0007791686,0.00012694942,0.000071577335],"category_scores_gemma":[0.000051498067,0.00030678013,0.00016872873,0.00047068103,0.000088383,0.0017793325,0.00032487998,0.00018424352,0.00012498577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026604028,0.0002988686,0.00007870525,0.000034295434,0.00014278069,0.000063030086,0.004713915,0.00024748713,0.00015660054,0.9711252,0.01019851,0.012914042],"study_design_scores_gemma":[0.002242313,0.00059115706,0.0005556836,0.000025607698,0.00017335739,0.00014149057,0.0008491002,0.0348255,0.003971653,0.037246056,0.9182603,0.0011177858],"about_ca_topic_score_codex":0.0000312676,"about_ca_topic_score_gemma":0.00003530153,"teacher_disagreement_score":0.9338791,"about_ca_system_score_codex":0.00015950203,"about_ca_system_score_gemma":0.00019041086,"threshold_uncertainty_score":0.9999384},"labels":[],"label_agreement":null},{"id":"W2040484991","doi":"10.1007/s00012-003-1828-y","title":"Self-dual bases for varieties of orthomodular lattices","year":2003,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Dual (grammatical number); Algebra over a field; Pure mathematics; Arithmetic; Linguistics","score_opus":0.012399582886734083,"score_gpt":0.22148321170560112,"score_spread":0.20908362881886702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040484991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067996465,0.0005696818,0.92018485,0.00040168042,0.0004307781,0.00037256026,0.000018785719,0.0003970457,0.00962818],"genre_scores_gemma":[0.81893796,0.000043648433,0.18034932,0.00024105405,0.000026568607,0.000006359294,0.000005384115,0.000011789763,0.0003779467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901855,0.00007033715,0.00017064721,0.00030597867,0.00017573229,0.00025874007],"domain_scores_gemma":[0.99899936,0.00026175147,0.00012139169,0.00041456075,0.00012980848,0.00007315704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016656255,0.00014004424,0.00019527975,0.000101125726,0.00011671,0.000035908513,0.00040684978,0.00006169145,0.000033838918],"category_scores_gemma":[0.0000855093,0.00013132968,0.00010217579,0.00033857016,0.00007105266,0.0006721625,0.00007396603,0.000059711092,0.0000065532845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005030491,0.000062278035,0.00023869047,0.000032623047,0.000039450795,0.000010534514,0.00066729856,0.000060095354,0.00016624347,0.9973438,0.0003410927,0.0010328739],"study_design_scores_gemma":[0.002217841,0.0008352144,0.000660066,0.000034747718,0.00013846777,0.000045931167,0.0013076768,0.007839128,0.043975472,0.5190797,0.42296147,0.0009042786],"about_ca_topic_score_codex":0.000011509097,"about_ca_topic_score_gemma":0.0000072416287,"teacher_disagreement_score":0.75094146,"about_ca_system_score_codex":0.000022294204,"about_ca_system_score_gemma":0.000090664864,"threshold_uncertainty_score":0.5355469},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023876523985910506,"score_gpt":0.25396668351699736,"score_spread":0.23009015953108686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040487904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0132860625,0.000187315,0.9808003,0.00085143745,0.000041095715,0.00013459333,0.000007673112,0.00002870922,0.004662828],"genre_scores_gemma":[0.9202912,0.000049788945,0.07929002,0.000121516954,0.000014612751,0.000004625664,0.000002903435,0.0000032504322,0.00022209695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993617,0.000034432196,0.00026059733,0.00010818999,0.00013640196,0.000098695025],"domain_scores_gemma":[0.99913925,0.00020671898,0.00015990033,0.00040211616,0.000063758824,0.000028277766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017605517,0.00007828134,0.00018332267,0.000039748586,0.000087951106,0.000022471671,0.00027909223,0.000027704531,0.000008829398],"category_scores_gemma":[0.0001323691,0.000048480728,0.00007168605,0.0002394938,0.0001449458,0.00013678921,0.00007333217,0.000055607667,0.0000022672973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019726863,0.00003648381,0.000033616183,0.000022425871,0.000009799109,2.923845e-7,0.001377884,0.0006689515,0.00013715791,0.9964957,0.000064758424,0.0011509517],"study_design_scores_gemma":[0.0004452658,0.000063404295,0.000762272,0.00003216188,0.000031818672,0.0000073596398,0.00019768451,0.13357715,0.0005552176,0.8640478,0.00018413462,0.000095694566],"about_ca_topic_score_codex":0.0000025904305,"about_ca_topic_score_gemma":0.0000025731692,"teacher_disagreement_score":0.90700513,"about_ca_system_score_codex":0.000003756214,"about_ca_system_score_gemma":0.000015382995,"threshold_uncertainty_score":0.19769867},"labels":[],"label_agreement":null},{"id":"W2040811136","doi":"10.1007/s00012-008-2125-6","title":"Retracts of posets: the chain-gap property and the selection property are independent","year":2008,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Property (philosophy); Mathematics; Lattice (music); Selection (genetic algorithm); Chain (unit); Combinatorics; Discrete mathematics; Computer science; Artificial intelligence; Physics; Philosophy","score_opus":0.018854192957337715,"score_gpt":0.200654327442053,"score_spread":0.18180013448471527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040811136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8617389,0.0015168964,0.0771161,0.035676457,0.0006139637,0.0026128783,0.000012067252,0.0006444113,0.020068305],"genre_scores_gemma":[0.99566054,0.00024670994,0.00076488743,0.00070444494,0.00004650963,0.00000736564,0.0000011559001,0.000008903945,0.0025595045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987511,0.00019861075,0.00017961097,0.0003167668,0.00032252131,0.00023141089],"domain_scores_gemma":[0.99904,0.00012755294,0.00019436298,0.00043955795,0.00013899703,0.000059510035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030341756,0.0001503538,0.00019193302,0.00006166326,0.00045020191,0.00004057282,0.00070924,0.00007109398,0.000012588882],"category_scores_gemma":[0.00008666017,0.00005528601,0.000064397966,0.00048317038,0.00042785238,0.0005416636,0.0002447123,0.00025223038,0.0000068081154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071134156,0.0005355353,0.015644703,0.000116736635,0.00041796343,0.0002933302,0.037374664,0.00067228026,0.0035057405,0.87075144,0.016405579,0.053570706],"study_design_scores_gemma":[0.028707672,0.0032985855,0.35432455,0.00065779896,0.0004819223,0.005880903,0.013651417,0.14047009,0.044537183,0.15449187,0.24898407,0.004513957],"about_ca_topic_score_codex":0.0003198791,"about_ca_topic_score_gemma":0.00009116553,"teacher_disagreement_score":0.71625954,"about_ca_system_score_codex":0.00004430925,"about_ca_system_score_gemma":0.00008421964,"threshold_uncertainty_score":0.34626347},"labels":[],"label_agreement":null},{"id":"W2041190751","doi":"10.1016/j.disc.2010.06.035","title":"On the size of maximal chains and the number of pairwise disjoint maximal antichains","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Integer (computer science); Pairwise comparison; Natural number; Maximal set; Enumeration; Discrete mathematics; Set (abstract data type); Statistics; Computer science","score_opus":0.01065944028338643,"score_gpt":0.2423140936012091,"score_spread":0.23165465331782267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041190751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8066564,0.000021838458,0.18459253,0.0026655493,0.0001283623,0.0003405882,0.000011469438,0.000038904815,0.0055443193],"genre_scores_gemma":[0.96193117,0.000010182694,0.037700586,0.00016268725,0.00002349388,0.00001242474,4.050722e-7,0.000010233459,0.00014878836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894667,0.00005805686,0.00032569,0.00017986396,0.0002921957,0.00019752436],"domain_scores_gemma":[0.99756557,0.0013107249,0.0002495018,0.0007753688,0.000053854346,0.000045006273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056841644,0.00015237535,0.00028359145,0.00001849933,0.00010605357,0.00003945546,0.000679033,0.000048270525,0.000045448676],"category_scores_gemma":[0.00055087334,0.00007028927,0.00013203284,0.00016303208,0.0005554426,0.00009235323,0.00028956254,0.00022296926,0.000009106847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012241668,0.000062750434,0.00014204269,0.000048785692,0.000018517698,0.0000018706091,0.0027331617,0.0000049007604,0.00078259036,0.9956689,0.000022610671,0.00050161604],"study_design_scores_gemma":[0.0008184516,0.000081368606,0.002133784,0.00007212455,0.00003206994,0.00004184152,0.00066662574,0.080445275,0.0026721722,0.91279054,0.000052100466,0.00019363381],"about_ca_topic_score_codex":0.0000042444653,"about_ca_topic_score_gemma":0.0000039958963,"teacher_disagreement_score":0.15527476,"about_ca_system_score_codex":0.0000037772486,"about_ca_system_score_gemma":0.000019330286,"threshold_uncertainty_score":0.28663135},"labels":[],"label_agreement":null},{"id":"W2041594453","doi":"10.1007/s00012-008-2123-8","title":"A note on supermodular sublattices in finite relatively complemented lattices","year":2008,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Lattice (music); Join (topology); Pure mathematics; Complete lattice; Algebra over a field; Combinatorics; Condensed matter physics; Universality (dynamical systems)","score_opus":0.03060347394324053,"score_gpt":0.25303117841709705,"score_spread":0.2224277044738565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041594453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85178405,0.0001801163,0.13184854,0.0025046167,0.00027763078,0.00036640457,0.000017633216,0.00041940415,0.012601619],"genre_scores_gemma":[0.9877068,0.00007593453,0.010946848,0.0008488054,0.000031443742,0.000004744074,0.000015407926,0.0000146693565,0.00035537963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99824494,0.00014954632,0.00026420708,0.0005592547,0.00033865788,0.0004433932],"domain_scores_gemma":[0.9986783,0.00048416387,0.00011763575,0.0005358524,0.00006567831,0.00011835185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014947564,0.00023429659,0.00026026732,0.00034163793,0.00023340844,0.000041543273,0.0008756745,0.000082434155,0.00008581456],"category_scores_gemma":[0.00008079786,0.00022427383,0.00008187757,0.00092500064,0.00014412936,0.001222577,0.00021291274,0.00026821156,0.0001587241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007908968,0.00033347396,0.013817283,0.00001843876,0.000056584235,0.0015239667,0.010262998,0.002790838,0.00061370496,0.9653166,0.00059187354,0.004595176],"study_design_scores_gemma":[0.01482019,0.002922142,0.40639526,0.00048916024,0.00008718808,0.00021457687,0.0020154542,0.27758297,0.008806813,0.17011791,0.1122864,0.004261943],"about_ca_topic_score_codex":0.00013751925,"about_ca_topic_score_gemma":0.00011671174,"teacher_disagreement_score":0.7951987,"about_ca_system_score_codex":0.00010350963,"about_ca_system_score_gemma":0.00006751861,"threshold_uncertainty_score":0.9145621},"labels":[],"label_agreement":null},{"id":"W2041981350","doi":"10.5539/jmr.v7n2p56","title":"On Filter $(\\alpha)$-convergence and Exhaustiveness of Function Nets in Lattice Groups and Applications","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pointwise; Pointwise convergence; Filter (signal processing); Lattice (music); Context (archaeology); Discrete mathematics; Pure mathematics; Combinatorics; Topology (electrical circuits); Mathematical analysis; Network topology; Computer science","score_opus":0.1255987360095798,"score_gpt":0.37776710795816054,"score_spread":0.25216837194858077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041981350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38346076,0.00038450258,0.6151427,0.00035964078,0.00005004846,0.00014860643,5.8464855e-7,0.00000388981,0.00044926407],"genre_scores_gemma":[0.97911656,0.00009948471,0.020667942,0.000025165953,0.000026573762,0.0000072020252,1.1573082e-7,0.0000039784463,0.000052996253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895525,0.00008305976,0.0002683418,0.00010298612,0.0004578562,0.00013249229],"domain_scores_gemma":[0.9987225,0.0005389167,0.00013872777,0.00016631288,0.00033038354,0.00010318255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017684753,0.000053780386,0.00014776102,0.00030111586,0.000038461734,0.000034924567,0.00025926702,0.000034303266,0.0000043797163],"category_scores_gemma":[0.00022184385,0.000040538624,0.00001517592,0.00038691243,0.000087240165,0.0002915873,0.00013059087,0.00023553068,0.000004048549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011969774,0.00082057057,0.0036127213,0.00042429753,0.000034436867,0.00004801218,0.004509552,0.0012479834,0.0022385966,0.962566,0.000549514,0.023828605],"study_design_scores_gemma":[0.0008349681,0.0008191953,0.008313213,0.00020614377,0.000006113201,0.00011999743,0.0010155608,0.027276123,0.00093920145,0.9597491,0.00061834004,0.000102032354],"about_ca_topic_score_codex":0.0000023660868,"about_ca_topic_score_gemma":0.0000031427514,"teacher_disagreement_score":0.5956558,"about_ca_system_score_codex":0.000028997241,"about_ca_system_score_gemma":0.00005814184,"threshold_uncertainty_score":0.16531171},"labels":[],"label_agreement":null},{"id":"W2043355169","doi":"10.1016/j.aam.2010.01.010","title":"Scale invariant operators and combinatorial expansions","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Invariant (physics); Scale invariance; Scale (ratio); Pure mathematics; Algebra over a field; Mathematical physics; Statistics; Geography","score_opus":0.007211120988040579,"score_gpt":0.24510176232807018,"score_spread":0.2378906413400296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043355169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2579689,0.0003536224,0.7058161,0.00030526525,0.0020506587,0.00071852625,0.0000030148808,0.00032861516,0.032455303],"genre_scores_gemma":[0.61230063,0.000065454115,0.3874402,0.00008981952,0.000042950163,0.000040220202,6.068866e-7,0.000008167037,0.000011932151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903893,0.0000075352764,0.00025068116,0.0002983096,0.00016603687,0.00023850979],"domain_scores_gemma":[0.9991363,0.0002325842,0.00007566821,0.0004491744,0.000017482058,0.000088749315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019814218,0.00014634403,0.00021438277,0.00007082934,0.000105394865,0.000065133245,0.0004768976,0.00007467997,0.000009001491],"category_scores_gemma":[0.00006038325,0.00010861773,0.000022259592,0.0002804349,0.00010951128,0.00038437976,0.0002510578,0.00027639852,0.000020863692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014654444,0.00009222541,0.000120066536,0.000025702879,0.0000012528184,0.0000041117482,0.0006814454,0.000021371108,0.0036463405,0.9798263,0.000007983743,0.015571754],"study_design_scores_gemma":[0.0005649661,0.000026142447,0.00011911858,0.000018384897,0.0000033136914,0.000018400246,0.00019380217,0.0032042647,0.005010743,0.98727524,0.0033335262,0.00023208189],"about_ca_topic_score_codex":7.5994905e-7,"about_ca_topic_score_gemma":0.000025595657,"teacher_disagreement_score":0.35433173,"about_ca_system_score_codex":0.000010177783,"about_ca_system_score_gemma":0.00002595886,"threshold_uncertainty_score":0.44293025},"labels":[],"label_agreement":null},{"id":"W2044598156","doi":"10.1007/s00012-003-1832-2","title":"Yet another single law for lattices","year":2003,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Algebra over a field; Law; Calculus (dental); Pure mathematics; Arithmetic; Political science","score_opus":0.023209942063079435,"score_gpt":0.2301023747392464,"score_spread":0.20689243267616697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044598156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013984331,0.00030756224,0.8639875,0.0010444305,0.0006415798,0.000328411,0.000010131666,0.00042473932,0.11927131],"genre_scores_gemma":[0.9074146,0.000005724453,0.08725565,0.0027413939,0.000038611262,0.00000765086,0.0000044395647,0.00002028054,0.0025116156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911255,0.0000453423,0.00010740778,0.00032323037,0.00011617107,0.00029528805],"domain_scores_gemma":[0.999248,0.00017039076,0.00006431949,0.00039655037,0.00005674111,0.0000639616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009853338,0.00012791465,0.00012874599,0.000054067856,0.00015210557,0.000083884195,0.00047797855,0.00005794688,0.00006876755],"category_scores_gemma":[0.00003783892,0.00011960458,0.0000748633,0.00024460687,0.000072649425,0.00074185856,0.00005086434,0.0000543709,0.00004641962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029721596,0.000042351803,0.00002470856,0.0000048210804,0.000013276375,0.000007549983,0.00027949063,0.000021432852,0.0011549891,0.9956911,0.0012089885,0.0015482816],"study_design_scores_gemma":[0.000853493,0.00021775249,0.00003584263,0.00001307543,0.000017178485,0.000012656904,0.00016536529,0.0004891306,0.031309217,0.35517764,0.6113425,0.0003661217],"about_ca_topic_score_codex":0.00001971653,"about_ca_topic_score_gemma":0.000039866765,"teacher_disagreement_score":0.8934303,"about_ca_system_score_codex":0.000037187194,"about_ca_system_score_gemma":0.000027867423,"threshold_uncertainty_score":0.4877333},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019081062640995457,"score_gpt":0.28462956003784207,"score_spread":0.2655484973968466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045590994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07807998,0.000047175887,0.90392846,0.0023908946,0.00007322254,0.00031785457,0.0000021922256,0.0005726551,0.014587575],"genre_scores_gemma":[0.85087395,0.0000013151507,0.14651935,0.002351776,0.000057831316,0.000022281482,0.0000038092237,0.000010082463,0.00015961136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978664,0.00011693196,0.00050138123,0.00052085007,0.00039081645,0.0006036164],"domain_scores_gemma":[0.99828094,0.0002890257,0.00015609966,0.00089973136,0.00008317409,0.0002910541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042424834,0.00030455718,0.0004494589,0.00009339861,0.000214812,0.0002682339,0.0012614434,0.0001174452,0.00012320181],"category_scores_gemma":[0.000056590336,0.00022629941,0.0001267512,0.00032657382,0.00011287764,0.0011821935,0.000058264643,0.00027247795,0.00070345827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055050864,0.00028821104,0.0000051859397,0.000014317616,0.000006683093,0.000047822836,0.005301832,0.0000040578025,0.00027710642,0.92823243,0.00009941198,0.06571745],"study_design_scores_gemma":[0.0003239572,0.0023309828,0.00097647065,0.000030179426,0.000007782734,0.00007499706,0.0004119144,0.010478363,0.00017151696,0.98477477,0.00009769565,0.00032138225],"about_ca_topic_score_codex":0.0000016828313,"about_ca_topic_score_gemma":0.0000016805718,"teacher_disagreement_score":0.77279395,"about_ca_system_score_codex":0.000045447254,"about_ca_system_score_gemma":0.000024577894,"threshold_uncertainty_score":0.9228222},"labels":[],"label_agreement":null},{"id":"W2045693325","doi":"10.1007/s00012-008-2035-7","title":"Priestley configurations and Heyting varieties","year":2008,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Dual polyhedron; Mathematics; Variety (cybernetics); Heyting algebra; Pure mathematics; Finitely-generated abelian group; Algebra over a field","score_opus":0.015621280773394397,"score_gpt":0.19622705191759238,"score_spread":0.18060577114419799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045693325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20013298,0.0003917043,0.7621493,0.0024875419,0.00025275393,0.00016963082,0.0000039991046,0.000553015,0.033859108],"genre_scores_gemma":[0.982732,0.00010985044,0.015601252,0.0004603003,0.000034453566,0.0000020975108,0.0000036992135,0.000006201739,0.0010501393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929637,0.000031889864,0.00010463751,0.00025112787,0.00012559738,0.00019035273],"domain_scores_gemma":[0.999438,0.000098361415,0.00005154394,0.00026805504,0.00006012216,0.00008390307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048489423,0.00010370577,0.00010746891,0.00007127836,0.00044625904,0.00005297804,0.000292402,0.000043429834,0.000030222456],"category_scores_gemma":[0.000038163496,0.00010024332,0.000027581153,0.00025178096,0.00017416295,0.00085312687,0.00013650434,0.000092433205,0.000022768805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017224353,0.000011978479,0.0005659266,0.0000029866674,0.000010234537,0.000061337094,0.0027721028,0.000021376707,0.0003722712,0.99339294,0.00066968927,0.0021174538],"study_design_scores_gemma":[0.0042812694,0.0008758322,0.0805737,0.00008246739,0.000084738356,0.0021290977,0.005116901,0.02827508,0.01495665,0.55459815,0.3059688,0.0030573094],"about_ca_topic_score_codex":0.000040734365,"about_ca_topic_score_gemma":0.000007768217,"teacher_disagreement_score":0.78259903,"about_ca_system_score_codex":0.000018878489,"about_ca_system_score_gemma":0.000056963396,"threshold_uncertainty_score":0.4087804},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007565791298253982,"score_gpt":0.21510860452189662,"score_spread":0.20754281322364262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046052042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33710524,0.0008415082,0.5933576,0.0015490439,0.0014090033,0.00022710122,0.000008230849,0.00047568203,0.06502657],"genre_scores_gemma":[0.9954699,0.000003237363,0.004297834,0.00002954221,0.000018371149,0.0000017428672,0.0000016056142,0.0000026203325,0.00017513681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947864,0.000021322381,0.00010934596,0.00014086295,0.0001143508,0.00013546257],"domain_scores_gemma":[0.99956256,0.000046626108,0.000048101254,0.00026174064,0.00004416723,0.0000368142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002501726,0.00005834628,0.000093493574,0.00003795384,0.000063201434,0.000012970787,0.00036875703,0.000030843596,0.000017621023],"category_scores_gemma":[0.000010204991,0.000052209238,0.00003817253,0.0002762553,0.00005127569,0.00013319773,0.00009502238,0.0000626287,0.000007989491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.5569557e-7,0.000042931624,0.0004801155,0.0000020434488,0.000001996882,0.0000068592426,0.00001821999,0.00010224249,0.0002510518,0.9971648,0.0013820374,0.00054697826],"study_design_scores_gemma":[0.00023205271,0.000058744838,0.0127142,0.0000023790692,0.0000030156964,0.0000046105943,0.0000055972355,0.0004059628,0.0027240154,0.97493726,0.00882996,0.00008223011],"about_ca_topic_score_codex":0.00003664828,"about_ca_topic_score_gemma":0.0000037670882,"teacher_disagreement_score":0.65836465,"about_ca_system_score_codex":0.00003159548,"about_ca_system_score_gemma":0.00005031387,"threshold_uncertainty_score":0.2129031},"labels":[],"label_agreement":null},{"id":"W2046274682","doi":"10.4153/cmb-2000-047-6","title":"Tournaments and Orders with the Pigeonhole Property","year":2000,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University; Wilfrid Laurier University","funders":"","keywords":"Pigeonhole principle; Mathematics; Property (philosophy); Countable set; Partition (number theory); Class (philosophy); Combinatorics; Block (permutation group theory); Discrete mathematics; Tournament; Pure mathematics; Computer science","score_opus":0.005581641645966017,"score_gpt":0.17488594419839157,"score_spread":0.16930430255242554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046274682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34699804,0.0003326301,0.1040564,0.30698436,0.00007095339,0.0012667414,0.0000064087567,0.0002450226,0.24003945],"genre_scores_gemma":[0.95552903,0.0000112399,0.014356408,0.00899668,0.000033370532,0.000037201902,6.7058795e-7,0.000014704847,0.021020692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992832,0.000027369917,0.00008587147,0.00018865519,0.000120200326,0.00029473],"domain_scores_gemma":[0.99934846,0.00005119976,0.000016107162,0.00027942497,0.000017422779,0.00028738054],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010629107,0.000096601696,0.0000963931,0.000024233517,0.00019524836,0.000120239005,0.00036457615,0.000027816039,0.004155993],"category_scores_gemma":[0.000020425548,0.000043140106,0.000015058958,0.000111958485,0.00011252152,0.000050954037,0.000023436012,0.00010881183,0.0023831287],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018900524,0.00012307776,0.0001844336,0.00008818064,0.00007196446,0.0004628567,0.003154835,0.00018267956,0.000034729997,0.48254105,0.10113312,0.41200417],"study_design_scores_gemma":[0.0003244871,0.00009913061,0.00041514504,0.00004805932,0.000008207818,0.0001690783,0.00010423137,0.0019855234,0.000024351864,0.03862057,0.9579454,0.0002558374],"about_ca_topic_score_codex":0.00033643638,"about_ca_topic_score_gemma":0.00060623576,"teacher_disagreement_score":0.85681224,"about_ca_system_score_codex":0.000029546076,"about_ca_system_score_gemma":0.00006872339,"threshold_uncertainty_score":0.99839365},"labels":[],"label_agreement":null},{"id":"W2047718799","doi":"10.1007/s00012-003-1733-4","title":"On the number of join-irreducibles in a congruence representation of a finite distributive lattice","year":2003,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Distributive property; Join (topology); Combinatorics; Lattice (music); Distributive lattice; Bounded function; Finite set; Discrete mathematics; Pure mathematics; Physics; Mathematical analysis","score_opus":0.01925576830585851,"score_gpt":0.2644093559199069,"score_spread":0.24515358761404837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047718799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91027755,0.00003810843,0.070486926,0.0005575702,0.0001118452,0.00021338832,0.000019611429,0.000029237908,0.018265797],"genre_scores_gemma":[0.9972077,0.000017413042,0.0025446655,0.00011412767,0.0000033068516,0.0000033468532,0.0000032738121,0.0000038632916,0.00010230573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989945,0.00019877219,0.00020157667,0.0002504621,0.00019347463,0.0001611558],"domain_scores_gemma":[0.9981766,0.0010511758,0.00017650082,0.0004622876,0.000101307,0.00003215623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018081465,0.00009601145,0.00016542705,0.00007067589,0.0000423483,0.00001322171,0.00042562105,0.000038277136,0.000067035326],"category_scores_gemma":[0.00052900345,0.00007398983,0.000056120192,0.0009436795,0.00015387678,0.00034466537,0.000064520056,0.00010349259,0.000011697292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011376267,0.00005936745,0.0040513063,0.000005479539,0.000012112606,0.000011478739,0.0010123814,0.00030615288,0.00024497102,0.99377775,0.00007461828,0.0004329961],"study_design_scores_gemma":[0.0014099136,0.0001902123,0.035343412,0.00018215324,0.000027574248,0.000018056093,0.0030350764,0.0036791705,0.06411655,0.8910131,0.0006063287,0.0003784353],"about_ca_topic_score_codex":0.00014586672,"about_ca_topic_score_gemma":0.000022566886,"teacher_disagreement_score":0.102764644,"about_ca_system_score_codex":0.000035402638,"about_ca_system_score_gemma":0.000065723354,"threshold_uncertainty_score":0.30172178},"labels":[],"label_agreement":null},{"id":"W2048723165","doi":"10.1007/s00012-009-2094-4","title":"Terms that are self-dual in Boolean algebras but not in MO2","year":2009,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Arity; Variety (cybernetics); Modulo; Identity (music); Complete Boolean algebra; Stone's representation theorem for Boolean algebras; Dual (grammatical number); Combinatorics; Term (time); Two-element Boolean algebra; Boolean ring; Pure mathematics; Boolean function; Discrete mathematics; Algebra over a field; Quotient ring; Algebra representation","score_opus":0.0135625766210078,"score_gpt":0.2188633217375336,"score_spread":0.2053007451165258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048723165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97957003,0.00014713536,0.008770128,0.0037295336,0.0002791944,0.00033886515,0.0000083829855,0.00057785376,0.006578904],"genre_scores_gemma":[0.99130887,0.00007121165,0.005558099,0.002646689,0.00005950146,0.000003985562,0.0000074498694,0.000015706171,0.0003284879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99775726,0.00012258641,0.00030680775,0.0007479339,0.00037467788,0.0006907356],"domain_scores_gemma":[0.9987873,0.00010927907,0.00015857656,0.00074438844,0.000033156077,0.00016731334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002113793,0.00032035584,0.00037225295,0.0005007975,0.00009280681,0.00011479775,0.0011050309,0.00016434948,0.000033135995],"category_scores_gemma":[0.000031488966,0.00031999106,0.00009428146,0.0009863606,0.0000611223,0.0015651126,0.00023430336,0.000388177,0.000080386635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009264261,0.0008760908,0.033079553,0.000031567015,0.000047179885,0.006024316,0.008020588,0.00075095956,0.0017948613,0.8965846,0.0015972708,0.051100414],"study_design_scores_gemma":[0.007593644,0.00087453076,0.6967844,0.00034398568,0.000040594343,0.00026839654,0.0031597784,0.014378207,0.02180349,0.24196447,0.009831517,0.0029569753],"about_ca_topic_score_codex":0.0001320942,"about_ca_topic_score_gemma":0.0002985739,"teacher_disagreement_score":0.6637049,"about_ca_system_score_codex":0.00023245659,"about_ca_system_score_gemma":0.000069266745,"threshold_uncertainty_score":0.9999252},"labels":[],"label_agreement":null},{"id":"W2049735587","doi":"10.1023/a:1026564222011","title":"Sets and Classes as Many","year":2000,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Set (abstract data type); Labelling; Computer science; Set theory; Class (philosophy); Theoretical computer science; Mathematics; Algebra over a field; Discrete mathematics; Artificial intelligence; Pure mathematics; Programming language; Biology","score_opus":0.0239217590449745,"score_gpt":0.28140646454252755,"score_spread":0.25748470549755303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049735587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7604781,0.003639446,0.04520182,0.1436025,0.0005786902,0.00017487025,0.00000192801,0.0001329095,0.046189778],"genre_scores_gemma":[0.98150337,0.00035625635,0.014503756,0.0032530592,0.00028778127,5.9965737e-7,1.2926881e-7,0.0000046945706,0.000090335416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895465,0.000065101936,0.00032193566,0.00017466919,0.00028882996,0.00019480319],"domain_scores_gemma":[0.9992902,0.0001231604,0.00013964875,0.00018064976,0.00007001739,0.000196296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020233,0.00011950412,0.00023404196,0.000075373115,0.00008133027,0.00007269029,0.0005048481,0.00008147655,0.00022368101],"category_scores_gemma":[0.00007044396,0.000081134385,0.00008814217,0.00017653995,0.00008794669,0.00048402412,0.000073405,0.0003360242,0.00009030725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003891462,0.00012006386,0.00016738113,0.000008532973,0.00001969014,0.00068098,0.000065302316,0.00011727978,0.0004008819,0.9315221,0.00019644033,0.06666248],"study_design_scores_gemma":[0.00034499107,0.0005679019,0.0027079785,0.000018054016,0.000007685874,0.0015594793,0.0000033102722,0.0005592805,0.00008029178,0.99028003,0.0037621544,0.000108855114],"about_ca_topic_score_codex":4.265136e-7,"about_ca_topic_score_gemma":1.0397566e-7,"teacher_disagreement_score":0.22102533,"about_ca_system_score_codex":0.00001806292,"about_ca_system_score_gemma":0.000035424968,"threshold_uncertainty_score":0.3308564},"labels":[],"label_agreement":null},{"id":"W2050117528","doi":"10.1007/s000120050178","title":"A note on the equational theory of modular ortholattices","year":2000,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Mathematics; Modular design; Equational logic; Algebra over a field; Pure mathematics; Rewriting; Programming language; Computer science","score_opus":0.016485904866704437,"score_gpt":0.22472586327937286,"score_spread":0.20823995841266843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050117528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5234731,0.00014132087,0.4277502,0.0036899857,0.00013528363,0.00021547616,0.000010453268,0.00016045851,0.04442373],"genre_scores_gemma":[0.99445856,0.00002352145,0.0034765122,0.0009852215,0.000029043415,0.0000021831156,0.0000026943349,0.0000056140166,0.0010166338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991112,0.00013299407,0.0001226037,0.00021975797,0.00025350132,0.00015999046],"domain_scores_gemma":[0.998863,0.00050494255,0.00006772888,0.00048080384,0.000044125245,0.00003941424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023750117,0.000100987236,0.00010076075,0.000057913512,0.0001273714,0.000028177756,0.000750168,0.000038482995,0.00070458883],"category_scores_gemma":[0.000041316907,0.000068536574,0.00007161201,0.00032849493,0.00011219305,0.00040336704,0.00006214694,0.00010416313,0.00011807233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138945115,0.000027907283,0.000021483193,0.0000016235346,0.000013298655,0.000007774046,0.00075116084,0.0009864697,0.00016010032,0.96085364,0.00005355217,0.03710912],"study_design_scores_gemma":[0.00041427164,0.0001826432,0.00326744,0.000028756502,0.000019177218,0.0000072983676,0.00017141619,0.017317735,0.002868368,0.96235275,0.013122344,0.00024778376],"about_ca_topic_score_codex":0.000009283994,"about_ca_topic_score_gemma":0.0000029483942,"teacher_disagreement_score":0.47098547,"about_ca_system_score_codex":0.000018794444,"about_ca_system_score_gemma":0.000040678424,"threshold_uncertainty_score":0.7714753},"labels":[],"label_agreement":null},{"id":"W2051719823","doi":"10.1007/s00012-005-1853-0","title":"On n-distributive modular ortholattices","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Distributive property; Mathematics; Modular design; Algebra over a field; Finitely-generated abelian group; Word problem (mathematics education); Pure mathematics; Arithmetic; Computer science; Programming language","score_opus":0.007646259968927139,"score_gpt":0.21813171172966556,"score_spread":0.2104854517607384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051719823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3451916,0.0002222386,0.6178748,0.0043213614,0.00029723742,0.00020954004,0.000019929517,0.000680519,0.031182794],"genre_scores_gemma":[0.98503655,0.000019514206,0.01285889,0.001242057,0.00008083649,0.0000024944375,0.000010478242,0.000009065811,0.00074008666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988252,0.000052771044,0.00013032039,0.00042190638,0.00024064445,0.00032914325],"domain_scores_gemma":[0.99906135,0.00012391579,0.00007745041,0.00054942037,0.00006298114,0.00012490654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009084894,0.00016868522,0.00014598617,0.000106688334,0.00016990716,0.00007658437,0.00078766333,0.00006568406,0.00009807029],"category_scores_gemma":[0.000040258066,0.00015463681,0.00008098205,0.00040966575,0.00006375954,0.0010758429,0.00017028338,0.00015996378,0.00041336412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072756197,0.000053883603,0.000062351246,0.0000017414062,0.000018087438,0.000046077697,0.00037672557,0.0009099069,0.00014791745,0.9758112,0.0008616536,0.021703182],"study_design_scores_gemma":[0.0034806884,0.0011007234,0.010210188,0.00009336442,0.00007404483,0.00008373477,0.0005805242,0.07541362,0.022015689,0.4445195,0.44021875,0.0022091954],"about_ca_topic_score_codex":0.000010816002,"about_ca_topic_score_gemma":0.000011766123,"teacher_disagreement_score":0.639845,"about_ca_system_score_codex":0.000096015676,"about_ca_system_score_gemma":0.00003683,"threshold_uncertainty_score":0.6305906},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02284963998595889,"score_gpt":0.24143280278094525,"score_spread":0.21858316279498635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053204108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15097195,0.000043656546,0.8272172,0.0018031377,0.00047118217,0.00016587795,0.000053193802,0.00029895,0.018974833],"genre_scores_gemma":[0.98762816,0.0000082460565,0.011102812,0.0003418596,0.000034988898,0.0000025235422,0.000043475462,0.000006423246,0.0008314888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929154,0.000042532254,0.00014098958,0.0001930094,0.0001634925,0.00016845677],"domain_scores_gemma":[0.99921703,0.000040597755,0.00009430339,0.00036338455,0.00014754488,0.0001371602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000630029,0.00009037914,0.0001257305,0.00011960414,0.000065971,0.00002489389,0.0004897266,0.00004195459,0.000057015717],"category_scores_gemma":[0.00003452639,0.00009038527,0.000048177873,0.0004763542,0.00007732659,0.0009013531,0.00013662748,0.000064256405,0.000060344606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033296913,0.000047835256,0.00035011658,0.0000033227939,0.00001612142,0.000017232776,0.00094286696,0.00030108757,0.0006979579,0.9955508,0.001529986,0.0005393201],"study_design_scores_gemma":[0.0073626824,0.0013108928,0.06519289,0.0001433042,0.00015027136,0.00028261874,0.003208061,0.06816855,0.020170545,0.65950227,0.17204279,0.0024651217],"about_ca_topic_score_codex":0.000023622113,"about_ca_topic_score_gemma":0.0000048706897,"teacher_disagreement_score":0.8366562,"about_ca_system_score_codex":0.00003611653,"about_ca_system_score_gemma":0.0001119946,"threshold_uncertainty_score":0.36858043},"labels":[],"label_agreement":null},{"id":"W2053347360","doi":"10.1016/s0166-8641(98)00095-9","title":"Oxtoby's pseudocompleteness revisited","year":2000,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Baire space; Baire category theorem; Baire measure; Unification; Property (philosophy); Inheritance (genetic algorithm); Class (philosophy); Relation (database); Pure mathematics; Discrete mathematics; Artificial intelligence; Computer science","score_opus":0.013987743490265348,"score_gpt":0.2636724377177124,"score_spread":0.24968469422744707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053347360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047138,0.0024309133,0.87459767,0.011333295,0.000056148987,0.0007062591,0.0000091114825,0.00050274597,0.06322588],"genre_scores_gemma":[0.98569715,0.0005525465,0.009676186,0.001699198,0.00007346771,0.00017733288,0.0000072523612,0.0000043363825,0.0021125039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994444,0.000024187144,0.00010258459,0.00024662472,0.00003728242,0.00014489632],"domain_scores_gemma":[0.99955255,0.000055660465,0.00002330024,0.0002910426,0.000023727098,0.000053716205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005023386,0.00006697393,0.00009135722,0.000029366009,0.00022318642,0.0000183138,0.00029476703,0.00004628103,0.00029719752],"category_scores_gemma":[0.000004200528,0.000059109472,0.000016519025,0.00020542866,0.000059676808,0.00014167522,0.000047462334,0.0000688022,0.00031708932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011841207,0.000020618578,0.000031494787,0.0000028740708,0.0000027594886,7.430796e-7,0.000037832477,0.0000070203228,0.00020398156,0.8794177,0.00012804114,0.12014574],"study_design_scores_gemma":[0.00037851464,0.0000667085,0.006135439,0.000004679065,0.000009782874,0.00012500647,0.000014752612,0.0042372574,0.0005286526,0.37491646,0.61332375,0.00025901664],"about_ca_topic_score_codex":0.0000019945019,"about_ca_topic_score_gemma":8.842605e-7,"teacher_disagreement_score":0.9385592,"about_ca_system_score_codex":0.0000044748313,"about_ca_system_score_gemma":0.000008978154,"threshold_uncertainty_score":0.40756473},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012770908850645007,"score_gpt":0.2074198811738972,"score_spread":0.1946489723232522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053628678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44953838,0.00021058669,0.54891664,0.0005312013,0.000075644195,0.000047489317,9.700707e-7,0.0000060290954,0.0006730618],"genre_scores_gemma":[0.8367889,0.000022651271,0.16282456,0.00025132403,0.0000473386,8.5946755e-7,3.2187205e-7,0.0000057347643,0.00005833095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939865,0.000012836629,0.0002186272,0.00006527071,0.0001420716,0.00016252366],"domain_scores_gemma":[0.9992716,0.00004089012,0.00019190756,0.00012625192,0.00011123528,0.0002581449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018683198,0.00007160628,0.00011928358,0.000118518765,0.00007945666,0.00008693084,0.00027501467,0.000022670585,0.000013691951],"category_scores_gemma":[0.000028364953,0.00005276541,0.000023147166,0.00015050576,0.000037228543,0.0003591916,0.000011643246,0.00008137075,0.0000040068053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002191809,0.00024143004,0.122243784,0.00027375374,0.00036573954,0.0035249575,0.01264357,0.0013414609,0.0007260742,0.68372434,0.0021451958,0.17274778],"study_design_scores_gemma":[0.007010359,0.0027115536,0.11518713,0.0016504274,0.00029468094,0.029649666,0.0038290538,0.058282252,0.00179886,0.71387285,0.06356441,0.002148734],"about_ca_topic_score_codex":0.000036700992,"about_ca_topic_score_gemma":0.0015768344,"teacher_disagreement_score":0.38725048,"about_ca_system_score_codex":0.000034189045,"about_ca_system_score_gemma":0.00023690586,"threshold_uncertainty_score":0.2151711},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016986467046353378,"score_gpt":0.23206657900060967,"score_spread":0.2150801119542563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055594915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014016098,0.000113205395,0.98360926,0.0014389049,0.00029725724,0.00013021629,0.0000054536367,0.000011870311,0.00037774918],"genre_scores_gemma":[0.9362673,0.0000031472466,0.063240655,0.0002791939,0.000064295484,0.0000018804791,6.532241e-7,0.000003756916,0.00013910941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929035,0.0000156151,0.0002771391,0.00008932634,0.00010485747,0.00022274285],"domain_scores_gemma":[0.9989901,0.00007559814,0.0002232043,0.00015507579,0.00029910682,0.00025687093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002524709,0.00009116198,0.00017315082,0.00009961947,0.00012267694,0.00011776516,0.0004779497,0.000040988652,0.0000070166125],"category_scores_gemma":[0.00033046908,0.000059532034,0.000100220765,0.00014949232,0.000050140457,0.0004021896,0.000008072121,0.000119201126,0.0000035064563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008395502,0.0000669441,0.00015389478,0.00005149468,0.0000435266,0.00009301373,0.0052153417,0.00009274483,0.00030129022,0.9546295,0.0036962694,0.03564759],"study_design_scores_gemma":[0.00050578656,0.0010595132,0.0009878696,0.00016072323,0.000031969,0.0007352411,0.0010268816,0.009434624,0.001483714,0.97798014,0.0063146753,0.0002788632],"about_ca_topic_score_codex":0.00006171748,"about_ca_topic_score_gemma":0.0009445283,"teacher_disagreement_score":0.9222512,"about_ca_system_score_codex":0.00013792026,"about_ca_system_score_gemma":0.00050082925,"threshold_uncertainty_score":0.24276459},"labels":[],"label_agreement":null},{"id":"W2055744007","doi":"10.1017/s1079898600004194","title":"Sergio Fajardo and H. Jerome Keisler . Model theory of stochastic processes, Lecture Notes in Logic, vol. 14. Association for Symbolic Logic, A K Peters, Ltd., Natick, Massachusetts, 2002, xii + 136 pp.","year":2004,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical logic; Association (psychology); Model theory; Philosophy; Mathematics; Mathematical economics; Artificial intelligence; Humanities; Computer science; Epistemology; Algorithm; Discrete mathematics","score_opus":0.014731079592213864,"score_gpt":0.2300295287839372,"score_spread":0.21529844919172333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055744007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015787516,0.0054991795,0.96995974,0.0063574035,0.00022148274,0.0013331008,0.00006558037,0.00017986806,0.00059611886],"genre_scores_gemma":[0.95349187,0.000305526,0.043940593,0.0016023102,0.00010012179,0.00018194206,0.00001897453,0.000040248844,0.00031840827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996583,0.00017264995,0.00086416083,0.0009344773,0.0006059152,0.0008398028],"domain_scores_gemma":[0.9966716,0.0011007523,0.000759404,0.00057957467,0.00073375,0.00015492768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010432126,0.0005326973,0.00097321055,0.0002824912,0.00015699054,0.00007610145,0.00097277213,0.0004312442,0.00005449202],"category_scores_gemma":[0.0027586194,0.00044499012,0.00017932075,0.00062819215,0.00017980237,0.00018391554,0.00030479013,0.0003925204,0.00002466475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003608939,0.0015108298,0.0006395628,0.0020249097,0.00023723498,0.00003574352,0.006040109,0.38244063,0.0029635115,0.5970428,0.001971286,0.0047324933],"study_design_scores_gemma":[0.0034861516,0.0007436043,0.000977441,0.0003327846,0.00009524043,0.0000378,0.00013755554,0.007957239,0.0019767503,0.9830197,0.00038299302,0.0008527122],"about_ca_topic_score_codex":0.000063795065,"about_ca_topic_score_gemma":0.000035789697,"teacher_disagreement_score":0.9377044,"about_ca_system_score_codex":0.00024908135,"about_ca_system_score_gemma":0.0002711373,"threshold_uncertainty_score":0.9998002},"labels":[],"label_agreement":null},{"id":"W2056035406","doi":"10.1142/s1005386710000052","title":"Minimal Characteristic Algebras for Leftmost k-Normal Identities","year":2010,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Normality; Property (philosophy); Pure mathematics; Variety (cybernetics); Quadratic algebra; Type (biology); Construct (python library); Algebra over a field; Algebra representation; Division algebra; Combinatorics; Computer science; Statistics","score_opus":0.00893717581072361,"score_gpt":0.23911037712135982,"score_spread":0.2301732013106362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056035406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73860705,0.00010989401,0.24865419,0.0015641288,0.005586462,0.0007931214,0.000045123285,0.0006396195,0.0040004435],"genre_scores_gemma":[0.9567115,0.000012521938,0.037321385,0.0011773021,0.0007582928,0.00020802204,0.000029836845,0.000038239512,0.003742909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976637,0.000038568465,0.00045542774,0.00069324503,0.00035596755,0.0007931285],"domain_scores_gemma":[0.99819463,0.00030480244,0.00020242992,0.00085565634,0.00019988073,0.00024261446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033777865,0.00033600125,0.00036230794,0.00015665477,0.00045703872,0.000433562,0.001515014,0.0001784356,0.00019366742],"category_scores_gemma":[0.0002375483,0.0003263228,0.0002070376,0.00039561847,0.00018299962,0.0014369937,0.00039747058,0.00034557,0.0002491802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006498332,0.00018880458,0.0015367782,0.00007289759,0.000063568914,0.000058971185,0.00067058596,0.0000049533837,0.062293068,0.91599005,0.0068178917,0.0122374585],"study_design_scores_gemma":[0.006270809,0.001985244,0.07247744,0.00008232948,0.00018057371,0.0008541137,0.00039985866,0.016307298,0.094901845,0.5659881,0.23633806,0.004214334],"about_ca_topic_score_codex":0.0000072793114,"about_ca_topic_score_gemma":0.0000432012,"teacher_disagreement_score":0.35000193,"about_ca_system_score_codex":0.00002952462,"about_ca_system_score_gemma":0.0001733326,"threshold_uncertainty_score":0.9999189},"labels":[],"label_agreement":null},{"id":"W2056872402","doi":"10.1007/s00012-006-1994-9","title":"An implication basis for linear forms","year":2006,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Abelian group; Variety (cybernetics); Regular polygon; Algebraic number; Lemma (botany); Algebra over a field; Geometry; Pure mathematics; Mathematical analysis","score_opus":0.009536144497471389,"score_gpt":0.24361613508696972,"score_spread":0.23407999058949833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056872402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049874913,0.000032693213,0.9461396,0.0007450518,0.000088305744,0.00021668259,0.000012884479,0.00031593168,0.0025739414],"genre_scores_gemma":[0.92569697,0.000006083709,0.073477395,0.00031173293,0.00012850166,0.000016076556,0.00005444048,0.000012357628,0.000296432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911857,0.000016828097,0.00013519927,0.00035369187,0.000112764144,0.00026295317],"domain_scores_gemma":[0.99915016,0.00007066498,0.000075793854,0.0005402011,0.00009123543,0.00007192071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008509877,0.00011753146,0.000109086555,0.00009306441,0.00016691061,0.000056553064,0.0006465943,0.00006235677,0.000014003181],"category_scores_gemma":[0.000011993625,0.00010736949,0.00007258597,0.0003083494,0.00003275257,0.0012070573,0.000054896766,0.0000498119,0.000023656672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058942096,0.000049530176,0.00016486921,0.000004384769,0.000005136377,0.0000023400585,0.000093729854,0.00022674081,0.0025499673,0.98178065,0.00063803745,0.01447874],"study_design_scores_gemma":[0.0015526051,0.00067160575,0.010929234,0.000017484259,0.000038834503,0.000024020232,0.00024939055,0.09689435,0.03563023,0.73906183,0.11401347,0.00091692206],"about_ca_topic_score_codex":0.00007905167,"about_ca_topic_score_gemma":0.000035124285,"teacher_disagreement_score":0.87582207,"about_ca_system_score_codex":0.00005507687,"about_ca_system_score_gemma":0.000035436464,"threshold_uncertainty_score":0.43784007},"labels":[],"label_agreement":null},{"id":"W2057414399","doi":"10.1007/s00012-009-0027-x","title":"The spectrum of a finite pseudocomplemented lattice","year":2009,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Lattice (music); Stone's representation theorem for Boolean algebras; Boolean algebra; Combinatorics; Discrete mathematics; Complete Boolean algebra; Finite set; Pure mathematics; Algebra over a field; Two-element Boolean algebra; Algebra representation; Mathematical analysis; Physics","score_opus":0.010136674438112284,"score_gpt":0.22992889112351658,"score_spread":0.2197922166854043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057414399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06876774,0.0005331888,0.8658127,0.025313206,0.00047547653,0.00050448027,0.000012395054,0.00051070435,0.038070086],"genre_scores_gemma":[0.9898471,0.000066674846,0.00888954,0.0006993078,0.000033827055,9.642658e-7,0.000002864538,0.0000044890435,0.0004551837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990234,0.00006025175,0.0001849751,0.0002281125,0.00020710002,0.00029617452],"domain_scores_gemma":[0.9988967,0.00028103805,0.00012416967,0.0005816363,0.00005150576,0.0000649169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014132225,0.0001159037,0.00012956912,0.00006988041,0.00020871744,0.0000518538,0.0010393681,0.000028864153,0.000029313154],"category_scores_gemma":[0.000039494214,0.00008485226,0.00007612984,0.0005559989,0.00007574684,0.00039318853,0.00012447353,0.00010231922,0.00002643469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000867917,0.000030541032,0.00007939098,0.0000014635643,0.000015383248,0.000015696432,0.00031961701,0.00005340125,0.00018659569,0.98650897,0.0005856166,0.012194636],"study_design_scores_gemma":[0.0015670396,0.00080805103,0.01629271,0.000035609577,0.00003721314,0.000027133434,0.00054464187,0.019261299,0.0058458275,0.8616292,0.0934193,0.00053196494],"about_ca_topic_score_codex":0.000019388035,"about_ca_topic_score_gemma":0.000020373842,"teacher_disagreement_score":0.9210794,"about_ca_system_score_codex":0.000027170508,"about_ca_system_score_gemma":0.000038234317,"threshold_uncertainty_score":0.34601748},"labels":[],"label_agreement":null},{"id":"W2058564026","doi":"10.1016/j.topol.2005.06.018","title":"Kleisli compositions for topological spaces","year":2006,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Ultrafilter; Mathematics; Separation axiom; Topological space; Categorical variable; Axiom; Relation (database); Category of topological spaces; T1 space; Neighbourhood (mathematics); Discrete mathematics; Topology (electrical circuits); Pure mathematics; Algebra over a field; Isolated point; Topological vector space; Topological tensor product; Combinatorics; Mathematical analysis; Computer science","score_opus":0.013455212374737695,"score_gpt":0.27081285783846065,"score_spread":0.257357645463723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058564026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008653621,0.00063353044,0.97543377,0.009622407,0.00004524092,0.0003419273,0.000011116086,0.00013728578,0.005121108],"genre_scores_gemma":[0.9572993,0.000030723306,0.040852685,0.00051643286,0.000115029616,0.00043074906,0.000017237195,0.0000028209688,0.0007350502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994536,0.000015387948,0.000107063875,0.00023331032,0.000029502882,0.00016113197],"domain_scores_gemma":[0.99955714,0.0001675427,0.000037271824,0.00016439533,0.000037994727,0.000035662917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003775643,0.0000687226,0.000091893504,0.00003387989,0.00038041064,0.000026043037,0.00021106069,0.00006585442,0.0000199355],"category_scores_gemma":[0.000006458498,0.000058471964,0.000026341904,0.00010967096,0.000115748735,0.00010607501,0.00006222308,0.000055499073,0.00002617934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012097815,0.000044289005,0.00005958417,0.0000026178996,0.0000022388624,2.8155125e-7,0.00001472581,0.000026202468,0.00081034517,0.996903,0.00039213762,0.0017433733],"study_design_scores_gemma":[0.00020629934,0.00007856639,0.002940301,0.0000010926381,0.0000075346147,0.00003080352,0.000023829849,0.0028996821,0.0011701253,0.89829695,0.09422395,0.00012085008],"about_ca_topic_score_codex":0.0000059952463,"about_ca_topic_score_gemma":0.000009424294,"teacher_disagreement_score":0.94864565,"about_ca_system_score_codex":0.000006452244,"about_ca_system_score_gemma":0.00001037294,"threshold_uncertainty_score":0.29258496},"labels":[],"label_agreement":null},{"id":"W2059149325","doi":"10.1007/s10474-007-6054-1","title":"Notes on sectionally complemented lattices. IV How far does the Atom Lemma go?","year":2007,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Manitoba","funders":"","keywords":"Mathematics; Lattice (music); Lemma (botany); Atom (system on chip); Complement (music); Ideal (ethics); Pure mathematics; Combinatorics; Physics; Chemistry; Computer science","score_opus":0.02839771297113551,"score_gpt":0.284080443659751,"score_spread":0.25568273068861547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059149325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046945658,0.00010648206,0.8744678,0.067286156,0.001635694,0.000917513,0.00001785031,0.0006475505,0.007975316],"genre_scores_gemma":[0.9566871,0.000024848827,0.03627472,0.004584967,0.00030958766,0.00003642916,0.000009051255,0.000033120832,0.0020401648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.995783,0.00014939375,0.0006113238,0.0009645693,0.0013927312,0.0010990392],"domain_scores_gemma":[0.99579394,0.0020297372,0.00047054197,0.0012529511,0.00016955791,0.00028330117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027172812,0.00043317702,0.00040260778,0.0002966149,0.0011342902,0.0005662359,0.0031572443,0.00022942715,0.00014096097],"category_scores_gemma":[0.00054836844,0.00024163107,0.0002189424,0.0014962924,0.00040843058,0.001035649,0.00083773397,0.0010069453,0.00029015032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019478532,0.00031626874,0.00048177413,0.00006766571,0.00011255304,0.000020773901,0.0017361288,0.000034981098,0.009988886,0.9643388,0.013022172,0.00986054],"study_design_scores_gemma":[0.001694426,0.00035913504,0.017029507,0.00023870483,0.0001501605,0.00019222153,0.00089841906,0.04123915,0.031452116,0.35039118,0.55452853,0.0018264243],"about_ca_topic_score_codex":0.000004287102,"about_ca_topic_score_gemma":0.00003815686,"teacher_disagreement_score":0.90974146,"about_ca_system_score_codex":0.00011992276,"about_ca_system_score_gemma":0.000077968754,"threshold_uncertainty_score":0.985343},"labels":[],"label_agreement":null},{"id":"W2060727642","doi":"10.1007/s10485-007-9118-z","title":"A Priestley Sum of Finite Trees is Acyclic","year":2007,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Theory of computation; Mathematics; Mathematical economics; Algorithm","score_opus":0.013890421971026171,"score_gpt":0.25175465775570927,"score_spread":0.2378642357846831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060727642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042612422,0.00016391136,0.9486251,0.00020172275,0.00018021223,0.00014858351,0.0000011555207,0.00014240554,0.007924482],"genre_scores_gemma":[0.98859423,0.000011104965,0.010541267,0.0006660643,0.00009557391,0.000005992612,0.00000310306,0.000009473025,0.000073185365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857444,0.000011838992,0.00031040952,0.00038693007,0.00031760256,0.0003987838],"domain_scores_gemma":[0.9989801,0.000238975,0.0001311073,0.00047951486,0.000038128004,0.00013215978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012683931,0.00018347432,0.000250881,0.000088393805,0.00009317802,0.000035100828,0.0007904828,0.00011283686,0.00005360481],"category_scores_gemma":[0.000030324056,0.00013861776,0.0000745273,0.00053429557,0.00011392478,0.00011253447,0.0002080031,0.0001832927,0.000021029144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015359063,0.000020265687,0.0002807657,0.000007306829,0.000011918315,0.000008309808,0.0003566001,0.0000800567,0.004609288,0.94383186,0.00028599802,0.050492257],"study_design_scores_gemma":[0.0003024834,0.000059146056,0.025960583,5.350348e-7,0.0000070205047,0.000008665895,0.00004590509,0.0001691059,0.04042651,0.9266411,0.006155999,0.00022295592],"about_ca_topic_score_codex":0.000015383153,"about_ca_topic_score_gemma":0.000009468573,"teacher_disagreement_score":0.9459818,"about_ca_system_score_codex":0.000028742008,"about_ca_system_score_gemma":0.000026697788,"threshold_uncertainty_score":0.56526685},"labels":[],"label_agreement":null},{"id":"W2060866535","doi":"10.1016/j.entcs.2011.01.010","title":"Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract)","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Dagger; Mathematics; Hilbert space; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.022552166226990918,"score_gpt":0.25994593900460267,"score_spread":0.23739377277761176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060866535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03631402,0.00019055449,0.96059775,0.0011820284,0.0005360539,0.00043711206,0.0000059692034,0.00019098303,0.0005455002],"genre_scores_gemma":[0.91554385,0.000006852445,0.08345061,0.0008521757,0.00009927355,0.000020134159,0.0000040035056,0.000016159956,0.0000069189846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613243,0.00008998457,0.0004717294,0.0011577986,0.00056200224,0.0015860448],"domain_scores_gemma":[0.99694175,0.0015121949,0.00020104066,0.0008673179,0.00021785825,0.00025987058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012141014,0.00037736044,0.00044842064,0.00028835356,0.0004854039,0.00026837867,0.0025792995,0.00009708272,0.000067946006],"category_scores_gemma":[0.00031964845,0.00030535035,0.00013550503,0.0010763552,0.002261179,0.00093452353,0.0005261338,0.0004814333,0.00003649436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005974362,0.00017477808,0.0002661027,0.000010597091,0.000009375478,0.000015727988,0.0005588426,0.00074925926,0.0005256604,0.9908554,0.000015885536,0.0067586442],"study_design_scores_gemma":[0.00052184117,0.0004591079,0.007939158,0.00003257076,0.0000049741543,0.0000270153,0.000006734854,0.306411,0.0050601726,0.6789605,0.00018218497,0.00039470114],"about_ca_topic_score_codex":0.000016988895,"about_ca_topic_score_gemma":0.000025686642,"teacher_disagreement_score":0.87922984,"about_ca_system_score_codex":0.000196542,"about_ca_system_score_gemma":0.0003452478,"threshold_uncertainty_score":0.99993986},"labels":[],"label_agreement":null},{"id":"W2060934456","doi":"10.1007/s00012-006-1983-z","title":"The support of a uniform semigroup valued measure","year":2007,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Abelian group; Semigroup; Orthogonality; Monoid; Measure (data warehouse); Algebra over a field; Pure mathematics; Bicyclic semigroup; Discrete mathematics; Computer science; Data mining","score_opus":0.009706325493753816,"score_gpt":0.22273271649447302,"score_spread":0.2130263910007192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060934456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03139765,0.0002190648,0.89727336,0.0011226188,0.0004903435,0.0002539066,0.000004540027,0.00026811266,0.06897043],"genre_scores_gemma":[0.98907304,0.0000355667,0.009175507,0.0003391999,0.00004865189,0.0000011266862,0.0000034844238,0.00001086119,0.0013125875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986906,0.0000403492,0.0002416897,0.0002546381,0.00037402043,0.00039869375],"domain_scores_gemma":[0.99868596,0.00023283396,0.00015248556,0.00066811417,0.00014606476,0.000114536335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007107502,0.00013857472,0.00015155114,0.00009354778,0.00022292297,0.0000386398,0.0011858896,0.00007186722,0.0000240633],"category_scores_gemma":[0.00005845123,0.000098989156,0.000105392646,0.0006504214,0.00015468251,0.000498641,0.00021452321,0.00014449863,0.00002750487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019743153,0.000027709006,0.00023486579,0.0000044777125,0.000031738626,0.000035297307,0.00084701995,0.000012894517,0.0006903506,0.9716298,0.0013840287,0.025082085],"study_design_scores_gemma":[0.0043729167,0.0014901389,0.01631934,0.00009050708,0.0001403658,0.00026213753,0.0052692005,0.0044453605,0.0748601,0.3037792,0.58708113,0.0018896037],"about_ca_topic_score_codex":0.000042231757,"about_ca_topic_score_gemma":0.00012502982,"teacher_disagreement_score":0.95767534,"about_ca_system_score_codex":0.000059717466,"about_ca_system_score_gemma":0.00008713322,"threshold_uncertainty_score":0.40366608},"labels":[],"label_agreement":null},{"id":"W20613509","doi":"10.1097/moh.0b013e32833c06c6","title":"Improvements in factor concentrates.","year":2010,"lang":"en","type":"article","venue":"PubMed","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Brain–computer interface; Algebra over a field; Mathematics; Computer science; Arithmetic; Pure mathematics; Psychology; Electroencephalography","score_opus":0.014703559563619184,"score_gpt":0.21372925850278462,"score_spread":0.19902569893916544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20613509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9769736,0.00003530684,0.016964912,0.00043090805,0.0011939155,0.0004412373,0.0000016880393,0.00012064006,0.0038378167],"genre_scores_gemma":[0.9975373,0.0000024914834,0.0016192219,0.0003722816,0.000037943995,0.00022947349,4.5026408e-7,0.000002806376,0.00019800164],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999301,0.000008634059,0.000097242555,0.00019180337,0.000090799964,0.0003105319],"domain_scores_gemma":[0.9996288,0.000021832322,0.000029952047,0.00022575172,0.000013006435,0.00008068513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007300952,0.000061021125,0.000065219174,0.00003303277,0.000021671052,0.000048336704,0.00040679565,0.000032554373,0.0000127006],"category_scores_gemma":[0.0000369836,0.000051242492,0.000016789192,0.00015138826,0.000020814801,0.0003148505,0.00008569008,0.00014031306,0.00001804599],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015992256,0.000044995715,0.020557541,0.0000024853475,0.0000024752203,0.0000116058545,0.0001031254,0.000002413711,0.002002217,0.042021584,0.000045610475,0.9352043],"study_design_scores_gemma":[0.0004611968,0.000007758609,0.96827096,6.9955485e-7,4.5045135e-7,0.0000019177521,0.0000043999817,0.0006308304,0.008808422,0.015627176,0.006050323,0.0001358631],"about_ca_topic_score_codex":0.000007903895,"about_ca_topic_score_gemma":0.00002815391,"teacher_disagreement_score":0.94771343,"about_ca_system_score_codex":0.000014575279,"about_ca_system_score_gemma":0.000011726738,"threshold_uncertainty_score":0.20896082},"labels":[],"label_agreement":null},{"id":"W2062036401","doi":"10.1063/1.3275650","title":"The Origin of Complex Quantum Amplitudes","year":2009,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Icon; Citation; Computer science; Information retrieval; Download; World Wide Web; Filter (signal processing); Publishing; Art; Programming language; Literature","score_opus":0.052609890843670064,"score_gpt":0.29150771460902547,"score_spread":0.2388978237653554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062036401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0752427,0.00021293724,0.8963967,0.0081695095,0.00018295104,0.00028945034,0.0000012938666,0.00031949542,0.019184962],"genre_scores_gemma":[0.9910546,0.00006127782,0.008278455,0.00042861546,0.00003325562,0.000006858975,4.6120124e-7,0.0000032422533,0.00013324028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891776,0.0000065844274,0.00023851976,0.00028070676,0.00024587172,0.0003105681],"domain_scores_gemma":[0.9991929,0.000071623625,0.00015429404,0.0002038249,0.00030790913,0.000069481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020511309,0.00013358358,0.00016956705,0.00004100001,0.00020829965,0.00021268868,0.001229281,0.000038958784,0.000010564754],"category_scores_gemma":[0.000075280026,0.000087565175,0.000048242062,0.00031131867,0.00012723413,0.00046892953,0.00010862543,0.00012677524,0.000020299472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050209055,0.00002443298,0.0011661948,0.0000054809716,0.0000037827642,6.080098e-7,0.00051444565,3.3395557e-7,0.014331836,0.9598085,0.00044465993,0.023694647],"study_design_scores_gemma":[0.00022923747,0.00036860205,0.03984274,0.0000358065,0.0000050666563,0.000015253531,0.00027505204,0.026945103,0.0017532123,0.91293025,0.017356936,0.00024271471],"about_ca_topic_score_codex":0.0000056259896,"about_ca_topic_score_gemma":0.0000012090046,"teacher_disagreement_score":0.9158119,"about_ca_system_score_codex":0.000017428754,"about_ca_system_score_gemma":0.000059732734,"threshold_uncertainty_score":0.35708043},"labels":[],"label_agreement":null},{"id":"W2062755128","doi":"10.1002/malq.200610040","title":"Bounded BCK‐algebras and their generated variety","year":2007,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Population and Public Health","keywords":"Bounded function; Mathematics; Residuated lattice; Commutative property; Simple (philosophy); Class (philosophy); Variety (cybernetics); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015349064421880842,"score_gpt":0.2413161522678692,"score_spread":0.22596708784598837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062755128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11006421,0.00009481755,0.8826963,0.0005355952,0.00010751087,0.00017153414,0.0000010588918,0.00031443228,0.006014583],"genre_scores_gemma":[0.8789731,0.0000022216755,0.11984122,0.00089815893,0.000071049835,0.000009692001,0.000002105735,0.000011287587,0.00019114134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983471,0.00005928737,0.00039738195,0.00046763394,0.0002008757,0.00052768976],"domain_scores_gemma":[0.99872446,0.00036569926,0.000089029825,0.00053484534,0.00006103748,0.00022492734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064671424,0.000252875,0.0003167103,0.00006914152,0.00019002888,0.00022282121,0.00051865465,0.00012970324,0.0000798202],"category_scores_gemma":[0.0000428926,0.00016681486,0.0000753376,0.00032126793,0.00016116818,0.00032683028,0.00008141094,0.00019898046,0.0001933309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045474876,0.00010663375,0.0000143698935,0.000021937567,0.000013255171,0.000031336123,0.0020994565,8.3154083e-7,0.0015467757,0.96499634,0.00006986221,0.031094642],"study_design_scores_gemma":[0.0002818032,0.00040984794,0.0006115466,0.000012112363,0.0000047281987,0.00012347073,0.00029042066,0.00886951,0.0007875867,0.9880276,0.00032934753,0.00025205093],"about_ca_topic_score_codex":0.0000015461858,"about_ca_topic_score_gemma":0.0000035098535,"teacher_disagreement_score":0.7689089,"about_ca_system_score_codex":0.00002770406,"about_ca_system_score_gemma":0.000022464603,"threshold_uncertainty_score":0.6802513},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Manitoba","funders":"","keywords":"Foundation (evidence); Lattice (music); Theoretical physics; Physics; Political science; Law","score_opus":0.027744044540146735,"score_gpt":0.24153829784232209,"score_spread":0.21379425330217536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206333455","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9939273e-7,0.00005230134,0.47998273,0.000028738612,0.00023558179,0.000051454925,1.7405087e-7,0.00015441918,0.5194944],"genre_scores_gemma":[0.00007230456,0.000021873739,0.048931755,0.0007123623,0.00013403285,0.000005115045,0.000010457013,0.000011250357,0.95010084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923265,0.00003040463,0.00012429483,0.00032680153,0.00013524614,0.00015061547],"domain_scores_gemma":[0.9991405,0.000101316,0.00009756792,0.0005637308,0.00004998696,0.000046887082],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001552751,0.00015066128,0.00013961749,0.0000637021,0.000060454124,0.00006273763,0.0007892178,0.00012797439,0.0007879259],"category_scores_gemma":[0.000016870836,0.000118373246,0.0000579033,0.000049369904,0.00003719813,0.00034389697,0.00020829108,0.00016214054,0.0028329175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.8342813e-7,0.0000048782103,2.5936208e-7,0.00000519911,0.000007173855,0.0000042759016,0.0000576011,3.5491257e-7,6.6675454e-7,0.92973155,0.00415648,0.06603068],"study_design_scores_gemma":[0.000032437973,0.000020887805,0.000005808595,0.000008028678,0.0000046278474,0.000003854118,7.940639e-7,0.00009338145,0.000012671129,0.6584779,0.34122324,0.00011634468],"about_ca_topic_score_codex":9.076201e-7,"about_ca_topic_score_gemma":0.0000022958986,"teacher_disagreement_score":0.431051,"about_ca_system_score_codex":0.000047047055,"about_ca_system_score_gemma":0.00013664497,"threshold_uncertainty_score":0.9979435},"labels":[],"label_agreement":null},{"id":"W2064465307","doi":"10.1016/j.jcta.2008.08.007","title":"Distributive lattices of small width, II: A problem from Stanley's 1986 text Enumerative Combinatorics","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Combinatorics; Cardinality (data modeling); Distributive property; Partially ordered set; Mathematics; Enumerative combinatorics; Order (exchange); Extremal combinatorics; Algebraic combinatorics; Generating function; Distributive lattice; Discrete mathematics; Computer science; Pure mathematics","score_opus":0.009677406249627167,"score_gpt":0.22997294305811897,"score_spread":0.2202955368084918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064465307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59044904,0.004559527,0.37892625,0.0038825087,0.013095282,0.0009910978,0.00015012673,0.00021986949,0.007726281],"genre_scores_gemma":[0.98674744,0.00011207028,0.012614842,0.00010349254,0.00027673808,0.0000027024614,0.000004645363,0.000011644666,0.0001264074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997535,0.00040183964,0.00087755744,0.00027774984,0.000548841,0.00035903076],"domain_scores_gemma":[0.99665606,0.00056545093,0.0013640401,0.00041193538,0.00081453886,0.00018795268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083793065,0.0003004467,0.0007271189,0.00012478465,0.00026360297,0.00012097919,0.0012763864,0.00014102779,0.000026172052],"category_scores_gemma":[0.0002554166,0.00023910882,0.00021094075,0.00055567897,0.00019556687,0.0011759208,0.00023155173,0.0004865349,0.0000026586254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063080416,0.00049240445,0.000073440024,0.000008226669,0.00010639761,0.000061357474,0.0025302032,0.000049288687,0.001184875,0.9849911,0.000115195195,0.009756708],"study_design_scores_gemma":[0.0018164095,0.003943542,0.000377515,0.00010065476,0.000044332814,0.00004633235,0.0003750595,0.000041636926,0.012930696,0.9752367,0.0048319716,0.00025514505],"about_ca_topic_score_codex":0.000005650379,"about_ca_topic_score_gemma":0.0000017391777,"teacher_disagreement_score":0.3962984,"about_ca_system_score_codex":0.00011803463,"about_ca_system_score_gemma":0.00024321389,"threshold_uncertainty_score":0.9750574},"labels":[],"label_agreement":null},{"id":"W2064771713","doi":"10.1016/s0166-8641(00)00054-7","title":"Erratum to “Depth, π-character, and tightness in superatomic Boolean algebras” Topology and its Applications 75 (1997) 183–199","year":2000,"lang":"en","type":"erratum","venue":"Topology and its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Character (mathematics); Topology (electrical circuits); Pure mathematics; Combinatorics; Geometry","score_opus":0.013285853473307654,"score_gpt":0.26951804400669377,"score_spread":0.25623219053338614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064771713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13550946,0.22943617,0.29536173,0.13048624,0.016676702,0.03203568,0.0023166942,0.0035893468,0.15458798],"genre_scores_gemma":[0.689014,0.05558968,0.008540175,0.017795857,0.0043432843,0.015919091,0.00228659,0.00031760725,0.20619373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967297,0.00014496311,0.00063298515,0.0016079836,0.00015259291,0.0007318054],"domain_scores_gemma":[0.9982009,0.00024725214,0.00018955208,0.0008778846,0.00010411309,0.0003802817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020108445,0.0005681952,0.00077788497,0.00048735773,0.0006399261,0.00012489036,0.0009405119,0.0009131256,0.000093308314],"category_scores_gemma":[0.000030535943,0.00057040795,0.000058071222,0.00067829026,0.00036547615,0.00039224204,0.00054013456,0.0011036036,0.00018522175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023538418,0.00024301886,0.00016630176,0.00015742924,0.000059919035,0.000018723633,0.0009322771,0.0000056049093,0.0005115404,0.9127084,0.042481642,0.042691603],"study_design_scores_gemma":[0.0006129716,0.00016706034,0.0043016193,0.000049695405,0.00005910308,0.00032249556,0.00010135085,0.0008254434,0.00019172921,0.08061198,0.9118073,0.00094926095],"about_ca_topic_score_codex":0.000029699002,"about_ca_topic_score_gemma":0.00028920834,"teacher_disagreement_score":0.86932564,"about_ca_system_score_codex":0.000058337737,"about_ca_system_score_gemma":0.00017811007,"threshold_uncertainty_score":0.99967474},"labels":[],"label_agreement":null},{"id":"W2065333210","doi":"10.1007/s11083-009-9133-9","title":"Posets with the Maximal Antichain Property","year":2009,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Antichain; Partially ordered set; Mathematics; Combinatorics; Property (philosophy); Discrete mathematics","score_opus":0.008195563251251668,"score_gpt":0.21265495025804212,"score_spread":0.20445938700679045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065333210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036018293,0.000118298405,0.89922804,0.046372253,0.00007575531,0.00019064602,2.8191212e-7,0.00017806233,0.0178184],"genre_scores_gemma":[0.96599066,0.000002610625,0.026881464,0.0047813505,0.000032742875,0.0000027396516,3.1840085e-7,0.0000028879133,0.0023052273],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950737,0.000017959865,0.000042630094,0.00015594297,0.0001148672,0.00016125875],"domain_scores_gemma":[0.9996275,0.00001120293,0.000019488214,0.00027899735,0.000036531932,0.00002628977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060193233,0.00006499943,0.000052674048,0.00001225394,0.00010035312,0.000055002914,0.00038150675,0.000022892315,0.000015779444],"category_scores_gemma":[0.0000071832574,0.000024405612,0.000011382159,0.00023024289,0.00002808384,0.00017477374,0.000037192767,0.00010297688,0.00006234912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033098087,0.00019931441,0.0006753309,0.000005031813,0.000016501974,0.00013220246,0.0014972544,0.00055253954,0.0021535035,0.315233,0.008287299,0.67121494],"study_design_scores_gemma":[0.003368969,0.003947345,0.16015112,0.00008483919,0.00003466826,0.00074063754,0.00033247648,0.07654234,0.0060207252,0.15005937,0.5966929,0.0020245912],"about_ca_topic_score_codex":0.0000020761063,"about_ca_topic_score_gemma":0.000003319877,"teacher_disagreement_score":0.92997235,"about_ca_system_score_codex":0.0000049013,"about_ca_system_score_gemma":0.000023013776,"threshold_uncertainty_score":0.099523194},"labels":[],"label_agreement":null},{"id":"W2065498341","doi":"10.2178/jsl/1185803624","title":"Simplicial structures in MV-algebras and logic","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Algebra over a field; Axiom; Completeness (order theory); Algebraic structure; Intermediate logic; Peano axioms; Łukasiewicz logic; Relation algebra; Interior algebra; Discrete mathematics; Pure mathematics; Subalgebra; Division algebra; Two-element Boolean algebra; Algebra representation; Substructural logic; Computer science; Description logic; Theoretical computer science","score_opus":0.0161204057250458,"score_gpt":0.2802801720625293,"score_spread":0.2641597663374835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065498341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8118614,0.0014413135,0.18299975,0.0010005437,0.0005020876,0.000096728,4.3614642e-7,0.0000322166,0.0020655512],"genre_scores_gemma":[0.9780887,0.0001043969,0.019930385,0.0015281877,0.00032300508,4.5937816e-7,1.6342433e-7,0.000006181897,0.000018522149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847186,0.000054818094,0.00056904415,0.00021296246,0.00029749435,0.00039381778],"domain_scores_gemma":[0.9990214,0.00018253208,0.00034095327,0.00019948701,0.00009049434,0.0001651161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007390586,0.00016695773,0.0003510049,0.00033992043,0.000072730036,0.00007232513,0.0006275306,0.00011219916,0.00001792799],"category_scores_gemma":[0.000137872,0.00011723613,0.000079576756,0.0004410294,0.00008419443,0.00046033002,0.00015468789,0.00038442021,0.0000055657833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004795226,0.00009403767,0.009371108,0.00001633378,0.000019464196,0.00076875306,0.0009624602,0.00030015828,0.0037169142,0.9190254,0.00013756924,0.0655398],"study_design_scores_gemma":[0.00061120675,0.00028764657,0.19456898,0.000016765547,0.0000057935667,0.00089357945,0.00012281805,0.00012924864,0.0006641762,0.80201596,0.0005154718,0.00016836092],"about_ca_topic_score_codex":0.0000064446376,"about_ca_topic_score_gemma":0.000016990556,"teacher_disagreement_score":0.18519786,"about_ca_system_score_codex":0.000057977326,"about_ca_system_score_gemma":0.000057542315,"threshold_uncertainty_score":0.47807506},"labels":[],"label_agreement":null},{"id":"W2066727543","doi":"10.1007/s00012-008-2046-4","title":"Essential operations in centralizer clones","year":2008,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Endomorphism; Unary operation; Homomorphism; Universal algebra; Centralizer and normalizer; Idempotence; Quotient; Ideal (ethics); Combinatorics; Lattice (music); Discrete mathematics; Pure mathematics; Algebra over a field","score_opus":0.011742257683624772,"score_gpt":0.21847362485287422,"score_spread":0.20673136716924945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066727543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.723831,0.00014317114,0.26938462,0.0017084155,0.00039146785,0.00015864123,0.0000035342994,0.00023804049,0.004141087],"genre_scores_gemma":[0.9867621,0.00012682761,0.011966537,0.0003753877,0.0000484845,0.0000030950093,0.000007751766,0.00000675919,0.0007030546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99908465,0.000051641768,0.00014072986,0.00029333,0.00015099354,0.00027867392],"domain_scores_gemma":[0.99949276,0.000032318116,0.000022641185,0.00033336753,0.000038470826,0.0000804394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004194359,0.0001114447,0.00012301814,0.00013640516,0.00016661898,0.000033979028,0.00052071665,0.00005113524,0.00009085433],"category_scores_gemma":[0.000016288692,0.00010930344,0.00005026047,0.00054012303,0.00008206331,0.0009617015,0.00013107728,0.00010452081,0.00008174956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059626855,0.00010631836,0.0031194119,0.0000028648217,0.000011853185,0.00046864152,0.0024579358,0.00211615,0.001184266,0.9881382,0.0011528593,0.0012355415],"study_design_scores_gemma":[0.019226864,0.0010258714,0.29854065,0.00022020553,0.000103578954,0.0019766344,0.0032576015,0.1909451,0.07510545,0.18722628,0.21532042,0.0070513287],"about_ca_topic_score_codex":0.00021161801,"about_ca_topic_score_gemma":0.00017711779,"teacher_disagreement_score":0.8009119,"about_ca_system_score_codex":0.00004591829,"about_ca_system_score_gemma":0.00007369442,"threshold_uncertainty_score":0.44572648},"labels":[],"label_agreement":null},{"id":"W2068570931","doi":"10.1142/s0219467802000871","title":"FUZZY RELATION CALCULUS IN THE COMPRESSION AND DECOMPRESSION OF FUZZY RELATIONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Image and Graphics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fuzzy logic; Mathematics; Calculus (dental); Fuzzy associative matrix; Relation (database); Fuzzy subalgebra; Fuzzy number; Algebra over a field; Norm (philosophy); Computer science; Algorithm; Fuzzy set; Artificial intelligence; Pure mathematics; Data mining; Epistemology","score_opus":0.017047535592422235,"score_gpt":0.2717731045827834,"score_spread":0.2547255689903612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068570931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81071883,0.003408427,0.17529117,0.006839395,0.00043999567,0.00010671055,0.0000038013854,0.000010738039,0.003180923],"genre_scores_gemma":[0.9915962,0.00081705436,0.007337,0.00018844444,0.000042706477,6.3508367e-7,7.359467e-7,0.0000020983073,0.000015099943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991598,0.00007664764,0.00030911434,0.00008514723,0.00030543792,0.00006384244],"domain_scores_gemma":[0.9992099,0.00022216326,0.0002607629,0.00008886512,0.00018750908,0.00003080474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026393187,0.000060283946,0.00009478883,0.00021883233,0.00005655219,0.000054946566,0.0003334422,0.000038370934,0.0000042786633],"category_scores_gemma":[0.000079358884,0.000038904906,0.000040712774,0.00016767751,0.00007176229,0.00069514266,0.00007280477,0.00020625275,6.880717e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009580237,0.0006213734,0.07658253,0.00003064515,0.00010846834,0.00035442613,0.01070328,0.0009939239,0.012641662,0.77044326,0.002693651,0.124731],"study_design_scores_gemma":[0.0023843579,0.00030658697,0.5059319,0.00043651948,0.000026835734,0.0010327575,0.00035741072,0.054145504,0.000753403,0.43217653,0.0022107426,0.00023744552],"about_ca_topic_score_codex":0.0000054333027,"about_ca_topic_score_gemma":0.0000044234,"teacher_disagreement_score":0.4293494,"about_ca_system_score_codex":0.000007931057,"about_ca_system_score_gemma":0.0000070821216,"threshold_uncertainty_score":0.1586496},"labels":[],"label_agreement":null},{"id":"W2071325394","doi":"10.1007/s00012-003-1829-x","title":"Collapsing monoids containing permutations and constants","year":2003,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Unary operation; Mathematics; Monoid; Combinatorics; Cardinality (data modeling); Interval (graph theory); Countable set; Lattice (music); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.01239809529612595,"score_gpt":0.22683681485106344,"score_spread":0.21443871955493748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071325394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33537185,0.0004467316,0.617629,0.00057668483,0.0003020495,0.000194878,0.000005940101,0.00030017528,0.045172703],"genre_scores_gemma":[0.97368294,0.00003362525,0.025617214,0.00036545907,0.000009654598,0.0000018765488,0.000001398587,0.0000072249572,0.00028060612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.00007881893,0.00011886026,0.0002942061,0.0001194815,0.00024207578],"domain_scores_gemma":[0.9993446,0.00017687309,0.00005861812,0.00024370156,0.000061788654,0.000114442024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113600196,0.00011776456,0.00013254811,0.000101662146,0.00027569692,0.000105468775,0.00020881336,0.00004623282,0.000030526477],"category_scores_gemma":[0.000098490316,0.000120780154,0.000028796914,0.00037449802,0.000107932836,0.000670671,0.00006673315,0.00008683223,0.000012587163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022483275,0.000010456339,0.001019646,0.0000022973684,0.000012556599,0.00004605949,0.0012029062,0.000039073377,0.00036966807,0.99428165,0.000093716546,0.002919747],"study_design_scores_gemma":[0.0068483525,0.00087674893,0.008465836,0.00014687501,0.00012384108,0.0007254163,0.01998749,0.025644291,0.010707817,0.8368427,0.08716562,0.002464975],"about_ca_topic_score_codex":0.000014040396,"about_ca_topic_score_gemma":0.000010959465,"teacher_disagreement_score":0.6383111,"about_ca_system_score_codex":0.000044398214,"about_ca_system_score_gemma":0.00008699812,"threshold_uncertainty_score":0.4925272},"labels":[],"label_agreement":null},{"id":"W2072503251","doi":"10.1007/s00500-002-0239-x","title":"An alternative characterization of fuzzy complement functional","year":2003,"lang":"en","type":"article","venue":"Soft Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Characterization (materials science); Complement (music); Fuzzy logic; Negation; Computer science; Mathematics; Function (biology); Artificial intelligence; Programming language; Biology; Physics","score_opus":0.027320615981026197,"score_gpt":0.26663214156206744,"score_spread":0.23931152558104124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072503251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28863853,0.000006985201,0.7102704,0.000027818423,0.0003023265,0.00005876699,0.0000011723147,0.000060177674,0.0006337876],"genre_scores_gemma":[0.9611149,7.5435446e-7,0.038599364,0.00017740426,0.000073755546,0.0000012983619,0.000013972569,0.000004634481,0.0000139414415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999114,0.000082044724,0.0002090502,0.0002416363,0.00018550872,0.00016777542],"domain_scores_gemma":[0.9994246,0.000056289304,0.00016018734,0.00021357542,0.000098966164,0.000046383982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020304215,0.000086697335,0.00011171451,0.000056788824,0.00012058376,0.00003305455,0.00025147176,0.000018345809,0.000019136236],"category_scores_gemma":[0.00002228446,0.000083536135,0.00002830634,0.00020045473,0.000024912697,0.00029463443,0.00006216161,0.000063934734,0.000009149312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036190827,0.00013212094,0.0051581697,0.0000121387375,0.000017139662,0.0000034920786,0.0009328373,0.0075978762,0.05875962,0.8823556,0.000009516443,0.045017876],"study_design_scores_gemma":[0.0017001777,0.00061043026,0.16494098,0.000090869995,0.00001352109,0.000053724674,0.00023042827,0.5810802,0.08176817,0.1653832,0.0033031951,0.00082509784],"about_ca_topic_score_codex":0.000002200629,"about_ca_topic_score_gemma":4.711374e-7,"teacher_disagreement_score":0.7169724,"about_ca_system_score_codex":0.000022792705,"about_ca_system_score_gemma":0.000030182075,"threshold_uncertainty_score":0.34065047},"labels":[],"label_agreement":null},{"id":"W2073275935","doi":"10.1007/s10485-007-9122-3","title":"Almost ff-universality Implies Q-universality","year":2008,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Universality (dynamical systems); Mathematics; Statistical physics; Physics; Quantum mechanics","score_opus":0.01977162236846663,"score_gpt":0.21600911740620693,"score_spread":0.1962374950377403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073275935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09373763,0.00012113303,0.87674195,0.00072379224,0.00038402906,0.000264342,0.0000033627234,0.0006762797,0.027347516],"genre_scores_gemma":[0.9923415,0.000035346184,0.006746308,0.00054125296,0.00012332009,0.0000073197593,0.00001008545,0.000011869811,0.00018295394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817264,0.000048577273,0.00023358752,0.000656555,0.00037926662,0.0005093941],"domain_scores_gemma":[0.9988113,0.000090858885,0.00010870318,0.0007057042,0.000055045508,0.00022840798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008114439,0.00027406012,0.00030596944,0.000068723806,0.0005155667,0.000051881703,0.0011512535,0.00014485882,0.00009408951],"category_scores_gemma":[0.000018592378,0.00022734409,0.000102624384,0.0005274661,0.00026817588,0.0003134478,0.00041425898,0.00030708482,0.000071546456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014498272,0.000023499346,0.0002988198,0.000005307745,0.000017280903,0.00006563083,0.00039123083,0.00014093373,0.00083531236,0.9886884,0.0015104731,0.008008588],"study_design_scores_gemma":[0.00052231,0.00005096177,0.04571375,2.934924e-7,0.000010347368,0.00012351041,0.0001605142,0.00024277878,0.00214103,0.9357884,0.014766152,0.0004799596],"about_ca_topic_score_codex":0.00006997756,"about_ca_topic_score_gemma":0.000005868672,"teacher_disagreement_score":0.8986039,"about_ca_system_score_codex":0.00012402094,"about_ca_system_score_gemma":0.000077474826,"threshold_uncertainty_score":0.9270823},"labels":[],"label_agreement":null},{"id":"W2074194362","doi":"10.1017/jsl.2014.53","title":"ALGEBRAIC GEOMETRY FOR MV-ALGEBRAS","year":2014,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Real algebraic geometry; Algebra over a field; Function field of an algebraic variety; Polynomial; Algebraic number; Dimension of an algebraic variety; Singular point of an algebraic variety; Algebraic structure; Pure mathematics; Mathematical analysis","score_opus":0.015202689092916234,"score_gpt":0.2576290290568988,"score_spread":0.24242633996398255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074194362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087817535,0.0006193258,0.9065568,0.0020703655,0.0010172889,0.000132821,9.129996e-7,0.00006332731,0.0017216675],"genre_scores_gemma":[0.91994876,0.000049045317,0.07651359,0.0025000304,0.00076491723,0.000005679742,6.245261e-7,0.000013884372,0.00020345516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830586,0.00008168354,0.00058094127,0.00025080767,0.00035950827,0.00042117314],"domain_scores_gemma":[0.99816054,0.0004128263,0.0005447336,0.00040465005,0.0002670694,0.0002101805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091375335,0.00019299114,0.0004460131,0.0003117743,0.00013670835,0.00010903489,0.0012921651,0.000105200466,0.000029743169],"category_scores_gemma":[0.00048260897,0.00013846246,0.00028216836,0.00047156037,0.00006085667,0.00062471535,0.00013408341,0.0002575012,0.000047863447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019831594,0.000120497396,0.0005269181,0.00003325136,0.00004724253,0.00001979957,0.00022123427,0.0002624187,0.001786616,0.93175656,0.0022751119,0.0629305],"study_design_scores_gemma":[0.0012906801,0.0010632179,0.005906265,0.000039970582,0.00002853536,0.0004967621,0.000042583568,0.0028264592,0.0018001689,0.9606576,0.025527563,0.00032019505],"about_ca_topic_score_codex":8.4906856e-7,"about_ca_topic_score_gemma":5.2328573e-7,"teacher_disagreement_score":0.83213127,"about_ca_system_score_codex":0.000049288843,"about_ca_system_score_gemma":0.00007677852,"threshold_uncertainty_score":0.56463355},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013449183170227435,"score_gpt":0.21796306836493562,"score_spread":0.20451388519470817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078516608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30000395,0.005071046,0.6309256,0.006244096,0.0007037544,0.00030664972,0.000009356569,0.00013068983,0.056604877],"genre_scores_gemma":[0.99331975,0.00008224417,0.005394767,0.0009343151,0.00018729501,0.0000017167376,3.27901e-7,0.0000049406126,0.000074657815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917054,0.000016680238,0.00025280012,0.0001519999,0.00020855473,0.00019939568],"domain_scores_gemma":[0.9993849,0.000063256084,0.00020558739,0.00015727327,0.000051361665,0.00013764398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013369352,0.000117184776,0.00021507824,0.000047332996,0.00011369922,0.0000935826,0.00036896492,0.00004996713,0.000045220102],"category_scores_gemma":[0.000009562578,0.00008493066,0.00006720769,0.00018694591,0.00006411937,0.0003441927,0.00009135873,0.00023038233,0.000024979961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005660358,0.000057026242,0.000029933022,0.000005342892,0.000020179043,0.000044669323,0.00032358366,0.000009900228,0.0008312579,0.96210307,0.0014911748,0.035078216],"study_design_scores_gemma":[0.0021587422,0.0005600803,0.0017588082,0.000056625984,0.000052269042,0.00090523006,0.00029349254,0.0009689428,0.010000959,0.9218941,0.06078779,0.0005629603],"about_ca_topic_score_codex":2.8977558e-7,"about_ca_topic_score_gemma":9.915188e-7,"teacher_disagreement_score":0.6933158,"about_ca_system_score_codex":0.00001629989,"about_ca_system_score_gemma":0.000008964623,"threshold_uncertainty_score":0.3463372},"labels":[],"label_agreement":null},{"id":"W2079424204","doi":"10.1142/s0218196701000681","title":"A CHARACTERIZATION OF de MORGAN ALGEBRAS","year":2001,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Characterization (materials science); Combinatorics; Set (abstract data type); Ternary operation; Algebra over a field; Type (biology); Discrete mathematics; Pure mathematics; Physics","score_opus":0.010866344651711499,"score_gpt":0.2641641481452289,"score_spread":0.25329780349351744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079424204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51034606,0.000037195343,0.4886667,0.0006342904,0.00021813772,0.000019824183,5.263878e-7,0.0000087612525,0.00006850529],"genre_scores_gemma":[0.9844895,0.00014904758,0.014896328,0.00028810577,0.00015061905,6.312478e-7,0.000004129621,0.000004532308,0.000017117021],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999098,0.000042666372,0.00036172927,0.000099298224,0.00030647058,0.000091821035],"domain_scores_gemma":[0.99895114,0.000057126937,0.00043798608,0.000058654667,0.00043456475,0.000060512724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018785868,0.000075400734,0.0001296265,0.00020790008,0.000029215897,0.00006790571,0.0003662179,0.00003436342,0.000008018345],"category_scores_gemma":[0.000039419327,0.00006794893,0.000051842737,0.0001616015,0.00003123609,0.00071811664,0.000062832994,0.00008175258,0.0000019459867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017629778,0.00034489072,0.023936102,0.000019858435,0.00024413303,0.00025913765,0.003651454,0.0020481867,0.1978801,0.23412521,0.00006810469,0.5372465],"study_design_scores_gemma":[0.0029227168,0.00083325047,0.43698382,0.00021785867,0.000044678083,0.004182128,0.0002129245,0.093996756,0.03921157,0.41933998,0.001613319,0.00044097105],"about_ca_topic_score_codex":0.0000026207504,"about_ca_topic_score_gemma":5.0565063e-7,"teacher_disagreement_score":0.53680557,"about_ca_system_score_codex":0.000034409975,"about_ca_system_score_gemma":0.00006295615,"threshold_uncertainty_score":0.27708772},"labels":[],"label_agreement":null},{"id":"W2080616779","doi":"10.1016/s0165-0114(02)00565-1","title":"Strong amalgamation, Beck–Chevalley for equivalence relations and interpolation in algebraic logic","year":2002,"lang":"en","type":"article","venue":"Fuzzy Sets and Systems","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Distributive property; Heyting algebra; Pure mathematics; Lemma (botany); Algebra over a field; Algebraic number; Equivalence (formal languages); Mathematical analysis","score_opus":0.049267129630278864,"score_gpt":0.27181070013176345,"score_spread":0.2225435705014846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080616779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23176998,0.0058264434,0.7553942,0.0012122244,0.0005583195,0.0010485164,0.000013576444,0.0001503823,0.0040263184],"genre_scores_gemma":[0.9943658,0.00006322313,0.005071384,0.0000569198,0.000042440504,0.000052670905,0.0000055635355,0.0000055308155,0.0003364329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904954,0.00006074039,0.00027867852,0.0003012519,0.000112588874,0.0001972176],"domain_scores_gemma":[0.9994387,0.00015825522,0.0001056542,0.00018509527,0.000049283364,0.00006301039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025197543,0.000109386136,0.00015622636,0.000107379274,0.00013873898,0.00014868904,0.00015083862,0.00006532959,0.000006365964],"category_scores_gemma":[0.00006450701,0.00009394194,0.000021648199,0.00016338087,0.000033069624,0.00057113724,0.000064184445,0.00007599902,0.000009830189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059654903,0.00005222745,0.013009324,0.00015239805,0.000014449564,0.000005097718,0.0038583155,0.0011212291,0.00029500126,0.96076024,0.0007525256,0.019973248],"study_design_scores_gemma":[0.0006211799,0.00019509695,0.019153496,0.00012277455,0.000006180252,0.000032707245,0.00035042746,0.9382216,0.00000447283,0.040266506,0.0007978361,0.00022774121],"about_ca_topic_score_codex":0.00001842732,"about_ca_topic_score_gemma":0.000019135396,"teacher_disagreement_score":0.93710035,"about_ca_system_score_codex":0.000026599877,"about_ca_system_score_gemma":0.0000073677556,"threshold_uncertainty_score":0.38308412},"labels":[],"label_agreement":null},{"id":"W2081354007","doi":"10.1007/s00012-007-2014-4","title":"A second note on the equational theory of modular ortholattices","year":2007,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Mathematics; Modular design; Algebra over a field; Equational logic; Pure mathematics; Programming language; Computer science; Rewriting","score_opus":0.0182580014882149,"score_gpt":0.2376726531132231,"score_spread":0.2194146516250082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081354007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.262509,0.00006344561,0.71899086,0.00057611184,0.00013085925,0.00010069083,0.000004699306,0.00005975848,0.01756457],"genre_scores_gemma":[0.99288124,0.0000042545703,0.005580534,0.00096652296,0.000038622533,9.1034894e-7,0.0000025673721,0.00000607285,0.00051928894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905056,0.00008562134,0.00015799556,0.00022777832,0.0002702333,0.00020784097],"domain_scores_gemma":[0.99830204,0.0009843594,0.00012537067,0.00046113462,0.000075186705,0.000051932493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006783126,0.000107699525,0.000106789055,0.00010598329,0.00012612801,0.00002558592,0.0007236231,0.000048863472,0.00024015864],"category_scores_gemma":[0.00008251618,0.00007511733,0.00007322865,0.0003679168,0.00012036338,0.00040417208,0.00012312995,0.00013084692,0.00003734428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001557235,0.000025916725,0.000055328463,0.0000030238546,0.000016728145,0.000015744485,0.00088156725,0.00011498886,0.0009402462,0.9892873,0.0000487267,0.00859484],"study_design_scores_gemma":[0.0004913821,0.00020821515,0.01097604,0.00002697893,0.000017957609,0.000010403787,0.0005450902,0.0042369873,0.020096207,0.9529701,0.010129691,0.0002909874],"about_ca_topic_score_codex":0.000004262079,"about_ca_topic_score_gemma":0.000017685174,"teacher_disagreement_score":0.73037225,"about_ca_system_score_codex":0.000028444658,"about_ca_system_score_gemma":0.00004383831,"threshold_uncertainty_score":0.30631956},"labels":[],"label_agreement":null},{"id":"W2081467762","doi":"10.7151/dmgt.1594","title":"Characterizing Cartesian fixers and multipliers","year":2012,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Cartesian coordinate system; Geometry","score_opus":0.011748426298101706,"score_gpt":0.23554724997994775,"score_spread":0.22379882368184603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081467762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23660308,0.00075553765,0.75463086,0.0011129079,0.0004996342,0.00035662224,0.000003501131,0.00044341726,0.005594448],"genre_scores_gemma":[0.97041714,0.000023810171,0.028957019,0.00029544608,0.000051314397,0.0000331246,0.0000019057311,0.000015374775,0.00020483758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880594,0.00011227699,0.00021481048,0.00025960064,0.00017326872,0.0004341238],"domain_scores_gemma":[0.99894863,0.00021393062,0.00010150122,0.0004845868,0.000015318936,0.00023602409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054282125,0.0001923064,0.00022102507,0.00012165124,0.0002450918,0.00006739378,0.0003756317,0.00005681074,0.000034035016],"category_scores_gemma":[0.0000835388,0.00011450287,0.00008422163,0.00023293334,0.00013783455,0.00083667354,0.00021508329,0.00011416515,0.00006030944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044857784,0.000080160826,0.0005479111,0.000043271128,0.00001478728,0.0000019384943,0.006961376,4.0527095e-7,0.0031509304,0.9713009,0.000020633252,0.01787323],"study_design_scores_gemma":[0.0003173297,0.000029707993,0.009825345,0.000104105224,0.00002135673,0.00005639096,0.0024031566,0.00051746634,0.0021587352,0.98359597,0.00055804086,0.00041239808],"about_ca_topic_score_codex":2.467499e-7,"about_ca_topic_score_gemma":1.1026042e-7,"teacher_disagreement_score":0.7338141,"about_ca_system_score_codex":0.000009589759,"about_ca_system_score_gemma":0.000007250042,"threshold_uncertainty_score":0.46692914},"labels":[],"label_agreement":null},{"id":"W2082113404","doi":"10.1016/j.ejc.2010.05.007","title":"Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Univerzita Karlova v Praze","keywords":"Mathematics; Combinatorics; Clique; Hypergraph; clone (Java method); Discrete mathematics; Homomorphism; Boolean function; Monotone polygon; Minor (academic)","score_opus":0.008817298394155414,"score_gpt":0.20506831778030915,"score_spread":0.19625101938615375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082113404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7041705,0.00013247653,0.28299624,0.00049680425,0.0011967879,0.000081124526,0.0000023963285,0.000031452382,0.010892207],"genre_scores_gemma":[0.98613554,0.000024808278,0.013043099,0.00009080532,0.00006972615,6.2021894e-7,3.2419632e-7,0.000015956246,0.0006191107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989262,0.00012102504,0.00034725957,0.00017233357,0.00026249915,0.00017067723],"domain_scores_gemma":[0.99873054,0.00007364381,0.00027781876,0.00036120374,0.00031556384,0.00024120664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050452526,0.0001306739,0.00020123574,0.00028664505,0.00014111254,0.000053745458,0.000503149,0.000020808573,0.0000069297707],"category_scores_gemma":[0.00005776482,0.000099302146,0.00006817083,0.00068756205,0.00009093978,0.00029449633,0.000114583,0.00042379307,0.00001555584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002435943,0.0007486098,0.010712359,0.000042995514,0.00019261317,0.0012528985,0.0011317423,0.0004641812,0.010824406,0.92140204,0.0058313184,0.04715323],"study_design_scores_gemma":[0.012754463,0.024619317,0.45339835,0.0006041212,0.00046371197,0.013403408,0.0018790063,0.0004108301,0.01017718,0.1711589,0.30850202,0.002628722],"about_ca_topic_score_codex":5.1515303e-7,"about_ca_topic_score_gemma":0.0000018504832,"teacher_disagreement_score":0.7502431,"about_ca_system_score_codex":0.00001190758,"about_ca_system_score_gemma":0.00004706806,"threshold_uncertainty_score":0.40494242},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013180767183878683,"score_gpt":0.3109328257629224,"score_spread":0.29775205857904374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082754577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04963563,0.0012373632,0.9384082,0.000045597608,0.00015350855,0.00014656998,1.8708228e-7,0.00006236122,0.010310563],"genre_scores_gemma":[0.6886599,0.00020136403,0.31088445,0.00009584149,0.000021774023,0.000009345342,7.2694394e-7,0.000006940394,0.0001196594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989484,0.00003714364,0.00033248504,0.00023740302,0.00018625583,0.00025833372],"domain_scores_gemma":[0.998978,0.0004603096,0.000099061246,0.0004090322,0.000021162938,0.000032442636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794072,0.00009830337,0.00015147687,0.00015591831,0.00002596001,0.000020093477,0.00044202272,0.000040594805,0.000007797128],"category_scores_gemma":[0.00022338663,0.000087933884,0.000032330074,0.0005780982,0.00003999444,0.00090210716,0.000098703465,0.000121334495,0.00002424341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040825594,0.0001000283,0.0016797654,0.000030013114,0.0000014319769,0.00006115506,0.0018433747,0.0035662286,0.00018940635,0.89701885,0.000001613063,0.09550404],"study_design_scores_gemma":[0.00021212327,0.000017057344,0.0036447092,0.00004920441,8.8529424e-7,0.00000962364,0.00036571943,0.0133640235,0.0012330207,0.9806891,0.00029773943,0.00011675887],"about_ca_topic_score_codex":0.0000011117868,"about_ca_topic_score_gemma":0.000030891693,"teacher_disagreement_score":0.63902426,"about_ca_system_score_codex":0.000047343874,"about_ca_system_score_gemma":0.000009331187,"threshold_uncertainty_score":0.358584},"labels":[],"label_agreement":null},{"id":"W2083594227","doi":"10.1007/s00500-004-0371-x","title":"Boolean dominated MV-algebras","year":2004,"lang":"en","type":"article","venue":"Soft Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Generalization; Stone's representation theorem for Boolean algebras; Class (philosophy); Boolean algebras canonically defined; Mathematics; Interior algebra; Point (geometry); Boolean algebra; Free Boolean algebra; Two-element Boolean algebra; Complete Boolean algebra; Pure mathematics; Discrete mathematics; Algebra over a field; Non-associative algebra; Computer science; Algebra representation; Artificial intelligence; Mathematical analysis","score_opus":0.010082024019605283,"score_gpt":0.2399865058920348,"score_spread":0.2299044818724295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083594227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13428155,0.00014861107,0.8616745,0.00056529656,0.00042401938,0.00009069061,2.4787707e-7,0.00064201007,0.002173076],"genre_scores_gemma":[0.878727,0.0000016348475,0.120257355,0.0008034405,0.000135584,0.0000011744663,0.0000014776166,0.0000111760655,0.000061126855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986313,0.000033059492,0.00023915088,0.0004399656,0.00020770814,0.00044884495],"domain_scores_gemma":[0.9991923,0.00009934173,0.00010398545,0.00043260847,0.00005928517,0.00011246061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020840208,0.00016860035,0.00017625985,0.00008444336,0.00028162313,0.00012482148,0.00081049383,0.000058057172,0.0000074913773],"category_scores_gemma":[0.00007593824,0.00015717969,0.00007588802,0.00047995817,0.00005231828,0.00032472005,0.00039926003,0.00020570659,0.00021609513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053726108,0.00010860338,0.00075493456,0.000021709797,0.000022486352,0.00015829125,0.0018770121,0.023849731,0.0022102925,0.72946113,0.00015467854,0.24137579],"study_design_scores_gemma":[0.0036178178,0.00029671716,0.011720872,0.00024075957,0.000016936745,0.00039342785,0.0002336613,0.10875516,0.012578628,0.85532004,0.005312231,0.0015137721],"about_ca_topic_score_codex":0.000012056051,"about_ca_topic_score_gemma":0.0000026159962,"teacher_disagreement_score":0.7444455,"about_ca_system_score_codex":0.00006855928,"about_ca_system_score_gemma":0.000064073916,"threshold_uncertainty_score":0.64096016},"labels":[],"label_agreement":null},{"id":"W2084042630","doi":"10.1007/s000120300001","title":"Finite distributive lattices and the splitting property","year":2003,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Distributive lattice; Distributive property; Antichain; Congruence lattice problem; Mathematics; Lattice (music); Property (philosophy); Integer lattice; Combinatorics; Pure mathematics; Discrete mathematics; Partially ordered set; Condensed matter physics; Physics","score_opus":0.010702636761632491,"score_gpt":0.20638452489878656,"score_spread":0.19568188813715406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084042630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052515745,0.0014260345,0.86600333,0.0072982744,0.00044876258,0.0007042953,0.000016522654,0.00045739245,0.07112961],"genre_scores_gemma":[0.9923401,0.00007306951,0.005991713,0.00059836503,0.00002106057,0.0000043237924,0.0000027371466,0.0000059693293,0.0009626893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990432,0.00017586799,0.00011386289,0.00029308748,0.00013146045,0.0002424925],"domain_scores_gemma":[0.998992,0.00047029537,0.000078638885,0.00033703732,0.00005462364,0.000067389534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028940276,0.00012275767,0.00013750588,0.00003211606,0.00029487562,0.000120269746,0.00042397052,0.000037374994,0.000020872061],"category_scores_gemma":[0.00022472258,0.00006342443,0.000039951447,0.00030615536,0.0002511114,0.00058122614,0.0001616218,0.00012978836,0.000021095717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076793085,0.000010065749,0.00030157613,0.000003635614,0.000016480852,0.000015079814,0.00094738544,0.000022623582,0.000013019811,0.9924352,0.00011659818,0.0061106426],"study_design_scores_gemma":[0.0071118115,0.0002497996,0.0032222716,0.000078578,0.00011545233,0.00012228162,0.0038240082,0.039262224,0.0029677704,0.59347856,0.34835884,0.0012084051],"about_ca_topic_score_codex":0.00003951201,"about_ca_topic_score_gemma":0.000008162913,"teacher_disagreement_score":0.93982434,"about_ca_system_score_codex":0.000021870334,"about_ca_system_score_gemma":0.00003517449,"threshold_uncertainty_score":0.2586373},"labels":[],"label_agreement":null},{"id":"W2084584786","doi":"10.1142/s0129054106004200","title":"COVERING OF TRANSIENT SIMULATION OF FEEDBACK-FREE CIRCUITS BY BINARY ANALYSIS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Transient (computer programming); Converse; Electronic circuit; Mathematics; Function (biology); Logic gate; Topology (electrical circuits); Computer science; Algorithm; Discrete mathematics; Arithmetic; Combinatorics; Physics; Quantum mechanics","score_opus":0.011948986209768113,"score_gpt":0.27855024646066934,"score_spread":0.26660126025090125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084584786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28866258,0.00005666777,0.7104401,0.00021867781,0.00042413746,0.000035709912,0.000009200222,0.000005891362,0.00014706238],"genre_scores_gemma":[0.9336311,0.000009069903,0.06626082,0.000024461764,0.000059189657,4.1317023e-7,0.0000033461054,0.000002537891,0.000009010229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975415,0.000034271467,0.0008835244,0.00019455256,0.0012150261,0.00013116076],"domain_scores_gemma":[0.9963571,0.00022174127,0.0011030379,0.00034412532,0.0019228393,0.000051173894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005432254,0.00009647762,0.0002714082,0.0010191274,0.000063057974,0.000076292854,0.002510062,0.000025821424,0.000011527454],"category_scores_gemma":[0.000073330724,0.00008924071,0.00020330086,0.001658673,0.0003202392,0.0016456471,0.00021312886,0.00007884063,6.298052e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009143123,0.00023002882,0.0017276063,0.0000068235418,0.000113181595,0.0000033809033,0.0002237927,0.94202226,0.023723362,0.015282875,0.00005673229,0.016600814],"study_design_scores_gemma":[0.0008311442,0.00030830113,0.07666167,0.000083212464,0.000068477115,0.000026702714,0.000014554231,0.88576233,0.02120825,0.014623931,0.00025548236,0.00015591258],"about_ca_topic_score_codex":0.000025767544,"about_ca_topic_score_gemma":0.000004151193,"teacher_disagreement_score":0.64496857,"about_ca_system_score_codex":0.00007917539,"about_ca_system_score_gemma":0.00021492688,"threshold_uncertainty_score":0.46643612},"labels":[],"label_agreement":null},{"id":"W2085135455","doi":"10.1142/s0218196701000644","title":"SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR","year":2001,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Congruence (geometry); Distributive property; Construct (python library); Variety (cybernetics); Finitely-generated abelian group; Simple (philosophy); Algebra over a field; Set (abstract data type); Pure mathematics; Computer science; Programming language","score_opus":0.012756864837683778,"score_gpt":0.2764957847873936,"score_spread":0.2637389199497098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085135455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.392477,0.0001400709,0.6052758,0.0017547777,0.00014805129,0.000037828675,4.2921783e-7,0.000007555223,0.00015849793],"genre_scores_gemma":[0.9220301,0.00008017308,0.07752436,0.0002618245,0.000083847015,8.146788e-7,8.428595e-7,0.0000027040621,0.0000153201],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992013,0.000025986856,0.0003034834,0.00011017508,0.0002801117,0.000078941266],"domain_scores_gemma":[0.9992032,0.00006158255,0.0002463737,0.000041817493,0.00037690994,0.00007011781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016969704,0.000067070636,0.000116475276,0.00020875252,0.000030860894,0.00006443336,0.00022738524,0.000024855803,0.0000025248166],"category_scores_gemma":[0.000021951366,0.000057666646,0.00003068289,0.00013484346,0.000026277035,0.00049597025,0.00009286972,0.00006420061,0.0000015882472],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013940853,0.00013175384,0.0060497345,0.0000142424415,0.00010073724,0.00006874347,0.0019658408,0.0044937236,0.0050557703,0.12658489,0.0002723633,0.8551228],"study_design_scores_gemma":[0.0033514847,0.0019802896,0.17536274,0.00038259686,0.000036559733,0.0036894847,0.0002717055,0.08729274,0.003111475,0.71956223,0.0044787787,0.0004798996],"about_ca_topic_score_codex":0.0000053270705,"about_ca_topic_score_gemma":0.0000016954548,"teacher_disagreement_score":0.85464287,"about_ca_system_score_codex":0.000022181595,"about_ca_system_score_gemma":0.000031087777,"threshold_uncertainty_score":0.23515776},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015551497934698951,"score_gpt":0.24217880117058835,"score_spread":0.2266273032358894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086699431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09746667,0.00093698304,0.89554155,0.0019469676,0.00045561045,0.0002965748,0.000048404214,0.00047313422,0.0028340847],"genre_scores_gemma":[0.9754775,0.00009097418,0.018768823,0.001155662,0.00006660079,0.00001856598,0.000090513655,0.000018744055,0.0043125753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987722,0.000093123206,0.00018506905,0.0003633741,0.00018017394,0.0004060327],"domain_scores_gemma":[0.99877614,0.00051254,0.00010710029,0.00035470087,0.0001618494,0.000087654975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011713026,0.00020903404,0.00021540998,0.00010956697,0.00034488743,0.00015101973,0.00068878994,0.0000693779,0.00002542271],"category_scores_gemma":[0.00008410557,0.00019897988,0.000092564056,0.000440462,0.00012855184,0.0010313051,0.00017971161,0.00015597332,0.000015745272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057362264,0.00006190213,0.0001513174,0.000015932173,0.00009829016,0.000052172654,0.009007632,0.00043784664,0.0016311782,0.97499925,0.0083108125,0.0051762993],"study_design_scores_gemma":[0.0057314285,0.0009581859,0.0005392146,0.00009653901,0.00009319825,0.00010914492,0.010551665,0.18548651,0.024299733,0.44006115,0.32965007,0.0024231544],"about_ca_topic_score_codex":0.00011147826,"about_ca_topic_score_gemma":0.000035519988,"teacher_disagreement_score":0.87801087,"about_ca_system_score_codex":0.00007157893,"about_ca_system_score_gemma":0.000050070183,"threshold_uncertainty_score":0.8114164},"labels":[],"label_agreement":null},{"id":"W2087543767","doi":"10.1016/j.jpaa.2006.10.001","title":"Dualisability versus residual character: A theorem and a counterexample","year":2006,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Counterexample; Mathematics; Variety (cybernetics); Congruence (geometry); Residual; Character (mathematics); Algebra over a field; Pure mathematics; Discrete mathematics; Algorithm; Geometry","score_opus":0.014449752393452855,"score_gpt":0.23680003737421965,"score_spread":0.22235028498076678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087543767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802841,0.0005726098,0.016189478,0.0009316701,0.0002059065,0.00009669747,0.0000035224978,0.000029050652,0.001686971],"genre_scores_gemma":[0.99377596,0.00004638837,0.0055038906,0.0002302945,0.00040723494,0.000002284365,0.0000012710908,0.0000065760037,0.000026070675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894863,0.00003538564,0.00034307802,0.00022181313,0.00024025766,0.00021083097],"domain_scores_gemma":[0.99919665,0.000197176,0.0002546595,0.00019309412,0.000060310802,0.00009812711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004059173,0.00014577275,0.00026269612,0.000066243985,0.00011389472,0.00015427459,0.00027132506,0.000064674256,0.000011998839],"category_scores_gemma":[0.000021060408,0.000106676736,0.000045384626,0.00012829695,0.000113317205,0.00037592996,0.00012402669,0.00021696428,0.000002879091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019956738,0.0000948407,0.00052936625,0.000021043332,0.000029917619,0.000031906948,0.00046150008,0.0000076085444,0.004148004,0.97501194,0.0008026585,0.018661631],"study_design_scores_gemma":[0.004800022,0.0007251454,0.04988936,0.000044073975,0.00006372386,0.0005219181,0.00044673117,0.00017013749,0.004645181,0.9252624,0.012899773,0.00053155696],"about_ca_topic_score_codex":0.000003448433,"about_ca_topic_score_gemma":0.000009406327,"teacher_disagreement_score":0.04974958,"about_ca_system_score_codex":0.000019029894,"about_ca_system_score_gemma":0.000035601257,"threshold_uncertainty_score":0.43501508},"labels":[],"label_agreement":null},{"id":"W2087612636","doi":"10.1007/s00012-005-1889-1","title":"A new lattice construction","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Lattice (music); Complete lattice; Pure mathematics; Algebra over a field; Discrete mathematics; Condensed matter physics; Physics","score_opus":0.008217953652752361,"score_gpt":0.2120423531623936,"score_spread":0.20382439950964124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087612636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142394025,0.00013914354,0.9588911,0.004380497,0.00029124843,0.0000784222,0.0000010130527,0.00043221095,0.021546947],"genre_scores_gemma":[0.36262372,0.00003143113,0.63255304,0.0013702122,0.00031543628,0.0000010417094,0.0000031809052,0.000010620874,0.0030913402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992052,0.000027457716,0.00010930456,0.00028144973,0.00015033923,0.0002262821],"domain_scores_gemma":[0.999341,0.000049698432,0.000058075188,0.000371358,0.000038115162,0.00014175025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048278664,0.00010951109,0.00010076316,0.00009216825,0.00009940285,0.000063528365,0.0005169619,0.000052618263,0.00019233067],"category_scores_gemma":[0.00001536595,0.00010869607,0.00005164871,0.00038920285,0.000040288378,0.001238919,0.000121691235,0.00010128388,0.0003222833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024080603,0.000008003367,0.00007054746,9.980529e-7,0.000008470335,0.000009679084,0.00028655777,0.000060039754,0.00011652367,0.7851167,0.0021960598,0.21212405],"study_design_scores_gemma":[0.0019766302,0.00017204293,0.0016641242,0.00002611402,0.00003996327,0.0003628517,0.00040380188,0.011293946,0.007854307,0.22041269,0.754952,0.00084153475],"about_ca_topic_score_codex":0.00004255418,"about_ca_topic_score_gemma":0.000023879511,"teacher_disagreement_score":0.75275594,"about_ca_system_score_codex":0.000061006864,"about_ca_system_score_gemma":0.00007926277,"threshold_uncertainty_score":0.4432497},"labels":[],"label_agreement":null},{"id":"W2089209847","doi":"10.1007/978-3-642-02737-6_10","title":"Closures in Formal Languages and Kuratowski’s Theorem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Closure (psychology); Axiom; Mathematics; Complement (music); Regular language; Discrete mathematics; Separation axiom; Formal language; Partition (number theory); Abstract family of languages; Concatenation (mathematics); Topological space; Computer science; Combinatorics; Algorithm; Theoretical computer science; Programming language; Second-generation programming language","score_opus":0.009009903572359495,"score_gpt":0.25068908042776605,"score_spread":0.24167917685540655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089209847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087542896,0.0017819932,0.98671114,0.0005926968,0.00035971584,0.00025685402,0.0000019195877,0.000120937715,0.009299337],"genre_scores_gemma":[0.7395798,0.00018403529,0.25654328,0.0029306808,0.0003373192,0.0000061600877,0.0000030061913,0.000024418116,0.00039130147],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726707,0.000032514537,0.0003747642,0.0011181546,0.0005250172,0.0006824712],"domain_scores_gemma":[0.99855256,0.00032115306,0.00015751277,0.00077778933,0.000065888664,0.00012508433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006378972,0.00042929404,0.00044370754,0.0006516161,0.00015432858,0.00032873888,0.0018549063,0.0002505098,0.000011101231],"category_scores_gemma":[0.0000638288,0.00035119918,0.000066069486,0.00042814415,0.0005207909,0.0009245869,0.00087213743,0.0006935212,0.000010927128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000384785,0.000011468964,0.00007378218,0.000011247647,0.0000019195434,0.00015671006,0.0005447878,0.0027890785,0.000055915836,0.17952046,0.0000031006655,0.81682765],"study_design_scores_gemma":[0.00041327937,0.00030865826,0.0017638957,0.00029359412,0.0000035917112,0.00017426812,7.4403374e-7,0.06892578,0.00077700237,0.9253886,0.0011957868,0.0007547919],"about_ca_topic_score_codex":0.000009508599,"about_ca_topic_score_gemma":0.00010910155,"teacher_disagreement_score":0.8160729,"about_ca_system_score_codex":0.00010750369,"about_ca_system_score_gemma":0.00017133506,"threshold_uncertainty_score":0.999894},"labels":[],"label_agreement":null},{"id":"W2091251104","doi":"10.1093/qmath/hau018","title":"AMENABILITY AND MODULES FOR ARENS PRODUCT ALGEBRAS","year":2014,"lang":"en","type":"article","venue":"The Quarterly Journal of Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Compactification (mathematics); Banach algebra; Mathematics; Locally compact group; Locally compact space; Algebra over a field; Pure mathematics; Semigroup; Dual (grammatical number); Product (mathematics); Discrete mathematics; Banach space","score_opus":0.015589244225305056,"score_gpt":0.24764623863464555,"score_spread":0.2320569944093405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091251104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26139387,0.00019570543,0.7366766,0.001430342,0.00011791273,0.00012496421,4.9971993e-7,0.000014640478,0.000045470617],"genre_scores_gemma":[0.78540266,0.0000074817162,0.21432643,0.000089132496,0.00014156663,0.000003470657,7.192382e-8,0.000005699356,0.000023501047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991194,0.00006534703,0.0003628672,0.00011636476,0.0001796364,0.00015641045],"domain_scores_gemma":[0.9985357,0.000481467,0.00036023906,0.00041140438,0.00015203177,0.00005917151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012317005,0.00010117647,0.00022539681,0.00003726511,0.000107858534,0.000087665176,0.00056759425,0.000019525562,0.0000016137092],"category_scores_gemma":[0.00017300696,0.00005537455,0.000092780996,0.00007127203,0.00008162185,0.00026789185,0.00002633146,0.00010914286,0.000002680876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013152414,0.00025394387,0.00006530081,0.00020849054,0.00006830661,0.000002169197,0.014741289,0.000099087505,0.0010137336,0.6631118,0.00052428053,0.31989843],"study_design_scores_gemma":[0.0002773367,0.0007480132,0.00032115512,0.000035069046,0.00002274725,0.0001739851,0.00044148942,0.015455357,0.00045151834,0.98140085,0.0005825508,0.00008995192],"about_ca_topic_score_codex":2.82629e-7,"about_ca_topic_score_gemma":0.0000010110689,"teacher_disagreement_score":0.52400875,"about_ca_system_score_codex":0.000011121603,"about_ca_system_score_gemma":0.000016671853,"threshold_uncertainty_score":0.22581086},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Congruence (geometry); Prime (order theory); Combinatorics; Lattice (music); Interval (graph theory); Geometry; Physics","score_opus":0.008923169779203205,"score_gpt":0.2280015782004117,"score_spread":0.2190784084212085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091429712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17001316,0.00039161902,0.8029694,0.0130037535,0.0014230858,0.000718189,0.000014683757,0.0004349133,0.011031169],"genre_scores_gemma":[0.8905541,0.000028781214,0.08263516,0.0030251648,0.00052863866,0.000019653864,0.000017400134,0.000043801305,0.023147307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987409,0.00004381344,0.00014567019,0.00045793966,0.00021375665,0.0003979055],"domain_scores_gemma":[0.9983319,0.00038811928,0.000107932625,0.0009367702,0.00007812397,0.00015714654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002100145,0.00019496729,0.00016129928,0.00006435625,0.00038705298,0.00012911437,0.0014233621,0.00009793995,0.00027555277],"category_scores_gemma":[0.00006707998,0.0001334745,0.00014230446,0.00031255683,0.00014092059,0.00067194307,0.00039729345,0.00021762276,0.00010756563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012390235,0.00001575958,0.00010931283,0.0000049930227,0.00003159096,0.00001101487,0.0009835738,0.000029820647,0.0036460573,0.9656039,0.011143029,0.018408597],"study_design_scores_gemma":[0.0011691987,0.00013657162,0.0004839136,0.000012873804,0.000053199903,0.000048210037,0.00024852398,0.0051984745,0.014706056,0.4738582,0.5035822,0.00050261396],"about_ca_topic_score_codex":0.000060483468,"about_ca_topic_score_gemma":0.00029998142,"teacher_disagreement_score":0.72054094,"about_ca_system_score_codex":0.000034712488,"about_ca_system_score_gemma":0.00010032881,"threshold_uncertainty_score":0.5442932},"labels":[],"label_agreement":null},{"id":"W2092127079","doi":"10.1007/s000120200009","title":"Self-dual lattice identities","year":2002,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Modulo; Mathematics; Lattice (music); Dual (grammatical number); Variety (cybernetics); Complete lattice; Algebra over a field; Pure mathematics; Discrete mathematics; Condensed matter physics; Physics","score_opus":0.014288230850367822,"score_gpt":0.2030178909232284,"score_spread":0.18872966007286057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092127079","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19087647,0.0028623762,0.3830351,0.006686081,0.0025553084,0.0005797881,0.00001787594,0.0054885414,0.40789846],"genre_scores_gemma":[0.9342729,0.00032366448,0.05377035,0.0014031236,0.00017331367,0.000004116323,0.00000372681,0.000020809288,0.010028041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889314,0.00005346428,0.00013488486,0.00034169827,0.00024724365,0.00032955178],"domain_scores_gemma":[0.99917394,0.00009444307,0.00006474848,0.00049714244,0.000057970858,0.000111759575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068806345,0.00014920144,0.00013700809,0.00012464143,0.00018081968,0.00013300039,0.0007000027,0.000060536942,0.00034840504],"category_scores_gemma":[0.00001937885,0.00014843207,0.00007421409,0.0004609973,0.00005853874,0.0015219611,0.00024684172,0.0001262719,0.0007192666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010323466,0.00006426022,0.00013531491,0.000009873096,0.00003373856,0.00019760967,0.002117402,0.00001238416,0.000035093253,0.98595977,0.0071324543,0.0043010446],"study_design_scores_gemma":[0.003073859,0.00057110697,0.0024369524,0.000053181604,0.00014262086,0.0005244081,0.0017908904,0.084005065,0.0032424382,0.32603198,0.5758312,0.002296313],"about_ca_topic_score_codex":0.000015041157,"about_ca_topic_score_gemma":0.000006630566,"teacher_disagreement_score":0.7433964,"about_ca_system_score_codex":0.00005421335,"about_ca_system_score_gemma":0.000013652096,"threshold_uncertainty_score":0.9244957},"labels":[],"label_agreement":null},{"id":"W2092230580","doi":"10.1016/j.topol.2009.03.037","title":"Tame parts of free summands in coproducts of Priestley spaces","year":2009,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Compactification (mathematics); Coproduct; Mathematics; Disjoint sets; Linear subspace; Disjoint union (topology); Order (exchange); Pure mathematics; Combinatorics; Discrete mathematics","score_opus":0.013754876332986271,"score_gpt":0.2643251334222356,"score_spread":0.25057025708924935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092230580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8413397,0.005087379,0.12918946,0.016851058,0.00007675359,0.00062356866,0.00001197485,0.00007776178,0.0067423573],"genre_scores_gemma":[0.9955534,0.00014043736,0.0040396247,0.00011914048,0.000014157696,0.00001618141,0.0000014531364,0.0000010125272,0.00011462858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956393,0.000014749626,0.0001341977,0.00015750765,0.000037832822,0.000091771115],"domain_scores_gemma":[0.9995292,0.00004787726,0.000070678856,0.000293815,0.000036823745,0.000021630478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059725473,0.000046456214,0.00011661155,0.000051503535,0.00003366522,0.0000031130885,0.00025441597,0.000039687635,0.000006513163],"category_scores_gemma":[0.000029358984,0.000041195344,0.000009785286,0.00021358239,0.00009861514,0.00009489734,0.00005345682,0.000048284655,0.0000019926022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022236045,0.000057880323,0.0006146256,0.000006549322,0.0000015907444,3.3295717e-7,0.00025773008,0.000020197203,0.0026131356,0.98902124,0.00009853596,0.007305943],"study_design_scores_gemma":[0.00049885863,0.00027930757,0.089743696,0.000013762568,0.000007198428,0.000013523569,0.000087092354,0.0004765532,0.040830176,0.8580181,0.009873882,0.00015786345],"about_ca_topic_score_codex":0.0000062771173,"about_ca_topic_score_gemma":0.000016119784,"teacher_disagreement_score":0.15421368,"about_ca_system_score_codex":0.0000027193855,"about_ca_system_score_gemma":0.000017417091,"threshold_uncertainty_score":0.16798975},"labels":[],"label_agreement":null},{"id":"W2092737163","doi":"10.1007/s00012-011-0139-y","title":"Lattice tolerances and congruences","year":2011,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Mathematics; Homomorphic encryption; Congruence lattice problem; Lattice (music); Congruence (geometry); Pure mathematics; Algebra over a field; Distributive lattice; Computer science; Geometry","score_opus":0.02258375668873851,"score_gpt":0.20459165869486418,"score_spread":0.18200790200612565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092737163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6701682,0.0015381481,0.18971553,0.0011764757,0.00076861214,0.00024336624,0.0000047464523,0.00070169923,0.1356832],"genre_scores_gemma":[0.9676059,0.00010793889,0.031346846,0.00053652655,0.000024046629,0.0000016923019,6.5971903e-7,0.000004596871,0.00037180132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992587,0.000034639008,0.000094553354,0.00029630784,0.000109647015,0.00020617004],"domain_scores_gemma":[0.9994847,0.00006233983,0.000053078504,0.0002630774,0.000040837473,0.00009593848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007083885,0.00010782718,0.00011535368,0.00006409581,0.000118176125,0.000047210015,0.0005109457,0.000040026538,0.00007620227],"category_scores_gemma":[0.000014320083,0.000094087896,0.000026692538,0.00023837209,0.00013950525,0.0010735425,0.00014894435,0.000071528906,0.00003627866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004842763,0.000018146118,0.0019555914,0.0000046359164,0.000013801769,0.000054535896,0.0025597145,0.0000010603991,0.000070570706,0.97825253,0.00015483513,0.016909765],"study_design_scores_gemma":[0.0020196617,0.0007557401,0.0798932,0.00008275834,0.000072153474,0.00019809042,0.0034833683,0.005341427,0.011940429,0.83322877,0.06134859,0.0016358232],"about_ca_topic_score_codex":0.0001424257,"about_ca_topic_score_gemma":0.00003613744,"teacher_disagreement_score":0.29743767,"about_ca_system_score_codex":0.000009674992,"about_ca_system_score_gemma":0.000023373228,"threshold_uncertainty_score":0.38367933},"labels":[],"label_agreement":null},{"id":"W2092797839","doi":"10.1007/s00233-012-9398-y","title":"Regular principal factors in free objects in Rees-Sushkevich varieties","year":2012,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Bipartite graph; Semigroup; Variety (cybernetics); Simple (philosophy); Word problem (mathematics education); Krohn–Rhodes theory; Word (group theory); Graph; Pure mathematics; Free product; Special classes of semigroups; Algebra over a field; Discrete mathematics; Combinatorics; Group (periodic table); Arithmetic; Geometry","score_opus":0.012754222410483594,"score_gpt":0.23314966391166017,"score_spread":0.22039544150117657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092797839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93012905,0.0035745234,0.054624416,0.0014728762,0.0015885604,0.00041547918,0.0000043237565,0.00028636196,0.007904407],"genre_scores_gemma":[0.9922795,0.000026385955,0.0065710894,0.00029999134,0.00007273427,0.000020594318,0.0000041141448,0.000013745661,0.0007117907],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980977,0.00008132357,0.00028260017,0.00034375585,0.00027447552,0.0009201291],"domain_scores_gemma":[0.99888426,0.00010402387,0.000075840995,0.00078683026,0.000019402896,0.00012962948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040342548,0.0002010834,0.00023715048,0.00019399563,0.000064108586,0.000046794386,0.0009266104,0.00013977272,0.000016432932],"category_scores_gemma":[0.0001359093,0.00017826192,0.00006254708,0.00064784527,0.000054021646,0.0012819363,0.0005856964,0.00029917204,0.000027503174],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011954478,0.00022674953,0.5410997,0.000033363223,0.000008888169,0.00003827331,0.006584433,0.00022824077,0.0005344758,0.44597113,0.0011840444,0.004078738],"study_design_scores_gemma":[0.0021119642,0.00033082714,0.5822346,0.00017284043,0.0000081680255,0.000055143504,0.0031911358,0.0041408343,0.0097759655,0.35677505,0.03980855,0.0013949268],"about_ca_topic_score_codex":0.00013846747,"about_ca_topic_score_gemma":0.0007894638,"teacher_disagreement_score":0.08919608,"about_ca_system_score_codex":0.000121691315,"about_ca_system_score_gemma":0.000037622798,"threshold_uncertainty_score":0.72693104},"labels":[],"label_agreement":null},{"id":"W2092900072","doi":"10.1007/s00012-009-0004-4","title":"All clones are centralizer clones","year":2009,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Unary operation; clone (Java method); Centralizer and normalizer; Mathematics; Universal algebra; Algebra over a field; Combinatorics; Pure mathematics; Discrete mathematics; Genetics; Biology","score_opus":0.013801680951142392,"score_gpt":0.23161569412462982,"score_spread":0.21781401317348742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092900072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40216947,0.0020581773,0.49795556,0.05661133,0.0023077074,0.0008083685,0.00002991812,0.0034097563,0.034649704],"genre_scores_gemma":[0.98147094,0.00017116507,0.011938937,0.005418112,0.00012203174,0.0000014944233,0.000010695901,0.000011404709,0.0008551999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849087,0.000062487095,0.00018177029,0.00049070636,0.00026172757,0.0005124536],"domain_scores_gemma":[0.9989099,0.00005606863,0.0001244207,0.0006441293,0.0000733388,0.00019214425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075845805,0.00022553069,0.0002273752,0.0001265482,0.00014488236,0.000107858505,0.0010175867,0.00009573227,0.00007488461],"category_scores_gemma":[0.000023717314,0.00020765277,0.00012046485,0.00046581237,0.000059487607,0.0010625853,0.0001285975,0.00014898764,0.00015300451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000141352575,0.000108414424,0.00089738064,0.0000051386723,0.000030003148,0.00029040038,0.0007819548,0.00009287323,0.00070850644,0.9724989,0.008392364,0.016179936],"study_design_scores_gemma":[0.0026386287,0.0005311331,0.08633343,0.0000912156,0.00008253396,0.00016435479,0.00080530334,0.0032981664,0.008991323,0.43320096,0.4619285,0.0019344806],"about_ca_topic_score_codex":0.00003539153,"about_ca_topic_score_gemma":0.0000143226835,"teacher_disagreement_score":0.5793015,"about_ca_system_score_codex":0.000057994363,"about_ca_system_score_gemma":0.000031871128,"threshold_uncertainty_score":0.84678346},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02833773675154287,"score_gpt":0.2662817561944066,"score_spread":0.23794401944286372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093448135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1365429,0.000099586374,0.8492246,0.0011200733,0.000079965845,0.00013210451,0.0000020859056,0.00016261211,0.012636029],"genre_scores_gemma":[0.8856231,0.000042945834,0.1135916,0.00034314595,0.000018015615,0.000008316136,0.0000017070653,0.000007703454,0.00036346485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993471,0.000015773463,0.00014676891,0.00019594863,0.00012307815,0.0001713205],"domain_scores_gemma":[0.9994277,0.0001127708,0.000055857457,0.0003182932,0.000016988253,0.0000684304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000826278,0.00010621468,0.00013131357,0.000035804784,0.000076821714,0.00008423157,0.00025593946,0.00003053235,0.000042884298],"category_scores_gemma":[0.00005427833,0.00007798274,0.000037610178,0.00010862519,0.000095692914,0.00011804026,0.00007540843,0.0000577413,0.00006497286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016383731,0.000029990599,0.00003817731,0.000012072353,0.000008057644,0.000017040713,0.00051817874,0.000023477425,0.00044471378,0.9899907,0.00014918686,0.008766741],"study_design_scores_gemma":[0.0003330145,0.00006551841,0.00019757176,0.00003431228,0.000007157513,0.000085553074,0.000102147285,0.044106487,0.0011385307,0.9527902,0.0009189729,0.00022055008],"about_ca_topic_score_codex":5.487221e-7,"about_ca_topic_score_gemma":3.9512645e-7,"teacher_disagreement_score":0.7490802,"about_ca_system_score_codex":0.000007306614,"about_ca_system_score_gemma":0.000006493547,"threshold_uncertainty_score":0.3180044},"labels":[],"label_agreement":null},{"id":"W2094989795","doi":"10.1007/bf02904233","title":"A non-commutative version of the first alexandroff decomposition theorem in ordered topological groups","year":2000,"lang":"en","type":"article","venue":"Rendiconti del Circolo Matematico di Palermo Series 2","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Decomposition theorem; Commutative property; Decomposition; Uniqueness; Metric (unit); Pure mathematics; Picard–Lindelöf theorem; Topology (electrical circuits); Discrete mathematics; Combinatorics; Fixed-point theorem; Mathematical analysis","score_opus":0.006793697749464107,"score_gpt":0.23257824086548334,"score_spread":0.22578454311601923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094989795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9801142,0.00017716746,0.011945645,0.0009589365,0.00020377629,0.0006887305,0.000010279387,0.00010074213,0.005800517],"genre_scores_gemma":[0.9972595,0.00008306235,0.0021961206,0.00022288984,0.00001688861,0.0000519904,0.000007809037,0.000012004891,0.00014972966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980968,0.00020610428,0.0006048048,0.00038896827,0.00031618297,0.00038710778],"domain_scores_gemma":[0.998697,0.00021492725,0.0002727627,0.00069095095,0.00005826555,0.00006610978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000296125,0.00025469027,0.0005046358,0.000100897356,0.00025710784,0.000070725044,0.0010730223,0.00014138763,0.00033459387],"category_scores_gemma":[0.000042327487,0.0001751686,0.00014650212,0.0006265641,0.0002999335,0.0006592167,0.0002423476,0.00021874206,0.000056646793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015384669,0.003486059,0.08029422,0.002945146,0.00044104076,0.0005677774,0.047918923,0.009747148,0.010533296,0.7970886,0.0013391672,0.044100143],"study_design_scores_gemma":[0.003915751,0.0010591812,0.74172294,0.0013358908,0.000068527544,0.00031982243,0.0015686221,0.028349023,0.011698083,0.20838296,0.0005245678,0.0010546439],"about_ca_topic_score_codex":0.000021939402,"about_ca_topic_score_gemma":0.00008265231,"teacher_disagreement_score":0.6614287,"about_ca_system_score_codex":0.000078785524,"about_ca_system_score_gemma":0.000036657722,"threshold_uncertainty_score":0.71431684},"labels":[],"label_agreement":null},{"id":"W2095053904","doi":"10.1007/s00012-011-0122-7","title":"Relative universality and universality obtained by adding constants","year":2011,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Subvariety; Mathematics; Universality (dynamical systems); Algebraically closed field; Homomorphism; Conjecture; Factorization; Physical constant; Variety (cybernetics); Pure mathematics; Universal algebra; Combinatorics; Algebra over a field; Physics; Algorithm","score_opus":0.019585687591557596,"score_gpt":0.20904298838410376,"score_spread":0.18945730079254616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095053904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17126401,0.0005334672,0.6627473,0.0007807045,0.0004339867,0.00054285425,0.00012536791,0.0011517334,0.16242054],"genre_scores_gemma":[0.97897726,0.00011896701,0.019590057,0.0003154042,0.000015517804,0.0000014997803,0.00001563359,0.000017117125,0.00094854314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980232,0.00024276863,0.00023530955,0.0007479721,0.0002534534,0.0004973035],"domain_scores_gemma":[0.9985132,0.00022388589,0.00019579472,0.00062756357,0.00013457287,0.00030497223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026566559,0.00030198257,0.000311124,0.0001647436,0.00033109754,0.00005858382,0.0008261023,0.00015271216,0.00014364308],"category_scores_gemma":[0.00006555158,0.00030919322,0.000084881896,0.0007018269,0.00044798167,0.0025789188,0.0004774008,0.00026920091,0.000031194784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037543934,0.000062957915,0.0019113753,0.000007929654,0.00007964746,0.00012812056,0.0038327752,0.0000010407235,0.00036663012,0.98835987,0.000989468,0.0042226473],"study_design_scores_gemma":[0.01288414,0.0017631578,0.036688022,0.0002868281,0.00048591738,0.00025446562,0.021910844,0.008171742,0.016787559,0.76326567,0.13168493,0.00581671],"about_ca_topic_score_codex":0.0003664527,"about_ca_topic_score_gemma":0.000028877614,"teacher_disagreement_score":0.80771327,"about_ca_system_score_codex":0.0001757403,"about_ca_system_score_gemma":0.000106610365,"threshold_uncertainty_score":0.99993604},"labels":[],"label_agreement":null},{"id":"W2095441824","doi":"10.1007/s11225-010-9294-y","title":"On the Proof-Theory of two Formalisations of Modal First-Order Logic","year":2010,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Sequent; Sequent calculus; Mathematical proof; Cut-elimination theorem; Normal modal logic; Modal logic; Proof theory; Calculus (dental); Mathematics; Proof calculus; Modal; Natural deduction; Predicate logic; Structural proof theory; Dynamic logic (digital electronics); Predicate (mathematical logic); Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Programming language; Description logic","score_opus":0.02698497281611857,"score_gpt":0.2651746369767692,"score_spread":0.23818966416065063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095441824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21439053,0.00011403151,0.7103682,0.0035624965,0.0005435132,0.0007331757,0.000009639626,0.00009963352,0.07017879],"genre_scores_gemma":[0.9854467,0.000005266126,0.014021862,0.0003607696,0.000033106742,0.000044472814,6.816848e-7,0.0000037913276,0.00008336062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991165,0.00006374408,0.00021447925,0.00021023353,0.00020000032,0.00019506595],"domain_scores_gemma":[0.9984867,0.0006509419,0.00015527656,0.0005486913,0.0001261202,0.000032243417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037472678,0.00011293921,0.00016864925,0.000044349603,0.0001988095,0.00001234102,0.0007470601,0.000042021544,0.00010331159],"category_scores_gemma":[0.0003252776,0.000061448816,0.00007108658,0.00034313902,0.00021384483,0.00013115029,0.0002327555,0.00019589101,0.000015292931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063250545,0.00011398725,0.00015819102,0.000004866707,0.000012183761,0.0000011449567,0.0005940538,0.00040811906,0.0006660335,0.99613774,0.000104688515,0.0017926963],"study_design_scores_gemma":[0.00025305242,0.0002605705,0.0033120045,0.0000063883667,0.0000070173396,0.0000028477832,0.00008534313,0.0009784477,0.0020701715,0.9924185,0.00050498225,0.00010063194],"about_ca_topic_score_codex":0.0000037676134,"about_ca_topic_score_gemma":0.000029499477,"teacher_disagreement_score":0.7710562,"about_ca_system_score_codex":0.000006278495,"about_ca_system_score_gemma":0.00004356485,"threshold_uncertainty_score":0.250581},"labels":[],"label_agreement":null},{"id":"W2097908459","doi":"10.1016/s0021-8693(03)00501-5","title":"Representing congruence lattices of lattices with partial unary operations as congruence lattices of lattices. I. Interval equivalence","year":2003,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Unary operation; Congruence (geometry); Equivalence (formal languages); Congruence relation; Pure mathematics; Congruence lattice problem; Discrete mathematics; Distributive lattice; Distributive property; Geometry","score_opus":0.024536586859265314,"score_gpt":0.2928020141343031,"score_spread":0.2682654272750378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097908459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95085865,0.001814099,0.043549955,0.000737533,0.00061906787,0.0002282189,0.0000057838024,0.000043136373,0.0021435479],"genre_scores_gemma":[0.9448725,0.00020137128,0.05437863,0.00021677204,0.00010991377,0.0000051516954,8.853017e-7,0.00002005016,0.00019474803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99606836,0.00037509066,0.0014746789,0.0005222311,0.0010184303,0.0005412241],"domain_scores_gemma":[0.9952838,0.000836239,0.0018598452,0.0007434702,0.0010094185,0.00026721743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013338261,0.00034278267,0.00078073255,0.00027985623,0.00022091999,0.00022599816,0.0017759147,0.00012066061,0.00014324479],"category_scores_gemma":[0.00093931775,0.0002629691,0.00021715886,0.00084620115,0.0005856281,0.003723242,0.0002807342,0.0005199276,0.000014523191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007182725,0.002139104,0.13220474,0.0012917562,0.0014764963,0.0015443435,0.014541625,0.040701192,0.083886646,0.70932585,0.00032293817,0.011847055],"study_design_scores_gemma":[0.013654718,0.015921216,0.08727464,0.009889347,0.0019819567,0.007315317,0.01177892,0.07803603,0.6414775,0.11980633,0.0078027896,0.005061184],"about_ca_topic_score_codex":0.00009022352,"about_ca_topic_score_gemma":0.00006117209,"teacher_disagreement_score":0.5895195,"about_ca_system_score_codex":0.000043452204,"about_ca_system_score_gemma":0.0005042798,"threshold_uncertainty_score":0.99998224},"labels":[],"label_agreement":null},{"id":"W2099682898","doi":"10.3233/fi-2009-206","title":"Complex Algebras of Arithmetic","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Engineering and Physical Sciences Research Council","keywords":"Arithmetic; Mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.024349699551559478,"score_gpt":0.26463244573006833,"score_spread":0.24028274617850887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099682898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05579898,0.000063964355,0.87565905,0.001588934,0.00019087737,0.0003059961,0.000005341905,0.00025364512,0.06613321],"genre_scores_gemma":[0.8752705,0.0000063726256,0.12196075,0.002650116,0.00001623819,0.000003282441,0.0000057399643,0.0000023205346,0.00008469193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893486,0.000015812257,0.0004133997,0.000114226095,0.0002664473,0.00025527322],"domain_scores_gemma":[0.9991955,0.00004977512,0.00015453262,0.00046943448,0.000042085616,0.00008864927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012358092,0.00011935101,0.00019728183,0.00010449066,0.00007201875,0.00006966543,0.0007130841,0.000032663986,0.00011857829],"category_scores_gemma":[0.000025231953,0.00010006481,0.00006346744,0.0003200031,0.0000571258,0.0008862977,0.00011947261,0.00008508313,0.00019614426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054894635,0.00011614648,0.00024533898,0.00003186332,0.000014744513,0.0000035368007,0.0013209672,0.000096235635,0.00084021955,0.85867137,0.002045932,0.13660815],"study_design_scores_gemma":[0.003209974,0.0025685334,0.13809882,0.00015800835,0.000038248534,0.000169483,0.0008319347,0.13212211,0.013178266,0.62289405,0.085369535,0.0013610094],"about_ca_topic_score_codex":0.0000016498203,"about_ca_topic_score_gemma":3.6040962e-7,"teacher_disagreement_score":0.8194715,"about_ca_system_score_codex":0.00002769259,"about_ca_system_score_gemma":0.000026660955,"threshold_uncertainty_score":0.40805244},"labels":[],"label_agreement":null},{"id":"W2100133025","doi":"10.1007/s10485-014-9373-8","title":"Many for the Price of One Duality Principle for Affine Sets","year":2014,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Distributivity; Mathematics; Distributive property; Affine transformation; Topological space; Duality (order theory); Concrete category; Category theory; Theory of computation; Pure mathematics; Category of topological spaces; Discrete mathematics; Functor; Functional analysis; Topological tensor product; Algorithm","score_opus":0.02495982421353832,"score_gpt":0.2807772088932054,"score_spread":0.2558173846796671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100133025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049172333,0.00005510325,0.9925299,0.0006740037,0.00016527926,0.00071966543,0.000004144672,0.000074286305,0.00086035416],"genre_scores_gemma":[0.9498934,0.0000034601721,0.049296144,0.0004012191,0.00016189188,0.00017662683,0.0000071220193,0.000009472342,0.000050673596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886703,0.000019552179,0.00025245422,0.0003521219,0.00020267749,0.00030616057],"domain_scores_gemma":[0.9983841,0.0008108102,0.00015208748,0.0005166495,0.00007035293,0.000066002336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028604866,0.00014388168,0.00024117196,0.000023054516,0.0001889114,0.0000354529,0.0008259435,0.00007519076,0.000010473551],"category_scores_gemma":[0.00010602358,0.00008913214,0.000087874534,0.0001839971,0.00006919648,0.00005872713,0.00017761334,0.00009612989,0.0000019846777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027974109,0.00002223446,0.000009735159,0.000035735335,0.000017271988,5.6547307e-8,0.000067995716,0.00042646646,0.001897662,0.9569314,0.00020502035,0.04035845],"study_design_scores_gemma":[0.00052184815,0.000095535666,0.0053134956,3.8451873e-7,0.000015696814,0.0000017356688,0.000009460742,0.0071327467,0.009356252,0.9532382,0.024173321,0.00014132584],"about_ca_topic_score_codex":0.000004837104,"about_ca_topic_score_gemma":0.00000264351,"teacher_disagreement_score":0.94497615,"about_ca_system_score_codex":0.000024696574,"about_ca_system_score_gemma":0.00002176729,"threshold_uncertainty_score":0.36347032},"labels":[],"label_agreement":null},{"id":"W2104311663","doi":"10.70930/tac/axzkv912","title":"Coherence for pseudodistributive laws revisited","year":2008,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coherence (philosophical gambling strategy); Law; Computer science; Mathematics; Political science; Statistics","score_opus":0.014448757483534061,"score_gpt":0.2574370406380792,"score_spread":0.24298828315454515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104311663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072614285,0.00056865084,0.9902979,0.000094614574,0.000009213294,0.0002920979,0.000023694794,0.00005575374,0.0013966205],"genre_scores_gemma":[0.9883723,0.000062859624,0.010949093,0.000060844053,0.000025598665,0.00021813359,0.000014506789,0.0000025613572,0.0002940687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995504,0.000026956513,0.00011903637,0.00016185449,0.000047837562,0.00009392372],"domain_scores_gemma":[0.99923015,0.0002954524,0.000073727715,0.00026438863,0.00010447021,0.000031828145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016711277,0.0000642466,0.000110743356,0.000022956567,0.00021595339,0.000010467157,0.00026882676,0.000024864165,0.0000043327595],"category_scores_gemma":[0.00003663793,0.000054224885,0.000024347535,0.0001942207,0.00026117155,0.0001624819,0.000055564873,0.000033546374,0.0000035437758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123522395,0.000017160806,0.00005339852,0.00001315644,0.0000044886174,1.565777e-7,0.00022478288,0.0000041696653,0.00048293118,0.9890918,0.00007296726,0.010022651],"study_design_scores_gemma":[0.00012491757,0.000041929205,0.0004351838,0.0000031080967,0.0000051396105,0.00001152452,0.0000890731,0.00005347066,0.014951121,0.97688043,0.0073275957,0.00007652872],"about_ca_topic_score_codex":8.372264e-7,"about_ca_topic_score_gemma":1.5950664e-7,"teacher_disagreement_score":0.98111093,"about_ca_system_score_codex":0.0000041608605,"about_ca_system_score_gemma":0.000023489814,"threshold_uncertainty_score":0.22112267},"labels":[],"label_agreement":null},{"id":"W2107393062","doi":"10.1017/s0305004107000400","title":"Iterated realizability as a comma construction","year":2008,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Realizability; Topos theory; Morphism; Iterated function; Mathematics; Interpretation (philosophy); Pure mathematics; Generalization; Object (grammar); Context (archaeology); Algebra over a field; Monad (category theory); Discrete mathematics; Computer science; Artificial intelligence; Algorithm; Programming language; Functor; Mathematical analysis","score_opus":0.022519310538970605,"score_gpt":0.2349297276500416,"score_spread":0.212410417111071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107393062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9082246,0.00004294749,0.03434799,0.027918728,0.00021896225,0.00062196405,0.0000072460534,0.00039716111,0.028220415],"genre_scores_gemma":[0.96690875,0.000012620094,0.031893246,0.0009534525,0.00012745695,0.000020458565,6.8752956e-7,0.000012328309,0.00007099007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981769,0.00001950287,0.0005008314,0.00042171424,0.0005618457,0.00031925214],"domain_scores_gemma":[0.99878144,0.00015704993,0.0002452001,0.0003512031,0.00031235444,0.00015274028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035519604,0.00021883502,0.00038383025,0.000018091901,0.0003721148,0.000048098525,0.0011154471,0.00016723343,0.000014307644],"category_scores_gemma":[0.00037566645,0.00014281757,0.00040948213,0.0006384362,0.00094885327,0.0004122667,0.00057924615,0.00040985298,0.000029350746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008965995,0.00017074757,0.0005025764,0.00012928447,0.00002470813,9.654424e-7,0.00038603295,0.0000021685817,0.0019830256,0.9955172,0.001128779,0.00014554104],"study_design_scores_gemma":[0.00036207784,0.00009070591,0.0013758125,0.000066975495,0.000016463584,0.00037665636,0.000044445515,0.009555628,0.0053213337,0.98239535,0.00018442029,0.00021015247],"about_ca_topic_score_codex":0.0000027869316,"about_ca_topic_score_gemma":1.29667965e-8,"teacher_disagreement_score":0.058684174,"about_ca_system_score_codex":0.00007324001,"about_ca_system_score_gemma":0.000045136872,"threshold_uncertainty_score":0.58239317},"labels":[],"label_agreement":null},{"id":"W2108078525","doi":"10.7202/1005724ar","title":"Toutes les relations sont internes — la nouvelle version","year":2011,"lang":"fr","type":"article","venue":"Philosophiques","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy","score_opus":0.25939746902337485,"score_gpt":0.3208264291721761,"score_spread":0.061428960148801226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108078525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041452825,0.044075385,0.42632967,0.08983482,0.004178273,0.0006085252,0.000046396024,0.001155665,0.39231843],"genre_scores_gemma":[0.9484654,0.0007357029,0.04386019,0.0009173037,0.0008020511,0.000014734423,0.000005487358,0.000022000617,0.0051771435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985636,0.000159291,0.00028026532,0.00045060384,0.00017885207,0.00036739928],"domain_scores_gemma":[0.99895024,0.00016108344,0.00013330107,0.00042336117,0.000136257,0.00019575153],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020124597,0.00024465498,0.0002090948,0.000105293715,0.00023647278,0.00008160652,0.0006236638,0.00019910387,0.0009885365],"category_scores_gemma":[0.0001350794,0.0002336267,0.00013756813,0.0001597736,0.0003234367,0.0010467899,0.00041754893,0.00031143372,0.0010772225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016813043,0.00025245867,0.001609812,0.000037021844,0.00003182982,0.00008088437,0.006795257,0.000032926004,0.00009019883,0.9777587,0.0026174393,0.010676634],"study_design_scores_gemma":[0.00027057496,0.00028490782,0.003869169,0.00027561447,0.0000307235,0.000038060723,0.00018360045,0.0010283778,0.0021760687,0.95053756,0.04095605,0.00034930644],"about_ca_topic_score_codex":0.00051922817,"about_ca_topic_score_gemma":0.000059604557,"teacher_disagreement_score":0.9070126,"about_ca_system_score_codex":0.00013786569,"about_ca_system_score_gemma":0.00012536453,"threshold_uncertainty_score":0.9999247},"labels":[],"label_agreement":null},{"id":"W2111794556","doi":"10.1109/ismvl.1995.513513","title":"Classification of functions and enumeration of bases of set logic under Boolean compositions","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Boolean function; Discrete mathematics; Intersection (aeronautics); Set (abstract data type); Boolean algebra; Product term; Class (philosophy); Function (biology); Boolean expression; Combinatorics; Algebra over a field; Two-element Boolean algebra; Computer science; Pure mathematics; Artificial intelligence","score_opus":0.06296046107068666,"score_gpt":0.2645460870929449,"score_spread":0.20158562602225827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111794556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075033285,0.000105900996,0.91999596,0.0006051663,0.000033228516,0.000065970075,0.000007613328,0.00002387984,0.0041289763],"genre_scores_gemma":[0.98607105,0.000020856283,0.013622079,0.00007796,0.000005512453,0.0000025741099,0.000006499899,0.0000014132931,0.00019204742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955595,0.000027608154,0.00017713704,0.000107352564,0.00008159796,0.00005035466],"domain_scores_gemma":[0.99954844,0.00007286458,0.00010499152,0.0001759579,0.000078010635,0.000019719035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040667623,0.00004317729,0.000086946835,0.0000626786,0.000042158325,0.0000059446797,0.000084044994,0.00002244044,0.00007226715],"category_scores_gemma":[0.000009022138,0.00003628182,0.000022848028,0.00017843411,0.00006968854,0.00020603614,0.000025833537,0.000026418382,0.0000033175168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023455284,0.00016454418,0.0012009027,0.000021381837,0.000011015592,1.5089806e-7,0.00021186462,0.0014352478,0.06563203,0.9252963,0.0004933593,0.0055308626],"study_design_scores_gemma":[0.0011687209,0.0010977649,0.19988172,0.000075525015,0.00006769878,0.000031171796,0.001443316,0.5746224,0.07151051,0.1490485,0.00064034434,0.00041233507],"about_ca_topic_score_codex":0.0000081552225,"about_ca_topic_score_gemma":0.000008082847,"teacher_disagreement_score":0.9110378,"about_ca_system_score_codex":0.00000551916,"about_ca_system_score_gemma":0.000005626767,"threshold_uncertainty_score":0.14795297},"labels":[],"label_agreement":null},{"id":"W2112013955","doi":"10.1109/ismvl.1994.302186","title":"Hereditary clones of multiple valued logic algebra","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Boolean algebra; Mathematics; Enumeration; Closure (psychology); Ternary operation; Algebra over a field; Lattice (music); Invariant (physics); Discrete mathematics; Universal algebra; Combinatorics; Pure mathematics; Computer science; Physics; Programming language","score_opus":0.03225756696138086,"score_gpt":0.2329056648232512,"score_spread":0.20064809786187035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112013955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04775431,0.00084067346,0.93028194,0.0009383081,0.000473584,0.00014650919,0.0000016385903,0.00035589485,0.019207153],"genre_scores_gemma":[0.8767014,0.00001944658,0.12178084,0.00055460975,0.000053812117,0.0000044007643,7.3208764e-7,0.0000044552817,0.000880283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912006,0.00003270198,0.00019486528,0.00025991627,0.00017887147,0.00021359378],"domain_scores_gemma":[0.9992929,0.00010306099,0.00006150625,0.0004327676,0.000045719302,0.00006404407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006971775,0.0001059652,0.00015491885,0.00005489646,0.00005332548,0.000016000462,0.00058769167,0.000046397123,0.00036164728],"category_scores_gemma":[0.000049523154,0.00007994907,0.00006801955,0.00026953258,0.000052817,0.00035041888,0.0001650525,0.00007017662,0.00018797307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055640985,0.0003731409,0.0025962393,0.000030029254,0.000028742934,0.00009059783,0.0006204418,0.0005274503,0.0024579593,0.9274946,0.007828135,0.057947088],"study_design_scores_gemma":[0.0019488146,0.000672497,0.01324526,0.000032758562,0.00001485126,0.00014479915,0.00018970284,0.5393037,0.024334552,0.41387206,0.005340506,0.0009004935],"about_ca_topic_score_codex":0.000013814947,"about_ca_topic_score_gemma":0.0000054852653,"teacher_disagreement_score":0.8289471,"about_ca_system_score_codex":0.000008790251,"about_ca_system_score_gemma":0.0000053601148,"threshold_uncertainty_score":0.39597842},"labels":[],"label_agreement":null},{"id":"W2112228608","doi":"10.1109/ismvl.2004.1319927","title":"Monoids whose centralizer is the least clone","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Centralizer and normalizer; Unary operation; clone (Java method); Mathematics; Monoid; Discrete mathematics; Set (abstract data type); Property (philosophy); Combinatorics; Pure mathematics; Computer science; Genetics; Philosophy","score_opus":0.011808974233117189,"score_gpt":0.22881167036148237,"score_spread":0.21700269612836517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112228608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028070625,0.00020074731,0.94003326,0.020459538,0.00023849627,0.000105243365,5.866446e-7,0.00019110575,0.0107003795],"genre_scores_gemma":[0.9587064,0.000033841243,0.031284325,0.0075217686,0.000064176544,0.000005556272,3.3180694e-7,0.000004462327,0.0023791343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931157,0.0000128845595,0.00009286834,0.00020641008,0.00013862475,0.00023764161],"domain_scores_gemma":[0.99943674,0.000017427132,0.000023042816,0.00044253338,0.000021313423,0.000058922866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056461446,0.000082450446,0.000066500776,0.000015923692,0.00012589703,0.00007851426,0.0006345278,0.000025944482,0.000083515166],"category_scores_gemma":[0.0000064552914,0.000045848043,0.00004847934,0.000207793,0.000043929424,0.0002909037,0.00013945553,0.00008311774,0.00037114965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015302976,0.000042031985,0.00016799965,0.0000014211179,0.0000057740667,0.000009531257,0.00082221505,0.00050954375,0.00040815643,0.97878605,0.0017517857,0.017493939],"study_design_scores_gemma":[0.0014493599,0.00017146298,0.012345073,0.000018878121,0.000009251499,0.000071947485,0.00024458295,0.0047840104,0.0311971,0.85566926,0.09345732,0.0005817591],"about_ca_topic_score_codex":0.000030303825,"about_ca_topic_score_gemma":0.0000058748383,"teacher_disagreement_score":0.9306358,"about_ca_system_score_codex":0.000021564354,"about_ca_system_score_gemma":0.00002503523,"threshold_uncertainty_score":0.4770502},"labels":[],"label_agreement":null},{"id":"W2112769148","doi":"10.1109/ismvl.2012.60","title":"Semirigid Systems of Equivalence Relations","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Equivalence (formal languages); Equivalence relation; Cardinality (data modeling); Set (abstract data type); Mathematics; Discrete mathematics; Combinatorics; Computer science; Algebra over a field; Pure mathematics; Data mining; Programming language","score_opus":0.0392435571163093,"score_gpt":0.27966194253247695,"score_spread":0.24041838541616764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112769148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031985315,0.0018339996,0.9539328,0.00011588237,0.0015084959,0.00021791628,0.000005576664,0.00020627827,0.038980518],"genre_scores_gemma":[0.9360558,0.000044255397,0.060181715,0.00002967704,0.0001003827,0.000026535134,0.000004671263,0.0000065423355,0.003550434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988127,0.00005384059,0.00032748302,0.00033689724,0.00024240007,0.00022671344],"domain_scores_gemma":[0.99843097,0.000109460445,0.0002591714,0.0010154551,0.000103588885,0.000081374594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021059539,0.00015327048,0.00025049516,0.000081526385,0.000042694446,0.000047892903,0.0011409152,0.00016839667,0.000045205346],"category_scores_gemma":[0.000029602215,0.00012552628,0.000089581146,0.00015050542,0.000044877503,0.00028402865,0.0014113229,0.00028946402,0.00012771368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1134487e-7,0.000035669505,0.0010233329,0.00013220539,0.000015977523,0.0000015260256,0.0002401785,0.012706635,0.00015655105,0.98371893,0.0007133317,0.0012551496],"study_design_scores_gemma":[0.00071684475,0.00017317625,0.01805495,0.0018305983,0.00014060627,0.000121954195,0.00024163198,0.33125302,0.004421279,0.6177178,0.022269167,0.0030589923],"about_ca_topic_score_codex":0.000037402904,"about_ca_topic_score_gemma":0.0000012403304,"teacher_disagreement_score":0.9328573,"about_ca_system_score_codex":0.00003870084,"about_ca_system_score_gemma":0.00008963752,"threshold_uncertainty_score":0.5118813},"labels":[],"label_agreement":null},{"id":"W2113706703","doi":"10.1109/nafips.1999.781643","title":"Computing with descriptive and veristic words","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fuzzy logic; Fuzzy set; Type-2 fuzzy sets and systems; Mathematics; Fuzzy set operations; Computer science; Artificial intelligence; Fuzzy classification; Theoretical computer science; Algebra over a field; Pure mathematics","score_opus":0.011745223047469331,"score_gpt":0.2115134560628916,"score_spread":0.19976823301542226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113706703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060133982,0.000070193586,0.92117244,0.000036644808,0.00004969044,0.000037331753,4.594694e-8,0.000078276134,0.018421382],"genre_scores_gemma":[0.7824176,0.000001560102,0.21721613,0.00016788204,0.0000052888936,5.9163295e-7,5.4702447e-8,0.0000019232928,0.00018897057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995579,0.00002013007,0.000050639508,0.00017492946,0.00006359202,0.00013278493],"domain_scores_gemma":[0.99975187,0.00004107964,0.000018423923,0.00012403283,0.000018078914,0.000046534235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055013395,0.00006027425,0.00006385836,0.000019624058,0.00007755288,0.000050750827,0.00010293625,0.000011970976,0.000007922557],"category_scores_gemma":[0.000017274167,0.000041017618,0.0000062836853,0.00014373615,0.000035153153,0.00015598009,0.00003887089,0.000046023484,0.000008064958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019820811,0.00001443534,0.0032055492,0.0000033270082,0.0000054464354,0.00002286306,0.00081807666,0.000118637734,0.000060311864,0.9814418,0.00004440774,0.014263161],"study_design_scores_gemma":[0.0058254767,0.0027832382,0.113164335,0.00022081255,0.000051028266,0.0015556555,0.005706735,0.2216458,0.010541725,0.6083678,0.026920566,0.0032168045],"about_ca_topic_score_codex":0.0000028377056,"about_ca_topic_score_gemma":0.0000032965,"teacher_disagreement_score":0.7222836,"about_ca_system_score_codex":0.0000093817425,"about_ca_system_score_gemma":0.00001648054,"threshold_uncertainty_score":0.16726498},"labels":[],"label_agreement":null},{"id":"W2118397695","doi":"10.1007/s10773-011-0902-z","title":"Three Ultrafilters in a Modular Logic","year":2011,"lang":"en","type":"article","venue":"International Journal of Theoretical Physics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Modular design; Embedding; Orthogonality; Conjecture; Mathematics; Algebra over a field; Lattice (music); Pure mathematics; Discrete mathematics; Computer science; Programming language; Physics; Artificial intelligence; Geometry","score_opus":0.026034463332308858,"score_gpt":0.26092894906590086,"score_spread":0.234894485733592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118397695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033615034,0.000029572118,0.9606291,0.0006731069,0.0006253148,0.000028837949,6.825223e-7,0.000012485166,0.004385884],"genre_scores_gemma":[0.9477204,0.000013810439,0.051521175,0.00055423443,0.00018268713,7.8868953e-7,2.470273e-7,0.0000044065578,0.0000022603385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990825,0.000031543437,0.0002835554,0.000118029035,0.00034524914,0.00013909621],"domain_scores_gemma":[0.9994137,0.00008655681,0.00014883891,0.00014691883,0.00013748684,0.00006645209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017147475,0.00008582909,0.00013521385,0.00007663753,0.00001245585,0.00003319511,0.0013384225,0.00003136561,0.000048865728],"category_scores_gemma":[0.00006817531,0.00006474184,0.000110995876,0.00012236426,0.00015799109,0.0006164458,0.00012254101,0.00021278892,0.000014887248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036465517,0.00013809932,0.0003881985,8.1487195e-7,0.000023598686,0.00016561503,0.00023830014,0.00030682882,0.00055017887,0.9866209,0.00000879026,0.011522213],"study_design_scores_gemma":[0.00031749762,0.000106883825,0.0020682574,0.000023079303,0.0000029994521,0.0000711684,0.000011898263,0.0077869883,0.002813642,0.9866965,0.000025235866,0.00007588756],"about_ca_topic_score_codex":8.731851e-7,"about_ca_topic_score_gemma":2.3691881e-7,"teacher_disagreement_score":0.91410536,"about_ca_system_score_codex":0.00003304033,"about_ca_system_score_gemma":0.0000261824,"threshold_uncertainty_score":0.26400957},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0207798165463184,"score_gpt":0.24464201677341751,"score_spread":0.22386220022709913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119670110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74221224,0.0015426668,0.25403422,0.00044458176,0.0006506442,0.00026536314,0.0000013503891,0.00039008635,0.00045881636],"genre_scores_gemma":[0.9852693,0.000023090333,0.013346696,0.0008805873,0.00028240136,0.0000035640512,0.000002623493,0.000033517637,0.00015823515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676853,0.00010360574,0.00077435793,0.0008731858,0.0005921355,0.0008881934],"domain_scores_gemma":[0.99802214,0.00043624756,0.0003957981,0.000760584,0.00013595338,0.00024925743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011444755,0.00041468267,0.00056010537,0.00024724758,0.0006060015,0.00011084591,0.00095499755,0.00016327476,0.000011016808],"category_scores_gemma":[0.00030342463,0.00034974993,0.00013735714,0.00052370946,0.00026769514,0.00060461886,0.00093301403,0.0004090379,0.00003867449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008221121,0.00094115053,0.0025525047,0.00021197648,0.00010465159,0.000079814075,0.0053635617,0.0005632113,0.010769652,0.6383995,0.0004199935,0.3405118],"study_design_scores_gemma":[0.0066338307,0.007917511,0.014928018,0.0030047295,0.00013472048,0.0005006049,0.0018447412,0.15961447,0.2952294,0.49564877,0.009125339,0.005417849],"about_ca_topic_score_codex":0.00003305043,"about_ca_topic_score_gemma":0.000010130981,"teacher_disagreement_score":0.33509395,"about_ca_system_score_codex":0.00006369213,"about_ca_system_score_gemma":0.00010152046,"threshold_uncertainty_score":0.99989545},"labels":[],"label_agreement":null},{"id":"W2120960585","doi":"10.70930/tac/7hx2qwbx","title":"Duality for CCD Lattices","year":2009,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Distributive property; Duality (order theory); Object (grammar); Distributive lattice; Combinatorics; Pure mathematics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.013541775343738037,"score_gpt":0.28366651408197496,"score_spread":0.27012473873823695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120960585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008484938,0.00046107275,0.98793375,0.0005251205,0.000011726895,0.00018129715,0.0000035748217,0.000056188986,0.0023423263],"genre_scores_gemma":[0.98491,0.00002623271,0.014581342,0.00017213146,0.000032407952,0.00006006639,0.0000027776723,0.0000013739367,0.00021364797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996366,0.00002131167,0.00010007695,0.00012686817,0.000038828315,0.00007634539],"domain_scores_gemma":[0.99941534,0.00022121733,0.000056429693,0.00023651788,0.00004601328,0.00002449896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026317322,0.000049445785,0.00008080846,0.000021293197,0.000114790106,0.000021412336,0.00022550115,0.00001984258,0.0000023073376],"category_scores_gemma":[0.00001973934,0.000040493313,0.0000197646,0.000109568864,0.00009025849,0.00019065329,0.000024753828,0.00002324481,0.0000016304979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007347411,0.000021814541,0.000011039473,0.000008131459,0.0000021252022,2.351979e-8,0.00018837319,0.0000044635817,0.00030690603,0.91303194,0.000013444908,0.08640442],"study_design_scores_gemma":[0.00007903881,0.000043441487,0.00066978205,0.000001242556,0.000004622621,0.0000012152541,0.00009349312,0.00006338876,0.0052856435,0.9867422,0.0069642114,0.000051730447],"about_ca_topic_score_codex":3.7802087e-7,"about_ca_topic_score_gemma":2.4957703e-7,"teacher_disagreement_score":0.9764251,"about_ca_system_score_codex":0.0000019682545,"about_ca_system_score_gemma":0.000010580494,"threshold_uncertainty_score":0.16512693},"labels":[],"label_agreement":null},{"id":"W2122580274","doi":"10.1109/ismvl.1994.302205","title":"Enumeration of function and bases of three-valued set logic under compositions with Boolean functions","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université du Québec à Trois-Rivières","funders":"","keywords":"Unary operation; Boolean function; Mathematics; Set (abstract data type); Discrete mathematics; Boolean algebra; Boolean expression; Tuple; Function (biology); Product term; Parity function; Boolean domain; Boolean data type; Enumeration; Combinatorics; Two-element Boolean algebra; Algebra over a field; Computer science; Pure mathematics","score_opus":0.03727087978893946,"score_gpt":0.22995342664386728,"score_spread":0.1926825468549278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122580274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052172124,0.000086970445,0.94530445,0.00035379274,0.0000458209,0.00009395146,0.000005395874,0.00005058071,0.0018868911],"genre_scores_gemma":[0.97347504,0.000006534609,0.026093908,0.00020987925,0.000012129568,0.000005350328,0.000008019972,0.0000029504772,0.0001862094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946,0.000023770279,0.00014193958,0.000167115,0.00012092009,0.000086247754],"domain_scores_gemma":[0.99956787,0.00004539688,0.00007760076,0.0001990849,0.000076672724,0.000033405155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042049774,0.0000744576,0.000105961466,0.000068720896,0.00010095853,0.000017231823,0.000078093646,0.0000260931,0.0001277834],"category_scores_gemma":[0.00000412393,0.000054427845,0.000022605842,0.00023710166,0.00007470897,0.00034736324,0.00003137119,0.000045411398,0.0000072271278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029087052,0.0002891737,0.0038571246,0.000028716542,0.000055646007,0.0000013786065,0.00018495125,0.0116173215,0.008068574,0.9662271,0.000583876,0.009057059],"study_design_scores_gemma":[0.0028949315,0.0045532435,0.15073247,0.00010327286,0.0001827784,0.00011151642,0.0007147083,0.58482134,0.008694117,0.24594684,0.00051352393,0.00073122943],"about_ca_topic_score_codex":0.00001636643,"about_ca_topic_score_gemma":0.00005996701,"teacher_disagreement_score":0.9213029,"about_ca_system_score_codex":0.00000802614,"about_ca_system_score_gemma":0.000007314296,"threshold_uncertainty_score":0.22195031},"labels":[],"label_agreement":null},{"id":"W2124433158","doi":"10.1093/philmat/nkl006","title":"JOHN L. BELL. Set Theory: Boolean-Valued Models and Independence Proofs. Oxford: Clarendon Press, 2005. Oxford Logic Guides, No. 47. Pp. xxii + 191. ISBN 0-19-856852-5, 987-0-19-856852-0 (pbk).","year":2006,"lang":"en","type":"article","venue":"Philosophia Mathematica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Independence (probability theory); Axiom; Set theory; Mathematics; Axiom of choice; Set (abstract data type); Epistemology; Discrete mathematics; Philosophy; Computer science","score_opus":0.04274098801633263,"score_gpt":0.27211911608931383,"score_spread":0.2293781280729812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124433158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003042896,0.011919567,0.874719,0.007930843,0.0007235121,0.003464664,0.00016983233,0.0019222809,0.09610737],"genre_scores_gemma":[0.7055327,0.0028738456,0.27949497,0.0045400592,0.0016622328,0.0008551025,0.00016547355,0.00031091511,0.0045646746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992864,0.00041474888,0.0015455248,0.0019628818,0.0015330135,0.0016798229],"domain_scores_gemma":[0.99504423,0.000644001,0.0008477452,0.0024311435,0.00035874223,0.0006741179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017096815,0.0011576922,0.0012515078,0.0002827035,0.0008242176,0.0005683201,0.0027964301,0.00052353484,0.00016933755],"category_scores_gemma":[0.00050035707,0.0009709751,0.0003264535,0.000566802,0.0005680511,0.0022448977,0.0015108947,0.0009278963,0.000218514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008168529,0.00043573233,0.000029330311,0.00047184055,0.00008333852,0.00012806819,0.00051226054,0.0015713584,0.00019278836,0.98543835,0.0099500725,0.001105188],"study_design_scores_gemma":[0.001219893,0.00026336804,0.000026655256,0.00019924938,0.00009585769,0.00024488362,0.00003713985,0.07274735,0.00058038137,0.9074922,0.015993906,0.0010990686],"about_ca_topic_score_codex":0.000059495203,"about_ca_topic_score_gemma":0.000015741549,"teacher_disagreement_score":0.70248985,"about_ca_system_score_codex":0.00019692369,"about_ca_system_score_gemma":0.00025466972,"threshold_uncertainty_score":0.9992741},"labels":[],"label_agreement":null},{"id":"W2127521998","doi":"10.1016/j.jctb.2014.02.004","title":"A base exchange property for regular matroids","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Element (criminal law); Property (philosophy); Base (topology); Combinatorics; Mathematics; Discrete mathematics; Mathematical analysis; Philosophy; Political science","score_opus":0.010447833759310764,"score_gpt":0.22570754075854352,"score_spread":0.21525970699923275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127521998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011692808,0.00036284767,0.9746186,0.0018586408,0.009290556,0.00026745492,0.0000017249589,0.00007264657,0.0018347257],"genre_scores_gemma":[0.93022025,0.0000529173,0.06378974,0.0006383858,0.0029343974,0.000022463624,0.000001009477,0.00003259663,0.0023082362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871975,0.00024721204,0.00036550526,0.00015665713,0.00026750544,0.00024339574],"domain_scores_gemma":[0.99858916,0.00025619473,0.00035448393,0.0003514465,0.0003207415,0.00012798193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017211746,0.00014389055,0.0003140146,0.00008902132,0.00014773232,0.000103289196,0.00082552235,0.00006767007,0.000021439946],"category_scores_gemma":[0.00049301045,0.00008765801,0.00017249161,0.00016195833,0.00007943247,0.0010285304,0.00011965072,0.00015567886,0.0000045404013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037097177,0.00006402672,0.0000073424744,0.000027735809,0.00001999582,0.000009253967,0.00024206105,0.00001441302,0.001006544,0.9822162,0.0012201627,0.014801304],"study_design_scores_gemma":[0.0012183157,0.0014524241,0.000013715175,0.000027173732,0.000011997318,0.000094631345,0.00003861861,0.00018644228,0.004606078,0.83978814,0.15243694,0.00012555033],"about_ca_topic_score_codex":3.1042524e-7,"about_ca_topic_score_gemma":1.5949072e-7,"teacher_disagreement_score":0.9185274,"about_ca_system_score_codex":0.000038365724,"about_ca_system_score_gemma":0.00007018722,"threshold_uncertainty_score":0.35745898},"labels":[],"label_agreement":null},{"id":"W2128007477","doi":"10.5539/elt.v4n1p240","title":"On Vague Reference in College English","year":2011,"lang":"en","type":"article","venue":"English Language Teaching","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variety (cybernetics); Psychology; Perspective (graphical); Vocabulary; Linguistics; College English; Mathematics education; Artificial intelligence; Computer science","score_opus":0.019565455174852642,"score_gpt":0.24277038327494777,"score_spread":0.22320492810009512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128007477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7548331,0.000116582,0.019776888,0.000013145401,0.0007217672,0.00015425839,0.0000057325396,0.00062528165,0.22375324],"genre_scores_gemma":[0.9790751,0.000002477531,0.02006517,0.00032892515,0.00018232751,0.000017051021,0.000003837527,0.000014535942,0.00031062655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9984944,0.00020070317,0.00022539127,0.00046972762,0.00021418754,0.00039557443],"domain_scores_gemma":[0.99895376,0.00020703298,0.00007337604,0.000639971,0.000029725023,0.000096152435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005484347,0.00018545527,0.00019398004,0.00018091926,0.00010886088,0.000047778816,0.0009326136,0.00008942287,0.00007507822],"category_scores_gemma":[0.001108301,0.00016678333,0.00004402476,0.00025611473,0.000024977775,0.0006604662,0.00020960558,0.0007625858,0.00003782941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010421963,0.00014064345,0.0005239419,0.0000075359753,0.00000477342,0.0002852876,0.2819834,0.00003785597,0.00012841677,0.7051272,0.00015127608,0.011599284],"study_design_scores_gemma":[0.018068368,0.004603957,0.042464554,0.0021398694,0.0000783718,0.0001306493,0.43923208,0.021419372,0.039978176,0.38872534,0.031703215,0.011456047],"about_ca_topic_score_codex":0.000091240094,"about_ca_topic_score_gemma":0.00007796181,"teacher_disagreement_score":0.3164018,"about_ca_system_score_codex":0.00006846991,"about_ca_system_score_gemma":0.00002638822,"threshold_uncertainty_score":0.6801227},"labels":[],"label_agreement":null},{"id":"W2129363018","doi":"10.4064/fm170-1-4","title":"A property of the solvable radical in finitely decidable varieties","year":2001,"lang":"en","type":"article","venue":"Fundamenta Mathematicae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Mathematics; Congruence relation; Type (biology); Finitely-generated abelian group; Pure mathematics; Class (philosophy); Combinatorics; Discrete mathematics; Computer science","score_opus":0.027054266100343085,"score_gpt":0.241432413513355,"score_spread":0.21437814741301192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129363018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16040969,0.00031337983,0.75378114,0.004570119,0.00041802222,0.0011646957,0.0000022982128,0.00018267927,0.07915799],"genre_scores_gemma":[0.92626953,0.000021793252,0.06856357,0.00047893633,0.000019952902,0.000056093606,4.0897052e-7,0.00000997529,0.0045797075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885386,0.000057781323,0.00031242816,0.0002153563,0.00028718897,0.00027340237],"domain_scores_gemma":[0.9990797,0.00016043725,0.00010098633,0.0005892133,0.000023942386,0.00004571695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027885684,0.00011315061,0.00020798841,0.000052042353,0.0000838198,0.00006157734,0.00091316877,0.000043089563,0.00015871454],"category_scores_gemma":[0.000114734845,0.00005747667,0.00006352855,0.00049464614,0.0001296179,0.00030277568,0.00034171002,0.00012394885,0.000056046632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035213496,0.0012363704,0.010215037,0.00020529839,0.000036372123,0.000040424227,0.005230188,0.00031995287,0.0025368936,0.96427935,0.0031192678,0.012745607],"study_design_scores_gemma":[0.0011932178,0.0002171857,0.006072663,0.00026783757,0.000014152846,0.00012223548,0.00038912852,0.032508228,0.00611706,0.92131937,0.031389263,0.0003896838],"about_ca_topic_score_codex":0.000017510043,"about_ca_topic_score_gemma":0.000017344722,"teacher_disagreement_score":0.7658599,"about_ca_system_score_codex":0.000042289645,"about_ca_system_score_gemma":0.00006365643,"threshold_uncertainty_score":0.23438306},"labels":[],"label_agreement":null},{"id":"W2130817819","doi":"10.1109/ismvl.1996.508367","title":"On the lattice of partial clones on a finite set","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lattice (music); Set (abstract data type); Finite set; Mathematics; Combinatorics; Physics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.05159635794294605,"score_gpt":0.25313267204740547,"score_spread":0.20153631410445944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130817819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26148766,0.000099406185,0.52842045,0.021448176,0.00060895353,0.00032557163,0.0000050015215,0.00031040146,0.18729438],"genre_scores_gemma":[0.9939079,0.0000063513794,0.0020072,0.0027153331,0.000027232267,0.000003947669,1.4075393e-7,0.0000020498196,0.0013298398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949926,0.00003701956,0.00008443875,0.00013344234,0.00013270837,0.00011313141],"domain_scores_gemma":[0.99906325,0.0005320045,0.00003386147,0.0003336383,0.000014360211,0.000022858554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007117809,0.000056903755,0.00006175813,0.000019624846,0.00005338686,0.00001757542,0.0003433845,0.000017998549,0.00023298156],"category_scores_gemma":[0.00006659751,0.000030251296,0.000030680778,0.00014293919,0.000028000208,0.00007582905,0.00005253933,0.00006396399,0.00030969593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030454,0.000045137745,0.000019814974,0.0000013175821,0.0000029523164,0.0000034594016,0.00027106775,0.0006602891,0.00004033713,0.99186313,0.0023057591,0.004783686],"study_design_scores_gemma":[0.00082845974,0.0015816184,0.0017192317,0.000052480085,0.000010530645,0.000010181157,0.00011128665,0.58634186,0.025408188,0.3464236,0.037037954,0.00047458266],"about_ca_topic_score_codex":0.0000023392595,"about_ca_topic_score_gemma":0.0000011829613,"teacher_disagreement_score":0.73242027,"about_ca_system_score_codex":0.00000347384,"about_ca_system_score_gemma":0.0000024927565,"threshold_uncertainty_score":0.39806178},"labels":[],"label_agreement":null},{"id":"W2131415820","doi":"","title":"An Analysis on Illogicality in Language","year":2015,"lang":"en","type":"article","venue":"Studies in literature and language","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Predicate variable; Computer science; Predicate (mathematical logic); Predicate logic; Linguistics; Propositional calculus; Programming language; Epistemology; Philosophy; Description logic; Multimodal logic; Zeroth-order logic","score_opus":0.02672126893850006,"score_gpt":0.35306963547245845,"score_spread":0.3263483665339584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131415820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97330314,0.022240298,0.0013756346,0.0002224857,0.00012291607,0.00009129548,0.000006700149,0.00006500001,0.0025725581],"genre_scores_gemma":[0.9960881,0.000089242945,0.0026836423,0.0009537145,0.000059699134,0.000009915328,0.000009672691,0.0000026935038,0.00010335589],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99902624,0.00013165925,0.00014776793,0.0003655633,0.00013079685,0.00019798457],"domain_scores_gemma":[0.99942523,0.00007458994,0.000032186803,0.00036873895,0.00002926732,0.000070004615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003508251,0.00012661076,0.0002696656,0.00022560767,0.000030657233,0.00006370177,0.00024378397,0.000057771125,0.0000023454752],"category_scores_gemma":[0.00011543494,0.00008508404,0.000035048586,0.0011319268,0.000058485108,0.00027827936,0.000114449336,0.0001905357,0.0000021383962],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008380713,0.00044233003,0.047198907,0.00006631141,0.00018932477,0.0036247899,0.7794785,0.0010006432,0.0003286849,0.1283313,0.00027268156,0.038982753],"study_design_scores_gemma":[0.00908577,0.003611706,0.5449795,0.00086584705,0.00024244153,0.00012010501,0.26979756,0.02352212,0.001383059,0.13695441,0.0056885304,0.0037489259],"about_ca_topic_score_codex":0.000025294628,"about_ca_topic_score_gemma":0.00027521432,"teacher_disagreement_score":0.50968087,"about_ca_system_score_codex":0.000035120673,"about_ca_system_score_gemma":0.000006290394,"threshold_uncertainty_score":0.34696263},"labels":[],"label_agreement":null},{"id":"W2132389230","doi":"10.1109/time.2009.22","title":"Timed Contact Algebras","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Engineering and Physical Sciences Research Council","keywords":"Axiom; Context (archaeology); Extension (predicate logic); Computer science; Set (abstract data type); Spacetime; Relation (database); Set theory; Algebra over a field; Mathematics; Theoretical computer science; Pure mathematics; Geometry","score_opus":0.01038487306876994,"score_gpt":0.23841528248876206,"score_spread":0.22803040941999211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132389230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008554182,0.0000677362,0.88305146,0.0025401674,0.000107984975,0.000059902875,9.025872e-8,0.0003812445,0.10523721],"genre_scores_gemma":[0.942666,0.0000033869233,0.050803583,0.004691531,0.00003288096,0.0000010523981,4.3368988e-7,0.0000014825548,0.0017996274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946576,0.000011498856,0.00008044472,0.00017812042,0.00009567499,0.00016852074],"domain_scores_gemma":[0.9995955,0.000025052983,0.000019790383,0.00027943714,0.00001731801,0.00006290453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046660098,0.000064889595,0.00007409842,0.000028397399,0.000045504607,0.00004559175,0.0004041943,0.00002291744,0.00010220358],"category_scores_gemma":[0.000011833952,0.000048251557,0.00003092298,0.00014855187,0.00000606432,0.00032913883,0.000034624067,0.000049500908,0.00038423986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.833942e-7,0.00001948191,0.000036595753,2.5040075e-7,0.0000013621056,0.000010821042,0.00003700756,0.000004930354,0.0014636758,0.9128315,0.0013994484,0.08419409],"study_design_scores_gemma":[0.0007055588,0.0005245725,0.04171687,0.0000073760652,0.0000032057098,0.000047197016,0.000015521606,0.013511838,0.017958386,0.8961396,0.028919468,0.0004503982],"about_ca_topic_score_codex":0.0000013890664,"about_ca_topic_score_gemma":6.95904e-7,"teacher_disagreement_score":0.93411183,"about_ca_system_score_codex":0.000009717342,"about_ca_system_score_gemma":0.000013456112,"threshold_uncertainty_score":0.4938754},"labels":[],"label_agreement":null},{"id":"W2133334995","doi":"10.1142/s021819670900524x","title":"OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Nemzeti Fejlesztési Ügynökség; Fonds Québécois de la Recherche sur la Nature et les Technologies; Hungarian Scientific Research Fund; Centre de Recherches Mathématiques","keywords":"Unary operation; Mathematics; Bounded function; Variety (cybernetics); Type (biology); Discrete mathematics; Affine transformation; Algebra over a field; Combinatorics; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.008600406006068288,"score_gpt":0.2718593373967384,"score_spread":0.26325893139067014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133334995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45796174,0.00026817797,0.5298866,0.011313252,0.00032414208,0.00005971513,2.9123817e-7,0.000011777398,0.00017426856],"genre_scores_gemma":[0.9731986,0.000035706027,0.02447761,0.0021262283,0.0001525607,5.533095e-7,4.779512e-7,0.0000017659094,0.0000065066206],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991818,0.00005573879,0.00027030637,0.00011854245,0.00029400765,0.000079571444],"domain_scores_gemma":[0.9992629,0.00019097449,0.0001926416,0.00006104781,0.00023235797,0.000060054528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045627868,0.00006990897,0.00011656753,0.00007733065,0.00007883997,0.00023031014,0.00030885707,0.000020153178,0.000001252305],"category_scores_gemma":[0.00010571856,0.000045716562,0.000035563702,0.00009066043,0.000047939673,0.00040412068,0.00006057987,0.00010062073,0.00000184465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001913755,0.000052391504,0.0006265351,0.0000027057686,0.000043543547,0.000022119062,0.0018246998,0.0021616959,0.00033561754,0.39383164,0.0001522425,0.60075545],"study_design_scores_gemma":[0.0016811,0.00026176395,0.06436408,0.000037449252,0.000011341704,0.00036253178,0.000063783984,0.044383816,0.0001191894,0.88783485,0.0007667845,0.00011328297],"about_ca_topic_score_codex":0.0000033329889,"about_ca_topic_score_gemma":8.6799554e-7,"teacher_disagreement_score":0.60064214,"about_ca_system_score_codex":0.00003196663,"about_ca_system_score_gemma":0.000034468692,"threshold_uncertainty_score":0.22208859},"labels":[],"label_agreement":null},{"id":"W2136516706","doi":"10.1017/s144678870000238x","title":"Minimum sized fibres in distributive lattices","year":2001,"lang":"en","type":"article","venue":"Journal of the Australian Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Antichain; Mathematics; Distributive property; Combinatorics; Distributive lattice; Monotone polygon; Lattice (music); Upper and lower bounds; Discrete mathematics; Partially ordered set; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.02984472075353216,"score_gpt":0.2916220110647805,"score_spread":0.2617772903112483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136516706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8255311,0.000091387614,0.142686,0.030365277,0.00033669698,0.00021380723,0.0000037713537,0.00003361135,0.0007383146],"genre_scores_gemma":[0.9580674,0.000023576944,0.040576722,0.000296836,0.00009194878,0.0000014712281,1.3667609e-7,0.000004965004,0.0009369328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876523,0.00007647072,0.00044256198,0.00011315204,0.00033569723,0.00026690413],"domain_scores_gemma":[0.9989641,0.00030622896,0.00031114434,0.00025860663,0.00006508062,0.00009484117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004890137,0.00011354588,0.00026000116,0.00001529793,0.00007719128,0.00008030399,0.0010314148,0.00007154015,0.000069087764],"category_scores_gemma":[0.00018808738,0.00006271182,0.0003221552,0.00035679183,0.000105418,0.0004014355,0.00016204691,0.00033270847,0.000020602345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026659417,0.0041286913,0.035075597,0.000697831,0.0009409608,0.0008059867,0.029884903,0.002988113,0.018241623,0.7800773,0.10162502,0.025267383],"study_design_scores_gemma":[0.0014423198,0.00017168526,0.028135916,0.00030469237,0.00004251406,0.0004969328,0.0010048969,0.005833309,0.0020759194,0.9551112,0.0050817057,0.00029890632],"about_ca_topic_score_codex":9.638404e-7,"about_ca_topic_score_gemma":6.901764e-7,"teacher_disagreement_score":0.1750339,"about_ca_system_score_codex":0.000070753245,"about_ca_system_score_gemma":0.000044504963,"threshold_uncertainty_score":0.25573137},"labels":[],"label_agreement":null},{"id":"W2137983774","doi":"10.1109/ismvl.2007.35","title":"Monoidal Intervals of Partial Clones","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Symposium on Multiple-Valued Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Unary operation; Monoid; Symmetric monoidal category; Mathematics; Interval (graph theory); Cardinality (data modeling); Discrete mathematics; Monoidal category; Combinatorics; Pure mathematics; Computer science; Functor","score_opus":0.022904388030979717,"score_gpt":0.2832383008233843,"score_spread":0.2603339127924046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137983774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8701322,0.00011384828,0.06407922,0.0032609506,0.0028937603,0.00095902244,0.00002109884,0.0010078576,0.05753203],"genre_scores_gemma":[0.96957576,0.00004473854,0.028077178,0.0009932631,0.00083652756,0.00007135261,0.00001024158,0.000051756484,0.0003391975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9949063,0.000010407605,0.0013220143,0.00134436,0.0014352119,0.0009817074],"domain_scores_gemma":[0.9967313,0.00030961016,0.0009676784,0.00023959613,0.0014025074,0.00034930222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014274886,0.00064699777,0.000641702,0.00055772933,0.00026295835,0.0003530612,0.0027990867,0.000310762,0.000060359624],"category_scores_gemma":[0.001079411,0.00057571405,0.00037467925,0.0008285935,0.00024698453,0.0017559174,0.0007452405,0.00058968324,0.00010487046],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005986651,0.0007082539,0.033283554,0.000107711356,0.00016886256,0.00001964325,0.0019229354,0.00016558115,0.20999008,0.74760133,0.0006958167,0.004737586],"study_design_scores_gemma":[0.006609132,0.002992654,0.030734235,0.00059191685,0.0001093709,0.00035439528,0.001747323,0.09773306,0.7808942,0.061535966,0.013963692,0.0027340169],"about_ca_topic_score_codex":0.000024685873,"about_ca_topic_score_gemma":0.0000018949622,"teacher_disagreement_score":0.6860653,"about_ca_system_score_codex":0.00029311512,"about_ca_system_score_gemma":0.000040074647,"threshold_uncertainty_score":0.99966943},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014197876853144852,"score_gpt":0.27922536928875186,"score_spread":0.265027492435607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138244417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029783709,0.0016378764,0.9375934,0.017130101,0.00006641839,0.00028796677,0.0000022013317,0.00027905506,0.013219255],"genre_scores_gemma":[0.98352283,0.000084007304,0.01392408,0.0021256977,0.000051344075,0.000026499354,0.0000021580404,0.0000012007114,0.00026215022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994809,0.000018775272,0.00008875717,0.00022919627,0.00003558253,0.0001467892],"domain_scores_gemma":[0.9996426,0.000048389727,0.000028678463,0.00020410916,0.000022829843,0.00005337357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000033297052,0.00006741186,0.00008512017,0.000029065235,0.00020355103,0.000016818462,0.00027721317,0.00007178723,0.000059477123],"category_scores_gemma":[0.000014430724,0.00005264437,0.000015240709,0.00013051335,0.000066268614,0.00010064009,0.000050999413,0.00008825791,0.00002947071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.597613e-7,0.000015834963,0.000019043497,5.777764e-7,0.0000014556432,8.337213e-7,0.000037743,0.0000045055913,0.0004498307,0.95849174,0.00007775741,0.040899716],"study_design_scores_gemma":[0.000101705926,0.000077080054,0.009002747,3.6890475e-7,0.0000023680923,0.000040362745,0.000014949147,0.0004202798,0.0005865399,0.969495,0.020175204,0.00008336919],"about_ca_topic_score_codex":7.989927e-7,"about_ca_topic_score_gemma":0.0000010038485,"teacher_disagreement_score":0.95373917,"about_ca_system_score_codex":0.000004266173,"about_ca_system_score_gemma":0.000010055116,"threshold_uncertainty_score":0.21467751},"labels":[],"label_agreement":null},{"id":"W2141315618","doi":"10.1109/ismvl.1994.302184","title":"Several remarks on algebraic entropy","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université du Québec à Trois-Rivières","funders":"","keywords":"Entropy (arrow of time); Algebraic number; Equivalence (formal languages); Mathematics; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Theoretical computer science; Physics; Mathematical analysis; Thermodynamics","score_opus":0.014853612392883441,"score_gpt":0.21405312755161907,"score_spread":0.19919951515873563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141315618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008075247,0.000083812156,0.8307574,0.0035795253,0.0003954972,0.00009649104,2.9723532e-7,0.0004293626,0.15658237],"genre_scores_gemma":[0.93338656,0.000019852401,0.04842791,0.0051221796,0.0000912231,0.0000048476513,5.054211e-7,0.000005583069,0.012941325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918175,0.000025539894,0.00010226053,0.00027855212,0.00017083823,0.00024103283],"domain_scores_gemma":[0.9994194,0.00005181951,0.000026256519,0.00040923926,0.000015746566,0.000077531404],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004388469,0.00009712224,0.00008681267,0.000046093457,0.00007590495,0.000056090437,0.00046409422,0.00003420701,0.0008884509],"category_scores_gemma":[0.000018807375,0.000072876464,0.000046945184,0.00018050257,0.000018728771,0.00027521208,0.00008912427,0.00009816749,0.0014014692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015467061,0.00005714713,0.000055298915,0.0000013728761,0.0000040825835,0.000027984031,0.00011037592,0.0001278536,0.00015077925,0.9496891,0.013725683,0.036048792],"study_design_scores_gemma":[0.0016815807,0.0008892652,0.005091376,0.000029820048,0.0000065302756,0.00012749774,0.000031025484,0.48182592,0.0059686946,0.36403134,0.1392102,0.0011067804],"about_ca_topic_score_codex":0.0000015741525,"about_ca_topic_score_gemma":9.970299e-7,"teacher_disagreement_score":0.9253113,"about_ca_system_score_codex":0.000021251577,"about_ca_system_score_gemma":0.0000036762374,"threshold_uncertainty_score":0.99937606},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017353044871945413,"score_gpt":0.2411527481238169,"score_spread":0.22379970325187148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142792844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11303015,0.000004025575,0.88452667,0.0004856407,0.000014733386,0.00006896339,0.0000014806515,0.000015969325,0.0018523453],"genre_scores_gemma":[0.98857653,6.802194e-7,0.011166066,0.0002341604,0.0000067956857,0.0000053177328,5.835418e-7,0.000001045665,0.000008847183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951583,0.00003336131,0.00013825546,0.00012907105,0.000117050164,0.00006640975],"domain_scores_gemma":[0.9995462,0.0000637796,0.00006396639,0.00025137563,0.000054347664,0.00002037919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104438215,0.00003568972,0.00009085646,0.00005762737,0.000024277138,0.000006006416,0.00028424576,0.000017530105,0.000114189505],"category_scores_gemma":[0.000033889966,0.000022442233,0.00006654312,0.0008939006,0.000034823403,0.000055994715,0.00009140295,0.000031461692,0.000010639173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.6706484e-7,0.000065641085,0.008020692,0.0000056751974,0.000037587175,1.05540515e-7,0.0003371879,0.0004241843,0.0011628341,0.46905515,0.000010656718,0.52087945],"study_design_scores_gemma":[0.00006520086,0.000031524753,0.028997056,0.0000056214303,0.00006528983,6.005681e-7,0.000022582153,0.9150778,0.008672297,0.046979133,0.000014808631,0.00006805719],"about_ca_topic_score_codex":0.000012620821,"about_ca_topic_score_gemma":0.000015827858,"teacher_disagreement_score":0.91465366,"about_ca_system_score_codex":0.0000061853802,"about_ca_system_score_gemma":0.0000015228212,"threshold_uncertainty_score":0.1250295},"labels":[],"label_agreement":null},{"id":"W2147412980","doi":"10.1109/ismvl.1994.302185","title":"Many-valued generalizations of two finite intervals in Post's lattice","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Unary operation; Negation; Mathematics; Permutation (music); Finitely-generated abelian group; Lattice (music); Combinatorics; Discrete mathematics; Countable set; Finite set; Constant (computer programming); Computer science; Physics","score_opus":0.03643869126660065,"score_gpt":0.27814725627348275,"score_spread":0.2417085650068821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147412980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046151448,0.0001570635,0.93964,0.0007219573,0.00009910645,0.00007943827,0.0000012012509,0.00007281381,0.013076998],"genre_scores_gemma":[0.8716214,0.000023231672,0.12510945,0.0011883365,0.000017666474,0.000005012032,0.0000012501937,0.00000428704,0.0020293747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993155,0.000048355516,0.00020894493,0.00017678435,0.00010302324,0.00014736266],"domain_scores_gemma":[0.9994867,0.000072120616,0.00005147526,0.00029899064,0.000055708573,0.000035019115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008141861,0.00007007885,0.00011043919,0.00010712829,0.000025611083,0.000023146355,0.00040878842,0.000021815586,0.0003481696],"category_scores_gemma":[0.000053298318,0.000059416776,0.00003621194,0.00041872152,0.000023654646,0.00033805644,0.00013037358,0.000052279447,0.00008238215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.306483e-7,0.000108390916,0.0010438648,0.000006888432,0.0000061537116,0.000010845075,0.00078776455,0.005097974,0.0009063021,0.9787775,0.00023325045,0.013020128],"study_design_scores_gemma":[0.0006505254,0.000100151985,0.0034606655,0.00002110776,0.000004362432,0.000007989684,0.00003723255,0.9535836,0.0027917605,0.03818249,0.00096070557,0.00019942904],"about_ca_topic_score_codex":0.00003111551,"about_ca_topic_score_gemma":0.0000336929,"teacher_disagreement_score":0.9484856,"about_ca_system_score_codex":0.000011405616,"about_ca_system_score_gemma":0.000006156565,"threshold_uncertainty_score":0.38122126},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020971882760010354,"score_gpt":0.22732704549571792,"score_spread":0.20635516273570756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148544922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9065355,0.0007742015,0.08121923,0.006341301,0.00016560059,0.000091801754,4.781519e-7,0.000013055484,0.0048588337],"genre_scores_gemma":[0.9970144,0.000104009785,0.0023560042,0.00041236443,0.000071917806,7.6634103e-7,4.821536e-8,0.0000026605276,0.00003780709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994188,0.000019215186,0.0001970727,0.000077307595,0.00020038069,0.00008725662],"domain_scores_gemma":[0.99936837,0.0001619473,0.0002687453,0.00013019404,0.000034038756,0.000036675676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018651428,0.00006686417,0.00013080765,0.00005415601,0.00006151569,0.000042487238,0.00027294274,0.000028503688,0.00003600219],"category_scores_gemma":[0.000022021595,0.00003660942,0.000042055504,0.00014075857,0.000039341594,0.00013907073,0.00003340021,0.00013276705,0.0000075875837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050747126,0.00003536817,0.000028303935,0.0000042503193,0.000011035038,0.0000032186185,0.00047034468,0.000069487316,0.0023320757,0.9756962,0.0013455516,0.019999104],"study_design_scores_gemma":[0.0008339336,0.00064152305,0.003668357,0.00006840329,0.00002557179,0.00012464165,0.00051535707,0.0025116538,0.021386856,0.9663967,0.0036056961,0.0002213315],"about_ca_topic_score_codex":1.6366202e-7,"about_ca_topic_score_gemma":3.3683403e-7,"teacher_disagreement_score":0.09047893,"about_ca_system_score_codex":0.000004784386,"about_ca_system_score_gemma":0.0000059281215,"threshold_uncertainty_score":0.14928888},"labels":[],"label_agreement":null},{"id":"W2150789753","doi":"10.1081/agb-100105987","title":"A JUST NON-FINITELY BASED VARIETY OF BIGROUPS","year":2001,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Unary operation; Variety (cybernetics); Endomorphism; Finitely-generated abelian group; Stallings theorem about ends of groups; Idempotence; Construct (python library); Pure mathematics; Finitely generated group; Algebra over a field; Discrete mathematics; Computer science","score_opus":0.06149951265673601,"score_gpt":0.3154189393446501,"score_spread":0.25391942668791406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150789753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046466652,0.00082555367,0.9295536,0.0029375972,0.000120211975,0.0002515528,0.0000032314285,0.00015230148,0.019689282],"genre_scores_gemma":[0.81742746,0.0002273244,0.1817616,0.0004702296,0.000008424183,0.000039275215,0.000008775271,0.000007100652,0.000049839036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989277,0.00012478903,0.00035942596,0.00022534978,0.00014686665,0.00021583482],"domain_scores_gemma":[0.99602735,0.0004247446,0.00013367535,0.003269042,0.00008883992,0.000056344717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031347046,0.00011769616,0.00019124885,0.00020828277,0.00013286225,0.000035200832,0.003286974,0.00006898939,0.000026254733],"category_scores_gemma":[0.000104126986,0.00011705669,0.00006676167,0.0013923153,0.00018668614,0.00033038296,0.00071792223,0.0002499097,0.000044471813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011037588,0.00077255693,0.0155337015,0.000021234431,0.000014002717,0.000009170471,0.0014100791,0.00075296185,0.00078862224,0.9261023,0.00020827827,0.054376047],"study_design_scores_gemma":[0.0030038333,0.00032414813,0.14268842,0.00025907383,0.00002754893,0.000046074983,0.0005316477,0.6010507,0.002493773,0.2044949,0.04401796,0.0010619186],"about_ca_topic_score_codex":0.000032630003,"about_ca_topic_score_gemma":0.00006482741,"teacher_disagreement_score":0.7709608,"about_ca_system_score_codex":0.000040397234,"about_ca_system_score_gemma":0.00009012786,"threshold_uncertainty_score":0.610807},"labels":[],"label_agreement":null},{"id":"W2153949888","doi":"10.3765/salt.v18i0.2491","title":"Infinitivals With \"too\": Degree Operator Scope and Parasitic Gaps","year":2008,"lang":"en","type":"article","venue":"Proceedings from Semantics and Linguistic Theory","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scope (computer science); Degree (music); Operator (biology); Mathematics; Computer science; Biology; Physics; Programming language; Genetics","score_opus":0.02063778657163893,"score_gpt":0.2253951493498866,"score_spread":0.2047573627782477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153949888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9358009,0.0023899116,0.054830592,0.00014955978,0.00016274847,0.00019986255,0.0000067531896,0.00016833803,0.006291352],"genre_scores_gemma":[0.97008073,0.0005264439,0.028585903,0.00045007514,0.00021359388,0.000010255946,0.0000019015597,0.000019048744,0.00011203571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987581,0.00001602849,0.00020963082,0.00050799875,0.00019345387,0.00031481002],"domain_scores_gemma":[0.9990814,0.00027278395,0.00010028702,0.00015506773,0.00020650825,0.00018400558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002269856,0.00023541761,0.0002895431,0.00007578346,0.00036313044,0.00018784897,0.00029028102,0.00006691097,0.0000071875643],"category_scores_gemma":[0.000537107,0.00017814295,0.000021580388,0.00017453222,0.00029670013,0.00019493075,0.0001453742,0.00018330768,0.000008465833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047124395,0.000058103084,0.011047329,0.000071456074,0.000045828365,0.0001395017,0.00448974,0.0000016731225,0.0014420152,0.979494,0.000046410714,0.003116823],"study_design_scores_gemma":[0.0024030076,0.0009761347,0.0437617,0.0006934547,0.00016115069,0.00089073676,0.000802494,0.005139406,0.011312684,0.92884517,0.0034411037,0.001572946],"about_ca_topic_score_codex":0.000010547877,"about_ca_topic_score_gemma":0.0000011115483,"teacher_disagreement_score":0.050648816,"about_ca_system_score_codex":0.000009808543,"about_ca_system_score_gemma":0.00005127317,"threshold_uncertainty_score":0.72644585},"labels":[],"label_agreement":null},{"id":"W2155406913","doi":"10.1017/s0960129509007543","title":"Boolean and classical restriction categories","year":2009,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Closed category; Two-element Boolean algebra; Complete Boolean algebra; Discrete mathematics; Combinatorics; Pure mathematics; Algebra over a field; Functor","score_opus":0.011636685409425248,"score_gpt":0.2573887304346815,"score_spread":0.24575204502525627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155406913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054167856,0.000051609735,0.9433947,0.001334727,0.00021326034,0.000099764846,1.8431724e-7,0.00011988988,0.00061797816],"genre_scores_gemma":[0.73898274,0.0000049114506,0.26050076,0.00044646082,0.000056407822,0.000001597175,1.333704e-7,0.000001919469,0.0000050846975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839526,0.00002974213,0.00024195247,0.0005359246,0.0004119206,0.0003851934],"domain_scores_gemma":[0.9992221,0.00011362331,0.00005226279,0.00042333294,0.000038909067,0.00014978564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028737145,0.000147008,0.00017890244,0.00017075855,0.00020189257,0.0003554201,0.00094401033,0.000042755466,0.000004468878],"category_scores_gemma":[0.0000837549,0.000109073764,0.000024098916,0.0008214996,0.00041647226,0.00075043784,0.00032447212,0.00018157506,0.000006157268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012945262,0.00002019427,0.00010384059,0.0000041124395,3.7856503e-7,0.000016053986,0.00021971694,0.0001817023,0.00024917594,0.8519017,0.00002738917,0.1472744],"study_design_scores_gemma":[0.000104106206,0.00007168351,0.024981113,0.000009640865,7.353234e-7,0.000087520326,0.000004193686,0.19434896,0.00030180527,0.77991515,0.000056352314,0.00011875668],"about_ca_topic_score_codex":0.0000010729568,"about_ca_topic_score_gemma":7.7413335e-7,"teacher_disagreement_score":0.6848149,"about_ca_system_score_codex":0.00005054836,"about_ca_system_score_gemma":0.000046372752,"threshold_uncertainty_score":0.44478992},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01949970764137757,"score_gpt":0.23566692717985657,"score_spread":0.216167219538479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155437720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26014796,0.017788107,0.39391726,0.1990141,0.0011165495,0.003997485,0.000013362988,0.0004528688,0.1235523],"genre_scores_gemma":[0.9815909,0.00016527984,0.014302377,0.003623084,0.00006453139,0.000036312627,9.3443225e-7,0.000009975501,0.00020659156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981891,0.00025523847,0.00039297002,0.00039210194,0.00047764918,0.0002929364],"domain_scores_gemma":[0.99763674,0.0010465537,0.00028390964,0.0007740992,0.00017037957,0.00008831544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011114136,0.00021970487,0.00038729765,0.00006651633,0.00013428925,0.00004746941,0.0012307535,0.00010704271,0.00006673733],"category_scores_gemma":[0.00047474122,0.000097933895,0.00010393468,0.00031525642,0.0004439328,0.000038285012,0.00046481466,0.0002482696,0.00006247869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008886391,0.00008975525,0.000074909054,0.000015573389,0.000018763127,0.000006086485,0.0010030394,0.00061747216,0.000057964997,0.9780898,0.007010552,0.012927198],"study_design_scores_gemma":[0.0013227666,0.00047781703,0.0007985702,0.00006071308,0.000016227657,0.00004911815,0.00016072718,0.0005468705,0.00059703126,0.97752666,0.018260336,0.00018314454],"about_ca_topic_score_codex":0.000037773574,"about_ca_topic_score_gemma":0.0000031688653,"teacher_disagreement_score":0.72144294,"about_ca_system_score_codex":0.000019055673,"about_ca_system_score_gemma":0.00004884781,"threshold_uncertainty_score":0.39936283},"labels":[],"label_agreement":null},{"id":"W2161335750","doi":"10.1109/ismvl.2003.1201423","title":"On intervals of partial clones of boolean partial functions","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Idempotence; Partial function; Boolean function; Mathematics; Interval (graph theory); Monotonic function; Dual (grammatical number); Combinatorics; Two-element Boolean algebra; Discrete mathematics; Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.020580115366461114,"score_gpt":0.25961823248727073,"score_spread":0.2390381171208096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161335750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20232761,0.000016797145,0.79414827,0.0004501479,0.00027263822,0.00005586484,0.0000015238608,0.000057763125,0.0026693712],"genre_scores_gemma":[0.992595,0.0000023703174,0.006992232,0.00017557327,0.00003811278,0.000004124518,7.1631086e-7,0.0000028698867,0.00018900268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993028,0.000019428297,0.00022365198,0.00016995233,0.00015267849,0.00013149888],"domain_scores_gemma":[0.9994851,0.000046324727,0.000082194885,0.00030323424,0.00004004068,0.00004311643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079834674,0.00007102852,0.00013538598,0.000049265964,0.000032381125,0.000009549284,0.00029992624,0.000028154836,0.00006847938],"category_scores_gemma":[0.000032265274,0.000054183252,0.00007565282,0.00016221924,0.00005929758,0.0001716102,0.00009089534,0.000051733263,0.000046519075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020002386,0.00019795081,0.0001494192,0.00000789589,0.000012438886,0.0000027422238,0.00024316988,0.006858866,0.0030465457,0.98094845,0.00017075457,0.008341743],"study_design_scores_gemma":[0.0018517744,0.0023193257,0.0038949677,0.00009519481,0.000021337162,0.0000132182295,0.00016840002,0.004645474,0.6842769,0.2997034,0.0026343244,0.00037568778],"about_ca_topic_score_codex":0.000023668263,"about_ca_topic_score_gemma":0.000009375725,"teacher_disagreement_score":0.7902674,"about_ca_system_score_codex":0.000010250258,"about_ca_system_score_gemma":0.000028963499,"threshold_uncertainty_score":0.2209529},"labels":[],"label_agreement":null},{"id":"W2163277843","doi":"10.1016/j.jda.2006.10.004","title":"Realizing partitions respecting full and partial order information","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University; Queen's University","funders":"","keywords":"Combinatorics; Extension (predicate logic); Integer (computer science); Mathematics; Interval (graph theory); Order (exchange); Simple (philosophy); Set (abstract data type); Polynomial; Discrete mathematics; Computer science","score_opus":0.009012382437779043,"score_gpt":0.24551526842619206,"score_spread":0.23650288598841301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163277843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019745858,0.00022594968,0.9768106,0.0011307488,0.00022322798,0.000045586705,0.0000022942002,0.000031274507,0.0017844595],"genre_scores_gemma":[0.79209524,0.00006338407,0.20710906,0.00016879784,0.0005187276,0.000002267854,0.0000031856762,0.0000054369903,0.00003386366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904346,0.00003705062,0.00042551573,0.000081780556,0.00023471637,0.00017746305],"domain_scores_gemma":[0.9992331,0.00005628151,0.00035265237,0.00012167654,0.00016678059,0.000069492184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002835531,0.00008376318,0.00013328128,0.000112811234,0.00016163813,0.00018931458,0.00019230323,0.000034297533,0.000005953294],"category_scores_gemma":[0.000069812515,0.00006552218,0.00004829498,0.00026479017,0.000033412693,0.0022866842,0.00006941035,0.00015822671,0.0000051681964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011154289,0.00018206649,0.002221682,0.00006926322,0.00012477415,0.0002561762,0.0032750645,0.020411536,0.0036736312,0.58770865,0.0060570976,0.3759085],"study_design_scores_gemma":[0.005973013,0.0024801996,0.031268008,0.00044259205,0.0001548769,0.004417497,0.0025613222,0.35660252,0.00831715,0.45857117,0.12758079,0.0016308438],"about_ca_topic_score_codex":0.00001598612,"about_ca_topic_score_gemma":0.000004572093,"teacher_disagreement_score":0.7723494,"about_ca_system_score_codex":0.000025749407,"about_ca_system_score_gemma":0.000042183703,"threshold_uncertainty_score":0.26719168},"labels":[],"label_agreement":null},{"id":"W2163436358","doi":"10.1017/s1446788700001592","title":"Congruence Representations of Join-homomorphisms of Finite Distributive Lattices: Size and Breadth","year":2000,"lang":"en","type":"article","venue":"Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Join (topology); Distributive property; Combinatorics; Algebra homomorphism; Lattice (music); Distributive lattice; Discrete mathematics; Pure mathematics; Physics","score_opus":0.016168229905620998,"score_gpt":0.2633546373413618,"score_spread":0.24718640743574077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163436358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09242444,0.0001668156,0.9032304,0.0029506725,0.00009196092,0.00034187498,0.00047790428,0.000015589434,0.00030032784],"genre_scores_gemma":[0.23038866,0.00034086365,0.76843417,0.000055626962,0.000020465874,0.0000022006216,0.0000014318097,0.000009911786,0.0007467127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834853,0.000049171893,0.0008629535,0.00013576155,0.0004089123,0.00019467053],"domain_scores_gemma":[0.9971613,0.0013131452,0.00081339595,0.00032796545,0.0002653864,0.00011879814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039761805,0.00016961843,0.0005221169,0.000014661245,0.00012935755,0.000078151425,0.00046851247,0.000076109725,0.00010552267],"category_scores_gemma":[0.0005624295,0.00010741988,0.00013949373,0.00021255993,0.00064754253,0.00029733113,0.0001313361,0.0002203836,0.00000123295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018137964,0.0002788293,0.00013539587,0.0010132134,0.00019304686,0.000013340086,0.007293879,0.00014793483,0.00051335164,0.9872595,0.00089704257,0.0022363118],"study_design_scores_gemma":[0.00042210266,0.00026470603,0.0014422396,0.00033206365,0.00015064185,0.00031148197,0.001808516,0.008000287,0.00084041763,0.9860061,0.00026026918,0.00016120049],"about_ca_topic_score_codex":0.0000022211564,"about_ca_topic_score_gemma":0.0000012486065,"teacher_disagreement_score":0.1379642,"about_ca_system_score_codex":0.000015302354,"about_ca_system_score_gemma":0.000053485688,"threshold_uncertainty_score":0.43804556},"labels":[],"label_agreement":null},{"id":"W2164268170","doi":"10.1017/s001221730000500x","title":"On the Logic of Adjectives","year":2001,"lang":"fr","type":"article","venue":"Dialogue","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Philosophy; Humanities; Physics","score_opus":0.05384198345160775,"score_gpt":0.26849898635853575,"score_spread":0.21465700290692802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164268170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17359148,0.01188589,0.59491616,0.049124133,0.006304538,0.0006502681,0.00003847867,0.00014765142,0.1633414],"genre_scores_gemma":[0.9929171,0.0003802152,0.0010522061,0.0023378034,0.00022000431,0.000009315501,0.0000021818462,0.0000068295412,0.0030743317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989028,0.00019018033,0.00017423052,0.00026876657,0.00016926638,0.00029474823],"domain_scores_gemma":[0.9985653,0.0007330249,0.000104786806,0.00047788591,0.00006690338,0.000052055875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002206993,0.00013749536,0.00016937744,0.000041321815,0.00011403958,0.000034301487,0.00060682296,0.00007818503,0.0002215975],"category_scores_gemma":[0.0002780067,0.00008976189,0.00009874334,0.0004215855,0.00029246995,0.00018479767,0.00013065262,0.0001863778,0.0003789257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010230335,0.00012944429,0.00021300955,0.000006260391,0.00001159963,0.000037970687,0.0008539231,0.0005195821,0.00011187497,0.9649462,0.0012720429,0.03188785],"study_design_scores_gemma":[0.00020119542,0.0004219808,0.008070418,0.000062029205,0.000009038599,0.000031669355,0.0000876801,0.0023832556,0.0008636192,0.9662812,0.021420732,0.00016722501],"about_ca_topic_score_codex":0.000064267566,"about_ca_topic_score_gemma":0.000032937405,"teacher_disagreement_score":0.8193256,"about_ca_system_score_codex":0.000023263476,"about_ca_system_score_gemma":0.00004638255,"threshold_uncertainty_score":0.48704496},"labels":[],"label_agreement":null},{"id":"W2164275177","doi":"10.37236/786","title":"The MacNeille Completion of the Poset of Partial Injective Functions","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Bijection; Partially ordered set; Mathematics; Injective function; Combinatorics; Lattice (music); Bijection, injection and surjection; Order (exchange); Discrete mathematics","score_opus":0.008656765092015992,"score_gpt":0.2079197260052317,"score_spread":0.19926296091321571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164275177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6789513,0.0034846263,0.31193894,0.003018828,0.0014578298,0.00021923115,0.0000019027624,0.000015634678,0.00091169396],"genre_scores_gemma":[0.999316,0.00041231659,0.000023559616,0.000043668704,0.00004812411,0.0000015944795,1.386947e-7,0.000004772553,0.00014983314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985733,0.00023929836,0.00038223027,0.00007685464,0.00043984715,0.0002884711],"domain_scores_gemma":[0.9982132,0.00035972573,0.0006559507,0.00039620185,0.00034635875,0.00002856167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067381555,0.00009007285,0.00018426492,0.000038876195,0.00046927304,0.000011590914,0.0011939764,0.00003164623,0.000002037743],"category_scores_gemma":[0.000107644155,0.000041544285,0.00016200711,0.00059376314,0.0002273275,0.00015224708,0.00013581164,0.0004884655,0.0000015687328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037093683,0.000097395365,0.0004601757,0.0000021109736,0.000055202527,0.000001032314,0.00043578426,0.00061128347,0.0005217948,0.9967352,0.0004993878,0.0005435089],"study_design_scores_gemma":[0.0010927116,0.0015638096,0.01173396,0.000023502702,0.000054227454,0.00063606806,0.00029380477,0.0019348308,0.012346335,0.96295416,0.007230194,0.00013642195],"about_ca_topic_score_codex":0.000005815148,"about_ca_topic_score_gemma":0.000003221759,"teacher_disagreement_score":0.32036465,"about_ca_system_score_codex":0.00012424051,"about_ca_system_score_gemma":0.00040550198,"threshold_uncertainty_score":0.36093163},"labels":[],"label_agreement":null},{"id":"W2165772977","doi":"10.7202/1024044ar","title":"Complexité dans une langue isolante : exemple du vietnamien","year":2014,"lang":"fr","type":"article","venue":"Nouvelles perspectives en sciences sociales","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Philosophy; Humanities","score_opus":0.04068804989144592,"score_gpt":0.30861708646507957,"score_spread":0.26792903657363365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165772977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16597226,0.009640397,0.65711826,0.045882624,0.003213737,0.0005692683,0.00007839747,0.00050761236,0.117017455],"genre_scores_gemma":[0.95582,0.0006430754,0.036985744,0.00071966136,0.0016452093,0.00001716923,0.0000052180026,0.000029408613,0.004134513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503547,0.001042466,0.00050037086,0.0014061856,0.0008616598,0.0011538587],"domain_scores_gemma":[0.9972911,0.0012820679,0.000342849,0.0005458171,0.00027369088,0.00026450917],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0017317352,0.0005168924,0.0006274413,0.00020149596,0.002176173,0.00053083326,0.002395329,0.00023971293,0.0002099443],"category_scores_gemma":[0.00064567477,0.00047649798,0.00030606598,0.0019001386,0.0063520703,0.0012422896,0.00072545506,0.00041426183,0.00034221186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066412786,0.0002227915,0.0015035857,0.00002647355,0.000031069252,0.000015980859,0.16138095,0.00036745935,0.0006929968,0.8281445,0.0020957831,0.0055118087],"study_design_scores_gemma":[0.001225339,0.0013159727,0.033721216,0.00026298096,0.000080974045,0.00019309405,0.40131968,0.07050926,0.00047424843,0.41761476,0.07131822,0.0019642382],"about_ca_topic_score_codex":0.0031716211,"about_ca_topic_score_gemma":0.002764213,"teacher_disagreement_score":0.78984773,"about_ca_system_score_codex":0.0005145193,"about_ca_system_score_gemma":0.0008138717,"threshold_uncertainty_score":0.9997687},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01729282291372276,"score_gpt":0.24876288116304518,"score_spread":0.23147005824932243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166460071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091859445,0.0005648844,0.8938904,0.00028228923,0.0010095562,0.00043165163,0.000019151446,0.00019313539,0.011749519],"genre_scores_gemma":[0.9915554,0.00051891385,0.0032078817,0.00009623733,0.000076788274,0.000055040113,0.00000392631,0.0000255993,0.0044602477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795115,0.00013903501,0.00061406137,0.0005271828,0.0003931322,0.0003754138],"domain_scores_gemma":[0.99858284,0.00017833669,0.00022106298,0.0006633968,0.00014016124,0.00021419229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019526185,0.0002856679,0.0003580465,0.00023815781,0.00024015814,0.00012693324,0.00039314752,0.00017009085,0.000037833557],"category_scores_gemma":[0.0000043743876,0.0002816253,0.0001257462,0.00047972743,0.0001465048,0.00025658376,0.000008478349,0.00027123414,0.00013001254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025925477,0.003139563,0.0021522916,0.0004089276,0.0006549111,0.00020876907,0.0070674983,0.24346055,0.010406431,0.60003,0.003993293,0.12821852],"study_design_scores_gemma":[0.014314278,0.00787693,0.020354604,0.0030481315,0.0011736515,0.0035768272,0.0025624342,0.5664695,0.047444046,0.097961515,0.2275149,0.0077031767],"about_ca_topic_score_codex":0.00007191818,"about_ca_topic_score_gemma":0.000057600104,"teacher_disagreement_score":0.89969593,"about_ca_system_score_codex":0.000055175744,"about_ca_system_score_gemma":0.000038479084,"threshold_uncertainty_score":0.9999636},"labels":[],"label_agreement":null},{"id":"W2169223887","doi":"10.4153/cmb-2011-002-6","title":"Maximal Sublattices of Finite Distributive Lattices. III: A Conjecture from the 1984 Banff Conference on Graphs and Order","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Distributive property; Combinatorics; Order (exchange); Lattice (music); Distributive lattice; Discrete mathematics; Pure mathematics; Physics","score_opus":0.031115086753448148,"score_gpt":0.21552828173666339,"score_spread":0.18441319498321523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169223887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5838347,0.0010020434,0.29987264,0.029754015,0.00037323489,0.0015534338,0.00072044437,0.00025141073,0.08263806],"genre_scores_gemma":[0.99028915,0.000011994517,0.008475922,0.0010597399,0.000013580093,0.000014113947,0.000008422847,0.00000799032,0.00011908429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988648,0.000072211486,0.00023378932,0.0003245104,0.00016544713,0.00033922595],"domain_scores_gemma":[0.99830616,0.00075251004,0.000106973144,0.00044422346,0.00009013937,0.00029999443],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001622063,0.00018063653,0.0002547199,0.000047574365,0.00013462969,0.000070295035,0.0006522551,0.000093551476,0.002739652],"category_scores_gemma":[0.00025877223,0.00011704766,0.000042503383,0.00019311042,0.00034116305,0.00005971381,0.00009225657,0.00022167302,0.0003447895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113802125,0.000030833395,0.00016289916,0.000015957374,0.000026146514,0.000035446363,0.0017885572,0.0000017150088,0.000006880704,0.9949966,0.00070257863,0.0022209978],"study_design_scores_gemma":[0.00052907853,0.00022602295,0.003839133,0.00013069766,0.00003655838,0.00001190887,0.0003858627,0.0025232255,0.0002529579,0.9850747,0.0066604726,0.00032936572],"about_ca_topic_score_codex":0.0017767752,"about_ca_topic_score_gemma":0.001464984,"teacher_disagreement_score":0.40645444,"about_ca_system_score_codex":0.000020383304,"about_ca_system_score_gemma":0.000118063865,"threshold_uncertainty_score":0.998172},"labels":[],"label_agreement":null},{"id":"W2171665247","doi":"10.1109/nafips.2008.4531270","title":"The Central Role of Discrete Mathematics in the Context of Information Technology and Communications","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Context (archaeology); Computer science; Domain (mathematical analysis); Information technology; Fuzzy logic; Information and Communications Technology; Theoretical computer science; Mathematics; World Wide Web; Artificial intelligence","score_opus":0.011911678303571024,"score_gpt":0.23278518678317453,"score_spread":0.22087350847960352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171665247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37886405,0.0011014208,0.5932549,0.011280282,0.000030201682,0.00047253116,0.000003311091,0.00005683995,0.014936465],"genre_scores_gemma":[0.97424746,0.00019523506,0.02548705,0.000057637382,6.246223e-7,0.0000048344245,4.023413e-7,4.4264232e-7,0.000006337095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996873,0.000017026843,0.00015356476,0.00002368828,0.000055289875,0.00006313431],"domain_scores_gemma":[0.99931014,0.00015019315,0.00007636295,0.00043406972,0.000023638202,0.0000056048184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008712558,0.000026174828,0.000051210787,0.000038882947,0.00007814007,0.0000067463316,0.000680063,0.000016979531,3.6388647e-7],"category_scores_gemma":[0.00003527648,0.000012735634,0.000009357255,0.00022412265,0.00022213052,0.00020106664,0.00015180634,0.00004858004,7.3687215e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.860293e-7,0.000009572229,0.0010434103,0.0000018619234,0.0000011373731,3.4957093e-8,0.0047931233,0.0000031094519,0.00006566532,0.9824512,0.0000063725024,0.011624107],"study_design_scores_gemma":[0.0005153244,0.00014252399,0.032045275,0.000025563124,0.0000044894136,0.00007359371,0.03792342,0.09720888,0.0057518813,0.81957763,0.0066042636,0.00012713825],"about_ca_topic_score_codex":0.00000883534,"about_ca_topic_score_gemma":0.000030316485,"teacher_disagreement_score":0.5953834,"about_ca_system_score_codex":0.000002892349,"about_ca_system_score_gemma":0.000010439769,"threshold_uncertainty_score":0.12637375},"labels":[],"label_agreement":null},{"id":"W2180110214","doi":"10.1023/b:orde.0000034755.82568.09","title":"Obituary: Günter Bruns","year":2003,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Obituary; Mathematics; Combinatorics; Philosophy; Theology","score_opus":0.00879220590819138,"score_gpt":0.22037786065267415,"score_spread":0.21158565474448277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180110214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008172103,0.00015487958,0.9044492,0.0006110604,0.0003656028,0.000050408824,1.7986505e-7,0.00013038202,0.08606614],"genre_scores_gemma":[0.8900671,0.000009740298,0.10102943,0.002522175,0.000038194477,0.000006421051,5.442947e-7,0.000007231694,0.0063191433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948406,0.000022462018,0.00006303439,0.00017953398,0.000079267156,0.00017165308],"domain_scores_gemma":[0.99960214,0.00001924696,0.000017176646,0.00029125114,0.000027938499,0.00004226867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051903986,0.00006328619,0.000059257054,0.000023337812,0.000055096018,0.000036349124,0.00024467666,0.000025371533,0.00022182337],"category_scores_gemma":[0.0000286644,0.00005103716,0.000022276663,0.00022367845,0.000016971806,0.00021725721,0.000041439296,0.000060628758,0.0005957169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3806476e-7,0.000038450387,0.0008402611,0.000002252083,0.0000050635435,0.00001761143,0.00020718634,0.000061070255,0.0003580666,0.98170054,0.0037978217,0.012971036],"study_design_scores_gemma":[0.00048955425,0.00007402793,0.0026332722,0.000007618917,0.0000030746696,0.000055310116,0.000031794305,0.0014160027,0.0029112704,0.17261355,0.8194134,0.0003511128],"about_ca_topic_score_codex":0.0000014725483,"about_ca_topic_score_gemma":0.0000027258927,"teacher_disagreement_score":0.881895,"about_ca_system_score_codex":0.000008052741,"about_ca_system_score_gemma":0.000027532815,"threshold_uncertainty_score":0.76569337},"labels":[],"label_agreement":null},{"id":"W2181843556","doi":"10.1023/a:1010614400132","title":"On the Partially Ordered Semigroup Generated by the Class Operators I,R,H,S,P","year":2001,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Retract; Class (philosophy); Semigroup; Operator (biology); Set (abstract data type); Pure mathematics; Type (biology); Discrete mathematics; Algebra over a field; Combinatorics","score_opus":0.014439054600286253,"score_gpt":0.2309692622574119,"score_spread":0.21653020765712566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181843556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42712113,0.0006411148,0.47676998,0.0654232,0.0011122351,0.00064495107,0.0000050855115,0.0004551856,0.027827134],"genre_scores_gemma":[0.969837,0.000071597984,0.0010960292,0.021656124,0.00015489239,0.000057967747,0.000005061993,0.000017591514,0.007103716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988537,0.00013804546,0.00014721374,0.0003096804,0.00022900569,0.00032236506],"domain_scores_gemma":[0.998972,0.00017144308,0.000048383663,0.00067195145,0.000080198326,0.000056014323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020569764,0.00015331236,0.00010084603,0.000017619615,0.00039681373,0.00018975772,0.00097355887,0.000055379354,0.0003828165],"category_scores_gemma":[0.00008065022,0.00007277574,0.00003672171,0.0006924677,0.000071949464,0.00017255619,0.00013150544,0.00020376524,0.00047983916],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002801595,0.00022403334,0.0005076976,0.0000025684164,0.00006303093,0.00004244907,0.00092857645,0.006814322,0.0069066347,0.55055255,0.38133588,0.052594252],"study_design_scores_gemma":[0.0005114708,0.00015899443,0.000346979,0.000009382067,0.00000791353,0.000030860505,0.00010033851,0.06298639,0.003858419,0.012349431,0.91926426,0.00037556456],"about_ca_topic_score_codex":0.0000152571165,"about_ca_topic_score_gemma":0.000037966387,"teacher_disagreement_score":0.5427159,"about_ca_system_score_codex":0.000019668092,"about_ca_system_score_gemma":0.000047915513,"threshold_uncertainty_score":0.61675215},"labels":[],"label_agreement":null},{"id":"W2186761429","doi":"10.4171/jncg/11-3-9","title":"(Almost) C*-algebras as sheaves with self-action","year":2017,"lang":"en","type":"article","venue":"Journal of Noncommutative Geometry","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Mathematics; Action (physics); Pure mathematics; Algebra over a field","score_opus":0.025396184976277554,"score_gpt":0.32030230025415746,"score_spread":0.2949061152778799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186761429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6768143,0.00029871755,0.3131292,0.001562416,0.0005769335,0.00008729951,0.0000011402051,0.000053122785,0.007476887],"genre_scores_gemma":[0.9086516,0.00007797286,0.09066969,0.0002556698,0.0001949936,0.0000017091868,3.0478338e-7,0.0000115546845,0.0001365035],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99857515,0.000108419306,0.00035773212,0.00019295017,0.0004971168,0.00026864317],"domain_scores_gemma":[0.99732417,0.000238986,0.0012156026,0.000651952,0.00039444995,0.0001748276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005201046,0.00018691698,0.00034585944,0.0002897979,0.0005958141,0.00036652,0.0015817841,0.000063838444,0.00003436635],"category_scores_gemma":[0.00023659703,0.00012872192,0.00011878325,0.0002948354,0.00013364332,0.0027343493,0.00025107551,0.00049748324,0.000053809727],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013143811,0.002833344,0.12631875,0.00025343825,0.0024216713,0.006495578,0.021068117,0.0025719628,0.007957488,0.15790991,0.0037413954,0.66711396],"study_design_scores_gemma":[0.007478374,0.010904829,0.68451595,0.00055415026,0.00019592833,0.008700595,0.0040513054,0.0025404312,0.034886904,0.22647853,0.01809393,0.001599058],"about_ca_topic_score_codex":0.000009046774,"about_ca_topic_score_gemma":0.0000042420256,"teacher_disagreement_score":0.6655149,"about_ca_system_score_codex":0.0001132587,"about_ca_system_score_gemma":0.00018156848,"threshold_uncertainty_score":0.5249127},"labels":[],"label_agreement":null},{"id":"W2187529425","doi":"10.70930/tac/2h6pqka0","title":"Injective hulls of partially ordered monoids","year":2012,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Injective function; Mathematics; Hull; Class (philosophy); Resolution (logic); Order (exchange); Pure mathematics; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence; Materials science; Composite material","score_opus":0.009531774528959841,"score_gpt":0.2525298149527726,"score_spread":0.24299804042381276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187529425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057821598,0.0008754537,0.9381625,0.000048316775,0.000022686536,0.00014159636,0.000003231769,0.000032751108,0.0028918572],"genre_scores_gemma":[0.9943352,0.000036766418,0.0054087355,0.000025893227,0.00003248077,0.00006204729,0.0000016060378,0.0000027765666,0.00009453353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954414,0.00004941493,0.00014012613,0.000097830685,0.000058828107,0.000109649416],"domain_scores_gemma":[0.99934787,0.00017738153,0.00009597504,0.000273322,0.00006619327,0.000039243572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027663587,0.000060980263,0.00011442804,0.00003689261,0.00006652781,0.0000072257217,0.00022825124,0.000027343543,0.00000797655],"category_scores_gemma":[0.000023172568,0.000050815343,0.000020420066,0.00021112848,0.00020525402,0.00029178563,0.000085544714,0.00003797695,0.000003810575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010156816,0.000048678892,0.0003975473,0.000011091213,0.000008350936,1.8523362e-8,0.0011991712,0.000018078137,0.0019225051,0.97083306,0.0000054695256,0.025545865],"study_design_scores_gemma":[0.000085554166,0.000037940867,0.0022164602,0.0000022890601,0.000008571858,0.000002048815,0.0004618927,0.000030097472,0.06355021,0.93230766,0.0012285027,0.000068789326],"about_ca_topic_score_codex":0.0000028797867,"about_ca_topic_score_gemma":5.7080786e-7,"teacher_disagreement_score":0.93651354,"about_ca_system_score_codex":0.000003055424,"about_ca_system_score_gemma":0.000019326812,"threshold_uncertainty_score":0.20721896},"labels":[],"label_agreement":null},{"id":"W21885831","doi":"10.1161/circresaha.111.245969","title":"Ranks of Regular Graphs Under Certain Unary Operations.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Heart, Lung, and Blood Institute","keywords":"Unary operation; Mathematics; Combinatorics","score_opus":0.011095045278237096,"score_gpt":0.23935933002592288,"score_spread":0.2282642847476858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21885831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9382953,0.0009816556,0.05287017,0.0027921128,0.001312099,0.00026288952,0.000001667282,0.00023702103,0.0032471037],"genre_scores_gemma":[0.9825189,0.000026953796,0.016745694,0.00041508756,0.0000074176733,0.000009928851,0.0000028270597,0.000007982146,0.00026517131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900967,0.000067027926,0.00023432307,0.0002698661,0.00021083561,0.0002082758],"domain_scores_gemma":[0.9991566,0.00006425898,0.00005065591,0.0005720011,0.00008633333,0.00007014705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016271333,0.00011854595,0.00016455862,0.00008924399,0.0001145526,0.000035000965,0.00062005036,0.00006524222,0.000025852545],"category_scores_gemma":[0.00002195608,0.00010895087,0.00006962611,0.00042608296,0.00006706768,0.0005069347,0.00013904164,0.000114543574,0.000036755155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026731036,0.000089930654,0.00011916218,0.0000037897687,0.000010878267,0.0000031965853,0.00016707412,0.002580721,0.0015626375,0.9911781,0.00043011364,0.0038517325],"study_design_scores_gemma":[0.00064881745,0.000086438544,0.0023443538,0.0000111057625,0.0000051988713,0.000007467136,0.000028593031,0.010027335,0.00547491,0.9798594,0.0013429188,0.00016346537],"about_ca_topic_score_codex":0.000009153426,"about_ca_topic_score_gemma":0.000005111777,"teacher_disagreement_score":0.044223655,"about_ca_system_score_codex":0.000031636722,"about_ca_system_score_gemma":0.000042937525,"threshold_uncertainty_score":0.44428876},"labels":[],"label_agreement":null},{"id":"W2193617815","doi":"10.1002/malq.201500067","title":"The length of an intersection","year":2017,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Partially ordered set; Infimum and supremum; Cardinality (data modeling); Intersection (aeronautics); Discrete mathematics","score_opus":0.028636140349287027,"score_gpt":0.29710783054218814,"score_spread":0.2684716901929011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193617815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026936842,0.00009974531,0.96048135,0.0008213533,0.00082826294,0.00034269664,0.0000034123707,0.00018427875,0.010302079],"genre_scores_gemma":[0.9571694,0.000006889814,0.042344943,0.0000513818,0.00011998628,0.000054579286,0.0000032303537,0.000011368128,0.00023822667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830204,0.00014221763,0.00047011688,0.0004738674,0.00032193295,0.00028985122],"domain_scores_gemma":[0.9968393,0.00029388937,0.00048451143,0.0021914549,0.0000970853,0.00009379932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006023753,0.00024377913,0.00039548587,0.000047982277,0.0002819089,0.00039086043,0.002709943,0.00020464795,0.000017298222],"category_scores_gemma":[0.0001070143,0.00014296277,0.00018083224,0.000043674358,0.000251293,0.00027202905,0.00041945797,0.00048682498,0.00008166518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005897616,0.00011750521,0.0000014579784,0.00009447269,0.000023952234,0.00001025525,0.0014682431,0.000020082654,0.000046515066,0.87559456,0.0000472758,0.1225698],"study_design_scores_gemma":[0.00009058498,0.000526795,0.00012119933,0.00007988016,0.000011613348,0.000021545828,0.00017719142,0.033305865,0.00008408663,0.96530485,0.000106420615,0.00016997784],"about_ca_topic_score_codex":0.0000053862505,"about_ca_topic_score_gemma":0.000007622979,"teacher_disagreement_score":0.9302325,"about_ca_system_score_codex":0.00003465911,"about_ca_system_score_gemma":0.000050423336,"threshold_uncertainty_score":0.5829853},"labels":[],"label_agreement":null},{"id":"W2201747793","doi":"","title":"Quasi objects in St&#8217;&#225;t&#8217;imcets","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.012961997855305824,"score_gpt":0.2379393187008813,"score_spread":0.22497732084557548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201747793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060712792,0.00050448143,0.7298654,0.00073851645,0.0007906478,0.00032098635,0.0000010134928,0.00047570153,0.20659047],"genre_scores_gemma":[0.94226426,0.000022669725,0.053933296,0.001285387,0.000028171418,0.000015338599,8.972511e-7,0.000009879056,0.0024400905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984049,0.00010751887,0.00025113908,0.0005025846,0.0002419457,0.00049191026],"domain_scores_gemma":[0.9990699,0.00011333545,0.000055314656,0.00059673795,0.00003795274,0.00012673627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026433467,0.00018119786,0.00020869788,0.00014236335,0.000078870355,0.00008264987,0.0006314876,0.00007869865,0.00015713273],"category_scores_gemma":[0.000118569376,0.00015108642,0.00005870689,0.0006860343,0.00003767637,0.00057440606,0.000116829135,0.0001848943,0.0002924235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028734728,0.00026463796,0.002390811,0.000008910199,0.000005461449,0.00010436654,0.0005578952,0.00021514938,0.00035461338,0.98045665,0.0008162457,0.014822399],"study_design_scores_gemma":[0.003936844,0.0010866484,0.018082784,0.000088582194,0.00001031523,0.0002633209,0.00082981086,0.018643694,0.028686464,0.841087,0.08506942,0.00221512],"about_ca_topic_score_codex":0.000022238977,"about_ca_topic_score_gemma":0.00015253153,"teacher_disagreement_score":0.8815515,"about_ca_system_score_codex":0.000054950233,"about_ca_system_score_gemma":0.00008731933,"threshold_uncertainty_score":0.61611253},"labels":[],"label_agreement":null},{"id":"W224043727","doi":"10.1007/978-3-319-06413-0_10","title":"Two More Topics on Congruence Lattices of Lattices","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence (geometry); Pure mathematics; Mathematics; Geometry","score_opus":0.025787916557931674,"score_gpt":0.27571211776699117,"score_spread":0.2499242012090595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W224043727","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012011806,0.00024623895,0.06701907,0.0008207337,0.000466214,0.00014770655,0.00000408743,0.00014476015,0.93103105],"genre_scores_gemma":[0.028954258,0.00012810591,0.043744773,0.0026041847,0.00038375767,0.0000052147225,0.000006546787,0.000030519324,0.92414266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986483,0.000012974135,0.00030587532,0.00048205588,0.00034907626,0.00020173343],"domain_scores_gemma":[0.9984624,0.00020873483,0.00031479017,0.0008266377,0.00010820263,0.000079242396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010529147,0.00027187876,0.00038880674,0.00009818312,0.000052167798,0.000050062856,0.0011243009,0.00014914671,0.00019272623],"category_scores_gemma":[0.000022295982,0.00020908378,0.0001114719,0.00003365114,0.00014162099,0.0001630338,0.00024435038,0.00023777536,0.00015290316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002148827,0.0000063944735,0.000016146292,0.000033921737,0.000015702102,0.000010017796,0.000053963868,0.000064841,0.000007656173,0.9723442,0.00021172724,0.027233284],"study_design_scores_gemma":[0.00045873545,0.00045324446,0.00018475999,0.00036519708,0.000042668937,0.000013996175,0.0000132975965,0.0038064674,0.00090316596,0.57545376,0.41744775,0.00085697026],"about_ca_topic_score_codex":0.000013520977,"about_ca_topic_score_gemma":0.000030910767,"teacher_disagreement_score":0.41723603,"about_ca_system_score_codex":0.00001784866,"about_ca_system_score_gemma":0.000040723095,"threshold_uncertainty_score":0.8526189},"labels":[],"label_agreement":null},{"id":"W2243033668","doi":"10.1007/s11225-015-9641-0","title":"Congruence Lattices of Semilattices with Operators","year":2015,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Semilattice; Mathematics; Congruence lattice problem; Congruence (geometry); Lattice (music); Pure mathematics; Duality (order theory); Distributive lattice; Algebraic number; Algebraic structure; Complete lattice; Discrete mathematics; Combinatorics; Algebra over a field; Distributive property; Mathematical analysis; Physics","score_opus":0.03580985468260145,"score_gpt":0.26926242970924275,"score_spread":0.2334525750266413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243033668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8096556,0.002358505,0.08889605,0.0013000285,0.00048058282,0.0004192455,0.000004997683,0.00034259862,0.09654239],"genre_scores_gemma":[0.9676793,0.000023388482,0.031912718,0.00024161428,0.000026762724,0.00001064254,4.3779906e-7,0.0000037673537,0.0001013486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904907,0.00004439097,0.00015180833,0.0002884692,0.00025816253,0.00020811452],"domain_scores_gemma":[0.9991778,0.00009456029,0.00010719214,0.00033851064,0.00017102686,0.0001109216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001800518,0.00011957153,0.00020345145,0.000035841018,0.00006502962,0.00003802506,0.000645956,0.00003133965,0.000008624025],"category_scores_gemma":[0.00006787114,0.00007293294,0.000022373359,0.00037508254,0.00013957518,0.00040326538,0.00020658333,0.00007680723,0.000029233583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061526865,0.00033453468,0.075290374,0.00004575003,0.00012355405,0.00017238416,0.0057531423,0.0017474989,0.0009473893,0.9059897,0.0015966401,0.007937511],"study_design_scores_gemma":[0.014226158,0.019186841,0.3567812,0.00062187115,0.00032806132,0.00038338007,0.017214984,0.0095501905,0.03574576,0.40597078,0.13381837,0.006172395],"about_ca_topic_score_codex":0.000013567434,"about_ca_topic_score_gemma":0.000017047314,"teacher_disagreement_score":0.5000189,"about_ca_system_score_codex":0.000014245782,"about_ca_system_score_gemma":0.00010914268,"threshold_uncertainty_score":0.2974119},"labels":[],"label_agreement":null},{"id":"W2259734069","doi":"","title":"BILINEAR ALGEBRA: AN INTRODUCTION TO THE ALGEBRAIC THEORY OF QUADRATIC FORMS (Algebra, Logic and Applications 7) By K AZIMIERZ S ZYMICZEK : 486 pp., £55.00, ISBN 90 5699 076 4 (Gordon and Breach Science Publishers, 1997).","year":2000,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Algebra over a field; Quadratic equation; Bilinear interpolation; Pure mathematics","score_opus":0.00726882325767933,"score_gpt":0.222717483660462,"score_spread":0.21544866040278268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259734069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33383626,0.0029615134,0.5313343,0.12545176,0.00022979817,0.003833737,0.000052861098,0.0003446746,0.001955122],"genre_scores_gemma":[0.84948826,0.00051315763,0.1405741,0.006013295,0.00047532958,0.00040281867,0.00002015062,0.000079434474,0.0024334672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706644,0.00020646816,0.00065478054,0.0008383809,0.00071133673,0.00052261725],"domain_scores_gemma":[0.99736935,0.0005341156,0.00028522735,0.0014187983,0.00015995344,0.00023255667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002344077,0.00031796773,0.00045261098,0.000042659383,0.00065270823,0.00029525315,0.0018961328,0.00013640951,0.0003218412],"category_scores_gemma":[0.00032760928,0.00018203339,0.00018555945,0.0009784925,0.0016312255,0.00048594506,0.00059169205,0.00035244095,0.000044959103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003534089,0.00055533706,0.000049692702,0.0002454703,0.000053564225,3.239991e-7,0.0030573178,0.00011796729,0.003893658,0.9004588,0.038903706,0.0526288],"study_design_scores_gemma":[0.0007813805,0.0003865391,0.0005133223,0.00007082677,0.000089114044,0.00009788777,0.0015701047,0.0074649504,0.004633279,0.89179987,0.09200149,0.00059121806],"about_ca_topic_score_codex":0.00001591166,"about_ca_topic_score_gemma":0.0000017185338,"teacher_disagreement_score":0.515652,"about_ca_system_score_codex":0.00005883579,"about_ca_system_score_gemma":0.000078935314,"threshold_uncertainty_score":0.7423106},"labels":[],"label_agreement":null},{"id":"W22606243","doi":"10.1075/la.53.07wur","title":"Syntactic versus semantic control","year":2002,"lang":"de","type":"article","venue":"Linguistik aktuell","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Natural language processing; Computer science; Artificial intelligence; Control (management); Linguistics; Philosophy","score_opus":0.02858207728868352,"score_gpt":0.24980269081536235,"score_spread":0.22122061352667882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22606243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012951005,0.13898629,0.52735823,0.007525498,0.12454139,0.0022774278,0.000091657304,0.0022911506,0.18397734],"genre_scores_gemma":[0.9877737,0.000680534,0.0034972364,0.0009701878,0.0037218553,0.000013051551,0.000003888932,0.000047040226,0.0032924772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657387,0.00019025864,0.0005925248,0.0010311815,0.00056387484,0.001048295],"domain_scores_gemma":[0.9969184,0.0008575229,0.0003166163,0.0012747472,0.00024307091,0.00038968428],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00024785445,0.00051845575,0.00057769427,0.00014384762,0.00040703313,0.00035118163,0.0012775663,0.00023233374,0.0010352001],"category_scores_gemma":[0.0015208106,0.00051923655,0.00026433362,0.0005147267,0.00019117212,0.000215623,0.00023535342,0.00061834336,0.01668756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091681746,0.0033288363,0.0036616137,0.0010278263,0.0018818101,0.009463823,0.00828381,0.005056216,0.0006298084,0.7920692,0.029585842,0.1440944],"study_design_scores_gemma":[0.008590724,0.0013972393,0.00053229555,0.00027759717,0.00063281076,0.000054099386,0.000089224624,0.503231,0.00036553649,0.016177276,0.4667508,0.0019014106],"about_ca_topic_score_codex":0.000044994544,"about_ca_topic_score_gemma":0.0000090100975,"teacher_disagreement_score":0.9748227,"about_ca_system_score_codex":0.00012324932,"about_ca_system_score_gemma":0.00005056327,"threshold_uncertainty_score":0.999878},"labels":[],"label_agreement":null},{"id":"W2268439824","doi":"10.1016/j.apal.2018.02.005","title":"New-from-old full dualities via axiomatisation","year":2018,"lang":"en","type":"preprint","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duality (order theory); Dual (grammatical number); Algebra over a field; Mathematics; French horn; Pure mathematics; Natural (archaeology); Physics; Linguistics","score_opus":0.05508357663907007,"score_gpt":0.29424860470000047,"score_spread":0.2391650280609304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268439824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10327204,0.0020462913,0.88417226,0.0022874519,0.00050247344,0.0004189514,0.000038787566,0.00023004356,0.007031669],"genre_scores_gemma":[0.9387851,0.00035387528,0.057988223,0.0018614044,0.00056945515,0.00003292301,0.00007883263,0.000015662847,0.0003145251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828696,0.000042746495,0.00041151512,0.00066965254,0.00029009697,0.0002990048],"domain_scores_gemma":[0.99852073,0.0001293952,0.00040862794,0.0007160557,0.00009748585,0.00012772891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002148631,0.0003167321,0.0004756968,0.00011000784,0.00008693581,0.000120385135,0.00077489,0.00031409395,0.00007372783],"category_scores_gemma":[0.000021384232,0.0002689864,0.000101514284,0.00013726988,0.00010604046,0.00015639234,0.0010105929,0.0002469873,0.00004280014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004036992,0.00007352747,0.000055165932,0.00018248809,0.00011549437,0.000007745634,0.0020351706,0.00028066212,0.00399715,0.8593176,0.010674633,0.12322002],"study_design_scores_gemma":[0.00014613713,0.00011401322,0.0011163454,0.000050970903,0.00001414681,0.000003615065,0.000058639027,0.0005333378,0.007699628,0.9887173,0.0012199262,0.00032593636],"about_ca_topic_score_codex":0.00006113788,"about_ca_topic_score_gemma":0.000016201151,"teacher_disagreement_score":0.83551306,"about_ca_system_score_codex":0.000006751338,"about_ca_system_score_gemma":0.000057363886,"threshold_uncertainty_score":0.9999762},"labels":[],"label_agreement":null},{"id":"W2270268103","doi":"10.1007/s11083-016-9413-0","title":"On Scattered Convex Geometries","year":2016,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Semilattice; Regular polygon; Convex analysis; Convex set; Convex polytope; Pure mathematics; Axiom; Subderivative; Convex hull; Geometry; Convex optimization","score_opus":0.010557747598862898,"score_gpt":0.22653399423523898,"score_spread":0.21597624663637607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270268103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058034487,0.0000494155,0.92970675,0.0057264077,0.00035965844,0.000048027978,9.596979e-7,0.00013893994,0.0059353574],"genre_scores_gemma":[0.98915106,0.000007580222,0.005064635,0.0018818062,0.00003349986,0.000004794444,2.0601478e-7,0.000004022091,0.0038524228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994904,0.000009951921,0.00006070942,0.00018343514,0.00010282015,0.0001527247],"domain_scores_gemma":[0.9994747,0.0001250814,0.00002318131,0.00030438678,0.00003467579,0.00003795815],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000044381562,0.00006053664,0.00006483969,0.00005791854,0.000046233985,0.000027529342,0.00030780488,0.000022725999,0.00026104262],"category_scores_gemma":[0.000079901176,0.0000338849,0.000017573322,0.00026244984,0.000037174657,0.00020442421,0.000072921066,0.00002798267,0.0015615108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007177496,0.000047739875,0.0010911238,0.000002723463,0.000009269031,0.000016645285,0.000096868294,0.000008016799,0.0026878975,0.66231024,0.0073019746,0.32642034],"study_design_scores_gemma":[0.0020547102,0.00046777385,0.027404236,0.0000739707,0.0000046347454,0.00003204322,0.000017621414,0.00032636835,0.03480921,0.7058742,0.22819397,0.0007412729],"about_ca_topic_score_codex":7.270505e-7,"about_ca_topic_score_gemma":5.7132985e-7,"teacher_disagreement_score":0.9311165,"about_ca_system_score_codex":0.000008147495,"about_ca_system_score_gemma":0.000013722613,"threshold_uncertainty_score":0.9992159},"labels":[],"label_agreement":null},{"id":"W2277156385","doi":"","title":"Valeur informative et fréquences des transactions d'initiés","year":2013,"lang":"fr","type":"article","venue":"Knowledge UdeS (Institutional Deposit of the University of Sherbrooke)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Philosophy","score_opus":0.023295181149163537,"score_gpt":0.22033376091412363,"score_spread":0.1970385797649601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277156385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09487462,0.009098435,0.8514491,0.00087698083,0.0008700097,0.0003342334,0.000020510066,0.00004444183,0.042431705],"genre_scores_gemma":[0.94154733,0.001527884,0.05083513,0.00006884433,0.000030744795,0.000001050503,0.000002622843,0.0000055242795,0.0059808823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862677,0.00018992633,0.00030990076,0.00025840633,0.0003161255,0.00029886255],"domain_scores_gemma":[0.9987818,0.00014767789,0.00015732604,0.00035786268,0.00042090102,0.00013442346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016099976,0.00022692312,0.00028856468,0.00012497374,0.00083311315,0.000049709608,0.0012845957,0.00014715568,0.00027302734],"category_scores_gemma":[0.00003905892,0.00020557853,0.00031226312,0.0005630884,0.002636821,0.0028897712,0.00024526156,0.00030583062,0.00022895119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000644707,0.0012916005,0.0024951813,0.0049126516,0.00048137354,0.00002415552,0.09344672,0.16870266,0.009464984,0.62584126,0.0017580619,0.09151689],"study_design_scores_gemma":[0.0036083362,0.0010201965,0.32994908,0.018022677,0.00065968116,0.0005338553,0.005822812,0.339416,0.096183375,0.11341523,0.08956167,0.0018071014],"about_ca_topic_score_codex":0.0018891601,"about_ca_topic_score_gemma":0.005100077,"teacher_disagreement_score":0.8466727,"about_ca_system_score_codex":0.00045376408,"about_ca_system_score_gemma":0.0003312765,"threshold_uncertainty_score":0.97154766},"labels":[],"label_agreement":null},{"id":"W2284540154","doi":"10.3765/bls.v34i1.3577","title":"A Typological Approach to the Split Scope Readings of Negative Indefinites","year":2008,"lang":"en","type":"article","venue":"Proceedings of the Annual Meeting of the Berkeley Linguistics Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scope (computer science); Linguistics; History; Philosophy; Computer science; Programming language","score_opus":0.023287278728424617,"score_gpt":0.2396596227321302,"score_spread":0.21637234400370559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284540154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8940161,0.00063051144,0.0050582252,0.002299411,0.0011405704,0.0015145892,0.000071241346,0.0001698255,0.09509954],"genre_scores_gemma":[0.89804614,0.00004239493,0.10110535,0.00039840583,0.00020559366,0.000012846441,2.5996007e-7,0.0000138086725,0.00017520408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980429,0.00003652669,0.0005543753,0.00038003633,0.00062463136,0.00036153063],"domain_scores_gemma":[0.9964611,0.00055467593,0.0008640446,0.00040630292,0.0016466303,0.000067278896],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0009915254,0.0002272385,0.0003994865,0.000028711176,0.00049413444,0.00002777291,0.0031650267,0.00012525784,8.5672536e-7],"category_scores_gemma":[0.010578537,0.00011528633,0.0003934259,0.0010274393,0.00078045233,0.00008130179,0.0018278274,0.00042054462,0.0000015151595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072004776,0.00044480606,0.022763113,0.00041498526,0.00018416221,3.0900287e-7,0.06895428,0.0010998092,0.005081575,0.8859972,0.014556432,0.00043136143],"study_design_scores_gemma":[0.00261525,0.0017241859,0.07119096,0.003148478,0.0005361665,0.00014099985,0.029488897,0.017642075,0.3895247,0.46574834,0.01588632,0.0023536216],"about_ca_topic_score_codex":0.000053366664,"about_ca_topic_score_gemma":6.814294e-7,"teacher_disagreement_score":0.42024884,"about_ca_system_score_codex":0.00003935667,"about_ca_system_score_gemma":0.0000893622,"threshold_uncertainty_score":0.99775577},"labels":[],"label_agreement":null},{"id":"W2284742363","doi":"10.4153/cmb-2016-021-x","title":"Normal Extensions of Representations of Abelian Semigroups","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abelian group; Semigroup; Representation (politics); Complete lattice; Set (abstract data type); Lattice (music); Elementary abelian group","score_opus":0.011362196086987247,"score_gpt":0.22770669927610163,"score_spread":0.21634450318911438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284742363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09450964,0.000080138576,0.84555954,0.024629783,0.0001255546,0.00029878996,0.000044294808,0.000074113435,0.034678172],"genre_scores_gemma":[0.95908797,0.000006104229,0.03913485,0.00025278857,0.00001720533,0.000008930028,7.1582025e-7,0.0000065390414,0.0014848995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991006,0.00003198793,0.0002948242,0.00018067336,0.00014530298,0.0002465878],"domain_scores_gemma":[0.99869716,0.00032117942,0.00008335862,0.0005057784,0.00009725283,0.0002952877],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013967359,0.000079700396,0.00017729576,0.00011756908,0.000049476326,0.000007931617,0.00043057083,0.000046631394,0.002205196],"category_scores_gemma":[0.00042468528,0.00005410742,0.000064866144,0.00019719171,0.00013578101,0.000062089384,0.00006416943,0.000046484143,0.0009277857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013848884,0.000037304893,0.00016453816,0.000030889398,0.00000974977,0.00001959917,0.00024289102,0.0000071552777,0.0034980713,0.98435384,0.0059547783,0.0056798104],"study_design_scores_gemma":[0.0013278758,0.0002957307,0.008899466,0.0007427338,0.000041699106,0.00016052043,0.0003088687,0.0014653389,0.026533103,0.8998486,0.059611574,0.00076450297],"about_ca_topic_score_codex":0.00026108674,"about_ca_topic_score_gemma":0.00028359698,"teacher_disagreement_score":0.8645783,"about_ca_system_score_codex":0.00002734481,"about_ca_system_score_gemma":0.00011200493,"threshold_uncertainty_score":0.9998501},"labels":[],"label_agreement":null},{"id":"W2293732238","doi":"","title":"Fuzzy parameterized fuzzy soft lattice implication algebras","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Parameterized complexity; Mathematics; Fuzzy logic; Lattice (music); Pure mathematics; Algebra over a field; Artificial intelligence; Algorithm; Computer science; Physics","score_opus":0.01365426802870272,"score_gpt":0.24429238800740707,"score_spread":0.23063811997870434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293732238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97158945,0.00019332574,0.015625078,0.0020491076,0.0018954318,0.0005903704,0.0000015909429,0.0006704474,0.007385178],"genre_scores_gemma":[0.9819762,0.000014307512,0.016824031,0.0007962447,0.000015680012,0.00014357327,0.0000071066806,0.000018045794,0.00020479009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831533,0.000092314454,0.00031120065,0.00054221513,0.0002734919,0.00046543166],"domain_scores_gemma":[0.998276,0.0002302078,0.00015821718,0.0009911046,0.00015810374,0.00018638848],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017227388,0.00022076661,0.00024232545,0.0000817122,0.00019017949,0.00030861428,0.001075501,0.000108739805,0.00004188434],"category_scores_gemma":[0.00011107582,0.00020261382,0.00008748979,0.0005023407,0.00006378289,0.0015040764,0.0002990838,0.00019691154,0.0012074471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002476196,0.00007837384,0.00036565735,0.0000073912647,0.0000133755,0.0000034823024,0.00013348843,0.000007086383,0.0042089615,0.9774532,0.0011263981,0.016600113],"study_design_scores_gemma":[0.0005967971,0.000099821926,0.010032442,0.0000080152895,0.0000068241434,0.000013056186,0.000019362935,0.0010083419,0.0016409984,0.98516077,0.0011400343,0.00027353351],"about_ca_topic_score_codex":0.000037904596,"about_ca_topic_score_gemma":7.908683e-7,"teacher_disagreement_score":0.016326578,"about_ca_system_score_codex":0.000055357847,"about_ca_system_score_gemma":0.000045348366,"threshold_uncertainty_score":0.99957025},"labels":[],"label_agreement":null},{"id":"W2295001894","doi":"10.5539/jmr.v8n2p37","title":"Standard Ideals in BCL+ Algebras","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ideal (ethics); Mathematics; Radical of an ideal; Maximal ideal; Quotient; Pure mathematics; Minimal ideal; Principal ideal; Discrete mathematics; Combinatorics; Epistemology; Commutative property; Principal ideal ring","score_opus":0.09669757480214107,"score_gpt":0.40258458502941546,"score_spread":0.3058870102272744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295001894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19173455,0.00040814967,0.79919785,0.0055530774,0.0001581844,0.00014051172,0.0000012600187,0.000016888347,0.0027895104],"genre_scores_gemma":[0.8403459,0.00036340987,0.15852194,0.000045294386,0.00010796616,0.0000034214042,2.456964e-8,0.000011421276,0.0006005874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975197,0.0001824893,0.0005483229,0.00012845846,0.001229606,0.00039143994],"domain_scores_gemma":[0.9975712,0.0012450165,0.0001974504,0.0003630857,0.00048235228,0.00014095382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047870884,0.000080391845,0.0002645845,0.00049016904,0.000058161117,0.000088593,0.0011826659,0.00005081745,0.00006670737],"category_scores_gemma":[0.0012385956,0.000043500953,0.00007081641,0.0005070982,0.00008888417,0.00055219996,0.00025895386,0.00033634494,0.00008206032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039056664,0.00035081914,0.0008816171,0.00010285889,0.000031372343,0.00058170134,0.0019991796,0.000028601136,0.016681772,0.85954297,0.004723538,0.115036525],"study_design_scores_gemma":[0.00077842205,0.00038416937,0.00054926716,0.00035268068,0.0000012668573,0.00016770475,0.00018749622,0.00035197058,0.0056188204,0.9883755,0.0031386307,0.00009411224],"about_ca_topic_score_codex":9.585478e-7,"about_ca_topic_score_gemma":0.000004385034,"teacher_disagreement_score":0.64861137,"about_ca_system_score_codex":0.00015443366,"about_ca_system_score_gemma":0.00021241937,"threshold_uncertainty_score":0.21977073},"labels":[],"label_agreement":null},{"id":"W2295568785","doi":"10.1080/00927872.2017.1404073","title":"Finitely additive, modular, and probability functions on pre-Semirings","year":2017,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Semiring; Dedekind cut; Modular design; Finitely-generated abelian group; Bottleneck; Algebra over a field","score_opus":0.05424614788522338,"score_gpt":0.31250610247223304,"score_spread":0.2582599545870097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295568785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60177666,0.0016030363,0.29425174,0.01775062,0.0004949629,0.0014596792,0.000048259844,0.0006196216,0.08199546],"genre_scores_gemma":[0.9474565,0.00024059835,0.05156186,0.00023162892,0.000013626445,0.00014176992,0.00000922875,0.0000069681882,0.00033786727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99902713,0.000108492,0.00021131049,0.00034979143,0.00011091847,0.00019237115],"domain_scores_gemma":[0.9944365,0.00034617065,0.0001372945,0.0049488754,0.000064255146,0.000066883695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027475835,0.00012346808,0.00013833663,0.0000936359,0.00093089323,0.00023159444,0.0027517555,0.00006283927,0.000011406068],"category_scores_gemma":[0.0004701034,0.00011956957,0.000036130736,0.00014763,0.000398181,0.00070631446,0.0016150554,0.0003290839,0.00004763216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007988425,0.00029221113,0.007908594,0.000008832875,0.000010020449,0.0000019646827,0.000557628,0.00012271652,0.000058027534,0.8049415,0.00026236282,0.18582815],"study_design_scores_gemma":[0.00053609203,0.00011676037,0.4897176,0.000085940046,0.0000059399426,0.000008811885,0.00003587312,0.029887179,0.00017931132,0.45642707,0.022680916,0.00031852734],"about_ca_topic_score_codex":0.000024815674,"about_ca_topic_score_gemma":0.000111706344,"teacher_disagreement_score":0.481809,"about_ca_system_score_codex":0.00004883774,"about_ca_system_score_gemma":0.000036634894,"threshold_uncertainty_score":0.71597725},"labels":[],"label_agreement":null},{"id":"W2298489343","doi":"10.1007/978-3-319-74772-9_7","title":"Absorption and directed Jónsson terms","year":2018,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Congruence (geometry); Distributive property; Mathematics; Pure mathematics; Variety (cybernetics); Modular design; Computer science","score_opus":0.019521090365918998,"score_gpt":0.27545286914429107,"score_spread":0.2559317787783721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298489343","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011185642,0.00065494265,0.82770747,0.0021992812,0.0008308223,0.0006594522,0.0002741953,0.0010151729,0.16654679],"genre_scores_gemma":[0.30511573,0.00084752997,0.042543005,0.0027590357,0.001945573,0.00014749268,0.00038642017,0.00014827607,0.64610696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980407,0.000031986947,0.00035531988,0.0008084829,0.00028772734,0.0004758302],"domain_scores_gemma":[0.9984991,0.00014551374,0.00021906878,0.00059746485,0.00028465426,0.00025422958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028391808,0.00040596892,0.00047048563,0.00032442986,0.0004188193,0.00025484271,0.0005245411,0.00035254384,0.00022450912],"category_scores_gemma":[0.00019897961,0.0003544943,0.00012146303,0.00014658923,0.0001363053,0.00027070596,0.0004074257,0.0003155033,0.00056428113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010225129,0.000010678591,0.0000110113215,0.000009301469,0.00003267295,0.00002848222,0.00011987763,0.0000054131688,0.00030083559,0.99273676,0.0032884087,0.0034463396],"study_design_scores_gemma":[0.00044156107,0.00032779085,0.00018781633,0.00022192641,0.000052568732,0.00006150773,0.0000051696697,0.0008389625,0.00014608102,0.81389654,0.1831172,0.0007028667],"about_ca_topic_score_codex":0.0000024292194,"about_ca_topic_score_gemma":0.000011771226,"teacher_disagreement_score":0.7851645,"about_ca_system_score_codex":0.00041646254,"about_ca_system_score_gemma":0.0000532773,"threshold_uncertainty_score":0.9998907},"labels":[],"label_agreement":null},{"id":"W2301598257","doi":"","title":"Free semigroup algebras and the structure of an isometric tuple","year":2011,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isometric exercise; Semigroup; Tuple; Mathematics; Pure mathematics; Algebra over a field; Discrete mathematics; Medicine; Physical therapy","score_opus":0.007197504714369088,"score_gpt":0.18481852420075107,"score_spread":0.17762101948638198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301598257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978512,0.00044700847,0.0008133623,0.00012186961,0.0002020315,0.00020534692,0.00003453217,0.000042342755,0.0002822919],"genre_scores_gemma":[0.8920078,0.00028047123,0.024758754,0.00004148811,0.00004113762,1.6492102e-7,0.0001409694,0.000023643583,0.08270552],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896544,0.00008350673,0.00011845309,0.00038094632,0.00025504586,0.00019659483],"domain_scores_gemma":[0.9985902,0.00006752797,0.00035054228,0.00078204396,0.00013195052,0.00007776754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010465222,0.00020162541,0.0004093169,0.0003453363,0.00015429944,0.00002111655,0.0016302085,0.00021266584,0.00006858434],"category_scores_gemma":[0.000023902376,0.0001619583,0.00010740727,0.0005346739,0.00019827487,0.00053263636,0.00025194898,0.00023216229,0.0000028985298],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088890496,0.00025524758,0.0008819723,0.00090887037,0.00045872162,0.000111645495,0.6386675,0.00007046521,0.013556782,0.286339,0.0008902334,0.05697065],"study_design_scores_gemma":[0.013885831,0.0019944035,0.08266934,0.00050080597,0.000900639,0.000096855336,0.28442633,0.0066150674,0.04194285,0.56341887,0.00086573546,0.0026832777],"about_ca_topic_score_codex":0.010000889,"about_ca_topic_score_gemma":0.018590631,"teacher_disagreement_score":0.35424116,"about_ca_system_score_codex":0.00001419841,"about_ca_system_score_gemma":0.0000423793,"threshold_uncertainty_score":0.9993175},"labels":[],"label_agreement":null},{"id":"W2314560663","doi":"10.1017/bsl.2015.2","title":"EXISTENTIAL-IMPORT MATHEMATICS","year":2015,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Predicate (mathematical logic); Existentialism; Mathematics; Combinatorics; Discrete mathematics; Philosophy; Computer science; Epistemology","score_opus":0.043026343687145516,"score_gpt":0.25823345334294057,"score_spread":0.21520710965579504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314560663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039315075,0.0009839992,0.53036314,0.006987748,0.0009959338,0.0004976637,0.0000034559055,0.00063162047,0.42022133],"genre_scores_gemma":[0.7572657,0.000038771956,0.23867919,0.0009888522,0.000119652635,0.000017855544,0.0000024274734,0.000014444217,0.0028731378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987611,0.00003432848,0.00034110915,0.0002699063,0.00032707784,0.00026643975],"domain_scores_gemma":[0.99889815,0.000058063943,0.00018662258,0.00058984413,0.00011655051,0.00015079824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035326413,0.00014366033,0.00027540076,0.00007276438,0.000038379574,0.000031343836,0.00082730106,0.00006908069,0.00013195633],"category_scores_gemma":[0.00013926289,0.00011390971,0.000084354986,0.00019899177,0.000084494764,0.000049092898,0.00029137853,0.00009067473,0.00051522144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004409296,0.00024460547,0.00017564565,0.000043679658,0.000017302043,0.000048683403,0.00089836743,0.00012155824,0.00021119685,0.9740359,0.020655243,0.0035434135],"study_design_scores_gemma":[0.0012139311,0.00046787455,0.00079524657,0.0000604189,0.000023705048,0.0002666873,0.0004722823,0.0017930532,0.002356021,0.65459126,0.33736378,0.00059574307],"about_ca_topic_score_codex":0.000018422827,"about_ca_topic_score_gemma":5.215474e-7,"teacher_disagreement_score":0.7179506,"about_ca_system_score_codex":0.000021630549,"about_ca_system_score_gemma":0.00005402431,"threshold_uncertainty_score":0.6622301},"labels":[],"label_agreement":null},{"id":"W2314865747","doi":"10.14288/1.0105458","title":"Grammar and logic","year":2011,"lang":"en","type":"article","venue":"Open Collections","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linguistics; Computer science; Grammar; Natural language processing; Artificial intelligence; Philosophy","score_opus":0.05283192079682913,"score_gpt":0.2565411772594102,"score_spread":0.2037092564625811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314865747","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008489922,0.000032185875,0.3152511,0.00012646943,0.00015101682,0.0001579232,7.1659093e-7,0.000065535845,0.68413013],"genre_scores_gemma":[0.18634444,0.000080349724,0.4935392,0.0012504632,0.000051410632,0.00016949305,0.0000010530623,0.0000113692095,0.3185522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958533,0.000020704552,0.00006278318,0.00018267424,0.00003791916,0.0001106053],"domain_scores_gemma":[0.9996839,0.000020703514,0.000021448806,0.00020076864,0.000020658292,0.000052532207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058806116,0.000049753784,0.0000626751,0.000024037829,0.0009854293,0.000446961,0.00044499018,0.000020685438,0.0001728831],"category_scores_gemma":[0.00001481951,0.00004229277,0.000013216311,0.0005212025,0.00002856327,0.00032912602,0.00034061188,0.000050641433,0.000017346365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009725076,0.0001690535,0.00016596403,0.000003031579,0.000020108748,0.000025598927,0.00082137255,0.0000080757545,0.000062374485,0.89947844,0.07939077,0.019845458],"study_design_scores_gemma":[0.00032130364,0.00019998213,0.0013574398,0.0000040210593,0.000005027272,0.00008565968,0.00007751911,0.001260077,0.00037034095,0.9314815,0.06465918,0.00017794645],"about_ca_topic_score_codex":0.00059494434,"about_ca_topic_score_gemma":0.00022395939,"teacher_disagreement_score":0.36557797,"about_ca_system_score_codex":0.000010398649,"about_ca_system_score_gemma":0.000026294574,"threshold_uncertainty_score":0.7579225},"labels":[],"label_agreement":null},{"id":"W2317113105","doi":"10.1093/logcom/exu039","title":"Special Issue on Computational Logic in Honour of Roy Dyckhoff","year":2014,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Honour; Computer science; Law; Political science","score_opus":0.017813274070820458,"score_gpt":0.271086813178269,"score_spread":0.25327353910744854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317113105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07883133,0.00007743781,0.91560507,0.0011433428,0.0005371536,0.00006685564,5.063009e-7,0.000011154418,0.003727171],"genre_scores_gemma":[0.9378136,0.000018145094,0.06036331,0.0005200778,0.0012575503,4.9765197e-7,0.0000012807645,0.0000032524458,0.000022318067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988442,0.00014567251,0.0004583581,0.00014943286,0.00027726468,0.00012506038],"domain_scores_gemma":[0.99896824,0.00029868906,0.00045635112,0.0000649479,0.00015424097,0.000057531935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047772186,0.00010448923,0.00026153316,0.00021574799,0.00005334723,0.000034954443,0.0002252202,0.000052011193,0.000010239645],"category_scores_gemma":[0.000083285275,0.000081391474,0.00005634629,0.00022627517,0.00004628455,0.0002634309,0.000045995697,0.00019128957,0.000008049798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006877208,0.00021538454,0.0010413904,0.000020952984,0.000012447355,0.0000354492,0.00060913194,0.46688554,0.00004059296,0.24061756,0.0009829921,0.2894698],"study_design_scores_gemma":[0.0013627784,0.001441318,0.059084024,0.00008009367,0.000006877587,0.00014974298,0.00010528676,0.18905249,0.00005815037,0.7469979,0.0014973211,0.0001640455],"about_ca_topic_score_codex":0.0000015227034,"about_ca_topic_score_gemma":8.793872e-7,"teacher_disagreement_score":0.85898226,"about_ca_system_score_codex":0.00002955531,"about_ca_system_score_gemma":0.000036562386,"threshold_uncertainty_score":0.3319048},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03318852489675269,"score_gpt":0.21989547538887455,"score_spread":0.18670695049212185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318083694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6270701,0.0005959566,0.3551544,0.0007130466,0.0010212148,0.00027061076,0.000018687324,0.00004080808,0.015115157],"genre_scores_gemma":[0.9429577,0.000009025245,0.0567978,0.00012427922,0.00001535911,0.0000011493813,6.6105457e-7,0.000008564432,0.000085471795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987779,0.00004646261,0.0005420473,0.00012577616,0.00016355432,0.0003442384],"domain_scores_gemma":[0.99868834,0.000121753175,0.00035222268,0.00026059008,0.00018808537,0.00038902753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041858896,0.00013644352,0.0002753471,0.00019782587,0.00010405972,0.00009537779,0.00081797974,0.00009641297,0.00008778896],"category_scores_gemma":[0.0003818954,0.00011546229,0.00009388513,0.00029700724,0.0001850073,0.0004703017,0.000035160363,0.0003371859,0.000028857801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054854704,0.00010639625,0.012040481,0.00004438499,0.000076260214,0.0023948052,0.046345536,0.000111788046,0.00002005727,0.93500876,0.0005019932,0.0033440748],"study_design_scores_gemma":[0.00057681755,0.00029871071,0.020195171,0.0001893397,0.000022499202,0.0008077548,0.0019075384,0.0035930818,0.0006880247,0.9705251,0.0008669526,0.00032900408],"about_ca_topic_score_codex":0.00048230265,"about_ca_topic_score_gemma":0.0038328273,"teacher_disagreement_score":0.31588757,"about_ca_system_score_codex":0.0001258903,"about_ca_system_score_gemma":0.00083146914,"threshold_uncertainty_score":0.47084153},"labels":[],"label_agreement":null},{"id":"W2326765045","doi":"10.1142/9789814436700_0008","title":"Some properties of ℂ* in ℂ<sup>2</sup>","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.019747304640157223,"score_gpt":0.21118147295635079,"score_spread":0.19143416831619356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2326765045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97031415,0.0003478108,0.02548945,0.000898352,0.000041468676,0.00015934597,6.907547e-8,0.00008160338,0.002667753],"genre_scores_gemma":[0.9872356,0.000009586502,0.01153859,0.00032588825,0.00001835302,0.000015051795,6.59669e-8,0.0000021367616,0.00085472804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949133,0.000016060587,0.00012893463,0.00013478448,0.00008803317,0.00014085067],"domain_scores_gemma":[0.9996884,0.000012398342,0.000021273203,0.00022380325,0.000026909513,0.000027251863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044943576,0.000054004853,0.00009116419,0.00005369508,0.0000137842,0.000021639627,0.0003624322,0.000021403197,0.000044115837],"category_scores_gemma":[0.00001491439,0.000035034234,0.00001953481,0.00014361592,0.00003123973,0.0007476538,0.0001232516,0.000044677814,0.00015323471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029583912,0.00016965691,0.004080435,0.000047205063,0.000007509127,0.000005657953,0.0026650673,0.003916659,0.019057214,0.91855687,0.0007760416,0.050714754],"study_design_scores_gemma":[0.0008509097,0.00024082862,0.016551642,0.00008495396,0.0000018897073,0.000011997651,0.0006214072,0.4214978,0.11593321,0.44257855,0.0011141784,0.000512639],"about_ca_topic_score_codex":0.00007621748,"about_ca_topic_score_gemma":0.000002591219,"teacher_disagreement_score":0.47597829,"about_ca_system_score_codex":0.000007925142,"about_ca_system_score_gemma":0.000015634405,"threshold_uncertainty_score":0.19695732},"labels":[],"label_agreement":null},{"id":"W2342920329","doi":"10.1112/s0010437x18007078","title":"Lattice structure of Weyl groups via representation theory of preprojective algebras","year":2018,"lang":"en","type":"article","venue":"Compositio Mathematica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Japan Society for the Promotion of Science; Canada Research Chairs; Norges Forskningsråd; Natural Sciences and Engineering Research Council of Canada; Universität Bielefeld; National Science Foundation","keywords":"Indecomposable module; Bijection, injection and surjection; Quiver; Representation theory; Algebraically closed field; Lattice (music); Congruence relation; Weyl group; Algebraic structure","score_opus":0.017643768298942722,"score_gpt":0.27752623731285786,"score_spread":0.25988246901391515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342920329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2924891,0.000034478453,0.7038669,0.000045858418,0.00008229028,0.0002091005,0.000004281304,0.000056317815,0.0032116456],"genre_scores_gemma":[0.858812,0.0000012210603,0.14103927,0.000052480555,0.00004625844,0.0000049083997,0.0000026392086,0.000007790011,0.00003348448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988174,0.00013256523,0.00035280728,0.0002985707,0.00024411974,0.00015453172],"domain_scores_gemma":[0.99831533,0.00038588405,0.00030766576,0.0007180129,0.00023142419,0.00004165203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016664236,0.00012614664,0.00027181525,0.000088212684,0.00007515516,0.000019521663,0.00056352,0.000054709802,0.00008458485],"category_scores_gemma":[0.00008104384,0.00010398521,0.00007060117,0.00035758573,0.0002454249,0.00034109954,0.00020565955,0.00008019744,0.000021289075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029425606,0.00011659657,0.00007704326,0.00010658388,0.00004711533,0.000001980121,0.00605315,0.00001553209,0.10220197,0.8880613,0.000032468637,0.0032568525],"study_design_scores_gemma":[0.00017478256,0.00017484874,0.0013340724,0.00005726396,0.000020100768,0.000029643474,0.00013841088,0.005460741,0.23649573,0.75601625,0.000003578343,0.0000945761],"about_ca_topic_score_codex":0.000002438204,"about_ca_topic_score_gemma":0.000001032688,"teacher_disagreement_score":0.5663228,"about_ca_system_score_codex":0.000017282973,"about_ca_system_score_gemma":0.00002352057,"threshold_uncertainty_score":0.4240394},"labels":[],"label_agreement":null},{"id":"W2371342601","doi":"","title":"Notes for the Cardinal Number of Set","year":2002,"lang":"en","type":"article","venue":"Journal of Jiaying University","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cardinal number (linguistics); Regular cardinal; Mathematics; Set (abstract data type); Combinatorics; Discrete mathematics; Mathematical economics; Philosophy; Computer science","score_opus":0.04452374984763393,"score_gpt":0.25113534146672695,"score_spread":0.206611591619093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371342601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14168721,0.00012634172,0.85579455,0.0011007936,0.00023138347,0.000039341838,0.0000022468569,0.0000075034777,0.0010106337],"genre_scores_gemma":[0.97712547,0.0000355728,0.02259843,0.00003997506,0.000048471877,1.5798085e-8,3.2729567e-8,0.0000013001168,0.00015071486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964035,0.000023181705,0.00008666062,0.00005200962,0.00011610431,0.000081725084],"domain_scores_gemma":[0.999245,0.00030091562,0.00018159539,0.00011008531,0.0001316331,0.00003081018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015398039,0.00003918492,0.000099082994,0.000033247175,0.00012033075,0.000010603099,0.00045282635,0.000018727436,0.00001622057],"category_scores_gemma":[0.000044388893,0.000027260434,0.00011657272,0.00013052134,0.000034855966,0.00030230486,0.000060481394,0.00008464226,0.000002288666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039373094,0.0005480965,0.13089323,0.00016456784,0.0009665436,0.00065537065,0.016303804,0.02048841,0.005921993,0.5486133,0.024259634,0.2507913],"study_design_scores_gemma":[0.015766535,0.0026673463,0.13372245,0.0005175079,0.0009830092,0.003932173,0.010720281,0.2556516,0.012257332,0.10851589,0.45333895,0.0019269132],"about_ca_topic_score_codex":0.0000038254925,"about_ca_topic_score_gemma":8.410619e-7,"teacher_disagreement_score":0.83543825,"about_ca_system_score_codex":0.000026785863,"about_ca_system_score_gemma":0.000014541305,"threshold_uncertainty_score":0.11116482},"labels":[],"label_agreement":null},{"id":"W2396071362","doi":"","title":"Symmetric f Bi-Derivations Of Lattices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.012724656036076804,"score_gpt":0.24564460520084191,"score_spread":0.2329199491647651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396071362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.978158,0.00007601924,0.0097545395,0.00045927183,0.003204381,0.000108842854,0.0000011015921,0.0001567611,0.008081076],"genre_scores_gemma":[0.98573846,0.000005669152,0.014045205,0.00009365555,0.000006787311,0.0000061714354,0.0000010258216,0.00000550236,0.000097503915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992672,0.000018265699,0.0001724054,0.00019616635,0.00017672061,0.00016922396],"domain_scores_gemma":[0.99903727,0.00015994687,0.00010287502,0.0005335981,0.00010062488,0.00006569158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013308531,0.00008217432,0.00012280334,0.00015373976,0.00007742239,0.000031947664,0.00069168577,0.000056112603,0.000022218206],"category_scores_gemma":[0.00016085262,0.00007536305,0.000043768086,0.001052705,0.00005264859,0.0003568577,0.00015470268,0.00017674478,0.000049315837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.364744e-7,0.00006391219,0.0021852818,0.00000439538,0.0000047218264,0.0000019280687,0.00006645193,0.000005298926,0.0033918766,0.9893973,0.00014894936,0.00472946],"study_design_scores_gemma":[0.00029787785,0.00005601408,0.014489519,0.000004016748,0.000003860711,0.0000052692913,0.000006568276,0.0017198189,0.0060458677,0.97477144,0.002477969,0.00012176913],"about_ca_topic_score_codex":0.000008422075,"about_ca_topic_score_gemma":0.0000025971804,"teacher_disagreement_score":0.014625839,"about_ca_system_score_codex":0.000007688405,"about_ca_system_score_gemma":0.00003944199,"threshold_uncertainty_score":0.3073216},"labels":[],"label_agreement":null},{"id":"W2396662119","doi":"","title":"Intuitionistic Fuzzy Subcoalgebras of Coalgebras.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fuzzy logic; Algebra over a field; Pure mathematics; Mathematics education; Artificial intelligence; Computer science","score_opus":0.013955107225797106,"score_gpt":0.2432670885372798,"score_spread":0.2293119813114827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396662119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9404281,0.0011293443,0.03876337,0.00029976715,0.004903864,0.00025986717,0.0000036477377,0.0003556743,0.013856385],"genre_scores_gemma":[0.99545646,0.00001749877,0.0041978816,0.00018128351,0.000020349056,0.000015300011,0.000004423291,0.000012551877,0.00009425157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862325,0.000076764154,0.00030434373,0.0002420117,0.00029891878,0.0004547065],"domain_scores_gemma":[0.99876803,0.00017294395,0.00015662574,0.00061948353,0.000097526536,0.00018538904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002873109,0.00016571653,0.00024700214,0.000096456046,0.00012545551,0.000039255174,0.00073808566,0.00007973099,0.00003959153],"category_scores_gemma":[0.00010880434,0.00015693791,0.00008410159,0.00048874354,0.00010647525,0.00078022503,0.00026167184,0.00015274079,0.00019472983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030092513,0.00016525415,0.0070761894,0.000015218879,0.00001198192,0.000002863882,0.00024889995,0.000004307895,0.00047568788,0.9894107,0.0005273356,0.0020585405],"study_design_scores_gemma":[0.00041011523,0.00010593113,0.014992553,0.000014725862,0.000009299724,0.000014559824,0.000024147856,0.00012571955,0.004662197,0.9785704,0.0008626287,0.00020775002],"about_ca_topic_score_codex":0.000008196269,"about_ca_topic_score_gemma":6.6735475e-7,"teacher_disagreement_score":0.055028383,"about_ca_system_score_codex":0.00004509589,"about_ca_system_score_gemma":0.00004719031,"threshold_uncertainty_score":0.63997424},"labels":[],"label_agreement":null},{"id":"W2396894320","doi":"","title":"Paving matroids of arbitrary cardinality.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Cardinality (data modeling); Mathematics; Combinatorics; Graphic matroid; Discrete mathematics; Computer science; Data mining","score_opus":0.010330089763355196,"score_gpt":0.2404665559055575,"score_spread":0.2301364661422023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396894320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9681964,0.0005539153,0.016373383,0.0006691875,0.0011540545,0.00012188519,9.597259e-7,0.00023408579,0.01269612],"genre_scores_gemma":[0.9904986,0.000010763256,0.009122856,0.00029084118,0.0000075716016,0.0000019448719,8.578283e-7,0.0000040405926,0.000062517276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999072,0.000045012526,0.00020517301,0.00024055658,0.00021098077,0.00022626152],"domain_scores_gemma":[0.9992304,0.00005287712,0.000085776264,0.00050779403,0.000052886535,0.00007028295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001632825,0.00010884928,0.00019830323,0.000055509725,0.000062915424,0.000029458275,0.0006224539,0.0000467897,0.000005266849],"category_scores_gemma":[0.000026989263,0.0001023009,0.00008655119,0.00032801603,0.00003038562,0.0003679209,0.00009108829,0.00012035457,0.00001649912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022921045,0.00005562192,0.0011093363,0.000005167235,0.000005580585,0.000015284477,0.00011794231,0.000013705272,0.0012422838,0.9903712,0.0001825385,0.0068790363],"study_design_scores_gemma":[0.00027126365,0.0001652277,0.012876364,0.00001507711,0.000003978914,0.000013830264,0.000011925552,0.00042183168,0.0034271393,0.98226106,0.0004050909,0.00012720354],"about_ca_topic_score_codex":0.0000052879095,"about_ca_topic_score_gemma":1.4545077e-7,"teacher_disagreement_score":0.0223022,"about_ca_system_score_codex":0.00002293822,"about_ca_system_score_gemma":0.000033092987,"threshold_uncertainty_score":0.41717097},"labels":[],"label_agreement":null},{"id":"W2397387574","doi":"","title":"Harmonious Colorings of Digraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024477302310895392,"score_gpt":0.24380402907164606,"score_spread":0.21932672676075066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397387574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97674716,0.00042026283,0.0056284103,0.000392851,0.0017494854,0.00013696584,8.286285e-7,0.0002261086,0.014697926],"genre_scores_gemma":[0.9959617,0.000008616723,0.003776888,0.00010316649,0.0000025695645,0.000007663089,5.943663e-7,0.000005604548,0.00013314515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916625,0.000029063687,0.0001634014,0.0002098843,0.00023282116,0.00019856302],"domain_scores_gemma":[0.999209,0.00005008081,0.000089957044,0.0004039533,0.000114954986,0.00013209622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001624356,0.00009385989,0.00015700556,0.000062878215,0.000036488374,0.000026200269,0.00065511564,0.000041296113,0.000002417356],"category_scores_gemma":[0.0000592034,0.000085664324,0.000047123347,0.00040212384,0.000054473,0.0003232068,0.00019537873,0.00008475683,0.000036781297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039654446,0.000058827263,0.0018800391,0.0000035562903,0.000006507969,0.000010651649,0.00026161928,0.000018521487,0.00022079068,0.9953381,0.00082980265,0.0013676209],"study_design_scores_gemma":[0.000653065,0.00021663854,0.0018522565,0.000006945835,0.0000030530248,0.000006939545,0.000030091194,0.0003802576,0.005261414,0.98683894,0.004627229,0.00012320047],"about_ca_topic_score_codex":0.000014851298,"about_ca_topic_score_gemma":6.8628816e-7,"teacher_disagreement_score":0.019214591,"about_ca_system_score_codex":0.000025928473,"about_ca_system_score_gemma":0.00005725634,"threshold_uncertainty_score":0.34932896},"labels":[],"label_agreement":null},{"id":"W2397664079","doi":"","title":"Bijections between bicoloured ordered trees and non-crossing partitions.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bijection, injection and surjection; Mathematics; Combinatorics; Bijection","score_opus":0.01333053937269513,"score_gpt":0.24812950793528507,"score_spread":0.23479896856258994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397664079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92025834,0.00007796792,0.07651213,0.0008423987,0.0008581462,0.00011802295,0.0000015941139,0.00023107031,0.001100316],"genre_scores_gemma":[0.9940937,0.0000057937864,0.005634118,0.00012836342,0.000021627593,0.000016128643,0.0000029440457,0.000008418814,0.00008890949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990654,0.00006659628,0.00017287715,0.0003127542,0.00012480991,0.0002575458],"domain_scores_gemma":[0.9991941,0.00020516542,0.00007189846,0.00035932267,0.00005553905,0.0001139829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017998899,0.00012357313,0.0001851041,0.00008492588,0.0006129057,0.00029305049,0.0002942639,0.000064336265,0.0000049013],"category_scores_gemma":[0.00009854503,0.000116125324,0.00003982727,0.00041420702,0.000120082914,0.00041373566,0.00014661526,0.00012629555,0.00003200616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002627649,0.00009452049,0.033352993,0.000010268741,0.000028203125,0.0000039534657,0.00061380165,0.00008304076,0.0012596255,0.9273724,0.0009676991,0.036210846],"study_design_scores_gemma":[0.00065377145,0.00014494146,0.122195415,0.00001551906,0.0000113545675,0.0000053882327,0.000018495784,0.004525267,0.00081822684,0.86740506,0.0040044575,0.00020213157],"about_ca_topic_score_codex":0.000017116756,"about_ca_topic_score_gemma":0.0000125368715,"teacher_disagreement_score":0.08884242,"about_ca_system_score_codex":0.000020988482,"about_ca_system_score_gemma":0.000034856144,"threshold_uncertainty_score":0.4735453},"labels":[],"label_agreement":null},{"id":"W2397891452","doi":"","title":"On Generalized Triple Derivations On Lattices.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field; Arithmetic","score_opus":0.01589216652166819,"score_gpt":0.24939015376566492,"score_spread":0.23349798724399673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397891452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9078856,0.000038003378,0.060450293,0.0023950725,0.0047358605,0.0002585372,0.000001226971,0.0005105774,0.023724806],"genre_scores_gemma":[0.99257785,0.0000039416645,0.0047287527,0.0021476038,0.000014801227,0.00001948288,0.00000312748,0.000009505278,0.0004949282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990109,0.00008413635,0.00014734437,0.00031240605,0.00021629258,0.00022890393],"domain_scores_gemma":[0.99896604,0.00023046501,0.000071458235,0.0006054609,0.000041259453,0.00008529161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015387125,0.00012575694,0.000140412,0.00007618022,0.00017840581,0.00007324822,0.00056468794,0.000050322342,0.000022939857],"category_scores_gemma":[0.00015770298,0.00010963406,0.000051027797,0.00030414076,0.000024191138,0.00019709961,0.00007891436,0.00012606378,0.00031277933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044023627,0.00008314413,0.0000615946,0.0000017032665,0.00000448701,0.0000019001478,0.000055233577,0.0002699932,0.000133932,0.9935545,0.0020586115,0.0037705223],"study_design_scores_gemma":[0.00093971414,0.00025182604,0.0012735217,0.000009212357,0.0000024906203,0.0000011338382,0.000001731064,0.010101001,0.0012968171,0.9762587,0.009710148,0.00015371157],"about_ca_topic_score_codex":0.0000039320275,"about_ca_topic_score_gemma":0.0000010771042,"teacher_disagreement_score":0.08469223,"about_ca_system_score_codex":0.000033232634,"about_ca_system_score_gemma":0.000018362105,"threshold_uncertainty_score":0.4470747},"labels":[],"label_agreement":null},{"id":"W2398261455","doi":"","title":"External Difference Families from Lines.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009811967081191527,"score_gpt":0.22997194961560655,"score_spread":0.22015998253441502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398261455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9674044,0.00010845469,0.02533915,0.0001907759,0.0056708097,0.0000636548,0.000002073011,0.00022350565,0.0009971679],"genre_scores_gemma":[0.9824819,0.000018523026,0.01696823,0.00026193773,0.00003542228,0.000009887907,0.0000019857368,0.000007817258,0.00021431783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897313,0.000024779536,0.00016124513,0.00036450932,0.00022405316,0.00025227442],"domain_scores_gemma":[0.9989376,0.00014665231,0.000066659326,0.0006700979,0.00006673212,0.000112281035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006931392,0.00014770073,0.00015481599,0.000048895337,0.000113938375,0.00011499668,0.0011223626,0.000079792226,0.00003730795],"category_scores_gemma":[0.00007605555,0.00012562353,0.00005145687,0.00020380432,0.00006797791,0.0003043187,0.00029301434,0.00032748544,0.00014854356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021746228,0.000056088105,0.0070401346,0.000001426364,0.000004342484,0.000017830977,0.0001898007,0.0000022060756,0.02640424,0.9398733,0.000089548135,0.026318932],"study_design_scores_gemma":[0.00033780743,0.000035179775,0.07444985,0.000007868902,0.0000024073363,0.0000043660334,0.000008415698,0.0019443186,0.0060948352,0.9159307,0.0010086788,0.00017559875],"about_ca_topic_score_codex":0.00006192095,"about_ca_topic_score_gemma":0.000018836925,"teacher_disagreement_score":0.06740972,"about_ca_system_score_codex":0.000010122955,"about_ca_system_score_gemma":0.000034335288,"threshold_uncertainty_score":0.5122779},"labels":[],"label_agreement":null},{"id":"W2398491961","doi":"","title":"Excluded-Minor Characterization For The Class Of Cographic Splitting Matroids.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Minor (academic); Characterization (materials science); Class (philosophy); Combinatorics; Humanities; Computer science; Artificial intelligence; Materials science; Art; Nanotechnology","score_opus":0.011211617749145478,"score_gpt":0.23165340505296272,"score_spread":0.22044178730381725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398491961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55212206,0.00006695132,0.4445364,0.00070456683,0.0017931609,0.00034949905,0.0000024669719,0.0001102574,0.0003146759],"genre_scores_gemma":[0.9970644,0.00001106057,0.0025761463,0.00021358124,0.00002124262,0.00003908138,0.0000059665813,0.000009216471,0.000059319358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991438,0.00004922603,0.00022184633,0.00022353021,0.00015467856,0.0002069192],"domain_scores_gemma":[0.99882364,0.0003838447,0.0001893385,0.00046004768,0.00010478959,0.000038316084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003688515,0.000103570426,0.00015183406,0.00005364903,0.00016454629,0.000050046332,0.00064804737,0.000046795976,0.0000023060234],"category_scores_gemma":[0.00010255313,0.00007608552,0.00008076101,0.00031242715,0.000056558958,0.00024195266,0.00011538435,0.00007638925,0.000005672833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044210224,0.000028725197,0.0010695292,0.000018539738,0.00000935805,1.6736432e-7,0.000120669014,0.000012988777,0.009138056,0.9734777,0.000034621928,0.01608518],"study_design_scores_gemma":[0.00095960236,0.00026038665,0.025487311,0.000030073028,0.000019872277,0.0000039801694,0.000023815124,0.062445197,0.009964005,0.8938578,0.0067235483,0.00022444247],"about_ca_topic_score_codex":0.0000023815965,"about_ca_topic_score_gemma":5.180811e-7,"teacher_disagreement_score":0.44494236,"about_ca_system_score_codex":0.000009704494,"about_ca_system_score_gemma":0.000015605945,"threshold_uncertainty_score":0.31026772},"labels":[],"label_agreement":null},{"id":"W2399492755","doi":"","title":"Two Families of Lattices.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.024665106425442125,"score_gpt":0.24643902442717572,"score_spread":0.2217739180017336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399492755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.933589,0.0002751733,0.008383071,0.00004845486,0.0018687197,0.00010416594,7.192673e-7,0.0001860942,0.05554461],"genre_scores_gemma":[0.98356915,0.000015836258,0.016238995,0.00008069723,0.0000026257253,0.0000041017797,3.0534343e-7,0.0000046891414,0.0000835889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993406,0.000027545548,0.00015006936,0.0001834933,0.00013267147,0.0001656213],"domain_scores_gemma":[0.9993327,0.000047489,0.00008184808,0.0004306488,0.000057772122,0.00004954153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009907441,0.00008294655,0.00013039293,0.00005317165,0.000041324452,0.000010629187,0.00064775895,0.000027162134,0.00002231373],"category_scores_gemma":[0.0000231432,0.00007303477,0.00004146209,0.00025272422,0.000059430946,0.0003295008,0.0001763027,0.00006852319,0.00005243178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019572665,0.000059748276,0.0027596673,0.0000050325184,0.000006397192,0.000006206968,0.0007498096,0.0000021871797,0.00021630674,0.9922658,0.00005832863,0.0038685433],"study_design_scores_gemma":[0.00038094918,0.00009048827,0.0076826965,0.0000075673547,0.0000035063042,0.0000028203785,0.000049047758,0.0003587102,0.008448911,0.98253787,0.000333088,0.00010437849],"about_ca_topic_score_codex":0.00003466723,"about_ca_topic_score_gemma":0.0000023977937,"teacher_disagreement_score":0.055461023,"about_ca_system_score_codex":0.000008932544,"about_ca_system_score_gemma":0.000022407208,"threshold_uncertainty_score":0.29782715},"labels":[],"label_agreement":null},{"id":"W2400468285","doi":"","title":"The Product Summation over all Ordered Partitions.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Summation by parts; Product (mathematics); Pure mathematics; Geometry","score_opus":0.013340868101993504,"score_gpt":0.25343239747405943,"score_spread":0.24009152937206593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400468285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9229853,0.0018118244,0.019615984,0.033468492,0.0068797073,0.0010012806,0.0000018611538,0.0011049074,0.01313065],"genre_scores_gemma":[0.99798954,0.000043282376,0.0010761446,0.0006139255,0.000013667034,0.000012372927,0.0000029662456,0.0000034487207,0.00024464892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915355,0.00005262159,0.00014709037,0.00022991351,0.00018488146,0.00023191143],"domain_scores_gemma":[0.9992168,0.00007043133,0.00006469089,0.000536066,0.00006374201,0.000048250316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017980713,0.000089937945,0.00007547045,0.000023045259,0.00026639743,0.00014169155,0.00050349004,0.000024439087,0.000005886792],"category_scores_gemma":[0.0000738199,0.00006349502,0.00003456815,0.00026997912,0.000028715083,0.0004483641,0.000053557997,0.00009582382,0.0000729441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021770395,0.00004362233,0.00010052736,7.996622e-7,0.0000039401148,0.0000024019103,0.00008493577,0.00003512149,0.0002228295,0.97692597,0.004823891,0.017753791],"study_design_scores_gemma":[0.00023327777,0.00006762319,0.010491144,0.0000037204293,0.0000023964053,0.000003146579,0.0000047350863,0.0013238752,0.0008466237,0.9576523,0.029271796,0.00009940561],"about_ca_topic_score_codex":0.0000023944738,"about_ca_topic_score_gemma":0.0000023180116,"teacher_disagreement_score":0.07500425,"about_ca_system_score_codex":0.00002807294,"about_ca_system_score_gemma":0.000026559606,"threshold_uncertainty_score":0.25892517},"labels":[],"label_agreement":null},{"id":"W2400955467","doi":"","title":"Note On A q-Operator Identity.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Operator (biology); Identity (music); Pure mathematics; Algebra over a field; Physics","score_opus":0.014094636068635678,"score_gpt":0.2673753278533206,"score_spread":0.2532806917846849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400955467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9381284,0.0004216917,0.037627887,0.0007904798,0.010385104,0.000223526,0.0000012305579,0.0004839457,0.011937737],"genre_scores_gemma":[0.9955277,0.000007509112,0.0032299277,0.0009756395,0.000030928975,0.000012117723,7.691789e-7,0.000009124014,0.00020630022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989559,0.00004882824,0.00012940906,0.00022110366,0.00026069864,0.00038406212],"domain_scores_gemma":[0.9991596,0.00007348705,0.000046277666,0.0005190859,0.000037536407,0.00016403044],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020136272,0.00012523682,0.00012446071,0.000059053582,0.00013674304,0.00009190579,0.0006672628,0.000053943015,0.00002608343],"category_scores_gemma":[0.00006121346,0.00011001834,0.00005159911,0.00032297953,0.000024465693,0.001499968,0.0001997939,0.00014714806,0.0011596058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018659752,0.00010859928,0.0011239944,0.0000023354423,0.0000037416553,0.0000052520554,0.00023553916,0.000005658733,0.00030766203,0.99500227,0.00068796886,0.0025151123],"study_design_scores_gemma":[0.000639728,0.00016303515,0.010231812,0.000014815167,0.000004972987,0.000012355453,0.000012605999,0.00053241703,0.0045197876,0.9676723,0.015865231,0.000330962],"about_ca_topic_score_codex":0.000003550723,"about_ca_topic_score_gemma":7.278718e-7,"teacher_disagreement_score":0.057399288,"about_ca_system_score_codex":0.000052011714,"about_ca_system_score_gemma":0.000022970982,"threshold_uncertainty_score":0.9996181},"labels":[],"label_agreement":null},{"id":"W2401001014","doi":"","title":"On (α, β)-generalized derivations on lattices.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.02266963460637845,"score_gpt":0.2653473540960075,"score_spread":0.24267771948962907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401001014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.969291,0.00012710712,0.00808933,0.0011717551,0.0044751205,0.00017126219,0.0000011306363,0.0003384642,0.016334843],"genre_scores_gemma":[0.99415016,0.0000060915395,0.0037936182,0.0016849149,0.000020962943,0.000019736235,0.000002767926,0.000009440759,0.00031232391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990539,0.000056613546,0.00012997136,0.00021071377,0.00021654967,0.00033227433],"domain_scores_gemma":[0.99907345,0.00018189,0.000062055144,0.0005207467,0.000032253898,0.0001295884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013548111,0.00012578403,0.00011708738,0.00007069262,0.00016399841,0.000049764,0.000462665,0.000050153696,0.000035507466],"category_scores_gemma":[0.00007887273,0.00010863276,0.000047091427,0.00030505485,0.000023010247,0.00043015875,0.000089757246,0.00012934634,0.00052110973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031587851,0.00015863552,0.00044225817,0.0000015478976,0.0000059064823,0.0000017726787,0.00014353641,0.0000720292,0.000134013,0.99568737,0.0016217852,0.0017280001],"study_design_scores_gemma":[0.00060698204,0.00013890774,0.0056100693,0.000010457777,0.0000036110978,0.0000025510856,0.000005372264,0.00071025646,0.0022230411,0.9834826,0.007009759,0.00019639079],"about_ca_topic_score_codex":0.0000027144572,"about_ca_topic_score_gemma":3.3263228e-7,"teacher_disagreement_score":0.024859155,"about_ca_system_score_codex":0.000044084143,"about_ca_system_score_gemma":0.000016528797,"threshold_uncertainty_score":0.6697985},"labels":[],"label_agreement":null},{"id":"W2401335725","doi":"","title":"On Steiner Quasigroups of Cardinality 21.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cardinality (data modeling); Steiner tree problem; Discrete mathematics; Combinatorics; Computer science; Database","score_opus":0.01652467190206451,"score_gpt":0.2523126097934455,"score_spread":0.23578793789138097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401335725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97785974,0.00040450817,0.011933681,0.00015342991,0.002631138,0.00010639907,0.0000013203037,0.000110331894,0.0067994683],"genre_scores_gemma":[0.99808645,0.0000038940893,0.0016501443,0.00014214472,0.000013172253,0.0000066985563,9.442886e-7,0.0000062872114,0.00009028965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990112,0.00007979363,0.00017411704,0.00018844889,0.0002546041,0.00029179384],"domain_scores_gemma":[0.9990454,0.00011760116,0.00009005853,0.0005835841,0.00005349596,0.00010988018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924203,0.00011357787,0.00019476013,0.000045953337,0.00005590037,0.000014715521,0.00047620895,0.000050847375,0.000012277723],"category_scores_gemma":[0.0000627281,0.000095653406,0.00007620465,0.00025601833,0.00003937898,0.00038318415,0.00013889815,0.00011404312,0.00007405674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046147748,0.00015250419,0.0038692758,0.000007184474,0.000009526947,0.0000016978083,0.00021384691,0.000009719428,0.0004721399,0.9926634,0.0004395314,0.00215658],"study_design_scores_gemma":[0.00050535187,0.00022844065,0.020873867,0.000014148034,0.000006591491,0.0000046312393,0.00002253307,0.00018061184,0.0099226525,0.96667004,0.0013747379,0.00019641458],"about_ca_topic_score_codex":0.000009625953,"about_ca_topic_score_gemma":2.7751744e-7,"teacher_disagreement_score":0.025993358,"about_ca_system_score_codex":0.00003314602,"about_ca_system_score_gemma":0.000016374825,"threshold_uncertainty_score":0.39006326},"labels":[],"label_agreement":null},{"id":"W2401374150","doi":"","title":"Generalized F-nomial matrix and factorizations","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Chemistry","score_opus":0.010298628891245422,"score_gpt":0.24008368884521344,"score_spread":0.22978505995396803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401374150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691036,0.00024019145,0.02714672,0.00077379507,0.0015903977,0.00020965083,9.082587e-7,0.00021573735,0.000719002],"genre_scores_gemma":[0.98792565,0.000020438569,0.011342035,0.0001231576,0.000011342323,0.000024467145,0.0000022738254,0.0000065705544,0.00054406316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993172,0.00003244343,0.00012513134,0.00022827006,0.00010583612,0.00019111428],"domain_scores_gemma":[0.9994659,0.000050938095,0.000044110737,0.00028442565,0.000054616456,0.00010001937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041281404,0.000098327015,0.00011187706,0.000045117387,0.00013301113,0.0001481084,0.00031747253,0.000046349436,0.00004968376],"category_scores_gemma":[0.00002680575,0.00008682285,0.000025221063,0.00019165814,0.000031728654,0.0005706345,0.00016344027,0.00007206067,0.00013425344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.2655338e-7,0.000017753615,0.0011026536,0.0000018642403,0.000004349691,0.0000014714269,0.00010326644,0.000013002319,0.0011522544,0.99489075,0.00091473944,0.0017974465],"study_design_scores_gemma":[0.00055442285,0.000042922093,0.0073363315,0.0000025671736,0.0000026239775,0.0000056609183,0.000008524858,0.0045879306,0.00049685227,0.9842249,0.0025826269,0.00015461788],"about_ca_topic_score_codex":0.00002782076,"about_ca_topic_score_gemma":6.4961546e-7,"teacher_disagreement_score":0.018822053,"about_ca_system_score_codex":0.000018071418,"about_ca_system_score_gemma":0.000021056858,"threshold_uncertainty_score":0.35405332},"labels":[],"label_agreement":null},{"id":"W2402705223","doi":"","title":"Construction and enumeration of a special class of transitive relations.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Transitive relation; Mathematics; Class (philosophy); Combinatorics; Pure mathematics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.005668462557410665,"score_gpt":0.20513138739459802,"score_spread":0.19946292483718736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402705223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7871093,0.000031828677,0.20789313,0.00018852338,0.0008114673,0.00008950208,0.0000011613533,0.000022611735,0.0038524368],"genre_scores_gemma":[0.99076533,0.0000045773513,0.009183465,0.000018275676,0.000013692457,0.0000015750492,0.0000011189933,0.0000018857226,0.00001008774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953556,0.00005112285,0.00014672404,0.000115520386,0.00009347883,0.00005761171],"domain_scores_gemma":[0.99960756,0.0000827095,0.00009580143,0.000119246346,0.00007324247,0.000021461243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010229329,0.000046977373,0.00010531049,0.000044407032,0.000039664585,0.000007815029,0.000079399295,0.000036036094,0.000005024993],"category_scores_gemma":[0.00003798723,0.000046433248,0.000020171856,0.0001433725,0.00008104808,0.00023772288,0.000019181962,0.000047812995,0.0000018553105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004177464,0.000016141103,0.00083163654,0.00000470993,0.000003957192,1.6298077e-7,0.00047908604,0.000026900236,0.0016892378,0.9817046,0.000025132607,0.015214276],"study_design_scores_gemma":[0.0005345879,0.00014537599,0.0076245097,0.000011772904,0.000005826235,0.0000048370043,0.00003827475,0.0058358503,0.009447417,0.9759078,0.00038123722,0.00006248089],"about_ca_topic_score_codex":0.0000028463937,"about_ca_topic_score_gemma":0.000001418648,"teacher_disagreement_score":0.20365599,"about_ca_system_score_codex":0.0000084969415,"about_ca_system_score_gemma":0.000016693166,"threshold_uncertainty_score":0.1893493},"labels":[],"label_agreement":null},{"id":"W2402757052","doi":"","title":"Lattice of all subsets of a finite set and partition lattice of a n-set.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lattice (music); Partition (number theory); Combinatorics; Discrete mathematics; Physics","score_opus":0.031041110975455997,"score_gpt":0.2733207220177396,"score_spread":0.2422796110422836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402757052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963994,0.00048883416,0.002035127,0.00009462907,0.00041186827,0.000102821934,0.000008455261,0.000024503945,0.00043434696],"genre_scores_gemma":[0.9960724,0.000038829327,0.0037865522,0.00006650962,0.0000048924485,0.000004682063,0.0000038561584,0.0000056378317,0.000016636046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990753,0.00008045395,0.0002804506,0.00015317593,0.00019612488,0.0002145098],"domain_scores_gemma":[0.99889296,0.00033228128,0.00024282196,0.0003463908,0.00010330711,0.00008221328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031880455,0.00009920186,0.00023142097,0.000060735172,0.000025073214,0.0000073232127,0.00026658043,0.000058135414,0.000008236351],"category_scores_gemma":[0.0001061937,0.0000927965,0.000041681214,0.0002590292,0.00008735978,0.0004741082,0.00015119009,0.00007772615,0.000006618711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001506005,0.00017203597,0.014411431,0.00010108057,0.000027008586,0.0000018885918,0.0022016033,0.000017457282,0.0019573297,0.9801889,0.00010565684,0.00080051314],"study_design_scores_gemma":[0.0017284902,0.00048568085,0.06332481,0.000117047624,0.000070883994,0.00001554827,0.00015235691,0.003704862,0.03590589,0.89296085,0.0012144909,0.00031910732],"about_ca_topic_score_codex":0.00001702045,"about_ca_topic_score_gemma":0.0000016862804,"teacher_disagreement_score":0.087228104,"about_ca_system_score_codex":0.000009190155,"about_ca_system_score_gemma":0.00001936947,"threshold_uncertainty_score":0.37841314},"labels":[],"label_agreement":null},{"id":"W2402929509","doi":"","title":"Direct Sum, Direct Product and Lexicographic Product of Lattices.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Direct product; Product (mathematics); Pure mathematics; Combinatorics; Geometry","score_opus":0.022893666161611287,"score_gpt":0.23203053641903418,"score_spread":0.2091368702574229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402929509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96919006,0.0034520486,0.0002086471,0.00016282572,0.001909294,0.0004206817,0.0000021255726,0.0003217297,0.024332576],"genre_scores_gemma":[0.9957441,0.000122042075,0.0038866135,0.000041026844,0.000011767484,0.000018707695,9.752387e-7,0.000013880001,0.00016086275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848306,0.00009586002,0.00025603414,0.00062137336,0.00022663017,0.00031703245],"domain_scores_gemma":[0.9987224,0.000075196935,0.00016370896,0.0008194056,0.000116507515,0.000102800775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003715692,0.00019442511,0.0003098635,0.0001435288,0.000102971484,0.000033470402,0.00062847807,0.000038687554,0.000009866609],"category_scores_gemma":[0.000121905585,0.0001665147,0.000063711,0.00071001664,0.00017536778,0.0005556663,0.00025569348,0.00012766533,0.000009999118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021917273,0.00041115552,0.047125172,0.00009588557,0.000070088994,0.000024769002,0.0017215823,0.000002729473,0.0021637315,0.9301348,0.00037229672,0.017855914],"study_design_scores_gemma":[0.0009914415,0.0005276617,0.13486527,0.00008011445,0.000047968475,0.00002814396,0.000029619985,0.00020629402,0.121355414,0.7383931,0.0027763546,0.0006986162],"about_ca_topic_score_codex":0.000047889578,"about_ca_topic_score_gemma":0.000005457826,"teacher_disagreement_score":0.19174166,"about_ca_system_score_codex":0.000010819019,"about_ca_system_score_gemma":0.000039949424,"threshold_uncertainty_score":0.6790272},"labels":[],"label_agreement":null},{"id":"W2403566370","doi":"","title":"On Self-Clique Graphs all of whose Cliques have Equal Size.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Clique; Mathematics; Clique-sum; Combinatorics; Chordal graph; Graph; 1-planar graph","score_opus":0.014987467703344,"score_gpt":0.26678409195421765,"score_spread":0.2517966242508736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403566370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98819584,0.00033059056,0.0032706463,0.00029497,0.0022078315,0.00022739683,0.0000020924226,0.0003593785,0.0051112697],"genre_scores_gemma":[0.9930832,0.000035763434,0.0060572024,0.0007072487,0.000013413421,0.000015562688,0.0000015121957,0.000014088233,0.0000720469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985269,0.00014010261,0.0002849762,0.00029088784,0.00029488615,0.00046228894],"domain_scores_gemma":[0.99839693,0.00053912273,0.00016614592,0.00062953634,0.00008760959,0.00018062872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036097816,0.00019465161,0.00025828433,0.000079682126,0.00006904486,0.000028998056,0.00070968445,0.000110881185,0.000014237263],"category_scores_gemma":[0.00013857325,0.00017187561,0.000109611916,0.00022498186,0.00005286209,0.0005827624,0.0002166389,0.00020993955,0.00004844113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095229825,0.0003776525,0.0021104533,0.000011450814,0.00002393143,0.0000070271963,0.00094587245,0.000005590049,0.00028401357,0.9948482,0.00062579167,0.00075050764],"study_design_scores_gemma":[0.00051384495,0.00039601285,0.0037886363,0.000020590373,0.000008812708,0.000006877108,0.000020467334,0.00025675527,0.008523238,0.9850495,0.001185859,0.00022942656],"about_ca_topic_score_codex":0.000015811844,"about_ca_topic_score_gemma":0.0000016129827,"teacher_disagreement_score":0.009798707,"about_ca_system_score_codex":0.000044105233,"about_ca_system_score_gemma":0.000036065103,"threshold_uncertainty_score":0.7008884},"labels":[],"label_agreement":null},{"id":"W2404584973","doi":"","title":"Lattices generated by orbits of subspaces in t-singular spaces.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear subspace; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.020365878687000273,"score_gpt":0.25142102293650426,"score_spread":0.231055144249504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404584973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99396086,0.002069992,0.0014225021,0.00038301584,0.0009338892,0.00009756582,9.26014e-7,0.00008174895,0.0010494957],"genre_scores_gemma":[0.9958976,0.000025875579,0.003830734,0.00007664134,0.000004256254,0.0000050258823,0.0000030534268,0.00000808042,0.00014874645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989059,0.000086048545,0.00020865754,0.00028160462,0.00026527132,0.00025249485],"domain_scores_gemma":[0.99921846,0.000058347174,0.00012593492,0.00036129492,0.00012082788,0.0001151482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002844856,0.00012879419,0.00021980687,0.000090934416,0.0000309976,0.00005662584,0.00058192486,0.00006927232,0.000003696155],"category_scores_gemma":[0.0000887313,0.00011765548,0.000026650558,0.00068196724,0.000056050158,0.00046378307,0.00014810526,0.0001111248,0.000019101042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010860446,0.00023535125,0.016099945,0.00001645442,0.000015348982,0.000043159842,0.0013868483,0.00027457505,0.0045051407,0.9709927,0.0041674804,0.0022521499],"study_design_scores_gemma":[0.0024064835,0.00033455793,0.0022644242,0.000050493367,0.000008176815,0.0000091564,0.00018446983,0.014396965,0.05013266,0.922893,0.0068490966,0.00047054572],"about_ca_topic_score_codex":0.00007206735,"about_ca_topic_score_gemma":0.000013424109,"teacher_disagreement_score":0.04809971,"about_ca_system_score_codex":0.000041024177,"about_ca_system_score_gemma":0.00007821648,"threshold_uncertainty_score":0.4797851},"labels":[],"label_agreement":null},{"id":"W2404748425","doi":"","title":"On f-derivations of lattice implication algebras.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lattice (music); Pure mathematics; Algebra over a field; Physics","score_opus":0.011419804889278708,"score_gpt":0.2413103506083579,"score_spread":0.2298905457190792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404748425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9664344,0.0000329501,0.026532378,0.0013622205,0.00055317685,0.00024290675,9.0446537e-7,0.0001473113,0.004693751],"genre_scores_gemma":[0.9942642,0.0000040974264,0.0053092847,0.00029804904,0.0000031116074,0.000039047034,0.0000026872194,0.0000056243525,0.00007389191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929404,0.000027758415,0.00017205233,0.00020523739,0.00015103603,0.0001498552],"domain_scores_gemma":[0.9990294,0.00016395007,0.00010051394,0.00053217774,0.00011984782,0.000054135307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006417813,0.00008245522,0.00010269626,0.000060793387,0.00007267546,0.00004477516,0.0004894306,0.000039324063,0.000046247478],"category_scores_gemma":[0.00007436343,0.00007507373,0.000034309618,0.00034432302,0.000031035386,0.0005699179,0.00008920521,0.000077187055,0.00020812209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.156901e-7,0.00006655482,0.00018405545,0.0000034122545,0.000004284227,2.4857732e-7,0.00007809649,0.000027789129,0.0019036086,0.99298567,0.0008711445,0.0038746533],"study_design_scores_gemma":[0.00020005983,0.00008979569,0.015089886,0.0000068028917,0.0000018736972,0.000001261065,0.000009798457,0.001642295,0.0056596454,0.97702783,0.00018573247,0.00008502027],"about_ca_topic_score_codex":0.000015765167,"about_ca_topic_score_gemma":3.0418823e-7,"teacher_disagreement_score":0.027829805,"about_ca_system_score_codex":0.000021269008,"about_ca_system_score_gemma":0.000021215426,"threshold_uncertainty_score":0.30614176},"labels":[],"label_agreement":null},{"id":"W2404826996","doi":"","title":"All the Shortest Single Axioms for Boolean SQS-Skeins.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Axiom; Discrete mathematics; Geometry","score_opus":0.029226244380587033,"score_gpt":0.25986434110058365,"score_spread":0.23063809671999663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404826996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5964042,0.0026980008,0.35795018,0.008000172,0.020160006,0.0017209249,0.000010014386,0.0011300405,0.011926468],"genre_scores_gemma":[0.99504554,0.0000062938884,0.003340848,0.0012476147,0.000060600833,0.000050100076,0.000004097791,0.000015954198,0.00022897491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987753,0.000044193985,0.00018068858,0.0002543607,0.00019843342,0.0005470056],"domain_scores_gemma":[0.99879473,0.00026408653,0.00008014038,0.00066311064,0.00005864003,0.00013931053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003311289,0.00015809858,0.00014729516,0.00003473933,0.00021825396,0.000100110236,0.00096854987,0.000060644146,0.000008688252],"category_scores_gemma":[0.000080981765,0.000111236695,0.00009253549,0.00022024913,0.00006333475,0.0006154778,0.00022142251,0.00012575871,0.00008453464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029528928,0.00016177354,0.00047814744,0.0000034645038,0.000013429418,0.0000012926705,0.0005347922,0.0000099462295,0.0005967276,0.98992246,0.002180625,0.006094405],"study_design_scores_gemma":[0.00065667793,0.0002581489,0.0033288228,0.000010264345,0.000018628392,0.000018019904,0.00008122037,0.002245063,0.004680877,0.89582115,0.092528075,0.00035302408],"about_ca_topic_score_codex":0.000006105364,"about_ca_topic_score_gemma":0.0000019234794,"teacher_disagreement_score":0.39864135,"about_ca_system_score_codex":0.00004811651,"about_ca_system_score_gemma":0.000020694473,"threshold_uncertainty_score":0.4536101},"labels":[],"label_agreement":null},{"id":"W2405576942","doi":"","title":"Lattices Associated With Vector Spaces Over A Finite Field.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Vector field; Field (mathematics); Vector space; Vector (molecular biology); Finite field; Geometry; Discrete mathematics; Biology","score_opus":0.009954606684701252,"score_gpt":0.23635521995703213,"score_spread":0.22640061327233088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405576942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860258,0.0002076755,0.0052398136,0.002336655,0.00083709514,0.0001503813,0.0000010845083,0.00039878776,0.0048027113],"genre_scores_gemma":[0.99715906,0.0000073158394,0.0012728814,0.001255273,0.000008285932,0.0000042615447,0.0000017801659,0.000005633641,0.00028547834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990198,0.000045754936,0.00011958722,0.00028952866,0.00023734626,0.00028799433],"domain_scores_gemma":[0.9990606,0.00034272176,0.00010151209,0.0003565744,0.000056957124,0.000081677026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010225335,0.00014312999,0.00016710475,0.00005011514,0.00011637951,0.00013918322,0.00050092174,0.00006954087,0.000022788863],"category_scores_gemma":[0.00015137995,0.000112239104,0.000039540493,0.0004228502,0.000021757374,0.00050022115,0.00005974453,0.00015404998,0.000028092218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011722012,0.00014513786,0.003242195,0.0000026221592,0.00002294033,0.000055750388,0.00033579374,0.00006654955,0.00011425657,0.99191993,0.000908902,0.0031741867],"study_design_scores_gemma":[0.0013367541,0.0013052693,0.07395672,0.000070158276,0.00001487309,0.0000044907288,0.00001809657,0.0048107766,0.0012120001,0.9152982,0.0015588396,0.0004137767],"about_ca_topic_score_codex":0.0000060567854,"about_ca_topic_score_gemma":0.0000064902547,"teacher_disagreement_score":0.0766217,"about_ca_system_score_codex":0.000029338,"about_ca_system_score_gemma":0.000034526718,"threshold_uncertainty_score":0.4576978},"labels":[],"label_agreement":null},{"id":"W2406057942","doi":"","title":"Lattices associated with partial linear maps of finite vector spaces.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vector space; Vector (molecular biology); Pure mathematics; Biology","score_opus":0.01256508586739747,"score_gpt":0.22909138528661213,"score_spread":0.21652629941921467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406057942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96666783,0.00009090849,0.028649956,0.00057802966,0.0015441058,0.00018544655,0.0000063592533,0.00029289039,0.0019844575],"genre_scores_gemma":[0.996548,0.000003132866,0.0031888506,0.00010591817,0.000013121877,0.0000063951825,0.0000062732756,0.00001016768,0.00011813425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892616,0.00010003145,0.00018034845,0.00026808254,0.00026629778,0.00025908055],"domain_scores_gemma":[0.998828,0.00037664513,0.00019614963,0.00041028234,0.00010613509,0.00008278432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002468,0.00013322696,0.00022992976,0.000047740326,0.00007698205,0.000039983886,0.0005132046,0.00006535689,0.000009309387],"category_scores_gemma":[0.0002527012,0.000106306274,0.00004355917,0.00037912707,0.000073144336,0.00028707474,0.00011662723,0.00012903905,0.000031252657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011416999,0.0001339318,0.0062829396,0.0000101258065,0.000032446413,0.0000070660735,0.00027517442,0.00047198418,0.00014866299,0.9915211,0.00020742326,0.00089771755],"study_design_scores_gemma":[0.003945396,0.0018367469,0.017078869,0.00016572328,0.000052594634,0.00000475236,0.000036471356,0.08449997,0.012479295,0.86675024,0.01236099,0.0007889651],"about_ca_topic_score_codex":0.00000868015,"about_ca_topic_score_gemma":0.0000057062784,"teacher_disagreement_score":0.12477088,"about_ca_system_score_codex":0.00001906137,"about_ca_system_score_gemma":0.00003663084,"threshold_uncertainty_score":0.4335044},"labels":[],"label_agreement":null},{"id":"W2407094030","doi":"","title":"On Right Derivations Of Weak BCC-Algebras.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.008377234516240865,"score_gpt":0.22187330890301574,"score_spread":0.21349607438677487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407094030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9560814,0.000073606374,0.019233668,0.0012333501,0.0016639018,0.00028865036,0.000001046765,0.00020959387,0.0212148],"genre_scores_gemma":[0.99447334,0.0000050796593,0.0048466264,0.0002798661,0.0000048550764,0.000028316015,0.0000018121054,0.000007549081,0.00035256552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990673,0.000037775193,0.00020786005,0.00025192692,0.00021529383,0.00021982586],"domain_scores_gemma":[0.9989575,0.0001718635,0.00010098597,0.00057974964,0.00010854399,0.000081313214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006872586,0.00011839499,0.00015359763,0.00008539015,0.0001021588,0.000045989393,0.00067066506,0.000053372234,0.00016405342],"category_scores_gemma":[0.00006871445,0.000100225734,0.000055700326,0.00039462576,0.000053255528,0.00046624895,0.00013320865,0.00011351112,0.00042349473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.1887285e-7,0.00010044078,0.0002471602,0.0000037486043,0.0000070150477,0.0000013700812,0.00006958663,0.000026378328,0.00066115515,0.9938282,0.0031382267,0.0019160081],"study_design_scores_gemma":[0.00032374915,0.00012364905,0.00748154,0.000012516527,0.0000020881205,0.0000020527082,0.000008532092,0.0010910195,0.0046474678,0.9852867,0.00089645653,0.00012419203],"about_ca_topic_score_codex":0.00001585646,"about_ca_topic_score_gemma":9.1181255e-7,"teacher_disagreement_score":0.038391948,"about_ca_system_score_codex":0.000025241563,"about_ca_system_score_gemma":0.000030965693,"threshold_uncertainty_score":0.5443309},"labels":[],"label_agreement":null},{"id":"W2408036120","doi":"","title":"Lattices generated by partial injective maps of finite sets.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Injective function; Mathematics; Pure mathematics","score_opus":0.01131094783969793,"score_gpt":0.23740451453196723,"score_spread":0.2260935666922693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408036120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96188956,0.0002356887,0.03260803,0.00031779616,0.002118151,0.00016421816,0.000013399054,0.00020440837,0.0024487176],"genre_scores_gemma":[0.9971221,0.000007737667,0.002545956,0.00020659952,0.0000062341883,0.000009210453,0.000011698859,0.000007946432,0.00008249093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989431,0.00012711307,0.00020574708,0.00029693355,0.00019232559,0.00023480835],"domain_scores_gemma":[0.99907994,0.00021250626,0.00013909464,0.0003938868,0.00009745782,0.00007712706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002011494,0.00012765461,0.00019677842,0.000046711513,0.000082146405,0.000039550796,0.00053712155,0.000065864355,0.000010282577],"category_scores_gemma":[0.0001068157,0.0001154902,0.00004425589,0.00034737945,0.00006151054,0.00031666757,0.00015584925,0.00011503351,0.0000431071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073220617,0.00009987558,0.00089278334,0.000008324389,0.000018920917,0.0000024499184,0.00044096506,0.00026425396,0.0019375691,0.9885943,0.0029091984,0.004824031],"study_design_scores_gemma":[0.00082529004,0.0003323371,0.0005183514,0.000012356824,0.000008505395,0.000002041814,0.00001997123,0.029206315,0.033235833,0.92907,0.0065317233,0.00023725175],"about_ca_topic_score_codex":0.000013409023,"about_ca_topic_score_gemma":0.0000012877317,"teacher_disagreement_score":0.059524283,"about_ca_system_score_codex":0.000017555361,"about_ca_system_score_gemma":0.000027357366,"threshold_uncertainty_score":0.47095537},"labels":[],"label_agreement":null},{"id":"W2408454871","doi":"","title":"Join Spaces Determined by Lattices.","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Join (topology); Computer science; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.00964306832205897,"score_gpt":0.23869801035353075,"score_spread":0.22905494203147178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408454871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33461875,0.00005710357,0.62804466,0.0021222506,0.00071012834,0.0000895114,7.9142075e-7,0.0004416339,0.033915207],"genre_scores_gemma":[0.86643136,0.0000025615443,0.12832385,0.0008548387,0.000045833203,0.0000037830291,5.756074e-7,0.0000034841512,0.004333712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994559,0.000008376536,0.00007502344,0.0001977045,0.00009538528,0.00016760339],"domain_scores_gemma":[0.9995133,0.000048422804,0.00002971022,0.00032049583,0.000017208262,0.00007083077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006460319,0.00006956919,0.000067587636,0.000023026749,0.00005577329,0.000101976206,0.00047342008,0.000035997917,0.00013163744],"category_scores_gemma":[0.000023175755,0.000050813152,0.000023005563,0.00011160579,0.000029000614,0.0003891851,0.000108408276,0.0001058735,0.000181517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025835036,0.00009772909,0.003024242,0.000008089079,0.000008665933,0.00002771537,0.00029889648,0.0000057426905,0.31840658,0.49113944,0.021061886,0.16591842],"study_design_scores_gemma":[0.0012338217,0.00027256948,0.007998185,0.000009115063,0.000009565143,0.00009887654,0.000058279875,0.08117473,0.24201123,0.16778415,0.49816287,0.0011866001],"about_ca_topic_score_codex":0.000008653814,"about_ca_topic_score_gemma":0.00004021051,"teacher_disagreement_score":0.5318126,"about_ca_system_score_codex":0.0000025429051,"about_ca_system_score_gemma":0.000011177142,"threshold_uncertainty_score":0.23330943},"labels":[],"label_agreement":null},{"id":"W24655012","doi":"10.1080/13825585.2014.898735","title":"Weak Exponent of Indecomposability of an Irreducible Boolean Matrix.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Exponent; Discrete mathematics; Pure mathematics; Combinatorics","score_opus":0.015921357154576238,"score_gpt":0.2747183893652214,"score_spread":0.2587970322106452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24655012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99260557,0.0001330456,0.0034380846,0.00013738814,0.0008279319,0.0001462404,0.0000016824498,0.00008266703,0.0026273984],"genre_scores_gemma":[0.9927223,0.000015165632,0.007140499,0.000021743272,0.0000059398612,0.0000057505226,0.0000024397907,0.000007783885,0.00007843393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861294,0.00009581531,0.0003910222,0.00036401808,0.00028748685,0.00024869243],"domain_scores_gemma":[0.998494,0.00008698824,0.00019981826,0.0009897865,0.0001122195,0.000117175194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033127735,0.00013552234,0.00028217674,0.00009013166,0.000053072723,0.000020589445,0.00088019244,0.000065223685,0.000029740542],"category_scores_gemma":[0.000044525717,0.00012787807,0.000082878396,0.00045993426,0.00009831727,0.0005776361,0.00022764111,0.00011518189,0.000011514843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024894554,0.0006995223,0.009152514,0.000025546651,0.0000134133725,0.000010075639,0.00041993367,0.00020554033,0.003502826,0.976971,0.00008637514,0.008888394],"study_design_scores_gemma":[0.0007913721,0.0004819141,0.023492917,0.000020991054,0.000006266244,0.000018037434,0.000099478966,0.0026319167,0.015681343,0.9558511,0.00072699826,0.00019767409],"about_ca_topic_score_codex":0.00005221373,"about_ca_topic_score_gemma":0.0000038515636,"teacher_disagreement_score":0.021119874,"about_ca_system_score_codex":0.00003585401,"about_ca_system_score_gemma":0.000058120953,"threshold_uncertainty_score":0.5214716},"labels":[],"label_agreement":null},{"id":"W2476775726","doi":"10.1090/fim/015/03","title":"The structure of finite algebras","year":2001,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pure mathematics; Algebra over a field; Geology; Mathematics; Computer science","score_opus":0.012359281004307698,"score_gpt":0.2340558653286083,"score_spread":0.22169658432430062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476775726","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000108092,0.00019308156,0.33238798,0.0003775217,0.00010651928,0.000350808,0.000016379621,0.00017836355,0.6662813],"genre_scores_gemma":[0.06666404,0.0005162563,0.21490526,0.003344831,0.0005676024,0.000023374074,0.000014396151,0.00023054957,0.7137337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979962,0.000025007905,0.0005419258,0.0004601923,0.0005598355,0.00041681426],"domain_scores_gemma":[0.9969237,0.0010821183,0.0006342662,0.0011182614,0.000103190556,0.00013847389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013184521,0.0004079006,0.00066145934,0.00002193097,0.00024839668,0.000080187754,0.001443421,0.00018073675,0.000099397665],"category_scores_gemma":[0.000054248656,0.00025850124,0.0005927184,0.000057744837,0.0014822787,0.000052207397,0.00045884048,0.00056410814,0.000060615967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018077972,0.000006546072,5.902931e-7,0.000033969674,0.000100722544,0.0000043102486,0.0004559736,0.0000039653332,0.00008197295,0.95581084,0.00042942155,0.04306988],"study_design_scores_gemma":[0.00008348716,0.00010299099,0.000003215043,0.000069221285,0.000034921268,0.00001809276,0.00006820359,0.0008417484,0.0001476477,0.94494194,0.053383987,0.0003045485],"about_ca_topic_score_codex":0.0000024861401,"about_ca_topic_score_gemma":0.0000021918113,"teacher_disagreement_score":0.117482714,"about_ca_system_score_codex":0.000050976087,"about_ca_system_score_gemma":0.00009262528,"threshold_uncertainty_score":0.9999867},"labels":[],"label_agreement":null},{"id":"W2477717111","doi":"10.1017/cbo9780511546563.012","title":"Cobham's Theorem","year":2003,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Mathematics; Discrete mathematics; Combinatorics; Arithmetic; Chemistry","score_opus":0.01828527883348703,"score_gpt":0.18885738967009377,"score_spread":0.17057211083660673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477717111","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000052254595,0.00017762528,0.12016051,0.000030814233,0.00036153983,0.00022440335,0.000030233443,0.00027805293,0.8787316],"genre_scores_gemma":[0.00032581194,0.000081228995,0.0025163959,0.0004124251,0.0000673274,4.02774e-7,0.000009243693,0.00002969027,0.9965575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984572,0.00004789953,0.00015703977,0.00071095757,0.0002757592,0.0003511415],"domain_scores_gemma":[0.9983499,0.0000763089,0.00020159878,0.0010532723,0.00012304091,0.00019584707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009102774,0.0003945777,0.00036949452,0.0001498644,0.00022027173,0.00007652147,0.0014888933,0.00032221945,0.0000054836046],"category_scores_gemma":[0.000007473153,0.00042894846,0.00022416556,0.000012843139,0.00022073518,0.00020574195,0.00061464944,0.00047727805,0.000051667244],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000864094,0.0000053228396,2.33918e-7,0.000016579283,0.000042873064,0.00040673185,0.00002287335,0.0000036322313,0.000011061899,0.97524256,0.021234633,0.0030048664],"study_design_scores_gemma":[0.00032390232,0.00004735702,0.0000020378518,0.00005050326,0.000040934927,0.00004098413,0.0000056313283,0.00011024303,0.00023180424,0.0019629777,0.9966762,0.0005074322],"about_ca_topic_score_codex":0.0000071180534,"about_ca_topic_score_gemma":3.4816904e-7,"teacher_disagreement_score":0.9754416,"about_ca_system_score_codex":0.00014623873,"about_ca_system_score_gemma":0.00008471928,"threshold_uncertainty_score":0.99981624},"labels":[],"label_agreement":null},{"id":"W2480954375","doi":"10.1016/b978-044451891-0/50060-0","title":"CONSEQUENCES OF {D[0,1], V{0,1}}} THEORY","year":2006,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.014449766796040507,"score_gpt":0.22969364273879067,"score_spread":0.21524387594275016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480954375","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007730912,0.0021072347,0.008454141,0.000047645153,0.00033466658,0.00023330706,0.0000133493,0.00012913323,0.9886728],"genre_scores_gemma":[0.0037341902,0.000042330565,0.0067131966,0.0002833646,0.00012560103,0.000010757828,0.000005443495,0.000029459106,0.98905563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836326,0.000043703185,0.00047680392,0.0005078251,0.00034463563,0.00026380093],"domain_scores_gemma":[0.9983419,0.0001778464,0.0004315503,0.0008678511,0.000107634325,0.000073201045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002679169,0.00035194197,0.0005247645,0.00015114367,0.00007407754,0.000036720627,0.0011266752,0.000236571,0.00008315473],"category_scores_gemma":[0.000014509514,0.00029464444,0.00023887715,0.000019278294,0.00053378986,0.00009329719,0.00026207505,0.0003032519,0.00010231359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017340466,0.0000025693366,6.416686e-7,0.000019943867,0.000016641983,0.000023985436,0.00003376117,0.0000024107665,0.00009118776,0.51221514,0.00006357392,0.48752838],"study_design_scores_gemma":[0.000073826996,0.0000429562,0.0000032070889,0.0001155321,0.000016859003,0.000019417652,0.0000012204516,0.000004198415,0.00077984086,0.60279596,0.39591625,0.00023073379],"about_ca_topic_score_codex":3.0324045e-7,"about_ca_topic_score_gemma":0.0000025337727,"teacher_disagreement_score":0.48729765,"about_ca_system_score_codex":0.00003345499,"about_ca_system_score_gemma":0.0001597693,"threshold_uncertainty_score":0.9999506},"labels":[],"label_agreement":null},{"id":"W2491373616","doi":"10.1002/9781119105664.part4","title":"On Functional Structures: Binding, Predication, and Control","year":2015,"lang":"en","type":"other","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Citation; Syntax; Linguistics; Library science; Computer science; Cognitive science; Psychology; Philosophy","score_opus":0.01140665396642466,"score_gpt":0.22465424456116453,"score_spread":0.21324759059473988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491373616","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004460746,0.00026618203,0.5366134,0.00015707946,0.0003649695,0.00011336257,0.000014778521,0.00025843616,0.46220735],"genre_scores_gemma":[0.0035718614,0.000021107146,0.008422794,0.001115746,0.0003377316,0.000013692065,0.000033995286,0.000061996296,0.98642105],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931324,0.000017038077,0.000071908,0.0002907923,0.00020332802,0.000103668914],"domain_scores_gemma":[0.99952686,0.00003290507,0.00007511029,0.00026088234,0.000024423569,0.00007980545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047122205,0.00012184355,0.00011570145,0.00011901129,0.000030073896,0.000036672725,0.00021753774,0.0001106351,0.00088170054],"category_scores_gemma":[0.000026851016,0.0000858058,0.000014040687,0.00007793533,0.000036042544,0.000051518775,0.000040808656,0.00008969079,0.00013058413],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014907001,0.0000049143136,0.000013984339,0.0000033275753,0.000010940032,8.761104e-7,0.000008288426,0.0000059713425,0.0000022889087,0.27563617,0.7231274,0.0011843111],"study_design_scores_gemma":[0.00062891707,0.00008726947,0.00022384211,0.000018853882,0.000006587839,0.000010217745,0.0000042794522,0.0005721905,0.0000046547802,0.104856424,0.89339286,0.00019389187],"about_ca_topic_score_codex":0.0000036787296,"about_ca_topic_score_gemma":0.0000072300877,"teacher_disagreement_score":0.5281906,"about_ca_system_score_codex":0.000014017103,"about_ca_system_score_gemma":0.000053705226,"threshold_uncertainty_score":0.9654003},"labels":[],"label_agreement":null},{"id":"W2495031991","doi":"10.1017/cbo9780511546884.005","title":"Spanners Based on the Θ-Graph","year":2007,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.03413283444164393,"score_gpt":0.20512888955826142,"score_spread":0.17099605511661747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495031991","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007039323,0.00004110859,0.16121213,0.00010922584,0.00025397484,0.00026303076,0.000023432929,0.00021359832,0.83787644],"genre_scores_gemma":[0.0018042288,0.00001691123,0.0012544728,0.0013276533,0.000089950154,5.233192e-7,0.000008266639,0.000025886708,0.99547213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984601,0.00004069513,0.0001386534,0.0006105503,0.0003966247,0.00035337193],"domain_scores_gemma":[0.9980858,0.00027344222,0.00018582422,0.0012012918,0.0001006063,0.00015304024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001698113,0.00036644738,0.00025953155,0.00024883472,0.00031197784,0.00006837001,0.001803599,0.00025937412,0.00000469459],"category_scores_gemma":[0.000010295568,0.00030482735,0.0003388537,0.000023819195,0.0002642995,0.00009636227,0.00038444917,0.0006043222,0.000037568476],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024496207,0.000006564236,2.8723798e-7,0.000009613689,0.00003261342,0.0003195095,0.00001453716,0.000075805,0.0000037965767,0.98403776,0.013022606,0.002452408],"study_design_scores_gemma":[0.0003200814,0.00009177865,0.000009013643,0.00009395147,0.000045314704,0.000008335089,0.000010274312,0.0019998427,0.0001811744,0.00042142087,0.99634707,0.00047172458],"about_ca_topic_score_codex":0.000015105764,"about_ca_topic_score_gemma":0.0000011189622,"teacher_disagreement_score":0.98361635,"about_ca_system_score_codex":0.00012120842,"about_ca_system_score_gemma":0.000090202426,"threshold_uncertainty_score":0.9999404},"labels":[],"label_agreement":null},{"id":"W2495156561","doi":"10.1080/11663081.2016.1179528","title":"A comparison between monoidal and substructural logics","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Non-Classical Logics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; University of Exeter","keywords":"Negation; Deontic logic; Mathematics; Monoidal t-norm logic; Axiom; Mathematical proof; T-norm fuzzy logics; Categorical variable; Distributive property; Algebra over a field; Equivalence (formal languages); Proof theory; Computer science; Pure mathematics; Epistemology; Programming language; Artificial intelligence; Fuzzy logic; Philosophy; Fuzzy set","score_opus":0.02604407911317369,"score_gpt":0.27691893802876,"score_spread":0.2508748589155863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495156561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3930831,0.00006554645,0.60287327,0.0018352035,0.0002401421,0.00009996768,0.000002596893,0.000040280815,0.0017599331],"genre_scores_gemma":[0.9401126,0.000042133306,0.05910762,0.00024820564,0.0004404816,0.0000017656108,4.3784001e-7,0.00000960784,0.000037143713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980969,0.000038459642,0.0006861719,0.0003163781,0.00045159386,0.00041051727],"domain_scores_gemma":[0.9981868,0.0005110536,0.00057267136,0.00028302753,0.00011883984,0.00032758075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034459506,0.00024683969,0.0006235425,0.00011552395,0.00012662476,0.00010940597,0.000852531,0.00018027033,0.000011125371],"category_scores_gemma":[0.000064257045,0.0001330948,0.00012400655,0.00024376943,0.00023219228,0.0003858545,0.00030323863,0.00043686523,0.000021327463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027169444,0.00024131249,0.026431324,0.000036429825,0.00014968331,0.00017509976,0.0007107191,0.00031068502,0.04908359,0.42108607,0.0023090907,0.4991943],"study_design_scores_gemma":[0.004725988,0.0020662823,0.18185417,0.00009590361,0.00010894268,0.00031158116,0.00016822087,0.004661377,0.030819818,0.7604984,0.013499086,0.0011902131],"about_ca_topic_score_codex":2.2324465e-7,"about_ca_topic_score_gemma":5.40579e-7,"teacher_disagreement_score":0.5470295,"about_ca_system_score_codex":0.000075391814,"about_ca_system_score_gemma":0.00006399916,"threshold_uncertainty_score":0.5427448},"labels":[],"label_agreement":null},{"id":"W2502107647","doi":"10.1017/cbo9780511614309.006","title":"Nakayama algebras and representation–finite group algebras","year":2006,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Group (periodic table); Algebra over a field; Representation (politics); Pure mathematics; Mathematics; Representation theory; Group representation; Physics; Political science; Quantum mechanics","score_opus":0.019898490870653655,"score_gpt":0.20478209028992878,"score_spread":0.18488359941927512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502107647","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019988365,0.00041239508,0.13084866,0.000043576532,0.00027643138,0.00039155455,0.00006168326,0.00039309522,0.8673727],"genre_scores_gemma":[0.004183662,0.00014524999,0.004044054,0.00023789429,0.00018313384,0.0000017488225,0.00007496785,0.000048988044,0.9910803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99760497,0.00006471544,0.00030250612,0.0011779505,0.00041569333,0.00043419687],"domain_scores_gemma":[0.9979276,0.000227365,0.0003504526,0.0010955485,0.00014770382,0.00025130314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010178496,0.0005390548,0.0005173045,0.000306856,0.00036639575,0.0001908151,0.0011808717,0.00039337584,0.000004027362],"category_scores_gemma":[0.000015540398,0.00062186905,0.00021668342,0.00003280509,0.0003601269,0.00050550955,0.001198478,0.00052386755,0.000028027924],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019285166,0.00001130875,0.000011927112,0.00003707461,0.000067707464,0.0005501846,0.000039672446,0.000017359682,0.000028879656,0.9806118,0.0141476635,0.00445711],"study_design_scores_gemma":[0.001078415,0.0001246915,0.00034273556,0.00013076919,0.00014360459,0.00008171092,0.000017517132,0.0011803351,0.00021993511,0.004173492,0.9913745,0.0011323108],"about_ca_topic_score_codex":0.00013810652,"about_ca_topic_score_gemma":0.000005461552,"teacher_disagreement_score":0.9772268,"about_ca_system_score_codex":0.00012480712,"about_ca_system_score_gemma":0.00006911817,"threshold_uncertainty_score":0.99962324},"labels":[],"label_agreement":null},{"id":"W2523839178","doi":"10.1016/j.tcs.2017.05.001","title":"Functional clones and expressibility of partition functions","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Partition (number theory); Combinatorics; Functional analysis; Multiplication (music); Boolean function; Discrete mathematics; Constraint (computer-aided design); Set (abstract data type); Lattice (music); Computer science; Biology; Physics; Genetics","score_opus":0.02092870772223816,"score_gpt":0.2655031272994424,"score_spread":0.24457441957720427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523839178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18738426,0.00001609534,0.8102006,0.00054301904,0.00043301968,0.00005647514,0.0000011903245,0.00004956612,0.0013157752],"genre_scores_gemma":[0.9495007,0.0000028395432,0.050324477,0.000077685385,0.000077102195,0.0000041103813,3.3045777e-7,0.0000018305577,0.000010947994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879354,0.000036628728,0.00016348973,0.00045675974,0.00032434368,0.00022525719],"domain_scores_gemma":[0.9985873,0.00011579142,0.00010382026,0.0009199379,0.0001424789,0.00013064803],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00061615073,0.000088238114,0.00012344391,0.00005635806,0.0009190704,0.00025747303,0.000995339,0.000028188882,0.000028997209],"category_scores_gemma":[0.00013902811,0.00006824904,0.000032886004,0.00013994862,0.0041582286,0.0011324554,0.00090877595,0.00008669304,0.000013810641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055308515,0.000033744283,0.0009929048,0.000004452431,0.0000012990104,0.0000011811394,0.00006123415,0.00006231157,0.0015197997,0.9726383,0.000017736837,0.024661481],"study_design_scores_gemma":[0.00020058245,0.00014120845,0.14928284,0.000017052658,0.0000033791973,0.000019200033,0.0000043999044,0.11539426,0.0071527543,0.7276142,0.000042507483,0.00012758686],"about_ca_topic_score_codex":0.000002066346,"about_ca_topic_score_gemma":5.253638e-7,"teacher_disagreement_score":0.76211643,"about_ca_system_score_codex":0.000012243405,"about_ca_system_score_gemma":0.00004568132,"threshold_uncertainty_score":0.9985519},"labels":[],"label_agreement":null},{"id":"W2528259369","doi":"10.4115/jla.2018.10.2","title":"Locally compact Stone duality","year":2018,"lang":"en","type":"article","venue":"Journal of Logic and Analysis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Instytut Matematyczny, Polskiej Akademii Nauk; Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Mathematics; Hausdorff space; Locally compact space; Compact space; Duality (order theory); Partially ordered set; Pure mathematics; Locally compact group; Discrete mathematics; Algebra over a field","score_opus":0.024473805563693135,"score_gpt":0.29790730420259787,"score_spread":0.27343349863890476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528259369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12239263,0.00039525662,0.87467027,0.0012313718,0.000070768176,0.00001265647,6.0115104e-7,0.000011928727,0.0012145477],"genre_scores_gemma":[0.9818496,0.00007077296,0.017213821,0.000614409,0.000131519,6.0837955e-8,2.6581708e-7,0.0000014119538,0.00011810326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991258,0.00007222983,0.00030895183,0.00013242739,0.00022082984,0.00013980674],"domain_scores_gemma":[0.9991081,0.00006578554,0.00030735863,0.00018107155,0.00021563692,0.000122043835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047764624,0.000082539416,0.00032594998,0.000198101,0.00010326902,0.00006708102,0.00033706726,0.000033054082,0.0000529191],"category_scores_gemma":[0.000046173507,0.0000522916,0.0001818004,0.00077080907,0.00011972113,0.00030550756,0.00005688792,0.00011124587,0.000007795604],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024109862,0.0011623651,0.2719513,0.000051012772,0.007423889,0.0009686874,0.0041818307,0.0056688706,0.005405934,0.44965658,0.005577713,0.24771073],"study_design_scores_gemma":[0.0016342591,0.0025600484,0.5870356,0.00004502279,0.0016480976,0.0005474771,0.00046341866,0.07296789,0.0013190687,0.32400382,0.0070523527,0.0007229494],"about_ca_topic_score_codex":0.0000055197984,"about_ca_topic_score_gemma":0.000005301208,"teacher_disagreement_score":0.859457,"about_ca_system_score_codex":0.000015745043,"about_ca_system_score_gemma":0.000027108412,"threshold_uncertainty_score":0.21323897},"labels":[],"label_agreement":null},{"id":"W2540734932","doi":"","title":"Romance clitic clusters","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Clitic; Linguistics; Computer science; Geography; Artificial intelligence; Philosophy","score_opus":0.00949670324022491,"score_gpt":0.23227964424341155,"score_spread":0.22278294100318663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540734932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011494446,0.00007401268,0.9081313,0.0031750945,0.0001238398,0.000040852556,7.6552e-8,0.0002513747,0.07670898],"genre_scores_gemma":[0.8266102,0.000004120599,0.1665643,0.0034051347,0.000070763104,0.0000029392593,1.5723901e-7,0.000002142738,0.0033402555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947524,0.000009893162,0.00008034714,0.00017567536,0.00008490402,0.00017395457],"domain_scores_gemma":[0.99962026,0.000027044809,0.000016655351,0.00027261238,0.000012163106,0.000051289906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004494643,0.000053881697,0.000053028478,0.00002214516,0.000045875666,0.000035903675,0.0003955954,0.000016791246,0.000052620013],"category_scores_gemma":[0.0000072488306,0.00004261584,0.000024198114,0.000109446155,0.000016527221,0.00044534373,0.00009052833,0.00004309419,0.0005348581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.2754993e-7,0.000029608776,0.0001518465,0.0000026538703,0.0000028055952,0.0000066210255,0.00016163541,0.0013313004,0.00020068306,0.8441971,0.0021079916,0.15180686],"study_design_scores_gemma":[0.001029052,0.00018237034,0.008831428,0.000018278786,0.000004728673,0.000093641895,0.00006161142,0.48895118,0.008644211,0.13565132,0.3557477,0.0007845045],"about_ca_topic_score_codex":0.0000012778899,"about_ca_topic_score_gemma":0.000005010506,"teacher_disagreement_score":0.81511575,"about_ca_system_score_codex":0.00001730334,"about_ca_system_score_gemma":0.000009715302,"threshold_uncertainty_score":0.68746966},"labels":[],"label_agreement":null},{"id":"W2555442051","doi":"10.14232/actasm-015-056-y","title":"Homomorphisms and principal congruences of bounded lattices I. Isotone maps of principal congruences","year":2016,"lang":"en","type":"article","venue":"Acta Scientiarum Mathematicarum","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Homomorphism; Bounded function; Congruence relation; Mathematics; Combinatorics; Converse; Order (exchange); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.016571575326482384,"score_gpt":0.2487198530513874,"score_spread":0.23214827772490504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555442051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.935316,0.00023424557,0.059191152,0.0017871844,0.00045491697,0.0004307247,0.000039373987,0.00011022622,0.0024361596],"genre_scores_gemma":[0.9619606,0.000040989315,0.0374593,0.00004985182,0.000019993173,0.0000173964,0.0000012758571,0.000010295156,0.00044030958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973408,0.00008684625,0.00070718746,0.00060729345,0.00073176675,0.00052613695],"domain_scores_gemma":[0.9975933,0.0005579562,0.00064660836,0.00080762495,0.00021204911,0.00018249791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093258725,0.00025222296,0.00054479874,0.00021632486,0.00017544431,0.00012420394,0.0014404036,0.00008931659,0.00007108196],"category_scores_gemma":[0.00034256236,0.00015786632,0.00010556764,0.0005325252,0.0014315208,0.001161856,0.0006759338,0.000087745044,0.000019146502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014441874,0.00022756417,0.003836649,0.00027025997,0.00007644946,0.000011512219,0.001345877,0.0000024192111,0.060354397,0.9301794,0.00011865704,0.0035623317],"study_design_scores_gemma":[0.0016197688,0.0006307976,0.006620658,0.0008035063,0.00009355368,0.00012937922,0.0005230456,0.0028863652,0.1720629,0.81155425,0.0022938296,0.0007819544],"about_ca_topic_score_codex":0.000012434625,"about_ca_topic_score_gemma":0.000018707884,"teacher_disagreement_score":0.1186252,"about_ca_system_score_codex":0.00002122966,"about_ca_system_score_gemma":0.00012953146,"threshold_uncertainty_score":0.6437602},"labels":[],"label_agreement":null},{"id":"W2561068527","doi":"10.5539/jmr.v9n1p32","title":"Absolute Valued Algebras with Strongly One Sided Unit","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Absolute (philosophy); Subalgebra; Unit (ring theory); Dimension (graph theory); Pure mathematics; Algebra over a field; Mathematics education; Epistemology","score_opus":0.20487296352671913,"score_gpt":0.4084544604057214,"score_spread":0.2035814968790023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561068527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21571584,0.0001861759,0.77194095,0.0025441812,0.00014914336,0.00031152106,0.0000010692044,0.000029234952,0.009121905],"genre_scores_gemma":[0.61161417,0.000048729784,0.38701415,0.000021096934,0.00016591749,0.0000049842183,1.5187713e-7,0.000017674569,0.0011130966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719346,0.00012490386,0.00042870885,0.00017105637,0.0016098797,0.00047198418],"domain_scores_gemma":[0.99660355,0.0004892875,0.0005967576,0.0011265847,0.00095182424,0.00023202346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028327259,0.00012370394,0.00032932093,0.00027161132,0.0005934363,0.0006480637,0.0028921503,0.000058886835,0.000041040872],"category_scores_gemma":[0.0010058312,0.00008346029,0.00007963457,0.00019694511,0.0002457388,0.0009776151,0.00051172345,0.00073788763,0.000069573245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009651829,0.0012980177,0.0004912242,0.00024907,0.0003336418,0.00093520764,0.0029698743,0.0005172095,0.004669034,0.9690216,0.0015119793,0.01790661],"study_design_scores_gemma":[0.003582662,0.0028980419,0.013254542,0.0012487328,0.00004669621,0.0009631246,0.0011584563,0.03820006,0.008663783,0.9276496,0.0017753076,0.00055899454],"about_ca_topic_score_codex":0.000005655579,"about_ca_topic_score_gemma":0.000010546151,"teacher_disagreement_score":0.39589834,"about_ca_system_score_codex":0.000057018995,"about_ca_system_score_gemma":0.00028883,"threshold_uncertainty_score":0.62492937},"labels":[],"label_agreement":null},{"id":"W2563565570","doi":"10.1142/s0218196717500242","title":"A family of formulas with reversal of high avoidability index","year":2017,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Bounded function; Index (typography); Simple (philosophy); Combinatorics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.012535824474172154,"score_gpt":0.27228260381831376,"score_spread":0.2597467793441416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563565570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.555552,0.000031795924,0.44377255,0.00033426168,0.00018641069,0.000029689807,0.0000013429255,0.0000030489794,0.000088911744],"genre_scores_gemma":[0.97277206,0.000018506129,0.027090764,0.000052285795,0.000056043653,5.048974e-7,7.674155e-7,0.0000029264072,0.000006126858],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989909,0.000028126662,0.00036966443,0.00011025373,0.00043211016,0.00006895631],"domain_scores_gemma":[0.99795717,0.00009482024,0.001009763,0.00014365214,0.0007515251,0.000043081272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022248965,0.000074951975,0.00018827875,0.00011744981,0.000058270958,0.000069368645,0.00063241186,0.00003130124,0.0000018445982],"category_scores_gemma":[0.00007182971,0.000056559584,0.000053136013,0.000046078814,0.00011441753,0.0008832174,0.0001210338,0.00009506969,3.4501713e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012609421,0.00063671893,0.13681558,0.000102576094,0.0006595239,0.00013837489,0.0023793736,0.018017478,0.0050719334,0.36074436,0.00015090831,0.47402224],"study_design_scores_gemma":[0.001881403,0.0006899223,0.7404258,0.00014291577,0.000016910739,0.00014254847,0.00007468808,0.016606394,0.002889787,0.23697452,0.00004104729,0.000114020455],"about_ca_topic_score_codex":0.000041385483,"about_ca_topic_score_gemma":0.0000046935643,"teacher_disagreement_score":0.6036103,"about_ca_system_score_codex":0.000023539375,"about_ca_system_score_gemma":0.00008337441,"threshold_uncertainty_score":0.23064329},"labels":[],"label_agreement":null},{"id":"W2570765932","doi":"10.1142/s0129054111008052","title":"CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Closure (psychology); Mathematics; Complement (music); Separation axiom; Axiom; Discrete mathematics; Regular language; Partition (number theory); Formal language; Abstract family of languages; Concatenation (mathematics); Topological space; Pure mathematics; Combinatorics; Computer science; Algorithm; Theoretical computer science; Second-generation programming language","score_opus":0.018727166221951738,"score_gpt":0.3057454771416453,"score_spread":0.28701831091969354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570765932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29020074,0.00006421842,0.70776373,0.00024506325,0.0005255592,0.000028061077,5.697078e-7,0.0000070927176,0.0011649905],"genre_scores_gemma":[0.80743724,0.000021108752,0.19239065,0.00008896311,0.000055507164,4.7013833e-7,1.4009642e-7,0.00000139362,0.000004543061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989042,0.000026262347,0.00035329952,0.00013094775,0.00045251707,0.0001327164],"domain_scores_gemma":[0.9989033,0.000084915,0.00028764523,0.00014624905,0.0005223436,0.000055563967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684194,0.000065502005,0.000110056004,0.00050198665,0.00005404817,0.000109800545,0.001592682,0.00001656801,0.000012820781],"category_scores_gemma":[0.00007458822,0.000052242285,0.000038086313,0.00034904003,0.0003055514,0.0026862791,0.0003142306,0.000092609356,0.0000016884201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016283544,0.00010722877,0.005683525,0.000002573686,0.000016252583,0.000043231896,0.0026008957,0.00029233127,0.0012607874,0.76918054,0.000013857585,0.2207825],"study_design_scores_gemma":[0.0019947067,0.0010008595,0.50522965,0.00023702988,0.000010777868,0.0015288995,0.00033720312,0.059849154,0.023140581,0.4053552,0.0008895273,0.00042644487],"about_ca_topic_score_codex":0.000009577647,"about_ca_topic_score_gemma":0.0000054211023,"teacher_disagreement_score":0.5172365,"about_ca_system_score_codex":0.00003121253,"about_ca_system_score_gemma":0.00015091142,"threshold_uncertainty_score":0.29596257},"labels":[],"label_agreement":null},{"id":"W2571822734","doi":"","title":"Construction quasi-regular semilattices with singular linear spaces.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.008562909992378024,"score_gpt":0.22222144518221248,"score_spread":0.21365853518983446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571822734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7340372,0.00027087046,0.25996035,0.002002994,0.0018870158,0.00020428025,0.0000013295335,0.0004887893,0.0011471529],"genre_scores_gemma":[0.95437783,0.000021125816,0.045217842,0.00011098684,0.00001949878,0.000008617336,7.784703e-7,0.000013854654,0.00022947496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987405,0.00005777016,0.00016345106,0.00042882847,0.0002916155,0.00031786604],"domain_scores_gemma":[0.99891937,0.00011362494,0.00012878125,0.0006001609,0.000120478486,0.00011757563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014871315,0.00017726433,0.00018814023,0.00007105622,0.00015261091,0.00007512432,0.00051066704,0.000074226315,0.000017083456],"category_scores_gemma":[0.000046575584,0.00011005111,0.00004359081,0.0003371217,0.00017205699,0.00074922445,0.00012042744,0.00009197034,0.00008925893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008482152,0.00005143297,0.0018759016,0.000007432086,0.000017819419,0.000027534283,0.00009223086,0.000006144933,0.001748795,0.9785561,0.000065687236,0.017542465],"study_design_scores_gemma":[0.0015173169,0.00044777652,0.00085873733,0.00012830329,0.000015749203,0.00009360905,0.000049127237,0.0011962235,0.0118798185,0.9740421,0.009358022,0.0004131784],"about_ca_topic_score_codex":0.0000052626683,"about_ca_topic_score_gemma":0.0000018192022,"teacher_disagreement_score":0.2203406,"about_ca_system_score_codex":0.0000509373,"about_ca_system_score_gemma":0.00006039192,"threshold_uncertainty_score":0.44877538},"labels":[],"label_agreement":null},{"id":"W2573978227","doi":"","title":"Lattices associated with Hamming graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamming graph; Hamming code; Combinatorics; Statistics; Block code","score_opus":0.011727505345694673,"score_gpt":0.2215056867426426,"score_spread":0.20977818139694793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573978227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97677964,0.00012213028,0.017933244,0.0010186592,0.0009955994,0.00011279927,0.0000010991579,0.00045133542,0.0025854998],"genre_scores_gemma":[0.99770844,0.000008891696,0.0017405725,0.00015669054,0.0000029537975,0.0000091152215,5.348426e-7,0.000008896452,0.0003639099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902475,0.00004824693,0.00011882241,0.0002941074,0.00021990597,0.00029415984],"domain_scores_gemma":[0.9991319,0.0002435818,0.0000984644,0.0003695678,0.00007416733,0.00008232871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001517621,0.0001210624,0.00013502866,0.00005741933,0.00012508567,0.00005746301,0.00055090117,0.000047373014,0.000011404396],"category_scores_gemma":[0.00009303348,0.0000707159,0.000034812725,0.00037522695,0.00006138038,0.000619017,0.00011046718,0.000067900146,0.00005330103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026581617,0.000044071137,0.007538063,0.0000013241214,0.000019334033,0.000022399456,0.000083471576,0.0000016112374,0.00035947328,0.98354256,0.00018054414,0.008204505],"study_design_scores_gemma":[0.0009329499,0.0001712204,0.015469751,0.00006380124,0.0000061993487,0.000004828711,0.000008268246,0.000117073214,0.0014434111,0.9806934,0.00087513984,0.00021393823],"about_ca_topic_score_codex":0.0000025601394,"about_ca_topic_score_gemma":0.000005364757,"teacher_disagreement_score":0.020928802,"about_ca_system_score_codex":0.000037365568,"about_ca_system_score_gemma":0.00002963721,"threshold_uncertainty_score":0.28837106},"labels":[],"label_agreement":null},{"id":"W2574581444","doi":"","title":"A Note On n-Connected Splitting-Off Matroids.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.009448339707263968,"score_gpt":0.23767376550698882,"score_spread":0.22822542579972485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574581444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9315436,0.00015499923,0.047346186,0.005129354,0.0046996167,0.0003043566,0.0000034327202,0.0010516553,0.009766816],"genre_scores_gemma":[0.99519277,0.000014921456,0.003562331,0.0005947842,0.000019166224,0.000014978221,6.3801565e-7,0.000014369457,0.0005860605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986178,0.000064391264,0.00020116405,0.0004677133,0.0002520245,0.0003968965],"domain_scores_gemma":[0.9986102,0.00034894168,0.00009503344,0.0007520427,0.000068480134,0.00012530235],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016594905,0.00017625517,0.00017996934,0.00008054541,0.00012573598,0.00005882637,0.00081929733,0.000074105024,0.000031503965],"category_scores_gemma":[0.00019200514,0.00011786496,0.0000734497,0.0003178963,0.00004691242,0.0003575079,0.00020604108,0.00011597433,0.00085003034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008441634,0.000058936588,0.00022704015,0.0000024392268,0.000005659969,0.000026229902,0.000077341705,0.000002478336,0.0024776948,0.9470784,0.0007176348,0.049317714],"study_design_scores_gemma":[0.0011667621,0.0002823149,0.003096614,0.00005064472,0.0000031734653,0.000011354027,0.0000037016152,0.00047081267,0.0071706367,0.9793592,0.008115839,0.00026890877],"about_ca_topic_score_codex":0.0000026589453,"about_ca_topic_score_gemma":9.3394146e-7,"teacher_disagreement_score":0.06364917,"about_ca_system_score_codex":0.00007461139,"about_ca_system_score_gemma":0.0000409033,"threshold_uncertainty_score":0.99992794},"labels":[],"label_agreement":null},{"id":"W2591672105","doi":"","title":"Combinatorial Identities For l-Regular Overpartitions.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018939446268640373,"score_gpt":0.2734173562780941,"score_spread":0.25447791000945374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591672105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70990914,0.0007268465,0.15632507,0.005375379,0.080060646,0.0020842527,0.0000448677,0.0014267198,0.044047087],"genre_scores_gemma":[0.99601513,0.0000145462545,0.0031281086,0.00013680248,0.000057867783,0.00009818848,0.0000053428116,0.000014760768,0.00052923383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872947,0.000029929995,0.00021635166,0.0003918788,0.00025699145,0.00037538577],"domain_scores_gemma":[0.99805456,0.00011325939,0.00020898375,0.0013572465,0.00015462632,0.00011131166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023930802,0.0001693049,0.0002232355,0.00005697713,0.0012510092,0.0006781622,0.001748712,0.00008644685,0.000012693307],"category_scores_gemma":[0.00026167533,0.00017047628,0.00013450673,0.00006903827,0.00014715982,0.0014934901,0.00040117317,0.00010677405,0.00006920881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070162314,0.00006940059,0.00033637,0.000010844488,0.000015963196,0.000008075298,0.000065983724,0.0000054096636,0.00014650926,0.9949042,0.0034333712,0.0009968219],"study_design_scores_gemma":[0.0014919359,0.00012895284,0.0018170717,0.000013993785,0.000009226801,0.000005486118,0.000010427302,0.0008917069,0.002163371,0.9856086,0.0076327045,0.00022655276],"about_ca_topic_score_codex":0.000008978593,"about_ca_topic_score_gemma":0.0000018257118,"teacher_disagreement_score":0.28610602,"about_ca_system_score_codex":0.000048785347,"about_ca_system_score_gemma":0.000060376053,"threshold_uncertainty_score":0.9621877},"labels":[],"label_agreement":null},{"id":"W2592106057","doi":"10.1090/gsm/176/09","title":"Conradian left-orderings and local indicability","year":2016,"lang":"en","type":"book-chapter","venue":"Graduate studies in mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Manitoba","funders":"","keywords":"Geography","score_opus":0.09667359063912291,"score_gpt":0.30524561060987987,"score_spread":0.20857201997075697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592106057","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014545256,0.0103172865,0.43851256,0.003782029,0.0015354613,0.0015788208,0.000040842202,0.00058234547,0.5421961],"genre_scores_gemma":[0.26723367,0.029544227,0.31270102,0.0014397497,0.0006717756,0.00013986956,0.000009259573,0.00035246895,0.38790798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982411,0.00001996514,0.00051832513,0.00056402956,0.00031133587,0.00034523464],"domain_scores_gemma":[0.99839807,0.00050703087,0.0002602093,0.0006586476,0.00008772485,0.00008832591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040071525,0.0004060515,0.00073830684,0.00014995618,0.00011622369,0.000034779012,0.00054465747,0.00015874176,0.000013114925],"category_scores_gemma":[0.00016640579,0.00029443955,0.00009983176,0.000040374172,0.0010094927,0.00015692606,0.0008505308,0.0003407732,0.00007056507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012845759,0.000018646097,0.000021701044,0.0003947613,0.00009424705,0.000058410526,0.0041860766,0.0000017986248,7.695492e-7,0.96327496,0.00024068318,0.03170665],"study_design_scores_gemma":[0.00021454289,0.00005976836,0.00003777459,0.0005135842,0.000018362516,0.00004381439,0.00018614208,0.00026939387,0.000005523102,0.99195963,0.006315536,0.00037595272],"about_ca_topic_score_codex":6.384419e-7,"about_ca_topic_score_gemma":0.000018847826,"teacher_disagreement_score":0.26577914,"about_ca_system_score_codex":0.00012624181,"about_ca_system_score_gemma":0.00003579492,"threshold_uncertainty_score":0.99995077},"labels":[],"label_agreement":null},{"id":"W2593700631","doi":"10.1007/s10508-017-0965-x","title":"On the Concept of Category-Specificity","year":2017,"lang":"en","type":"letter","venue":"Archives of Sexual Behavior","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Public health; Psychology; Sexual behavior; Social psychology; Medicine; Pathology","score_opus":0.04321600410419041,"score_gpt":0.27896200600490006,"score_spread":0.23574600190070966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593700631","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17725356,0.0017629217,0.16313112,0.5978747,0.0059347264,0.004657061,0.0012082141,0.00053325953,0.047644433],"genre_scores_gemma":[0.9000037,0.000029471,0.008738398,0.07882348,0.0016299634,0.00017903007,0.00015602609,0.00008906192,0.010350882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983708,0.00012199217,0.00033184825,0.00048826612,0.0003851899,0.0003018888],"domain_scores_gemma":[0.99666405,0.0008543141,0.00056140247,0.0018480042,0.0000353198,0.000036893845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007306034,0.0002654667,0.0004167738,0.000099824254,0.00015742301,0.000042250143,0.0031282478,0.00016330219,0.000043162683],"category_scores_gemma":[0.000051535102,0.00017316891,0.00011124795,0.000052175343,0.0008432708,0.00011922175,0.00044324496,0.00097092555,0.000017319351],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003887076,0.0005501884,0.0003384775,0.00016899612,0.000106698324,0.00081671955,0.0053811125,0.000037226877,0.009754715,0.4022958,0.37269872,0.20781247],"study_design_scores_gemma":[0.0028310416,0.008875872,0.054784264,0.00081115315,0.0006717451,0.00021187884,0.00072884886,0.0005074675,0.13132684,0.34618962,0.44840744,0.004653822],"about_ca_topic_score_codex":0.00004488052,"about_ca_topic_score_gemma":0.0000021437015,"teacher_disagreement_score":0.7227501,"about_ca_system_score_codex":0.000007882317,"about_ca_system_score_gemma":0.0000651244,"threshold_uncertainty_score":0.70616233},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017192324627891224,"score_gpt":0.2566598042498143,"score_spread":0.2394674796219231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594244112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023853358,0.0014158437,0.9596629,0.0033949495,0.0005022628,0.00032853012,0.00004288645,0.00010034427,0.010698918],"genre_scores_gemma":[0.9614234,0.00041473942,0.03536341,0.0017065248,0.0002862003,0.000014273187,0.0000029008706,0.000013281931,0.0007752561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800915,0.0001367639,0.00066305604,0.00030308124,0.00041389375,0.00047404313],"domain_scores_gemma":[0.9971274,0.0013818853,0.0004651418,0.00038634863,0.00045406935,0.00018516107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007907827,0.00024321716,0.0004800592,0.00014019298,0.00023100644,0.00016268378,0.0012946019,0.00012620924,0.00018551986],"category_scores_gemma":[0.0006973513,0.0001756733,0.00025803092,0.00046312617,0.00017331676,0.0007491341,0.000090684145,0.00027705438,0.000029387911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031599926,0.00027892427,0.00043414155,0.000048679387,0.00016525059,0.00024885233,0.0024847982,0.010796637,0.00054676924,0.9245266,0.0042965747,0.05585681],"study_design_scores_gemma":[0.0012428146,0.0011517748,0.0021747877,0.00008695051,0.00005032439,0.00027497028,0.00020717783,0.0045499043,0.0023251495,0.9735354,0.013994158,0.0004065457],"about_ca_topic_score_codex":0.0000039666875,"about_ca_topic_score_gemma":0.0000026257446,"teacher_disagreement_score":0.93757004,"about_ca_system_score_codex":0.00007165383,"about_ca_system_score_gemma":0.00022039784,"threshold_uncertainty_score":0.71637493},"labels":[],"label_agreement":null},{"id":"W2597747192","doi":"10.5539/jmr.v9n2p123","title":"Over Absolute Valued Algebras with Central Element not Necassary Idempotent","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Idempotence; Mathematics; Absolute (philosophy); Element (criminal law); Unit (ring theory); Pure mathematics; Algebra over a field; Mathematics education; Law; Epistemology","score_opus":0.12220374191617961,"score_gpt":0.39424542412924934,"score_spread":0.27204168221306974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597747192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35629627,0.00021021979,0.6349942,0.0047210394,0.0003673718,0.00035018587,0.0000021751991,0.000026637372,0.0030318673],"genre_scores_gemma":[0.81959116,0.00010495869,0.17935155,0.00011395109,0.00024617315,0.0000047054978,2.0481473e-7,0.000018726,0.0005685848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964191,0.00012488187,0.0005421068,0.00021071828,0.0020240743,0.00067912356],"domain_scores_gemma":[0.99724597,0.0002685123,0.00063301995,0.0010255408,0.00052533945,0.00030159453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029289704,0.00015058456,0.00033143465,0.00021720797,0.00057043735,0.0006094145,0.0024681403,0.000058322916,0.000053783497],"category_scores_gemma":[0.00042860064,0.00009649755,0.0001238269,0.00013833951,0.00017751123,0.000934857,0.00062788214,0.00068526465,0.00003514724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000308899,0.0026595974,0.0028299286,0.0005838422,0.0007223376,0.003967714,0.006955332,0.0015048787,0.012259145,0.9115593,0.017259024,0.039390046],"study_design_scores_gemma":[0.007227104,0.0043350663,0.10447427,0.0014325824,0.00008792232,0.002051299,0.001135893,0.18889813,0.020914115,0.6599566,0.008313206,0.0011738407],"about_ca_topic_score_codex":0.000008656641,"about_ca_topic_score_gemma":0.000006814383,"teacher_disagreement_score":0.46329486,"about_ca_system_score_codex":0.00014728616,"about_ca_system_score_gemma":0.00027352184,"threshold_uncertainty_score":0.5876598},"labels":[],"label_agreement":null},{"id":"W2608549762","doi":"10.1090/crmp/047/08","title":"On a class of congruence subgroups","year":2009,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Congruence (geometry); Class (philosophy); Mathematics; Psychology; Computer science; Social psychology; Artificial intelligence","score_opus":0.012877769728467894,"score_gpt":0.22747297015601825,"score_spread":0.21459520042755037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608549762","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006537922,0.0013088589,0.08709084,0.0014873293,0.00038332114,0.00047810783,0.000008539338,0.00043356832,0.9081556],"genre_scores_gemma":[0.9935623,0.00010868466,0.0021219645,0.002074558,0.00030796902,0.000009363056,0.0000064697033,0.00004981308,0.0017588704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977591,0.000003218347,0.00040769108,0.0008854087,0.00053222425,0.00041232927],"domain_scores_gemma":[0.9983781,0.00021173047,0.000519312,0.00037177358,0.0003874466,0.00013161296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012621756,0.0005619307,0.00063851976,0.00025823936,0.000116563846,0.00012046254,0.0012692185,0.0005293524,0.000044008142],"category_scores_gemma":[0.00023316381,0.00046832435,0.00021723489,0.00014915048,0.00015031222,0.0002884637,0.00015978259,0.00078716694,0.000056660872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017394403,0.000017994791,0.0000069963585,0.00006130518,0.000020065612,0.000011971677,0.00024183486,0.00003128481,0.00094808626,0.94893175,0.00007561333,0.04963571],"study_design_scores_gemma":[0.00017939633,0.00055082905,0.000047264013,0.00036439404,0.000025747257,0.000033948174,0.000001584291,0.00025194182,0.006325528,0.97841954,0.01330242,0.0004974094],"about_ca_topic_score_codex":0.0000020631724,"about_ca_topic_score_gemma":0.0000024435171,"teacher_disagreement_score":0.99290854,"about_ca_system_score_codex":0.000079530626,"about_ca_system_score_gemma":0.00008993149,"threshold_uncertainty_score":0.99977684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics","score_opus":0.009761516551065644,"score_gpt":0.20033997928150266,"score_spread":0.19057846273043702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609553806","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007065396,0.019311823,0.020456787,0.0002850678,0.00057663006,0.00036127423,0.000022646173,0.000839269,0.95743996],"genre_scores_gemma":[0.034145854,0.038848467,0.050826892,0.003001413,0.0009189261,0.000092492584,0.0001095458,0.0003112152,0.87174517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841774,0.00002194545,0.00030293502,0.0007109312,0.0002086328,0.00033783456],"domain_scores_gemma":[0.998815,0.00007956241,0.00015156127,0.00075489865,0.000045579385,0.00015337864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012823225,0.0004611327,0.0004249013,0.0002927598,0.00024332711,0.00020617757,0.0006838134,0.00030974648,0.00021444407],"category_scores_gemma":[0.0000072454554,0.00042671637,0.00017251556,0.000089667024,0.00047407378,0.0006473358,0.0002562383,0.00037105463,0.000084740226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018342549,0.0000054022303,0.000010735679,0.000021687965,0.000036671736,0.000039938077,0.00024044124,0.0000016839036,0.0000048594115,0.9125355,0.00024117909,0.08684358],"study_design_scores_gemma":[0.000087876055,0.00009919564,0.000057235524,0.00006079982,0.000019086667,0.00007061614,0.000012845767,0.000013005341,0.000049903058,0.7656793,0.23345558,0.00039458004],"about_ca_topic_score_codex":0.000001240921,"about_ca_topic_score_gemma":0.0000043411264,"teacher_disagreement_score":0.23321441,"about_ca_system_score_codex":0.000011846642,"about_ca_system_score_gemma":0.000039731636,"threshold_uncertainty_score":0.99981844},"labels":[],"label_agreement":null},{"id":"W2609834214","doi":"10.1017/jsl.2019.73","title":"DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerzita Karlova v Praze","keywords":"Idempotence; Congruence (geometry); Mathematics; Variety (cybernetics); Sequence (biology); Class (philosophy); Polynomial; Time complexity; Type (biology); Path (computing); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.03510935235772742,"score_gpt":0.2733136988233666,"score_spread":0.23820434646563918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609834214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4398693,0.0020811467,0.5253233,0.03021423,0.00082410255,0.00021134867,0.00000408325,0.00010529288,0.0013672521],"genre_scores_gemma":[0.9808801,0.00018101993,0.011210402,0.007372055,0.00032977175,0.0000025663835,6.6346007e-7,0.0000075563617,0.000015899592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984624,0.00009283492,0.00061490934,0.00021178395,0.0003101627,0.0003079309],"domain_scores_gemma":[0.99888813,0.00023218375,0.00037180746,0.00017662461,0.00008679159,0.00024445978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003012337,0.00014781962,0.00035424787,0.00020379656,0.00008044433,0.000073343144,0.00082950405,0.000067260866,0.000045525474],"category_scores_gemma":[0.00030885977,0.00011564522,0.00014938548,0.00055605324,0.000043902804,0.0009820506,0.00016087345,0.0004041592,0.00007613737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000442252,0.0002439715,0.004731144,0.000042836327,0.00006409608,0.0019407815,0.0028670768,0.021613387,0.009018424,0.95011395,0.0014581303,0.00786195],"study_design_scores_gemma":[0.0018828374,0.0009218459,0.031599768,0.000141112,0.00002361818,0.00056871196,0.00033026192,0.015049934,0.0018666087,0.9446771,0.0024660227,0.0004721524],"about_ca_topic_score_codex":0.0000015789986,"about_ca_topic_score_gemma":7.8345363e-7,"teacher_disagreement_score":0.54101074,"about_ca_system_score_codex":0.000060738064,"about_ca_system_score_gemma":0.000099016135,"threshold_uncertainty_score":0.47158754},"labels":[],"label_agreement":null},{"id":"W2610069999","doi":"10.1090/crmm/017/07","title":"Other applications in algebra","year":2002,"lang":"en","type":"book-chapter","venue":"CRM monograph series","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Algebra over a field; Computer science; Mathematics; Pure mathematics","score_opus":0.01875829821151558,"score_gpt":0.21961246774543333,"score_spread":0.20085416953391774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610069999","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046500638,0.0034259958,0.11032836,0.00032186773,0.00020420039,0.0005449536,0.000017686545,0.00044107728,0.88466936],"genre_scores_gemma":[0.022072148,0.0042178896,0.05842799,0.0020349573,0.0006442352,0.0008023456,0.000080870945,0.0002766632,0.9114429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986795,0.000009812006,0.0003011579,0.0005539799,0.00017504158,0.0002804957],"domain_scores_gemma":[0.99881566,0.000041538264,0.00015215795,0.0008697346,0.000040489493,0.00008043241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000049963746,0.000337817,0.0003225575,0.000385539,0.00011742019,0.00010249079,0.000861911,0.00024110614,0.00019017793],"category_scores_gemma":[0.000002655809,0.00031513264,0.00016570768,0.00019526295,0.00019539651,0.00044915616,0.00018044247,0.00030769134,0.00016620304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013807335,0.000014391546,0.00013899585,0.000013747885,0.0000137875595,0.000008293787,0.0001933649,0.0000068712966,0.000002630544,0.9899505,0.00025429382,0.009401744],"study_design_scores_gemma":[0.00006379412,0.000030828673,0.00015964975,0.000029704588,0.000005133674,0.000005748425,0.0000094190245,0.0000247672,0.000018641718,0.5908133,0.40855926,0.00027977422],"about_ca_topic_score_codex":0.0000039978277,"about_ca_topic_score_gemma":0.000027402039,"teacher_disagreement_score":0.40830496,"about_ca_system_score_codex":0.000022902195,"about_ca_system_score_gemma":0.000018090634,"threshold_uncertainty_score":0.9999301},"labels":[],"label_agreement":null},{"id":"W2612192355","doi":"","title":"Provability and Countermodels in Gödel-Dummett Logics","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Sequent; Gödel; Generalization; Class (philosophy); Sequent calculus; Computer science; Characterization (materials science); T-norm fuzzy logics; Discrete mathematics; Mathematics; Calculus (dental); Programming language; Artificial intelligence; Mathematical proof","score_opus":0.029662061229699572,"score_gpt":0.2891000070212855,"score_spread":0.25943794579158597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612192355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10071407,0.0003543494,0.888752,0.00041144114,0.00030642614,0.00042700086,0.0000028044535,0.00018033387,0.0088515645],"genre_scores_gemma":[0.86486965,0.000067984874,0.13389564,0.0008559078,0.00004256224,0.000025087062,0.0000041413155,0.0000073156443,0.00023168838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980723,0.00005790036,0.00037384356,0.0009128148,0.00023356934,0.00034952987],"domain_scores_gemma":[0.99873865,0.00011303605,0.00011211687,0.0008673551,0.00007827999,0.00009054493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007369566,0.00025656229,0.00033876134,0.00014218099,0.000038668197,0.00013714106,0.0008799951,0.00028343414,0.000011613861],"category_scores_gemma":[0.00005195791,0.00020636425,0.000056536053,0.00018457229,0.000097445256,0.0002530407,0.0021904802,0.0006196244,0.000008922174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003137937,0.0004460872,0.012395889,0.00047559632,0.000028462266,0.0001965079,0.001736125,0.013960345,0.000079500256,0.73488194,0.00026349642,0.2355047],"study_design_scores_gemma":[0.0003006093,0.000056091154,0.012374759,0.000057018995,0.0000036516492,0.000011826195,0.000026152858,0.24799427,0.00017951686,0.73775685,0.00072538224,0.0005138531],"about_ca_topic_score_codex":0.00006812346,"about_ca_topic_score_gemma":0.0001035087,"teacher_disagreement_score":0.7641556,"about_ca_system_score_codex":0.00009968976,"about_ca_system_score_gemma":0.00009259702,"threshold_uncertainty_score":0.84152895},"labels":[],"label_agreement":null},{"id":"W2625648138","doi":"10.14232/actasm-016-514-2","title":"Lattices with unique complementation","year":2017,"lang":"en","type":"article","venue":"Acta Scientiarum Mathematicarum","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Complementation; Statistical physics; Physics; Biology; Genetics","score_opus":0.026329664488094654,"score_gpt":0.2914280191593485,"score_spread":0.26509835467125387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625648138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109785065,0.000014406882,0.8554262,0.007267595,0.00030459996,0.00033845592,0.0000031812651,0.0002466341,0.026613845],"genre_scores_gemma":[0.8494072,0.0000022834458,0.14985473,0.00018085408,0.00002250709,0.000015914102,0.0000020601408,0.000008100397,0.0005063282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998636,0.000030174235,0.0001876946,0.00039189254,0.00039484963,0.00035936115],"domain_scores_gemma":[0.9980349,0.000076609365,0.00030526123,0.0014005373,0.00007848963,0.00010419081],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003907329,0.00014570013,0.00016703147,0.00007910324,0.0010106247,0.0010506707,0.0019452757,0.000028916393,0.000056655164],"category_scores_gemma":[0.00007084488,0.000104278595,0.00004132872,0.00014006771,0.0002093477,0.0018454492,0.0004648643,0.00008765802,0.000092112394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004429088,0.000108812295,0.001442244,0.00005230925,0.000031604523,0.000019875244,0.0009868466,0.000013181135,0.003378222,0.9885476,0.0007817076,0.004633156],"study_design_scores_gemma":[0.0021342498,0.0004951888,0.032738015,0.00034059878,0.00008529767,0.0001725406,0.0006389314,0.07303053,0.03291566,0.84229416,0.0138211,0.0013337428],"about_ca_topic_score_codex":0.000005727498,"about_ca_topic_score_gemma":0.000022283126,"teacher_disagreement_score":0.7396222,"about_ca_system_score_codex":0.00002011086,"about_ca_system_score_gemma":0.000041041327,"threshold_uncertainty_score":0.99998635},"labels":[],"label_agreement":null},{"id":"W2726927860","doi":"10.7146/brics.v7i28.20161","title":"Free mu-lattices","year":2000,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Université du Québec à Montréal","keywords":"Unary operation; Decidability; Combinatorics; Equivalence relation; Mathematics; Lattice (music); Partially ordered set; Discrete mathematics; Physics","score_opus":0.015413666733595609,"score_gpt":0.2429280225979744,"score_spread":0.2275143558643788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726927860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38224265,0.0015085236,0.27186078,0.0059849373,0.0014975077,0.00034059677,0.000007405487,0.0017557509,0.33480185],"genre_scores_gemma":[0.73663825,0.00031442015,0.18804626,0.0012535437,0.0003305254,0.000032313317,0.000011445953,0.00002701584,0.07334626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989975,0.000013832818,0.00023003505,0.00031293862,0.00022859462,0.00021709704],"domain_scores_gemma":[0.99889654,0.000026051604,0.000088285604,0.0008738411,0.000047189747,0.0000680796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011880516,0.00010370219,0.00012443401,0.000032073756,0.00013911663,0.000118289885,0.00062101654,0.00004071499,0.00019122685],"category_scores_gemma":[0.00007184166,0.0000907869,0.000046483365,0.00028462178,0.000058885224,0.00093687733,0.00015091048,0.00007507555,0.00008555327],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003095202,0.00022622205,0.011011443,0.0000567402,0.00006777552,0.012877001,0.0017578959,0.0010857488,0.00071602495,0.4991683,0.016222958,0.4567789],"study_design_scores_gemma":[0.00017847489,0.00010177278,0.019466767,0.000011923628,0.0000072422617,0.00445513,0.000035950787,0.000634068,0.0020497795,0.23614608,0.73651356,0.00039923628],"about_ca_topic_score_codex":0.000014558469,"about_ca_topic_score_gemma":0.000012182367,"teacher_disagreement_score":0.7202906,"about_ca_system_score_codex":0.000012404471,"about_ca_system_score_gemma":0.000042893917,"threshold_uncertainty_score":0.37021825},"labels":[],"label_agreement":null},{"id":"W2730432623","doi":"10.1007/s00012-018-0487-y","title":"Some preliminary results on the set of principal congruences of a finite lattice","year":2018,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Congruence lattice problem; Mathematics; Distributive lattice; Lattice (music); Congruence (geometry); Isomorphism (crystallography); Pure mathematics; Distributive property; Finite set; Combinatorics; Discrete mathematics; Mathematical analysis; Geometry; Physics; Crystal structure; Crystallography","score_opus":0.02702203790602267,"score_gpt":0.2521842133965554,"score_spread":0.22516217549053272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730432623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96810937,0.00014632019,0.011616557,0.0036392543,0.00050978834,0.0003716269,0.0000885206,0.00013481747,0.015383735],"genre_scores_gemma":[0.9965751,0.000026639545,0.0026185338,0.0003896903,0.00009701742,0.0000017691997,0.0000038054734,0.000005532068,0.0002819094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885184,0.000117685166,0.0002513309,0.0002923375,0.00027643386,0.00021040149],"domain_scores_gemma":[0.9979028,0.00092251814,0.00026141127,0.00070036715,0.00015974055,0.000053175772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002741015,0.00012503151,0.00017268569,0.000096597396,0.000105684325,0.000016437973,0.0011111904,0.000055853907,0.000021217027],"category_scores_gemma":[0.00024285683,0.00008597979,0.000067180204,0.00043415825,0.00045940987,0.0004583278,0.00027602314,0.00010692545,0.000029976829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019218723,0.00004223061,0.000067821675,0.000010767633,0.000031604748,0.000015027989,0.0028238164,0.00009054431,0.00018908958,0.99452966,0.00046880438,0.0015384597],"study_design_scores_gemma":[0.005300245,0.01806567,0.024638541,0.0006970086,0.00016842449,0.00004242105,0.0046336013,0.044851743,0.14973935,0.7162525,0.034115497,0.0014949575],"about_ca_topic_score_codex":0.000063071755,"about_ca_topic_score_gemma":0.000010728322,"teacher_disagreement_score":0.2782771,"about_ca_system_score_codex":0.000016985068,"about_ca_system_score_gemma":0.00007500156,"threshold_uncertainty_score":0.35061538},"labels":[],"label_agreement":null},{"id":"W2735271195","doi":"10.1515/ms-2017-0013","title":"Hamiltonian ordered algebras and congruence extension","year":2017,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Congruence relation; Mathematics; Congruence (geometry); Extension (predicate logic); Hamiltonian (control theory); Pure mathematics; Algebra over a field; Geometry; Computer science","score_opus":0.022938792321312254,"score_gpt":0.2718820860113103,"score_spread":0.24894329368999807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735271195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44093663,0.00036916274,0.53367835,0.0037651863,0.0003710138,0.00040047686,0.0000015719615,0.00036437064,0.020113239],"genre_scores_gemma":[0.89146346,0.000031834385,0.10752966,0.00031450056,0.000028679306,0.000011815748,3.615592e-7,0.000009846319,0.0006098278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988948,0.000022301188,0.00019776792,0.00041333158,0.0002007716,0.0002710133],"domain_scores_gemma":[0.9981106,0.00009733449,0.00017025037,0.00143778,0.000060329545,0.00012371302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016762425,0.00015981775,0.00022880142,0.000044996355,0.0005884403,0.0004067025,0.0010821053,0.00006037616,0.000031015294],"category_scores_gemma":[0.00032505134,0.00012649156,0.00003812967,0.000060860413,0.00017411682,0.00068310095,0.00059775286,0.00011130361,0.00016621198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003865543,0.000065466025,0.00023049058,0.00006694307,0.00001462479,0.000095239746,0.0008398792,0.0000024969788,0.003895928,0.9552124,0.00050289475,0.039069742],"study_design_scores_gemma":[0.00061438675,0.000084731226,0.021691643,0.00012727435,0.000013293741,0.00022816146,0.00006182474,0.021351036,0.0024955592,0.9498825,0.0029953478,0.0004542284],"about_ca_topic_score_codex":0.000004985039,"about_ca_topic_score_gemma":0.000004128732,"teacher_disagreement_score":0.45052686,"about_ca_system_score_codex":0.000011239741,"about_ca_system_score_gemma":0.00002269696,"threshold_uncertainty_score":0.51581764},"labels":[],"label_agreement":null},{"id":"W2735620533","doi":"10.70930/tac/kxsbnt6z","title":"Birkhoff's Variety Theorem With and Without Free Algebras","year":2005,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variety (cybernetics); Mathematics; Pure mathematics; Algebra over a field; Statistics","score_opus":0.006019634179096197,"score_gpt":0.22544979947679772,"score_spread":0.2194301652977015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735620533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046094876,0.00090759975,0.94744676,0.00053912005,0.0000074586446,0.00020155148,0.0000039010433,0.00010185575,0.0046968707],"genre_scores_gemma":[0.9687382,0.00009023973,0.030637473,0.00017340928,0.000047021433,0.000071967006,0.0000018614458,0.0000065014074,0.00023333468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993818,0.00004160771,0.00012599169,0.00023623616,0.00008839522,0.00012596608],"domain_scores_gemma":[0.9991426,0.00014147558,0.00007759037,0.00052510883,0.000054471966,0.000058792797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026949757,0.00011035759,0.00013698237,0.00004134729,0.00017817988,0.00004603352,0.00037812346,0.000035056968,0.000009261104],"category_scores_gemma":[0.000014584635,0.00007810475,0.000014034484,0.00019843824,0.00048495893,0.00036201917,0.00015577473,0.00007155719,0.0000034100888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022676957,0.00002419101,0.00034248378,0.000010329931,0.000011244329,9.278471e-8,0.0005585621,0.0000121836765,0.00019550337,0.9403784,0.000011515183,0.05843278],"study_design_scores_gemma":[0.00026162702,0.00005730007,0.0009834357,0.0000047820017,0.000013362124,0.00002168067,0.00022100423,0.0001249139,0.005784688,0.9864753,0.0059289583,0.00012295629],"about_ca_topic_score_codex":0.0000025087872,"about_ca_topic_score_gemma":0.000004713432,"teacher_disagreement_score":0.9226433,"about_ca_system_score_codex":0.0000041020785,"about_ca_system_score_gemma":0.000024568624,"threshold_uncertainty_score":0.31850192},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014079443054577048,"score_gpt":0.20382085682800505,"score_spread":0.189741413773428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738364938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9030275,0.0003475117,0.084822714,0.0016319316,0.0009087411,0.00015069604,0.000002445759,0.000006670508,0.009101814],"genre_scores_gemma":[0.99369246,0.0000048826464,0.005799986,0.0002698183,0.00001633389,3.0950156e-7,6.55235e-8,0.000005329494,0.00021081601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933827,0.000023848053,0.00025177177,0.000053936208,0.00018534067,0.00014684773],"domain_scores_gemma":[0.99885875,0.0002680163,0.00027467104,0.00031998992,0.00012047041,0.00015812725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031772399,0.0000663681,0.00015501087,0.00009702474,0.00004427111,0.000031448886,0.000783099,0.000029083543,0.0000830848],"category_scores_gemma":[0.00015935402,0.000040961982,0.000085836145,0.00018679144,0.000034445766,0.00010542166,0.000018692646,0.00014350028,0.000060817154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.8449628e-7,0.000017559745,0.00019517865,0.000015163043,0.0000132617715,0.000013421984,0.00058828766,0.00010016819,0.000039531067,0.99755037,0.0012067023,0.00026004305],"study_design_scores_gemma":[0.00020975899,0.00023371821,0.00040297973,0.00010346608,0.000009070374,0.00009593307,0.00030162497,0.0018638289,0.0012740934,0.99331886,0.002091731,0.000094946976],"about_ca_topic_score_codex":0.000018501249,"about_ca_topic_score_gemma":0.000069891976,"teacher_disagreement_score":0.09066499,"about_ca_system_score_codex":0.0000448048,"about_ca_system_score_gemma":0.00031375125,"threshold_uncertainty_score":0.16703811},"labels":[],"label_agreement":null},{"id":"W2742114789","doi":"10.48550/arxiv.1708.00344","title":"Complexities of Erez self-dual normal bases","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Dual (grammatical number); Computer science; Mathematics; Psychology; Art; Literature","score_opus":0.10193294542713979,"score_gpt":0.19926154827953546,"score_spread":0.09732860285239567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742114789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40514484,0.00014829749,0.56458235,0.000099207486,0.0009461278,0.0002700759,0.000050023515,0.0004900503,0.02826902],"genre_scores_gemma":[0.99162596,0.00009052483,0.0069963075,0.000055944165,0.000091138245,4.68424e-7,0.000011841741,0.000010595547,0.0011171858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985473,0.00008598796,0.00019100466,0.000744293,0.00010553054,0.00032588627],"domain_scores_gemma":[0.99759275,0.00011201858,0.00044790324,0.0015646883,0.00016167441,0.00012099804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013207666,0.00028181623,0.00042381257,0.00017901059,0.0002515557,0.000112762194,0.0022821173,0.00018086491,0.00004572179],"category_scores_gemma":[0.00002795843,0.0003083144,0.00021680382,0.00014284253,0.0002511491,0.00070667325,0.0029224309,0.0003847309,0.000045366607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021455304,0.00013526996,0.0021439074,0.00015117778,0.00010565942,0.00038156405,0.00035407348,0.035519462,0.000023180828,0.9603099,0.000295402,0.0005589239],"study_design_scores_gemma":[0.0011957245,0.00026923016,0.010520418,0.00026049122,0.00016039253,0.000031268595,0.00030406562,0.29078683,0.001210356,0.6903577,0.00352786,0.0013756404],"about_ca_topic_score_codex":0.000113764,"about_ca_topic_score_gemma":0.000034788547,"teacher_disagreement_score":0.58648115,"about_ca_system_score_codex":0.000071779905,"about_ca_system_score_gemma":0.00020510078,"threshold_uncertainty_score":0.9999369},"labels":[],"label_agreement":null},{"id":"W2754756029","doi":"","title":"Approximation Algorithms using Allegories and Coq","year":2017,"lang":"en","type":"dissertation","venue":"Brock University Digital Repository (Brock University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Brock University","keywords":"Computer science; Algorithm; Mathematics","score_opus":0.014277890155904539,"score_gpt":0.2100497208649349,"score_spread":0.19577183070903037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754756029","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2608126,0.00082678645,0.34102178,0.0000111819745,0.0040654354,0.0015025225,0.00014586882,0.0017163982,0.3898974],"genre_scores_gemma":[0.049898725,0.00014159213,0.0048071006,0.000012080572,0.00014274966,1.810496e-7,0.00019328881,0.000038088434,0.9447662],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980276,0.000060072787,0.0001953367,0.0009221594,0.0003953132,0.00039951538],"domain_scores_gemma":[0.9980764,0.0000697898,0.0005695266,0.0007121774,0.00030863468,0.00026350762],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0000026427178,0.00045575653,0.00043200285,0.0005520558,0.001395269,0.00068290695,0.0015348854,0.00041890916,0.000001280297],"category_scores_gemma":[0.00003486258,0.0005774209,0.00019855346,0.0003375647,0.0001390236,0.0051340833,0.00047723012,0.00036909102,0.000010855306],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062015867,0.0044324985,0.053317662,0.007142688,0.0065508736,0.019214917,0.006403793,0.0055658277,0.1819534,0.15209982,0.1181016,0.43901536],"study_design_scores_gemma":[0.008606686,0.0015086333,0.02476234,0.0020696858,0.0015304801,0.0014705821,0.10147375,0.0049587656,0.007859042,0.012180976,0.823289,0.010290071],"about_ca_topic_score_codex":0.000056860034,"about_ca_topic_score_gemma":0.00013854021,"teacher_disagreement_score":0.7051874,"about_ca_system_score_codex":0.00034595968,"about_ca_system_score_gemma":0.0002925712,"threshold_uncertainty_score":0.99990475},"labels":[],"label_agreement":null},{"id":"W2757110170","doi":"10.4230/lipics.cosit.2017.2","title":"A New Perspective on the Mereotopology of RCC8","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary relation; Axiom; Conservative extension; Extension (predicate logic); Disjoint sets; Isomorphism (crystallography); Set theory; Mathematics; Characterization (materials science); Interpretation (philosophy); Pairwise comparison; Perspective (graphical); Computer science; Set (abstract data type); Algebra over a field; Theoretical computer science; Discrete mathematics; Pure mathematics; Artificial intelligence","score_opus":0.02455929192061818,"score_gpt":0.30054820678367833,"score_spread":0.27598891486306015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757110170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07238407,0.00008460163,0.82642514,0.012201275,0.0020089757,0.0017838258,0.00012951494,0.00021444866,0.084768154],"genre_scores_gemma":[0.9736553,0.000021692947,0.023758497,0.0016275122,0.0001469334,0.00004531379,0.000008541137,0.00001770583,0.000718512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983424,0.000031493302,0.00054781715,0.00024005282,0.00033278513,0.000505467],"domain_scores_gemma":[0.996956,0.0002383232,0.0006894336,0.0017383868,0.00024202093,0.00013582486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003386245,0.0002676992,0.00035993988,0.00011656008,0.000718249,0.00028284188,0.0028445395,0.00012715912,0.0000454449],"category_scores_gemma":[0.00033632052,0.0001753227,0.00022617284,0.00011071731,0.0002722436,0.0011815157,0.0006326914,0.0003301185,0.00011704843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004663393,0.0000798234,0.0005129161,0.000033215056,0.00007641065,0.0000026203725,0.008710317,0.00003324631,0.000033046537,0.9787775,0.00310202,0.008592207],"study_design_scores_gemma":[0.010818733,0.0034211609,0.011805865,0.00045552923,0.00012134746,0.00020928771,0.017571319,0.054468818,0.018466955,0.72718316,0.15331347,0.0021643639],"about_ca_topic_score_codex":0.000066628396,"about_ca_topic_score_gemma":0.00002494497,"teacher_disagreement_score":0.9012712,"about_ca_system_score_codex":0.00008982072,"about_ca_system_score_gemma":0.00010948361,"threshold_uncertainty_score":0.7149452},"labels":[],"label_agreement":null},{"id":"W2760877405","doi":"10.46298/dmtcs.2896","title":"Primitive orthogonal idempotents for R-trivial monoids","year":2011,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monoid; Mathematics; Equivalence (formal languages); Semigroup; Syntactic monoid; Combinatorics; Free monoid; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.04291743966476476,"score_gpt":0.28343176844877943,"score_spread":0.24051432878401469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760877405","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010638817,0.0002964347,0.9716911,0.0011775678,0.0032567238,0.0010907936,0.00005438717,0.00020367745,0.011590515],"genre_scores_gemma":[0.4423209,0.000018836368,0.55655324,0.0004955887,0.0003475939,0.00004928128,0.0000035268808,0.00003270671,0.0001783416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939662,0.00018157302,0.001024167,0.0016682525,0.0012733777,0.0018864088],"domain_scores_gemma":[0.9957165,0.00085441757,0.0004050376,0.0014236283,0.0007590388,0.00084135344],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0025208811,0.0006947786,0.0007678687,0.0002669279,0.0010073463,0.00071578694,0.0040931813,0.000251627,0.00027085506],"category_scores_gemma":[0.0005369348,0.00059045025,0.00043667716,0.0013665487,0.008487006,0.0018510915,0.0021676272,0.000506738,0.0002325787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032469165,0.00044583957,0.000028830902,0.0001413677,0.000034930894,0.000041678966,0.006568123,0.000042500444,0.00019409427,0.967082,0.00007704409,0.02531111],"study_design_scores_gemma":[0.00039808755,0.0005796483,0.000266885,0.00017923527,0.000048933816,0.00008153886,0.000070509304,0.4207968,0.0014380189,0.5754613,0.00017794094,0.0005010811],"about_ca_topic_score_codex":0.000003995303,"about_ca_topic_score_gemma":0.0000012178007,"teacher_disagreement_score":0.43168208,"about_ca_system_score_codex":0.0001254476,"about_ca_system_score_gemma":0.0004381946,"threshold_uncertainty_score":0.9996547},"labels":[],"label_agreement":null},{"id":"W2764791499","doi":"","title":"Two Fσδ ideals","year":2003,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Quotient; Homogeneous; Combinatorics; Ideal (ethics); Discrete mathematics; Pure mathematics; Epistemology; Philosophy","score_opus":0.012445763625284588,"score_gpt":0.26068434484902114,"score_spread":0.24823858122373654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764791499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67428917,0.000088294604,0.24897611,0.0028089941,0.000107677144,0.00044244595,0.0000013405796,0.00029212955,0.07299386],"genre_scores_gemma":[0.7121555,0.000009230959,0.28677306,0.00085280027,0.000016825927,0.000012296881,2.0950807e-8,0.000008077151,0.00017218817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998869,0.000009638656,0.00025114193,0.00024670892,0.00033120892,0.00029229774],"domain_scores_gemma":[0.99912935,0.00013268813,0.0003322164,0.00021559976,0.000109859764,0.0000803029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003783277,0.00013345419,0.00029244687,0.0000109563525,0.00012216151,0.000051519408,0.0009829903,0.000019983634,0.000015155133],"category_scores_gemma":[0.00030744728,0.00008185799,0.00027623758,0.0006665145,0.00040180958,0.00022060996,0.0002492934,0.00014815784,0.000021651857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.57673e-7,0.000056486646,0.0005096397,0.00003727469,0.000017194043,6.640617e-8,0.00055714644,0.0000028399736,0.00547997,0.99162483,0.0007662685,0.00094755035],"study_design_scores_gemma":[0.0001615991,0.000054284385,0.00053682405,0.000030113082,0.000012784083,0.000018757955,0.00066172436,0.0019002615,0.015835872,0.98000574,0.0006226429,0.0001593761],"about_ca_topic_score_codex":0.0000018292645,"about_ca_topic_score_gemma":3.3130814e-8,"teacher_disagreement_score":0.07282167,"about_ca_system_score_codex":0.000030582418,"about_ca_system_score_gemma":0.000023029701,"threshold_uncertainty_score":0.33380717},"labels":[],"label_agreement":null},{"id":"W2767102739","doi":"10.1007/s10474-005-0213-z","title":"Notes on sectionally complemented lattices. I","year":2005,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Lattice (music); Complement (music); Congruence lattice problem; Distributive lattice; Pure mathematics; Congruence (geometry); Distributive property; Combinatorics; Geometry; Physics","score_opus":0.029419588610647522,"score_gpt":0.2900302622263403,"score_spread":0.2606106736156928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767102739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04020341,0.00015477155,0.8464064,0.065617196,0.0013304513,0.0008928957,0.000018963978,0.0013913437,0.043984577],"genre_scores_gemma":[0.8897021,0.0000140060765,0.1049218,0.0035625957,0.00029949794,0.00003773143,0.000007687033,0.000022727263,0.0014318913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967495,0.00009423114,0.0005719432,0.0008375625,0.0009874641,0.0007592505],"domain_scores_gemma":[0.99775803,0.00067013304,0.00029066097,0.000903463,0.00010887817,0.00026885574],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008642023,0.0003319338,0.00034349711,0.0003009276,0.00055235706,0.00028009736,0.0020647917,0.00017311628,0.00038903652],"category_scores_gemma":[0.00040706922,0.00026567277,0.00015523961,0.001031558,0.00016647157,0.001214989,0.0005612752,0.00065687863,0.0011982104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010037526,0.00053274207,0.0001555747,0.000049078873,0.00006831482,0.000007166899,0.001085172,0.00035370985,0.008432449,0.95331925,0.019275662,0.016710863],"study_design_scores_gemma":[0.0022231268,0.00042724423,0.005639227,0.0002647844,0.00009838488,0.0001766823,0.00015127932,0.2915636,0.03121759,0.29041293,0.3757873,0.002037855],"about_ca_topic_score_codex":0.0000015918389,"about_ca_topic_score_gemma":0.0000058508476,"teacher_disagreement_score":0.8494986,"about_ca_system_score_codex":0.000118340766,"about_ca_system_score_gemma":0.0000720447,"threshold_uncertainty_score":0.99997956},"labels":[],"label_agreement":null},{"id":"W2767352756","doi":"","title":"The Inverse-conjugate Compositions With Odd Parts.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjugate; Inverse; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.014436374738355129,"score_gpt":0.24244550119245462,"score_spread":0.2280091264540995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767352756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.867388,0.00039162303,0.026002169,0.023185968,0.007670381,0.00085471256,0.0000057723796,0.0008245254,0.07367683],"genre_scores_gemma":[0.99725235,0.00002432029,0.0019921304,0.00028941064,0.000009443464,0.000021667978,0.0000010445856,0.000007306752,0.00040236014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991503,0.00003969977,0.00011097526,0.00024481706,0.00017794185,0.00027626046],"domain_scores_gemma":[0.9983071,0.00010639294,0.0001358566,0.001284483,0.00007152125,0.00009462426],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00014355169,0.000115987365,0.00010827201,0.000017138434,0.0021154543,0.0005425053,0.0014889033,0.000031537173,0.0000036670265],"category_scores_gemma":[0.00003393529,0.00007288911,0.00003765888,0.000072198,0.00024477433,0.00061607064,0.00029061682,0.00014563285,0.00011164486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050251656,0.000026343216,0.0010816903,0.0000013623063,0.000013148395,0.000022877099,0.00010515417,0.00002688493,0.000046690944,0.9952969,0.0017102836,0.001663673],"study_design_scores_gemma":[0.0007110412,0.000144574,0.009096751,0.000017182581,0.000007445386,0.000018903966,0.00002190556,0.002829322,0.00062927185,0.96621376,0.020119071,0.00019077414],"about_ca_topic_score_codex":0.000020380034,"about_ca_topic_score_gemma":0.00006469066,"teacher_disagreement_score":0.1298643,"about_ca_system_score_codex":0.000022391127,"about_ca_system_score_gemma":0.0000432886,"threshold_uncertainty_score":0.99918365},"labels":[],"label_agreement":null},{"id":"W2768006416","doi":"10.1007/s00012-017-0475-7","title":"Simpler Maltsev conditions for (weak) difference terms in locally finite varieties","year":2017,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Class (philosophy); Variety (cybernetics); Simple (philosophy); Term (time); Algebra over a field; Significant difference; Pure mathematics; Finite difference; Mathematical analysis; Computer science; Statistics; Artificial intelligence","score_opus":0.022531028905507337,"score_gpt":0.2690796457387276,"score_spread":0.24654861683322027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768006416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062690586,0.00003765791,0.9224644,0.0030141298,0.00047804642,0.0004598431,0.0000715449,0.00020989256,0.010573947],"genre_scores_gemma":[0.99132556,0.00002676875,0.0060994453,0.0005101868,0.000052177988,0.000027538932,0.000023628403,0.0000128114325,0.0019219149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873614,0.000036165788,0.00019606738,0.0004531252,0.00015922777,0.00041927164],"domain_scores_gemma":[0.9983249,0.0003206855,0.00016884011,0.0009972545,0.00007828948,0.00011003599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010986484,0.0001899991,0.00022406179,0.00013946395,0.00061774615,0.00028868657,0.0016243589,0.0000968265,0.000046596364],"category_scores_gemma":[0.0001691244,0.00018018197,0.00009037519,0.00012923853,0.00023375795,0.0011016754,0.000376139,0.000147473,0.00002936837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015586946,0.00005300638,0.0027197096,0.000014178065,0.000016514281,0.000037871803,0.0006618357,0.00016390263,0.00024383412,0.9891171,0.0005419153,0.0064145587],"study_design_scores_gemma":[0.0022377153,0.00027632434,0.11318217,0.00006718706,0.000021415422,0.000012506817,0.0002979677,0.028092094,0.0008247641,0.8393326,0.0149548,0.0007004721],"about_ca_topic_score_codex":0.00010067881,"about_ca_topic_score_gemma":0.0002644637,"teacher_disagreement_score":0.92863494,"about_ca_system_score_codex":0.000054244716,"about_ca_system_score_gemma":0.000073843046,"threshold_uncertainty_score":0.73476076},"labels":[],"label_agreement":null},{"id":"W2779115047","doi":"10.1007/bf03651379","title":"Universal expansions and determinacy for finitely generated varieties of dp-algebras","year":2012,"lang":"en","type":"article","venue":"Acta Scientiarum Mathematicarum","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Determinacy; Mathematics; Finitely-generated abelian group; Pure mathematics; Variety (cybernetics); Algebra over a field; Mathematical analysis; Statistics","score_opus":0.024694332605429272,"score_gpt":0.2566584973593244,"score_spread":0.2319641647538951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779115047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42370725,0.00028234688,0.5739905,0.0005239935,0.0003999695,0.00030830156,0.000010203181,0.00010758209,0.00066983624],"genre_scores_gemma":[0.8701926,0.000008499268,0.1293659,0.00008725734,0.00003338741,0.000015611562,0.000003016218,0.000010645378,0.00028312072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986605,0.00004107413,0.0002764891,0.00029206555,0.00024228789,0.00048756748],"domain_scores_gemma":[0.998707,0.000353141,0.00016616282,0.0004937223,0.00010740457,0.00017256165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044389625,0.00016484466,0.0002514724,0.00015803042,0.00025147627,0.00009387877,0.00057534385,0.00006698288,0.00002219822],"category_scores_gemma":[0.00019373761,0.00013650069,0.00007789163,0.00041637477,0.00021005006,0.001029761,0.00036336738,0.00007224647,0.000009547902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008466523,0.00022395955,0.0003505673,0.00013896653,0.000048017006,0.0000018166864,0.005019835,0.000008310695,0.040452864,0.9491618,0.00095086143,0.0036344903],"study_design_scores_gemma":[0.0025218814,0.00072324526,0.0043559056,0.00023083866,0.00035359536,0.00020092585,0.0022604705,0.11129855,0.15511884,0.7106053,0.010683161,0.00164726],"about_ca_topic_score_codex":0.0000016877182,"about_ca_topic_score_gemma":9.941583e-7,"teacher_disagreement_score":0.4464853,"about_ca_system_score_codex":0.000015419248,"about_ca_system_score_gemma":0.00004963013,"threshold_uncertainty_score":0.55663365},"labels":[],"label_agreement":null},{"id":"W2782348134","doi":"10.28924/2291-8639-16-2018-117","title":"Permanently Weak Amenability of Rees Semigroup Algebras","year":2018,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Islamic Azad University","keywords":"Mathematics; Semigroup; Pure mathematics; Algebra over a field","score_opus":0.007862526442753284,"score_gpt":0.28135086781960145,"score_spread":0.2734883413768482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782348134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14994936,0.00013926487,0.84776497,0.0010183488,0.000053663214,0.00003800651,0.0000050271897,0.0000075991306,0.0010237492],"genre_scores_gemma":[0.98239577,0.00010232234,0.017098002,0.00011152342,0.00021060085,0.0000038199914,0.0000024847345,0.0000018782052,0.00007361777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999069,0.000025092093,0.00039281946,0.00014455049,0.00029904474,0.00006950207],"domain_scores_gemma":[0.998531,0.000073795774,0.00040356186,0.00021143556,0.0007197758,0.00006042778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020523176,0.00006281685,0.00017288559,0.00026104238,0.0000538689,0.000049784125,0.0006703717,0.000023222397,0.000043301276],"category_scores_gemma":[0.000025416259,0.00004937778,0.0001526657,0.00048448422,0.0001247363,0.00027286643,0.000105582316,0.000067517634,0.0000041108037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033950524,0.00053472834,0.057221994,0.000009933888,0.0024468468,0.0000055186288,0.0008782653,0.00046662797,0.01674572,0.7671221,0.0005073945,0.15402691],"study_design_scores_gemma":[0.001306466,0.00061957183,0.48250905,0.00005997149,0.0010786761,0.00021518096,0.0006351732,0.028183755,0.024354538,0.37365142,0.08680152,0.0005846897],"about_ca_topic_score_codex":0.000011869291,"about_ca_topic_score_gemma":0.00001877888,"teacher_disagreement_score":0.8324464,"about_ca_system_score_codex":0.000022311095,"about_ca_system_score_gemma":0.000028188952,"threshold_uncertainty_score":0.20135675},"labels":[],"label_agreement":null},{"id":"W2789315418","doi":"10.1080/11663081.2018.1442138","title":"Mixed algebras and their logics","year":2017,"lang":"en","type":"article","venue":"Journal of Applied Non-Classical Logics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algebra over a field; Frame (networking); Algebraic number; Mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.031034268775185638,"score_gpt":0.24783940736876114,"score_spread":0.2168051385935755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789315418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15869214,0.00017610204,0.807273,0.004563418,0.0010516798,0.00020283528,0.0000030047777,0.0000634129,0.02797447],"genre_scores_gemma":[0.94293785,0.0001459879,0.055711873,0.0007202555,0.00039440964,0.0000026789075,4.171104e-7,0.000011604032,0.00007490443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984047,0.00003017464,0.0005024344,0.00033482502,0.0003336433,0.0003942664],"domain_scores_gemma":[0.9976859,0.00026674263,0.00087540806,0.000722889,0.00014026556,0.00030879505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054720126,0.00026971116,0.00053403317,0.000090800946,0.00050903746,0.00045505923,0.0018526945,0.00018760393,0.000009087781],"category_scores_gemma":[0.00015814348,0.00016740392,0.00015553409,0.00010605236,0.00034496677,0.00054866466,0.00066985696,0.00061612134,0.000022880844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098630735,0.00024058639,0.0003310107,0.000021380489,0.0000701623,0.00018128552,0.00037694338,0.0001425643,0.010946924,0.82575935,0.0020832499,0.1597479],"study_design_scores_gemma":[0.0018806204,0.00080485106,0.020084545,0.000046102785,0.000031354048,0.00032955664,0.00018365809,0.008822423,0.013699763,0.93191105,0.021590509,0.00061553856],"about_ca_topic_score_codex":4.4301518e-7,"about_ca_topic_score_gemma":0.0000017492556,"teacher_disagreement_score":0.7842457,"about_ca_system_score_codex":0.000042566502,"about_ca_system_score_gemma":0.00008690886,"threshold_uncertainty_score":0.6826534},"labels":[],"label_agreement":null},{"id":"W2790002386","doi":"10.1007/s00233-018-9920-y","title":"Coordinatizing some concrete MV algebras and a decomposition theorem","year":2018,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Algebra over a field; Decomposition; Decomposition theorem; Pure mathematics; Discrete mathematics; Arithmetic","score_opus":0.0072756677335858114,"score_gpt":0.2506468593327832,"score_spread":0.24337119159919737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790002386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4276694,0.00088325597,0.5627989,0.0027353587,0.00055282086,0.00022783852,0.0000035257624,0.00039864882,0.0047302074],"genre_scores_gemma":[0.9761107,0.000023772678,0.0213504,0.0021880153,0.00017032475,0.000009641438,0.0000035077924,0.000010871649,0.0001327464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888474,0.000045141773,0.00015969017,0.0003759999,0.00014295705,0.00039145243],"domain_scores_gemma":[0.9993416,0.00009476444,0.00007768366,0.0003280089,0.000052351726,0.00010560319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017742952,0.00014775535,0.00015202803,0.000071085895,0.00029735928,0.00012311505,0.00037397782,0.00006517223,0.000015293035],"category_scores_gemma":[0.000024937946,0.00012854148,0.000042080963,0.00019199745,0.0001740178,0.00089830084,0.00030743235,0.00010639427,0.00007299703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007937461,0.0000042799493,0.0005193701,0.0000059357403,0.000010318539,0.000010740662,0.0003930299,7.5469706e-7,0.01007207,0.9667197,0.00072298903,0.021532902],"study_design_scores_gemma":[0.0009437777,0.00070899655,0.0023869774,0.00007683028,0.000013558982,0.00020033175,0.00027284824,0.026887778,0.03238825,0.9235843,0.011954498,0.0005818561],"about_ca_topic_score_codex":0.000007982101,"about_ca_topic_score_gemma":0.000006742356,"teacher_disagreement_score":0.5484413,"about_ca_system_score_codex":0.000028523715,"about_ca_system_score_gemma":0.00001538864,"threshold_uncertainty_score":0.5241769},"labels":[],"label_agreement":null},{"id":"W2790151031","doi":"10.5430/air.v7n1p53","title":"Multisequent Gentzen Deduction Systems For B&lt;sub&gt;2&lt;/sub&gt; &lt;sup&gt;2&lt;/sup&gt;-Valued First-Order Logic","year":2018,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Soundness; Sequent; Sequent calculus; Mathematics; Generalization; Order (exchange); Completeness (order theory); Discrete mathematics; Calculus (dental); Computer science; Programming language; Mathematical analysis; Mathematical proof","score_opus":0.16973123076872068,"score_gpt":0.3924163908098235,"score_spread":0.2226851600411028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790151031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115763284,0.0024892953,0.870807,0.0021870025,0.0030034252,0.0037514148,0.00004609461,0.0006158118,0.0013366884],"genre_scores_gemma":[0.97686833,0.0009829123,0.016706392,0.00019996328,0.0029887029,0.0010136986,0.000050385257,0.0001272089,0.0010623848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9887945,0.0010212102,0.0017463603,0.0026165654,0.002662332,0.0031589968],"domain_scores_gemma":[0.99174017,0.0013083451,0.00042181238,0.002311853,0.0033596512,0.0008581582],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0050000492,0.0008423353,0.0009164533,0.0010441964,0.0025730554,0.0012320246,0.0035097762,0.00060426537,0.0002311712],"category_scores_gemma":[0.0020168868,0.00077366264,0.00041864841,0.0035015973,0.001522665,0.0015324826,0.0013236296,0.0009838903,0.0038391964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006406254,0.001409907,0.00009946628,0.00043621965,0.0002380888,0.00016729691,0.0053850575,0.02175359,0.1808185,0.58674496,0.010846648,0.19145964],"study_design_scores_gemma":[0.0003080817,0.0018643535,0.00007985395,0.00025636994,0.00004012296,0.00009206998,0.0008137396,0.72283715,0.13052973,0.10552246,0.036394108,0.0012619796],"about_ca_topic_score_codex":0.00020368923,"about_ca_topic_score_gemma":0.00071496353,"teacher_disagreement_score":0.8611051,"about_ca_system_score_codex":0.0008916322,"about_ca_system_score_gemma":0.00063100114,"threshold_uncertainty_score":0.9998048},"labels":[],"label_agreement":null},{"id":"W2798961559","doi":"10.4310/joc.2019.v10.n3.a5","title":"Independence posets","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Independence (probability theory); Combinatorics; Star product; Discrete mathematics; Statistics","score_opus":0.005086164802637531,"score_gpt":0.2180778302966756,"score_spread":0.21299166549403806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798961559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68746305,0.0010354238,0.2956642,0.001218323,0.0053423764,0.000101866935,2.565273e-7,0.00004828876,0.009126226],"genre_scores_gemma":[0.9958934,0.000040140774,0.0033834563,0.00025756154,0.000033257696,1.8266475e-7,4.3741192e-8,0.0000039280367,0.00038803156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989936,0.000032386764,0.00025303403,0.00009639668,0.0004721254,0.00015249243],"domain_scores_gemma":[0.9990217,0.00008049776,0.0002976139,0.00025665597,0.00025295757,0.00009054679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031178814,0.00007526812,0.00016696117,0.0001014947,0.00003018544,0.000055081724,0.0009069185,0.000053093583,0.000016677212],"category_scores_gemma":[0.000050819206,0.00005902878,0.0000736493,0.00031822143,0.00001048285,0.00090772816,0.00011762178,0.00029797928,0.000087823835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055980586,0.00008491235,0.0067837816,0.000007948377,0.0000106130965,0.0000893861,0.0001330411,0.00012757468,0.0006250093,0.9875077,0.00037002945,0.004254399],"study_design_scores_gemma":[0.0009246249,0.0006615666,0.01703543,0.00003450431,0.0000053332083,0.00048536676,0.00003088653,0.0009341977,0.00190966,0.96886826,0.008929452,0.00018073489],"about_ca_topic_score_codex":3.338596e-7,"about_ca_topic_score_gemma":8.1131674e-8,"teacher_disagreement_score":0.30843034,"about_ca_system_score_codex":0.000048249785,"about_ca_system_score_gemma":0.00009788131,"threshold_uncertainty_score":0.24071237},"labels":[],"label_agreement":null},{"id":"W2804696489","doi":"10.7151/dmgaa.1280","title":"Congruences and trajectories in planar semimodular lattices","year":2018,"lang":"en","type":"article","venue":"Discussiones Mathematicae - General Algebra and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Mathematics; Planar; Combinatorics; Pure mathematics; Computer science","score_opus":0.012487148553152175,"score_gpt":0.26012422003220675,"score_spread":0.2476370714790546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804696489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67104244,0.0008034761,0.32218423,0.0032423919,0.000075469194,0.0005847806,0.000011866025,0.00018543137,0.0018699281],"genre_scores_gemma":[0.95017064,0.00011266891,0.04877401,0.00025152112,0.00015090109,0.0002201009,0.000004723961,0.000009146259,0.00030630812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895054,0.00003220301,0.00024911735,0.00040650778,0.00013579187,0.0002258405],"domain_scores_gemma":[0.9993637,0.00008898492,0.00007848377,0.00032254646,0.000033942506,0.00011229754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012714851,0.0001597509,0.00020457544,0.00008051994,0.00028737058,0.00012302827,0.00031476573,0.00005432611,0.00001930755],"category_scores_gemma":[0.000017557373,0.00010042391,0.00002375623,0.0003269729,0.00026909722,0.00038495724,0.000116704905,0.00007436523,0.00002114964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017516882,0.000057299752,0.000964304,0.00003688691,0.000006859227,0.0000014759663,0.0011131758,0.0000016352701,0.0020255877,0.9797903,0.000046736186,0.015954023],"study_design_scores_gemma":[0.00026861287,0.00007085369,0.014410587,0.0000537699,0.000012733692,0.00003421146,0.00047308547,0.0060918797,0.0019034952,0.9733413,0.0030193005,0.00032018102],"about_ca_topic_score_codex":0.000008335798,"about_ca_topic_score_gemma":0.00003423655,"teacher_disagreement_score":0.2791282,"about_ca_system_score_codex":0.0000071653685,"about_ca_system_score_gemma":0.000017877728,"threshold_uncertainty_score":0.4095168},"labels":[],"label_agreement":null},{"id":"W2885216076","doi":"10.1017/bsl.2023.1","title":"WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE?","year":2023,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Omega; Intersection (aeronautics); Mathematics; Sentence; Combinatorics; Order (exchange); Discrete mathematics; Pure mathematics; Computer science; Linguistics; Philosophy; Artificial intelligence","score_opus":0.017116103509301477,"score_gpt":0.2464687603152606,"score_spread":0.22935265680595912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885216076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99054694,0.00084222044,0.002826479,0.0030587343,0.00015655348,0.00023778527,0.000041652263,0.00021334809,0.002076273],"genre_scores_gemma":[0.9839043,0.0004303716,0.014693541,0.00073481695,0.00003520489,0.000012513976,0.0000230738,0.000011320567,0.00015485937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985002,0.0000851741,0.00034877617,0.00043258237,0.0002792876,0.00035395098],"domain_scores_gemma":[0.9989784,0.00014389877,0.00022573792,0.00045130705,0.000099307945,0.00010136721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022093374,0.0001904889,0.0003449235,0.00013061649,0.00010256911,0.000029078172,0.0006207063,0.00008278744,0.00011871116],"category_scores_gemma":[0.000062990795,0.00015881279,0.000043331474,0.0004920393,0.00013653212,0.00011514085,0.00036579368,0.00012758575,0.000018580518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013353904,0.000904902,0.18653218,0.0012464682,0.00025342437,0.00017968776,0.0033647814,0.0026304887,0.037463024,0.5795764,0.15807372,0.029641416],"study_design_scores_gemma":[0.0023605197,0.00205663,0.39374408,0.00021774674,0.00006871641,0.00017164212,0.005497419,0.0032627156,0.013336649,0.54606855,0.03182886,0.0013864586],"about_ca_topic_score_codex":0.00021259942,"about_ca_topic_score_gemma":0.000024924293,"teacher_disagreement_score":0.20721188,"about_ca_system_score_codex":0.000011909992,"about_ca_system_score_gemma":0.000036293055,"threshold_uncertainty_score":0.6476198},"labels":[],"label_agreement":null},{"id":"W2886673224","doi":"10.1515/ms-2017-0138","title":"Single identities forcing lattices to be Boolean","year":2018,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Unary operation; Mathematics; Complete Boolean algebra; Boolean algebras canonically defined; Stone's representation theorem for Boolean algebras; Distributive property; Two-element Boolean algebra; Boolean algebra; Forcing (mathematics); Distributive lattice; Free Boolean algebra; Lattice (music); Variable (mathematics); Discrete mathematics; Algebra over a field; Pure mathematics; Algebra representation","score_opus":0.04259816656108542,"score_gpt":0.2781317932135635,"score_spread":0.2355336266524781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886673224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12760246,0.000055233857,0.8258646,0.0017491727,0.00028587846,0.00017875456,8.7308973e-7,0.0003333972,0.043929636],"genre_scores_gemma":[0.79272515,0.0000014103705,0.20222156,0.00184635,0.0001718299,0.000016287564,4.5329e-7,0.000014392742,0.0030025574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988741,0.00002080164,0.00022842448,0.00029957536,0.00025696488,0.00032008433],"domain_scores_gemma":[0.9990576,0.000117670024,0.00007388422,0.0005690387,0.00007143103,0.00011036517],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015452053,0.00013754463,0.00018035447,0.00010302505,0.00018800948,0.0002311516,0.0008083561,0.000036837984,0.00013025016],"category_scores_gemma":[0.0001256493,0.00011571167,0.00005300121,0.00031449887,0.00006585056,0.0005569462,0.0003767301,0.000061775616,0.0008140274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040744344,0.000115968,0.000023935987,0.000088067085,0.000022484897,0.000016737617,0.010631859,0.000011047673,0.0063999174,0.96472,0.0060092136,0.011956683],"study_design_scores_gemma":[0.00027894884,0.00045566098,0.00016216334,0.00015121952,0.000018950104,0.000055357064,0.0009240799,0.008521186,0.045234583,0.9159653,0.02767215,0.00056035654],"about_ca_topic_score_codex":0.00000145288,"about_ca_topic_score_gemma":0.0000074789086,"teacher_disagreement_score":0.6651227,"about_ca_system_score_codex":0.000027744085,"about_ca_system_score_gemma":0.000013437681,"threshold_uncertainty_score":0.99996394},"labels":[],"label_agreement":null},{"id":"W2888009242","doi":"10.4064/fm413-1-2018","title":"Topological partition relations for countable ordinals","year":2018,"lang":"en","type":"article","venue":"Fundamenta Mathematicae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Countable set; Partition (number theory); Omega; Combinatorics; Discrete mathematics; Physics","score_opus":0.0415541413315817,"score_gpt":0.3174677610328808,"score_spread":0.27591361970129913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888009242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013179426,0.000025658963,0.9703595,0.0015197409,0.00021220163,0.00032462718,0.0000058678074,0.00017320523,0.014199776],"genre_scores_gemma":[0.6229314,0.0000028813301,0.3726816,0.00069364696,0.00016094824,0.00014868769,0.000006453911,0.0000075532434,0.0033668093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991173,0.000023033328,0.00021266378,0.00025001948,0.0001404737,0.00025648694],"domain_scores_gemma":[0.9992027,0.0002255647,0.00008075979,0.00035209092,0.000074875104,0.00006397154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002454794,0.00009618782,0.00014516086,0.00003698,0.0002846135,0.000109967725,0.0003348991,0.000045563404,0.00060787087],"category_scores_gemma":[0.00011265552,0.00007597612,0.000056199406,0.0001694118,0.00010285752,0.00042999527,0.000096820964,0.00004624402,0.00069602736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003921911,0.000079411846,0.00007583697,0.000011794991,0.000008445408,6.9461333e-7,0.00027927506,0.0000041964217,0.00035130663,0.9934843,0.0049588266,0.00074196357],"study_design_scores_gemma":[0.00028594604,0.00034205808,0.0002300359,0.000023183766,0.000011055659,0.00001560961,0.00009692286,0.011680936,0.0018443168,0.9430861,0.04223185,0.00015200427],"about_ca_topic_score_codex":0.0000012246235,"about_ca_topic_score_gemma":0.0000025231102,"teacher_disagreement_score":0.609752,"about_ca_system_score_codex":0.00004617123,"about_ca_system_score_gemma":0.000021411648,"threshold_uncertainty_score":0.89462554},"labels":[],"label_agreement":null},{"id":"W2888910303","doi":"10.1007/978-3-319-70869-0_20","title":"Etale Equivalence Relations","year":2018,"lang":"en","type":"book-chapter","venue":"Advanced courses in mathematics, CRM Barcelona","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Equivalence relation; Equivalence (formal languages); Section (typography); Isomorphism (crystallography); Congruence relation; Mathematics; Equivalence class (music); Pure mathematics; Algebra over a field; Computer science","score_opus":0.02194623171040818,"score_gpt":0.2708721160326987,"score_spread":0.24892588432229049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888910303","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012265064,0.0015366967,0.3524612,0.0003157559,0.000892084,0.00061119645,0.000023485327,0.00040594378,0.643631],"genre_scores_gemma":[0.009981347,0.0008002681,0.38178414,0.0003587993,0.0003440741,0.00009014403,0.000034115288,0.00017152431,0.6064356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965619,0.000027623471,0.00094175356,0.0010650799,0.00072043244,0.00068323297],"domain_scores_gemma":[0.9964034,0.0005803589,0.0006458719,0.0019351623,0.0002544705,0.0001807641],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034931971,0.00068594073,0.0008031056,0.00038332766,0.00021303486,0.00010377107,0.0020263286,0.000400653,0.0010558056],"category_scores_gemma":[0.00023722547,0.0006824418,0.00023975532,0.00017177679,0.00051361875,0.00082094467,0.00069133076,0.0007686449,0.0019934522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041360863,0.000070288734,0.000005606732,0.00011173411,0.000028154236,0.0000759923,0.00089548656,0.00034249885,0.000039579543,0.9884911,0.00065870583,0.009276682],"study_design_scores_gemma":[0.00033962444,0.00012612723,0.000017013297,0.00080734235,0.000027445001,0.000048457754,0.00006593206,0.0039475006,0.000087777196,0.96083415,0.032923345,0.00077528023],"about_ca_topic_score_codex":0.0000013051542,"about_ca_topic_score_gemma":0.000023928524,"teacher_disagreement_score":0.037195407,"about_ca_system_score_codex":0.00023384823,"about_ca_system_score_gemma":0.00018761648,"threshold_uncertainty_score":0.99985737},"labels":[],"label_agreement":null},{"id":"W2888918612","doi":"10.1007/978-3-319-78235-5_7","title":"Pure Unary Relational Structures","year":2018,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Unary operation; Finitely-generated abelian group; Mathematics; Pure mathematics; Discrete mathematics; Combinatorics","score_opus":0.033835860674898896,"score_gpt":0.25053000726271724,"score_spread":0.21669414658781833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888918612","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006090288,0.00078765413,0.15285434,0.000106782245,0.00048579712,0.00030816896,0.000012619383,0.00018554891,0.8451982],"genre_scores_gemma":[0.00083076075,0.00006380989,0.384819,0.00033327725,0.00045092215,0.000012919636,0.000024171299,0.00007326864,0.6133919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984871,0.000010391377,0.00045321262,0.00041985494,0.0003950675,0.00023437013],"domain_scores_gemma":[0.9986008,0.00014535444,0.00029064744,0.000821787,0.00007434842,0.000067074994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015110856,0.0003293807,0.00036490094,0.00017838656,0.000080971884,0.000059048183,0.00087304064,0.00035107523,0.00044332727],"category_scores_gemma":[0.00004493947,0.00028536923,0.00013618129,0.000036486144,0.0001629441,0.00017477166,0.00036285314,0.0004565489,0.00030671593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.516283e-7,0.0000090136255,0.0000018532235,0.00007139607,0.000017051612,0.000054264896,0.0006634649,0.000025239493,0.0000036864221,0.9961862,0.0019643193,0.0010025809],"study_design_scores_gemma":[0.000103146536,0.000036698795,0.0000074765526,0.00020500983,0.000009288491,0.00006273068,0.000008197757,0.0017875514,0.000015322623,0.9606552,0.036803793,0.0003055942],"about_ca_topic_score_codex":1.5154652e-7,"about_ca_topic_score_gemma":0.0000030219367,"teacher_disagreement_score":0.23196468,"about_ca_system_score_codex":0.000078787656,"about_ca_system_score_gemma":0.000089989335,"threshold_uncertainty_score":0.9999598},"labels":[],"label_agreement":null},{"id":"W2889058965","doi":"10.70930/tac/e0lnn7uy","title":"A characterisation of the category of compact Hausdorff spaces","year":2020,"lang":"en","type":"preprint","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Université Sorbonne Paris Cité; European Commission","keywords":"Hausdorff space; Mathematics; Categorical variable; Equivalence (formal languages); Set (abstract data type); Urysohn and completely Hausdorff spaces; Pure mathematics; Object (grammar); Discrete mathematics; Computer science; Hausdorff measure; Hausdorff dimension; Artificial intelligence","score_opus":0.016604348636033887,"score_gpt":0.25659764581298167,"score_spread":0.23999329717694778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889058965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18558992,0.00154322,0.8082814,0.0015353723,0.0001337372,0.0008865039,0.000075148426,0.00006833213,0.001886346],"genre_scores_gemma":[0.9987707,0.00013598258,0.00088584865,0.000036869376,0.000040080835,0.000050500446,0.000015394782,0.000006418009,0.000058216217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900126,0.00013754734,0.00036180275,0.00025677183,0.00015340983,0.00008920284],"domain_scores_gemma":[0.9981216,0.00023474383,0.0007155293,0.0007597642,0.00013392165,0.00003439659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030998015,0.00014949065,0.00035486397,0.000057731748,0.00007707354,0.000022866878,0.00091476727,0.00008751348,0.000006401427],"category_scores_gemma":[0.000042146916,0.00010678019,0.00009256544,0.00024549928,0.00053089997,0.00012099531,0.00054381887,0.00018712046,0.000001045137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021395963,0.00003866058,0.00024290617,0.00027780473,0.000030240408,5.6916413e-8,0.001917036,0.00010127204,0.006300613,0.98539925,0.000014659854,0.005656126],"study_design_scores_gemma":[0.000080742706,0.000028380142,0.0077955476,0.00003251181,0.00003296916,0.0000015310451,0.0003542738,0.0001556155,0.060983766,0.9299237,0.00050611637,0.00010481856],"about_ca_topic_score_codex":0.000022792474,"about_ca_topic_score_gemma":0.0000013525064,"teacher_disagreement_score":0.81318074,"about_ca_system_score_codex":0.000007467142,"about_ca_system_score_gemma":0.00010976358,"threshold_uncertainty_score":0.435437},"labels":[],"label_agreement":null},{"id":"W2889137867","doi":"10.1007/978-3-319-70869-0_22","title":"Orbit Equivalence of AF-Equivalence Relations","year":2018,"lang":"en","type":"book-chapter","venue":"Advanced courses in mathematics, CRM Barcelona","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Equivalence relation; Corollary; Mathematics; Quotient algebra; Equivalence (formal languages); Pure mathematics; Invariant (physics); Matrix equivalence; Hausdorff space; Congruence relation; Discrete mathematics; Algebra over a field; Physics; Mathematical physics","score_opus":0.02386092847381317,"score_gpt":0.27487154199272457,"score_spread":0.2510106135189114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889137867","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058887573,0.0029184152,0.46179217,0.0003460502,0.0010914683,0.0009870672,0.00006155377,0.00036958314,0.5318448],"genre_scores_gemma":[0.07196059,0.002740112,0.59403616,0.0002753362,0.00037188354,0.0001187667,0.000037691825,0.0002570219,0.33020243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574363,0.000039555485,0.0014023825,0.0011218777,0.0009724331,0.00072009745],"domain_scores_gemma":[0.99499655,0.00087670964,0.0012176489,0.0022645842,0.00045993092,0.00018454887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049193716,0.000748482,0.001108484,0.00048736684,0.00015927147,0.000058236947,0.002619715,0.00042648715,0.0009115645],"category_scores_gemma":[0.0004054733,0.0007440656,0.00029352933,0.00026188686,0.0008383755,0.00087119103,0.0008567527,0.00074975606,0.00059352646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009916854,0.00010937863,0.000016817494,0.000312067,0.00003910735,0.00005612413,0.0011083281,0.0005400171,0.00018431873,0.990511,0.00028676167,0.0068261395],"study_design_scores_gemma":[0.0004180921,0.00023200062,0.000038883332,0.0019972746,0.000035877732,0.00004307182,0.000097843906,0.003483165,0.00045826635,0.9847118,0.007672456,0.0008112442],"about_ca_topic_score_codex":0.0000026133807,"about_ca_topic_score_gemma":0.000020330554,"teacher_disagreement_score":0.20164236,"about_ca_system_score_codex":0.00021290101,"about_ca_system_score_gemma":0.00027187166,"threshold_uncertainty_score":0.99950105},"labels":[],"label_agreement":null},{"id":"W2889400504","doi":"10.1007/978-3-319-78235-5_4","title":"Analyzing $$\\mathop{\\mathrm{L_{q}}}\\nolimits (\\mathcal{K})$$","year":2018,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Combinatorics; Physics; Mathematics","score_opus":0.037268597431948665,"score_gpt":0.2630915530420175,"score_spread":0.22582295561006882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889400504","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000117673364,0.00094926986,0.3270906,0.00012356741,0.0005605444,0.0005055895,0.000010398654,0.0004656944,0.6701767],"genre_scores_gemma":[0.0016564502,0.00038422653,0.38883328,0.0004664627,0.0006721433,0.000058731686,0.000018574077,0.00026656679,0.60764354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962665,0.00003167896,0.0012224704,0.0010484506,0.0006586647,0.00077226595],"domain_scores_gemma":[0.99639636,0.00033294488,0.00068164506,0.0021696652,0.0001965912,0.00022279439],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00063182175,0.00085115735,0.001135502,0.00057764305,0.00018075976,0.00027477997,0.0022947367,0.00065266015,0.0002669474],"category_scores_gemma":[0.00014683299,0.00078935357,0.00042180042,0.0001552555,0.00033095287,0.00042655272,0.000992871,0.00085292826,0.0015628511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020222315,0.000052100477,0.0000039611996,0.00025904432,0.000052335512,0.00014963158,0.0015585308,0.00001415559,0.00002555737,0.9897801,0.001252063,0.006850444],"study_design_scores_gemma":[0.00026202117,0.00008975534,0.0000041667226,0.001028799,0.00004854102,0.00009560204,0.000032355558,0.00794069,0.0001172182,0.9529553,0.036522713,0.00090285396],"about_ca_topic_score_codex":8.7506567e-7,"about_ca_topic_score_gemma":0.000011048484,"teacher_disagreement_score":0.06253311,"about_ca_system_score_codex":0.00021724938,"about_ca_system_score_gemma":0.00016555967,"threshold_uncertainty_score":0.99945575},"labels":[],"label_agreement":null},{"id":"W2889433372","doi":"10.1007/978-3-319-78235-5_2","title":"Structure of Lattices of Subquasivarieties","year":2018,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Join (topology); Section (typography); Combinatorics; Lattice (music); Algebraic number; Mathematics; Physics; Computer science; Mathematical analysis","score_opus":0.024064258850415115,"score_gpt":0.24807036641653218,"score_spread":0.22400610756611708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889433372","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023442023,0.0013968043,0.16718456,0.000041844065,0.00052684784,0.0005193268,0.00005126015,0.000103431244,0.82783175],"genre_scores_gemma":[0.11026959,0.00016645515,0.54713714,0.00010610087,0.00024676474,0.0000054052502,0.000011817089,0.00011957882,0.34193718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863124,0.000009719323,0.000613602,0.0002534412,0.00033138375,0.00016063733],"domain_scores_gemma":[0.99812376,0.00017507045,0.0007042682,0.000825627,0.00013784422,0.00003342412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011761921,0.00025299814,0.00060137775,0.00016881798,0.000021771644,0.000018595807,0.0009739698,0.00025746884,0.00016677029],"category_scores_gemma":[0.00004985851,0.0002110857,0.00012806743,0.00003961145,0.00031839331,0.00011385874,0.00029933162,0.00022663227,0.000012093644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016793815,0.000015471993,0.0000046259147,0.0005794713,0.000026717113,0.000004632037,0.0022895467,0.000012120043,0.00019457389,0.9961439,0.00011877784,0.0006085299],"study_design_scores_gemma":[0.000097882934,0.000089374174,0.000005969157,0.000504256,0.000020141026,0.0000073903666,0.000039748313,0.0005490311,0.0024623533,0.99427867,0.0017494041,0.00019576719],"about_ca_topic_score_codex":7.772445e-7,"about_ca_topic_score_gemma":0.0000073838637,"teacher_disagreement_score":0.48589453,"about_ca_system_score_codex":0.000021145373,"about_ca_system_score_gemma":0.000066635315,"threshold_uncertainty_score":0.8607825},"labels":[],"label_agreement":null},{"id":"W2899531579","doi":"","title":"On the lower part of the lattice of partial clones","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Cardinality (data modeling); clone (Java method); Lattice (music); Combinatorics; Mathematics; Partially ordered set; Discrete mathematics; Physics; Biology; Computer science; Genetics; Gene; Data mining","score_opus":0.01805826909696382,"score_gpt":0.22831541098891875,"score_spread":0.21025714189195494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899531579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40089053,0.00078912487,0.50878465,0.03486218,0.002010063,0.0010829874,0.000053258576,0.00015515412,0.05137207],"genre_scores_gemma":[0.98945034,0.000107425374,0.0074670697,0.00022751818,0.000016543665,0.000025952186,0.000009687937,0.0000136315375,0.0026818262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9951547,0.0032230252,0.0004400893,0.00048345662,0.00047790614,0.00022085286],"domain_scores_gemma":[0.9916878,0.00268046,0.0007300807,0.003920273,0.0009321639,0.00004926169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002867078,0.00020587124,0.00028880735,0.000053366115,0.00017585584,0.00009988864,0.0034950257,0.00014334229,0.00006000221],"category_scores_gemma":[0.001228301,0.00012871787,0.00024693867,0.00034201844,0.0003050973,0.00009449341,0.0024951287,0.0004959735,0.000026856016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068590207,0.0003610964,0.00046166332,0.000059531645,0.000034431934,5.343262e-7,0.0023850242,0.0008749759,0.00045642248,0.98932135,0.0006412338,0.0053969],"study_design_scores_gemma":[0.0011865114,0.0000068435415,0.014850915,0.006595607,0.00013213014,0.000011805549,0.00018693855,0.12067937,0.4605338,0.34703043,0.047542326,0.0012433359],"about_ca_topic_score_codex":0.000098945944,"about_ca_topic_score_gemma":0.00006749366,"teacher_disagreement_score":0.6422909,"about_ca_system_score_codex":0.000027915803,"about_ca_system_score_gemma":0.00019267312,"threshold_uncertainty_score":0.64946854},"labels":[],"label_agreement":null},{"id":"W2910461493","doi":"10.1090/tran/7966","title":"C*-algebras from actions of congruence monoids on rings of algebraic integers","year":2019,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Semidirect product; Multiplicative function; Ring of integers; Multiplicative group; Residue field; Algebraic number; Congruence (geometry); Congruence relation","score_opus":0.012469077463435256,"score_gpt":0.2501977507902434,"score_spread":0.23772867332680817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910461493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52447945,0.000008582559,0.47440228,0.00035225484,0.00006381956,0.00013778225,0.000013178904,0.000031054322,0.0005116132],"genre_scores_gemma":[0.9466377,0.000017205726,0.0530573,0.00015075368,0.000005824632,0.000006178237,3.6712467e-7,0.000009151984,0.00011552274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987792,0.000054942717,0.00040367548,0.00024498985,0.0003356499,0.00018155095],"domain_scores_gemma":[0.99799865,0.00061582524,0.00042194893,0.000827323,0.00007881245,0.000057453177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012903113,0.00014428551,0.00044329584,0.00003196582,0.00006653331,0.000008697973,0.0009343015,0.000042759184,0.00013307112],"category_scores_gemma":[0.000034537217,0.000101129095,0.0004837829,0.00065199943,0.0006763504,0.00018492709,0.000042701686,0.00023785201,0.000023615685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001254512,0.0027681612,0.002444906,0.0006088105,0.0011684159,7.463569e-7,0.015971309,0.017653303,0.2993968,0.6230587,0.00035881088,0.036444586],"study_design_scores_gemma":[0.001185838,0.0012421034,0.016418936,0.0005341868,0.00023196971,0.000009861024,0.0057046567,0.06700834,0.38327152,0.52352804,0.00016199904,0.0007025681],"about_ca_topic_score_codex":0.00014169431,"about_ca_topic_score_gemma":0.0000018528267,"teacher_disagreement_score":0.42215827,"about_ca_system_score_codex":0.000039109826,"about_ca_system_score_gemma":0.00005249825,"threshold_uncertainty_score":0.41239247},"labels":[],"label_agreement":null},{"id":"W2911046134","doi":"10.14712/1213-7243.2015.270","title":"Finitely-additive, countably-additive and internal probability measures","year":2019,"lang":"en","type":"article","venue":"Commentationes Mathematicae Universitatis Carolinae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probability measure; Mathematics; Separable space; Bounded function; Measure (data warehouse); Infinitesimal; Measurable function; Borel measure; Metric space; Combinatorics; Discrete mathematics; Probability distribution; Space (punctuation); Regular conditional probability; Additive function; Probability mass function; Statistics; Mathematical analysis","score_opus":0.014878023227793769,"score_gpt":0.2321505279469847,"score_spread":0.21727250471919093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911046134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36778787,0.00014823885,0.61328685,0.0013261063,0.00030396107,0.000911716,0.00007981088,0.00022802524,0.015927427],"genre_scores_gemma":[0.9057873,0.000048775448,0.093124814,0.00048481883,0.000020341922,0.00001672433,0.000023568087,0.000011980054,0.0004816823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986438,0.00012457563,0.0002722929,0.00041456716,0.00030192628,0.00024284005],"domain_scores_gemma":[0.9986072,0.0005331013,0.00018303662,0.0003762993,0.00019214237,0.00010822341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020451029,0.00020386814,0.00027745112,0.00012866475,0.00017943932,0.00010126686,0.00048233324,0.00005299947,0.00022435756],"category_scores_gemma":[0.00008360047,0.00019322986,0.000063099906,0.00025252855,0.00013085453,0.0010262632,0.00029009592,0.00014682229,0.00015682595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039195944,0.000243814,0.0075266156,0.00016900641,0.00012774648,0.00004676058,0.013350515,0.000058910016,0.00040157358,0.9252657,0.0027948006,0.04997531],"study_design_scores_gemma":[0.006328021,0.0011577756,0.05329075,0.0003642028,0.00017749052,0.00029389746,0.018527752,0.032236066,0.0036742042,0.8711504,0.010927997,0.0018714854],"about_ca_topic_score_codex":0.000009951859,"about_ca_topic_score_gemma":0.00001004928,"teacher_disagreement_score":0.53799945,"about_ca_system_score_codex":0.00011520435,"about_ca_system_score_gemma":0.00003384611,"threshold_uncertainty_score":0.7879685},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.061465382102060005,"score_gpt":0.34610929637381743,"score_spread":0.28464391427175745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913086526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003710575,0.00038527968,0.9818558,0.000018298811,0.00087890035,0.00032799362,2.7034866e-7,0.0002515458,0.015910834],"genre_scores_gemma":[0.16844314,0.0000030177314,0.8312141,0.000092051705,0.000026885471,0.00006281566,1.428893e-7,0.000010421836,0.00014742026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965067,0.0019042048,0.00043369364,0.00038821145,0.00020947009,0.0005577064],"domain_scores_gemma":[0.99860597,0.0005241366,0.00012497406,0.0005932113,0.000042555534,0.00010918135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004438117,0.00018845456,0.00031567595,0.00016959463,0.00011879148,0.000081590595,0.0007155038,0.00010647348,0.000011951169],"category_scores_gemma":[0.00026373228,0.00015774512,0.000075093,0.0006679855,0.000028732604,0.0008925032,0.00009801015,0.00017840507,0.000098133685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058566825,0.00002051716,0.00018259775,0.000040602,0.0000065539375,0.000042693846,0.00032421175,0.000953078,0.0007628666,0.9512054,0.000060709368,0.046394955],"study_design_scores_gemma":[0.0039820783,0.0012523853,0.0032075464,0.00058548583,0.000035708454,0.0018267807,0.0017851151,0.25887597,0.23269817,0.45994493,0.03296933,0.002836499],"about_ca_topic_score_codex":0.0000023377352,"about_ca_topic_score_gemma":6.3252725e-7,"teacher_disagreement_score":0.4912604,"about_ca_system_score_codex":0.00011528169,"about_ca_system_score_gemma":0.00007572812,"threshold_uncertainty_score":0.6432659},"labels":[],"label_agreement":null},{"id":"W2915855507","doi":"10.1016/s1874-5075(05)80029-4","title":"A General Theory of Logical Systems","year":2005,"lang":"en","type":"book-chapter","venue":"˜A œpractical logic of cognitive systems","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Calculus (dental); Mathematics; Medicine","score_opus":0.06022059286607002,"score_gpt":0.30276518787679724,"score_spread":0.24254459501072723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915855507","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004854115,0.0042299964,0.45625764,0.000100782534,0.00104225,0.0008571017,0.00010458949,0.00012680453,0.5372323],"genre_scores_gemma":[0.8434432,0.00037008233,0.004660751,0.0002991285,0.0013930545,0.00008410088,0.00005509295,0.00008115238,0.14961344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504673,0.00057226664,0.0015695158,0.0010616708,0.0011549987,0.0005948235],"domain_scores_gemma":[0.992114,0.003999975,0.0017701457,0.00081141817,0.0010144474,0.00029003122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012655773,0.00072290655,0.0018222766,0.00028753644,0.00009649531,0.0001045746,0.0009145307,0.00087706797,0.00018816972],"category_scores_gemma":[0.000827444,0.0005504463,0.0004825495,0.00013864347,0.00069362804,0.00059106003,0.00048846105,0.0009318981,0.0003009101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109070665,0.00015730386,0.0000053626054,0.00024136367,0.00024670645,0.00023162474,0.00007182637,0.00009899458,0.000059412192,0.99396867,0.00018883015,0.004620827],"study_design_scores_gemma":[0.003039156,0.0042014457,0.00018315263,0.0053725103,0.000925118,0.0024752067,0.0006658321,0.0095575,0.00024097248,0.88899523,0.08107495,0.0032689148],"about_ca_topic_score_codex":0.0000126826,"about_ca_topic_score_gemma":0.0000011748891,"teacher_disagreement_score":0.84339464,"about_ca_system_score_codex":0.00010447179,"about_ca_system_score_gemma":0.00027440078,"threshold_uncertainty_score":0.9996947},"labels":[],"label_agreement":null},{"id":"W2918679782","doi":"10.1016/s0034-4877(19)30025-4","title":"The Orthogonality of Sequential Products in Sequential Effect Algebras","year":2019,"lang":"en","type":"article","venue":"Reports on Mathematical Physics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Orthogonality; Algebra over a field; Assertion; Product (mathematics); Computation; Pure mathematics; Algebraic number; Quantum; Computer science; Algorithm; Quantum mechanics; Mathematical analysis","score_opus":0.018572949927057485,"score_gpt":0.2727447534763507,"score_spread":0.2541718035492932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918679782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8956406,0.000034297747,0.09809559,0.000276218,0.00047599946,0.0007671138,8.3487146e-7,0.00008688149,0.0046224715],"genre_scores_gemma":[0.995447,0.0000021557719,0.004208196,0.000046114255,0.000081576116,0.000018490402,0.0000018980733,0.000011132597,0.00018348424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980492,0.00014137062,0.0005344085,0.0004342052,0.0005458372,0.00029499852],"domain_scores_gemma":[0.99805534,0.00042053068,0.00031019814,0.0010855735,0.00007610501,0.0000522834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093986193,0.00017229874,0.00034410003,0.000023562408,0.000058761867,0.000051984593,0.0003694156,0.000051784016,0.000012459958],"category_scores_gemma":[0.0002599641,0.000106272244,0.00011838796,0.00035509,0.00010249925,0.00022609236,0.00018824554,0.0002165841,0.00007122536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020391008,0.00028576457,0.00094213244,0.00023935504,0.000024285719,0.00010855848,0.00014761741,0.00046284104,0.007478908,0.98055565,0.000030439656,0.009704046],"study_design_scores_gemma":[0.00020395248,0.00020757968,0.0007695473,0.00008337787,0.00000889986,0.000057932473,0.0000049232904,0.0025626104,0.050857976,0.9449158,0.00015507248,0.00017237823],"about_ca_topic_score_codex":0.0000022312495,"about_ca_topic_score_gemma":6.2204845e-7,"teacher_disagreement_score":0.09980636,"about_ca_system_score_codex":0.00003892819,"about_ca_system_score_gemma":0.000086401364,"threshold_uncertainty_score":0.4333656},"labels":[],"label_agreement":null},{"id":"W2919149231","doi":"","title":"A Solution to a Problem of D. Lau: Complete Classification of Intervals in the Lattice of Partial Boolean Clones","year":2017,"lang":"en","type":"other","venue":"SZTE Publicatio Repozitórium (University of Szeged)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Lattice (music); Combinatorics; Mathematics; Discrete mathematics; Physics","score_opus":0.04445208843105506,"score_gpt":0.2562351535269121,"score_spread":0.21178306509585706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919149231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009508009,0.0006514588,0.6812506,0.012950595,0.00029991101,0.0029335003,0.00028742576,0.00019922094,0.29191932],"genre_scores_gemma":[0.91705316,0.00010836367,0.059286337,0.00006976848,0.00005995668,0.000009062113,0.00007052435,0.00005287956,0.023289949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834585,0.00020527413,0.00038477808,0.00044016086,0.00041486544,0.00020906169],"domain_scores_gemma":[0.99597967,0.00009807202,0.0019995123,0.001531214,0.0003331097,0.00005842238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072096306,0.00017332191,0.00051976234,0.00048422907,0.00007422599,0.000019649395,0.0024446794,0.00016820744,0.00003530338],"category_scores_gemma":[0.00010054482,0.00016664086,0.000152455,0.0005317163,0.00034752552,0.00037105576,0.0004189897,0.00016930808,0.000007636719],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002467084,0.0018256492,0.008532756,0.0029408566,0.0004891564,0.000017314353,0.02256792,0.00009436039,0.02586465,0.7637634,0.11126144,0.06239579],"study_design_scores_gemma":[0.0030541527,0.0012668077,0.17261395,0.0028447164,0.00032895862,0.00004001623,0.003935222,0.008882979,0.002051316,0.016066639,0.7874769,0.0014383326],"about_ca_topic_score_codex":0.00091915805,"about_ca_topic_score_gemma":0.00091161666,"teacher_disagreement_score":0.90754515,"about_ca_system_score_codex":0.000034908106,"about_ca_system_score_gemma":0.00014635516,"threshold_uncertainty_score":0.67954177},"labels":[],"label_agreement":null},{"id":"W2946034447","doi":"10.70930/tac/fdxcih4r","title":"Linear Distributivity With Negation, Star-Autonomy, and Hopf Monads","year":2018,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Exploratory Research for Advanced Technology; Clarendon Fund; Japan Society for the Promotion of Science; DeepMind","keywords":"Distributivity; Negation; Mathematics; Star (game theory); Pure mathematics; Algebra over a field; Computer science; Programming language; Mathematical analysis; Distributive property","score_opus":0.005865145345343767,"score_gpt":0.23023257279458148,"score_spread":0.2243674274492377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946034447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117135115,0.00017669001,0.8815138,0.00023127266,0.000007885713,0.00012990195,0.000007379482,0.000048591868,0.0007494004],"genre_scores_gemma":[0.9913231,0.000022771503,0.008372866,0.000045438468,0.000048120575,0.00004663537,0.0000064281444,0.0000029502144,0.0001317064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954134,0.000031524098,0.0000951057,0.00018200476,0.000057041838,0.00009298068],"domain_scores_gemma":[0.9993796,0.00013434545,0.00006568509,0.0002728113,0.0001041447,0.00004346074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001877324,0.000074166725,0.00009390416,0.000025327496,0.00021000397,0.000028465485,0.0001675879,0.000023492095,0.000004814962],"category_scores_gemma":[0.000013589393,0.0000560015,0.000008093686,0.0001976656,0.0005973214,0.00027211916,0.00008570966,0.000041892967,0.0000027775154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016018863,0.000017125094,0.00038051748,0.000008046251,0.0000055491037,1.0117383e-7,0.0003636705,0.0000024882136,0.00016003445,0.9745081,0.000005298321,0.024533026],"study_design_scores_gemma":[0.00013336384,0.00011385436,0.004536652,0.0000028150155,0.000008281948,0.000006609638,0.00015499047,0.00030535305,0.010259695,0.97689,0.007489437,0.000098904995],"about_ca_topic_score_codex":0.000005637781,"about_ca_topic_score_gemma":0.000004787125,"teacher_disagreement_score":0.87418795,"about_ca_system_score_codex":0.0000057632406,"about_ca_system_score_gemma":0.000043602722,"threshold_uncertainty_score":0.22836748},"labels":[],"label_agreement":null},{"id":"W2946356396","doi":"10.14232/actasm-017-060-9","title":"Minimal representations of a finite distributive lattice by principal congruences of a lattice","year":2019,"lang":"en","type":"article","venue":"Acta Scientiarum Mathematicarum","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Distributive lattice; Mathematics; Lattice (music); Distributive property; Congruence (geometry); Pure mathematics; Isomorphism (crystallography); Congruence lattice problem; Combinatorics; Physics; Crystal structure; Geometry; Crystallography","score_opus":0.012588756026301778,"score_gpt":0.2674118391332062,"score_spread":0.25482308310690444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946356396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7709626,0.00008544608,0.21874696,0.0009671386,0.0003182103,0.0005208398,0.00010980537,0.00007908029,0.008209951],"genre_scores_gemma":[0.96262014,0.000004252102,0.03657493,0.000048686463,0.00000803881,0.000013036439,0.000010198342,0.0000073120937,0.0007133918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793315,0.00008159991,0.0005407961,0.0004755089,0.0005910976,0.00037783975],"domain_scores_gemma":[0.99736935,0.0009615539,0.0004899277,0.00085578876,0.00021966209,0.00010369094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005240236,0.00016527102,0.00036686484,0.00011605518,0.000090037945,0.00007126475,0.0012159416,0.000059403406,0.00010567226],"category_scores_gemma":[0.00049647054,0.00013823777,0.00012052338,0.0008597489,0.00029769953,0.0007629655,0.00047461284,0.00011572049,0.000065358035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032107633,0.0008968724,0.008170937,0.0006793382,0.0001445804,0.000008347184,0.0060941386,0.00016996781,0.07949512,0.90214425,0.0014156885,0.0007486569],"study_design_scores_gemma":[0.0036927508,0.0014547411,0.014772955,0.0009950929,0.00034158272,0.000073455354,0.0046965294,0.20988147,0.35909033,0.39922565,0.0039146515,0.0018608081],"about_ca_topic_score_codex":0.000010852619,"about_ca_topic_score_gemma":0.0000025495965,"teacher_disagreement_score":0.5029186,"about_ca_system_score_codex":0.000018724055,"about_ca_system_score_gemma":0.00009010264,"threshold_uncertainty_score":0.56371725},"labels":[],"label_agreement":null},{"id":"W2949324785","doi":"10.48550/arxiv.math/0607725","title":"Representation of ideals of relational structures","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Countable set; Ideal (ethics); Isomorphism (crystallography); Signature (topology); Partially ordered set; Discrete mathematics; Set (abstract data type); Representation (politics); Combinatorics; Binary relation; Pure mathematics; Computer science; Crystal structure","score_opus":0.08097582118821442,"score_gpt":0.20961246445680964,"score_spread":0.12863664326859522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949324785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37844208,0.00005222077,0.61838245,0.000018050345,0.00015622444,0.00010268273,0.000015370393,0.00003887893,0.0027920394],"genre_scores_gemma":[0.9879009,0.000027026694,0.011640353,0.0000106408825,0.00002751324,1.8245474e-7,0.000026888112,0.0000047612875,0.00036169146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900264,0.00007844368,0.00023165453,0.00047327837,0.00009854019,0.00011546576],"domain_scores_gemma":[0.99854684,0.00012548506,0.00049199606,0.0006305273,0.00017011368,0.000035034813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075116186,0.00012954467,0.00026102856,0.00018175023,0.000037318296,0.0000089528485,0.00069619017,0.00014611712,0.000017926952],"category_scores_gemma":[0.000034075656,0.00014177771,0.0001475372,0.0004517361,0.00010147176,0.00022662133,0.00048365732,0.00018128414,0.0000028503855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007751527,0.000017625323,0.0073670717,0.000028529745,0.000019748702,0.000012267141,0.000040814506,0.37797818,0.00014628084,0.61406827,0.000052693442,0.00026078976],"study_design_scores_gemma":[0.00023022009,0.000024962617,0.065037794,0.000030214407,0.000024855288,0.0000015012306,0.000011788091,0.07672539,0.0019812544,0.8557477,0.000031465268,0.00015285163],"about_ca_topic_score_codex":0.00014637962,"about_ca_topic_score_gemma":0.000012962164,"teacher_disagreement_score":0.60945886,"about_ca_system_score_codex":0.0000416417,"about_ca_system_score_gemma":0.000084119536,"threshold_uncertainty_score":0.5781528},"labels":[],"label_agreement":null},{"id":"W2949408264","doi":"10.48550/arxiv.0911.5246","title":"Complex Algebras of Arithmetic","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Semiring; Subalgebra; Natural number; Arithmetic; Mathematics; Algebraic number; Elementary algebra; Directed acyclic graph; Algebra over a field; Algebraic operation; Sequence (biology); Arithmetic circuit complexity; Discrete mathematics; Arbitrary-precision arithmetic; Pure mathematics; Combinatorics","score_opus":0.09328967994293483,"score_gpt":0.19860668038626145,"score_spread":0.10531700044332662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949408264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105466336,0.00009500478,0.88714916,0.000110049055,0.00024366796,0.00019393866,0.000007816073,0.00021739052,0.0065166564],"genre_scores_gemma":[0.98192614,0.000101817386,0.017255267,0.00018313118,0.000040795727,2.6061528e-7,0.0000107254,0.000009556439,0.0004722768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983406,0.00010988054,0.00023169079,0.0008929002,0.00010133052,0.00032360907],"domain_scores_gemma":[0.9980269,0.00008302114,0.0003139879,0.0012977772,0.00014010575,0.00013820526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013958513,0.00028668373,0.0004356678,0.00025081608,0.00008430731,0.00004256141,0.0021901478,0.00021329174,0.000042369247],"category_scores_gemma":[0.000023888171,0.00031789584,0.00023470848,0.0005870635,0.00014542596,0.00024369577,0.0014334602,0.0004270845,0.000057958776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001019054,0.00012378486,0.00051724614,0.000054409724,0.00004364581,0.00020493784,0.00008334932,0.07488763,0.00011233896,0.92046815,0.0001999834,0.0032943327],"study_design_scores_gemma":[0.00038826553,0.00010880397,0.008127358,0.00006700377,0.00004403327,0.000007566985,0.000021685268,0.20069312,0.0002858897,0.7892515,0.0005485773,0.0004561834],"about_ca_topic_score_codex":0.000028406692,"about_ca_topic_score_gemma":0.000009563058,"teacher_disagreement_score":0.87645984,"about_ca_system_score_codex":0.00008792915,"about_ca_system_score_gemma":0.000121951954,"threshold_uncertainty_score":0.9999273},"labels":[],"label_agreement":null},{"id":"W2949520538","doi":"10.48550/arxiv.0712.2525","title":"Calculating Colimits Compositionally","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Mathematics; Computer science; Pure mathematics","score_opus":0.062062300796268274,"score_gpt":0.30346973600834504,"score_spread":0.24140743521207675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949520538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5118059,0.0002608887,0.48056254,0.0004713661,0.0007925217,0.00018600453,0.000004496017,0.0002978328,0.0056184535],"genre_scores_gemma":[0.93817,0.000017438551,0.059390724,0.0017217462,0.00034844695,0.000020039133,0.00003619001,0.000018314258,0.0002770928],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980148,0.00005965455,0.00037745936,0.0007636974,0.00035853864,0.00042585915],"domain_scores_gemma":[0.9984661,0.0001698862,0.00023232886,0.00083493104,0.0001544757,0.00014232894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000273408,0.0002857653,0.00030150992,0.00012053353,0.0001972859,0.00009787709,0.0012104758,0.00024320917,0.000024744797],"category_scores_gemma":[0.00004846304,0.000282429,0.00015525782,0.00022814094,0.00006436539,0.00020406449,0.0017419559,0.0006820262,0.0002586589],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037444985,0.0005547112,0.5194068,0.00037415716,0.00030448992,0.0010651125,0.0016803691,0.04447256,0.0066513373,0.38045305,0.0014226615,0.043577332],"study_design_scores_gemma":[0.0005939319,0.000103264814,0.9000251,0.00036326013,0.000031964577,0.0000799524,0.00002674077,0.030877693,0.0032808634,0.05752154,0.005738749,0.0013569337],"about_ca_topic_score_codex":0.000016537606,"about_ca_topic_score_gemma":0.000008501414,"teacher_disagreement_score":0.42636412,"about_ca_system_score_codex":0.00010177701,"about_ca_system_score_gemma":0.000120852645,"threshold_uncertainty_score":0.9999628},"labels":[],"label_agreement":null},{"id":"W2950020411","doi":"10.48550/arxiv.1206.5436","title":"Notes on planar semimodular lattices. VII. Resections of planar semimodular lattices","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Distributive property; Planar; Combinatorics; Computer science; Mathematics; Pure mathematics; Computer graphics (images)","score_opus":0.08167177137125516,"score_gpt":0.21460318705405118,"score_spread":0.13293141568279604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950020411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4096292,0.00055848114,0.5796539,0.0003222191,0.0013800905,0.0005233708,0.00010624825,0.00049106026,0.0073354053],"genre_scores_gemma":[0.9939794,0.00027905992,0.0046897866,0.00015032596,0.00020706927,0.000002077075,0.000040532424,0.00003170921,0.0006200531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724877,0.00022736946,0.00035213094,0.0012960376,0.00024079543,0.00063491566],"domain_scores_gemma":[0.99654865,0.00048638522,0.00055417104,0.0019397188,0.0001811501,0.000289937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035202235,0.00051680877,0.0006148164,0.00048267224,0.00028760766,0.00007721481,0.0022520854,0.0004880104,0.000047546484],"category_scores_gemma":[0.000096942655,0.00053207466,0.00031516998,0.00076685834,0.00021043546,0.0006871393,0.0008352997,0.0009455469,0.000147813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099820536,0.00054765027,0.010604082,0.00036982322,0.0004193542,0.0004484684,0.0008683584,0.21478468,0.00072891347,0.7695775,0.00041004497,0.0011412769],"study_design_scores_gemma":[0.0032470732,0.0010280435,0.028364832,0.0016579058,0.001034662,0.0000683431,0.00061200536,0.29779106,0.012527171,0.63375735,0.014969001,0.0049425606],"about_ca_topic_score_codex":0.00023912847,"about_ca_topic_score_gemma":0.00008995462,"teacher_disagreement_score":0.5843502,"about_ca_system_score_codex":0.00017797972,"about_ca_system_score_gemma":0.00013484327,"threshold_uncertainty_score":0.99971306},"labels":[],"label_agreement":null},{"id":"W2951222308","doi":"10.48550/arxiv.1209.6099","title":"Lattices of Equivalence Relations Closed Under the Operations of Relation Algebras","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Equivalence relation; Mathematics; Congruence relation; Congruence (geometry); Equivalence (formal languages); Lattice (music); Complete lattice; Algebra over a field; Pure mathematics; Order (exchange); Universal algebra; Universality (dynamical systems); Physics; Geometry","score_opus":0.0957389457173508,"score_gpt":0.2180844994418709,"score_spread":0.12234555372452009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951222308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33933622,0.00015994968,0.65803224,0.00017228683,0.00021835114,0.00018812649,0.000008050973,0.0000484878,0.0018363158],"genre_scores_gemma":[0.9941336,0.000096635355,0.0049730777,0.000037148824,0.00003322689,9.624167e-7,0.000010556363,0.0000075883368,0.00070719304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988505,0.00017314557,0.00027054985,0.000409499,0.00010759617,0.0001886751],"domain_scores_gemma":[0.9981063,0.00028496995,0.0003390718,0.0010096579,0.00019996874,0.000060047976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025659442,0.00016492892,0.00021572952,0.00013755831,0.00018459462,0.000025170935,0.0012075872,0.00017844781,0.000048428083],"category_scores_gemma":[0.00004369568,0.00014239301,0.00014317174,0.0005717161,0.00021831405,0.00067131786,0.0008598963,0.00036262264,0.000029071334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028260686,0.000038959617,0.0015625122,0.00001662507,0.000027920552,0.000001156045,0.00028377966,0.36885494,0.00012886694,0.62898695,0.000009259809,0.00008619467],"study_design_scores_gemma":[0.0003960519,0.000057377685,0.066287495,0.0001393986,0.00020416125,0.0000028040608,0.0003529022,0.41995823,0.00077327597,0.51133996,0.00008642368,0.00040191447],"about_ca_topic_score_codex":0.00005827938,"about_ca_topic_score_gemma":0.00003906657,"teacher_disagreement_score":0.65479743,"about_ca_system_score_codex":0.000063787695,"about_ca_system_score_gemma":0.00015058622,"threshold_uncertainty_score":0.58066183},"labels":[],"label_agreement":null},{"id":"W2952912396","doi":"10.48550/arxiv.0901.3761","title":"Closures in Formal Languages and Kuratowski's Theorem","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linguistics; Computer science; Programming language; Mathematics; History; Philosophy","score_opus":0.019687519982676458,"score_gpt":0.28333603477221503,"score_spread":0.26364851478953855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952912396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96311724,0.0022710976,0.02878576,0.0006310742,0.00021424147,0.00019275499,0.0000026985397,0.000172891,0.004612222],"genre_scores_gemma":[0.9927304,0.0002472356,0.0060537504,0.00066895946,0.00012874742,0.000015718259,0.0000062233858,0.000009780504,0.00013921598],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998599,0.00008120205,0.00024159781,0.0005498019,0.00015152384,0.0003769111],"domain_scores_gemma":[0.99908376,0.00007782888,0.000115955074,0.00061824557,0.000028243663,0.00007598621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027031446,0.00024533586,0.0002842977,0.00012112893,0.00006797747,0.00009365242,0.00079048116,0.00019105873,0.000011634651],"category_scores_gemma":[0.00005261124,0.00020387018,0.000064479966,0.00014554603,0.00006493625,0.00037066592,0.001059857,0.0005248857,0.000026285823],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030724626,0.00017216672,0.3977867,0.00015134166,0.000043843887,0.00059319596,0.003544675,0.00090478506,0.0008513818,0.37097588,0.00028940354,0.2246559],"study_design_scores_gemma":[0.0004822284,0.00012612842,0.81771946,0.00015285444,0.000009246795,0.00003712915,0.00012748592,0.0014060386,0.0017257204,0.17644277,0.0011674758,0.00060347165],"about_ca_topic_score_codex":0.00002373694,"about_ca_topic_score_gemma":0.00003534005,"teacher_disagreement_score":0.41993275,"about_ca_system_score_codex":0.000027451028,"about_ca_system_score_gemma":0.000048879538,"threshold_uncertainty_score":0.8313585},"labels":[],"label_agreement":null},{"id":"W2962994292","doi":"10.1112/s1461157000000553","title":"Decomposing Replicable Functions","year":2008,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Statistics","score_opus":0.02690946846744284,"score_gpt":0.2622441534399645,"score_spread":0.23533468497252163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962994292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085863575,0.0001875894,0.91264564,0.0002508984,0.00014474831,0.000030503446,1.1322902e-7,0.000024479514,0.0008524647],"genre_scores_gemma":[0.47719434,0.000044898785,0.5225129,0.00010981507,0.000033681423,3.1364073e-7,1.7392e-7,0.0000030347487,0.00010082828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940133,0.000016215788,0.000287977,0.00006805191,0.00014642226,0.000079996134],"domain_scores_gemma":[0.9993328,0.00012439286,0.00025624747,0.000088286084,0.0001321804,0.00006608368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014386793,0.000058517035,0.00013642032,0.00008168493,0.0001479328,0.000040083545,0.00012605314,0.000019788416,0.0000034625157],"category_scores_gemma":[0.000035635218,0.00004630626,0.00005097322,0.00013908537,0.000030218387,0.00035084077,0.000035843754,0.00008359231,0.00000620124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003855312,0.0014385673,0.00142374,0.0003073066,0.0002948123,0.000490671,0.025127165,0.10096491,0.007297387,0.62575424,0.013592778,0.22326986],"study_design_scores_gemma":[0.0014520511,0.0005272643,0.0020626534,0.0001586674,0.000042002437,0.013179661,0.00048084455,0.4590584,0.00112325,0.51572245,0.0058330996,0.00035967477],"about_ca_topic_score_codex":1.9850359e-7,"about_ca_topic_score_gemma":1.006987e-7,"teacher_disagreement_score":0.39133075,"about_ca_system_score_codex":0.000010524637,"about_ca_system_score_gemma":0.000030496658,"threshold_uncertainty_score":0.18883145},"labels":[],"label_agreement":null},{"id":"W2963646536","doi":"10.48550/arxiv.1508.01103","title":"Partial clones containing all Boolean monotone self-dual partial\\n functions","year":2015,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Monotone polygon; Partial function; Cardinality (data modeling); Mathematics; Combinatorics; Dual (grammatical number); Set (abstract data type); Partial agonist; Discrete mathematics; Computer science; Biology; Genetics; Geometry","score_opus":0.11235316222891459,"score_gpt":0.21480230505175898,"score_spread":0.1024491428228444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963646536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36552817,0.00025307038,0.62606764,0.00026821785,0.0033828537,0.0008022347,0.000045405013,0.00090870715,0.0027437345],"genre_scores_gemma":[0.9939584,0.00044533517,0.0016209335,0.00037244725,0.0008811945,0.00000843981,0.000073230614,0.000068641566,0.0025713698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929105,0.0007166913,0.0008767039,0.0034341163,0.00036962537,0.0016923482],"domain_scores_gemma":[0.9941445,0.0003196401,0.0009829539,0.0025827293,0.00070002757,0.0012701631],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00094093755,0.0011876435,0.001192982,0.0004598456,0.0009270852,0.00043204296,0.0024324367,0.0008198904,0.00021642771],"category_scores_gemma":[0.00011633238,0.0014193443,0.00066774146,0.0012737206,0.0005253627,0.0017108673,0.0040823533,0.0017595787,0.001382083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008340575,0.000981316,0.00443222,0.00008349716,0.0009527378,0.0024765732,0.003641227,0.66852206,0.000098887904,0.31447974,0.0009874278,0.002510279],"study_design_scores_gemma":[0.003284455,0.0011573753,0.00073320343,0.0001741874,0.0009559511,0.0000773008,0.0016795432,0.9017822,0.000353013,0.049633384,0.037637305,0.0025320656],"about_ca_topic_score_codex":0.00021411925,"about_ca_topic_score_gemma":0.000095757765,"teacher_disagreement_score":0.62843025,"about_ca_system_score_codex":0.0007595319,"about_ca_system_score_gemma":0.0010554489,"threshold_uncertainty_score":0.99939543},"labels":[],"label_agreement":null},{"id":"W2963778005","doi":"10.4204/eptcs.195.0","title":"Proceedings of the 12th International Workshop on Quantum Physics and Logic","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Quantum logic; Physics; Quantum; Engineering ethics; Theoretical physics; Engineering physics; Engineering; Quantum mechanics; Quantum computer","score_opus":0.013988562075368667,"score_gpt":0.25552349155366055,"score_spread":0.2415349294782919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963778005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6033801,0.000117905154,0.3739133,0.005976981,0.0008279576,0.0004652605,5.5396833e-7,0.00017169956,0.015146241],"genre_scores_gemma":[0.99077696,0.000012433421,0.008523326,0.0005477846,0.0001112274,0.000010591957,7.1528184e-8,0.0000066127573,0.000010973456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976253,0.0000071228637,0.00025881059,0.0006746023,0.00080134184,0.00063285005],"domain_scores_gemma":[0.9991079,0.000085042,0.00014599922,0.00016509849,0.00035439673,0.0001415522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001197393,0.00018710655,0.00019527794,0.0001328813,0.0001386262,0.00025185797,0.002712804,0.00005658266,0.000002479652],"category_scores_gemma":[0.00031209408,0.00012371496,0.00004271588,0.001564879,0.0016102599,0.0008875798,0.001188546,0.00045221054,0.0000034875306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000155017,0.00006561453,0.0005549054,0.0000051679194,0.0000024318656,4.7320694e-7,0.00056652277,0.00005000471,0.0006113573,0.9903169,0.00003712462,0.007773941],"study_design_scores_gemma":[0.00027847703,0.0002583692,0.0007799706,0.000062271014,0.0000017744441,0.00002716798,0.000042607757,0.16918567,0.00593659,0.82319504,0.00008647422,0.00014555531],"about_ca_topic_score_codex":5.558159e-7,"about_ca_topic_score_gemma":1.8626132e-7,"teacher_disagreement_score":0.38739687,"about_ca_system_score_codex":0.00020335814,"about_ca_system_score_gemma":0.0001744156,"threshold_uncertainty_score":0.59330696},"labels":[],"label_agreement":null},{"id":"W2979931682","doi":"10.1017/s0960129519000136","title":"A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller’s 60th birthday","year":2019,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Surprise; Miller; Event (particle physics); Computer science; Computation; Artificial intelligence; Cognitive science; Psychology; Algorithm; Communication","score_opus":0.008451916697481883,"score_gpt":0.2712746612722881,"score_spread":0.2628227445748062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979931682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6348422,0.000015196751,0.36315125,0.00008978221,0.00054414495,0.0004131027,0.0000011164,0.00008858681,0.0008545741],"genre_scores_gemma":[0.83496934,6.9590214e-7,0.16473548,0.00009358928,0.00018339283,0.0000039845254,0.0000010000355,0.000005805496,0.0000067133496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791986,0.00011637726,0.00044638265,0.00062061386,0.0005355182,0.00036124288],"domain_scores_gemma":[0.9990238,0.00029716897,0.00017005636,0.00036525205,0.00006403582,0.0000797048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063660514,0.0001977737,0.0003289378,0.00034374007,0.00008803656,0.00016363995,0.0007671453,0.000059357655,0.000039021525],"category_scores_gemma":[0.000108723514,0.00015155428,0.000029696137,0.0009794215,0.00031040589,0.0006060666,0.0003761681,0.0001856604,0.000008233342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003705072,0.00006685178,0.0028538562,0.00013533658,0.0000041663247,0.000018420396,0.0047770073,0.04902414,0.0007387391,0.7615502,0.00004382137,0.18075043],"study_design_scores_gemma":[0.00035797217,0.00011352243,0.02815319,0.000085656786,7.8420004e-7,0.000022966848,0.00001953173,0.688693,0.0011965743,0.28121153,0.000007997035,0.00013731373],"about_ca_topic_score_codex":0.0000042122906,"about_ca_topic_score_gemma":0.000004941734,"teacher_disagreement_score":0.6396688,"about_ca_system_score_codex":0.00007800776,"about_ca_system_score_gemma":0.00006462121,"threshold_uncertainty_score":0.6180205},"labels":[],"label_agreement":null},{"id":"W2987094263","doi":"10.70930/tac/pzd6pky9","title":"The dual of compact ordered spaces is a variety","year":2019,"lang":"en","type":"preprint","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Finitary; Arity; Variety (cybernetics); Mathematics; Dual (grammatical number); Bounded function; Monotone polygon; Axiom; Pure mathematics; Equivalence (formal languages); Axiom of choice; Countable set; Discrete mathematics; Set (abstract data type); Algebra over a field; Computer science; Set theory; Mathematical analysis; Programming language; Geometry","score_opus":0.011826263654078023,"score_gpt":0.2619296483363869,"score_spread":0.25010338468230886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987094263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014959892,0.0037915714,0.9753457,0.0011834425,0.0001116886,0.00061789755,0.000048735885,0.00006133747,0.0038797702],"genre_scores_gemma":[0.9971791,0.000505163,0.0016488284,0.000047605037,0.000035335674,0.000056541896,0.0000089726655,0.00000621058,0.00051223877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999097,0.00009448069,0.0002620359,0.00027731,0.00013960163,0.00012955655],"domain_scores_gemma":[0.99777806,0.00067852857,0.00035014263,0.001016374,0.00014456583,0.00003234365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048229625,0.0001515945,0.0002737976,0.00003913056,0.00017847832,0.00007643941,0.0007972991,0.000092017675,0.0000074680493],"category_scores_gemma":[0.000027143826,0.000101230085,0.00006985144,0.00017043081,0.000534967,0.000097438526,0.0005538648,0.00019212953,0.000004560868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019935584,0.000027534476,0.00005849893,0.00008528492,0.000040373914,6.174381e-8,0.0012022934,0.00024179406,0.00009556381,0.99009174,0.000101243815,0.0080356505],"study_design_scores_gemma":[0.00008618591,0.000029208344,0.0003348844,0.0000138582645,0.00002036959,0.0000024665528,0.00048873626,0.00035195114,0.0039914227,0.9861745,0.008389817,0.00011660641],"about_ca_topic_score_codex":0.000016384074,"about_ca_topic_score_gemma":0.0000015483107,"teacher_disagreement_score":0.9822192,"about_ca_system_score_codex":0.0000060638167,"about_ca_system_score_gemma":0.00010983816,"threshold_uncertainty_score":0.4128043},"labels":[],"label_agreement":null},{"id":"W2993236771","doi":"","title":"KUS-algebra is Equivalent to Dual QS-algebra","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algebra over a field; Dual (grammatical number); Pure mathematics","score_opus":0.11302461216546991,"score_gpt":0.3890048599082609,"score_spread":0.27598024774279095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993236771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3535058,0.00039727075,0.6260923,0.014537369,0.000436344,0.00059568405,0.0000018482174,0.000053441894,0.0043799225],"genre_scores_gemma":[0.7138473,0.00009541356,0.28201547,0.00082262204,0.00043156333,0.000027180378,2.3382579e-7,0.000034501732,0.00272573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580765,0.000178052,0.0008028778,0.0002725581,0.00217445,0.0007643939],"domain_scores_gemma":[0.99617416,0.00094562594,0.00027523914,0.0007610829,0.0012847967,0.00055912667],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027043174,0.00018465759,0.00040123757,0.00063802034,0.0002091431,0.00049702765,0.0019674294,0.00009175653,0.0006399578],"category_scores_gemma":[0.0009315776,0.00013313582,0.00017542731,0.00091949693,0.00009624138,0.0009285928,0.00090506783,0.0007810757,0.0019373781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026715143,0.0017815675,0.00016523818,0.00045798213,0.0002200669,0.0005138833,0.018447032,0.0002559699,0.02843944,0.7155987,0.15278538,0.08130804],"study_design_scores_gemma":[0.00082885614,0.0015340152,0.00073392596,0.0003518575,0.000012176025,0.0005847697,0.0015951236,0.013984351,0.013773899,0.95817643,0.007976365,0.00044821604],"about_ca_topic_score_codex":0.0000065626537,"about_ca_topic_score_gemma":0.0000010299791,"teacher_disagreement_score":0.3603415,"about_ca_system_score_codex":0.00014460953,"about_ca_system_score_gemma":0.00021625699,"threshold_uncertainty_score":0.99883974},"labels":[],"label_agreement":null},{"id":"W2995214386","doi":"","title":"Small weak epsilon nets","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.026782258611623585,"score_gpt":0.2335124864736731,"score_spread":0.2067302278620495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995214386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009664671,0.0000796216,0.8558599,0.0038918245,0.00012022578,0.000041161627,7.129225e-8,0.00025999636,0.13008256],"genre_scores_gemma":[0.51596683,0.000008558704,0.4723583,0.0028043662,0.000064128,0.0000032153375,3.3334757e-7,0.000003301531,0.008791001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948484,0.000009725771,0.00007889021,0.000183369,0.00006982127,0.00017333242],"domain_scores_gemma":[0.99960965,0.000022599275,0.000018169112,0.00027713834,0.000014702411,0.000057766872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004765331,0.000061080056,0.00005628576,0.000025139796,0.000045761004,0.00003945562,0.00042360238,0.000022961374,0.0000993599],"category_scores_gemma":[0.000006886186,0.00004672012,0.000025873904,0.00011529406,0.000011419179,0.00025957427,0.00011268776,0.00005082608,0.00069089746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.1481137e-7,0.000029317242,0.00023385281,9.2046884e-7,0.0000019870986,0.0000024302226,0.000074232616,0.0005187449,0.00036000705,0.7435692,0.0025398673,0.25266886],"study_design_scores_gemma":[0.00046070685,0.0001307851,0.007319171,0.0000067794604,0.0000022835357,0.000045368768,0.000022904655,0.11026947,0.008426177,0.07341612,0.7994791,0.00042111098],"about_ca_topic_score_codex":0.000003828067,"about_ca_topic_score_gemma":0.00002815633,"teacher_disagreement_score":0.79693925,"about_ca_system_score_codex":0.000012244939,"about_ca_system_score_gemma":0.000010757836,"threshold_uncertainty_score":0.88803196},"labels":[],"label_agreement":null},{"id":"W2995575807","doi":"10.4153/s000843951900078x","title":"Amenability and Fixed Point Properties of Semitopological Semigroups in Modular Vector Spaces","year":2019,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Banach space; Fixed-point theorem; Fixed-point property; Fixed point; Pure mathematics; Generalization; Locally convex topological vector space; Semigroup; Modular design; Regular polygon; Space (punctuation); Discrete mathematics; Mathematical analysis; Topological space","score_opus":0.009723724523112067,"score_gpt":0.1889585547392655,"score_spread":0.17923483021615344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995575807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883938,0.00019445221,0.0031950986,0.006461913,0.000038579732,0.00030342952,0.0000019238728,0.000029212035,0.0013815818],"genre_scores_gemma":[0.99290025,0.000004211802,0.0065277675,0.0003223758,0.0000103866105,0.00001473686,3.6527362e-7,0.000005438727,0.00021448456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989064,0.000072351155,0.00024832436,0.00032287952,0.00012946142,0.00032059976],"domain_scores_gemma":[0.9991999,0.00011697014,0.000045870765,0.0003727137,0.00003129905,0.00023320202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029833167,0.0001249289,0.0002916068,0.00007916341,0.000029214114,0.000038971477,0.00032396917,0.00008504347,0.00068757345],"category_scores_gemma":[0.00030089862,0.00009202558,0.000037338767,0.00013830786,0.00014974091,0.00006454506,0.00010154012,0.00014254054,0.00035209986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020571557,0.00020163904,0.008419267,0.00077674753,0.000021176715,0.00008293521,0.003194903,0.00012295293,0.011459778,0.9726096,0.0005376604,0.0025528178],"study_design_scores_gemma":[0.0023411633,0.0010219975,0.051699147,0.0012045128,0.000023812883,0.0001941099,0.002430098,0.047093343,0.021153761,0.8565724,0.014334044,0.0019315928],"about_ca_topic_score_codex":0.00048666145,"about_ca_topic_score_gemma":0.00038381154,"teacher_disagreement_score":0.11603714,"about_ca_system_score_codex":0.000075924894,"about_ca_system_score_gemma":0.00006998573,"threshold_uncertainty_score":0.7528447},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02094504116464215,"score_gpt":0.24434504223906217,"score_spread":0.22340000107442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996968996","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031291982,0.002758446,0.26647604,0.00004586593,0.0052123265,0.0018044086,0.000049455848,0.00046133596,0.7200629],"genre_scores_gemma":[0.11352736,0.0017415319,0.516611,0.00053737476,0.0011429774,0.0002656506,0.00013716906,0.0006998544,0.36533713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763876,0.000075991695,0.0008186451,0.0005339279,0.0005233229,0.00040934552],"domain_scores_gemma":[0.99700636,0.0005840017,0.0006563198,0.0015869009,0.00009154947,0.00007484474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080372754,0.000443846,0.00089341856,0.0006078842,0.00003767713,0.00005571383,0.0019286216,0.00041873156,0.000035696175],"category_scores_gemma":[0.00008158659,0.00041095307,0.00040742947,0.00040379335,0.00017196077,0.00022571883,0.00063182693,0.00061767193,0.00009815096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048149514,0.00010472058,0.000068471985,0.00047737724,0.000064658765,0.000013445869,0.0011953232,0.00002496967,0.0000086277705,0.99602234,0.00071331585,0.0013019508],"study_design_scores_gemma":[0.00039746286,0.000087410015,0.000044035536,0.00048164488,0.000029147026,0.0000050609283,0.000043262724,0.00048695086,0.00011779974,0.99352187,0.004367695,0.00041768904],"about_ca_topic_score_codex":6.083221e-7,"about_ca_topic_score_gemma":0.000001052232,"teacher_disagreement_score":0.3547258,"about_ca_system_score_codex":0.0000789578,"about_ca_system_score_gemma":0.00021089951,"threshold_uncertainty_score":0.99983424},"labels":[],"label_agreement":null},{"id":"W3004338600","doi":"10.48550/arxiv.1904.02264","title":"Some Results on the Additivity and Multiplication Order Preserving Properties of Stochastic Orders","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Additive function; Stochastic ordering; Multiplicative function; Convolution (computer science); Laplace transform; Moment (physics); Independent and identically distributed random variables; Multiplication (music); Applied mathematics; Order (exchange); Random variable; Constant (computer programming); Additive model; Combinatorics; Statistics; Mathematical analysis; Computer science","score_opus":0.08274052207055149,"score_gpt":0.18543599035008765,"score_spread":0.10269546827953616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004338600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6009428,0.000101356774,0.39724183,0.0004417384,0.00018529761,0.0006108832,0.000022870894,0.000091685746,0.0003615388],"genre_scores_gemma":[0.99906987,0.000041915504,0.00033481547,0.00007637756,0.00003084534,0.0000023102075,0.000005010495,0.000008235661,0.0004305986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873495,0.00013033967,0.00014576134,0.0007154024,0.0000875475,0.00018597186],"domain_scores_gemma":[0.9981277,0.00028480345,0.00027141857,0.0011115607,0.00015779695,0.00004674364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020514992,0.00019213826,0.00020464262,0.00010193516,0.00012358029,0.000043928907,0.0010320152,0.0001226354,0.000002601845],"category_scores_gemma":[0.00026101767,0.00014597007,0.000055183173,0.00026611862,0.00015128747,0.00033895753,0.0014997133,0.0003459754,0.000014561157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001444325,0.000110768124,0.00009485927,0.0001775365,0.000056295525,0.000007482394,0.00066575,0.7212511,0.00055041834,0.27626157,0.000107237276,0.0005725823],"study_design_scores_gemma":[0.000581468,0.000099558514,0.0019315624,0.00026143529,0.000028782697,0.0000010842398,0.00013418654,0.9338128,0.0007358643,0.062026776,0.000050384166,0.00033607977],"about_ca_topic_score_codex":0.00007886311,"about_ca_topic_score_gemma":0.000013934731,"teacher_disagreement_score":0.3981271,"about_ca_system_score_codex":0.00004804916,"about_ca_system_score_gemma":0.00009309201,"threshold_uncertainty_score":0.5952487},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019235686017993463,"score_gpt":0.25146553306565467,"score_spread":0.2322298470476612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010545200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04378872,0.00058957865,0.9537429,0.00070693484,0.0004786592,0.000006764246,5.48974e-7,0.000019637379,0.00066622125],"genre_scores_gemma":[0.9529858,0.00010540685,0.045413453,0.0007099437,0.0005143244,6.79324e-7,0.0000010492871,0.000008362528,0.00026096168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899864,0.00004567541,0.000273139,0.0001605622,0.00032599663,0.00019601044],"domain_scores_gemma":[0.99903,0.00005572293,0.00024509025,0.0002900175,0.00027923455,0.000099912584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006273476,0.00011455412,0.00023386814,0.00003354968,0.0000693102,0.00006531565,0.0005003245,0.00003024688,0.000005944005],"category_scores_gemma":[0.000008865134,0.00009380533,0.00015496658,0.00030766163,0.000028551314,0.00090106577,0.00015492285,0.00015798927,0.0000029705918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048002657,0.00007892441,0.000005072221,0.0000020517414,0.0000244721,0.00024860402,0.000077449025,0.05141343,0.00042844046,0.93460965,0.00014461658,0.012962516],"study_design_scores_gemma":[0.00045585,0.00007378254,0.000085051564,0.000018801868,0.000011530259,0.00024408923,0.00002110208,0.012778171,0.014750848,0.9708747,0.00056125654,0.00012481431],"about_ca_topic_score_codex":0.0000046738,"about_ca_topic_score_gemma":0.00000179428,"teacher_disagreement_score":0.9091971,"about_ca_system_score_codex":0.000039241586,"about_ca_system_score_gemma":0.00019334815,"threshold_uncertainty_score":0.38252702},"labels":[],"label_agreement":null},{"id":"W3015518909","doi":"10.1016/j.topol.2020.107207","title":"Extensions of dualities and a new approach to the Fedorchuk duality","year":2020,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Sofia University","keywords":"Mathematics; Hausdorff space; Categorical variable; Duality (order theory); Homomorphism; Extension (predicate logic); Pure mathematics; Complete Boolean algebra; Algebra over a field; Discrete mathematics; Two-element Boolean algebra","score_opus":0.07429577212389438,"score_gpt":0.2947659889049297,"score_spread":0.22047021678103534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015518909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010671819,0.0007458276,0.9279582,0.056044128,0.000016217606,0.0003320128,0.000007134529,0.00004914744,0.0041755126],"genre_scores_gemma":[0.97757405,0.00008124964,0.017422086,0.004363236,0.00006144719,0.00006863693,0.0000019544768,0.0000023278847,0.00042499203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951476,0.000034984892,0.00010465461,0.00021279242,0.00004086136,0.000091941736],"domain_scores_gemma":[0.99952585,0.00011308655,0.00003292358,0.00019950952,0.0000269023,0.00010173777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006604598,0.000052995267,0.000095984644,0.00001438299,0.0001719473,0.00001215404,0.00021860457,0.000030576062,0.0000072969574],"category_scores_gemma":[0.00004452083,0.00003654696,0.000012312838,0.00017761458,0.000095262076,0.00006201014,0.00019710712,0.000065421315,0.000013576569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016350089,0.000012529817,0.000025883737,0.0000063665784,0.0000038642565,7.346295e-8,0.0017969207,0.000016185784,0.0002041249,0.9909285,0.0008853828,0.0061185597],"study_design_scores_gemma":[0.00068647484,0.0002719826,0.019823685,0.000008428608,0.000050525294,0.000102990656,0.0032014195,0.012543624,0.0023603153,0.5990752,0.3613882,0.0004871647],"about_ca_topic_score_codex":0.0000148883955,"about_ca_topic_score_gemma":0.000003820502,"teacher_disagreement_score":0.96690226,"about_ca_system_score_codex":0.0000016242451,"about_ca_system_score_gemma":0.00002313892,"threshold_uncertainty_score":0.14903419},"labels":[],"label_agreement":null},{"id":"W3021802605","doi":"","title":"Semirigid Equivalence Relations on a Finite Set.","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Equivalence (formal languages); Set (abstract data type); Computer science; Mathematics; Theoretical computer science; Algebra over a field; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.027596645371497606,"score_gpt":0.2788255766758361,"score_spread":0.2512289313043385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021802605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038300024,0.00002871011,0.84817904,0.0039003273,0.000090380425,0.000061862615,5.436104e-7,0.00030481807,0.14360428],"genre_scores_gemma":[0.9373244,0.000007333698,0.049620964,0.004075232,0.00003163025,0.0000024876254,9.3237236e-7,0.0000019731929,0.008935032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993365,0.000017226472,0.00010023558,0.00023219554,0.00013656264,0.0001772782],"domain_scores_gemma":[0.9993921,0.0001229235,0.000028687351,0.00037437264,0.000022388576,0.0000595477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000062462954,0.00007559352,0.00006318406,0.00005098549,0.000100249046,0.000044997003,0.00039822774,0.000030173082,0.000071034694],"category_scores_gemma":[0.000045743993,0.000059116977,0.00003366868,0.00028534577,0.000014005722,0.0003501082,0.00004142925,0.00009561656,0.0006344914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014568225,0.000028219009,0.0000556682,5.230971e-7,0.0000011162472,0.000009538172,0.00013761013,0.0030841397,0.00017772205,0.9713074,0.0026601942,0.0225364],"study_design_scores_gemma":[0.00037007162,0.0006205539,0.009079329,0.000034485474,0.0000032750295,0.000018359644,0.000021727234,0.09702089,0.0019553814,0.85909843,0.03136435,0.0004131252],"about_ca_topic_score_codex":7.58112e-7,"about_ca_topic_score_gemma":6.940837e-7,"teacher_disagreement_score":0.9334944,"about_ca_system_score_codex":0.000017354394,"about_ca_system_score_gemma":0.000018711824,"threshold_uncertainty_score":0.81553143},"labels":[],"label_agreement":null},{"id":"W3032865349","doi":"10.1007/978-3-030-71430-7_5","title":"Beth Definability in the Logic KR","year":2021,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Surjective function; Class (philosophy); Property (philosophy); Counterexample; Pure mathematics; Algebraic number; Epimorphism; Algebra over a field; Discrete mathematics; Computer science; Philosophy; Epistemology; Artificial intelligence","score_opus":0.03499427584012624,"score_gpt":0.3030185039617747,"score_spread":0.2680242281216485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032865349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044566452,0.0022229955,0.7514216,0.01765188,0.00062399334,0.00097556843,0.00022628492,0.00024380388,0.22658934],"genre_scores_gemma":[0.80792636,0.00075300474,0.032859266,0.018466491,0.000974413,0.0004660784,0.00048540067,0.000109123575,0.13795985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969649,0.00018921579,0.00058382866,0.001031964,0.00051819975,0.0007118945],"domain_scores_gemma":[0.99704236,0.00073912926,0.00021835967,0.0014993327,0.00034807585,0.0001527549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012069901,0.00048483908,0.0006670824,0.0002709161,0.00044375448,0.00031655023,0.0016790985,0.00040163615,0.00015413783],"category_scores_gemma":[0.0008203533,0.00034829098,0.00031131794,0.00045240624,0.0001424338,0.0002126587,0.0005970481,0.00092860026,0.00024810078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004785516,0.000039253573,0.00004312797,0.0000114819595,0.000015723423,0.00021141735,0.00016937229,0.00014098863,0.0000123243335,0.9971204,0.00086015527,0.0013709768],"study_design_scores_gemma":[0.00030647646,0.00014220126,0.00032927733,0.000115197414,0.000029359284,0.00006624009,0.000049056078,0.00012655013,0.000013361454,0.8996948,0.09863423,0.000493256],"about_ca_topic_score_codex":0.000009775197,"about_ca_topic_score_gemma":0.0000883914,"teacher_disagreement_score":0.8078818,"about_ca_system_score_codex":0.00089976116,"about_ca_system_score_gemma":0.0002713808,"threshold_uncertainty_score":0.9998969},"labels":[],"label_agreement":null},{"id":"W3047626701","doi":"10.4153/s0008439520000594","title":"Beyond Beatty sequences: Complementary lattices","year":2020,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Mathematics; Property (philosophy); Pure mathematics; Complementary sequences; Combinatorics; Epistemology","score_opus":0.029590009023133485,"score_gpt":0.23899326915734306,"score_spread":0.20940326013420957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047626701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017146291,0.00034855428,0.5281774,0.3264897,0.00023124694,0.00067315577,0.00006219591,0.00048244203,0.12638907],"genre_scores_gemma":[0.8227768,0.000005467108,0.12744875,0.04917732,0.00016947987,0.000023933277,0.00001328399,0.000018471308,0.00036646883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998715,0.00004326374,0.00023899977,0.00035468643,0.00019915518,0.00044893147],"domain_scores_gemma":[0.99855804,0.00014681277,0.00004654804,0.0003004601,0.00003172775,0.0009163911],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012273487,0.00015102095,0.00020495146,0.000046040266,0.00015536524,0.00011772004,0.0008851982,0.000046468413,0.008663433],"category_scores_gemma":[0.00011126726,0.00013211809,0.000058237587,0.00021551833,0.00008973033,0.00010399189,0.00011337858,0.00015361098,0.010437555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012972031,0.00001547836,0.00009347508,0.000058489302,0.000014799018,0.00017392435,0.0008308907,0.00002380524,0.000050177066,0.9709258,0.024029983,0.003781881],"study_design_scores_gemma":[0.0003756255,0.00016632582,0.00019603771,0.00004262442,0.00001668234,0.00004706479,0.0002730558,0.010117865,0.00028044294,0.5787717,0.40916562,0.00054693385],"about_ca_topic_score_codex":0.00023934721,"about_ca_topic_score_gemma":0.00034127125,"teacher_disagreement_score":0.8056305,"about_ca_system_score_codex":0.00006216117,"about_ca_system_score_gemma":0.00012349484,"threshold_uncertainty_score":0.9922428},"labels":[],"label_agreement":null},{"id":"W3048603571","doi":"10.1007/978-3-030-52800-3_4","title":"Fuzzy Relations and Relational Computing","year":2020,"lang":"en","type":"book-chapter","venue":"Intelligent systems reference library","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fuzzy logic; Fuzzy classification; Fuzzy set operations; Interpretation (philosophy); Mathematics; Computer science; Artificial intelligence; Type-2 fuzzy sets and systems; Fuzzy number; Fuzzy set; Theoretical computer science; Data mining; Algebra over a field; Pure mathematics","score_opus":0.05462454617304618,"score_gpt":0.23385572075047548,"score_spread":0.1792311745774293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048603571","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013272859,0.004847938,0.22346161,0.0010437262,0.000680724,0.00039477195,0.00003639384,0.00059636554,0.7689252],"genre_scores_gemma":[0.13856007,0.0012172073,0.029594544,0.00093722914,0.00110724,0.000023510791,0.00043998822,0.00015351582,0.8279667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977165,0.00005464597,0.00071419234,0.00083883526,0.0003976389,0.00027823015],"domain_scores_gemma":[0.9983911,0.00032785875,0.00043073142,0.00053879415,0.000045525325,0.00026599347],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008724998,0.0004146048,0.0004733649,0.00020366033,0.00020811256,0.00030590477,0.00075647025,0.00038469935,0.00011425766],"category_scores_gemma":[0.000021069918,0.00037939372,0.00009915571,0.00008831563,0.00009327451,0.0011291781,0.00070623955,0.0007666016,0.0010438251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030028107,0.0000050508957,0.00008456855,0.000057848974,0.00003893309,0.0000383381,0.0001283066,0.00027706075,0.0000025494542,0.991253,0.003399404,0.004711903],"study_design_scores_gemma":[0.000080122445,0.00007172674,0.00011871907,0.00059667364,0.0000173508,0.00008426774,0.00002163439,0.0095362775,0.0000120256045,0.41493705,0.5739353,0.0005888537],"about_ca_topic_score_codex":0.000002441146,"about_ca_topic_score_gemma":4.1574816e-7,"teacher_disagreement_score":0.576316,"about_ca_system_score_codex":0.000042412274,"about_ca_system_score_gemma":0.0001640841,"threshold_uncertainty_score":0.9998658},"labels":[],"label_agreement":null},{"id":"W30786398","doi":"10.1094/pdis-92-1-0172a","title":"On Domain Semigroups, Stably Supported Quantales and Frames","year":2009,"lang":"en","type":"article","venue":"Plant Disease","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Domain (mathematical analysis); Frame (networking); Computer science; Mathematics","score_opus":0.008763089921884189,"score_gpt":0.22622574357919015,"score_spread":0.21746265365730597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30786398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9415323,0.0006887266,0.05514521,0.0014547727,0.000095669166,0.00014144073,0.00011641862,0.00024279169,0.00058264326],"genre_scores_gemma":[0.9952182,0.000048541566,0.0027637053,0.0018507426,0.000026602154,0.0000036634824,0.000036475813,0.0000032533733,0.000048783004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919313,0.000027701888,0.000100268786,0.00029507725,0.00016222363,0.00022159197],"domain_scores_gemma":[0.9993337,0.00008842591,0.00003584872,0.0002653166,0.000008895312,0.00026784086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051221414,0.000118259595,0.00010546685,0.000050317773,0.0000915453,0.00007141213,0.00022781877,0.000024237917,0.0000146256225],"category_scores_gemma":[0.000030957453,0.000094168594,0.000029084433,0.0000934191,0.00002826922,0.00022115714,0.00003968865,0.00007258266,0.000027250122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016718413,0.00032266355,0.0039059406,0.000021790596,0.000011681053,0.0011933924,0.00040448044,0.000071767055,0.00089469063,0.97284216,0.0038570466,0.016307231],"study_design_scores_gemma":[0.0007960644,0.00035399027,0.17283653,0.00007186452,0.0000154873,0.00003878838,0.00006445803,0.007991034,0.0003780974,0.8129318,0.004001303,0.0005206371],"about_ca_topic_score_codex":0.000001871246,"about_ca_topic_score_gemma":0.0000017848391,"teacher_disagreement_score":0.16893059,"about_ca_system_score_codex":0.00001058028,"about_ca_system_score_gemma":0.000026618252,"threshold_uncertainty_score":0.38400838},"labels":[],"label_agreement":null},{"id":"W3091534711","doi":"10.1017/jsl.2021.82","title":"DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS","year":2021,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Equivalence relation; Graph; Discrete mathematics; Equivalence (formal languages); Spectrum (functional analysis); Jump; Combinatorics; Degree (music); Pure mathematics; Physics","score_opus":0.08635827828913571,"score_gpt":0.2996625492359246,"score_spread":0.2133042709467889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091534711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084644526,0.004766404,0.90186936,0.0016237666,0.0013414944,0.00016946634,0.000009013483,0.000043581353,0.005532389],"genre_scores_gemma":[0.8844921,0.000540831,0.114365116,0.0001954325,0.0002576587,0.0000020273394,0.000003060955,0.0000116206165,0.00013217855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971488,0.00018506357,0.0012183128,0.00040908565,0.0006963032,0.00034240395],"domain_scores_gemma":[0.99609745,0.0002735698,0.0018915606,0.0009191879,0.00063908193,0.00017915528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006083631,0.0002967783,0.0009663754,0.0004067299,0.00008455244,0.00013008238,0.0021481074,0.00021954448,0.000121610385],"category_scores_gemma":[0.00028136926,0.00024046791,0.0005779764,0.0005992764,0.00014004558,0.00041853826,0.0010591312,0.001194558,0.00001602852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007035322,0.0015116432,0.01095656,0.0011908244,0.001625254,0.0035362612,0.0070690853,0.14048678,0.017759588,0.7826857,0.0016785332,0.031429395],"study_design_scores_gemma":[0.0010679688,0.0006978899,0.09857108,0.0016078039,0.00035283793,0.0019026907,0.000402868,0.021768618,0.0011642419,0.87099916,0.00047765477,0.0009871654],"about_ca_topic_score_codex":0.000009553028,"about_ca_topic_score_gemma":0.000005014104,"teacher_disagreement_score":0.79984754,"about_ca_system_score_codex":0.00015039404,"about_ca_system_score_gemma":0.00059675693,"threshold_uncertainty_score":0.9805997},"labels":[],"label_agreement":null},{"id":"W3093314166","doi":"10.70930/tac/haxgos14","title":"Exponentiability in Double Categories and the Glueing Construction","year":2020,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.009967318873455595,"score_gpt":0.2297426919730556,"score_spread":0.21977537309960002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093314166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18415368,0.0018227389,0.8101676,0.0021414529,0.00003014736,0.00035939302,0.0000012646161,0.000063105086,0.0012605832],"genre_scores_gemma":[0.99764705,0.00021067043,0.0019577497,0.000050208375,0.00002092371,0.00009181269,0.00000108986,0.0000021944982,0.000018281225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994238,0.000074705385,0.00017295204,0.00018000002,0.00005730747,0.0000912601],"domain_scores_gemma":[0.9992942,0.00036577028,0.00007208923,0.00019533614,0.00003607354,0.00003651797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042505658,0.00006657734,0.0001212436,0.000019155454,0.00021684676,0.00005683294,0.00020100032,0.000023807099,0.0000015522048],"category_scores_gemma":[0.000039103426,0.000046641253,0.000015016271,0.0002290451,0.0008871412,0.00026737878,0.0001249051,0.00006900411,9.313622e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010856843,0.0000055968226,0.00035611348,0.000017256385,0.0000035015341,9.542826e-8,0.0013276755,0.000011482414,0.00022226367,0.9728245,0.0000010042506,0.025121909],"study_design_scores_gemma":[0.0005236909,0.000014126282,0.00046530794,0.0000016250044,0.000004177484,0.0000034429083,0.0014022621,0.00022436239,0.004838238,0.9913547,0.0011103409,0.000057747136],"about_ca_topic_score_codex":0.000008947371,"about_ca_topic_score_gemma":0.0000035228159,"teacher_disagreement_score":0.8134934,"about_ca_system_score_codex":0.000003860706,"about_ca_system_score_gemma":0.000018543324,"threshold_uncertainty_score":0.3268709},"labels":[],"label_agreement":null},{"id":"W3096452901","doi":"10.3233/faia200670","title":"A Mereology for Connected Structures","year":2020,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mereology; Regular polygon; Graph; Mathematics; Combinatorics; Computer science; Theoretical computer science; Geometry; Epistemology; Philosophy","score_opus":0.045463628089771974,"score_gpt":0.277745206035103,"score_spread":0.23228157794533102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096452901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017839039,0.0010665813,0.9842925,0.0011177665,0.0002563313,0.00081388064,0.000030539388,0.00008490558,0.0123356925],"genre_scores_gemma":[0.043206047,0.0020181616,0.9253816,0.0033311497,0.0015047309,0.001922358,0.00027003995,0.00012023879,0.022245647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987578,0.000008964917,0.0003600163,0.0005952254,0.000083513216,0.00019450982],"domain_scores_gemma":[0.99928695,0.00009869408,0.00014101865,0.00032480212,0.000062672894,0.000085836306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005526091,0.0002088342,0.00031776898,0.00014531879,0.0001324771,0.000054790908,0.0005424582,0.00020232878,0.000016377331],"category_scores_gemma":[0.000025721678,0.00020974861,0.0000689015,0.00010699385,0.00019399381,0.00008825758,0.000116168805,0.00023159441,0.00002007708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006161874,0.000005636529,0.0000028448046,0.000012085295,0.00001090791,0.0000012720179,0.00007539669,0.00005530774,0.000013966105,0.7595579,0.00059674284,0.23966175],"study_design_scores_gemma":[0.000016209999,0.000039217106,0.0000024561145,0.000009034233,0.000010834693,0.0000023491132,0.000046451212,0.007814478,0.00031220174,0.86815435,0.12339427,0.00019815296],"about_ca_topic_score_codex":0.0000021568944,"about_ca_topic_score_gemma":0.000014899032,"teacher_disagreement_score":0.2394636,"about_ca_system_score_codex":0.00002697341,"about_ca_system_score_gemma":0.00005241331,"threshold_uncertainty_score":0.85533},"labels":[],"label_agreement":null},{"id":"W3105926622","doi":"","title":"Decidability of quantified propositional intuitionistic logic and s4 on trees of height and arity","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Propositional variable; Intermediate logic; Decidability; Propositional calculus; Modal logic; Zeroth-order logic; Intuitionistic logic; Well-formed formula; Arity; Discrete mathematics; Normal modal logic; Modal; Computer science; Multimodal logic; Description logic; Theoretical computer science","score_opus":0.02492570156563612,"score_gpt":0.26565299915160284,"score_spread":0.24072729758596673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105926622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7051086,0.00012588262,0.29259536,0.00030464755,0.00005027395,0.0001129351,0.000003906353,0.000021591302,0.0016768203],"genre_scores_gemma":[0.97370964,0.0000072764906,0.026175352,0.000068941765,0.000012256871,0.0000035938467,0.0000013779436,0.0000012005189,0.000020343541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99944717,0.000051398372,0.00013292088,0.00015121287,0.00011349025,0.00010379496],"domain_scores_gemma":[0.99946356,0.000215423,0.000059353024,0.00016118486,0.000046454574,0.00005404415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020256858,0.000062615974,0.00012348186,0.000030572694,0.00006213708,0.000012139992,0.00009385956,0.00003084606,0.000020659018],"category_scores_gemma":[0.00006408311,0.00004394171,0.000017976565,0.000082414925,0.00017928172,0.00020981299,0.00007820938,0.00005215022,0.0000015375913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001262494,0.00017707027,0.009528635,0.000025671563,0.0000040463024,2.8007793e-7,0.00008804724,0.0000055277305,0.00223911,0.98470014,0.0000105089375,0.0032083287],"study_design_scores_gemma":[0.00026293943,0.00032745406,0.53721374,0.000017086488,0.0000062145646,0.000012488137,0.000027351185,0.0020343119,0.018088466,0.44187364,0.000028559698,0.00010775354],"about_ca_topic_score_codex":0.00000608205,"about_ca_topic_score_gemma":0.000006487849,"teacher_disagreement_score":0.54282653,"about_ca_system_score_codex":0.000007687842,"about_ca_system_score_gemma":0.000012789492,"threshold_uncertainty_score":0.17918909},"labels":[],"label_agreement":null},{"id":"W3115266434","doi":"10.59203/zfn.69.518","title":"Abstract logical structuralism","year":2020,"lang":"en","type":"article","venue":"Philosophical Problems in Science (Zagadnienia Filozoficzne w Nauce)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Structuralism (philosophy of science); Epistemology; Categorical variable; Philosophy of logic; Mathematical logic; Foundations of mathematics; Mathematics; Philosophy; Algorithm","score_opus":0.05581735331498715,"score_gpt":0.279506762106114,"score_spread":0.22368940879112686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115266434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64116484,0.00086013624,0.11876694,0.20882353,0.0018156834,0.002208692,0.000029929908,0.0021081723,0.024222098],"genre_scores_gemma":[0.9774637,0.000029931527,0.017186109,0.0048750867,0.0003766267,0.000031612028,0.0000039677097,0.000021805987,0.000011154786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938932,0.000091715934,0.0009493442,0.0020508964,0.0016019729,0.0014128743],"domain_scores_gemma":[0.99734366,0.00024068828,0.0002622524,0.0009807801,0.00021505996,0.000957555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010446144,0.00051043043,0.00060953654,0.00036396558,0.00046367475,0.0004669283,0.004841344,0.00023131986,0.00017801633],"category_scores_gemma":[0.0009108238,0.00041318245,0.00016711775,0.004468116,0.0013873155,0.0026746846,0.0013761071,0.0011899906,0.00036461512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003937004,0.00023848926,0.0012574511,0.00009186702,0.000009378196,0.00025786366,0.0022263345,0.0051594423,0.061950866,0.91121656,0.0001338853,0.017418472],"study_design_scores_gemma":[0.0013147811,0.00044030423,0.023534942,0.00007607639,0.000005424656,0.00007816706,0.000037346166,0.0313767,0.0031806657,0.9373168,0.0015199604,0.0011188505],"about_ca_topic_score_codex":0.000013468425,"about_ca_topic_score_gemma":0.000003458351,"teacher_disagreement_score":0.33629888,"about_ca_system_score_codex":0.0001687384,"about_ca_system_score_gemma":0.00028804407,"threshold_uncertainty_score":0.999832},"labels":[],"label_agreement":null},{"id":"W3115348371","doi":"10.70930/tac/bp2ff6uy","title":"Completely distributive enriched categories are not always continuous","year":2020,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Distributivity; Distributive property; Unit interval; Mathematics; Norm (philosophy); Interval (graph theory); Distributive lattice; Pure mathematics; Discrete mathematics; Mathematical economics; Combinatorics; Epistemology; Philosophy","score_opus":0.0174269764769061,"score_gpt":0.24066129446273227,"score_spread":0.22323431798582616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115348371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01377717,0.0006178916,0.9821442,0.001657977,0.00002517905,0.00027402645,0.000055654946,0.00016983261,0.0012780917],"genre_scores_gemma":[0.99718714,0.00005027463,0.0019383875,0.0004993233,0.00006817823,0.00015743721,0.000023112587,0.00000688679,0.0000692637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906135,0.00007886552,0.00023457815,0.00032003448,0.00012255846,0.00018259839],"domain_scores_gemma":[0.9988582,0.00036125674,0.00019387185,0.00033881428,0.00013931956,0.00010852178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018248154,0.00015113415,0.00027677265,0.000028792489,0.0002327721,0.00005737144,0.0005481021,0.000046466255,0.000014215858],"category_scores_gemma":[0.00008504842,0.00013067882,0.00004429782,0.00037635898,0.0004275491,0.00027200457,0.00021532387,0.000110794244,0.00001796076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037546317,0.000029797906,0.00017951868,0.000026792924,0.000016054395,0.0000012135478,0.0012405372,0.000012615743,0.0015971231,0.9871748,0.00007962018,0.0096043525],"study_design_scores_gemma":[0.0002694021,0.00010062236,0.0024059173,0.0000033860003,0.000020775302,0.0000066726643,0.0020776298,0.00016666717,0.018666694,0.960968,0.0150847025,0.00022951864],"about_ca_topic_score_codex":0.0000040472773,"about_ca_topic_score_gemma":0.0000010000383,"teacher_disagreement_score":0.98340994,"about_ca_system_score_codex":0.0000078586,"about_ca_system_score_gemma":0.000030281688,"threshold_uncertainty_score":0.53289276},"labels":[],"label_agreement":null},{"id":"W3118606270","doi":"10.1090/conm/761","title":"Advances in Representation Theory of Algebras","year":2021,"lang":"en","type":"book","venue":"Contemporary mathematics - American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Representation (politics); Representation theory; Algebra over a field; Mathematics; Computer science; Pure mathematics; Political science","score_opus":0.03329517554939559,"score_gpt":0.2909990924208377,"score_spread":0.2577039168714421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118606270","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000891014,0.004019991,0.6247648,0.00014477308,0.00009406374,0.00057357445,0.000015033817,0.00015893244,0.37013972],"genre_scores_gemma":[0.017168865,0.0032986912,0.8265179,0.00095831853,0.00026829302,0.00027402127,0.00016854418,0.0002572663,0.1510881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584395,0.00022598561,0.0016534263,0.00091055053,0.0008919228,0.00047419057],"domain_scores_gemma":[0.9937962,0.0025207177,0.0016482477,0.0016432859,0.00021145362,0.00018008055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009685207,0.00062645745,0.0019769492,0.00013440286,0.00007826374,0.00008876217,0.0014705346,0.000280274,0.0001240922],"category_scores_gemma":[0.0004966349,0.00055441185,0.00080082647,0.00077995,0.0009599372,0.0007522014,0.0006708855,0.00068447343,0.000056567627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000596992,0.00041497115,0.000015097076,0.0015271124,0.000100731275,0.000045754332,0.0042863577,0.000016968423,0.000038496426,0.9794762,0.0032101737,0.010862169],"study_design_scores_gemma":[0.0003511548,0.000115219955,0.000009578236,0.001094109,0.00003455296,0.0000224994,0.0017687953,0.004245801,0.00017358302,0.98803055,0.0035773371,0.0005767959],"about_ca_topic_score_codex":0.0000016093963,"about_ca_topic_score_gemma":0.0000010983377,"teacher_disagreement_score":0.21905163,"about_ca_system_score_codex":0.0001961413,"about_ca_system_score_gemma":0.0007429791,"threshold_uncertainty_score":0.9996907},"labels":[],"label_agreement":null},{"id":"W3125257445","doi":"10.2139/ssrn.902816","title":"The Outflow Ranking Method for Weighted Directed Graphs","year":2006,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Outflow; Ranking (information retrieval); Mathematics; Computer science; Artificial intelligence; Geography","score_opus":0.005778352829016494,"score_gpt":0.2478363225769512,"score_spread":0.24205796974793473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125257445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027518796,0.004213393,0.989841,0.00196517,0.00040014015,0.00016702998,5.384367e-7,0.0001683389,0.00049253536],"genre_scores_gemma":[0.6595641,0.0020841593,0.33258733,0.0005309912,0.0009963573,0.00006767464,0.0000053537456,0.000054748903,0.0041093035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969689,0.00015326432,0.00028215253,0.0002527275,0.00024253121,0.0021004144],"domain_scores_gemma":[0.9989643,0.0004002272,0.00018497209,0.00027393998,0.00012951167,0.000047061065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019721778,0.00015663797,0.0001610761,0.00008794727,0.0009732873,0.0002149831,0.0009382188,0.000053917516,0.0000016669422],"category_scores_gemma":[0.00005161793,0.000098247925,0.00018904245,0.00041706816,0.00003229075,0.00030262233,0.000055364344,0.0008530004,0.0000050351337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015524583,0.000016676166,0.000059326627,8.915506e-7,0.000035475725,0.0000014081035,0.000023942928,0.00006469168,0.00037972687,0.85964686,0.00016376426,0.13959172],"study_design_scores_gemma":[0.0005818992,0.00012214316,0.000179386,0.0000050226836,0.000012978068,0.00015797069,0.000041574145,0.021260396,0.00043793672,0.96933,0.0077258367,0.00014484588],"about_ca_topic_score_codex":0.000019379155,"about_ca_topic_score_gemma":0.00037131636,"teacher_disagreement_score":0.6572536,"about_ca_system_score_codex":0.00024666544,"about_ca_system_score_gemma":0.000533153,"threshold_uncertainty_score":0.74858373},"labels":[],"label_agreement":null},{"id":"W3134011972","doi":"10.7151/dmgaa.1359","title":"Applying the Cz\\'edli-Schmidt sequences to congruence properties of planar semimodular lattices","year":2021,"lang":"en","type":"article","venue":"Discussiones Mathematicae - General Algebra and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence (geometry); Lattice (music); Mathematics; Combinatorics; Planar; Geometry; Physics; Computer science","score_opus":0.022256264515749295,"score_gpt":0.2554253767982049,"score_spread":0.23316911228245557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134011972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23128496,0.0023641374,0.7516611,0.011048871,0.00008658875,0.0020288685,0.000019419553,0.00019335245,0.0013126873],"genre_scores_gemma":[0.90468043,0.00012694464,0.09024246,0.0010078695,0.00010949316,0.0029031178,0.000006957864,0.000015486008,0.00090725446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855363,0.0000660895,0.0003761359,0.0004559385,0.0002915149,0.00025671368],"domain_scores_gemma":[0.99879104,0.00009795197,0.00014556256,0.0007116678,0.000120710734,0.00013309697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017971796,0.00019062217,0.00026914876,0.000049578688,0.00046013776,0.00014820458,0.00071065733,0.000048483704,0.000022223314],"category_scores_gemma":[0.000049615952,0.00009837662,0.00006816468,0.0005616404,0.00017263119,0.00029637484,0.00029172676,0.00010406136,0.000034954075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018144516,0.00007967343,0.00007800821,0.000119476004,0.000022324495,0.0000025498327,0.0009650841,0.00011574559,0.09135228,0.8901917,0.00006904432,0.017002307],"study_design_scores_gemma":[0.00030606086,0.00007116457,0.0011049365,0.00038839725,0.00007756161,0.00011833143,0.002955612,0.009689142,0.16793403,0.80055225,0.016063929,0.0007385976],"about_ca_topic_score_codex":0.000006161482,"about_ca_topic_score_gemma":0.000007236893,"teacher_disagreement_score":0.67339545,"about_ca_system_score_codex":0.000010151487,"about_ca_system_score_gemma":0.00006640244,"threshold_uncertainty_score":0.40116823},"labels":[],"label_agreement":null},{"id":"W3135066184","doi":"10.1553/sunda2004ssii33","title":"Ring-Like Structures Corresponding to MV-Algebras via Symmetric Difference","year":2005,"lang":"de","type":"article","venue":"Sitzungsberichte und Anzeiger","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Ring (chemistry); Pure mathematics; Mathematics; Algebra over a field; Chemistry","score_opus":0.014280212457385894,"score_gpt":0.26183112712547935,"score_spread":0.24755091466809345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135066184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37121087,0.020475887,0.5920928,0.0023324748,0.008524467,0.0010690616,0.000042836193,0.00074783224,0.0035037487],"genre_scores_gemma":[0.9468362,0.0002619172,0.036446806,0.007249298,0.0022976669,0.00003731005,0.000020546095,0.000106425396,0.0067438623],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99328786,0.00028883593,0.0010411626,0.0020650346,0.0012078307,0.0021092766],"domain_scores_gemma":[0.9958883,0.0005612511,0.0004748298,0.0017060483,0.00027132584,0.0010982569],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046706872,0.0011186725,0.0010107057,0.0012629101,0.0008423693,0.0008843392,0.0026465252,0.00038907188,0.0004577994],"category_scores_gemma":[0.00027048204,0.0010253318,0.0003687676,0.0045827613,0.00022292697,0.0010680605,0.001497903,0.00094020745,0.0041722497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030717347,0.0007204088,0.0053088353,0.00018383714,0.00069280365,0.00054059725,0.007949037,0.0066221,0.024274696,0.19566692,0.006073696,0.75165987],"study_design_scores_gemma":[0.004230009,0.002378918,0.26178634,0.0006356256,0.000986888,0.00028552368,0.00030254482,0.10317297,0.018700836,0.08183535,0.51683366,0.008851356],"about_ca_topic_score_codex":0.00006108458,"about_ca_topic_score_gemma":0.000045550925,"teacher_disagreement_score":0.7428085,"about_ca_system_score_codex":0.00045790203,"about_ca_system_score_gemma":0.00021407266,"threshold_uncertainty_score":0.9992197},"labels":[],"label_agreement":null},{"id":"W3156847159","doi":"10.70930/tac/usi111hi","title":"A note on the categorical notions of normal subobject and of equivalence class","year":2021,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Categorical variable; Equivalence (formal languages); Mathematics; Class (philosophy); Algebra over a field; Computer science; Pure mathematics; Statistics; Artificial intelligence","score_opus":0.011969741771027196,"score_gpt":0.2544780815078427,"score_spread":0.2425083397368155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156847159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10541243,0.00082688255,0.8897596,0.0009166338,0.000023503719,0.0001676541,0.000014447447,0.00001961657,0.0028592197],"genre_scores_gemma":[0.9981422,0.00016105566,0.0014650599,0.000056419965,0.000014832671,0.000037326132,0.000002064606,0.0000027188742,0.00011833157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993639,0.00008779529,0.00019038988,0.00016263503,0.000104133236,0.000091161426],"domain_scores_gemma":[0.9985163,0.0008137331,0.00011692586,0.0004007569,0.00012387405,0.000028360895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028818424,0.00007281053,0.00014553392,0.00003602101,0.00011583459,0.000011682772,0.00026427113,0.00003199232,0.000009637469],"category_scores_gemma":[0.000073960146,0.000050674098,0.000031434494,0.00034331126,0.00047843155,0.00011469549,0.00014515386,0.00007735765,0.0000010768339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012357731,0.000050523056,0.00006254953,0.000029940107,0.0000069653133,3.331882e-7,0.00050770515,0.000035944075,0.0052830246,0.98524326,0.0000064271567,0.008760972],"study_design_scores_gemma":[0.00010121852,0.0000727174,0.0014361127,0.0000082741735,0.000014521986,0.000012266391,0.00042960135,0.0001905235,0.110961005,0.8861718,0.0005326372,0.000069323934],"about_ca_topic_score_codex":0.000004195934,"about_ca_topic_score_gemma":0.000002765538,"teacher_disagreement_score":0.89272976,"about_ca_system_score_codex":0.0000035033613,"about_ca_system_score_gemma":0.000054134067,"threshold_uncertainty_score":0.20664297},"labels":[],"label_agreement":null},{"id":"W3157200895","doi":"10.48550/arxiv.2104.13843","title":"Notes on planar semimodular lattices. VIII. Congruence lattices of SPS lattices","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence (geometry); Lattice (music); Planar; Combinatorics; Mathematics; Physics; Computer science; Geometry","score_opus":0.063535945572946,"score_gpt":0.2088091661174837,"score_spread":0.1452732205445377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157200895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7870832,0.0004875483,0.20772524,0.0002513731,0.00080591306,0.00028964377,0.000032602104,0.000262179,0.0030623185],"genre_scores_gemma":[0.9926881,0.00042803655,0.006067842,0.00027122666,0.00008027019,0.0000011406878,0.000025577912,0.000023205612,0.00041456404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971151,0.00021245041,0.00035852336,0.0015735457,0.0002397328,0.00050064595],"domain_scores_gemma":[0.9964084,0.0006878184,0.00064951606,0.0017621989,0.00027803646,0.00021401602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027181997,0.00050056464,0.0006922195,0.00028639578,0.0001787064,0.0001714613,0.0026217678,0.00037640138,0.000066483255],"category_scores_gemma":[0.0001458139,0.0005184308,0.00029179067,0.0007377833,0.00026765774,0.0007880874,0.001378781,0.0007500312,0.000064961554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008416976,0.00051220506,0.014442044,0.0007403869,0.00044640517,0.0024738559,0.001238022,0.38084236,0.0010472591,0.5956798,0.000078703735,0.0024147665],"study_design_scores_gemma":[0.003232293,0.0010049916,0.028809793,0.0031939093,0.00086991646,0.000054072927,0.0014422699,0.6620397,0.025367528,0.26578543,0.0032605065,0.004939584],"about_ca_topic_score_codex":0.00023337555,"about_ca_topic_score_gemma":0.0001491683,"teacher_disagreement_score":0.3298944,"about_ca_system_score_codex":0.00011262548,"about_ca_system_score_gemma":0.00023638802,"threshold_uncertainty_score":0.9997267},"labels":[],"label_agreement":null},{"id":"W3163726099","doi":"10.1023/b:amhu.0000028237.87605.c6","title":"Lattice tensor products. IV","year":2004,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Lattice (music); Mathematics; Tensor product; Bounded function; Congruence lattice problem; Integer lattice; Pure mathematics; Combinatorics; Mathematical analysis; Condensed matter physics; Physics; Distributive lattice","score_opus":0.019586311894876866,"score_gpt":0.25695720762210356,"score_spread":0.2373708957272267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163726099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07467456,0.00059972785,0.80476075,0.080988556,0.0026298699,0.0015910281,0.000009880452,0.0022252335,0.032520372],"genre_scores_gemma":[0.69621086,0.000034358887,0.2987383,0.0018738564,0.00025690754,0.00005550863,0.0000037792026,0.000037423055,0.0027889952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961518,0.000076214594,0.00061304733,0.0011769687,0.0009540223,0.0010279616],"domain_scores_gemma":[0.99744964,0.00019004477,0.00030630323,0.0015333547,0.00018992713,0.0003307611],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010447699,0.00038076806,0.00043175975,0.00027213772,0.00053378305,0.00033796122,0.003021672,0.00024961628,0.000060281545],"category_scores_gemma":[0.0009814528,0.00030701162,0.00014088173,0.0019978967,0.000307088,0.0018490688,0.0008826734,0.0007948512,0.0011222024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052541723,0.00036640215,0.000049876133,0.00013248595,0.00004260477,0.000033428358,0.0019009892,0.00008458253,0.018439945,0.9707187,0.0055808327,0.0026449019],"study_design_scores_gemma":[0.0014081595,0.00020144647,0.0015788038,0.00019387249,0.00008402048,0.00035462805,0.00018955108,0.0042923987,0.036250044,0.8969514,0.05716588,0.0013298006],"about_ca_topic_score_codex":0.0000028773306,"about_ca_topic_score_gemma":9.084863e-7,"teacher_disagreement_score":0.6215363,"about_ca_system_score_codex":0.00012945295,"about_ca_system_score_gemma":0.0002077136,"threshold_uncertainty_score":0.9999382},"labels":[],"label_agreement":null},{"id":"W3166600905","doi":"10.1007/978-3-030-67318-5_4","title":"On the Formal Incompleteness of Reductive Logic","year":2021,"lang":"en","type":"book-chapter","venue":"Springer proceedings in complexity","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Programming language; Calculus (dental); Medicine","score_opus":0.07308202352268302,"score_gpt":0.26522425525823207,"score_spread":0.19214223173554906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166600905","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011827386,0.00046152723,0.032834955,0.001840169,0.0008565336,0.00094694295,0.000019909412,0.00022306915,0.9509895],"genre_scores_gemma":[0.90056235,0.00015666275,0.066357724,0.0017719772,0.00056252436,0.00010847374,0.000014359751,0.00012189634,0.030344026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756455,0.000014217394,0.00056557095,0.0008229205,0.0005623903,0.00047035882],"domain_scores_gemma":[0.99826616,0.00021239213,0.0005279614,0.000552156,0.00037000098,0.00007133506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053276494,0.00044676554,0.0006641576,0.00022668467,0.00018213919,0.00009526436,0.0018111643,0.00022551816,0.00012846911],"category_scores_gemma":[0.00014190155,0.0003351381,0.00021182961,0.00022286268,0.000466403,0.00040158807,0.0013743243,0.0009343734,0.00002731214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016956834,0.00004008735,0.000029829956,0.00008240409,0.00002535873,0.000013026905,0.0002549657,0.0000163366,0.0001046037,0.99661994,0.000107291286,0.0026891893],"study_design_scores_gemma":[0.00018917985,0.00013279797,0.0009162549,0.00039526288,0.000008711504,0.00002394438,0.000044834454,0.0005629697,0.0007134428,0.9925239,0.0040932214,0.0003955007],"about_ca_topic_score_codex":0.000010306765,"about_ca_topic_score_gemma":0.000010564756,"teacher_disagreement_score":0.9206455,"about_ca_system_score_codex":0.00016801566,"about_ca_system_score_gemma":0.00010516798,"threshold_uncertainty_score":0.99991006},"labels":[],"label_agreement":null},{"id":"W3171570572","doi":"10.12775/llp.2022.025","title":"An Epimorphism between Fine and Ferguson’s Matrices for Angell’s AC","year":2022,"lang":"en","type":"article","venue":"Logic and Logical Philosophy","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Epimorphism; Surjective function; Homomorphism; Mathematics; Image (mathematics); Algebra over a field; Pure mathematics; Matrix (chemical analysis); Discrete mathematics; Computer science; Artificial intelligence; Materials science","score_opus":0.04358547427203284,"score_gpt":0.2763734622509362,"score_spread":0.23278798797890332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171570572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3461321,0.009316832,0.58781874,0.044914115,0.00064127595,0.001734549,0.00024142748,0.0010272473,0.008173689],"genre_scores_gemma":[0.9776522,0.00005937679,0.019683337,0.0020464798,0.00034946707,0.000094955016,0.000027439397,0.000009455275,0.00007729416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984335,0.00011578485,0.00022987778,0.00068606477,0.00018581352,0.00034900673],"domain_scores_gemma":[0.9990963,0.00024541654,0.00010178524,0.00031789741,0.000027785469,0.0002108174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028483174,0.00021600032,0.00032074525,0.00008569517,0.00062346505,0.000086961845,0.00059977575,0.00007903538,0.000059114118],"category_scores_gemma":[0.000026666235,0.00016426547,0.00006652159,0.00024492267,0.00009871543,0.00032238028,0.00052751217,0.0002375684,0.000004582876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003913497,0.00014708686,0.002304532,0.000029515842,0.000016969927,0.000032780525,0.00020183495,0.00008771867,0.00018326659,0.9634386,0.0003456796,0.03317292],"study_design_scores_gemma":[0.00051674485,0.0015187054,0.007634331,0.0000028364782,0.000015058707,0.000031195952,0.00002242527,0.0013088562,0.000015634354,0.97958946,0.009057471,0.00028729485],"about_ca_topic_score_codex":0.0000055585338,"about_ca_topic_score_gemma":7.553181e-7,"teacher_disagreement_score":0.6315201,"about_ca_system_score_codex":0.000032211825,"about_ca_system_score_gemma":0.0000115050825,"threshold_uncertainty_score":0.6698552},"labels":[],"label_agreement":null},{"id":"W3173971361","doi":"10.1007/s00029-021-00656-z","title":"The fundamental theorem of finite semidistributive lattices","year":2019,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Distributive lattice; Mathematics; Partially ordered set; Representation theorem; Hyperplane; Distributivity; Lattice (music); Quotient; Distributive property; Structured program theorem; Pure mathematics; Finite set; Fundamental theorem; Discrete mathematics; Combinatorics","score_opus":0.024394134374021558,"score_gpt":0.2574933642259309,"score_spread":0.23309922985190934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173971361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9781199,0.00243328,0.011530173,0.0009023858,0.001609417,0.0004284164,0.000041964344,0.000052006195,0.0048824404],"genre_scores_gemma":[0.99676484,0.0003984966,0.00024428568,0.000310191,0.00012610386,0.000009092962,0.0000066220514,0.000016303886,0.002124043],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9974049,0.00022714685,0.0005656292,0.0006634545,0.00043225853,0.0007066392],"domain_scores_gemma":[0.99658614,0.0014193286,0.00053021265,0.0011547222,0.0001735957,0.00013597825],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005866689,0.0003334871,0.00038104068,0.00004385262,0.00045725494,0.000137406,0.0016793706,0.00012587807,0.0002616177],"category_scores_gemma":[0.00016528319,0.00022644043,0.00022541007,0.0005806135,0.000593885,0.0006530225,0.00084492966,0.00040004324,0.0012271989],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001147354,0.00022745754,0.7642284,0.000070078444,0.0001758781,0.000019189501,0.0024935212,0.00036809078,0.003419464,0.20704594,0.000116752446,0.021720517],"study_design_scores_gemma":[0.0025295133,0.0021362363,0.81603223,0.00044349107,0.00013791227,0.00003160858,0.004092305,0.027012166,0.050911933,0.0600425,0.035137143,0.0014929305],"about_ca_topic_score_codex":0.000011700504,"about_ca_topic_score_gemma":0.0000065231475,"teacher_disagreement_score":0.14700344,"about_ca_system_score_codex":0.000074907366,"about_ca_system_score_gemma":0.00013544792,"threshold_uncertainty_score":0.99955046},"labels":[],"label_agreement":null},{"id":"W3174611115","doi":"10.4171/em/456","title":"Apparent paradoxical partitions in countable sets","year":2021,"lang":"en","type":"article","venue":"Elemente der Mathematik","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Countable set; Mathematics; Pure mathematics; Combinatorics","score_opus":0.02070889296437932,"score_gpt":0.27681090127352975,"score_spread":0.2561020083091504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174611115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051410735,0.0008335534,0.92883354,0.002822168,0.00028222593,0.00025693246,0.0000102212425,0.00019518043,0.015355439],"genre_scores_gemma":[0.9340718,0.000048633832,0.06360953,0.0011228041,0.000031301373,0.00010725695,0.000021610595,0.0000096911235,0.0009773842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890244,0.000039272447,0.00025008712,0.00029316373,0.000214983,0.000300074],"domain_scores_gemma":[0.9993927,0.00006040204,0.00004871778,0.0003950744,0.00003891543,0.00006421992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014346438,0.00010433033,0.00015090813,0.00004161133,0.00007498405,0.00008050198,0.00027578717,0.000028033071,0.00045852858],"category_scores_gemma":[0.00002775054,0.00009546149,0.000043711283,0.00032176852,0.000017040722,0.00028737079,0.00016869145,0.000102033846,0.00017253864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028399488,0.00087729935,0.0017391776,0.00006445507,0.00003524133,0.00030926344,0.0014449988,0.00044694255,0.0010187457,0.9751449,0.011400351,0.0075157485],"study_design_scores_gemma":[0.0013909915,0.000076421915,0.0033535133,0.0001621702,0.00001612274,0.00017834804,0.0005259442,0.025504926,0.014448881,0.8693614,0.08435783,0.00062345533],"about_ca_topic_score_codex":0.0000021258713,"about_ca_topic_score_gemma":0.00003920619,"teacher_disagreement_score":0.88266104,"about_ca_system_score_codex":0.00004187577,"about_ca_system_score_gemma":0.000051698054,"threshold_uncertainty_score":0.50205666},"labels":[],"label_agreement":null},{"id":"W3176704872","doi":"10.1007/978-3-030-70608-1_11","title":"Applications of Fundamental Groups","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Autodesk (Canada)","funders":"","keywords":"Corollary; Formalism (music); Mathematics; Pure mathematics; Algebra over a field; Fundamental theorem; Discrete mathematics; Fixed-point theorem","score_opus":0.01563529729214981,"score_gpt":0.2351631291943556,"score_spread":0.21952783190220582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176704872","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.510526e-7,0.00035209637,0.48115626,0.000057376106,0.00004898223,0.00007826804,0.0000033673798,0.000042886437,0.5182598],"genre_scores_gemma":[0.004797608,0.00011828096,0.061508156,0.00032514398,0.000093749295,0.000020906975,0.000027527547,0.000013182507,0.93309546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928355,0.0000030141518,0.00017583776,0.00029168391,0.00015641881,0.00008947451],"domain_scores_gemma":[0.9992385,0.000032523527,0.00010332557,0.00053237315,0.000051262625,0.000042048454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000026330164,0.00012026722,0.00017681236,0.00005310064,0.00003440101,0.000021261598,0.00048202043,0.00008584767,0.00061311777],"category_scores_gemma":[0.0000011406856,0.000107885004,0.000097649136,0.000037450543,0.0000463089,0.00008610731,0.0002877753,0.00010879146,0.00012050912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.7393657e-7,0.000008784512,0.0000018556939,0.00000988464,0.000010539207,0.0000033886122,0.000012539905,0.0000010552347,0.00002697542,0.96726155,0.0002153932,0.032447867],"study_design_scores_gemma":[0.00006813717,0.00002863367,0.000012169034,0.000021507345,0.000007201333,0.000014666228,0.000008160593,0.0000754908,0.00016646284,0.5183241,0.48109034,0.00018316861],"about_ca_topic_score_codex":0.0000010886649,"about_ca_topic_score_gemma":0.0000037406912,"teacher_disagreement_score":0.48087496,"about_ca_system_score_codex":0.000021403497,"about_ca_system_score_gemma":0.000041504343,"threshold_uncertainty_score":0.6713209},"labels":[],"label_agreement":null},{"id":"W3179134436","doi":"10.1093/logcom/exab021","title":"Ideal related algebras and their logics","year":2021,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"National Natural Science Foundation of China","keywords":"Unary operation; Ideal (ethics); Modal; Algebra over a field; Mathematics; Modal operator; Discriminator; Pure mathematics; Normal modal logic; Modal logic; Discrete mathematics; Computer science; Epistemology; Philosophy","score_opus":0.018523427782201896,"score_gpt":0.2547389408735739,"score_spread":0.236215513091372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179134436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26244766,0.002533428,0.7332382,0.0011971667,0.00016743095,0.000022095532,2.507415e-7,0.00001626725,0.00037746914],"genre_scores_gemma":[0.9629787,0.00032743777,0.036163177,0.0004561138,0.000046537083,2.1590695e-7,0.000001023517,0.0000024118067,0.000024386845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931854,0.0000770114,0.00027256878,0.00013041584,0.00010304232,0.000098409255],"domain_scores_gemma":[0.99934214,0.00012980837,0.00023100109,0.000060804734,0.00016698457,0.00006925696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020974282,0.000081311766,0.00016927946,0.000052384195,0.00008518565,0.00008286073,0.000102160804,0.000049580114,0.0000031831432],"category_scores_gemma":[0.000045656547,0.00005546093,0.000038325743,0.00017631141,0.0000386701,0.00032288488,0.00008322056,0.0001468992,0.0000013758598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020374484,0.00014265609,0.0009680321,0.000021540756,0.000059103895,0.0003469113,0.001832344,0.0029467698,0.0016350062,0.43079802,0.00030662664,0.5609226],"study_design_scores_gemma":[0.0008894896,0.000427048,0.0086835865,0.000024199237,0.000008743209,0.0017911022,0.00031548887,0.039668158,0.0002785788,0.9473989,0.00040278974,0.00011193564],"about_ca_topic_score_codex":3.141717e-7,"about_ca_topic_score_gemma":2.2981978e-7,"teacher_disagreement_score":0.70053107,"about_ca_system_score_codex":0.000011226156,"about_ca_system_score_gemma":0.000044223132,"threshold_uncertainty_score":0.2261631},"labels":[],"label_agreement":null},{"id":"W3181795683","doi":"10.1007/s10474-005-0228-5","title":"Notes on sectionally complemented lattices. III","year":2005,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Manitoba","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.028046287862762663,"score_gpt":0.2885223804177061,"score_spread":0.2604760925549435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181795683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042330086,0.00014927598,0.8583462,0.052906066,0.0012864441,0.0009141529,0.00001597471,0.0013125364,0.042739242],"genre_scores_gemma":[0.9092236,0.000015293968,0.085144274,0.0034769098,0.0003069912,0.000041128627,0.000008435023,0.00002328084,0.0017600958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965442,0.00009335616,0.00063132937,0.00088580523,0.0010399717,0.0008053489],"domain_scores_gemma":[0.99765104,0.0006798608,0.00032517966,0.00094157323,0.000116484785,0.00028584432],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00092071755,0.0003548044,0.00038248167,0.00031653838,0.0006159418,0.00028789096,0.0021543428,0.00018678856,0.00043241383],"category_scores_gemma":[0.00033090299,0.00028503715,0.00016612718,0.0010842462,0.00018226616,0.001265286,0.0006183123,0.00070076255,0.00096353685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000145814365,0.00057071686,0.00011188826,0.000047762675,0.00008011799,0.000007903546,0.0014295771,0.00038382405,0.008830878,0.9519848,0.02082344,0.015714504],"study_design_scores_gemma":[0.0034039877,0.0004629618,0.004423717,0.00031067044,0.00012181257,0.00019656542,0.00021402012,0.33535805,0.033997275,0.2711488,0.34803566,0.002326486],"about_ca_topic_score_codex":0.0000025268723,"about_ca_topic_score_gemma":0.000007913109,"teacher_disagreement_score":0.86689353,"about_ca_system_score_codex":0.00012639191,"about_ca_system_score_gemma":0.00007845559,"threshold_uncertainty_score":0.9999602},"labels":[],"label_agreement":null},{"id":"W3185243388","doi":"10.7151/dmgaa.1375","title":"Revisiting the representation theorem of finite distributive lattices with principal congruences. A \\emph{Proof-by-Picture} approach","year":2021,"lang":"en","type":"article","venue":"Discussiones Mathematicae - General Algebra and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Congruence relation; Distributive property; Principal (computer security); Distributive lattice; Representation (politics); Representation theorem; Algebra over a field; Pure mathematics; Discrete mathematics; Computer science; Law","score_opus":0.01461090566835005,"score_gpt":0.26098027119780426,"score_spread":0.2463693655294542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185243388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03418318,0.0005054328,0.96069354,0.0022383023,0.000014259309,0.00052494707,0.000044671826,0.00005846798,0.0017372142],"genre_scores_gemma":[0.94135016,0.00005700304,0.057274524,0.00017416447,0.000107978165,0.00046893783,0.000109840024,0.0000129252485,0.00044445723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985432,0.00010905876,0.0003578976,0.00048385773,0.00028449643,0.00022146374],"domain_scores_gemma":[0.9985174,0.0003069263,0.00028669563,0.0006474984,0.00015347586,0.00008800947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019422005,0.00018823953,0.00026828118,0.000027072867,0.0004099477,0.00013926407,0.00046437286,0.00004995309,0.000018142036],"category_scores_gemma":[0.00006466182,0.000091070055,0.000060111495,0.0005699965,0.00024530638,0.0002753447,0.0002485483,0.00012964934,0.0000037498594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004570969,0.00010034203,0.00030146982,0.00009411591,0.00003775587,0.0000015989564,0.0010297687,0.00021284634,0.0015091654,0.9758494,0.000029934341,0.020829016],"study_design_scores_gemma":[0.0009073281,0.00008717179,0.00459972,0.00023224205,0.00018523223,0.00014922082,0.0047392054,0.06649453,0.034547586,0.88425654,0.0030113677,0.0007898615],"about_ca_topic_score_codex":0.0000022126758,"about_ca_topic_score_gemma":0.0000011828078,"teacher_disagreement_score":0.90716696,"about_ca_system_score_codex":0.000010694196,"about_ca_system_score_gemma":0.000050458857,"threshold_uncertainty_score":0.3713729},"labels":[],"label_agreement":null},{"id":"W3203856738","doi":"10.1007/978-3-030-71430-7_21","title":"Some Lessons Learned About Adding Conditionals to Certain Many-Valued Logics","year":2021,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"USable; T-norm fuzzy logics; Monoidal t-norm logic; Computer science; Mathematics; Epistemology; Calculus (dental); Artificial intelligence; Philosophy; World Wide Web; Medicine","score_opus":0.06715081971613869,"score_gpt":0.34644134189785775,"score_spread":0.27929052218171907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203856738","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001774668,0.0022910037,0.8932208,0.022897076,0.0012916618,0.0010951224,0.0023445636,0.0007008751,0.07614119],"genre_scores_gemma":[0.113515794,0.0014445669,0.085205205,0.02465768,0.0034583048,0.0006403194,0.002913309,0.00029903694,0.7678658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522704,0.00013881763,0.0008644507,0.0017201673,0.0008487007,0.0012008526],"domain_scores_gemma":[0.9960712,0.0006041994,0.0004180741,0.0013621686,0.00082789315,0.0007164312],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00074589934,0.00083209947,0.0011727702,0.0007213875,0.0010629975,0.0006410335,0.0015418585,0.0006316505,0.00061936706],"category_scores_gemma":[0.001118806,0.0008183398,0.0005144876,0.0004849827,0.00013069496,0.00047758335,0.0011335294,0.0008959986,0.0013201014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001411208,0.000037133395,0.000002862423,0.000018236831,0.000107991276,0.0003000879,0.00009840503,0.0013984017,0.0004075297,0.99043787,0.00552283,0.0016545621],"study_design_scores_gemma":[0.0005870546,0.00022395366,0.0000493443,0.0005220913,0.000086297805,0.00006668781,0.00004177649,0.00055634376,0.00020052906,0.7448621,0.25160024,0.001203584],"about_ca_topic_score_codex":0.0000046816954,"about_ca_topic_score_gemma":0.000012722875,"teacher_disagreement_score":0.8080155,"about_ca_system_score_codex":0.0014461305,"about_ca_system_score_gemma":0.0004496182,"threshold_uncertainty_score":0.9994575},"labels":[],"label_agreement":null},{"id":"W3217386039","doi":"10.1007/s00023-022-01262-1","title":"Noncommutative Nullstellensätze and Perfect Games","year":2023,"lang":"de","type":"article","venue":"Annales Henri Poincaré","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Javna Agencija za Raziskovalno Dejavnost RS; National Science Foundation","keywords":"Noncommutative geometry; Characterization (materials science); Mathematics; Operator (biology); Algebra over a field; Combinatorial game theory; Algebraic number; Game theory; Sequential game; Mathematical economics; Pure mathematics","score_opus":0.024906638960314195,"score_gpt":0.27753657358771855,"score_spread":0.25262993462740435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217386039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8075771,0.12239849,0.02145039,0.022451915,0.0048877336,0.0013984746,0.00015513085,0.0021043997,0.017576389],"genre_scores_gemma":[0.97854275,0.012370959,0.0023991484,0.0015206138,0.000660123,0.000028505383,0.000040491876,0.000055295044,0.0043821],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99684864,0.0003535714,0.00043718045,0.0009684399,0.00045208796,0.000940107],"domain_scores_gemma":[0.997642,0.0008913023,0.00018621475,0.0008029416,0.00015009452,0.00032747883],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00054810167,0.00048070398,0.00054193253,0.00032173409,0.0005319876,0.0003027879,0.0008084669,0.00017871971,0.00007562291],"category_scores_gemma":[0.00016146939,0.00044377267,0.00020144557,0.0012250566,0.0004466538,0.000622165,0.0010129785,0.00048442825,0.00414296],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001925597,0.00045838082,0.009537228,0.00083037285,0.000918523,0.0032996282,0.0792767,0.0010470443,0.0012886641,0.11815388,0.09817752,0.6868195],"study_design_scores_gemma":[0.0031548573,0.002743684,0.07069037,0.0008554975,0.00028526943,0.0003199616,0.0059376527,0.1384064,0.002182375,0.094199404,0.67791444,0.0033100634],"about_ca_topic_score_codex":0.00002656815,"about_ca_topic_score_gemma":0.00001361343,"teacher_disagreement_score":0.6835094,"about_ca_system_score_codex":0.000043633292,"about_ca_system_score_gemma":0.0001421262,"threshold_uncertainty_score":0.9998014},"labels":[],"label_agreement":null},{"id":"W327960459","doi":"10.71781/15308","title":"Clones sous-maximaux inf-réductibles","year":2009,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy","score_opus":0.008758833604332949,"score_gpt":0.1870924828747249,"score_spread":0.17833364927039197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W327960459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6942052,0.12377878,0.047439147,0.0031978076,0.009150873,0.0012070264,0.0000855208,0.0009718217,0.11996382],"genre_scores_gemma":[0.848292,0.0034461059,0.016224854,0.0006448781,0.0008813099,0.00003521883,0.00046609517,0.000065127046,0.12994441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99588245,0.00021273871,0.00064531533,0.0013166001,0.0010166211,0.0009262895],"domain_scores_gemma":[0.99717236,0.0001566409,0.000675633,0.0008778772,0.00056004367,0.00055744254],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00020750966,0.0008304405,0.00071557297,0.0004949986,0.010899485,0.00025346398,0.0014656727,0.0007254887,0.000050427087],"category_scores_gemma":[0.00009339593,0.0009518927,0.00052951556,0.00088611495,0.00043084513,0.0016658326,0.0003636694,0.0007980224,0.00031234047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006713211,0.0008210391,0.006112746,0.00029488193,0.0005458314,0.009406339,0.06297019,0.023171438,0.016258962,0.78096616,0.0015904261,0.09719067],"study_design_scores_gemma":[0.0050715017,0.0016829346,0.2810046,0.0017609489,0.0013977997,0.011291324,0.064522274,0.039250772,0.04874094,0.07257792,0.4662478,0.0064511774],"about_ca_topic_score_codex":0.015661476,"about_ca_topic_score_gemma":0.007219835,"teacher_disagreement_score":0.7083882,"about_ca_system_score_codex":0.004338007,"about_ca_system_score_gemma":0.0027317128,"threshold_uncertainty_score":0.9994842},"labels":[],"label_agreement":null},{"id":"W33126347","doi":"10.1097/md.0000000000022910","title":"Generalized Index of Boolean Matrices.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Computer science","score_opus":0.009065880315117573,"score_gpt":0.23158043235767972,"score_spread":0.22251455204256215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33126347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98693293,0.00045817348,0.0032583026,0.00018886164,0.0006556217,0.0001085898,9.4868307e-7,0.00016261725,0.008233935],"genre_scores_gemma":[0.9953177,0.00007603911,0.0036666798,0.0001998782,0.000006626936,0.0000054085303,0.000001139689,0.000007325864,0.00071920577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990771,0.00004263523,0.00021079241,0.00023996986,0.0002116751,0.00021782628],"domain_scores_gemma":[0.99928164,0.000039328974,0.00007406017,0.00048998644,0.000041989326,0.00007297695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010407859,0.00010860737,0.00017683621,0.000060280425,0.00005924201,0.000029256102,0.0007179205,0.00005329936,0.00018956445],"category_scores_gemma":[0.00001005375,0.00009906564,0.00006247628,0.0004261991,0.0000389529,0.00030131967,0.00008477765,0.000090655936,0.00010724714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071541663,0.0000705423,0.0011424592,0.0000063048974,0.0000090796475,0.00001086005,0.00012829245,0.00019585731,0.00018597534,0.96187377,0.00074373855,0.03562598],"study_design_scores_gemma":[0.0009573549,0.00008686058,0.004134673,0.000010301053,0.000004224592,0.000008011515,0.000005116022,0.0047510583,0.0018576896,0.9807341,0.007268927,0.00018166531],"about_ca_topic_score_codex":0.000022322243,"about_ca_topic_score_gemma":8.396531e-7,"teacher_disagreement_score":0.03544431,"about_ca_system_score_codex":0.000018801187,"about_ca_system_score_gemma":0.000030390771,"threshold_uncertainty_score":0.40397796},"labels":[],"label_agreement":null},{"id":"W38897458","doi":"10.1016/j.scitotenv.2024.174089","title":"A Characterization Of Connected Matroids.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Characterization (materials science); Combinatorics; Nanotechnology","score_opus":0.012246746438446835,"score_gpt":0.21440450569538028,"score_spread":0.20215775925693344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38897458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97970426,0.000021969407,0.018747548,0.00010796502,0.00064296846,0.00008092222,0.0000010847899,0.00012496518,0.0005683122],"genre_scores_gemma":[0.997962,0.000019977626,0.0018118697,0.000089381065,0.000003782326,0.0000055975697,0.000005976832,0.000005059359,0.00009636687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936926,0.00003052697,0.00015882883,0.00016717103,0.00013872268,0.00013550564],"domain_scores_gemma":[0.9994402,0.000033537137,0.00009908874,0.00030198548,0.00008240664,0.000042810636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004689353,0.00007511176,0.00013138866,0.00005229516,0.00007052371,0.000008922976,0.00035299486,0.000036244783,0.000011384492],"category_scores_gemma":[0.000028167973,0.000071268434,0.00003406337,0.00033572136,0.00004188931,0.00031179318,0.0000835121,0.00005595156,0.000031038322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030636413,0.000057865524,0.0014461846,0.000004701238,0.000005106399,0.000012219463,0.00028170247,0.0000023947664,0.077706926,0.91980755,0.000041427258,0.0006308693],"study_design_scores_gemma":[0.0015071813,0.00031650095,0.1325167,0.000024819974,0.0000059921385,0.00008877287,0.000012061117,0.003986023,0.1321988,0.7276939,0.0012813767,0.00036784392],"about_ca_topic_score_codex":0.0000028706188,"about_ca_topic_score_gemma":1.6870122e-7,"teacher_disagreement_score":0.19211361,"about_ca_system_score_codex":0.000013340125,"about_ca_system_score_gemma":0.00003246068,"threshold_uncertainty_score":0.29062423},"labels":[],"label_agreement":null},{"id":"W41832373","doi":"","title":"Lah Matrix and Its Algebraic Properties.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algebraic number; Matrix (chemical analysis); Pure mathematics; Algebra over a field; Mathematical analysis; Materials science; Composite material","score_opus":0.014252823818078979,"score_gpt":0.2326254931632552,"score_spread":0.2183726693451762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41832373","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99044234,0.0033998953,0.0024968577,0.0013872467,0.0010631596,0.000204567,4.981613e-7,0.0003028473,0.0007025873],"genre_scores_gemma":[0.9974442,0.000052577598,0.0019208306,0.00023560695,0.00000811996,0.000014410111,5.2960434e-7,0.0000099501995,0.0003137381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990302,0.000024128181,0.00014635439,0.00033626673,0.00018091567,0.0002821661],"domain_scores_gemma":[0.99944663,0.000020540048,0.00004884625,0.00031706042,0.00005205033,0.00011485523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010146888,0.00013930368,0.00014552359,0.00005399422,0.00014372409,0.00009227132,0.0004776285,0.00005768245,0.000005436834],"category_scores_gemma":[0.00004092939,0.00011557501,0.000031652242,0.00027187399,0.000037141323,0.00056043314,0.0002550714,0.00012887026,0.00014029656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022201045,0.000043057036,0.00006747363,0.0000109126495,0.0000056365648,0.00002124768,0.00025965297,0.000048440153,0.0016644945,0.99661094,0.000045779474,0.0012201711],"study_design_scores_gemma":[0.0009268636,0.00012573668,0.0006646096,0.000025357238,0.0000036975105,0.000038181402,0.000013784011,0.000632145,0.008010733,0.9883373,0.0010051373,0.00021647717],"about_ca_topic_score_codex":0.0000063264506,"about_ca_topic_score_gemma":0.0000011842752,"teacher_disagreement_score":0.008273637,"about_ca_system_score_codex":0.00004222987,"about_ca_system_score_gemma":0.00005705907,"threshold_uncertainty_score":0.4713012},"labels":[],"label_agreement":null},{"id":"W4205574221","doi":"10.1016/j.tcs.2016.12.016","title":"The search for a reduction in combinatory logic equivalent to λβ-reduction, Part II","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Reduction (mathematics); Mathematics; Combinatory logic; Abstraction; Arithmetic; Algorithm; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Programming language; Epistemology","score_opus":0.024488078321077935,"score_gpt":0.29311052181205216,"score_spread":0.26862244349097425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205574221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07475657,0.000030441566,0.9065571,0.015916003,0.0018025337,0.00046945055,9.555229e-7,0.00011956485,0.00034742345],"genre_scores_gemma":[0.96494955,0.000013067664,0.034369603,0.00030293813,0.00019016418,0.000069067144,1.4238056e-7,0.000006596613,0.00009889704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973735,0.00013844245,0.00030521033,0.00080539525,0.00055934774,0.00081810163],"domain_scores_gemma":[0.99828035,0.00035005843,0.000048372487,0.0008138378,0.00025053666,0.00025686662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025249515,0.00016060332,0.00016027536,0.00017149305,0.0010275557,0.00019612104,0.0022064303,0.00004276763,0.000010338455],"category_scores_gemma":[0.00013151948,0.00008709066,0.00006116553,0.0011197829,0.002244831,0.0005832845,0.0012002587,0.00012804511,0.000050020994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019391606,0.000056474233,0.0000070427263,0.0000024340086,0.0000012835492,0.0000013324027,0.00029714467,0.00015345254,0.0022725265,0.9117432,0.00014348776,0.085302226],"study_design_scores_gemma":[0.00044519012,0.0008545778,0.00044417256,0.000057971723,0.0000017907882,0.000054436794,0.000027182987,0.016076105,0.015228449,0.9650123,0.0015455098,0.00025227864],"about_ca_topic_score_codex":8.7286776e-7,"about_ca_topic_score_gemma":5.095472e-7,"teacher_disagreement_score":0.8901929,"about_ca_system_score_codex":0.00017697972,"about_ca_system_score_gemma":0.00014442587,"threshold_uncertainty_score":0.8271174},"labels":[],"label_agreement":null},{"id":"W4206036020","doi":"10.1016/j.tcs.2018.09.026","title":"Bounded disagreement","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Mathematics; Impossibility; Task (project management); Set (abstract data type); Generalization; Object (grammar); Limit (mathematics); Discrete mathematics; Value (mathematics); Uniform consensus; Combinatorics; Consensus; Computer science; Artificial intelligence; Statistics; Multi-agent system","score_opus":0.009824130688016975,"score_gpt":0.2601939464758559,"score_spread":0.25036981578783896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206036020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027353132,0.000009226168,0.95577717,0.0011237151,0.00094596035,0.0001025678,2.97462e-7,0.00026821502,0.014419718],"genre_scores_gemma":[0.74796057,0.0000010154039,0.25051302,0.0012469188,0.0002541803,0.0000031403167,1.4327252e-7,0.0000034512123,0.000017589107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775636,0.000050925562,0.00019620864,0.00071391335,0.00064966275,0.0006329338],"domain_scores_gemma":[0.9984562,0.00009494976,0.000045504446,0.00094297796,0.00018519987,0.00027517675],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007678012,0.00015193311,0.00013946976,0.00011117757,0.0006380793,0.00042552687,0.0028675855,0.000030252937,0.00011566739],"category_scores_gemma":[0.000052852713,0.00011341788,0.000045719295,0.001120698,0.0054129236,0.00077712064,0.0013970773,0.000113083224,0.0005497232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023238356,0.0000319995,0.000022609338,0.0000010930518,0.000001362686,0.00000543351,0.00030273956,0.0000042652323,0.0003915279,0.9506551,0.000048606325,0.04853292],"study_design_scores_gemma":[0.00015077434,0.0003849646,0.0008648217,0.000009125041,0.0000015539831,0.00002636644,0.0000038643084,0.20114352,0.007300956,0.7890605,0.00085382344,0.00019974048],"about_ca_topic_score_codex":8.936796e-7,"about_ca_topic_score_gemma":5.7798087e-7,"teacher_disagreement_score":0.7206074,"about_ca_system_score_codex":0.000056559704,"about_ca_system_score_gemma":0.00008925388,"threshold_uncertainty_score":0.9972938},"labels":[],"label_agreement":null},{"id":"W4210583565","doi":"10.1007/978-3-0348-0018-1_7","title":"Free Products","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Distributive property; Lattice (music); Free product; Class (philosophy); Pure mathematics; Mathematics; Theoretical physics; Computer science; Physics; Quantum mechanics; Group (periodic table); Artificial intelligence","score_opus":0.03511721845176269,"score_gpt":0.20960146855344944,"score_spread":0.17448425010168675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210583565","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9189278e-7,0.0003419769,0.16385609,0.0003505084,0.00042010038,0.000103862796,0.0000018333146,0.0002761278,0.8346493],"genre_scores_gemma":[0.00015186466,0.00005720246,0.05167235,0.0005035911,0.00018803218,0.0000029397258,0.0000021308695,0.000016701573,0.94740516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990159,0.0000032543394,0.00014142755,0.00050222164,0.0001643511,0.00017280644],"domain_scores_gemma":[0.99829584,0.000014341712,0.00008344568,0.0014729176,0.000074333526,0.000059121132],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004859602,0.00020327847,0.00017920621,0.00006679953,0.000041140953,0.000031187596,0.0015054287,0.00013148139,0.00055596046],"category_scores_gemma":[0.000016495567,0.000156676,0.000056568664,0.000023118513,0.00004222416,0.00019980552,0.00060836686,0.00018814624,0.0009866448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.38473e-7,0.0000035942442,2.0218815e-7,0.000006544695,0.0000068005643,0.000020068781,0.000026940797,1.4087085e-7,0.0000041546723,0.96372277,0.012171711,0.024036633],"study_design_scores_gemma":[0.00003431777,0.00002683693,0.0000034329785,0.000009220838,0.0000023974467,0.000009222066,1.119403e-7,0.0000056762433,0.000121079036,0.6079747,0.39165804,0.0001549498],"about_ca_topic_score_codex":0.000002350347,"about_ca_topic_score_gemma":0.0000037353207,"teacher_disagreement_score":0.37948635,"about_ca_system_score_codex":0.00001476597,"about_ca_system_score_gemma":0.000051514104,"threshold_uncertainty_score":0.9997912},"labels":[],"label_agreement":null},{"id":"W42117920","doi":"10.1023/a:1012095313842","title":"Boundedness and Complete Distributivity","year":2001,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Distributivity; Mathematics; Bounded function; Infimum and supremum; Corollary; Constructive; Simple (philosophy); Idempotence; Pure mathematics; Discrete mathematics; Combinatorics; Distributive property; Process (computing); Computer science; Philosophy; Epistemology","score_opus":0.016454157454467464,"score_gpt":0.22975770313879032,"score_spread":0.21330354568432286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42117920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071036056,0.00011050918,0.92418146,0.0003825699,0.00014582642,0.00011322006,0.0000016240057,0.00018212423,0.003846581],"genre_scores_gemma":[0.996987,0.000019653824,0.0024826515,0.00037661017,0.00008180821,0.000012158444,0.0000071883205,0.0000057493667,0.000027209258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989105,0.000020854564,0.00013437228,0.0004147356,0.00018797797,0.0003315474],"domain_scores_gemma":[0.9993866,0.000082956285,0.000048951908,0.0003159931,0.000019397086,0.00014609477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059437687,0.00016153326,0.00018796904,0.000027520196,0.00023526126,0.00013049848,0.00044122772,0.000068124944,0.000022224536],"category_scores_gemma":[0.000012281666,0.00012359791,0.00002903482,0.0002914861,0.00011917654,0.00013715903,0.00026014543,0.00016422167,0.000015091162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061669853,0.000009898231,0.000314627,0.0000030156832,0.0000050614854,0.000016754533,0.00003978237,0.000017831908,0.0009054271,0.95737505,0.0000953558,0.041211],"study_design_scores_gemma":[0.0002272061,0.000021934966,0.038019184,1.5336556e-7,0.0000035562725,0.00007452578,0.000013443287,0.00046500293,0.00022127734,0.9464405,0.014325106,0.00018808045],"about_ca_topic_score_codex":0.000013470952,"about_ca_topic_score_gemma":0.0000049690384,"teacher_disagreement_score":0.9259509,"about_ca_system_score_codex":0.000035372297,"about_ca_system_score_gemma":0.000014693599,"threshold_uncertainty_score":0.50401765},"labels":[],"label_agreement":null},{"id":"W4214602829","doi":"10.1002/0471469882.ch2","title":"Boolean Algebras","year":2003,"lang":"en","type":"other","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Free Boolean algebra; Stone's representation theorem for Boolean algebras; Boolean algebras canonically defined; Complete Boolean algebra; Boolean algebra; Two-element Boolean algebra; Mathematics; Interior algebra; Algebra over a field; Set (abstract data type); Boolean expression; Representation (politics); Discrete mathematics; Algebra representation; Pure mathematics; Jordan algebra; Computer science; Boolean function; Programming language","score_opus":0.010016298960975119,"score_gpt":0.22737887179547914,"score_spread":0.21736257283450403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214602829","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.677824e-8,0.0004126968,0.43378213,0.00006680856,0.0003019419,0.000051593346,4.5538758e-7,0.00045540274,0.5649289],"genre_scores_gemma":[0.00001381271,0.000050492363,0.1199184,0.0014403459,0.000094713934,0.0000047343515,0.0000016351097,0.00010598176,0.87836987],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991606,0.000022065868,0.0000886586,0.0003701474,0.0001389324,0.0002196204],"domain_scores_gemma":[0.9991995,0.000011410811,0.00006536977,0.0006452675,0.00000714877,0.000071282426],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000035271536,0.00017703653,0.00016615159,0.000111577865,0.000022768643,0.000045164354,0.0007022303,0.0001377265,0.004421243],"category_scores_gemma":[0.000007372209,0.00013846121,0.00005635194,0.00015743573,0.000024135406,0.00006304172,0.00010310671,0.000110779176,0.0022678191],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.1319748e-8,0.000006358649,0.0000021977582,0.000003160026,0.000005014123,0.000008042973,0.0000034370312,2.4342603e-7,0.0000015540099,0.41713533,0.5766401,0.0061944798],"study_design_scores_gemma":[0.0000673911,0.000014061888,0.0000033445347,0.000012637073,0.0000018392661,0.0000109704215,0.0000015671911,0.00003613449,0.00003057893,0.025223594,0.9743909,0.00020693899],"about_ca_topic_score_codex":0.000010285302,"about_ca_topic_score_gemma":0.000018083329,"teacher_disagreement_score":0.39775082,"about_ca_system_score_codex":0.000011103702,"about_ca_system_score_gemma":0.000028536739,"threshold_uncertainty_score":0.99850905},"labels":[],"label_agreement":null},{"id":"W4214873605","doi":"10.1007/978-3-0348-0018-1_2","title":"Distributive Lattices","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Distributivity; Distributive property; Pure mathematics; Mathematics","score_opus":0.03344034537253575,"score_gpt":0.230017145847746,"score_spread":0.19657680047521026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214873605","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.8075303e-7,0.00019858302,0.3465241,0.000058255402,0.00016229508,0.000050833303,0.000006592767,0.00015052146,0.65284854],"genre_scores_gemma":[0.0019877648,0.00009350028,0.013276533,0.00033824312,0.00009067964,0.0000030083593,0.000014689014,0.000012825033,0.9841828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918985,0.00000401035,0.00013504279,0.00036842024,0.00013409986,0.00016857851],"domain_scores_gemma":[0.9992396,0.00004230909,0.00010487871,0.0004865021,0.000055106768,0.00007157568],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000038552513,0.00019526204,0.00018634641,0.000040740193,0.000053036056,0.00003978022,0.0007676813,0.0001413651,0.0009805021],"category_scores_gemma":[0.000004580976,0.00014805503,0.00007322372,0.000015891215,0.000056135435,0.000217545,0.00031982124,0.00018009279,0.0016231409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.119995e-7,0.0000033201932,0.0000011495262,0.0000030139984,0.000011984449,0.000020580457,0.000027292865,1.4479045e-7,5.586612e-7,0.9713865,0.0011015398,0.027443333],"study_design_scores_gemma":[0.00003137626,0.000032525793,0.000016347458,0.000011110587,0.000005164959,0.0000050388476,5.408245e-7,0.000026666525,0.00003261701,0.6586182,0.34104568,0.00017472696],"about_ca_topic_score_codex":0.000002976601,"about_ca_topic_score_gemma":0.000004709438,"teacher_disagreement_score":0.33994412,"about_ca_system_score_codex":0.000021092854,"about_ca_system_score_gemma":0.000029190986,"threshold_uncertainty_score":0.99993277},"labels":[],"label_agreement":null},{"id":"W4226379702","doi":"10.52547/cgasa.2021.101508","title":"A new property of congruence lattices of slim, planar, semimodular lattices","year":2022,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence (geometry); Property (philosophy); Planar; Mathematics; Combinatorics; Computer science; Geometry; Philosophy; Epistemology","score_opus":0.18232189295104115,"score_gpt":0.48605141821571174,"score_spread":0.30372952526467056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226379702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9025677,0.037569568,0.047674827,0.0010281275,0.001564657,0.0012538858,0.00009978342,0.00013292476,0.0081085535],"genre_scores_gemma":[0.9879039,0.0015514336,0.009343426,0.0003128608,0.00006661368,0.0000293862,0.0000042792617,0.000026103196,0.00076199265],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9965063,0.0003686351,0.0010121362,0.0005733893,0.001130776,0.00040878454],"domain_scores_gemma":[0.9965286,0.00041351814,0.0016562428,0.0008668325,0.0002889596,0.00024584937],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012166025,0.00029131802,0.0008741507,0.00055582135,0.00029428498,0.00039490403,0.0076872054,0.000060362545,0.003156954],"category_scores_gemma":[0.00020406536,0.00021967842,0.00019022764,0.0016081277,0.00015614278,0.0034942294,0.002494097,0.000426774,0.0000045959823],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055307715,0.0012889804,0.4034835,0.0007137785,0.0007330359,0.00030228077,0.003303484,0.012323427,0.39061844,0.017767115,0.03517338,0.13373949],"study_design_scores_gemma":[0.003539289,0.00046163076,0.4895241,0.001390479,0.00031918767,0.0002292329,0.0009685645,0.009301606,0.2385585,0.17802717,0.07519812,0.0024821286],"about_ca_topic_score_codex":0.0012318506,"about_ca_topic_score_gemma":0.00003941994,"teacher_disagreement_score":0.16026007,"about_ca_system_score_codex":0.000062479536,"about_ca_system_score_gemma":0.0003761944,"threshold_uncertainty_score":0.9977543},"labels":[],"label_agreement":null},{"id":"W4226412996","doi":"10.48550/arxiv.2201.09819","title":"Stone Duality for Topological Convexity Spaces","year":2022,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convexity; Mathematics; Topological space; Topological vector space; Topological tensor product; Locally convex topological vector space; Closure (psychology); Duality (order theory); Adjunction; Space (punctuation); Pure mathematics; Closed set; Topology (electrical circuits); Combinatorics; Computer science; Functional analysis","score_opus":0.11451049661575015,"score_gpt":0.34399694657969404,"score_spread":0.2294864499639439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226412996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67739314,0.0003981686,0.31473365,0.0036178401,0.001923353,0.000533751,0.0000384328,0.0003799584,0.0009816947],"genre_scores_gemma":[0.9757374,0.00005612235,0.021040112,0.0013629044,0.00027178216,0.00030368194,0.000045247914,0.000014935835,0.0011678457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976133,0.0001914253,0.00034824677,0.0010901884,0.00029446874,0.00046235122],"domain_scores_gemma":[0.997963,0.00033155773,0.00027585152,0.001210602,0.000086323176,0.00013265546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057221233,0.00031221763,0.0004824244,0.00006108104,0.00033555628,0.000095853065,0.0017791376,0.00023279482,0.0003051807],"category_scores_gemma":[0.00023127336,0.00027365322,0.00025555835,0.00016615128,0.00018133922,0.00017412941,0.0038330357,0.00079284626,0.000048035006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009086243,0.0006486635,0.34757763,0.00036832588,0.00017850833,0.00015381225,0.0016267846,0.0019361696,0.00035845657,0.6376763,0.0027011752,0.0066833193],"study_design_scores_gemma":[0.0009080417,0.000501821,0.3568948,0.000034550885,0.000048016143,0.000020959675,0.00030268138,0.0038122463,0.0015486315,0.57188964,0.06267134,0.0013672948],"about_ca_topic_score_codex":0.000039144335,"about_ca_topic_score_gemma":0.000009781846,"teacher_disagreement_score":0.2983442,"about_ca_system_score_codex":0.00011163688,"about_ca_system_score_gemma":0.00013650327,"threshold_uncertainty_score":0.99997157},"labels":[],"label_agreement":null},{"id":"W4231346191","doi":"10.24124/2018/58864","title":"On irresponsible homomorphisms and strong duality","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Homomorphism; Transitive relation; Duality (order theory); Pure mathematics; Mathematics; Algebra over a field; Political science; Combinatorics","score_opus":0.01660745335576471,"score_gpt":0.2833668084871383,"score_spread":0.2667593551313736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231346191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.446992,0.00043291593,0.24705984,0.0003152029,0.003160741,0.00053484394,0.000012173547,0.0006651118,0.30082718],"genre_scores_gemma":[0.82130486,0.00005860296,0.06419815,0.00095404417,0.00024973505,0.000041844254,0.00019072455,0.00003869775,0.11296334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890083,0.00004317259,0.00015584967,0.00048543984,0.00021310618,0.00020162752],"domain_scores_gemma":[0.99919856,0.000106233805,0.00009492987,0.00045908382,0.000062797975,0.00007841449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014033179,0.00018859543,0.00018918065,0.00010208555,0.00012964765,0.00010979036,0.0003845738,0.00013797868,0.00012225156],"category_scores_gemma":[0.000046161877,0.00015236305,0.00004022276,0.00014349846,0.000031687745,0.00020431248,0.000058826958,0.00016222465,0.00014774603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031408883,0.00002953658,0.000008325733,0.000019920553,0.00000937858,0.000010572385,0.00023728613,0.00000190214,0.00007401224,0.97766703,0.0016093487,0.020301303],"study_design_scores_gemma":[0.0006693486,0.0008938398,0.015030976,0.00015317,0.000023709263,0.000018198552,0.00038546993,0.0024566476,0.008399306,0.96271104,0.0081912745,0.0010670348],"about_ca_topic_score_codex":0.000007945466,"about_ca_topic_score_gemma":0.000058319125,"teacher_disagreement_score":0.37431285,"about_ca_system_score_codex":0.00001941667,"about_ca_system_score_gemma":0.00006297634,"threshold_uncertainty_score":0.62131846},"labels":[],"label_agreement":null},{"id":"W4231349861","doi":"10.1145/1734263.1734425","title":"Nifty assignments","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.005383946573657553,"score_gpt":0.22276472348691237,"score_spread":0.2173807769132548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231349861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030648189,0.00000287606,0.88584816,0.00043292364,0.00048428192,0.000028426177,7.580298e-8,0.00015981337,0.08239527],"genre_scores_gemma":[0.8597429,4.3192446e-7,0.13749775,0.00057649135,0.00003189964,0.000002097079,1.3530135e-7,0.0000013374943,0.0021469898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999633,0.000004502225,0.00004590073,0.00012766944,0.00008131653,0.000107569096],"domain_scores_gemma":[0.9996557,0.000015668658,0.000012575005,0.00026015603,0.000009959975,0.00004593181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045646226,0.000037799473,0.000033243265,0.000014219091,0.00004074979,0.000035453,0.0003705659,0.000020669719,0.00016731328],"category_scores_gemma":[0.000010463809,0.00002714632,0.0000148967565,0.000072024704,0.000012971531,0.00023594104,0.00009435034,0.000080645936,0.00031572778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.0013961e-7,0.000018949328,0.00085961935,4.104788e-7,0.0000012322657,0.000004178782,0.000025508476,0.0000025752536,0.012183399,0.9312785,0.0007894023,0.054835975],"study_design_scores_gemma":[0.00055457343,0.00010258769,0.04715927,0.0000024376882,0.0000020954026,0.000042413183,0.000016094493,0.017346138,0.0548638,0.73324245,0.14619794,0.00047022925],"about_ca_topic_score_codex":0.0000016124407,"about_ca_topic_score_gemma":0.000004251403,"teacher_disagreement_score":0.8290947,"about_ca_system_score_codex":0.0000023499624,"about_ca_system_score_gemma":0.000008588761,"threshold_uncertainty_score":0.40581474},"labels":[],"label_agreement":null},{"id":"W4232405000","doi":"10.24124/2018/58850","title":"When is an alter ego a minimal dulaizing structure?","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Northern British Columbia","keywords":"Unary operation; Id, ego and super-ego; Homomorphism; Join (topology); Algebra over a field; Element (criminal law); Mathematics; Psychology; Pure mathematics; Discrete mathematics; Combinatorics; Social psychology; Political science","score_opus":0.016605565154060076,"score_gpt":0.2767439453947946,"score_spread":0.2601383802407345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232405000","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6810921,0.00030623967,0.2751154,0.00035374842,0.004225024,0.0005389222,0.00002116692,0.00071894046,0.03762844],"genre_scores_gemma":[0.3658481,0.000008592236,0.6043889,0.0026895003,0.00095552154,0.000019155996,0.00035711107,0.000053994547,0.025679126],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837667,0.000028843002,0.00024586273,0.0007209746,0.0002972374,0.00033039806],"domain_scores_gemma":[0.99887,0.000018848748,0.00015222972,0.0007112541,0.000127656,0.00012000324],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000051375584,0.00029054057,0.0002487335,0.00012744512,0.00014233538,0.00021997865,0.0011131985,0.00023090551,0.0010291622],"category_scores_gemma":[0.0000117603695,0.00023403214,0.000084787986,0.00013638576,0.000022583514,0.00070144125,0.00008186416,0.00020153564,0.0001376633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012936641,0.00019916089,0.00027010302,0.000340331,0.00020689126,0.00012851294,0.076340035,0.000006127855,0.017233018,0.22659463,0.041648462,0.63690335],"study_design_scores_gemma":[0.0006775711,0.00074153306,0.0036384047,0.00013506139,0.000054454435,0.000049221668,0.0011382614,0.0110313995,0.07196879,0.8647932,0.04377696,0.001995139],"about_ca_topic_score_codex":0.000021769876,"about_ca_topic_score_gemma":0.00028683597,"teacher_disagreement_score":0.63819855,"about_ca_system_score_codex":0.000025264184,"about_ca_system_score_gemma":0.000077731966,"threshold_uncertainty_score":0.999884},"labels":[],"label_agreement":null},{"id":"W4232568134","doi":"10.24124/2007/bpgub449","title":"Semidistributive lattices, meet-semilattices, and congruence heredity.","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; University of Northern British Columbia","funders":"","keywords":"Congruence (geometry); Heredity; Mathematics; Humanities; Philosophy; Geometry; Genetics; Biology","score_opus":0.01166070046881771,"score_gpt":0.29346917128652206,"score_spread":0.2818084708177043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232568134","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105861805,0.016603211,0.41452783,0.00056520454,0.0068002013,0.0014657958,0.000105581785,0.001701042,0.4523693],"genre_scores_gemma":[0.80004036,0.0017038982,0.11713585,0.0018159946,0.00084485766,0.00008435807,0.001411871,0.00010510448,0.0768577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979035,0.0000396476,0.00036413287,0.00081377086,0.00040613857,0.00047279306],"domain_scores_gemma":[0.99847823,0.00029273293,0.00029257694,0.00050782954,0.00021937222,0.00020925509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028962153,0.0003747953,0.00038109793,0.00012638766,0.00019243722,0.00020606263,0.0008458639,0.00037183717,0.00006279066],"category_scores_gemma":[0.00010222276,0.00032985874,0.000067801775,0.00038895124,0.0000718551,0.0006444242,0.00013311292,0.00037505216,0.000046013698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057808076,0.00012892044,0.00080095633,0.0004312958,0.0001376473,0.0003242652,0.0016773251,0.000010595012,0.00084671384,0.8823591,0.0073254444,0.105899915],"study_design_scores_gemma":[0.0041127135,0.0013410447,0.083161026,0.001967085,0.0005513213,0.00048742854,0.007551978,0.016087877,0.056403775,0.5893905,0.229013,0.009932228],"about_ca_topic_score_codex":0.00006925599,"about_ca_topic_score_gemma":0.0006317114,"teacher_disagreement_score":0.6941786,"about_ca_system_score_codex":0.000063740415,"about_ca_system_score_gemma":0.00013809776,"threshold_uncertainty_score":0.99991536},"labels":[],"label_agreement":null},{"id":"W4232850695","doi":"10.3765/salt.v15i0.3094","title":"Modal Superlatives","year":2005,"lang":"en","type":"article","venue":"Proceedings from Semantics and Linguistic Theory","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Modal; Computer science; Normal modal logic; Physics; Modal logic; Chemistry","score_opus":0.00714548680705815,"score_gpt":0.21786494290663377,"score_spread":0.21071945609957562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232850695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5192251,0.0018603796,0.4507883,0.0010611044,0.0004670676,0.00017568836,0.0000071733907,0.0004081712,0.026007041],"genre_scores_gemma":[0.9367358,0.000066006454,0.062011637,0.00031173628,0.00061648735,0.000004132531,0.0000013195719,0.000010622617,0.00024227706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990566,0.00000855333,0.00017424204,0.0003752341,0.000139877,0.0002455226],"domain_scores_gemma":[0.99942225,0.00017318616,0.000066638524,0.00012160366,0.00011021137,0.000106130676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021810482,0.00015524882,0.00017023955,0.000058166934,0.0001609542,0.00016523409,0.00035812816,0.00005427167,0.000019489884],"category_scores_gemma":[0.00041324753,0.00013129339,0.000033915432,0.00011281935,0.00009482171,0.00020911533,0.00019712409,0.00014270135,0.000023220573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067055757,0.00002694956,0.00070624665,0.000009675129,0.000012616861,0.0000028940337,0.0036461705,0.00000416848,0.00083162705,0.9821544,0.000021678205,0.012576866],"study_design_scores_gemma":[0.00024106345,0.000047711288,0.0017367647,0.000033267475,0.000016519552,0.0000090978765,0.0001934095,0.031771265,0.001594142,0.9564715,0.007640926,0.00024430954],"about_ca_topic_score_codex":0.0000036472052,"about_ca_topic_score_gemma":7.181096e-7,"teacher_disagreement_score":0.4175107,"about_ca_system_score_codex":0.0000124702765,"about_ca_system_score_gemma":0.00001464358,"threshold_uncertainty_score":0.5353989},"labels":[],"label_agreement":null},{"id":"W4233394097","doi":"10.1093/jigpal/jzu019","title":"Connexive Gentzen","year":2014,"lang":"fr","type":"article","venue":"Logic Journal of IGPL","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Propositional calculus; Calculus (dental); Mathematics; Computer science; Natural deduction; Philosophy; Discrete mathematics; Algorithm; Medicine","score_opus":0.0362188228251722,"score_gpt":0.2687738065826786,"score_spread":0.23255498375750638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233394097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019306261,0.012999345,0.8258367,0.011680432,0.0052499133,0.00006168275,0.0000014376332,0.000018818148,0.14222105],"genre_scores_gemma":[0.9111506,0.0008893395,0.075826354,0.004365242,0.0023996125,7.474796e-7,4.379007e-7,0.000014606762,0.0053531085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980156,0.00030373878,0.0006275092,0.00021987961,0.0003757648,0.00045752304],"domain_scores_gemma":[0.9979725,0.00031163645,0.0007315047,0.00032082692,0.0003879971,0.00027552727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009308305,0.00020148719,0.00041650512,0.000102959304,0.00013042921,0.00012987047,0.0010136514,0.0001348769,0.0003414847],"category_scores_gemma":[0.00038701162,0.00015729827,0.00025218888,0.00025613196,0.00019327927,0.00072566903,0.00018244382,0.00049648073,0.000343205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013033015,0.00008889462,0.000054633703,0.000018561017,0.00003566729,0.00020871747,0.0004536715,0.0010280508,0.0001594431,0.89323574,0.0031130807,0.101590484],"study_design_scores_gemma":[0.00075555005,0.0011659582,0.0015043202,0.00013754192,0.000041565145,0.00170977,0.00009681983,0.0052019553,0.00033343682,0.7763198,0.21249937,0.00023390102],"about_ca_topic_score_codex":0.0000060992793,"about_ca_topic_score_gemma":0.0000026707137,"teacher_disagreement_score":0.9092199,"about_ca_system_score_codex":0.00006688896,"about_ca_system_score_gemma":0.00011349535,"threshold_uncertainty_score":0.6414437},"labels":[],"label_agreement":null},{"id":"W4234380784","doi":"10.1017/cbo9781107517288.005","title":"Lax algebras","year":2014,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Content (measure theory); World Wide Web; Information retrieval; Mathematics","score_opus":0.01794252407568052,"score_gpt":0.1899598099166523,"score_spread":0.17201728584097176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234380784","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009133684,0.00009413121,0.21806955,0.000027888314,0.00032249014,0.00017857495,0.000020380006,0.0003595593,0.7809183],"genre_scores_gemma":[0.0009429173,0.000046862897,0.0025393134,0.00030041122,0.00016984547,4.54216e-7,0.000014190994,0.000032765256,0.99595326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983383,0.000038693055,0.0001753597,0.00077410706,0.0003070019,0.00036656254],"domain_scores_gemma":[0.99816245,0.00008806538,0.0002309054,0.0011693423,0.00012296402,0.00022624567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008824889,0.00041136844,0.00042164742,0.0001766145,0.00021757568,0.00008356617,0.0018519247,0.00034582327,0.0000047670774],"category_scores_gemma":[0.000008171465,0.00045944398,0.00023967175,0.000011535658,0.00018375019,0.00016186708,0.0010395664,0.0004800757,0.00012050696],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007783194,0.0000032572668,3.6709244e-7,0.000025295423,0.00004192046,0.00023190143,0.000018677394,0.0000042586985,0.000012732169,0.9721122,0.020280864,0.0072607575],"study_design_scores_gemma":[0.00032667996,0.000060394825,0.0000064628966,0.00006535228,0.000044298242,0.000026590238,0.000002457281,0.00034801237,0.00016267908,0.00090047915,0.9975148,0.0005418299],"about_ca_topic_score_codex":0.000016814269,"about_ca_topic_score_gemma":8.9106e-7,"teacher_disagreement_score":0.9772339,"about_ca_system_score_codex":0.000129514,"about_ca_system_score_gemma":0.00008847653,"threshold_uncertainty_score":0.9997857},"labels":[],"label_agreement":null},{"id":"W4234897354","doi":"10.31219/osf.io/z6erb","title":"A note on Binary Relations","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Binary number; Computer science; Mathematics; Arithmetic","score_opus":0.023736499605869554,"score_gpt":0.27755664072485786,"score_spread":0.2538201411189883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234897354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013364678,0.000045108525,0.8717666,0.002920152,0.0011040893,0.00018164045,0.0000023685277,0.00031392687,0.12232965],"genre_scores_gemma":[0.76261127,0.00002227674,0.20683944,0.0026707714,0.00012421516,0.000028585018,0.000015294594,0.00001370582,0.027674409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904186,0.000028402512,0.00013269532,0.00048319093,0.00016064178,0.00015318491],"domain_scores_gemma":[0.9986885,0.00011001143,0.000073963056,0.0010528504,0.000030238438,0.000044430468],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000065932894,0.00014257325,0.00014120809,0.000099866666,0.00005365952,0.00006710323,0.00083033246,0.00015505483,0.000075746066],"category_scores_gemma":[0.000022595006,0.00011403909,0.000086438464,0.00011196485,0.000013805763,0.00012027036,0.001188055,0.00045362645,0.0025461677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025015468,0.00005868667,0.00008179496,0.000016174872,0.000009092044,0.000016994602,0.00019470401,0.09113699,0.0000369284,0.8900582,0.008303611,0.010084311],"study_design_scores_gemma":[0.0002466304,0.00019358227,0.0048064417,0.00009739755,0.000008038373,0.0000064522405,0.0000053554954,0.30195916,0.00019515365,0.6453944,0.046438232,0.00064918696],"about_ca_topic_score_codex":0.0000053432486,"about_ca_topic_score_gemma":0.0000014369963,"teacher_disagreement_score":0.7612748,"about_ca_system_score_codex":0.000047466536,"about_ca_system_score_gemma":0.00009461284,"threshold_uncertainty_score":0.99823046},"labels":[],"label_agreement":null},{"id":"W4236542983","doi":"10.1007/978-0-387-39940-9_2758","title":"Hierarchical Regular-Decomposition Structures","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decomposition; Computer science; Chemistry","score_opus":0.013071423464697828,"score_gpt":0.25131227474321066,"score_spread":0.23824085127851283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236542983","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005372365,0.0046476494,0.17725173,0.00014070471,0.0021704135,0.0007220546,0.00047881776,0.00028930133,0.8142456],"genre_scores_gemma":[0.016195513,0.0075114667,0.15898477,0.000553789,0.00613042,0.00007997551,0.0043338365,0.0002722407,0.805938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972819,0.00007474635,0.00076829165,0.0008172855,0.0007164328,0.000341357],"domain_scores_gemma":[0.99732476,0.00013629903,0.00056838675,0.0016575404,0.00011782608,0.00019520849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022635428,0.0004741319,0.0007200353,0.0002816411,0.00010284158,0.00006516296,0.0012689033,0.0003055672,0.000052541785],"category_scores_gemma":[0.000028141774,0.00041914982,0.00018938813,0.00008087834,0.00010946829,0.00050103647,0.00035020156,0.0005331123,0.00007781685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009496822,0.000019045718,0.0000021183669,0.00014749874,0.00003524072,0.00011283829,0.000063762534,0.00005827016,0.00008895357,0.9713377,0.004870639,0.023254462],"study_design_scores_gemma":[0.00045462998,0.0002720379,0.0000775457,0.00078411616,0.0000609735,0.00022146502,0.000008186297,0.00081754924,0.00008608426,0.21609391,0.7801846,0.0009388718],"about_ca_topic_score_codex":0.000015236941,"about_ca_topic_score_gemma":0.000003925421,"teacher_disagreement_score":0.775314,"about_ca_system_score_codex":0.000063711916,"about_ca_system_score_gemma":0.00013612585,"threshold_uncertainty_score":0.999826},"labels":[],"label_agreement":null},{"id":"W4237743127","doi":"10.23952/asvao.3.2021.3.07","title":"Characterizing the upper set relation by general functionals","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Research Consortium for Informatics and Mathematics; Norges Teknisk-Naturvitenskapelige Universitet","keywords":"Relation (database); Set (abstract data type); Mathematics; Computer science; Data mining","score_opus":0.012183641567680504,"score_gpt":0.23174848785099766,"score_spread":0.21956484628331716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237743127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016820617,0.00023202982,0.98099893,0.000995774,0.0000650009,0.000084450454,0.000008424973,0.00006340917,0.0007313609],"genre_scores_gemma":[0.8369315,0.00038857173,0.15711053,0.0030860808,0.0001461378,0.000044357537,0.0013912898,0.000015877127,0.00088566664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988277,0.00008144891,0.00025071425,0.00043016305,0.00023790468,0.0001720955],"domain_scores_gemma":[0.99930805,0.00005786889,0.00014538836,0.00034157655,0.00009258027,0.0000545337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002359188,0.00013441508,0.00019513305,0.00009716252,0.000381831,0.00023669822,0.00016273091,0.00007049866,0.0000993355],"category_scores_gemma":[0.0000182334,0.00010108839,0.00008863787,0.0012844973,0.000029458968,0.00032599762,0.00009906272,0.00010198206,0.000008151816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009780946,0.00004277416,0.0014153628,0.0000062316626,0.00044701606,0.000002377629,0.000716136,0.835525,0.008405661,0.14457607,0.000597097,0.008256494],"study_design_scores_gemma":[0.00021805402,0.000008928585,0.0052289204,0.0000023005948,0.00021919813,0.0000036422305,0.00009696358,0.9887568,0.0016265259,0.0023703151,0.0012825635,0.0001857856],"about_ca_topic_score_codex":0.000005333699,"about_ca_topic_score_gemma":0.000002505954,"teacher_disagreement_score":0.8238884,"about_ca_system_score_codex":0.000023148463,"about_ca_system_score_gemma":0.000023932378,"threshold_uncertainty_score":0.4122265},"labels":[],"label_agreement":null},{"id":"W4238245775","doi":"10.1093/analys/63.1.48","title":"Science and constructive mathematics","year":2003,"lang":"en","type":"article","venue":"Analysis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constructive; Library science; Mathematics; Art history; Computer science; Art; Programming language","score_opus":0.007798029499188019,"score_gpt":0.23407969340156812,"score_spread":0.2262816639023801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238245775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10154754,0.00007224907,0.88198847,0.00006392837,0.000024988547,0.000025966576,2.4712656e-7,0.000033404624,0.016243232],"genre_scores_gemma":[0.8372128,0.00000660175,0.16260539,0.00009408477,0.0000020929185,9.650549e-7,5.7374773e-8,8.484777e-7,0.00007715123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993735,0.000012589986,0.000076835786,0.00021245018,0.00019691535,0.00012769761],"domain_scores_gemma":[0.9994841,0.000046567326,0.0000387223,0.00026786138,0.00010551802,0.000057232035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002641762,0.000048835816,0.00010730019,0.00028425045,0.000138997,0.00007917205,0.00024144184,0.000011196518,0.0000127048],"category_scores_gemma":[0.00015357876,0.00003876926,0.00003033847,0.0033419046,0.00022337577,0.00030595926,0.000059150185,0.000030809806,0.000009532826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.2591485e-8,0.000008665833,0.0012519505,9.387132e-7,0.000038510487,0.0000020835446,0.00023241556,0.00003975264,0.00030390228,0.9952849,0.0000035649514,0.0028332502],"study_design_scores_gemma":[0.00032625967,0.0000874121,0.01032294,0.000005981638,0.0004959859,0.00007253068,0.0009995723,0.15941063,0.012343317,0.8134687,0.0019303961,0.0005363052],"about_ca_topic_score_codex":0.0000017264343,"about_ca_topic_score_gemma":0.000002261318,"teacher_disagreement_score":0.73566526,"about_ca_system_score_codex":0.000015312582,"about_ca_system_score_gemma":0.00006045543,"threshold_uncertainty_score":0.16056743},"labels":[],"label_agreement":null},{"id":"W4239151521","doi":"10.4153/cmb-2016-083-x","title":"Coaxer Lattices","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Distributive property; Congruence relation; Distributive lattice; Congruence lattice problem; Lattice (music); Pure mathematics; Map of lattices; Complete lattice; Universality (dynamical systems)","score_opus":0.012518891345102904,"score_gpt":0.21239170369380536,"score_spread":0.19987281234870247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239151521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009606928,0.00009103398,0.808689,0.075675674,0.0001684482,0.00017921253,0.0000063275124,0.00021166165,0.10537172],"genre_scores_gemma":[0.9478379,0.000005870793,0.03692691,0.0037681728,0.0000778464,0.00002066857,3.7634297e-7,0.000013281637,0.011348997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908406,0.000026299609,0.00014376365,0.00023273932,0.00012503337,0.0003880822],"domain_scores_gemma":[0.99882567,0.00023561694,0.000028503486,0.0004000927,0.000031477783,0.00047862536],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013875196,0.00009985932,0.0001232504,0.00006611419,0.000080680635,0.000057802208,0.00056983565,0.000051951632,0.007846809],"category_scores_gemma":[0.00021990413,0.00006028553,0.000041205305,0.00010130965,0.000071167844,0.0000812835,0.000056694375,0.000052614465,0.038654525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.932978e-7,0.000008580798,0.00002547224,0.000007595489,0.000003633403,0.00004470726,0.000050054954,2.9589106e-7,0.00008004318,0.97246605,0.011624303,0.01568889],"study_design_scores_gemma":[0.00018258953,0.000028352522,0.00020080438,0.000054818604,0.0000029916234,0.000034528155,0.000010210845,0.00015565968,0.00030253307,0.52413434,0.47468573,0.00020744058],"about_ca_topic_score_codex":0.000057612073,"about_ca_topic_score_gemma":0.00019459912,"teacher_disagreement_score":0.93823093,"about_ca_system_score_codex":0.00006273294,"about_ca_system_score_gemma":0.00008275376,"threshold_uncertainty_score":0.9930602},"labels":[],"label_agreement":null},{"id":"W4239221662","doi":"10.1007/978-3-319-61199-0_2","title":"Profinite Graphs","year":2017,"lang":"de","type":"book-chapter","venue":"Ergebnisse der Mathematik und ihrer Grenzgebiete","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Profinite group; Mathematics; Discrete mathematics; Cayley graph; Combinatorics; Vertex-transitive graph; Voltage graph; Graph; Pure mathematics; Line graph; Group (periodic table); Physics","score_opus":0.0412578808845507,"score_gpt":0.2866753787053483,"score_spread":0.2454174978207976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239221662","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006527968,0.04891628,0.1402199,0.004230439,0.014152392,0.0063714143,0.00038591473,0.0023455974,0.7827253],"genre_scores_gemma":[0.036919996,0.0074138306,0.11754151,0.0030342727,0.0035098377,0.0007116786,0.00044823805,0.0013636891,0.829057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905048,0.00015269018,0.0021132824,0.0032702798,0.001858451,0.0021004707],"domain_scores_gemma":[0.98828626,0.00046926338,0.0029038226,0.0067011407,0.00065981026,0.0009797128],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.00093706173,0.0026425235,0.0025687092,0.0008497555,0.0020918201,0.0017095968,0.0059383786,0.0014616704,0.002087877],"category_scores_gemma":[0.00025664712,0.0024005943,0.0012988974,0.00020829299,0.0011399162,0.0018248683,0.002058389,0.002152876,0.017835824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005368112,0.00022692006,0.000027591506,0.000695925,0.0011725611,0.00074656145,0.0013946383,0.000009354923,0.00020068971,0.9685809,0.0052240277,0.021667138],"study_design_scores_gemma":[0.0011545105,0.00037465495,0.000077435085,0.0014978152,0.0006510551,0.00016405563,0.000018042685,0.0013958185,0.0004886564,0.7229749,0.26860654,0.002596547],"about_ca_topic_score_codex":0.000016374108,"about_ca_topic_score_gemma":0.000028357517,"teacher_disagreement_score":0.26338252,"about_ca_system_score_codex":0.00016180627,"about_ca_system_score_gemma":0.00041774524,"threshold_uncertainty_score":0.99983466},"labels":[],"label_agreement":null},{"id":"W4239238169","doi":"10.1007/978-1-4939-7131-2_100018","title":"Algebraic Path Problem","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Path (computing); Algebraic number; Mathematics; Computer science; Mathematical analysis; Programming language","score_opus":0.015615250960467121,"score_gpt":0.21748926175073663,"score_spread":0.2018740107902695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239238169","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013163893,0.00018168431,0.2935668,0.0001812343,0.00024346128,0.00015245687,0.0000017099313,0.00036136954,0.70531],"genre_scores_gemma":[0.00022757103,0.000055334778,0.108373426,0.0011205699,0.00030660207,0.00000760539,0.0000068462045,0.000029967754,0.8898721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984812,0.000007370061,0.0002544097,0.00066866085,0.00029122425,0.00029709982],"domain_scores_gemma":[0.99870694,0.000038356662,0.0001489937,0.0008927311,0.00009430683,0.00011869492],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009377365,0.0003246772,0.00028083668,0.000099336365,0.00008963541,0.000097206954,0.0011579515,0.00023717375,0.002283454],"category_scores_gemma":[0.0000047864387,0.00025160733,0.00013207298,0.00003843973,0.000093122675,0.00026616183,0.0004898667,0.0002396688,0.004569548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.371186e-7,0.0000049701252,4.2300644e-7,0.000010050486,0.000012668528,0.000024066383,0.00005532459,4.8423465e-7,0.0000046515406,0.9640825,0.015809381,0.019994892],"study_design_scores_gemma":[0.00005688308,0.0000842122,0.0000018376038,0.000033093886,0.0000039432102,0.000016575017,6.7031937e-7,0.00011858074,0.000021429656,0.6174295,0.3819828,0.00025045575],"about_ca_topic_score_codex":0.0000012034681,"about_ca_topic_score_gemma":0.0000047331514,"teacher_disagreement_score":0.36617342,"about_ca_system_score_codex":0.00003730224,"about_ca_system_score_gemma":0.00007758677,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W4240066789","doi":"10.1090/crmp/053","title":"Models, Logics, and Higher-Dimensional Categories","year":2011,"lang":"en","type":"book","venue":"CRM proceedings & lecture notes","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Ottawa; University of Manitoba; McMaster University","funders":"","keywords":"Psychology","score_opus":0.029829311333508374,"score_gpt":0.21668157567981597,"score_spread":0.18685226434630758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240066789","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001730437,0.014482564,0.20287518,0.00132795,0.0011675913,0.00050980947,0.0000125197475,0.00096635986,0.778485],"genre_scores_gemma":[0.94222194,0.00064246403,0.024653014,0.004735599,0.0022976098,0.00008863309,0.000081463826,0.00020464628,0.02507461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976917,0.000006042482,0.0003123898,0.0010786891,0.00039273128,0.0005184412],"domain_scores_gemma":[0.9987548,0.00011667868,0.00029989693,0.0002706772,0.0003669951,0.00019095883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001242868,0.00063261244,0.0005664371,0.0001820469,0.00028444506,0.00025646423,0.00089489383,0.0006552935,0.000041506835],"category_scores_gemma":[0.00006293192,0.0004985316,0.00011498823,0.00016045899,0.00023196559,0.00071349734,0.00058780913,0.0007954419,0.00003408447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009920956,0.000016696806,0.000010339356,0.00009458749,0.000032502026,0.000013414881,0.0006402698,0.000036858222,0.0000848978,0.98783493,0.001006878,0.010218705],"study_design_scores_gemma":[0.00014556063,0.0001494424,0.0000404655,0.00008852069,0.000037006237,0.00006405499,0.000002343658,0.0007835731,0.00057637517,0.97123736,0.026261315,0.0006139814],"about_ca_topic_score_codex":0.0000071079176,"about_ca_topic_score_gemma":0.000002626511,"teacher_disagreement_score":0.9420489,"about_ca_system_score_codex":0.000090468166,"about_ca_system_score_gemma":0.00022682712,"threshold_uncertainty_score":0.9997466},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010153801300862256,"score_gpt":0.2131362981509792,"score_spread":0.20298249685011693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241161039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33933488,0.00028199868,0.5367809,0.02247152,0.00056926167,0.00023713279,0.0000037670245,0.0003753644,0.09994521],"genre_scores_gemma":[0.94828475,0.0000029190667,0.049891103,0.0012706713,0.00008794506,0.000006298102,9.861313e-7,0.0000016807412,0.00045363998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995888,0.000012072793,0.000111141584,0.0001748185,0.000021935128,0.000091262824],"domain_scores_gemma":[0.9996302,0.000039870672,0.000029685034,0.00025017306,0.000010567384,0.00003948234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000071932336,0.000042750096,0.00005935451,0.000013993893,0.000044627286,0.000033456432,0.00022721947,0.0000148220215,0.00019745193],"category_scores_gemma":[0.000011645988,0.00004055598,0.000031692147,0.000024030474,0.000023820516,0.00029086854,0.00006247939,0.000029203427,0.0006909221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013602028,0.00003520322,0.00078337255,0.0000012520223,0.000004883363,5.2521756e-7,0.00008657619,0.001468177,0.00010476761,0.962591,0.0022677036,0.032655187],"study_design_scores_gemma":[0.00045866778,0.000040885596,0.019791944,0.0000023214536,0.0000021343908,0.000017313207,0.000009152417,0.07781118,0.0030340578,0.15508099,0.7434635,0.00028781424],"about_ca_topic_score_codex":7.179799e-7,"about_ca_topic_score_gemma":0.0000050215763,"teacher_disagreement_score":0.80751,"about_ca_system_score_codex":0.000046342415,"about_ca_system_score_gemma":0.000026798702,"threshold_uncertainty_score":0.8880636},"labels":[],"label_agreement":null},{"id":"W4242444051","doi":"10.1017/cbo9781107340985.004","title":"Ordered Sets via Adjunction","year":2003,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Adjunction; Mathematics; Computer science; Pure mathematics","score_opus":0.019036864595024135,"score_gpt":0.19154264062909218,"score_spread":0.17250577603406805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242444051","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009294195,0.00011135592,0.26222438,0.000022785283,0.0004929926,0.00021712638,0.000017404947,0.0002517636,0.7366529],"genre_scores_gemma":[0.00041414573,0.000059467227,0.0030040552,0.00030284136,0.000055683282,5.7191147e-7,0.000020851881,0.000028784301,0.9961136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846804,0.000043334996,0.00016523198,0.00072382303,0.00027744516,0.0003221059],"domain_scores_gemma":[0.9985324,0.000040874726,0.0002215227,0.00087757164,0.00015081975,0.00017678548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006597491,0.0003817447,0.00034156442,0.00017851555,0.00023817475,0.000058781596,0.0009303783,0.00034693597,0.0000058235814],"category_scores_gemma":[0.0000056705067,0.00043866242,0.00018963197,0.000017495468,0.00012351383,0.000262589,0.00043251328,0.00043577538,0.00005357799],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013785309,0.0000072844177,3.3903981e-7,0.00002225733,0.000047716407,0.00025385397,0.000019097142,0.000010416645,0.000029495788,0.97123945,0.017428555,0.010927782],"study_design_scores_gemma":[0.00044551925,0.00006705684,0.0000067630945,0.000044520635,0.00005351067,0.000055014334,0.000003992194,0.00054847676,0.0001902944,0.0007300838,0.99733114,0.0005236072],"about_ca_topic_score_codex":0.0000201044,"about_ca_topic_score_gemma":0.0000013238963,"teacher_disagreement_score":0.9799026,"about_ca_system_score_codex":0.00018103872,"about_ca_system_score_gemma":0.000072542265,"threshold_uncertainty_score":0.9998065},"labels":[],"label_agreement":null},{"id":"W4242446486","doi":"10.1145/1124706.1121516","title":"Nifty assignments","year":2006,"lang":"sr","type":"article","venue":"ACM SIGCSE Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mathematics education; Psychology","score_opus":0.011870817175091116,"score_gpt":0.22601031886424014,"score_spread":0.21413950168914903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242446486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15346721,0.008945177,0.5693602,0.08861768,0.008270316,0.0020812985,0.00007525078,0.0017195471,0.16746332],"genre_scores_gemma":[0.9207049,0.00007610912,0.040326025,0.00264305,0.00090832275,0.000032603908,0.000016568758,0.000044697434,0.035247717],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996622,0.00019729736,0.0005735349,0.0010120916,0.0006418247,0.00095325214],"domain_scores_gemma":[0.9971832,0.00037494983,0.00028450633,0.0018684512,0.00009282652,0.00019604813],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003627275,0.00045662955,0.00039989976,0.00010380845,0.00036872196,0.000308495,0.002448184,0.00022472149,0.0023571784],"category_scores_gemma":[0.0002696307,0.00043285463,0.00019282606,0.00040491176,0.00017402922,0.0001808435,0.0012722642,0.00040817563,0.009976487],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079779624,0.0015796968,0.0061185304,0.000109127635,0.00010270911,0.0011054169,0.00052264065,0.0015513416,0.0030074394,0.13213511,0.68394375,0.16974448],"study_design_scores_gemma":[0.0013191821,0.00029331323,0.013222879,0.00009443454,0.000036747766,0.000053893345,0.00004705164,0.00055959384,0.005053104,0.07427154,0.90409267,0.00095557346],"about_ca_topic_score_codex":0.00018998704,"about_ca_topic_score_gemma":0.000008776524,"teacher_disagreement_score":0.7672377,"about_ca_system_score_codex":0.000115683055,"about_ca_system_score_gemma":0.00007971428,"threshold_uncertainty_score":0.9998123},"labels":[],"label_agreement":null},{"id":"W4242878312","doi":"10.1090/ulect/070/13","title":"The classification of AF-equivalence relations","year":2018,"lang":"en","type":"book-chapter","venue":"University lecture series","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Equivalence (formal languages); Computer science; Mathematics; Pure mathematics","score_opus":0.013881605657440378,"score_gpt":0.1932308049866454,"score_spread":0.17934919932920504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242878312","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068982685,0.00037741757,0.43194917,0.0024337189,0.00033860613,0.00016471469,0.000015495978,0.00013244334,0.56451946],"genre_scores_gemma":[0.03499186,0.0005442946,0.011342484,0.000057546884,0.000120080316,2.4846335e-7,0.000015755995,0.000013846455,0.9529139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993712,0.00001969636,0.000098017495,0.0002390371,0.00015955276,0.00011253944],"domain_scores_gemma":[0.99895185,0.000103787046,0.0001990901,0.00053502416,0.0001786177,0.000031612468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055545144,0.00013005838,0.000121319776,0.00007184183,0.00042669819,0.00002640524,0.00078651705,0.00015426044,0.0000935768],"category_scores_gemma":[0.000024242514,0.00010273957,0.000077208126,0.000079653444,0.00041988862,0.00032196738,0.00018696442,0.00019124341,0.000062367806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009342488,0.0000019161798,0.000003394113,0.000005043275,0.000016041247,0.0000033417946,0.00035340548,0.000012846769,0.000057726204,0.99588096,0.0010976692,0.0025583068],"study_design_scores_gemma":[0.00004954057,0.00007444783,0.00022561052,0.000029448749,0.000018243236,0.000006303627,0.00004997345,0.000096091055,0.00008123166,0.34330723,0.65592855,0.00013334297],"about_ca_topic_score_codex":0.0000015107099,"about_ca_topic_score_gemma":0.0000761879,"teacher_disagreement_score":0.6548309,"about_ca_system_score_codex":0.00006266454,"about_ca_system_score_gemma":0.00009936411,"threshold_uncertainty_score":0.4189598},"labels":[],"label_agreement":null},{"id":"W4243092413","doi":"10.1007/s00012-018-0551-7","title":"Jónsson posets","year":2018,"lang":"gl","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Cardinality (data modeling); Combinatorics; Star product; Set (abstract data type); Partially ordered set; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Data mining","score_opus":0.013476560606624052,"score_gpt":0.24147256291270186,"score_spread":0.2279960023060778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243092413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28524634,0.0035271249,0.42376098,0.013031691,0.0119989915,0.0011496977,0.00012823004,0.0018704263,0.25928652],"genre_scores_gemma":[0.9790574,0.00020465453,0.008588248,0.0023538917,0.0011097043,0.0000022308898,0.00001663505,0.0000439615,0.008623331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968526,0.0001875258,0.00036285163,0.0010754416,0.0005199956,0.0010016105],"domain_scores_gemma":[0.99748945,0.00014749552,0.00024523924,0.0013660546,0.00034318573,0.0004085708],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023622511,0.00046596464,0.0004027576,0.00028042574,0.00057959574,0.00027802252,0.0019374556,0.00027103,0.0013644655],"category_scores_gemma":[0.00008002348,0.00047635136,0.00020976,0.0012939426,0.00066788826,0.0015562669,0.00080193783,0.0003494939,0.0040941807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059049078,0.00019701691,0.00048428972,0.000026973068,0.0001366927,0.0004036839,0.0055909553,0.0000098852415,0.001051052,0.89129525,0.025760502,0.07498463],"study_design_scores_gemma":[0.0031836587,0.0028988458,0.007662261,0.00028490898,0.00022149613,0.00021939792,0.0014052092,0.015001883,0.01460552,0.12012071,0.83174616,0.002649951],"about_ca_topic_score_codex":0.00018833678,"about_ca_topic_score_gemma":0.0000889855,"teacher_disagreement_score":0.8059856,"about_ca_system_score_codex":0.00018031459,"about_ca_system_score_gemma":0.0002231679,"threshold_uncertainty_score":0.9997688},"labels":[],"label_agreement":null},{"id":"W4243980934","doi":"10.1007/978-1-4614-6170-8_100815","title":"Algebraic Path Problem","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Algebraic number; Path (computing); Algebra over a field; Pure mathematics; Computer science; Mathematical analysis; Programming language","score_opus":0.012094202652579683,"score_gpt":0.20456736211198784,"score_spread":0.19247315945940816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243980934","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.7078005e-7,0.00013007005,0.45632356,0.00021567274,0.00014851759,0.000108904744,7.3446444e-7,0.00027995737,0.5427923],"genre_scores_gemma":[0.00079552137,0.000052280888,0.08612102,0.0016101028,0.00020195812,0.000008767966,0.0000074750888,0.000031801817,0.9111711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985124,0.00001011379,0.00026359802,0.0006377963,0.00028962933,0.00028647346],"domain_scores_gemma":[0.99870616,0.000060574457,0.00015823625,0.0008907638,0.00006140824,0.00012288419],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000112431415,0.00032916194,0.00032599064,0.0000974332,0.000077838464,0.0000906772,0.0011158924,0.00023234336,0.00047844546],"category_scores_gemma":[0.0000056002173,0.000255995,0.0001449875,0.000030582007,0.000050960727,0.00014529278,0.0003995153,0.00029301175,0.002137564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.1286106e-7,0.0000028908537,5.2548944e-7,0.000013575429,0.000009525456,0.000014759,0.000017870709,0.0000037718814,0.000003839924,0.92774636,0.0051640472,0.06702242],"study_design_scores_gemma":[0.00006268007,0.00005475995,0.0000022400902,0.00003075137,0.000003866265,0.000013916719,2.2911858e-7,0.00029798344,0.000010396875,0.5670426,0.43222785,0.00025271653],"about_ca_topic_score_codex":0.0000014567236,"about_ca_topic_score_gemma":0.0000035253825,"teacher_disagreement_score":0.42706382,"about_ca_system_score_codex":0.000031567124,"about_ca_system_score_gemma":0.000054923126,"threshold_uncertainty_score":0.9999892},"labels":[],"label_agreement":null},{"id":"W4244209366","doi":"10.24124/2015/bpgub1019","title":"On the dualisabilty of finite {0, 1 }-valued unary algebras with zero.","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Northern British Columbia","keywords":"Unary operation; Mathematics; Row; Lattice (music); Zero (linguistics); Pure mathematics; Ideal (ethics); Row and column spaces; Zero order; Order (exchange); Algebra over a field; Discrete mathematics; First order; Applied mathematics; Computer science; Physics","score_opus":0.02615589697392932,"score_gpt":0.27425180574547875,"score_spread":0.24809590877154944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244209366","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30248895,0.0006399127,0.24905945,0.0014658218,0.0022019176,0.0017622267,0.00003229836,0.0007168633,0.44163257],"genre_scores_gemma":[0.9439047,0.000022900778,0.019347426,0.0016497851,0.000097483855,0.00009267163,0.00029926663,0.00006061256,0.034525186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983777,0.000100048404,0.00027225158,0.00043424655,0.00058975426,0.00022601784],"domain_scores_gemma":[0.9980683,0.00041848797,0.00027801865,0.0009258763,0.00023349181,0.000075862605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002552265,0.00027893815,0.00030904263,0.00008910524,0.000088842244,0.000049547994,0.0011042331,0.00014522458,0.0001079838],"category_scores_gemma":[0.00015075419,0.00014258688,0.00008111533,0.00041433406,0.000065311266,0.00019382346,0.00006728966,0.0002876791,0.00008327009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007988239,0.00008945561,0.000016514616,0.00003505706,0.000044435903,0.00001092409,0.0012471365,0.00044888997,0.000045759683,0.98423713,0.008143222,0.005601592],"study_design_scores_gemma":[0.0006533416,0.0012090943,0.00093002676,0.00026483292,0.00004695873,0.00000959093,0.0007409,0.0057233227,0.0034116542,0.98455197,0.0017401638,0.00071812124],"about_ca_topic_score_codex":0.000025143083,"about_ca_topic_score_gemma":0.000059013353,"teacher_disagreement_score":0.6414157,"about_ca_system_score_codex":0.000029814739,"about_ca_system_score_gemma":0.00020932055,"threshold_uncertainty_score":0.5814524},"labels":[],"label_agreement":null},{"id":"W4244430484","doi":"10.5642/jhummath.201102.13","title":"Zeroes","year":2011,"lang":"de","type":"article","venue":"Journal of Humanistic Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics","score_opus":0.07246097704399812,"score_gpt":0.2585863202810706,"score_spread":0.18612534323707247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244430484","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003309361,0.0041361405,0.9748088,0.000105299216,0.0030326515,0.00012371165,0.0000030193473,0.000030609594,0.014450419],"genre_scores_gemma":[0.4939109,0.0003639361,0.5033967,0.0001934161,0.0010036839,0.0000010997857,3.218308e-7,0.000032800766,0.0010971323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976467,0.00006407455,0.0011942222,0.00017227534,0.0005710126,0.00035174133],"domain_scores_gemma":[0.99706525,0.00024716477,0.0015711291,0.00052231504,0.0003867996,0.000207319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067530264,0.0002589338,0.00057651,0.00017459814,0.00016690667,0.00014165799,0.0013564535,0.00009577731,0.00084190123],"category_scores_gemma":[0.00035786463,0.00019565692,0.00032851472,0.0001776812,0.0001591114,0.00037794557,0.0002008616,0.0004147941,0.00045523414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012925736,0.00086559047,0.00003215448,0.00032779013,0.00025032822,0.00078862684,0.016822608,0.000011210737,0.000098648685,0.97539645,0.002882238,0.0025114],"study_design_scores_gemma":[0.0005280725,0.0011233364,0.00024095706,0.00050531974,0.00042938965,0.00068970356,0.00067317276,0.0038842645,0.0004984235,0.98526704,0.00579469,0.00036564242],"about_ca_topic_score_codex":8.849914e-7,"about_ca_topic_score_gemma":5.928137e-7,"teacher_disagreement_score":0.49060154,"about_ca_system_score_codex":0.000056145185,"about_ca_system_score_gemma":0.00014606414,"threshold_uncertainty_score":0.92182285},"labels":[],"label_agreement":null},{"id":"W4244609172","doi":"10.3765/salt.v0i0.2490","title":"Indeterminate NPIs and Scope","year":2015,"lang":"en","type":"article","venue":"Proceedings from Semantics and Linguistic Theory","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scope (computer science); Indeterminate; Computer science; Natural language processing; Artificial intelligence; Mathematics; Programming language","score_opus":0.016188960176879,"score_gpt":0.23060261872839888,"score_spread":0.2144136585515199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244609172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83155763,0.0048086727,0.14195737,0.00044134192,0.0009485149,0.00024430288,0.000006996055,0.00032870055,0.019706447],"genre_scores_gemma":[0.977478,0.00012443692,0.02174855,0.00025143378,0.00023522582,0.0000040247887,9.576383e-7,0.000011134995,0.00014620832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990728,0.000010636666,0.0001610758,0.00038338007,0.00014799432,0.00022412011],"domain_scores_gemma":[0.99929667,0.00012400559,0.000088198554,0.00011924156,0.00016397906,0.00020791464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040048,0.00015386443,0.00018694616,0.000063966436,0.000108285654,0.00023552554,0.00028048927,0.00006186307,0.00000257417],"category_scores_gemma":[0.0008215593,0.0001296863,0.000016966636,0.00011297567,0.00012113487,0.00015680419,0.00034353553,0.00013568174,0.000007940424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015118131,0.000019994113,0.0020047086,0.000030827396,0.000012709549,0.000020665115,0.0040822355,4.727949e-7,0.00030458363,0.9774573,0.00006637351,0.015985044],"study_design_scores_gemma":[0.00036500813,0.00009993925,0.0011603099,0.000064636464,0.000020738687,0.000027027776,0.0002470622,0.006585832,0.00072009116,0.98723555,0.0032440824,0.00022972132],"about_ca_topic_score_codex":0.0000094649695,"about_ca_topic_score_gemma":6.5580673e-7,"teacher_disagreement_score":0.14592038,"about_ca_system_score_codex":0.0000104506535,"about_ca_system_score_gemma":0.000025144187,"threshold_uncertainty_score":0.52884537},"labels":[],"label_agreement":null},{"id":"W4247058261","doi":"10.4171/owr/2014/02","title":"Set Theory","year":2014,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Set theory; Forcing (mathematics); Set (abstract data type); Universal set; Selection (genetic algorithm); Computer science; Mathematics; Mathematical economics; Artificial intelligence; Programming language","score_opus":0.011168041408025544,"score_gpt":0.23090099646708293,"score_spread":0.21973295505905738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247058261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03406876,0.00010064195,0.9000426,0.00025456867,0.00064990367,0.0000813931,2.1623018e-7,0.00034182216,0.06446013],"genre_scores_gemma":[0.9817495,0.000002759556,0.014786447,0.00065688236,0.000095633855,0.000010173259,0.0000026145067,0.000008083006,0.0026879576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879336,0.000085725515,0.00024381011,0.00040596648,0.00021187094,0.00025926327],"domain_scores_gemma":[0.99870735,0.00009259891,0.00014363126,0.00091498846,0.000039098966,0.00010233898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006916327,0.00011642002,0.00013668241,0.000044401233,0.00010790166,0.00006780347,0.00031206213,0.00004914825,0.00005340022],"category_scores_gemma":[0.00017344215,0.000094067706,0.0000628846,0.00017038372,0.000036042933,0.0003106806,0.0001684164,0.00010521412,0.00010009395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017922947,0.000026928821,0.0030090755,0.000008112183,0.0000101784435,0.00038605236,0.00036908055,0.00015047345,0.0004820563,0.85951596,0.0020263584,0.13401392],"study_design_scores_gemma":[0.000090554655,0.00005984373,0.0060960553,0.000008656866,0.000004646799,0.00086278416,0.000014991681,0.0017335452,0.0021263822,0.83814466,0.15059975,0.00025812877],"about_ca_topic_score_codex":0.0000033566453,"about_ca_topic_score_gemma":0.0000014800675,"teacher_disagreement_score":0.9476807,"about_ca_system_score_codex":0.000015796664,"about_ca_system_score_gemma":0.000024101279,"threshold_uncertainty_score":0.383597},"labels":[],"label_agreement":null},{"id":"W4247258831","doi":"10.28924/2291-8639-16-2018-702","title":"c-Algebrability of Pathological Sets of Product Integrable Functions Author(s): Fateme Farmanesh, Ali Farokhinia","year":2018,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integrable system; Mathematics; Product (mathematics); Pure mathematics; Geometry","score_opus":0.017535752786006636,"score_gpt":0.3108953024352102,"score_spread":0.2933595496492035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247258831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22129592,0.00014950325,0.7764791,0.001263535,0.000108518005,0.00007890974,0.000022807882,0.000011924979,0.0005897291],"genre_scores_gemma":[0.9813738,0.000053860047,0.018295314,0.000060544135,0.00012436663,0.000008998642,0.000007863858,0.000002747359,0.000072502604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985342,0.00006608107,0.00070042425,0.00023128167,0.00036744983,0.000100550715],"domain_scores_gemma":[0.99746925,0.00010575146,0.0007002347,0.00030712533,0.0013446304,0.00007298474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005457291,0.000097597615,0.00030714154,0.0003740127,0.000076609445,0.000037682425,0.00072545535,0.0000402114,0.00009565215],"category_scores_gemma":[0.00008958248,0.00007225077,0.00022503712,0.0008312902,0.00029886636,0.00028368144,0.0001392144,0.00013103365,0.000004039272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010553562,0.001630612,0.08080714,0.00003366238,0.002870188,0.0000118368,0.00126093,0.0013829714,0.026905196,0.65819067,0.00063156086,0.2261697],"study_design_scores_gemma":[0.0016336682,0.0013539726,0.43202838,0.00009669529,0.0017616148,0.00039895656,0.0009781782,0.025158577,0.035864502,0.4741726,0.025771122,0.0007817371],"about_ca_topic_score_codex":0.00001692447,"about_ca_topic_score_gemma":0.000013403657,"teacher_disagreement_score":0.7600779,"about_ca_system_score_codex":0.000023928058,"about_ca_system_score_gemma":0.00005230262,"threshold_uncertainty_score":0.29463008},"labels":[],"label_agreement":null},{"id":"W4247691414","doi":"10.24124/2010/bpgub1481","title":"Standard unary algebras","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Unary operation; Variety (cybernetics); Mathematics; Type (biology); Algebra over a field; Pure mathematics; Interior algebra; Carry (investment); Boolean algebra; Discrete mathematics; Algebra representation; Division algebra","score_opus":0.007481854415038543,"score_gpt":0.25909753977431965,"score_spread":0.2516156853592811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247691414","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03635302,0.0007695563,0.43559882,0.00046174595,0.007585282,0.00043054714,0.000009185341,0.0013088124,0.51748306],"genre_scores_gemma":[0.24673353,0.0002598115,0.42660677,0.0023343659,0.00094405364,0.0001145661,0.0009207036,0.00012944639,0.32195675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998753,0.000016834816,0.00019811411,0.00046861565,0.00031230412,0.00025110657],"domain_scores_gemma":[0.9990152,0.000042954132,0.00011225848,0.0006322805,0.00010246877,0.00009484083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008409042,0.00022379482,0.00023143899,0.00010990487,0.00011227287,0.00011912706,0.0010091248,0.00030709838,0.00038800106],"category_scores_gemma":[0.000027787277,0.00018195574,0.00009595918,0.0002085211,0.000016033993,0.00032671835,0.000069056376,0.00051787734,0.00027920242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017212096,0.000025217156,0.000019670686,0.00003755727,0.000017957096,0.000044766017,0.00040069074,0.0000029452617,0.0011435607,0.8216865,0.0046012364,0.17200266],"study_design_scores_gemma":[0.0005031575,0.00030064044,0.0028790494,0.000077480276,0.000025725492,0.000029188353,0.00026092448,0.0006157647,0.027386814,0.7982227,0.16834575,0.0013527885],"about_ca_topic_score_codex":0.000005960233,"about_ca_topic_score_gemma":0.00017799978,"teacher_disagreement_score":0.21038051,"about_ca_system_score_codex":0.000020324658,"about_ca_system_score_gemma":0.00015783487,"threshold_uncertainty_score":0.74199396},"labels":[],"label_agreement":null},{"id":"W4247773467","doi":"10.1007/978-1-4939-7131-2_100616","title":"Logical Algebra","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Algebra over a field; Computer science; Programming language; Mathematics; Pure mathematics","score_opus":0.028514998986687842,"score_gpt":0.24042527222871704,"score_spread":0.2119102732420292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247773467","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017742241,0.00012792017,0.35714772,0.0002061561,0.0002889586,0.0000661312,8.985831e-7,0.00028528596,0.64187515],"genre_scores_gemma":[0.0004907222,0.000047928304,0.0493836,0.0020017917,0.00042820684,0.000002908416,0.000004679674,0.000018349177,0.9476218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986844,0.0000066284424,0.00020685275,0.00059347786,0.00025952488,0.00024912553],"domain_scores_gemma":[0.99889106,0.000053567263,0.000093482886,0.0007730974,0.00006906028,0.000119748904],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000071035385,0.0002723254,0.0002630182,0.000073955685,0.00007358191,0.000080012396,0.0011260606,0.0002822741,0.0064555504],"category_scores_gemma":[0.00000968585,0.00019697049,0.00013735301,0.000027021872,0.00012562842,0.00018025601,0.0005271987,0.00024080166,0.0074328664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.8422084e-7,0.0000043849304,3.1716914e-7,0.0000025922554,0.000008842478,0.000038553226,0.000016651267,3.0471924e-7,0.0000027697708,0.9719069,0.013735128,0.014282791],"study_design_scores_gemma":[0.000042079497,0.00007478346,0.0000037705136,0.000010042246,0.0000027769188,0.000019808353,3.9648685e-7,0.00010948299,0.000019736213,0.5919139,0.407605,0.00019823552],"about_ca_topic_score_codex":4.4528647e-7,"about_ca_topic_score_gemma":0.0000021225433,"teacher_disagreement_score":0.39386988,"about_ca_system_score_codex":0.000027769964,"about_ca_system_score_gemma":0.000038946222,"threshold_uncertainty_score":0.99445266},"labels":[],"label_agreement":null},{"id":"W4249368467","doi":"10.1145/2445196.2445356","title":"Nifty assignments","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.007037135384599846,"score_gpt":0.19811010203015306,"score_spread":0.1910729666455532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249368467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009534694,0.000011300718,0.91085964,0.00068491226,0.00011254333,0.00005766484,2.942761e-8,0.00014362906,0.07859558],"genre_scores_gemma":[0.89530206,0.0000012843722,0.09835059,0.0012057334,0.000016490189,0.000010642471,1.4037444e-7,0.0000014744813,0.0051116096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996188,0.00000783041,0.000051485207,0.00012194265,0.00008042497,0.00011947145],"domain_scores_gemma":[0.9997068,0.000014274762,0.000012550524,0.0002059938,0.000014139634,0.000046230205],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000022004535,0.000039084083,0.00003590461,0.000013638947,0.00003346082,0.00005734555,0.00031439136,0.000013313451,0.00046901408],"category_scores_gemma":[0.000004992349,0.000027021055,0.000014213192,0.000074766955,0.000008600999,0.00047267516,0.000098487915,0.000027708307,0.002224451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.5513008e-7,0.000039964303,0.0015740758,0.0000014364483,0.000004340141,0.0000036065455,0.000070317146,0.000024360905,0.0021819838,0.78253305,0.012996663,0.20057005],"study_design_scores_gemma":[0.0003721666,0.000103576116,0.0688086,0.000004228509,0.0000012161171,0.000012055219,0.00003591517,0.033935178,0.008715877,0.86473954,0.02291748,0.00035417266],"about_ca_topic_score_codex":0.0000089385185,"about_ca_topic_score_gemma":3.825295e-7,"teacher_disagreement_score":0.88576734,"about_ca_system_score_codex":0.000006975742,"about_ca_system_score_gemma":0.000005252709,"threshold_uncertainty_score":0.99855244},"labels":[],"label_agreement":null},{"id":"W4250461584","doi":"10.1016/b0-08-044854-2/04763-5","title":"Abstraction","year":2006,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Abstraction; Computer science; Semantics (computer science); Operator (biology); Generative grammar; Linguistics; Programming language; Artificial intelligence; Epistemology; Philosophy","score_opus":0.01327241961069378,"score_gpt":0.22625616360272385,"score_spread":0.21298374399203007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250461584","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024164246,0.0004880911,0.008174556,0.00006229468,0.00064281176,0.00018703508,0.0000034731606,0.0002626554,0.9901767],"genre_scores_gemma":[0.0006051126,0.00002041867,0.0051589217,0.00030435467,0.00039099317,0.00001071931,0.000009574735,0.000032554057,0.99346733],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986704,0.000008483802,0.0002949263,0.00050204166,0.00028157982,0.00024259117],"domain_scores_gemma":[0.9989089,0.000037506416,0.00022562197,0.0006971782,0.000056711415,0.000074109994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008480322,0.00030356296,0.00027910457,0.00011225059,0.00010440354,0.00008502714,0.00060055207,0.00024646585,0.00006365232],"category_scores_gemma":[0.0000032753885,0.00028039116,0.00017167123,0.00001049447,0.000055475735,0.00013746438,0.00015596845,0.00040059787,0.00073050574],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.922225e-7,0.0000027436702,2.750654e-7,0.000009896713,0.000009146672,0.000038913997,0.0000125266915,0.000008029168,0.000011543516,0.15812334,0.0004300244,0.8413529],"study_design_scores_gemma":[0.00006548958,0.000022592123,0.000019049028,0.00004609993,0.000009815483,0.000024443427,2.2839723e-7,0.000037293197,0.000036856083,0.21901411,0.7804644,0.00025960495],"about_ca_topic_score_codex":2.4706017e-7,"about_ca_topic_score_gemma":0.000005292655,"teacher_disagreement_score":0.84109324,"about_ca_system_score_codex":0.0000695524,"about_ca_system_score_gemma":0.000057515408,"threshold_uncertainty_score":0.99996483},"labels":[],"label_agreement":null},{"id":"W4250477728","doi":"10.24124/2012/bpgub847","title":"The Residual Character of Finitely Generated Varieties of Unary Algebras and Groupoids, and Applications to the Restricted Quackenbush Problem.","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; University of Northern British Columbia; Library and Archives Canada","funders":"","keywords":"Unary operation; Idempotence; Mathematics; Class (philosophy); Identity (music); Pure mathematics; Type (biology); Integer (computer science); Character (mathematics); Finitely-generated abelian group; Discrete mathematics; Algebra over a field; Combinatorics; Computer science","score_opus":0.015267241844522288,"score_gpt":0.25081360055984014,"score_spread":0.23554635871531784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250477728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.799684,0.026635945,0.14701079,0.005701291,0.0010161239,0.0072241183,0.00015379168,0.0004169928,0.012156984],"genre_scores_gemma":[0.9648096,0.0027290976,0.020955682,0.00045386018,0.0003784873,0.0007919258,0.0005729894,0.000053839536,0.009254524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99868774,0.00009866458,0.0004235491,0.00032261937,0.00024677182,0.00022065296],"domain_scores_gemma":[0.9983736,0.00038317865,0.00032545047,0.00054617727,0.00030096833,0.00007061071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023727222,0.00020204973,0.0002402816,0.00010037295,0.00028453543,0.000063472384,0.00061047415,0.00014363477,0.000006267683],"category_scores_gemma":[0.00004845593,0.00011155099,0.000028808752,0.0006175974,0.000104532985,0.00020567521,0.00015225426,0.00020146895,0.0000035910555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095713265,0.00010962525,0.0005397967,0.0001894544,0.00010854965,7.5723295e-7,0.004885064,0.000025540987,0.0070443,0.921985,0.002357082,0.06265915],"study_design_scores_gemma":[0.0010401646,0.0009421691,0.71861255,0.00021789619,0.0002776739,0.000036963407,0.0036026211,0.0011480992,0.02063444,0.18938376,0.06257463,0.0015290199],"about_ca_topic_score_codex":0.00007361542,"about_ca_topic_score_gemma":0.00020220336,"teacher_disagreement_score":0.7326012,"about_ca_system_score_codex":0.0000071771283,"about_ca_system_score_gemma":0.0000899352,"threshold_uncertainty_score":0.45489174},"labels":[],"label_agreement":null},{"id":"W4251449028","doi":"10.1090/fic/039/07","title":"Vertex (operator) algebras are “algebras” of vertex operators","year":2003,"lang":"en","type":"other","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Vertex (graph theory); Mathematics; Operator (biology); Vertex operator algebra; Operator algebra; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Jordan algebra; Chemistry; Algebra representation; Graph","score_opus":0.010731385995807401,"score_gpt":0.2297011573693449,"score_spread":0.21896977137353751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251449028","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021666472,0.0038971803,0.08881009,0.0002574317,0.0024871884,0.00059350254,0.000028299808,0.00092050864,0.9027891],"genre_scores_gemma":[0.012667323,0.0005705743,0.044718925,0.005037324,0.00019470016,0.00006261119,0.000024777328,0.0007075024,0.93601626],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99718314,0.00013428282,0.0004998403,0.0010395286,0.00053958193,0.00060359243],"domain_scores_gemma":[0.9976104,0.0000647827,0.0003521244,0.0016181422,0.00010154358,0.00025301377],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014159107,0.0006414578,0.0008884241,0.00039121418,0.00008596496,0.00010562065,0.0018972779,0.00048593697,0.0045909886],"category_scores_gemma":[0.00007403482,0.00051983073,0.00022083038,0.0007784338,0.00014517824,0.00029323835,0.00034623596,0.00035255073,0.0009711089],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019303193,0.00010535035,0.00021884068,0.00006689142,0.00008754198,0.000042132884,0.000041464104,0.000009251432,0.00009146545,0.3336854,0.6626807,0.0029690482],"study_design_scores_gemma":[0.0009564443,0.00019572716,0.00021539158,0.00035565483,0.000040636438,0.00003414721,0.00007400875,0.00049895694,0.0028446491,0.0092676375,0.9840503,0.0014664916],"about_ca_topic_score_codex":0.00005847767,"about_ca_topic_score_gemma":0.00008497619,"teacher_disagreement_score":0.32441777,"about_ca_system_score_codex":0.00006077002,"about_ca_system_score_gemma":0.00021503355,"threshold_uncertainty_score":0.99980676},"labels":[],"label_agreement":null},{"id":"W4252525006","doi":"10.24124/2016/bpgub1122","title":"Tangling in dualisability of unary algebras","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; University of Northern British Columbia","keywords":"Unary operation; Join (topology); Extension (predicate logic); Mathematics; Bounded function; Row; Pure mathematics; Interior algebra; Jordan algebra; Algebra over a field; Discrete mathematics; Combinatorics; Algebra representation; Computer science","score_opus":0.01167083968769643,"score_gpt":0.2712436174716014,"score_spread":0.259572777783905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252525006","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75380945,0.0008673222,0.09916497,0.0002714445,0.0018254985,0.0004978472,0.000007582395,0.0002695393,0.14328635],"genre_scores_gemma":[0.98220074,0.00003820508,0.012691247,0.00006896378,0.000049247326,0.000016670198,0.000031354557,0.000011927078,0.0048916163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988071,0.00004843772,0.00036518165,0.0003941653,0.0001976976,0.00018742256],"domain_scores_gemma":[0.99907815,0.00016039333,0.00016260071,0.00048922753,0.00007209713,0.00003751278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019222921,0.0001536163,0.00027500026,0.00013115967,0.000023853174,0.00001280608,0.0006118462,0.00015604933,0.000092412374],"category_scores_gemma":[0.00009305246,0.00011026724,0.00007550159,0.0002696636,0.00002471077,0.0002848343,0.000061943414,0.00013040983,0.00002348697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040835796,0.00021161987,0.0046156757,0.0003157348,0.00002206013,0.00003369437,0.0021024216,0.000023470357,0.0044056685,0.84184366,0.0001606534,0.14622448],"study_design_scores_gemma":[0.00067979156,0.00014715816,0.043229762,0.0004912311,0.000009628779,0.0000046104265,0.00054115633,0.00068683946,0.04499469,0.9079432,0.0004983305,0.00077360566],"about_ca_topic_score_codex":0.000027387334,"about_ca_topic_score_gemma":0.00015267107,"teacher_disagreement_score":0.22839132,"about_ca_system_score_codex":0.000039629078,"about_ca_system_score_gemma":0.00008917878,"threshold_uncertainty_score":0.44965675},"labels":[],"label_agreement":null},{"id":"W4253318164","doi":"10.1090/crmm/016/05","title":"Propagator bounds","year":2002,"lang":"en","type":"book-chapter","venue":"CRM monograph series","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mathematics; Physics","score_opus":0.018464000121641563,"score_gpt":0.20084760119717598,"score_spread":0.18238360107553442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253318164","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047437,0.0039814943,0.026250344,0.00046668915,0.0010313804,0.0003392385,0.00001364427,0.00083933433,0.96703047],"genre_scores_gemma":[0.007229686,0.0026074746,0.025212543,0.00077751005,0.00053684856,0.00007390659,0.000027564227,0.00011729243,0.9634172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829143,0.000011392741,0.00032409126,0.00067454,0.0003118571,0.000386695],"domain_scores_gemma":[0.9984859,0.000026926888,0.0002167647,0.0010212846,0.000093674964,0.00015541245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006244046,0.000468379,0.00041872254,0.0002863441,0.00026628698,0.00028575544,0.0010697021,0.00029955027,0.00023008697],"category_scores_gemma":[0.000007707857,0.00041635387,0.00028134888,0.00012686155,0.00034515958,0.00078456115,0.0003156593,0.0003866667,0.0002896136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004244882,0.000010477911,0.000017315353,0.000030289828,0.000037592778,0.00007014183,0.0001782283,0.0000018382013,0.000007868814,0.9814754,0.0024440074,0.01572261],"study_design_scores_gemma":[0.00007809142,0.00014436961,0.000030055147,0.000054405602,0.000013179378,0.000043440457,0.000005258943,0.0000351111,0.00007242761,0.4383596,0.5607251,0.0004390023],"about_ca_topic_score_codex":0.0000010637175,"about_ca_topic_score_gemma":0.000003417494,"teacher_disagreement_score":0.55828106,"about_ca_system_score_codex":0.000026956148,"about_ca_system_score_gemma":0.00004195312,"threshold_uncertainty_score":0.9998288},"labels":[],"label_agreement":null},{"id":"W4253451947","doi":"10.1007/978-0-387-39940-9_3126","title":"Multiset Semantics","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiset; Semantics (computer science); Computer science; Mathematics; Programming language; Discrete mathematics","score_opus":0.016113344723274123,"score_gpt":0.23593552894671052,"score_spread":0.2198221842234364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253451947","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008418836,0.0049421866,0.14792523,0.00007814299,0.0022766686,0.00062824273,0.0006847859,0.00024444936,0.8432119],"genre_scores_gemma":[0.0018441876,0.008087081,0.041977916,0.00016919318,0.0015002226,0.000025563502,0.0009618698,0.00010660696,0.94532734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974756,0.000038682345,0.00076986005,0.00073228776,0.00063281064,0.0003507228],"domain_scores_gemma":[0.9969773,0.00014934523,0.00065080606,0.0019026416,0.00014398713,0.00017586847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002543997,0.00047076173,0.00075191894,0.00023287655,0.000071930976,0.000048939855,0.0013964578,0.00025836108,0.000044449655],"category_scores_gemma":[0.000043417138,0.00042752727,0.00016748904,0.00006717179,0.00007480504,0.00048122398,0.00041410368,0.00039483517,0.00039114675],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004277318,0.000041709507,0.000011049935,0.00034596087,0.000053262913,0.0002681193,0.000119231605,0.00008181383,0.000029244808,0.9572679,0.017756805,0.024020629],"study_design_scores_gemma":[0.00027831015,0.00010701245,0.00001414143,0.00064228364,0.00004079863,0.00006460643,0.000008210006,0.001459441,0.000018931023,0.007485732,0.9892672,0.0006133511],"about_ca_topic_score_codex":0.000023123803,"about_ca_topic_score_gemma":0.000008327657,"teacher_disagreement_score":0.97151035,"about_ca_system_score_codex":0.00004621097,"about_ca_system_score_gemma":0.00013556336,"threshold_uncertainty_score":0.99981767},"labels":[],"label_agreement":null},{"id":"W4253523731","doi":"10.1007/978-3-319-06413-0_5","title":"Sectionally Complemented Lattices","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Lattice (music); Distributive lattice; Congruence (geometry); Distributive property; Pure mathematics; Congruence lattice problem; Mathematics; Complete lattice; Physics; Condensed matter physics; Geometry; Universality (dynamical systems)","score_opus":0.02669570167862003,"score_gpt":0.24460770577595922,"score_spread":0.21791200409733918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253523731","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.6844454e-7,0.000041246403,0.472758,0.0002408929,0.00020946159,0.000052225885,0.0000016115454,0.00016705728,0.526529],"genre_scores_gemma":[0.0015384533,0.00001857161,0.03548816,0.0017339416,0.00023007546,0.0000036142012,0.000019875572,0.000015971984,0.9609513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990053,0.000007835819,0.00019518097,0.00038241033,0.00025006087,0.00015921594],"domain_scores_gemma":[0.99922186,0.000081152335,0.00012742737,0.0004298441,0.000075632226,0.00006406089],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000078363526,0.00019545494,0.00019775165,0.00008392366,0.00008937173,0.00006818265,0.00064377644,0.000095616146,0.0013798283],"category_scores_gemma":[0.0000042565616,0.00016133394,0.00008674184,0.00002086434,0.000034152727,0.00010703166,0.00024477512,0.00016712345,0.0008870724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.95182e-7,0.0000025539102,0.000002079795,0.0000064098926,0.000018343311,0.0000041661447,0.0000074944473,0.00001216136,0.0000036629663,0.9840366,0.0037195005,0.0121864015],"study_design_scores_gemma":[0.00007920762,0.000035103112,0.000020831496,0.0000141621995,0.0000044830076,0.000009180132,4.3004346e-7,0.0019439347,0.000006947815,0.33912528,0.6585827,0.0001777479],"about_ca_topic_score_codex":0.0000022431789,"about_ca_topic_score_gemma":0.000026259202,"teacher_disagreement_score":0.6548632,"about_ca_system_score_codex":0.000024712333,"about_ca_system_score_gemma":0.000028832628,"threshold_uncertainty_score":0.99989086},"labels":[],"label_agreement":null},{"id":"W4254862279","doi":"10.1007/s100120170039","title":"Fundamental-M-Solid and Fundamental-M-Closed Varieties","year":2001,"lang":"en","type":"article","venue":"Southeast Asian Bulletin of Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.013804886988995525,"score_gpt":0.23521507433715874,"score_spread":0.22141018734816323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254862279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22297522,0.0010756035,0.6120862,0.015933333,0.00062727655,0.00121636,0.00003228396,0.00074912864,0.14530464],"genre_scores_gemma":[0.8954701,0.00003211723,0.10242348,0.00019663018,0.00004689208,0.000012626405,0.0000022925933,0.000022393238,0.0017934816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984835,0.000046933354,0.00043622984,0.0003342447,0.00034617705,0.00035293534],"domain_scores_gemma":[0.99891734,0.00009165404,0.00024540507,0.000552021,0.000052087405,0.00014150339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026475612,0.00024067976,0.00036390728,0.0000910211,0.00014768522,0.00010409987,0.00055357063,0.00008045092,0.00033202747],"category_scores_gemma":[0.000047700727,0.00021042443,0.0001118775,0.00017478618,0.00023108283,0.00007729555,0.00031283876,0.00014053618,0.00019810922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040412568,0.0012720674,0.0027560028,0.0005575502,0.0001823563,0.00009572768,0.025794813,0.000051185292,0.0011370903,0.9391404,0.001798315,0.027174123],"study_design_scores_gemma":[0.0047369883,0.0014067157,0.0065914714,0.00072508527,0.00016512854,0.0014159315,0.06283604,0.009996343,0.002257753,0.76814955,0.13939159,0.002327416],"about_ca_topic_score_codex":0.000004268344,"about_ca_topic_score_gemma":0.0000014726271,"teacher_disagreement_score":0.6724949,"about_ca_system_score_codex":0.000022597756,"about_ca_system_score_gemma":0.000022617683,"threshold_uncertainty_score":0.85808593},"labels":[],"label_agreement":null},{"id":"W4255449976","doi":"10.1007/978-94-007-0753-5_101994","title":"Inductive Logic","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Northern British Columbia","funders":"","keywords":"Computer science","score_opus":0.027337988913720777,"score_gpt":0.23297108853253268,"score_spread":0.2056330996188119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255449976","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9421479e-7,0.000053734482,0.48518625,0.0001943968,0.00020645234,0.000051270275,3.4677007e-7,0.00014139245,0.514166],"genre_scores_gemma":[0.001136313,0.000026441505,0.062247,0.0019170824,0.0002246111,0.000003435516,0.0000026933674,0.000015694848,0.9344267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989954,0.000007988567,0.00015412155,0.00047974478,0.00018292299,0.00017977157],"domain_scores_gemma":[0.99907273,0.00005481198,0.00011325836,0.00062736595,0.00005906394,0.00007274855],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006136773,0.00023044998,0.00024648622,0.0000838735,0.00005432851,0.00004540423,0.0008116563,0.00021761091,0.00030612957],"category_scores_gemma":[0.000008720085,0.00017306046,0.00009622998,0.000021950822,0.00005825076,0.00011557906,0.00032663447,0.0002793417,0.0017692177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.6267704e-7,0.0000017376616,1.7621439e-7,0.0000026509479,0.000008055897,0.000010877148,0.00001496134,0.0000024938438,0.0000019412,0.95564353,0.0014177938,0.042895403],"study_design_scores_gemma":[0.000040151695,0.00004825159,0.0000032088647,0.000009157019,0.0000027921244,0.000008546301,5.455304e-7,0.000112889706,0.000012153747,0.6997753,0.29979563,0.00019142489],"about_ca_topic_score_codex":0.0000013215815,"about_ca_topic_score_gemma":0.0000025124316,"teacher_disagreement_score":0.42293924,"about_ca_system_score_codex":0.000031738906,"about_ca_system_score_gemma":0.000030630563,"threshold_uncertainty_score":0.999008},"labels":[],"label_agreement":null},{"id":"W4256149167","doi":"10.1007/978-0-387-68276-1_1","title":"Introduction","year":2010,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Appeal; Variety (cybernetics); State (computer science); Mathematics; Computer science; Epistemology; Mathematical economics; Artificial intelligence; Philosophy; Political science; Algorithm; Law","score_opus":0.01132218127831745,"score_gpt":0.23281011774641122,"score_spread":0.22148793646809378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256149167","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000057040606,0.00016651541,0.86850977,0.0005220157,0.003552828,0.00014153143,0.000050851653,0.00014835242,0.12690242],"genre_scores_gemma":[0.00017726596,0.00030997206,0.67459923,0.00010406171,0.0010598672,0.000008157087,0.000031725143,0.000038447968,0.32367125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875027,0.000008276489,0.0002978808,0.00048689253,0.00022128031,0.00023538005],"domain_scores_gemma":[0.9989114,0.00005268729,0.00015976181,0.00073534955,0.00008365036,0.00005716491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001028255,0.0002513395,0.0002674799,0.00013635353,0.00006932805,0.00007859542,0.00055231,0.00023191837,0.00032540012],"category_scores_gemma":[0.000069459675,0.0002604068,0.000031799507,0.00004507093,0.00016356465,0.0002793088,0.0003116385,0.0007314667,0.00021675498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003804951,0.000005141961,0.0000048935913,0.00002260563,0.0000057812226,0.000065397486,0.00008657311,0.000011619871,0.000049070102,0.9714871,0.0011782614,0.027079754],"study_design_scores_gemma":[0.000047034795,0.00003603032,0.000057403635,0.000011888063,0.0000036028318,0.000017665505,0.0000015363942,0.00005356962,0.00009424646,0.4915811,0.5078895,0.00020638786],"about_ca_topic_score_codex":0.000002490079,"about_ca_topic_score_gemma":0.000091150265,"teacher_disagreement_score":0.50671124,"about_ca_system_score_codex":0.00005818891,"about_ca_system_score_gemma":0.000063264415,"threshold_uncertainty_score":0.9999848},"labels":[],"label_agreement":null},{"id":"W4280590593","doi":"10.1090/btran/120","title":"Correction to “A finite basis theorem for difference-term varieties with a finite residual bound”","year":2022,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society Series B","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lemma (botany); Residual; Term (time); Pure mathematics; Discrete mathematics; Algorithm","score_opus":0.013086056724866893,"score_gpt":0.2361237937205557,"score_spread":0.2230377369956888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280590593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025263397,0.000008436665,0.9708972,0.0028455395,0.00021243852,0.00039973372,0.000037718637,0.00011272645,0.00022278597],"genre_scores_gemma":[0.8772485,0.0000097466,0.11907779,0.00078924437,0.000023755325,0.00042306003,0.000001941448,0.000019803136,0.002406111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987378,0.00009379191,0.00024689443,0.00028585162,0.00036038595,0.00027527433],"domain_scores_gemma":[0.9981129,0.0009939319,0.00018757439,0.0005643149,0.00007230366,0.00006897168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019166953,0.00016968606,0.00031132612,0.000030886706,0.0008774969,0.000062307576,0.0007831265,0.000016945594,0.00007919027],"category_scores_gemma":[0.00006585216,0.00011519772,0.00026911538,0.0007944568,0.0005205068,0.00018288108,0.00009740075,0.0002342065,0.000002364394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022257578,0.0027767057,0.0005437527,0.0007260323,0.0013593144,0.000004786495,0.1118533,0.19860305,0.0064968453,0.5735971,0.006078526,0.09573488],"study_design_scores_gemma":[0.0016026575,0.009400789,0.0054215216,0.00017140839,0.0004320654,0.00017350055,0.034638952,0.14821549,0.012629247,0.7816761,0.0040189642,0.0016192908],"about_ca_topic_score_codex":0.000018789715,"about_ca_topic_score_gemma":0.000010167062,"teacher_disagreement_score":0.85198516,"about_ca_system_score_codex":0.000069093694,"about_ca_system_score_gemma":0.000080491154,"threshold_uncertainty_score":0.6749086},"labels":[],"label_agreement":null},{"id":"W4282984102","doi":"10.28924/2291-8639-20-2022-31","title":"A Brief Note On QS/BP/BOI-Algebras","year":2022,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.008958509346104713,"score_gpt":0.2800063863828852,"score_spread":0.2710478770367805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282984102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016909963,0.00015011277,0.97701263,0.004565299,0.00011458219,0.000052454398,0.000013745603,0.000015305108,0.0011659104],"genre_scores_gemma":[0.9891086,0.00006795569,0.009005996,0.001438778,0.00016905584,0.000023011784,0.0000075705816,0.0000034250854,0.0001755562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889374,0.000039878953,0.00030449653,0.00017359071,0.0005020903,0.00008622617],"domain_scores_gemma":[0.99908715,0.00012642927,0.00032096702,0.00019199871,0.00020184559,0.000071625305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023373758,0.00007222756,0.00015041421,0.00044163445,0.00018840065,0.000100322686,0.0008807777,0.000013702936,0.00010144141],"category_scores_gemma":[0.000019494762,0.00006299637,0.00018267658,0.0007090146,0.000026718773,0.0001885154,0.00020624265,0.00018136828,0.0000056696113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026100228,0.00036840382,0.0020562408,0.0000011594742,0.00092862296,0.00003974369,0.00029505332,0.018931622,0.0009350795,0.81817025,0.0008157448,0.157432],"study_design_scores_gemma":[0.0016651122,0.0006006671,0.044098597,0.000018282291,0.0006604819,0.0005340509,0.00032540024,0.04980667,0.0014783137,0.28480443,0.6153935,0.00061445753],"about_ca_topic_score_codex":0.000008413112,"about_ca_topic_score_gemma":0.000004139492,"teacher_disagreement_score":0.97219867,"about_ca_system_score_codex":0.000062778396,"about_ca_system_score_gemma":0.000041907435,"threshold_uncertainty_score":0.25689176},"labels":[],"label_agreement":null},{"id":"W4285069200","doi":"10.48550/arxiv.1905.04827","title":"Satisfiability Threshold for Power Law Random 2-SAT in Configuration\\n Model","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Combinatorics; Random variable; Discrete mathematics; Boolean satisfiability problem; Variable (mathematics); Statistics; Mathematical analysis","score_opus":0.06543176490417776,"score_gpt":0.20304491327186025,"score_spread":0.1376131483676825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285069200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13512088,0.000032431886,0.8563004,0.00010871702,0.0004057527,0.0009299738,0.000027169188,0.00012275075,0.006951915],"genre_scores_gemma":[0.9934404,0.000018948327,0.0053177467,0.00032063533,0.000021314412,0.00000545979,0.000026850916,0.000014094356,0.0008345404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980257,0.00007326699,0.00026341062,0.001187638,0.00008594178,0.00036400525],"domain_scores_gemma":[0.9980028,0.00024671303,0.00019737278,0.00130142,0.00015331859,0.00009835225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033360493,0.00030022903,0.00044902193,0.00014448198,0.00010507578,0.00009260638,0.0013006722,0.00030772132,0.000017651584],"category_scores_gemma":[0.000038399845,0.0003231551,0.00023202003,0.00026197446,0.00012009146,0.0005523014,0.0008009711,0.0004457078,0.000042641386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054387445,0.000037840284,0.0009034827,0.000030684372,0.000010953528,0.00001018324,0.000100861536,0.4921949,0.000026395917,0.50656116,0.000028639279,0.00004051868],"study_design_scores_gemma":[0.0012135466,0.000026154197,0.00030753113,0.000023444281,0.0000101078185,4.2933183e-7,0.000013730758,0.56882805,0.000119745724,0.42914996,0.000062871164,0.0002444083],"about_ca_topic_score_codex":0.000053131167,"about_ca_topic_score_gemma":0.00016988727,"teacher_disagreement_score":0.8583195,"about_ca_system_score_codex":0.0002278552,"about_ca_system_score_gemma":0.00020752416,"threshold_uncertainty_score":0.99992204},"labels":[],"label_agreement":null},{"id":"W4287825451","doi":"10.5281/zenodo.3716238","title":"Truncations of W\\infinity Algebras","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Infinity; Mathematics; Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.05381737021815698,"score_gpt":0.24545473109729785,"score_spread":0.19163736087914085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287825451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009883082,0.000077732286,0.8304521,0.006867919,0.00008029691,0.00029892224,0.000056543016,0.001294895,0.15098853],"genre_scores_gemma":[0.9912653,0.000027127522,0.0073538064,0.0006502791,0.000079035606,1.8005585e-8,0.00014628447,0.0003003148,0.00017783778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893814,0.00014251166,0.00019217675,0.00030123506,0.00023412607,0.00019182592],"domain_scores_gemma":[0.99903,0.0000204601,0.00009227323,0.0003921446,0.0003046494,0.0001604531],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020088759,0.00008084082,0.00010862341,0.00007671183,0.0007595358,0.00021668362,0.0014745741,0.000029896291,0.0020593945],"category_scores_gemma":[0.000565052,0.00008246965,0.000042115946,0.00073789025,0.00009298525,0.00036548811,0.0010614397,0.0001439741,0.0027996139],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021206273,0.00014587147,0.0000061097503,0.000059737402,0.00003016683,0.000009405599,0.0037707505,0.0004140154,0.010903943,0.7325849,0.06427256,0.18778136],"study_design_scores_gemma":[0.00030117168,0.00026061843,0.00070251775,0.000007891339,0.00000479911,0.00001762651,0.00011567576,0.0047143656,0.0020609596,0.004908102,0.98676574,0.0001405192],"about_ca_topic_score_codex":0.0000020958078,"about_ca_topic_score_gemma":3.63041e-8,"teacher_disagreement_score":0.9813822,"about_ca_system_score_codex":0.000025711397,"about_ca_system_score_gemma":0.000004028637,"threshold_uncertainty_score":0.99885285},"labels":[],"label_agreement":null},{"id":"W4292002227","doi":"10.3217/jucs-008-07-0722","title":"Heyting Algebras and Formal Languages","year":2020,"lang":"en","type":"article","venue":"TUGraz OPEN Library (Graz University of Technology)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Heyting algebra; Linguistics; Programming language; Computer science; Mathematics; Philosophy; Algebra over a field; Pure mathematics","score_opus":0.010482936907125874,"score_gpt":0.19961700941885996,"score_spread":0.18913407251173409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292002227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7787861,0.0011730846,0.11017494,0.06000318,0.00007326069,0.000697747,0.000021883548,0.0020612178,0.047008548],"genre_scores_gemma":[0.8507707,0.00008144803,0.14806184,0.00062901265,0.00001095199,2.743403e-7,0.0000038837193,0.0000074820064,0.0004343702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992022,0.000018105562,0.000104989274,0.0003527599,0.000082820545,0.00023911594],"domain_scores_gemma":[0.9994436,0.00002468003,0.00010672376,0.00031159737,0.000014001001,0.000099416306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043013253,0.00011971822,0.00022454948,0.00014337072,0.00019205808,0.00006460177,0.002324898,0.000109998015,0.00006858461],"category_scores_gemma":[0.000018467283,0.00012615102,0.000040179224,0.0007153796,0.00020917124,0.0034748095,0.0038890052,0.00018885077,0.000021539867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043132484,0.00004521968,0.015210642,0.000041506963,0.000042028063,0.00024125916,0.0009198892,0.000010641074,0.0018074795,0.8145268,0.002010111,0.16510129],"study_design_scores_gemma":[0.01063432,0.00381184,0.04646554,0.000384254,0.00015189721,0.00032386152,0.03554499,0.023500225,0.095659934,0.33072916,0.44926652,0.0035274653],"about_ca_topic_score_codex":0.000012772872,"about_ca_topic_score_gemma":0.0000020951682,"teacher_disagreement_score":0.48379764,"about_ca_system_score_codex":0.0000047670305,"about_ca_system_score_gemma":0.000037743408,"threshold_uncertainty_score":0.5144289},"labels":[],"label_agreement":null},{"id":"W4297662382","doi":"10.1017/9781108775267.008","title":"First-order logic and automatic sequences","year":2022,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Section (typography); Order (exchange); Basis (linear algebra); Computer science; Epistemology; Mathematics; Philosophy; Geometry","score_opus":0.023100140351091484,"score_gpt":0.20102420468921067,"score_spread":0.1779240643381192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297662382","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005040979,0.00043917238,0.037215564,0.00010879685,0.00025565154,0.00030764184,0.00003746925,0.00037811842,0.96120715],"genre_scores_gemma":[0.0012009365,0.00025418345,0.0059682094,0.00024479558,0.000042217234,0.0000018570781,0.000010544274,0.000021080377,0.99225616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853516,0.000040591232,0.00015726159,0.00068790826,0.00029457043,0.00028449984],"domain_scores_gemma":[0.9988228,0.00012377936,0.00020652627,0.0006307269,0.00007095878,0.00014517494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008604854,0.00033525936,0.0003508421,0.00016676303,0.00052736973,0.000084666186,0.0011496046,0.00016772178,0.000025046507],"category_scores_gemma":[0.000010085592,0.00036000446,0.00010282502,0.000021195068,0.00024589951,0.00028498532,0.0014739366,0.0004289227,0.000010477737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037716409,0.0000046413406,0.0000017499904,0.000061521205,0.00003980489,0.00049557845,0.00007123549,0.000037795475,0.0000027856383,0.99570143,0.0015000699,0.002079585],"study_design_scores_gemma":[0.00030663583,0.000111547466,0.000026773263,0.00006237625,0.000053844993,0.00009237817,0.000022489896,0.0047028447,0.00000941303,0.002128143,0.9919282,0.0005553566],"about_ca_topic_score_codex":0.000048944356,"about_ca_topic_score_gemma":0.000002611176,"teacher_disagreement_score":0.9935733,"about_ca_system_score_codex":0.00014657991,"about_ca_system_score_gemma":0.000099028344,"threshold_uncertainty_score":0.9998852},"labels":[],"label_agreement":null},{"id":"W4297909082","doi":"","title":"A characterization of well-founded algebraic lattices","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Semilattice; Join (topology); Characterization (materials science); Algebraic number; Lattice (music); Algebraic properties; Mathematics; Algebra over a field; Pure mathematics; Discrete mathematics; Combinatorics; Physics; Mathematical analysis","score_opus":0.015001572172238159,"score_gpt":0.23255435480859704,"score_spread":0.21755278263635888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297909082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23653609,0.00020303074,0.74031496,0.0028732591,0.00039148316,0.00034082693,0.000018843346,0.00029531773,0.019026179],"genre_scores_gemma":[0.88553035,0.00030421064,0.11029483,0.00015304623,0.000046575613,0.00004832316,0.00029081045,0.00003300947,0.0032988684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9949087,0.002750645,0.0006212835,0.0009023257,0.00047035818,0.0003466703],"domain_scores_gemma":[0.9934628,0.00070372195,0.0009839429,0.002750169,0.0019547066,0.00014465251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028359052,0.00033486364,0.00043310158,0.00023553256,0.00023870348,0.0003725154,0.00275931,0.0003070992,0.00013196589],"category_scores_gemma":[0.00058664376,0.00034274303,0.00019338966,0.0005391134,0.0002934763,0.00043348732,0.0024577505,0.00045569672,0.00009553121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014447935,0.0008350483,0.001580439,0.00043495605,0.00013807615,0.000007650984,0.012570054,0.000034547505,0.052350596,0.86579376,0.00023672201,0.066003695],"study_design_scores_gemma":[0.0013776071,0.0000048326324,0.024375316,0.0041400087,0.000111770765,0.000031055515,0.00008365436,0.09456719,0.5907536,0.26225704,0.020431329,0.0018665596],"about_ca_topic_score_codex":0.00011425616,"about_ca_topic_score_gemma":0.00015969275,"teacher_disagreement_score":0.64899427,"about_ca_system_score_codex":0.00006716174,"about_ca_system_score_gemma":0.00025149228,"threshold_uncertainty_score":0.9999025},"labels":[],"label_agreement":null},{"id":"W4298786553","doi":"","title":"Characterizations of Total Dual Integrality","year":2007,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dual (grammatical number); Computer science","score_opus":0.016821647514515023,"score_gpt":0.24327023147712476,"score_spread":0.22644858396260975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298786553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09845549,0.00025058884,0.8690403,0.0027117936,0.00024778725,0.00026574495,0.000029664594,0.0002593004,0.028739333],"genre_scores_gemma":[0.85692096,0.0001009988,0.13943829,0.000091272486,0.000025115476,0.000025035015,0.00024437116,0.00002062159,0.0031333652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958887,0.0019562044,0.0006460925,0.0007438096,0.00042803984,0.00033713365],"domain_scores_gemma":[0.99404633,0.00085486507,0.0006658361,0.0024807362,0.0017909287,0.0001613154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030066771,0.0002907449,0.00039222388,0.00023034262,0.0001735853,0.00022621131,0.0015669788,0.0002629569,0.00006387915],"category_scores_gemma":[0.00093006925,0.00029642624,0.00022193784,0.0005564315,0.00024304219,0.00029061027,0.0025320607,0.0005962629,0.00002279921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005805121,0.000835783,0.0008422239,0.00013449437,0.000059534726,0.000009034403,0.0067226565,0.000096570526,0.00959124,0.8970396,0.0002044279,0.084458664],"study_design_scores_gemma":[0.0016733764,0.0000042441916,0.08896115,0.0042792517,0.00011653978,0.00012472077,0.00028134917,0.078217395,0.64402276,0.16448534,0.0150789665,0.0027548918],"about_ca_topic_score_codex":0.0002199689,"about_ca_topic_score_gemma":0.00017800092,"teacher_disagreement_score":0.75846547,"about_ca_system_score_codex":0.000084321626,"about_ca_system_score_gemma":0.00021163968,"threshold_uncertainty_score":0.9999488},"labels":[],"label_agreement":null},{"id":"W4299292081","doi":"10.1007/978-3-030-98088-7","title":"A Primer of Subquasivariety Lattices","year":2022,"lang":"es","type":"book","venue":"CMS/CAIMS books in mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Primer (cosmetics); Philosophy; Mathematics; Theoretical physics; Pure mathematics; Calculus (dental); Algebra over a field; Physics; Thermodynamics; Medicine; Orthodontics","score_opus":0.03191796594626881,"score_gpt":0.2741224773006691,"score_spread":0.24220451135440027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299292081","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069551165,0.006470549,0.17301534,0.00040148653,0.0028075215,0.003526253,0.00018144044,0.0005026054,0.8061397],"genre_scores_gemma":[0.046030555,0.0017125723,0.43771818,0.00092959293,0.0007079528,0.0004886159,0.00012618223,0.00052080007,0.51176554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948481,0.00020779601,0.001828052,0.0010519397,0.0012585329,0.0008055851],"domain_scores_gemma":[0.9943594,0.0013937663,0.0017056987,0.0021857661,0.00018479102,0.0001705975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011733758,0.00083723234,0.0016366452,0.00048168018,0.00024106742,0.00016430362,0.0030495385,0.0004607962,0.0006786586],"category_scores_gemma":[0.00029812384,0.0008094144,0.0005724642,0.0005015509,0.00055445253,0.00040979698,0.0019215035,0.0013710896,0.00011842794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015340993,0.0006378102,0.00019920709,0.0025892246,0.00016371935,0.00014042921,0.00788581,0.00034356222,0.00012518786,0.9821631,0.0014462508,0.004290376],"study_design_scores_gemma":[0.00090440136,0.00049563835,0.00018561438,0.0015711355,0.00021187008,0.00008881806,0.0006009535,0.0131696705,0.0005516425,0.8963974,0.08440605,0.001416779],"about_ca_topic_score_codex":0.000016393918,"about_ca_topic_score_gemma":0.000009224217,"teacher_disagreement_score":0.29437414,"about_ca_system_score_codex":0.00034016432,"about_ca_system_score_gemma":0.0008130333,"threshold_uncertainty_score":0.99943566},"labels":[],"label_agreement":null},{"id":"W4299474914","doi":"","title":"Syzygies among reduction operators","year":2017,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Reduction (mathematics); Computer science; Mathematics; Geometry","score_opus":0.01594283877920064,"score_gpt":0.2391641724319944,"score_spread":0.22322133365279376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299474914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11002289,0.0012317743,0.82015496,0.0076400987,0.0012555851,0.00048735013,0.000014602783,0.0007700423,0.05842268],"genre_scores_gemma":[0.8689861,0.0005539328,0.11833186,0.000047284368,0.000059074795,0.00008728536,0.00009306867,0.00003439094,0.011806976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99520206,0.0023797662,0.00044274805,0.001127557,0.00043674713,0.00041108907],"domain_scores_gemma":[0.9925199,0.0003450134,0.00067177636,0.004752334,0.0015146381,0.00019631063],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029947702,0.00037999835,0.0003920005,0.00020201267,0.0008872609,0.0015225613,0.004184156,0.0003222502,0.000038171693],"category_scores_gemma":[0.0010428024,0.00038485526,0.00021653352,0.00023314227,0.00040485786,0.00076715654,0.0037410136,0.00078152784,0.000066661705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000540338,0.0004223654,0.0019828656,0.00016581804,0.00010546121,0.000022957238,0.011626399,0.0006444897,0.0019138746,0.8078238,0.002151089,0.17313549],"study_design_scores_gemma":[0.002206462,0.000002925272,0.045188293,0.008841817,0.00016973983,0.0001653831,0.0005510752,0.17002581,0.27846265,0.42506388,0.06436571,0.0049562426],"about_ca_topic_score_codex":0.00054186437,"about_ca_topic_score_gemma":0.00029637435,"teacher_disagreement_score":0.7589632,"about_ca_system_score_codex":0.000108469845,"about_ca_system_score_gemma":0.0002915963,"threshold_uncertainty_score":0.99986035},"labels":[],"label_agreement":null},{"id":"W4299610190","doi":"","title":"On equivalence.","year":2003,"lang":"en","type":"article","venue":"PubMed","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Medicine; Equivalence (formal languages); Discrete mathematics","score_opus":0.025960578959469127,"score_gpt":0.21491179132715485,"score_spread":0.18895121236768572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299610190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035429522,0.0002201938,0.6676815,0.00082230166,0.0011240459,0.00040976773,4.7835005e-7,0.0003618254,0.29395035],"genre_scores_gemma":[0.9937697,0.000004983042,0.0037273818,0.0009167623,0.000017897484,0.00020045163,9.204977e-8,0.0000027593592,0.0013599446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934334,0.000027910824,0.00006182315,0.000187937,0.000117153344,0.00026184003],"domain_scores_gemma":[0.9995559,0.000055446442,0.000020944663,0.00028224036,0.000010826756,0.00007463941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013717441,0.000055930243,0.000052565818,0.000032292697,0.000046267145,0.00003448022,0.00030738526,0.000018771625,0.000013854383],"category_scores_gemma":[0.00012143262,0.000044983153,0.000024825806,0.00017017892,0.00001539445,0.00016598256,0.00003152395,0.000054906388,0.000096190925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.484413e-7,0.000015750358,0.000074851225,8.733471e-7,0.0000012139126,0.000005611055,0.000013816415,0.000033681114,0.0000030897909,0.8577194,0.00035524645,0.14177592],"study_design_scores_gemma":[0.00034701222,0.000040026443,0.04394181,0.0000026796367,0.000001757019,0.00001663933,0.0000056950776,0.00022276372,0.0033859562,0.90909314,0.04269753,0.00024500876],"about_ca_topic_score_codex":2.5131436e-7,"about_ca_topic_score_gemma":1.8263314e-7,"teacher_disagreement_score":0.9583402,"about_ca_system_score_codex":0.00001721411,"about_ca_system_score_gemma":0.000007127882,"threshold_uncertainty_score":0.18343598},"labels":[],"label_agreement":null},{"id":"W4300533436","doi":"","title":"Labelled Calculi for L/ukasiewicz Logics","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Algebra over a field; Calculus (dental); Philosophy; Natural language processing; Mathematics; Pure mathematics; Medicine; Orthodontics","score_opus":0.038325612122102906,"score_gpt":0.29904028941760485,"score_spread":0.26071467729550196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300533436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002856336,0.000568655,0.9779345,0.002368617,0.0008441071,0.00064043957,0.000006991462,0.0005498173,0.01680127],"genre_scores_gemma":[0.044061445,0.00017019389,0.9456746,0.0041939253,0.00034361426,0.0001256621,0.000036218822,0.000017823471,0.0053764936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825233,0.000037294158,0.00030306348,0.00079645833,0.00019774538,0.0004131356],"domain_scores_gemma":[0.99843484,0.00012941204,0.00015065231,0.0010308484,0.0001355637,0.000118670214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021395023,0.00030037118,0.0003914115,0.00007810775,0.00012233226,0.00016423632,0.0016996864,0.000296092,0.000028316808],"category_scores_gemma":[0.0000727505,0.00023572813,0.00022800337,0.00014411614,0.000032257765,0.00013244971,0.0011153389,0.00034386906,0.00006188637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004901685,0.00008322174,0.000008075062,0.000052756925,0.000021490416,0.000012791595,0.00010264182,0.0023217222,0.000046441543,0.91493666,0.0061568413,0.07625247],"study_design_scores_gemma":[0.0003600019,0.00013126162,0.0000939969,0.000030366982,0.000013628782,0.000006890998,0.000006136661,0.042665914,0.0005443297,0.9179554,0.03771076,0.00048133827],"about_ca_topic_score_codex":0.000005715263,"about_ca_topic_score_gemma":0.0000072369203,"teacher_disagreement_score":0.07577113,"about_ca_system_score_codex":0.000053409924,"about_ca_system_score_gemma":0.0001265145,"threshold_uncertainty_score":0.9612714},"labels":[],"label_agreement":null},{"id":"W4301482988","doi":"10.1007/978-3-030-98088-7_1","title":"Introduction","year":2022,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Lattice (music); Mathematics; Algebraic properties; Algebraic number; Bounded function; Algebra over a field; Pure mathematics; Combinatorics; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.021136348596528784,"score_gpt":0.23253420562477345,"score_spread":0.21139785702824465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301482988","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000127973735,0.0006207218,0.121308096,0.00080121914,0.0013455586,0.00045051114,0.000006714893,0.00032539995,0.875129],"genre_scores_gemma":[0.00020784035,0.00022676252,0.104858644,0.0003006849,0.0008020287,0.00006562256,0.000023141249,0.00009538433,0.8934199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788725,0.000021820657,0.00059669546,0.0006619076,0.00050470367,0.000327623],"domain_scores_gemma":[0.9980313,0.00013552759,0.00036970718,0.001339609,0.000050099814,0.000073728566],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003721548,0.00039185488,0.000516276,0.00030048372,0.0001351621,0.000089520305,0.0012204804,0.00020078971,0.0011527891],"category_scores_gemma":[0.00005708319,0.00038935768,0.00019328883,0.00007984131,0.000090669404,0.00028528765,0.0007099721,0.00080553663,0.00034686585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013535438,0.000032390875,4.217339e-7,0.000087163,0.000018154471,0.000057004898,0.0005427771,0.00011858695,0.000012984883,0.9880934,0.004813679,0.006222103],"study_design_scores_gemma":[0.00009597752,0.000044936365,7.7877496e-7,0.000045286662,0.000010750782,0.000050773087,0.000014966725,0.001204045,0.000020750898,0.6239072,0.3743164,0.00028814183],"about_ca_topic_score_codex":0.0000010655193,"about_ca_topic_score_gemma":0.0000039740053,"teacher_disagreement_score":0.36950272,"about_ca_system_score_codex":0.00024833667,"about_ca_system_score_gemma":0.00008468142,"threshold_uncertainty_score":0.9998558},"labels":[],"label_agreement":null},{"id":"W4310375037","doi":"10.70930/tac/pd8uc6bo","title":"Free precategories as presheaf categories","year":2024,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Pure mathematics","score_opus":0.007602279306298289,"score_gpt":0.25160194751121745,"score_spread":0.24399966820491917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310375037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006609329,0.013949623,0.958111,0.00089066196,0.00018362237,0.0003924734,0.000022132339,0.0005691165,0.019272055],"genre_scores_gemma":[0.99324864,0.00042117486,0.0030036785,0.000079321864,0.0001258724,0.0003169944,0.000011428453,0.000014908123,0.0027779755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988797,0.00007028619,0.00026097381,0.00040827855,0.00016465232,0.00021610949],"domain_scores_gemma":[0.9984271,0.0005095659,0.000062710904,0.00083106814,0.00009042263,0.0000791378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040629483,0.00018041229,0.00019880007,0.0001242028,0.00023005623,0.00020424386,0.0008487024,0.00007149721,0.000040637155],"category_scores_gemma":[0.0000693692,0.00014732814,0.00005429472,0.00055941154,0.00053533906,0.0007941521,0.0003383512,0.00013911419,0.000036467904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013630923,0.000023714614,0.0000148522895,0.000093677605,0.000030845593,0.000001873612,0.0015587459,0.000013112253,0.0003882662,0.95230246,0.00024164033,0.045317173],"study_design_scores_gemma":[0.00007399158,0.00006090873,0.00007473277,0.0000100536145,0.000021835971,0.000027934202,0.0005055647,0.00010919938,0.015868424,0.93665886,0.04642541,0.00016310829],"about_ca_topic_score_codex":0.000015379943,"about_ca_topic_score_gemma":0.0000040577515,"teacher_disagreement_score":0.9866393,"about_ca_system_score_codex":0.000011504897,"about_ca_system_score_gemma":0.00010518156,"threshold_uncertainty_score":0.60078675},"labels":[],"label_agreement":null},{"id":"W4310743143","doi":"10.48550/arxiv.2212.00858","title":"Algebras from finite group actions and a question of Eilenberg and Schützenberger","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Corollary; Sigma; Finitely-generated abelian group; Mathematics; Group (periodic table); Algebraic number; Finite set; Algebraic structure; Group action; Set (abstract data type); Finite group; Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Computer science; Physics","score_opus":0.056711907634916736,"score_gpt":0.19748890328201416,"score_spread":0.14077699564709742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310743143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62178,0.00030635676,0.37668434,0.00007078544,0.0003031773,0.0001362357,0.000035870296,0.000106631334,0.0005765928],"genre_scores_gemma":[0.9947652,0.0007872689,0.0039499835,0.00006318291,0.0000339093,0.0000011536016,0.000029174678,0.000010281629,0.0003598155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985979,0.00014661085,0.00015746919,0.0008422679,0.000076408156,0.00017932059],"domain_scores_gemma":[0.9987453,0.00023374334,0.00022400993,0.00063770945,0.000049258222,0.00010997398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012570011,0.00020910088,0.00027098597,0.0002060555,0.00019221801,0.00004895581,0.00053880113,0.00014561132,0.00008048702],"category_scores_gemma":[0.000037429705,0.00024078393,0.00008045461,0.00034564073,0.00013602906,0.00041730783,0.0020712898,0.00045452738,0.00000487632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004145952,0.00012632746,0.0132030435,0.00006701472,0.00013017768,0.00013985032,0.00048941927,0.044044048,0.0002798868,0.93856317,0.000069143294,0.0028464638],"study_design_scores_gemma":[0.00082882063,0.00017187386,0.04386578,0.00011985745,0.00015448661,0.00000802247,0.00027542308,0.21793923,0.00012838634,0.7334189,0.0023526289,0.0007366323],"about_ca_topic_score_codex":0.00033242942,"about_ca_topic_score_gemma":0.00005621918,"teacher_disagreement_score":0.3729852,"about_ca_system_score_codex":0.00006520128,"about_ca_system_score_gemma":0.00005229866,"threshold_uncertainty_score":0.9818884},"labels":[],"label_agreement":null},{"id":"W4312393921","doi":"10.1130/abs/2022am-381160","title":"INTERFACE-COUPLED DISSOLUTION-REPRECIPITATION TEXTURES WITH MAJOR ELEMENT ZONATION PRESERVED IN GRENVILLIAN GARNET","year":2022,"lang":"en","type":"article","venue":"Abstracts with programs - Geological Society of America","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Interface (matter); Dissolution; Geology; Computer science; Parallel computing; Engineering; Chemical engineering","score_opus":0.016785367724842685,"score_gpt":0.25375653180827396,"score_spread":0.23697116408343127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312393921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7710729,0.00025177834,0.22198576,0.004606217,0.000066198176,0.0013084539,0.000004390311,0.000246966,0.00045730753],"genre_scores_gemma":[0.87967813,0.000015778736,0.11940788,0.00034731574,0.000017649494,0.0003485728,0.000056399746,0.0000087115,0.000119578115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9977916,0.0001115814,0.0004220088,0.0005936443,0.0006085462,0.00047263186],"domain_scores_gemma":[0.99884355,0.00014025012,0.00047096112,0.00034742014,0.00010390174,0.00009388813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003305697,0.00022479446,0.0003005431,0.00003937985,0.00023445715,0.000052966396,0.00064813666,0.0000644005,0.00015927783],"category_scores_gemma":[0.000028187187,0.00015598153,0.00009711155,0.00075624435,0.00033930782,0.00036921795,0.0003286597,0.00041597034,0.0000047997096],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007581062,0.005560612,0.108426705,0.00015724465,0.0004170823,0.00005439203,0.011248776,0.52493525,0.0012621385,0.002333722,0.0015627042,0.34328327],"study_design_scores_gemma":[0.0041809604,0.013386214,0.799833,0.00010536553,0.00005521887,0.00003644212,0.006330899,0.14587359,0.00057544204,0.008699581,0.019742519,0.0011807485],"about_ca_topic_score_codex":0.00038923684,"about_ca_topic_score_gemma":0.000055400058,"teacher_disagreement_score":0.6914063,"about_ca_system_score_codex":0.000113518334,"about_ca_system_score_gemma":0.000056999223,"threshold_uncertainty_score":0.63607424},"labels":[],"label_agreement":null},{"id":"W4313359522","doi":"10.1007/978-3-031-21112-6_9","title":"Theories","year":2023,"lang":"en","type":"book-chapter","venue":"Computer science foundations and applied logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Axiom; Epistemology; Philosophy; Set (abstract data type); Set theory; Axiomatic system; Computer science; Linguistics; Mathematics; Programming language","score_opus":0.030312478198718046,"score_gpt":0.2585829433294015,"score_spread":0.22827046513068347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313359522","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012671808,0.00006813783,0.73057723,0.00039626047,0.000781908,0.00022197638,0.0000037844363,0.00048336483,0.26745465],"genre_scores_gemma":[0.065120466,0.0009175173,0.63756114,0.004233535,0.001757936,0.00015426528,0.000085158346,0.00014388056,0.2900261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976043,0.0000065545596,0.0003106131,0.0011498545,0.000484008,0.00044464384],"domain_scores_gemma":[0.9984537,0.00014642737,0.0001896416,0.0008971262,0.00013346113,0.00017969248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043508588,0.00035858047,0.00032911982,0.00041793784,0.0010260327,0.0009447745,0.0017063953,0.00013513696,0.00003557466],"category_scores_gemma":[0.000011953654,0.0002989374,0.00007050083,0.0004321446,0.0012931303,0.00053324946,0.0015312443,0.00029215973,0.0006086786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.631788e-7,0.000005674329,5.044209e-7,0.000007795775,0.000005623203,0.000005252698,0.000087874505,0.000116639756,0.000020422216,0.88701224,0.000108742825,0.11262866],"study_design_scores_gemma":[0.00009750246,0.00006077651,0.000070241374,0.000025736512,0.0000074266204,0.00001977248,0.0000046618443,0.005402573,0.000017484346,0.9723838,0.021514773,0.00039526945],"about_ca_topic_score_codex":6.3403155e-7,"about_ca_topic_score_gemma":0.0000015593373,"teacher_disagreement_score":0.11223339,"about_ca_system_score_codex":0.00005738749,"about_ca_system_score_gemma":0.00021979067,"threshold_uncertainty_score":0.9999463},"labels":[],"label_agreement":null},{"id":"W4313359753","doi":"10.1007/978-3-031-21112-6_8","title":"Proof Systems","year":2023,"lang":"en","type":"book-chapter","venue":"Computer science foundations and applied logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Semantics (computer science); Programming language; Philosophy; Calculus (dental); Medicine","score_opus":0.040927806814035024,"score_gpt":0.25772335780585526,"score_spread":0.21679555099182024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313359753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013656552,0.00013426793,0.80645347,0.00024480617,0.0013682991,0.00050807605,0.000005011082,0.00047358125,0.19079886],"genre_scores_gemma":[0.09969046,0.000626626,0.44883564,0.002387048,0.002906753,0.00047228468,0.0001358401,0.0002240194,0.4447213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971584,0.000008747841,0.00040421396,0.001319595,0.000605698,0.0005033645],"domain_scores_gemma":[0.9982339,0.000120125114,0.00026241146,0.000987765,0.00017397397,0.00022183548],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004940793,0.00039384878,0.00040339524,0.0004970537,0.0009202828,0.0012665094,0.0017871433,0.00016402168,0.000013411464],"category_scores_gemma":[0.00000918425,0.0003329604,0.00006893494,0.000482595,0.00082732,0.0005341827,0.0013777006,0.0003214425,0.00047065126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.02044e-7,0.000008580437,4.6241848e-7,0.000020486983,0.0000072424186,0.000007692838,0.00005569064,0.00076146476,0.000020604672,0.9438422,0.00023961838,0.05503548],"study_design_scores_gemma":[0.00018510023,0.00012106164,0.00005908831,0.00008106727,0.000014089618,0.00005738134,0.000006831004,0.06536604,0.000017573559,0.88895726,0.044439267,0.00069521583],"about_ca_topic_score_codex":0.0000014923287,"about_ca_topic_score_gemma":0.000001395495,"teacher_disagreement_score":0.3576178,"about_ca_system_score_codex":0.000090007175,"about_ca_system_score_gemma":0.00026881203,"threshold_uncertainty_score":0.99991226},"labels":[],"label_agreement":null},{"id":"W4316037523","doi":"10.7151/dmgaa.1410","title":"Using the Swing Lemma and <b><i>C</i><sub>1</sub></b>-diagrams for congruences of planar semimodular lattices","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae - General Algebra and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Mathematics; Lemma (botany); Combinatorics; Planar; Swing; Pure mathematics; Computer science; Physics","score_opus":0.03685826782914222,"score_gpt":0.2909314559572127,"score_spread":0.2540731881280705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316037523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4451699,0.0002717943,0.5524302,0.0013377044,0.000035907025,0.00058467366,0.000019079323,0.00010444907,0.000046308356],"genre_scores_gemma":[0.9508518,0.00019883017,0.04811014,0.00018194759,0.000120375764,0.0004502465,0.000015755779,0.000018726532,0.00005215226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886054,0.000034599554,0.00031623107,0.000360694,0.00017207116,0.00025587037],"domain_scores_gemma":[0.99898404,0.00032046647,0.00017076005,0.0003822764,0.000052836836,0.00008963492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026123875,0.0001671172,0.00023844813,0.00007555358,0.00054538634,0.000106992426,0.00038788372,0.000052849766,0.0000013920825],"category_scores_gemma":[0.00003091326,0.000092420276,0.00006609808,0.00046866105,0.00018916115,0.00026282572,0.00016435425,0.000067245775,0.0000041013914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025023055,0.000040379276,0.00014465384,0.00015144036,0.000027872411,7.8037067e-7,0.00075065676,0.00012632417,0.07755234,0.9010252,0.00007928729,0.020098587],"study_design_scores_gemma":[0.00026007227,0.000040380957,0.0011628836,0.00007984671,0.00005607261,0.000026185613,0.00061064947,0.07752162,0.027401067,0.8918955,0.00067379366,0.00027198176],"about_ca_topic_score_codex":0.0000026774173,"about_ca_topic_score_gemma":0.000004567883,"teacher_disagreement_score":0.50568193,"about_ca_system_score_codex":0.0000057260304,"about_ca_system_score_gemma":0.000022673017,"threshold_uncertainty_score":0.41947258},"labels":[],"label_agreement":null},{"id":"W4318253767","doi":"10.1090/tran/8501","title":"Corrigendum to “𝜔-categorical structures avoiding height 1 identities”","year":2023,"lang":"en","type":"erratum","venue":"Transactions of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; European Research Council; Natural Sciences and Engineering Research Council of Canada; H2020 European Research Council; Austrian Science Fund; Grantová Agentura České Republiky","keywords":"Categorical variable; Mathematics; Statistics","score_opus":0.02691932152658944,"score_gpt":0.2748293972128892,"score_spread":0.24791007568629975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318253767","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011724458,0.00006159226,0.98606795,0.001687379,0.009289219,0.0003362677,0.000033270393,0.00031742218,0.0020896678],"genre_scores_gemma":[0.10832555,0.0009797849,0.24627446,0.0040932857,0.0017728205,0.0003952709,0.00003333047,0.00038417507,0.6377413],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974047,0.00013742858,0.00055860996,0.0005621062,0.00079934497,0.0005378424],"domain_scores_gemma":[0.9977427,0.00028411538,0.00042025233,0.0012585827,0.000104626226,0.00018968958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002638725,0.00038658755,0.0008155312,0.00007642423,0.0005248421,0.00010729078,0.002489974,0.00018045059,0.000117175754],"category_scores_gemma":[0.000100252124,0.000264918,0.0010362088,0.001699556,0.00049908756,0.0001752765,0.00021114653,0.0013227564,0.0001449502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005881881,0.00014247248,0.0000019327924,0.00037804886,0.000339375,0.000004890796,0.0033010517,0.00046736235,0.00016109303,0.12239856,0.86828226,0.004517069],"study_design_scores_gemma":[0.00017352887,0.00021525062,0.00026405984,0.00015556044,0.00022346165,0.00005313692,0.0016544678,0.013009162,0.000441252,0.9573097,0.025636483,0.0008639243],"about_ca_topic_score_codex":0.00003596994,"about_ca_topic_score_gemma":0.0000053516524,"teacher_disagreement_score":0.84264576,"about_ca_system_score_codex":0.00016562681,"about_ca_system_score_gemma":0.00016874267,"threshold_uncertainty_score":0.99998033},"labels":[],"label_agreement":null},{"id":"W4318332875","doi":"10.23952/jano.5.2023.1.02","title":"A unified approach to Bishop-Phelps and scalarizing functionals","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical economics; Mathematics; Philosophy; Computer science","score_opus":0.016261603905689356,"score_gpt":0.22876484247341658,"score_spread":0.21250323856772724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041721994,0.00004518747,0.99280643,0.00071717426,0.00008427504,0.000076743236,3.7774595e-7,0.000043142758,0.0020544701],"genre_scores_gemma":[0.5871515,0.000093351904,0.41202042,0.00058740715,0.00009521078,0.00000442175,0.000002253641,0.0000072832377,0.00003812626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992673,0.000015896328,0.00022555134,0.000166247,0.00019097945,0.00013405793],"domain_scores_gemma":[0.9995216,0.00006837035,0.00012208328,0.00007774294,0.0000646495,0.00014551138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022184847,0.00008282076,0.00016696645,0.00016641499,0.00010337119,0.00009366793,0.00012867487,0.000042026943,0.000002601563],"category_scores_gemma":[0.000029578345,0.00006469148,0.000024709412,0.000642862,0.000019980305,0.00024607117,0.00009536751,0.00010521068,0.000003668779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007642877,0.000067982415,0.00007231764,0.000015950522,0.00002410152,0.0000057251423,0.0005508041,0.8625305,0.0010551139,0.09175079,0.00049051037,0.04335974],"study_design_scores_gemma":[0.000812677,0.00024323068,0.0032134152,0.00001985053,0.000018806008,0.00009291991,0.00024074137,0.9715802,0.00021985082,0.021141721,0.0021660745,0.00025052318],"about_ca_topic_score_codex":3.1356925e-7,"about_ca_topic_score_gemma":9.832233e-9,"teacher_disagreement_score":0.5829793,"about_ca_system_score_codex":0.000012103444,"about_ca_system_score_gemma":0.00001881267,"threshold_uncertainty_score":0.2638042},"labels":[],"label_agreement":null},{"id":"W4323033497","doi":"10.1007/s44146-023-00058-x","title":"On slim rectangular lattices","year":2023,"lang":"en","type":"article","venue":"Acta Scientiarum Mathematicarum","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Lattice (music); Planar; Mathematics; Combinatorics; Interval (graph theory); Dozen; Geometry; Physics; Arithmetic; Computer science; Computer graphics (images)","score_opus":0.01882019646909275,"score_gpt":0.2637364005889447,"score_spread":0.24491620411985196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323033497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60318154,0.000109368455,0.2894752,0.021324037,0.003460862,0.0009065823,0.00001175425,0.004802696,0.07672796],"genre_scores_gemma":[0.9765818,0.000009976053,0.019698415,0.00061452994,0.000052794785,0.000028269611,0.0000042816478,0.000020263726,0.002989677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997841,0.00005575588,0.00025710787,0.0005867282,0.0006302742,0.00062911416],"domain_scores_gemma":[0.9982219,0.0004033701,0.000115081464,0.0010622693,0.00004766648,0.00014971217],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007235444,0.00019220548,0.00021777657,0.00031738842,0.00032593033,0.00030459493,0.0014782144,0.00006210653,0.000088386456],"category_scores_gemma":[0.00031965508,0.0001521976,0.000110212924,0.0018190361,0.00009241879,0.0006085271,0.00048134517,0.00014592744,0.002931273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025662862,0.00009488533,0.000025482312,0.000045298206,0.000021734904,0.00005143997,0.0009555486,0.000077629855,0.0051040524,0.9756273,0.013860164,0.004133909],"study_design_scores_gemma":[0.00029352325,0.0001441389,0.0005243325,0.00009910904,0.0000141236615,0.000025926025,0.00015256106,0.06385969,0.006310673,0.9202116,0.007936533,0.0004277688],"about_ca_topic_score_codex":6.595737e-7,"about_ca_topic_score_gemma":9.3198355e-7,"teacher_disagreement_score":0.37340027,"about_ca_system_score_codex":0.000027212465,"about_ca_system_score_gemma":0.00003279607,"threshold_uncertainty_score":0.99784505},"labels":[],"label_agreement":null},{"id":"W4323527413","doi":"10.1007/978-3-031-28083-2_17","title":"Relational Algebraic Approach to the Real Numbers the Additive Group","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Axiom; Relation (database); Abelian group; Object (grammar); Real number; Group (periodic table); Computer science; Algebraic number; Algebraic operation; Algebraic structure; Algebra over a field; Discrete mathematics; Theoretical computer science; Mathematics; Pure mathematics; Artificial intelligence; Data mining","score_opus":0.027827863965791007,"score_gpt":0.23967725196235407,"score_spread":0.21184938799656305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323527413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014373251,0.000076595825,0.963287,0.0034468735,0.0017512366,0.0006496333,0.000013266684,0.00023774603,0.030523265],"genre_scores_gemma":[0.11428015,0.00016548396,0.85960585,0.01673283,0.003466677,0.00022880697,0.00007376944,0.00014635078,0.00530008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959757,0.000067349625,0.0004133124,0.0015355028,0.0013073689,0.0007008022],"domain_scores_gemma":[0.9963643,0.0015265775,0.00022351896,0.0015715732,0.00015968308,0.00015435825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011708722,0.00047670145,0.00034417564,0.00034980298,0.0007850554,0.00042442683,0.0050331787,0.00022283976,0.000011307785],"category_scores_gemma":[0.00015193806,0.00027673072,0.00015946876,0.0013704562,0.00085596397,0.00046294753,0.0020177606,0.0011157121,0.00027845768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033502333,0.000013054188,0.000008238493,0.00000456297,0.000011523778,0.000016752643,0.0015334617,0.04531955,0.0000030632202,0.7260937,0.00026236835,0.22673036],"study_design_scores_gemma":[0.00016987571,0.00013155019,0.0012070088,0.00011590417,0.000010192566,0.000072013114,0.0000022661352,0.23115817,0.000020936937,0.7544136,0.012014534,0.00068392337],"about_ca_topic_score_codex":0.000027787437,"about_ca_topic_score_gemma":0.00012115429,"teacher_disagreement_score":0.22604644,"about_ca_system_score_codex":0.00022535006,"about_ca_system_score_gemma":0.0002989418,"threshold_uncertainty_score":0.99996847},"labels":[],"label_agreement":null},{"id":"W4324152536","doi":"10.1007/s10992-022-09696-y","title":"Varieties of Self-Reference in Metamathematics","year":2023,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Leverhulme Trust","keywords":"Diagonal; Computer science; Coding (social sciences); Sentence; Operator (biology); Accidental; Mathematics; Algebra over a field; Pure mathematics; Artificial intelligence; Physics; Geometry","score_opus":0.061611550115633636,"score_gpt":0.2971888337484152,"score_spread":0.23557728363278158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324152536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5677455,0.001414922,0.3664953,0.04929837,0.001439716,0.00041714768,0.00000560842,0.00041515054,0.012768242],"genre_scores_gemma":[0.9599726,0.00013283247,0.03960683,0.00018655209,0.000080537146,0.0000012828049,2.3349054e-7,0.0000045190973,0.000014594638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985095,0.00009202303,0.00064139697,0.00012983139,0.0004275869,0.00019965018],"domain_scores_gemma":[0.9987973,0.00032704027,0.00039814337,0.00023616887,0.00015993549,0.000081414415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071431603,0.0001113223,0.0003932829,0.00028726805,0.000028064196,0.000021557576,0.00084853,0.000087879685,0.000013684583],"category_scores_gemma":[0.0002872324,0.00007592675,0.000111438465,0.00086206966,0.000060508013,0.0003155408,0.00018540859,0.00035871213,0.000029141953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071263107,0.0001362076,0.0001734707,0.00003759767,0.000018596482,0.00012622056,0.0002799177,0.00048449112,0.0006740909,0.99746215,0.00003853126,0.00056158507],"study_design_scores_gemma":[0.00026777983,0.000292802,0.0021888968,0.000032709562,0.000009484084,0.00006758261,0.000020950178,0.0035031475,0.00031426162,0.9931085,0.00011146837,0.00008240423],"about_ca_topic_score_codex":3.9584103e-7,"about_ca_topic_score_gemma":2.971762e-7,"teacher_disagreement_score":0.39222708,"about_ca_system_score_codex":0.000024982075,"about_ca_system_score_gemma":0.00006522558,"threshold_uncertainty_score":0.3096203},"labels":[],"label_agreement":null},{"id":"W43417702","doi":"","title":"The glueing number of ordered sets.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01478113677538938,"score_gpt":0.24642111615273235,"score_spread":0.23163997937734296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43417702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92463416,0.0021904523,0.0035142184,0.002055506,0.006064106,0.00026708082,0.0000011055736,0.00035586182,0.060917515],"genre_scores_gemma":[0.9970861,0.00014213537,0.0020513728,0.00005001115,0.0000027365772,0.0000059672657,2.0148858e-7,0.000006283819,0.0006551701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912155,0.000046159807,0.00018984436,0.00018054605,0.00019857149,0.00026332916],"domain_scores_gemma":[0.9989857,0.0002836711,0.000095888005,0.0005083294,0.00007078955,0.000055617078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014714246,0.00008892468,0.00010588092,0.000013285917,0.00032237393,0.000075513795,0.0007463313,0.000036817437,0.00001567721],"category_scores_gemma":[0.00008761117,0.00006393983,0.000047469,0.00028506017,0.00006943523,0.00022436013,0.00017636277,0.00009765556,0.00013101425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012641589,0.000026562602,0.00047273558,0.0000020162631,0.0000072754106,0.000004456741,0.00015643434,0.000005061591,0.00004145674,0.97388786,0.0011668392,0.024228023],"study_design_scores_gemma":[0.00032441027,0.00003260371,0.0004891508,0.0000070526767,0.0000016870727,0.000007759659,0.000025708132,0.0057867947,0.00053125917,0.98061407,0.012078566,0.0001009445],"about_ca_topic_score_codex":0.0000033649726,"about_ca_topic_score_gemma":0.0000016451507,"teacher_disagreement_score":0.072451964,"about_ca_system_score_codex":0.00001911827,"about_ca_system_score_gemma":0.000010828189,"threshold_uncertainty_score":0.26073906},"labels":[],"label_agreement":null},{"id":"W43428214","doi":"","title":"A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bijection; Degree (music); Identity (music); Combinatorics; Discrete mathematics; Aesthetics","score_opus":0.02417275242599681,"score_gpt":0.2655721328022063,"score_spread":0.2413993803762095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43428214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957724,0.00010743743,0.002222276,0.000017581322,0.00019349957,0.00015252209,0.000003673026,0.000041752985,0.001488813],"genre_scores_gemma":[0.99778914,0.0000068061163,0.0021325778,0.0000171468,0.000002644228,0.000008373629,0.0000025703619,0.000005896942,0.000034831144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892825,0.00010146869,0.00028817658,0.00026862565,0.00021991064,0.00019358748],"domain_scores_gemma":[0.9992907,0.000096216274,0.00013995329,0.00035381806,0.00007122645,0.00004807749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019717506,0.00011101272,0.00026494553,0.00010595386,0.000037082747,0.000016958627,0.0006213093,0.00005750961,0.000039715273],"category_scores_gemma":[0.000048677946,0.00010553717,0.000043470674,0.00057478825,0.00008492841,0.0008510906,0.00008179683,0.00012116654,0.0000050007393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013299265,0.0008283369,0.02526886,0.0000543194,0.000040917505,0.00007038031,0.0043353844,0.0014346458,0.0057237893,0.8562925,0.00001869677,0.10579918],"study_design_scores_gemma":[0.0023454758,0.0005432565,0.15966074,0.00012930561,0.000008228194,0.000011142642,0.00013286897,0.017514681,0.044596255,0.7747598,0.00002749649,0.00027069016],"about_ca_topic_score_codex":0.00017096553,"about_ca_topic_score_gemma":0.00012603698,"teacher_disagreement_score":0.13439189,"about_ca_system_score_codex":0.000035650944,"about_ca_system_score_gemma":0.00005560832,"threshold_uncertainty_score":0.4303681},"labels":[],"label_agreement":null},{"id":"W4361801280","doi":"10.4310/pamq.2022.v18.n6.a10","title":"An alternative proof of general factor structure theorem","year":2022,"lang":"en","type":"article","venue":"Pure and Applied Mathematics Quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Factor (programming language); Calculus (dental); Analytic proof; Pure mathematics; Algebra over a field; Mathematical proof; Geometry","score_opus":0.01038921662758531,"score_gpt":0.23716205171775756,"score_spread":0.22677283509017226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361801280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59742296,0.000038918217,0.40135753,0.00005052143,0.000066661836,0.0002519203,0.000035870715,0.000049104965,0.0007265207],"genre_scores_gemma":[0.9323733,5.903867e-7,0.06743414,0.00007845403,0.000042111493,0.000033633118,0.000005511389,0.000009381689,0.000022895103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909705,0.000022237502,0.00020351089,0.0002566953,0.00025142205,0.00016906747],"domain_scores_gemma":[0.99935,0.000041819716,0.00016094593,0.00036373056,0.000022085185,0.00006140917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008137189,0.00013642457,0.00020782498,0.000053470932,0.00013719162,0.000044188426,0.00053295004,0.000026457461,0.00005087681],"category_scores_gemma":[0.000001260061,0.00010805311,0.000029450246,0.00013280606,0.000044107088,0.00014132363,0.00007574849,0.00014170389,7.585691e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044475896,0.000107814834,0.000005079567,0.00003801753,0.0000146783805,0.0000024439817,0.013032772,0.00024683686,0.021920407,0.9292369,0.000016099424,0.035374515],"study_design_scores_gemma":[0.00026543118,0.0005124535,0.00004459059,0.0000032890594,0.0000067699907,0.000021032925,0.0011548586,0.020926436,0.01469148,0.9621417,0.000054057553,0.00017791029],"about_ca_topic_score_codex":8.9100746e-7,"about_ca_topic_score_gemma":0.0000011569279,"teacher_disagreement_score":0.33495036,"about_ca_system_score_codex":0.00001168626,"about_ca_system_score_gemma":0.000017029322,"threshold_uncertainty_score":0.44062778},"labels":[],"label_agreement":null},{"id":"W4366288312","doi":"10.21203/rs.3.rs-2817928/v1","title":"On a Property of Congruence Lattices of Slim, Planar, Semimodular Lattices","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence (geometry); Lemma (botany); Planar; Mathematics; Combinatorics; Property (philosophy); Pure mathematics; Computer science; Geometry; Epistemology; Philosophy","score_opus":0.11590515640041033,"score_gpt":0.3908540182348879,"score_spread":0.2749488618344776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366288312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8874289,0.005063282,0.0722983,0.008648527,0.0022523962,0.0067771366,0.00067112106,0.0012757602,0.015584626],"genre_scores_gemma":[0.99178916,0.000415897,0.0060353065,0.000030502148,0.00007168458,0.0001158099,0.000023791137,0.000029728786,0.001488094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559367,0.0005265635,0.0005025048,0.00094534527,0.0017879409,0.0006439499],"domain_scores_gemma":[0.99557364,0.0014260539,0.0003145849,0.0017114065,0.0008115813,0.00016273362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018200563,0.00026311047,0.0005647303,0.0005639849,0.00013213187,0.000109096065,0.0028871747,0.00026322965,0.000028583503],"category_scores_gemma":[0.0010496534,0.00017580844,0.00016209405,0.0009072507,0.00037128475,0.00024189508,0.0021724554,0.0011751946,0.00009485115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005990048,0.0022699956,0.016468678,0.03224811,0.0008143838,0.0012862768,0.012058198,0.041155495,0.0143322395,0.80626404,0.010309181,0.062194362],"study_design_scores_gemma":[0.0015469599,0.004244022,0.033917982,0.015036441,0.000048388367,0.00001560503,0.0013457051,0.104949445,0.036937665,0.79526657,0.004917629,0.0017735662],"about_ca_topic_score_codex":0.00048025628,"about_ca_topic_score_gemma":0.00007726616,"teacher_disagreement_score":0.104360335,"about_ca_system_score_codex":0.000078324236,"about_ca_system_score_gemma":0.00046303446,"threshold_uncertainty_score":0.71692604},"labels":[],"label_agreement":null},{"id":"W4367840729","doi":"10.1016/j.fss.2023.108533","title":"Approximate bisimulations for fuzzy-transition systems","year":2023,"lang":"en","type":"article","venue":"Fuzzy Sets and Systems","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Bisimulation; Nondeterministic algorithm; Mathematics; Fuzzy logic; Operator (biology); Function (biology); Characterization (materials science); Algorithm; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.038194380786521605,"score_gpt":0.27900016047784865,"score_spread":0.24080577969132705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367840729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047954395,0.0014707624,0.9407283,0.0007210034,0.003223589,0.0017402556,0.00012561562,0.001078973,0.0029570991],"genre_scores_gemma":[0.99787253,0.00003429138,0.001012385,0.000048333644,0.0001851227,0.00019398477,0.000055798133,0.00001359301,0.00058398093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881697,0.000058897254,0.00027322167,0.00035602174,0.0001816115,0.00031328257],"domain_scores_gemma":[0.9992652,0.00015665262,0.0000841954,0.00031383027,0.00008243,0.0000977127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036652788,0.0001358404,0.0002211419,0.00013804414,0.00029348562,0.0002965659,0.00021448625,0.00007552768,3.7886755e-7],"category_scores_gemma":[0.000017259592,0.00011090612,0.000051652994,0.00039866028,0.000022466935,0.00036184327,0.000048051566,0.000054980956,0.000048709124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012496783,0.00004070032,0.00022599321,0.00083262834,0.000050856117,0.000023164663,0.00226895,0.09422839,0.0006784414,0.8899678,0.0058910497,0.005779534],"study_design_scores_gemma":[0.00045544747,0.000087636494,0.00050224114,0.000085685315,0.000009109468,0.000031688767,0.00038779897,0.97114545,0.000009361954,0.016017364,0.011037922,0.00023028778],"about_ca_topic_score_codex":0.000023447885,"about_ca_topic_score_gemma":0.000002038079,"teacher_disagreement_score":0.9499181,"about_ca_system_score_codex":0.000018972265,"about_ca_system_score_gemma":0.000018717734,"threshold_uncertainty_score":0.45226204},"labels":[],"label_agreement":null},{"id":"W4377101733","doi":"10.1016/j.jalgebra.2023.05.014","title":"Algebras from finite group actions and a question of Eilenberg and Schützenberger","year":2023,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Corollary; Mathematics; Finitely-generated abelian group; Group (periodic table); Finite set; Algebraic number; Algebraic structure; Group action; Set (abstract data type); Finite group; Existential quantification; Pure mathematics; Infinite set; Algebra over a field; Discrete mathematics; Computer science","score_opus":0.01935966687224275,"score_gpt":0.2641838447922463,"score_spread":0.24482417792000358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377101733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91974187,0.0009480332,0.07743474,0.0012307249,0.00041845467,0.000054090353,0.0000037206173,0.00004990962,0.00011844056],"genre_scores_gemma":[0.9831307,0.00083882903,0.015663764,0.00014573231,0.00014657692,0.000001059337,0.000001842251,0.000008707207,0.000062803476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989422,0.000073827585,0.0003857575,0.00018134635,0.00024945024,0.00016741037],"domain_scores_gemma":[0.99884725,0.00037904741,0.00034724217,0.00019369976,0.000105916915,0.00012686723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003374511,0.00011563552,0.00025169484,0.0002632348,0.00009113062,0.000064679836,0.00024713425,0.00006757695,0.000018177632],"category_scores_gemma":[0.0001692595,0.00009386995,0.000068763286,0.00046209438,0.00007773899,0.0008806238,0.00015265166,0.00020928316,0.000010599617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018349508,0.00037730607,0.033995762,0.00010976461,0.0005133401,0.00042596099,0.004812335,0.0010355422,0.063687444,0.65730864,0.0050358726,0.23251456],"study_design_scores_gemma":[0.0017868492,0.00085228856,0.36570916,0.0003244396,0.00009458346,0.00029490213,0.00036818042,0.01181854,0.0043353834,0.60832727,0.005639664,0.00044874524],"about_ca_topic_score_codex":0.000015449186,"about_ca_topic_score_gemma":0.000008048406,"teacher_disagreement_score":0.33171338,"about_ca_system_score_codex":0.0000151700615,"about_ca_system_score_gemma":0.000035563004,"threshold_uncertainty_score":0.38279057},"labels":[],"label_agreement":null},{"id":"W4379418186","doi":"10.14209/sbrt.2000.5150182","title":"Casamento Multinível Generalizado de Constelações de Sinais a Grupos","year":2000,"lang":"pt","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optelian (Canada)","funders":"","keywords":"Humanities; Philosophy","score_opus":0.019522233954569236,"score_gpt":0.26828716882673587,"score_spread":0.24876493487216664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379418186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4316186,0.0018318325,0.5389173,0.0017979877,0.00038022207,0.00042017142,0.000012893721,0.00041161402,0.024609357],"genre_scores_gemma":[0.8264437,0.0004966782,0.101281926,0.007898334,0.00024679315,0.000027704762,0.000003909135,0.000033568176,0.0635674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971865,0.00021703713,0.00041345158,0.00072898285,0.0002995267,0.0011545001],"domain_scores_gemma":[0.99853987,0.00014316049,0.00009504268,0.0007077026,0.00006502055,0.00044918695],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029729807,0.00038264788,0.00033969857,0.000093806375,0.00034018574,0.00031306501,0.00093847164,0.00019546144,0.0040116054],"category_scores_gemma":[0.00003891951,0.00035032735,0.00017386072,0.00043968068,0.00017656718,0.00047344103,0.00019260574,0.00025623824,0.0010191083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014931899,0.0015543841,0.030508118,0.00020207222,0.0002594072,0.0021040554,0.02156176,0.027764956,0.011407779,0.1305907,0.028130425,0.745767],"study_design_scores_gemma":[0.0038678802,0.00094297784,0.016596574,0.0002958725,0.00012396796,0.0019549606,0.0011978279,0.8482174,0.016507637,0.017929556,0.08979302,0.0025722948],"about_ca_topic_score_codex":0.00057800964,"about_ca_topic_score_gemma":0.00012796358,"teacher_disagreement_score":0.82045245,"about_ca_system_score_codex":0.00021823,"about_ca_system_score_gemma":0.00029963418,"threshold_uncertainty_score":0.99989486},"labels":[],"label_agreement":null},{"id":"W4379619578","doi":"10.1016/j.tcs.2023.113981","title":"The road problem and homomorphisms of directed graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Generalization; Mathematics; Property (philosophy); Graph; Combinatorics; Product (mathematics); Graph theory; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.008747850501502908,"score_gpt":0.23457104465007958,"score_spread":0.22582319414857668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379619578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1622026,0.00013339703,0.8309558,0.0019621083,0.0004806247,0.0002644466,0.0000013649916,0.00071097794,0.0032886576],"genre_scores_gemma":[0.9514755,0.000044583623,0.048326682,0.000105856256,0.000019938954,0.000007635388,2.5834322e-7,0.0000041228695,0.000015397065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998306,0.00007979526,0.00021720359,0.00045592844,0.0004753536,0.00046576496],"domain_scores_gemma":[0.99865943,0.0004088935,0.000066446475,0.0005872124,0.00013106984,0.00014691922],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012111006,0.00011886033,0.0001491862,0.0001332717,0.0005841748,0.0002062476,0.0017770428,0.00002787944,0.000002834283],"category_scores_gemma":[0.00007659689,0.00007116393,0.00003875106,0.002417692,0.0042735804,0.00033217928,0.0011427762,0.00011860342,0.00002234825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024149513,0.000009692285,0.000044203472,0.0000033069423,0.0000019338806,0.000004866904,0.00018064043,0.000036238318,0.00042501552,0.9124225,0.000026846064,0.08684236],"study_design_scores_gemma":[0.000093056566,0.000111063935,0.0046796664,0.000011861453,0.0000015265045,0.00001591313,0.00000561146,0.2320978,0.0010496553,0.76177686,0.00006342966,0.00009355171],"about_ca_topic_score_codex":0.0000016421602,"about_ca_topic_score_gemma":3.861669e-7,"teacher_disagreement_score":0.7892729,"about_ca_system_score_codex":0.000009844878,"about_ca_system_score_gemma":0.000051007675,"threshold_uncertainty_score":0.9984362},"labels":[],"label_agreement":null},{"id":"W4380990376","doi":"10.37236/11571","title":"Maximal Degree Subposets of $\\nu$-Tamari Lattices","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Partially ordered set; Degree (music); Lattice (music); Path (computing); Order (exchange); Discrete mathematics; Physics; Computer science","score_opus":0.02244841850190152,"score_gpt":0.254418024334184,"score_spread":0.23196960583228246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380990376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7942814,0.0058287513,0.19243103,0.0037596154,0.0013835981,0.00016384524,9.4061147e-7,0.000115316776,0.0020355],"genre_scores_gemma":[0.99873334,0.00074587937,0.00014345553,0.00006493648,0.00005859293,0.0000010744802,3.1360992e-7,0.000009817487,0.00024257196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982925,0.00011718613,0.00040744472,0.00012159236,0.00051047624,0.00055076525],"domain_scores_gemma":[0.9984699,0.00034425824,0.0005145337,0.00038097604,0.00022356951,0.00006675486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011921668,0.00012804837,0.0002658951,0.00016298714,0.00011673304,0.000039986837,0.0017003159,0.00005175047,0.0000054288985],"category_scores_gemma":[0.00010846456,0.000083380364,0.00013745046,0.0011620516,0.00006684646,0.0003792555,0.0002016873,0.0005321231,0.000021084415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001854004,0.000058344398,0.00035502115,0.000010048783,0.00004811287,0.00002440482,0.0002656378,0.00017483844,0.00041213472,0.9922521,0.00033609456,0.00604469],"study_design_scores_gemma":[0.0005372959,0.00070697325,0.0037216477,0.000017949473,0.000024000892,0.0001606387,0.000062122366,0.001450411,0.0025744399,0.98802406,0.0026084539,0.00011198308],"about_ca_topic_score_codex":0.0000023721107,"about_ca_topic_score_gemma":0.0000026560529,"teacher_disagreement_score":0.20445196,"about_ca_system_score_codex":0.000104164275,"about_ca_system_score_gemma":0.00034258197,"threshold_uncertainty_score":0.34001526},"labels":[],"label_agreement":null},{"id":"W4383816414","doi":"10.28924/2291-8639-21-2023-67","title":"Fuzzy Initial and Final Segments in ADL’s","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lattice (music); Complete lattice; Distributive property; Fuzzy logic; Fuzzy set; Distributive lattice; Bounded function; Congruence lattice problem; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis; Universality (dynamical systems); Physics; Condensed matter physics","score_opus":0.0230087675467662,"score_gpt":0.3302806979356298,"score_spread":0.3072719303888636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383816414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40607005,0.00020367355,0.5898002,0.0028898143,0.00008899681,0.000065805696,0.000008259693,0.000020134641,0.0008531216],"genre_scores_gemma":[0.9951594,0.00030435144,0.0042352714,0.00014254183,0.000091614806,0.0000073153114,0.0000045819297,0.0000015758834,0.00005334709],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993642,0.00001626598,0.00023922655,0.00011247317,0.00019811986,0.000069696645],"domain_scores_gemma":[0.9995628,0.000063702486,0.00013570463,0.000074264826,0.00011605259,0.00004750003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017813673,0.000047781345,0.00011155948,0.0005376645,0.00003741309,0.00007498708,0.0002999063,0.000018016914,0.0000053339454],"category_scores_gemma":[0.000013909409,0.000040639065,0.000053940745,0.000734298,0.000024538827,0.00024168502,0.00010178819,0.00007522884,0.0000050209705],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003227486,0.00026935255,0.08721177,0.000008133938,0.0012135981,0.00016484434,0.001017498,0.005555581,0.001981716,0.3244673,0.00038114906,0.5776968],"study_design_scores_gemma":[0.0013244061,0.00009693997,0.71117467,0.00003038259,0.00017596243,0.00014908657,0.00032459808,0.027208569,0.00041938416,0.25173044,0.0071055996,0.00025994796],"about_ca_topic_score_codex":0.000006457682,"about_ca_topic_score_gemma":0.000020020769,"teacher_disagreement_score":0.6239629,"about_ca_system_score_codex":0.000015404687,"about_ca_system_score_gemma":0.000018888133,"threshold_uncertainty_score":0.1657213},"labels":[],"label_agreement":null},{"id":"W4384011002","doi":"10.1017/9781009401548.004","title":"Gold and brass: affine algebras and generalisations","year":2023,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Brass; Affine transformation; Action (physics); Content (measure theory); Computer science; Mathematics; Algebra over a field; Pure mathematics; Metallurgy; Materials science; Physics; Mathematical analysis; Copper; Quantum mechanics","score_opus":0.029939785354126825,"score_gpt":0.20079488198419915,"score_spread":0.1708550966300723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384011002","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004010249,0.00026835085,0.017656129,0.00013707456,0.00023468796,0.00027326212,0.000093284136,0.00043065572,0.9805055],"genre_scores_gemma":[0.0008974559,0.00037366385,0.0018419627,0.0001489659,0.00009588347,7.60393e-7,0.000020772142,0.00002755507,0.996593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880326,0.0000244151,0.00013217503,0.00063193333,0.00017208063,0.00023612007],"domain_scores_gemma":[0.9990303,0.000102724494,0.00012274219,0.0004957985,0.0000698188,0.00017860581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006463472,0.00028757623,0.0002853198,0.00019208263,0.00019442984,0.00010543465,0.0005079556,0.00021164725,0.0000011032483],"category_scores_gemma":[0.000009260067,0.00032316512,0.000069099406,0.00001763417,0.00021628887,0.00023218397,0.0009984865,0.00027208042,0.000011399919],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004107683,0.0000023976718,0.0000025677996,0.00002656272,0.00004185066,0.00016255643,0.000054185875,0.0000038220232,0.000044115186,0.98733366,0.007854577,0.004469614],"study_design_scores_gemma":[0.0006810961,0.00008324299,0.0002595775,0.00010920189,0.00010965191,0.00006349858,0.000020861318,0.0013123684,0.00011314233,0.0027342914,0.99372643,0.0007866068],"about_ca_topic_score_codex":0.000041202475,"about_ca_topic_score_gemma":0.000006552011,"teacher_disagreement_score":0.9858719,"about_ca_system_score_codex":0.000050279563,"about_ca_system_score_gemma":0.00004684489,"threshold_uncertainty_score":0.99992204},"labels":[],"label_agreement":null},{"id":"W4384828407","doi":"10.14232/phd.11171","title":"On subuniverses of lattices and semilattices","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Lattice (music); Von Neumann architecture; Mathematics; Algebra over a field; Polymath; Art history; Pure mathematics; Physics; History","score_opus":0.010028125340486017,"score_gpt":0.2623216161738844,"score_spread":0.25229349083339836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384828407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7683048,0.0013805133,0.0017121381,0.000096049924,0.00083180366,0.00018734555,0.000007056191,0.00015208563,0.22732817],"genre_scores_gemma":[0.9576528,0.00034351298,0.006758074,0.00018566851,0.00001918095,0.000008831921,0.00006319115,0.000012455853,0.034956258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937004,0.000021638714,0.00010485094,0.00024355444,0.00017414577,0.00008579435],"domain_scores_gemma":[0.9994432,0.00016640146,0.00013807855,0.0002012397,0.000024851799,0.000026231319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046986897,0.000102644044,0.00014677136,0.000106190084,0.00007114242,0.000022845816,0.00035838856,0.000045846216,0.00031125586],"category_scores_gemma":[0.000015322961,0.000087232605,0.000031236705,0.00013965572,0.000013962026,0.00018604592,0.000060682734,0.0001120747,0.000003990418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014438662,0.0000309138,0.00004853787,0.0000875925,0.000016708776,0.000008872845,0.0011388329,0.000025109279,0.00015718801,0.98439884,0.00021683176,0.0138561465],"study_design_scores_gemma":[0.0015464367,0.0026295823,0.030356515,0.00041204793,0.00018446617,0.00002107828,0.019823324,0.006560167,0.014465782,0.8788784,0.042821378,0.0023007812],"about_ca_topic_score_codex":0.000017367185,"about_ca_topic_score_gemma":0.00005176232,"teacher_disagreement_score":0.1923719,"about_ca_system_score_codex":0.000008695456,"about_ca_system_score_gemma":0.00002859317,"threshold_uncertainty_score":0.35572425},"labels":[],"label_agreement":null},{"id":"W4385222867","doi":"10.1002/malq.202200044","title":"Topological duality for orthomodular lattices","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Morphism; Topological space; Category of topological spaces; Pure mathematics; Class (philosophy); Duality (order theory); Discrete mathematics; Algebra over a field; Topological tensor product; Functional analysis","score_opus":0.04756827024346589,"score_gpt":0.31647797732285965,"score_spread":0.26890970707939377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385222867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048060503,0.000025958932,0.943981,0.0034227718,0.00018645615,0.00037597417,0.0000053485965,0.00096513075,0.0029768946],"genre_scores_gemma":[0.85783917,0.0000020903262,0.14045452,0.00068299304,0.000112972775,0.00017104615,0.000008423594,0.00001154469,0.000717235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827504,0.0000848876,0.00036451648,0.00048671447,0.00026271917,0.00052610884],"domain_scores_gemma":[0.99834335,0.00080793933,0.00008272889,0.00057025295,0.00005735092,0.00013836454],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006497572,0.00018499036,0.00032563452,0.00006732393,0.00017754773,0.00012753082,0.00074065634,0.00011667439,0.00009361378],"category_scores_gemma":[0.0001744886,0.00012796183,0.00016025531,0.00041274147,0.00011066924,0.00027113623,0.00008929434,0.00011717909,0.0010151425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038045612,0.00008325425,0.000026779433,0.000057916626,0.00000874864,0.000028769218,0.00047773044,0.000008847873,0.000102053156,0.98686075,0.00031279385,0.01202855],"study_design_scores_gemma":[0.0002271087,0.0005469215,0.00077626854,0.000009935676,0.000006739107,0.0000175176,0.00016138339,0.025618644,0.000056282064,0.9713725,0.0010136088,0.00019312838],"about_ca_topic_score_codex":4.5585764e-7,"about_ca_topic_score_gemma":6.761155e-7,"teacher_disagreement_score":0.8097787,"about_ca_system_score_codex":0.000016313756,"about_ca_system_score_gemma":0.00001625724,"threshold_uncertainty_score":0.99976265},"labels":[],"label_agreement":null},{"id":"W4385704130","doi":"10.28924/2291-8639-21-2023-85","title":"On Prime E-ideals of Almost Distributive Lattices","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Thailand Science Research and Innovation; University of Phayao","keywords":"Mathematics; Prime (order theory); Distributive property; Congruence relation; Distributive lattice; Quotient; Congruence (geometry); Associated prime; Equivalence (formal languages); Pure mathematics; Prime ideal; Boolean prime ideal theorem; Complete lattice; Prime element; Lattice (music); Combinatorics","score_opus":0.011296416319627078,"score_gpt":0.30906570107447645,"score_spread":0.2977692847548494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385704130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0818788,0.00007800218,0.9156424,0.0017768769,0.00004759617,0.000045720724,0.00003380943,0.000014165655,0.00048264384],"genre_scores_gemma":[0.99717194,0.00017104276,0.0024475285,0.00007524198,0.00005840703,0.0000046869964,0.000013652391,0.0000015989464,0.000055901164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992515,0.000018319346,0.00028544653,0.00010365799,0.0002792161,0.00006184594],"domain_scores_gemma":[0.9988188,0.00028767672,0.0003755361,0.00012375036,0.0003495902,0.000044658147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019348889,0.000050053935,0.00014508866,0.0003275137,0.000040707644,0.00004111171,0.00048573897,0.000017185559,0.000013592957],"category_scores_gemma":[0.000050190654,0.000038428567,0.00010752189,0.0007907228,0.000034963283,0.00015618998,0.000074756135,0.00005959845,0.00001024745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017826618,0.00018921455,0.0064232936,0.0000038416,0.0016503831,0.000015318676,0.00023290615,0.0052428246,0.0029600372,0.8752104,0.0003835329,0.10767044],"study_design_scores_gemma":[0.0012275286,0.0004082785,0.34812382,0.00007957879,0.00079837453,0.00006190717,0.00040521097,0.049238104,0.02062174,0.5530158,0.025563054,0.00045657178],"about_ca_topic_score_codex":0.0000048961715,"about_ca_topic_score_gemma":0.000002431242,"teacher_disagreement_score":0.91529316,"about_ca_system_score_codex":0.000014978446,"about_ca_system_score_gemma":0.000021606813,"threshold_uncertainty_score":0.15670715},"labels":[],"label_agreement":null},{"id":"W4386245385","doi":"10.28924/2291-8639-21-2023-92","title":"Vector General Fuzzy Automaton: A Refining Analyzing","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Eusko Jaurlaritza","keywords":"Relation (database); Mathematics; Quotient algebra; Quotient; Equivalence (formal languages); Equivalence relation; Refining (metallurgy); Fuzzy logic; Algebra over a field; Equivalence class (music); Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence; Data mining","score_opus":0.013345034841417022,"score_gpt":0.2992543012576436,"score_spread":0.28590926641622655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386245385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08349598,0.00019346326,0.91261053,0.0028497877,0.000111889654,0.000024577696,0.0000047406274,0.00006504496,0.0006440125],"genre_scores_gemma":[0.9729631,0.00020570063,0.0261234,0.0001633528,0.00029563325,0.00000958705,0.000008570765,0.000003840486,0.00022683032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99909854,0.000021911554,0.00033462304,0.00015415852,0.0002863042,0.00010445284],"domain_scores_gemma":[0.99914116,0.00008083936,0.0002816314,0.00015296442,0.00026793365,0.00007549132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025873294,0.00006942856,0.00016713425,0.0006525114,0.00009143449,0.00015036819,0.00060148834,0.000023731005,0.000010593408],"category_scores_gemma":[0.00002245971,0.000057643527,0.00017191203,0.0014632451,0.000024047222,0.00029878924,0.0001243674,0.000092460774,0.000016105909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086863165,0.000097840995,0.025198402,0.00000484034,0.0025687753,0.00007979136,0.00040585166,0.017872386,0.0066613033,0.68971074,0.00063000806,0.2567614],"study_design_scores_gemma":[0.0013072978,0.0001566793,0.43251356,0.00005718189,0.0009991782,0.00036406415,0.0002663453,0.34963328,0.0020393487,0.12178028,0.090128586,0.00075420615],"about_ca_topic_score_codex":0.000006724251,"about_ca_topic_score_gemma":0.000005820955,"teacher_disagreement_score":0.8894671,"about_ca_system_score_codex":0.000026594862,"about_ca_system_score_gemma":0.000031216707,"threshold_uncertainty_score":0.23506348},"labels":[],"label_agreement":null},{"id":"W4386400244","doi":"10.4204/eptcs.386.5","title":"Duality of Lattices Associated to Left and Right Quotients","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; Eesti Teadusagentuur","keywords":"Duality (order theory); Quotient; Mathematics; Pure mathematics; Left and right; Structural engineering; Engineering","score_opus":0.006738549479829083,"score_gpt":0.25724041209966036,"score_spread":0.25050186261983126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386400244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8843781,0.000030495034,0.11269653,0.0010739274,0.0001661788,0.00021297022,7.4644e-7,0.00022047601,0.0012206062],"genre_scores_gemma":[0.99205667,0.000011888234,0.0076108947,0.00027405427,0.000022107157,0.000006119652,3.2145425e-7,0.000005828736,0.000012117686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735874,0.000026794853,0.00031070245,0.000748821,0.0006073659,0.00094755023],"domain_scores_gemma":[0.9991499,0.0001784835,0.0000963309,0.00020769463,0.0001830394,0.00018451284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022180288,0.00016029614,0.00025023226,0.00039015242,0.00018693268,0.00016680923,0.0015801118,0.000055741584,0.000009520733],"category_scores_gemma":[0.0003837344,0.00013432816,0.00003112286,0.003095835,0.0008944139,0.0007374178,0.0011464795,0.0002459347,0.0000163866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005018934,0.00004158394,0.002062909,0.000010647487,0.0000028507368,0.0000024440967,0.0010066405,0.000036877726,0.0010298581,0.991998,0.000017112585,0.003786045],"study_design_scores_gemma":[0.00028887653,0.0005062709,0.024842877,0.00006321027,0.0000027965693,0.000013036351,0.00002239711,0.17324074,0.010524778,0.7901683,0.000071367154,0.00025537133],"about_ca_topic_score_codex":0.0000020226103,"about_ca_topic_score_gemma":0.0000025297818,"teacher_disagreement_score":0.20182973,"about_ca_system_score_codex":0.00012907913,"about_ca_system_score_gemma":0.000116511976,"threshold_uncertainty_score":0.5477744},"labels":[],"label_agreement":null},{"id":"W4387024683","doi":"10.28924/2291-8639-21-2023-105","title":"Representation of ABA’s by Sections of Sheaves","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Distributive lattice; Sheaf; Distributive property; Element (criminal law); Space (punctuation); Boolean algebra; Boolean algebras canonically defined; Pure mathematics; Lattice (music); Section (typography); Stone's representation theorem for Boolean algebras; Discrete mathematics; Representation (politics); Algebra over a field; Two-element Boolean algebra; Linguistics; Algebra representation; Computer science; Philosophy","score_opus":0.012349807375781233,"score_gpt":0.31460466870730536,"score_spread":0.3022548613315241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387024683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118906625,0.0001317559,0.87938386,0.0010871527,0.00005254249,0.00003880135,0.000019412639,0.000010535846,0.00036933433],"genre_scores_gemma":[0.99441695,0.0003979179,0.004995083,0.000022467913,0.00004674325,0.000005109704,0.00001517562,0.000001677223,0.0000988866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992177,0.00001960145,0.00036903762,0.00009279423,0.00025508399,0.000045771307],"domain_scores_gemma":[0.9989046,0.00011324343,0.00041529522,0.0001238519,0.00041022716,0.000032806176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014174123,0.000040312127,0.00015308667,0.00045031795,0.00003189981,0.000021641164,0.00034684042,0.000017618404,0.000009408849],"category_scores_gemma":[0.000026614696,0.000034323395,0.00014236943,0.0013419017,0.00004088723,0.00021117118,0.000055633616,0.00004587921,0.0000015190491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004450913,0.0008516536,0.05613769,0.00003209269,0.006784823,0.000011484846,0.0024928837,0.04972098,0.15652253,0.45372614,0.00586672,0.2678085],"study_design_scores_gemma":[0.0019621868,0.00041537845,0.43082708,0.00008731917,0.0015369855,0.00013154015,0.0026474672,0.10548096,0.1453748,0.285278,0.025666809,0.00059147604],"about_ca_topic_score_codex":0.0000229779,"about_ca_topic_score_gemma":0.0000055969776,"teacher_disagreement_score":0.87551033,"about_ca_system_score_codex":0.000009761661,"about_ca_system_score_gemma":0.000015822507,"threshold_uncertainty_score":0.13996674},"labels":[],"label_agreement":null},{"id":"W4387323697","doi":"","title":"Angelica Babei - A family of $\\\\phi$-congruence subgroups of the modular group","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Congruence (geometry); Modular design; Group (periodic table); Modular group; Combinatorics; Mathematics; Psychology; Computer science; Physics; Social psychology; Operating system","score_opus":0.012686321901395656,"score_gpt":0.2169765440890797,"score_spread":0.20429022218768406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387323697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28260615,0.0029304659,0.6901397,0.0066336887,0.0006832156,0.0008057147,0.00010427113,0.00022408788,0.015872719],"genre_scores_gemma":[0.9378233,0.00034529733,0.060322225,0.00017644564,0.000011209804,0.000084557425,0.00006029207,0.000025654797,0.0011510039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99338984,0.003937546,0.00069361954,0.00086239097,0.00077375694,0.00034286024],"domain_scores_gemma":[0.99233246,0.00093066995,0.0010248382,0.0045376737,0.0010659816,0.00010835707],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0034099875,0.0003108616,0.00047987126,0.00016462183,0.000317122,0.00011940936,0.005913695,0.00017207158,0.000059887236],"category_scores_gemma":[0.0007060425,0.00027194538,0.0003530745,0.0009069721,0.00041426762,0.00022022797,0.006763064,0.0007550984,0.000004265388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108128115,0.0008219731,0.003018722,0.00030771928,0.00009582137,0.000006475078,0.008030218,0.0014119208,0.030344652,0.928052,0.00039408435,0.027505588],"study_design_scores_gemma":[0.0024449327,0.000009736533,0.21107993,0.004499917,0.00021113738,0.000048574304,0.0007658249,0.18095551,0.18045898,0.36422676,0.052516833,0.0027818533],"about_ca_topic_score_codex":0.0009115171,"about_ca_topic_score_gemma":0.00029475227,"teacher_disagreement_score":0.6552172,"about_ca_system_score_codex":0.00009754331,"about_ca_system_score_gemma":0.0002673839,"threshold_uncertainty_score":0.9999733},"labels":[],"label_agreement":null},{"id":"W4387466010","doi":"10.1007/978-3-031-38700-5_3","title":"Multiplicative and Additive Rules","year":2023,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Multiplicative function; Computer science; Mathematics; Mathematical analysis","score_opus":0.15870472274445457,"score_gpt":0.27552886570107227,"score_spread":0.1168241429566177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387466010","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018302329,0.0004976621,0.6125962,0.00014152029,0.00064296223,0.0005316109,0.00016801701,0.0006608014,0.38475937],"genre_scores_gemma":[0.18407467,0.0008928347,0.010607389,0.00029496787,0.0010706953,0.00012609421,0.00034398944,0.0003208089,0.80226856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794173,0.000042271004,0.00039098092,0.0008611394,0.0003920076,0.00037185528],"domain_scores_gemma":[0.99815106,0.0006265948,0.00037234434,0.0006139162,0.00007580814,0.00016025115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018914929,0.0004395411,0.000591931,0.00030312172,0.00035948533,0.000296086,0.00063676306,0.00023304432,0.000020584159],"category_scores_gemma":[0.000025815223,0.00040781207,0.00010663424,0.00007921935,0.00023868101,0.00021832956,0.00046552377,0.00032100035,0.00033546818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029420264,0.0000033843462,0.0000018877003,0.000059260143,0.00008220593,0.000044183962,0.0004228165,0.000018695719,0.000011943983,0.9955885,0.003246189,0.00051799533],"study_design_scores_gemma":[0.00039970124,0.00011345894,0.000040852345,0.0006425232,0.00002707899,0.0000784791,0.0006190854,0.01874801,0.0000020768125,0.909807,0.068722956,0.000798782],"about_ca_topic_score_codex":0.00001333695,"about_ca_topic_score_gemma":0.000011536041,"teacher_disagreement_score":0.60198885,"about_ca_system_score_codex":0.00043329142,"about_ca_system_score_gemma":0.000047470894,"threshold_uncertainty_score":0.9998374},"labels":[],"label_agreement":null},{"id":"W4388827577","doi":"10.1088/1742-6596/2634/1/012008","title":"Congruences and subdirect decompositions in universal algebra","year":2023,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Congruence relation; Mathematics; Irreducibility; Universal algebra; Algebra over a field; Congruence (geometry); Heyting algebra; Subalgebra; Pure mathematics; Cellular algebra; Algebra representation; Tensor algebra","score_opus":0.019829123138074153,"score_gpt":0.2514695013298785,"score_spread":0.23164037819180433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388827577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8155612,0.00012487768,0.1803581,0.002411283,0.0003911755,0.00006677103,0.0000033892595,0.000070600516,0.0010126483],"genre_scores_gemma":[0.9946377,0.00025190288,0.0049514854,0.00004451368,0.000049258375,8.3243106e-7,7.467137e-7,0.0000029492182,0.00006058662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993503,0.000046205536,0.0001866871,0.00011333503,0.00014733154,0.00015612115],"domain_scores_gemma":[0.9994604,0.00010186368,0.00014240926,0.00010007055,0.00013380997,0.00006147392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013319092,0.0000844503,0.0001780135,0.000112245514,0.00007474945,0.00010740127,0.00032751018,0.000024258765,0.00000525698],"category_scores_gemma":[0.000021569604,0.000072131916,0.000036299305,0.00048582477,0.00011225883,0.0015524103,0.00009728217,0.00014359115,0.0000063557086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014792419,0.000029878804,0.002064723,0.000010788679,0.000016618518,0.00018422487,0.0019200379,0.00026751295,0.0045545506,0.92414504,0.00009685086,0.066695],"study_design_scores_gemma":[0.00059030706,0.00042562094,0.034341175,0.00012939681,0.000011054833,0.00018807685,0.0016928663,0.0029133197,0.02997588,0.92881256,0.00064204575,0.00027767714],"about_ca_topic_score_codex":0.000007104394,"about_ca_topic_score_gemma":0.000025468575,"teacher_disagreement_score":0.17907657,"about_ca_system_score_codex":0.00001672364,"about_ca_system_score_gemma":0.00012814329,"threshold_uncertainty_score":0.2941454},"labels":[],"label_agreement":null},{"id":"W4388940514","doi":"10.46298/entics.12292","title":"Propositional Logics for the Lawvere Quantale","year":2023,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Informatics and Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"School of Informatics, University of Edinburgh; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pure mathematics; Mathematical economics","score_opus":0.009747418406165097,"score_gpt":0.2616938535063769,"score_spread":0.2519464351002118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388940514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016917527,0.00009782128,0.98096806,0.0013585491,0.00016156287,0.00026382136,0.000001527463,0.00009179366,0.00013932773],"genre_scores_gemma":[0.94071543,0.000075628785,0.057900492,0.0012241737,0.000042965326,0.000032927914,0.0000017182826,0.0000031596499,0.000003513705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986014,0.00001713644,0.00025002705,0.00019972933,0.00030134834,0.00063036504],"domain_scores_gemma":[0.9986573,0.00084409135,0.00005445641,0.00031106902,0.00006614975,0.000066965506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011578739,0.00011321675,0.00011370634,0.000109648776,0.00041179176,0.0002965688,0.0011137943,0.000035230278,0.0000043912455],"category_scores_gemma":[0.000076511045,0.00006996483,0.00003561765,0.0009980693,0.0011028859,0.0005438391,0.00054885517,0.00018185235,0.000015478641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033789202,0.000011293952,0.000020999529,0.000008449499,0.000001989011,7.480602e-7,0.0003759913,0.0019598145,0.000015283798,0.95132107,0.0000130533135,0.046267938],"study_design_scores_gemma":[0.000109230175,0.00012298363,0.0001822481,0.0000064361225,9.866957e-7,0.000014712084,0.000012807424,0.5562772,0.00021018504,0.44287017,0.0001247259,0.000068303154],"about_ca_topic_score_codex":6.087851e-7,"about_ca_topic_score_gemma":9.959697e-7,"teacher_disagreement_score":0.9237979,"about_ca_system_score_codex":0.00004879504,"about_ca_system_score_gemma":0.00016309078,"threshold_uncertainty_score":0.4063629},"labels":[],"label_agreement":null},{"id":"W4390308275","doi":"","title":"Oussama Hamza - Hilbert series and mild groups","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Series (stratigraphy); Mathematics; Hilbert–Poincaré series; Pure mathematics; Geology; Paleontology","score_opus":0.014082327291835981,"score_gpt":0.2231270913868754,"score_spread":0.20904476409503941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390308275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07116948,0.005121706,0.825944,0.03972106,0.0010310664,0.0007843647,0.000066961074,0.0010269197,0.05513446],"genre_scores_gemma":[0.67329204,0.0022260756,0.29879194,0.0007326548,0.000058253758,0.0002690881,0.00035080794,0.00007576889,0.024203328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945017,0.0030057884,0.0004410681,0.0011548088,0.00047565906,0.00042097233],"domain_scores_gemma":[0.99513453,0.00084698584,0.00039866113,0.0028197812,0.0005934829,0.00020652902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026628533,0.00038140654,0.00040100483,0.00018673013,0.0006948398,0.0006566421,0.0026223506,0.00019743158,0.00016230822],"category_scores_gemma":[0.00053266645,0.0004015129,0.00015990958,0.0004284045,0.0002609176,0.0004544922,0.0069584106,0.00086778967,0.000020662348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090612275,0.00024461324,0.0010975539,0.000115917624,0.000049695183,0.000018732471,0.008110112,0.000121006895,0.00029753396,0.9473083,0.001237634,0.04138985],"study_design_scores_gemma":[0.0019073201,0.00000600404,0.0189893,0.0016870691,0.00010140991,0.00023919491,0.0006994848,0.05136974,0.018247442,0.57223934,0.3313126,0.003201119],"about_ca_topic_score_codex":0.00028141617,"about_ca_topic_score_gemma":0.0004513766,"teacher_disagreement_score":0.6021226,"about_ca_system_score_codex":0.00010672591,"about_ca_system_score_gemma":0.00018723372,"threshold_uncertainty_score":0.99984366},"labels":[],"label_agreement":null},{"id":"W4390545226","doi":"10.1007/978-3-031-30488-0_3","title":"Relations and Functions","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Equivalence relation; Relation (database); Algebra over a field; Graph theory; Graph; Order (exchange); Mathematics; Function (biology); Computation; Equivalence (formal languages); Object (grammar); Matrix (chemical analysis); Discrete mathematics; Computer science; Pure mathematics; Combinatorics; Algorithm; Artificial intelligence","score_opus":0.014872221680393538,"score_gpt":0.22764792471195655,"score_spread":0.212775703031563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390545226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003139548,0.00116347,0.76893944,0.00032853382,0.00015353493,0.00013604034,0.00026519562,0.000106128384,0.2289045],"genre_scores_gemma":[0.0014754016,0.00094238477,0.567633,0.00020956156,0.000119216966,0.000028878301,0.000019502595,0.00008058361,0.42949146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897224,0.0000066834646,0.0002608622,0.0003931784,0.00021195176,0.0001551017],"domain_scores_gemma":[0.9979397,0.0014471665,0.00011523856,0.0003621258,0.00004396043,0.00009180004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089460125,0.000290749,0.00031232528,0.00016434315,0.00020248008,0.00021971705,0.00016577479,0.00016987365,0.00010299306],"category_scores_gemma":[0.0001728127,0.00022879886,0.00004565868,0.000034053894,0.00010505139,0.000045752327,0.00011847846,0.00032401498,0.00016848683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9300276e-7,0.000009313565,1.8023012e-7,0.00012978284,0.000051864467,0.000020760428,0.00015569941,0.000015943073,0.0000035504665,0.96778995,0.0033738841,0.028448256],"study_design_scores_gemma":[0.000026599657,0.000055617667,0.0000044142525,0.00020724579,0.00010574659,0.000033971002,0.000007774281,0.009432026,0.000008161904,0.94500285,0.044866934,0.00024862998],"about_ca_topic_score_codex":5.672289e-7,"about_ca_topic_score_gemma":0.0000074739974,"teacher_disagreement_score":0.20130645,"about_ca_system_score_codex":0.00002473307,"about_ca_system_score_gemma":0.000031834137,"threshold_uncertainty_score":0.9330147},"labels":[],"label_agreement":null},{"id":"W4390918529","doi":"10.28924/2291-8639-22-2024-13","title":"Associative Types in a Semi-Brouwerian Almost Distributive Lattice With Respect to the Binary Operation ρ","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Thailand Science Research and Innovation; University of Phayao","keywords":"Associative property; Distributive property; Commutative property; Mathematics; Binary number; Lattice (music); Binary operation; Pure mathematics; Algebraic number; Algebraic structure; Algebra over a field; Discrete mathematics; Arithmetic; Mathematical analysis; Physics","score_opus":0.008266250181469153,"score_gpt":0.29283596558465114,"score_spread":0.284569715403182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390918529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03409403,0.0003822324,0.94603556,0.01896186,0.00005008341,0.00009480156,0.000022355744,0.000010232264,0.00034885705],"genre_scores_gemma":[0.995505,0.000078466684,0.003918798,0.00025853724,0.00012505452,0.000019002668,0.000007772551,0.0000023297846,0.000085048174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993275,0.000039778657,0.00019677421,0.00014031213,0.00023003343,0.00006563498],"domain_scores_gemma":[0.9993868,0.00016391624,0.00009230209,0.00009456444,0.00022444711,0.0000379794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026293937,0.00005806508,0.00010590932,0.000240178,0.00006428391,0.00023502728,0.00037695438,0.000016219663,0.000008606086],"category_scores_gemma":[0.000025685746,0.000034330045,0.000054837215,0.001015141,0.000020684543,0.0002944262,0.00006334586,0.00011591673,0.0000071943823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010633561,0.0003449155,0.020156877,0.00000832688,0.004212822,0.00018505743,0.0068869875,0.050728284,0.001852624,0.8097066,0.0011029466,0.10470821],"study_design_scores_gemma":[0.0012397693,0.00087033754,0.48754483,0.0003195293,0.0013035343,0.00030589904,0.0028756487,0.28066838,0.002211417,0.06426679,0.15756157,0.0008322823],"about_ca_topic_score_codex":0.00001778615,"about_ca_topic_score_gemma":0.00012769384,"teacher_disagreement_score":0.96141094,"about_ca_system_score_codex":0.000082211416,"about_ca_system_score_gemma":0.00005351375,"threshold_uncertainty_score":0.22663735},"labels":[],"label_agreement":null},{"id":"W4391039965","doi":"10.33232/bims.0092.27.32","title":"Weak Sequential Completeness of Uniform Algebras","year":2023,"lang":"en","type":"article","venue":"Irish Mathematical Society Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Completeness (order theory); Mathematics; Computer science; Mathematical analysis","score_opus":0.03676733620199794,"score_gpt":0.2795841642365702,"score_spread":0.24281682803457225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391039965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031705443,0.000048111957,0.9469639,0.0072505455,0.00019619665,0.00028667809,0.000009319469,0.0007540601,0.012785719],"genre_scores_gemma":[0.61537206,0.00007928331,0.37946332,0.001424059,0.00022700988,0.00007733628,0.0000249115,0.00005743697,0.0032745455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821836,0.00004737932,0.00044821805,0.0003550994,0.000475955,0.00045496222],"domain_scores_gemma":[0.9987476,0.00036599435,0.00014294927,0.00052534585,0.00009220868,0.00012593929],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005286399,0.0001833653,0.0003658104,0.00003284357,0.00014258559,0.00006414051,0.00089718594,0.00011707604,0.0004978571],"category_scores_gemma":[0.00011140649,0.00015396342,0.00032223112,0.0006287287,0.00020629534,0.000100839046,0.00053743523,0.00018362055,0.0015633851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051803318,0.0002264162,0.000064689775,0.00037666992,0.000085372405,0.000019115188,0.0014289101,0.0002377196,0.0019729307,0.8059684,0.18564168,0.003972902],"study_design_scores_gemma":[0.0011711724,0.00018173206,0.0010188135,0.00017359761,0.00003773311,0.000053885164,0.0010282326,0.07667607,0.004295638,0.8328862,0.08170352,0.0007733916],"about_ca_topic_score_codex":0.000004214445,"about_ca_topic_score_gemma":1.6383562e-7,"teacher_disagreement_score":0.5836666,"about_ca_system_score_codex":0.000033546738,"about_ca_system_score_gemma":0.000035968376,"threshold_uncertainty_score":0.999214},"labels":[],"label_agreement":null},{"id":"W4391148175","doi":"10.55016/ojs/cdm.v18i2.74005","title":"Structural theory of trees II. Completeness and completions of trees","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Completeness (order theory); Combinatorics; Discrete mathematics","score_opus":0.028014663443532727,"score_gpt":0.2949397485622686,"score_spread":0.2669250851187359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30237284,0.000102749735,0.69560975,0.00076973304,0.00007113553,0.000265592,0.0004233346,0.00012821912,0.0002566582],"genre_scores_gemma":[0.97873765,0.00000846482,0.02103877,0.000026604914,0.000015929689,0.000019712139,0.000029181017,0.000006880549,0.000116798255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989323,0.000057631234,0.0003916473,0.0001929542,0.00018915502,0.00023634003],"domain_scores_gemma":[0.9985927,0.00048685927,0.00015972501,0.000465324,0.00020617049,0.00008922836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027294856,0.00013381972,0.00035994523,0.00016259127,0.00025376433,0.000026357946,0.00046442877,0.000040102066,0.00001578277],"category_scores_gemma":[0.00035958303,0.0001063831,0.000096754215,0.000687817,0.00020142677,0.00014853693,0.00044616943,0.00006328462,0.000007834488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003339132,0.000023095252,0.00013552653,0.000035242232,0.000029256247,0.0000012377699,0.0012159959,0.0005074662,0.0031893945,0.9937151,0.00010392687,0.0010404221],"study_design_scores_gemma":[0.0005407612,0.00020354283,0.030441275,0.00012289447,0.00004938761,0.000016546006,0.0007977962,0.064381875,0.0025520562,0.90031165,0.00032649876,0.00025569208],"about_ca_topic_score_codex":0.0000027274118,"about_ca_topic_score_gemma":0.000021048063,"teacher_disagreement_score":0.6763648,"about_ca_system_score_codex":0.000017960489,"about_ca_system_score_gemma":0.000029459463,"threshold_uncertainty_score":0.4338177},"labels":[],"label_agreement":null},{"id":"W4391463244","doi":"","title":"Density functional with full exact exchange, balanced nonlocality of correlations, and constraint satisfaction","year":2024,"lang":"en","type":"article","venue":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Chemistry; Los Alamos National Laboratory; National Nuclear Security Administration; Natural Sciences and Engineering Research Council of Canada; Division of Materials Research; U.S. Department of Energy; National Science Foundation","keywords":"Quantum nonlocality; Constraint (computer-aided design); Constraint satisfaction problem; Constraint satisfaction; Mathematics; Statistical physics; Physics; Quantum mechanics; Statistics; Geometry; Quantum entanglement; Quantum","score_opus":0.011780203011734183,"score_gpt":0.21947593307683208,"score_spread":0.2076957300650979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391463244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22154944,0.00020895003,0.7744103,0.00014751243,0.00024211955,0.0001250748,0.000048441514,0.000076112825,0.0031920644],"genre_scores_gemma":[0.98524624,0.000041617095,0.014456975,0.000030829564,0.000008620605,0.000009820525,0.00017229262,0.0000023561345,0.0000312499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988617,0.000022205762,0.00040925806,0.00021662613,0.00036352387,0.00012670433],"domain_scores_gemma":[0.9991324,0.00016295497,0.00020532394,0.0002174689,0.00020808355,0.000073778254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032413573,0.00011481855,0.00018932419,0.00017956723,0.00012046225,0.00007794053,0.00010760092,0.00006683096,0.000024337567],"category_scores_gemma":[0.0000396484,0.000090209636,0.000039427905,0.00044396013,0.0005614163,0.0011556683,0.000107566244,0.00008145726,0.0000024963313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013232886,0.000125186,0.0050728405,0.00030853096,0.00006330477,0.000002829216,0.000024013285,0.00077193213,0.0033944796,0.9546103,0.00082919793,0.034665044],"study_design_scores_gemma":[0.0013074375,0.0010530504,0.9527393,0.00041939758,0.00010287244,0.00029186648,0.00003606907,0.011762323,0.008275803,0.014388281,0.009073414,0.00055016397],"about_ca_topic_score_codex":0.000016863563,"about_ca_topic_score_gemma":0.000029904639,"teacher_disagreement_score":0.94766647,"about_ca_system_score_codex":0.000025113977,"about_ca_system_score_gemma":0.00009863683,"threshold_uncertainty_score":0.36786422},"labels":[],"label_agreement":null},{"id":"W4391552187","doi":"10.1007/978-3-031-37792-1_2","title":"Algebra as a Semiotic Modeling System","year":2023,"lang":"en","type":"book-chapter","venue":"Mathematics in mind","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Toronto","funders":"","keywords":"Semiotics; Algebra over a field; Computer science; Mathematics; Linguistics; Pure mathematics; Philosophy","score_opus":0.04548751095814036,"score_gpt":0.2590523161870866,"score_spread":0.21356480522894622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391552187","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028936574,0.00019054225,0.5460816,0.000048373888,0.000433498,0.0003574497,0.000004437127,0.00022355276,0.45237115],"genre_scores_gemma":[0.040684592,0.000105637155,0.27937284,0.00012893917,0.0003407954,0.000060628958,0.00001708079,0.00025957773,0.67902994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979471,0.000013413252,0.00064458273,0.0005662617,0.00046531163,0.00036330576],"domain_scores_gemma":[0.99837005,0.00025739436,0.00024022693,0.0009873736,0.000055168206,0.00008976241],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043885826,0.00037228875,0.00058656343,0.0003182031,0.00006667079,0.00010940292,0.0010832722,0.0003181929,0.000038779475],"category_scores_gemma":[0.00007237373,0.0003448012,0.000139521,0.0001160241,0.000026774778,0.00012850792,0.00047738053,0.00045738422,0.0028552662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.4835715e-7,0.000012578592,2.1062057e-7,0.00037807788,0.000018460723,0.00024978214,0.00089442765,0.0024245486,0.0000034182235,0.99422055,0.000033699056,0.0017636645],"study_design_scores_gemma":[0.00008481301,0.000018490498,8.926156e-8,0.0011416432,0.000012617286,0.00006302853,0.00007553934,0.4403086,0.000009868705,0.5577618,0.00025421477,0.00026931605],"about_ca_topic_score_codex":0.0000018603945,"about_ca_topic_score_gemma":0.0000072711114,"teacher_disagreement_score":0.43788406,"about_ca_system_score_codex":0.00016228437,"about_ca_system_score_gemma":0.00008020075,"threshold_uncertainty_score":0.9999004},"labels":[],"label_agreement":null},{"id":"W4391584293","doi":"10.1017/jsl.2023.86","title":"BETWEENNESS ALGEBRAS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Betweenness centrality; Mathematics; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.026899806867492472,"score_gpt":0.2764968481607703,"score_spread":0.24959704129327784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391584293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6885646,0.00074676215,0.29607588,0.006760256,0.0021608754,0.00012551315,0.0000014701595,0.00035952908,0.00520514],"genre_scores_gemma":[0.9898919,0.0001430274,0.008573299,0.00065305893,0.00042707848,0.0000015969952,5.3399066e-7,0.00000815152,0.0003013373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987237,0.00005792991,0.0003955019,0.0001578231,0.00034649984,0.00031855152],"domain_scores_gemma":[0.99900746,0.0001460069,0.00029081776,0.00027498373,0.00013704943,0.00014365566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049994385,0.00012049071,0.00028037347,0.0002831413,0.000091942966,0.000070264294,0.001048563,0.00006171555,0.000025015474],"category_scores_gemma":[0.000107712855,0.00008492166,0.0001464851,0.0009932012,0.000041515053,0.0005517149,0.00018619903,0.00023066836,0.00029469817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014643538,0.00013844197,0.0052636643,0.000036691006,0.00010442457,0.0013839988,0.0014898425,0.0014574912,0.0035935175,0.8478396,0.009879711,0.128798],"study_design_scores_gemma":[0.00078195345,0.00041574406,0.06745207,0.000051458923,0.000019696761,0.00071117777,0.00018079185,0.0015444611,0.0014203608,0.9148976,0.012196636,0.0003280192],"about_ca_topic_score_codex":0.0000010017251,"about_ca_topic_score_gemma":3.5404807e-7,"teacher_disagreement_score":0.30132735,"about_ca_system_score_codex":0.000030849937,"about_ca_system_score_gemma":0.000068824076,"threshold_uncertainty_score":0.3787847},"labels":[],"label_agreement":null},{"id":"W4392052380","doi":"10.1017/s1755020324000029","title":"CONCEPTUAL DISTANCE AND ALGEBRAS OF CONCEPTS","year":2024,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"National Research, Development and Innovation Office; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal","keywords":"Computer science; Epistemology; Philosophy","score_opus":0.0198412161129098,"score_gpt":0.3032918123619987,"score_spread":0.2834505962490889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392052380","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00395214,0.899111,0.089687,0.002403606,0.0002120694,0.00035074333,0.0000066584334,0.00008860614,0.0041881893],"genre_scores_gemma":[0.88359505,0.11323348,0.0018110152,0.0011859062,0.00004197368,0.000014494002,0.00000113344,0.000005786253,0.00011118682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998954,0.000110374356,0.00034465193,0.00024150193,0.00018948622,0.00016000953],"domain_scores_gemma":[0.9990608,0.00027611072,0.00012091017,0.00045103175,0.000049829894,0.00004133032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004106115,0.0001249366,0.00038275958,0.000024615969,0.000038145125,0.000016239337,0.0006324598,0.000027911716,0.000048385864],"category_scores_gemma":[0.00008065023,0.00006744998,0.00009325927,0.00040198173,0.00050967536,0.00016681323,0.00018679799,0.00010914228,0.00001965907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.1752957e-7,0.000008418692,0.000016085603,0.0015306867,0.0000128187585,0.0000040399677,0.000388783,0.0000017035408,0.00013596234,0.95953393,0.00028027638,0.03808668],"study_design_scores_gemma":[0.00047333233,0.0005158185,0.0017178799,0.02414237,0.0001801958,0.0002487122,0.0003384796,0.002154213,0.0032146908,0.80678856,0.15950161,0.0007241575],"about_ca_topic_score_codex":0.0000025738193,"about_ca_topic_score_gemma":3.7120927e-7,"teacher_disagreement_score":0.8796429,"about_ca_system_score_codex":0.000009421572,"about_ca_system_score_gemma":0.00004591996,"threshold_uncertainty_score":0.27505302},"labels":[],"label_agreement":null},{"id":"W4392637377","doi":"10.1007/978-3-031-42891-3_2","title":"Kernel and Trace Relations","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Congruence relation; TRACE (psycholinguistics); Lattice (music); Mathematics; Kernel (algebra); Combinatorics; Discrete mathematics; Physics; Philosophy","score_opus":0.0155686426725085,"score_gpt":0.2366489406717833,"score_spread":0.2210802979992748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392637377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007239139,0.0026421535,0.81272334,0.0003891924,0.00013286268,0.00018526272,0.00023956221,0.00011718297,0.18356323],"genre_scores_gemma":[0.0028155511,0.0015295774,0.7403999,0.0001950781,0.00010813812,0.000022888511,0.000009994244,0.00009640871,0.25482246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988114,0.000008324538,0.0002997818,0.00044532702,0.00025444667,0.00018070498],"domain_scores_gemma":[0.9977518,0.0015697071,0.00014405377,0.0003910931,0.00004133654,0.00010205419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011761145,0.0003386189,0.00038118215,0.00014285735,0.0001551656,0.00024194086,0.0002271135,0.0001995193,0.000073304574],"category_scores_gemma":[0.00018597506,0.00026613325,0.000049597216,0.00003112676,0.0001134078,0.000049460272,0.00012140061,0.00035819484,0.000103416125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010991241,0.000010972877,1.5048575e-7,0.00019612591,0.000047982703,0.000039292834,0.00031828394,0.000018486357,0.000004455724,0.96369183,0.001654928,0.0340164],"study_design_scores_gemma":[0.000034371144,0.000055490847,0.000005669688,0.00029028876,0.00009319111,0.000040429906,0.000007783393,0.017693317,0.000018991454,0.95640177,0.025061103,0.00029762695],"about_ca_topic_score_codex":6.853764e-7,"about_ca_topic_score_gemma":0.0000064726964,"teacher_disagreement_score":0.07232341,"about_ca_system_score_codex":0.000026017544,"about_ca_system_score_gemma":0.000033685432,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W4392666941","doi":"10.1007/978-3-031-42891-3_3","title":"Bands","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lattice (music); Mathematics; Pure mathematics; Condensed matter physics; Combinatorics; Physics","score_opus":0.015450448833951871,"score_gpt":0.2355534547501101,"score_spread":0.22010300591615822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392666941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.80684e-7,0.0010262332,0.65143985,0.0001827866,0.00021857824,0.00013026613,0.00019726602,0.00013285717,0.3466712],"genre_scores_gemma":[0.0011740619,0.0012415716,0.677317,0.00044856512,0.00021584843,0.00002678189,0.000016201131,0.00013091031,0.31942904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856627,0.0000068728127,0.00033296266,0.00049663644,0.00035994,0.0002373109],"domain_scores_gemma":[0.99787027,0.0012438481,0.00015282554,0.00057302916,0.00005037798,0.000109665234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012700415,0.00042198028,0.00048246668,0.00017244712,0.00011885028,0.00027281087,0.00043311194,0.00022046114,0.00015206498],"category_scores_gemma":[0.00014932756,0.00031655605,0.00008503833,0.000033768905,0.000092143215,0.000038635244,0.00016560026,0.0003792864,0.00026041458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013893731,0.0000123616355,3.4968195e-8,0.0002857956,0.00006085886,0.00008647145,0.0001510681,0.000011606306,0.000005112095,0.9485199,0.0037302026,0.047135238],"study_design_scores_gemma":[0.000031063584,0.0000776222,6.96465e-7,0.00034193104,0.00007535858,0.00003090844,0.00000311939,0.009189316,0.00007156904,0.9339337,0.0558894,0.00035532838],"about_ca_topic_score_codex":4.2164046e-7,"about_ca_topic_score_gemma":0.0000034934376,"teacher_disagreement_score":0.052159198,"about_ca_system_score_codex":0.000033791246,"about_ca_system_score_gemma":0.000041843414,"threshold_uncertainty_score":0.99992865},"labels":[],"label_agreement":null},{"id":"W4393069964","doi":"10.28924/2291-8639-22-2024-57","title":"On KU-Modules Over KU-Algebras","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ku band; Pure mathematics; Mathematics education; Algebra over a field; Electrical engineering; Engineering","score_opus":0.007255882374956657,"score_gpt":0.289855013175115,"score_spread":0.2825991308001583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393069964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03340439,0.0006696692,0.9625796,0.0021345178,0.0001487953,0.000033099128,0.000006722196,0.000025101734,0.0009981252],"genre_scores_gemma":[0.9920916,0.00025444417,0.0067996774,0.00039609367,0.00026561448,0.0000068887343,0.000003909631,0.0000036158033,0.00017818072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991421,0.0000158366,0.00026609952,0.00017458416,0.00032749807,0.000073879164],"domain_scores_gemma":[0.99935263,0.00014767221,0.00011899081,0.00014977675,0.00016561704,0.00006531706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015003477,0.00007516201,0.000129988,0.00049010705,0.000052261767,0.00027115797,0.0005273065,0.000024743475,0.00005952662],"category_scores_gemma":[0.000014985793,0.000055980054,0.00018859736,0.0005785165,0.000030069183,0.0003236358,0.000066612614,0.00012160974,0.000021676778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031284767,0.00005308762,0.00035209188,0.0000020050895,0.0006713712,0.000018710429,0.000064824046,0.0011354795,0.00032745246,0.90479165,0.00039928852,0.09218092],"study_design_scores_gemma":[0.00035405354,0.000130211,0.031004269,0.00006766181,0.00046632226,0.00013911103,0.00005238929,0.07165176,0.0010543371,0.797793,0.09698469,0.00030220457],"about_ca_topic_score_codex":0.0000040023406,"about_ca_topic_score_gemma":0.000004364636,"teacher_disagreement_score":0.9586872,"about_ca_system_score_codex":0.000032754542,"about_ca_system_score_gemma":0.000025495508,"threshold_uncertainty_score":0.26147828},"labels":[],"label_agreement":null},{"id":"W4393147537","doi":"10.1609/aaai.v38i9.28911","title":"Approximation Algorithms for Preference Aggregation Using CP-Nets","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preference; Computer science; Algorithm; Mathematics; Statistics","score_opus":0.18741315148499102,"score_gpt":0.3373779337649477,"score_spread":0.14996478227995666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036280148,0.000100737285,0.9585433,0.0015000544,0.00082641025,0.0007400939,0.000007494751,0.00020841071,0.0017933463],"genre_scores_gemma":[0.9458953,0.000027333357,0.053659428,0.000095457566,0.00010310607,0.00006216547,0.0000011783692,0.000013720867,0.00014231722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982524,0.000012155318,0.00046328438,0.00057258765,0.0003841279,0.00031543162],"domain_scores_gemma":[0.9988329,0.00013077968,0.00023269064,0.00023243079,0.0005093546,0.00006184888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041244453,0.00021317755,0.00020086905,0.00015205459,0.00021309042,0.00043698592,0.0012309616,0.00009464744,0.000016226333],"category_scores_gemma":[0.00026618195,0.00015671882,0.00012315201,0.0007320805,0.00014599411,0.00094526995,0.0002008364,0.00020891849,0.00002953789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013206125,0.000034750738,0.0000070033007,0.00008111246,0.000008091552,1.7701805e-7,0.0006139057,0.00023320604,0.030625103,0.751461,0.000030212335,0.21689221],"study_design_scores_gemma":[0.000009420753,0.00007123333,0.000008825896,0.00021214412,0.000006967468,0.0000033028064,0.00007622809,0.41075704,0.24165505,0.34701854,0.00007816869,0.00010307779],"about_ca_topic_score_codex":0.000009333116,"about_ca_topic_score_gemma":0.0000019739832,"teacher_disagreement_score":0.90961516,"about_ca_system_score_codex":0.00007115152,"about_ca_system_score_gemma":0.000118797805,"threshold_uncertainty_score":0.63908076},"labels":[],"label_agreement":null},{"id":"W4393684463","doi":"10.5281/zenodo.3767061","title":"Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem","year":2020,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Mathematics; Discrete mathematics; Calculus (dental); Combinatorics; Geometry","score_opus":0.0281427963890309,"score_gpt":0.2507977456145658,"score_spread":0.22265494922553491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393684463","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001689237,0.00010542107,0.11893328,0.0021810133,0.00026796275,0.0025317762,0.8704637,0.0010252695,0.004474656],"genre_scores_gemma":[0.000747253,0.00013825609,0.006439998,0.00044300908,0.0002609363,9.329606e-7,0.9910066,0.0007488698,0.00021415873],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968841,0.00044424104,0.0004958352,0.0011035769,0.00048110718,0.0005911129],"domain_scores_gemma":[0.9979308,0.000083509425,0.00024418673,0.001087352,0.00042052363,0.0002335768],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008198992,0.0003163633,0.0003803495,0.00027782875,0.0010209035,0.000889516,0.0036581922,0.00019464876,0.0016764649],"category_scores_gemma":[0.00084991526,0.0003142632,0.000096802476,0.0010534105,0.00015095386,0.0004949227,0.002805183,0.00066621444,0.0037682035],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003285078,0.00013710592,4.9725827e-7,0.0003144463,0.00001842546,0.000017280949,0.00015330726,0.000033174372,0.000028410375,0.007154748,0.9582402,0.033869516],"study_design_scores_gemma":[0.00057124806,0.0003628567,0.000034365963,0.00006305589,0.00001010616,0.00002722301,0.000015957217,0.00052368734,0.00003791849,0.006816937,0.9912141,0.00032256707],"about_ca_topic_score_codex":0.000017190865,"about_ca_topic_score_gemma":0.0000051845004,"teacher_disagreement_score":0.12054286,"about_ca_system_score_codex":0.00034222507,"about_ca_system_score_gemma":0.000022235517,"threshold_uncertainty_score":0.9999309},"labels":[],"label_agreement":null},{"id":"W43937067","doi":"","title":"Lattices associated with finite vector spaces and finite affine spaces.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Affine transformation; Pure mathematics; Vector space","score_opus":0.016066743740976212,"score_gpt":0.22117527866337816,"score_spread":0.20510853492240194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43937067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937267,0.00055232114,0.0021931997,0.0008981987,0.0006005866,0.00015503472,0.0000034476284,0.00031417538,0.0015563401],"genre_scores_gemma":[0.9966289,0.000094798976,0.0022620927,0.0002193219,0.000011628341,0.000011468233,0.000004997675,0.000015798008,0.00075099996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865615,0.000075381016,0.00016481758,0.00043269113,0.0002975753,0.00037340692],"domain_scores_gemma":[0.9985776,0.000637921,0.00016046311,0.0003856774,0.000097691714,0.00014065046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001485691,0.00022125259,0.00027261334,0.00008813259,0.00029213066,0.00013279596,0.0004392966,0.000083839375,0.000016224314],"category_scores_gemma":[0.00023849467,0.00017788437,0.000035442852,0.00058294344,0.00015615216,0.00063100224,0.00019419355,0.00019589749,0.00003216353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004191991,0.0004020568,0.06953499,0.000026965985,0.0001474757,0.0005338116,0.0033624645,0.0007672384,0.00019172086,0.9217784,0.0011429816,0.0020700207],"study_design_scores_gemma":[0.008817222,0.0027416663,0.40333933,0.00031411016,0.00009193756,0.00015093472,0.00020934992,0.039112277,0.0022438825,0.5274219,0.013171929,0.0023854792],"about_ca_topic_score_codex":0.00001671122,"about_ca_topic_score_gemma":0.000024352988,"teacher_disagreement_score":0.39435646,"about_ca_system_score_codex":0.00003286549,"about_ca_system_score_gemma":0.000058914593,"threshold_uncertainty_score":0.7253914},"labels":[],"label_agreement":null},{"id":"W4393820539","doi":"10.5281/zenodo.3767062","title":"Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem","year":2020,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Mathematics; Discrete mathematics; Calculus (dental); Combinatorics; Geometry","score_opus":0.0281427963890309,"score_gpt":0.2507977456145658,"score_spread":0.22265494922553491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393820539","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001689237,0.00010542107,0.11893328,0.0021810133,0.00026796275,0.0025317762,0.8704637,0.0010252695,0.004474656],"genre_scores_gemma":[0.000747253,0.00013825609,0.006439998,0.00044300908,0.0002609363,9.329606e-7,0.9910066,0.0007488698,0.00021415873],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968841,0.00044424104,0.0004958352,0.0011035769,0.00048110718,0.0005911129],"domain_scores_gemma":[0.9979308,0.000083509425,0.00024418673,0.001087352,0.00042052363,0.0002335768],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008198992,0.0003163633,0.0003803495,0.00027782875,0.0010209035,0.000889516,0.0036581922,0.00019464876,0.0016764649],"category_scores_gemma":[0.00084991526,0.0003142632,0.000096802476,0.0010534105,0.00015095386,0.0004949227,0.002805183,0.00066621444,0.0037682035],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003285078,0.00013710592,4.9725827e-7,0.0003144463,0.00001842546,0.000017280949,0.00015330726,0.000033174372,0.000028410375,0.007154748,0.9582402,0.033869516],"study_design_scores_gemma":[0.00057124806,0.0003628567,0.000034365963,0.00006305589,0.00001010616,0.00002722301,0.000015957217,0.00052368734,0.00003791849,0.006816937,0.9912141,0.00032256707],"about_ca_topic_score_codex":0.000017190865,"about_ca_topic_score_gemma":0.0000051845004,"teacher_disagreement_score":0.12054286,"about_ca_system_score_codex":0.00034222507,"about_ca_system_score_gemma":0.000022235517,"threshold_uncertainty_score":0.9999309},"labels":[],"label_agreement":null},{"id":"W4394008684","doi":"10.1016/j.jmateco.2024.102983","title":"Smallest quasi-transitive extensions","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Economics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Transitive relation; Transitive closure; Extension (predicate logic); Closure (psychology); Mathematics; Context (archaeology); Operator (biology); Property (philosophy); Path (computing); Mathematical economics; Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Epistemology; Economics","score_opus":0.018510853443297236,"score_gpt":0.24884564604514683,"score_spread":0.2303347926018496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394008684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04775184,0.0003635771,0.94535285,0.003008254,0.00040326276,0.00004016057,0.0000012068158,0.000030962383,0.0030479028],"genre_scores_gemma":[0.8676936,0.00016167325,0.13143526,0.0003710945,0.00019133688,0.0000010715792,1.418959e-7,0.000009936667,0.00013586589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999217,0.00001644314,0.00043047225,0.00012401765,0.000068630405,0.00014343772],"domain_scores_gemma":[0.9991521,0.0004048212,0.00009823636,0.0001694835,0.00005378248,0.000121543235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034769787,0.0000906049,0.00023774095,0.00009135266,0.000037223188,0.00013901509,0.0003691932,0.000044415436,0.00006883743],"category_scores_gemma":[0.00007501487,0.0000661982,0.00016491635,0.00008225611,0.000041214527,0.00040499185,0.000056306133,0.00021255373,0.00015576926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030731833,0.000059174803,0.0000015011558,0.000026194439,0.000031618805,0.000119111486,0.00041743708,0.00027224614,0.000094196555,0.98691595,0.0002236503,0.011835846],"study_design_scores_gemma":[0.00012238004,0.00015571725,0.000041849922,0.000118152406,0.000016413975,0.001053023,0.00008945799,0.085831515,0.00021318387,0.910096,0.002155469,0.000106844906],"about_ca_topic_score_codex":1.0737966e-7,"about_ca_topic_score_gemma":4.8051095e-7,"teacher_disagreement_score":0.81994176,"about_ca_system_score_codex":0.000046250287,"about_ca_system_score_gemma":0.0000986524,"threshold_uncertainty_score":0.26994842},"labels":[],"label_agreement":null},{"id":"W4394250137","doi":"10.6084/m9.figshare.20556509","title":"The Cauchy Combination Test under Arbitrary Dependence Structures","year":2022,"lang":"en","type":"dataset","venue":"Figshare","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bruyère; Centre for Advancing Health Outcomes; University of British Columbia","funders":"","keywords":"Cauchy distribution; Mathematics; Test (biology); Statistics; Geology; Paleontology","score_opus":0.025510467312444052,"score_gpt":0.25976576476356833,"score_spread":0.23425529745112428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394250137","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1271237e-7,0.00080158585,0.000054217002,0.00021601735,0.00035043617,0.00022586374,0.9980773,0.00010359551,0.00017080124],"genre_scores_gemma":[0.000050915263,0.0000463627,0.00009550265,0.0009904064,0.00008630335,0.00021522383,0.99839824,0.00001051787,0.00010651505],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983678,0.00008345324,0.00019927887,0.0004933211,0.0005423497,0.0003138156],"domain_scores_gemma":[0.9976047,0.0009467523,0.00023700725,0.00107431,0.0000673846,0.00006979279],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000056403147,0.00024899552,0.00015928724,0.00007779813,0.0007027516,0.00034752858,0.0029934493,0.00013785475,0.18041061],"category_scores_gemma":[0.00070144265,0.00018146467,0.00008107528,0.00036035056,0.000013368777,0.00031457684,0.0012225065,0.0007706432,0.00048522136],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.7857906e-7,0.000017588833,2.0544833e-7,0.000034615077,0.000007104195,0.000043514174,0.000006217557,0.00004824799,2.839374e-7,0.0013133169,0.99742514,0.0011030869],"study_design_scores_gemma":[0.000080420206,0.000055739183,0.0002024286,0.00006672274,0.000004158156,0.000037508908,0.000008538976,0.00013172915,0.000011944201,0.022512775,0.9766429,0.00024510402],"about_ca_topic_score_codex":0.00001320187,"about_ca_topic_score_gemma":0.000063511434,"teacher_disagreement_score":0.17992538,"about_ca_system_score_codex":0.000085747684,"about_ca_system_score_gemma":0.0002024296,"threshold_uncertainty_score":0.8203386},"labels":[],"label_agreement":null},{"id":"W4394654486","doi":"10.48550/arxiv.math/0006035","title":"Double Sections and Dominating Maps","year":2000,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Waterloo","funders":"","keywords":"Geography; History","score_opus":0.04110017604536736,"score_gpt":0.2714127874498978,"score_spread":0.2303126114045304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394654486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92014533,0.0005561975,0.06522458,0.00063371414,0.00081431685,0.00022105136,0.0000041301746,0.00032388975,0.012076817],"genre_scores_gemma":[0.98396295,0.0001420518,0.013705701,0.00025762338,0.00022896947,0.00004620256,0.00000872652,0.000013898331,0.0016338846],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987069,0.000034195964,0.00021231416,0.0006422419,0.00013016335,0.00027421408],"domain_scores_gemma":[0.9990484,0.00006150245,0.00011056016,0.0006483216,0.00003937368,0.00009185616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012598652,0.00020883276,0.00021868604,0.000094889125,0.00023060602,0.00013162801,0.0005876798,0.00015927138,0.00003317006],"category_scores_gemma":[0.000013987244,0.00019723158,0.00007125875,0.00017017125,0.000057649107,0.0002498448,0.0009735191,0.00052707014,0.000109338296],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013011873,0.00079003716,0.430318,0.0009329599,0.00046046558,0.0006263777,0.014216545,0.025731178,0.0031463858,0.20520364,0.0051198266,0.31332445],"study_design_scores_gemma":[0.0049389424,0.00037033617,0.39738774,0.00082380936,0.00014427824,0.00045182873,0.00030767918,0.022253377,0.0123865055,0.48861277,0.06810396,0.0042187697],"about_ca_topic_score_codex":0.00004807036,"about_ca_topic_score_gemma":0.000015895717,"teacher_disagreement_score":0.3091057,"about_ca_system_score_codex":0.00003785869,"about_ca_system_score_gemma":0.00005408585,"threshold_uncertainty_score":0.804287},"labels":[],"label_agreement":null},{"id":"W4396234490","doi":"10.61091/jcmcc119-05","title":"On Real Algebras Admitting Reflections which Commute","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algebra over a field; Mathematics; Pure mathematics","score_opus":0.020823980840284174,"score_gpt":0.29852127922495497,"score_spread":0.2776972983846708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396234490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50134474,0.0012728682,0.40532935,0.0016114177,0.073398374,0.00050266087,0.000002707571,0.0006503072,0.015887571],"genre_scores_gemma":[0.9747689,0.00009644826,0.023359658,0.000059714217,0.0016616429,0.0000020158823,6.8234556e-7,0.00003615744,0.000014802939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971846,0.00015751159,0.0010978762,0.00036493473,0.00076097494,0.00043413904],"domain_scores_gemma":[0.99638784,0.001867168,0.0005754599,0.00042857317,0.00048604878,0.00025488413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017022201,0.00034162283,0.0006517464,0.00038011282,0.0004888315,0.00084322377,0.0009022325,0.0001741316,0.0000056897456],"category_scores_gemma":[0.0005823339,0.00028635206,0.0002125632,0.001008145,0.000059921338,0.0006203406,0.0003996413,0.0009785948,0.000012825407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019693638,0.00024185142,0.000010690279,0.00011346455,0.0000882891,0.00007706191,0.0012377535,0.000093098344,0.00036713592,0.9928335,0.000350429,0.004567013],"study_design_scores_gemma":[0.0011956242,0.0011535626,0.000031213523,0.00065626774,0.00005010376,0.0003002003,0.0001287665,0.027643805,0.00052630197,0.9666195,0.0013792635,0.00031539937],"about_ca_topic_score_codex":0.00000549227,"about_ca_topic_score_gemma":6.9790025e-7,"teacher_disagreement_score":0.47342414,"about_ca_system_score_codex":0.00013819644,"about_ca_system_score_gemma":0.00025446326,"threshold_uncertainty_score":0.9999589},"labels":[],"label_agreement":null},{"id":"W4396914146","doi":"10.48550/arxiv.2405.07953","title":"On the Decidability of Monadic Theories of Arithmetic Predicates","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft; Keble College, University of Oxford; McGill University","keywords":"Decidability; Monadic predicate calculus; Arithmetic; Mathematics; Order (exchange); Second-order arithmetic; Discrete mathematics; Computer science; Algebra over a field; Higher-order logic; Programming language; Pure mathematics; Description logic; Economics; Peano axioms","score_opus":0.04283228105028316,"score_gpt":0.1803717045839098,"score_spread":0.13753942353362664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396914146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7386474,0.00023025104,0.25608373,0.00027259276,0.0003459033,0.00030007868,0.000025689073,0.00010586306,0.0039885086],"genre_scores_gemma":[0.9991089,0.00005098282,0.0005218053,0.00003955404,0.00001621014,0.000001296858,0.0000016366043,0.0000075246717,0.0002520748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870366,0.0001491007,0.00021084095,0.00064475846,0.00011317914,0.00017843414],"domain_scores_gemma":[0.99756205,0.000754128,0.00022275855,0.001286066,0.00011641743,0.000058580394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034349787,0.00019772601,0.00029212254,0.00014764644,0.000060815728,0.000025163035,0.0018277147,0.00013964874,0.000028569186],"category_scores_gemma":[0.00016427659,0.00014358839,0.00020641337,0.00057213276,0.00048763226,0.000074698786,0.0019824298,0.00047575808,0.000020076284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015437556,0.00006771171,0.00057298393,0.00013900186,0.000048354617,0.00002197481,0.00021198216,0.02638118,0.000027358194,0.9721209,0.000031010026,0.00036215066],"study_design_scores_gemma":[0.00006875444,0.00007869314,0.0009351467,0.000097460215,0.00004238502,8.506836e-7,0.000057370187,0.06716549,0.0012782108,0.93013537,0.000018057919,0.00012218501],"about_ca_topic_score_codex":0.00003916979,"about_ca_topic_score_gemma":0.0000085620295,"teacher_disagreement_score":0.2604615,"about_ca_system_score_codex":0.000060073395,"about_ca_system_score_gemma":0.0001618126,"threshold_uncertainty_score":0.5855364},"labels":[],"label_agreement":null},{"id":"W4398287565","doi":"10.7910/dvn/nggaq5/xe7f4j","title":"Stanford.tab","year":2019,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reading (process); Computer science; Information retrieval; Programming language; Linguistics; Philosophy","score_opus":0.01998431122796317,"score_gpt":0.24941821747139822,"score_spread":0.22943390624343504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398287565","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010055851,0.0000027003698,0.033736452,0.0000075965754,0.0020201737,0.00024419243,0.9634601,0.00011726957,0.00041055],"genre_scores_gemma":[0.0000029970374,0.0002451215,0.0057877596,0.000993572,0.00027800878,0.000013661131,0.9917867,0.000013360189,0.00087880244],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978607,0.000059128168,0.0003031788,0.000807859,0.000476947,0.0004921664],"domain_scores_gemma":[0.9957826,0.00009660444,0.00022918645,0.0036759577,0.00006070626,0.00015494258],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001857703,0.0003706791,0.00040142424,0.00017662729,0.00010264815,0.00023325246,0.0034500547,0.00024944157,0.00514036],"category_scores_gemma":[0.00009496091,0.00033310315,0.00012430134,0.00028305265,0.000057540517,0.0010408245,0.0017547345,0.00048440715,0.36296],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005455236,0.000034516383,9.023478e-7,0.00005847404,0.00002282236,0.00011734098,0.000007882583,0.000022357104,0.0000030002839,0.0018610581,0.9968891,0.0009770931],"study_design_scores_gemma":[0.000283893,0.00006037991,0.000007679112,0.00003897933,0.000021846983,0.000024198222,0.00000744468,0.00022098712,0.000009766908,0.00068338733,0.9982116,0.0004298066],"about_ca_topic_score_codex":0.000039405495,"about_ca_topic_score_gemma":0.000021168353,"teacher_disagreement_score":0.35781965,"about_ca_system_score_codex":0.00007764727,"about_ca_system_score_gemma":0.00018506941,"threshold_uncertainty_score":0.9999121},"labels":[],"label_agreement":null},{"id":"W4399318192","doi":"10.48550/arxiv.2406.01510","title":"Quasisymmetric divided differences","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics","score_opus":0.09212746304947608,"score_gpt":0.1906575328556589,"score_spread":0.09853006980618281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399318192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32617217,0.00064388895,0.6643975,0.00022072604,0.0015459679,0.00019608371,0.00001056057,0.0006297849,0.0061833276],"genre_scores_gemma":[0.99449646,0.00027096932,0.0017168842,0.00010336017,0.00010379304,0.0000012341169,0.0000047821595,0.000014157202,0.0032883263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997813,0.00010479778,0.0001854969,0.001381402,0.00011823563,0.00039709063],"domain_scores_gemma":[0.99826795,0.00018414765,0.00015002805,0.0011449776,0.00007818765,0.00017470859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014322785,0.00035574238,0.0003724229,0.0005676506,0.00013034622,0.00023674758,0.0024101867,0.00025738045,0.000040794974],"category_scores_gemma":[0.00004690947,0.00034258564,0.00027316724,0.0015772043,0.00009916158,0.00023598305,0.004875409,0.00081508554,0.0006850522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051488255,0.00006536856,0.0018129748,0.00011105615,0.000088033776,0.00057759415,0.00020012766,0.008307889,0.000008978,0.98430425,0.0003924812,0.004126123],"study_design_scores_gemma":[0.00014471312,0.000048770013,0.002675944,0.00008906885,0.00006023067,0.0000044410963,0.000054106895,0.17231278,0.00004550981,0.82380927,0.00028250724,0.00047265334],"about_ca_topic_score_codex":0.00005669721,"about_ca_topic_score_gemma":0.000015619577,"teacher_disagreement_score":0.6683243,"about_ca_system_score_codex":0.00014108396,"about_ca_system_score_gemma":0.00012185382,"threshold_uncertainty_score":0.9999026},"labels":[],"label_agreement":null},{"id":"W4399828396","doi":"10.32920/26052670.v1","title":"Polynomial Interpretation Logic on ω-Categorical Structures","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Interpretation (philosophy); Categorical variable; Mathematics; Polynomial; Algebra over a field; Computer science; Artificial intelligence; Mathematical economics; Pure mathematics; Programming language; Statistics; Mathematical analysis","score_opus":0.021183295005073696,"score_gpt":0.28934426294878024,"score_spread":0.26816096794370653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027590622,0.00036905898,0.9488516,0.0024072342,0.005011438,0.00023747116,0.0000030593867,0.0008125919,0.039548513],"genre_scores_gemma":[0.9734443,0.000012754181,0.023751723,0.0013748835,0.00036940505,0.000024083238,0.000011942118,0.000013628258,0.0009973241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998344,0.000060795668,0.00025194485,0.0008451016,0.00025605477,0.00024209313],"domain_scores_gemma":[0.9990572,0.00008662331,0.000080246224,0.00065933954,0.000034616125,0.00008199919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008872503,0.00028714185,0.0002477801,0.00018194564,0.000047866688,0.00033801908,0.0011062862,0.00025302448,0.00007462191],"category_scores_gemma":[0.00003472411,0.00020242455,0.00016092908,0.00015267234,0.000036822,0.00008002367,0.002246711,0.0009213947,0.00043734006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012719318,0.000019603925,0.000002074606,0.00004484912,0.00002384829,0.00005089516,0.00024103535,0.004838087,0.00005125107,0.92456204,0.00801183,0.062141765],"study_design_scores_gemma":[0.000057552777,0.00009010869,0.00012645034,0.000017783566,0.00000851193,0.000012690778,0.000007871056,0.07420483,0.00040458734,0.9238508,0.00095860485,0.00026023376],"about_ca_topic_score_codex":0.0000127752455,"about_ca_topic_score_gemma":0.0000035495752,"teacher_disagreement_score":0.9706852,"about_ca_system_score_codex":0.00011219869,"about_ca_system_score_gemma":0.000099301906,"threshold_uncertainty_score":0.82546335},"labels":[],"label_agreement":null},{"id":"W4399828414","doi":"10.32920/26052670","title":"Polynomial Interpretation Logic on ω-Categorical Structures","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Categorical variable; Interpretation (philosophy); Mathematics; Polynomial; Algebra over a field; Computer science; Pure mathematics; Calculus (dental); Statistics; Programming language; Medicine; Mathematical analysis","score_opus":0.021183295005073696,"score_gpt":0.28934426294878024,"score_spread":0.26816096794370653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027590622,0.00036905898,0.9488516,0.0024072342,0.005011438,0.00023747116,0.0000030593867,0.0008125919,0.039548513],"genre_scores_gemma":[0.9734443,0.000012754181,0.023751723,0.0013748835,0.00036940505,0.000024083238,0.000011942118,0.000013628258,0.0009973241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998344,0.000060795668,0.00025194485,0.0008451016,0.00025605477,0.00024209313],"domain_scores_gemma":[0.9990572,0.00008662331,0.000080246224,0.00065933954,0.000034616125,0.00008199919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008872503,0.00028714185,0.0002477801,0.00018194564,0.000047866688,0.00033801908,0.0011062862,0.00025302448,0.00007462191],"category_scores_gemma":[0.00003472411,0.00020242455,0.00016092908,0.00015267234,0.000036822,0.00008002367,0.002246711,0.0009213947,0.00043734006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012719318,0.000019603925,0.000002074606,0.00004484912,0.00002384829,0.00005089516,0.00024103535,0.004838087,0.00005125107,0.92456204,0.00801183,0.062141765],"study_design_scores_gemma":[0.000057552777,0.00009010869,0.00012645034,0.000017783566,0.00000851193,0.000012690778,0.000007871056,0.07420483,0.00040458734,0.9238508,0.00095860485,0.00026023376],"about_ca_topic_score_codex":0.0000127752455,"about_ca_topic_score_gemma":0.0000035495752,"teacher_disagreement_score":0.9706852,"about_ca_system_score_codex":0.00011219869,"about_ca_system_score_gemma":0.000099301906,"threshold_uncertainty_score":0.82546335},"labels":[],"label_agreement":null},{"id":"W4399836965","doi":"10.48550/arxiv.2406.12184","title":"Explaining Bell Locally","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs; Hasler Stiftung; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Quantum nonlocality; Physics; Quantum entanglement; Quantum mechanics; Quantum","score_opus":0.06420704654093809,"score_gpt":0.18768544265709794,"score_spread":0.12347839611615985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399836965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07470178,0.00033383883,0.9055565,0.00017280663,0.0013061832,0.00017441573,0.0000061013125,0.0007625291,0.016985843],"genre_scores_gemma":[0.99083865,0.00012316204,0.0044882363,0.00020647088,0.00012327463,8.6756637e-7,0.0000064368437,0.000021233778,0.004191687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979575,0.00006831254,0.00017138069,0.0013141644,0.00008911433,0.00039952068],"domain_scores_gemma":[0.9984194,0.00009022999,0.00012192767,0.0011258357,0.00007069755,0.0001719049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015785143,0.00032353503,0.00028713176,0.00024471054,0.00013373645,0.00016423842,0.0019693433,0.00025712996,0.000034782584],"category_scores_gemma":[0.000019197494,0.00035023806,0.0002180604,0.0005990285,0.00008862593,0.0002528721,0.0052297967,0.0009153622,0.00069898803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006651284,0.000028534441,0.00011245441,0.00007940682,0.000051200434,0.0014706911,0.0003624999,0.13264818,0.000020190288,0.862305,0.00036454826,0.0025506415],"study_design_scores_gemma":[0.00016091684,0.000042507287,0.000059718448,0.00014184088,0.000035860583,0.00000993165,0.00007884709,0.3856338,0.000097064796,0.61171806,0.0015726457,0.0004488335],"about_ca_topic_score_codex":0.000020571573,"about_ca_topic_score_gemma":0.00001380921,"teacher_disagreement_score":0.91613686,"about_ca_system_score_codex":0.00015653385,"about_ca_system_score_gemma":0.00020351209,"threshold_uncertainty_score":0.999895},"labels":[],"label_agreement":null},{"id":"W4399890286","doi":"10.18280/mmep.110630","title":"Roughness in S|U| -Submodules","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geology; Computer science","score_opus":0.020161687491719073,"score_gpt":0.21466960867819007,"score_spread":0.194507921186471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399890286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014541536,0.0014045197,0.98305404,0.00018452147,0.00008885792,0.000070546914,2.2133696e-7,0.00036550694,0.0002902433],"genre_scores_gemma":[0.8187349,0.000054641107,0.18108107,0.000009451716,0.000021271911,0.000022477117,2.9529377e-7,0.000010901977,0.000065013664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992849,0.000005312629,0.00016752296,0.00023866429,0.00009150776,0.00021207104],"domain_scores_gemma":[0.99968415,0.00010371453,0.000006849752,0.00014580355,0.00000632791,0.000053153046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017571353,0.00010843716,0.00013285209,0.00009160628,0.000019992267,0.00014860615,0.00015491851,0.00004391019,0.0000019734275],"category_scores_gemma":[0.000010285558,0.00008715715,0.000024222363,0.00021463793,0.000011023083,0.00024266895,0.00006120504,0.00014818752,0.0000175264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2083103e-7,0.000008029015,0.0000010241021,0.00028523832,0.0000022040435,0.000008381931,0.00039505714,0.5270727,0.00004787326,0.47003615,0.0000015996195,0.0021416117],"study_design_scores_gemma":[0.000029229908,0.0000074785567,0.0000023750165,0.0002455066,0.0000011699169,0.000015156021,0.0000026541406,0.70793074,0.000037695336,0.29142877,0.00021465107,0.000084536776],"about_ca_topic_score_codex":0.0000016235522,"about_ca_topic_score_gemma":1.4065698e-7,"teacher_disagreement_score":0.8041933,"about_ca_system_score_codex":0.00001371729,"about_ca_system_score_gemma":0.0000058907262,"threshold_uncertainty_score":0.35541654},"labels":[],"label_agreement":null},{"id":"W4400201718","doi":"10.1007/978-3-031-59797-8_17","title":"An Historical Perspective on Duality and Category Theory: Hom is where the heart is","year":2024,"lang":"en","type":"book-chapter","venue":"Science networks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Perspective (graphical); Duality (order theory); Mathematics; Mathematical economics; Epistemology; Pure mathematics; Sociology; Philosophy; Geometry","score_opus":0.018368764680324254,"score_gpt":0.2714086584554178,"score_spread":0.2530398937750935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400201718","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001427581,0.03706394,0.14153859,0.033273537,0.0067937453,0.0010143599,0.00002067422,0.0007282436,0.77942413],"genre_scores_gemma":[0.31348562,0.0018402642,0.0032998405,0.025175385,0.0031483585,0.000048397305,0.0000032860205,0.00012818682,0.65287066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699473,0.00005491927,0.00021826688,0.001500806,0.000722751,0.0005085171],"domain_scores_gemma":[0.99799246,0.00020580548,0.00011535177,0.0012770253,0.00016670812,0.00024264185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011878903,0.0003711403,0.0003206105,0.00013786704,0.0007449196,0.00053681876,0.0017174182,0.0002297817,0.00008212375],"category_scores_gemma":[0.000018699719,0.00023780503,0.00012304664,0.0003212015,0.0012123246,0.00051884394,0.0005130428,0.0010175161,0.00009255121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005981606,0.000010514645,0.000006007083,0.00000425918,0.000008005225,0.000014956228,0.001560851,0.00009150283,0.0000029758394,0.9820708,0.009814921,0.0064092083],"study_design_scores_gemma":[0.000047474077,0.00022402024,0.00007009201,0.00005819113,0.000016314962,0.000034593246,0.000118651646,0.012080558,0.0000060676516,0.8638458,0.12315055,0.000347687],"about_ca_topic_score_codex":0.000049579136,"about_ca_topic_score_gemma":0.000021737937,"teacher_disagreement_score":0.31334287,"about_ca_system_score_codex":0.00073819637,"about_ca_system_score_gemma":0.00023356733,"threshold_uncertainty_score":0.96974075},"labels":[],"label_agreement":null},{"id":"W4400455791","doi":"10.1007/s00012-024-00862-8","title":"On the networks of large embeddings","year":2024,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Nemzeti Közszolgálati Egyetem; National Research, Development and Innovation Office; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.007474076209313357,"score_gpt":0.22865733611692704,"score_spread":0.22118325990761367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400455791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044876963,0.00066412974,0.9353134,0.004328493,0.0006720735,0.00014129069,0.000006375604,0.00037469203,0.013622569],"genre_scores_gemma":[0.9974784,0.00003242195,0.00076723995,0.0008924108,0.000048331585,0.0000017739125,0.0000019927472,0.000008496113,0.00076888147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921745,0.00004423129,0.000104940715,0.00024898135,0.00016026817,0.00022411789],"domain_scores_gemma":[0.9990838,0.00039898933,0.000035029,0.000411452,0.000028591796,0.000042127653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017182418,0.00010271633,0.00009934177,0.00007920712,0.000113241294,0.000095158684,0.0007062021,0.000046068733,0.00011783624],"category_scores_gemma":[0.000026154878,0.00006707685,0.000086261316,0.00059980055,0.000056473426,0.00033141888,0.00017653579,0.00016697048,0.000057793633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000212136,0.000013155974,0.0000065275044,0.000004583921,0.00001858694,0.000031613254,0.00053407997,0.00033767908,0.000053329415,0.9905654,0.005508264,0.00292463],"study_design_scores_gemma":[0.00037994236,0.0002945583,0.00030523152,0.00020129968,0.000033846605,0.000021775213,0.00043300624,0.41471553,0.0021618828,0.45202282,0.12897848,0.00045163793],"about_ca_topic_score_codex":0.000010306632,"about_ca_topic_score_gemma":0.000004584242,"teacher_disagreement_score":0.9526015,"about_ca_system_score_codex":0.000034235705,"about_ca_system_score_gemma":0.0000347077,"threshold_uncertainty_score":0.27353147},"labels":[],"label_agreement":null},{"id":"W4400486303","doi":"10.61091/jcmcc121-09","title":"On Strong Regal and Strong Royal Colorings","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Computer science; Mathematics","score_opus":0.013761722406796822,"score_gpt":0.25661920138806765,"score_spread":0.24285747898127083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76857877,0.0019086379,0.19445015,0.00056976936,0.028926704,0.00035281447,0.0000019273384,0.00023011357,0.0049811336],"genre_scores_gemma":[0.9901497,0.000025812913,0.008767585,0.000026245916,0.00097627385,0.0000013860282,2.897306e-7,0.000025780631,0.000026929756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977533,0.00008019755,0.0007872412,0.00035191464,0.0006423787,0.00038496446],"domain_scores_gemma":[0.99778867,0.0010993257,0.00041688865,0.0002538474,0.00020018686,0.00024108229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011005298,0.00030850805,0.0005887773,0.00023383855,0.0002725787,0.00082980486,0.00055790506,0.00013505899,0.000003957162],"category_scores_gemma":[0.00026089113,0.0002549259,0.00013877876,0.00029872084,0.00009072831,0.0004684606,0.00039377715,0.0006981627,0.0000037498617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027511023,0.00013419091,0.000017766619,0.00012737376,0.000063007865,0.00010224021,0.00070727576,0.0001022539,0.00006779185,0.99342513,0.00014341512,0.005082063],"study_design_scores_gemma":[0.0017541281,0.0015209852,0.000052675787,0.00060275925,0.00004761985,0.00018799592,0.0001276767,0.061695553,0.00025632555,0.93221045,0.0012320963,0.0003117335],"about_ca_topic_score_codex":0.0000028623633,"about_ca_topic_score_gemma":1.1806007e-7,"teacher_disagreement_score":0.22157095,"about_ca_system_score_codex":0.000114178416,"about_ca_system_score_gemma":0.00017902088,"threshold_uncertainty_score":0.9999903},"labels":[],"label_agreement":null},{"id":"W4400512493","doi":"10.61091/ars159-07","title":"On the Shelter of a Poset &amp; Its Algebraic Applications","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Higher Education Commision, Pakistan","keywords":"Partially ordered set; Mathematics; Chain (unit); Algebraic number; Combinatorics; Property (philosophy); Element (criminal law); Discrete mathematics; Physics; Mathematical analysis","score_opus":0.017383602065694035,"score_gpt":0.26157743944537054,"score_spread":0.2441938373796765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7308608,0.004617489,0.20297442,0.019536367,0.0061410135,0.002004569,0.00003457708,0.0014086193,0.0324221],"genre_scores_gemma":[0.9983449,0.000012997207,0.0006550961,0.00046178568,0.0000090918975,0.00008482401,0.0000023647492,0.000008505367,0.0004204138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991848,0.00004289129,0.0001489465,0.000268339,0.00019214023,0.00016287278],"domain_scores_gemma":[0.9988917,0.00038879664,0.000036023797,0.0005960058,0.000045246048,0.00004224504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015953086,0.00010064782,0.00009849885,0.000061995706,0.00008796778,0.00007573431,0.00074101164,0.00003737377,0.000043697735],"category_scores_gemma":[0.00003572192,0.000066233246,0.000065267996,0.00054217415,0.000041307623,0.00017204958,0.00014480758,0.00015240343,0.00060063525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.4527473e-7,0.000039493116,0.00000829776,0.000012466165,0.000011334239,0.0000020453813,0.00017782286,0.000013081136,0.0006008826,0.99408144,0.002822783,0.0022294049],"study_design_scores_gemma":[0.00007168814,0.00004377854,0.0001582335,0.000023758052,0.0000041852572,0.000004526691,0.000004723655,0.0010680021,0.0012697661,0.98170614,0.0155613525,0.000083830986],"about_ca_topic_score_codex":0.0000012518494,"about_ca_topic_score_gemma":7.213568e-7,"teacher_disagreement_score":0.26748407,"about_ca_system_score_codex":0.000020822334,"about_ca_system_score_gemma":0.000038202757,"threshold_uncertainty_score":0.7720151},"labels":[],"label_agreement":null},{"id":"W4400596720","doi":"10.55016/ojs/cdm.v13i1.62549","title":"A characterization of well-founced algebraic lattices","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Semilattice; Omega; Join (topology); Mathematics; Combinatorics; Corollary; Algebraic number; Lattice (music); Distributive lattice; Partially ordered set; Discrete mathematics; Pure mathematics; Distributive property; Physics","score_opus":0.012597248641765868,"score_gpt":0.28048196341450937,"score_spread":0.2678847147727435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09829048,0.00001673141,0.89829034,0.0009327327,0.00016468,0.00029744746,0.00005318336,0.00013084276,0.0018235641],"genre_scores_gemma":[0.9452316,0.00000608275,0.05408529,0.00022551138,0.000105649364,0.00003166032,0.000022722787,0.00000899516,0.00028248888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988754,0.000034791905,0.00036333117,0.00023799982,0.0002188359,0.00026966544],"domain_scores_gemma":[0.99856025,0.00010412673,0.00020215173,0.0005949711,0.00042733442,0.00011114931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002261559,0.00013689678,0.00023926994,0.00010837392,0.00017311925,0.00007636446,0.0006022948,0.000056028992,0.000060256014],"category_scores_gemma":[0.00032119884,0.00011536882,0.00008231685,0.0006231298,0.000105780695,0.00038570038,0.00021845885,0.0000627458,0.00033684843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004053835,0.00007646136,0.00003193553,0.000029208652,0.000025123418,0.0000012918928,0.0010641094,0.000006105932,0.081816845,0.915665,0.00009537356,0.0011845161],"study_design_scores_gemma":[0.001721272,0.0011596875,0.0054940963,0.00049034663,0.00014906494,0.000048034195,0.00029353768,0.10240929,0.33661306,0.5268074,0.023515385,0.0012987594],"about_ca_topic_score_codex":0.0000012923268,"about_ca_topic_score_gemma":0.0000029720763,"teacher_disagreement_score":0.8469411,"about_ca_system_score_codex":0.000041247167,"about_ca_system_score_gemma":0.000052242147,"threshold_uncertainty_score":0.47046039},"labels":[],"label_agreement":null},{"id":"W4400596725","doi":"10.55016/ojs/cdm.v15i1.62160","title":"The polar of convex lattice sets","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Convex hull; Combinatorics; Mathematics; Lattice (music); Polar; Convex set; Regular polygon; Convex polytope; Convex body; Convex analysis; Geometry; Physics; Convex optimization","score_opus":0.017744305992649007,"score_gpt":0.28703961189519955,"score_spread":0.2692953059025506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026596999,0.00027295068,0.97555655,0.019913644,0.00007605505,0.00028175043,0.00008431268,0.000102211205,0.0010528386],"genre_scores_gemma":[0.9324452,0.000017171738,0.06629628,0.0010814155,0.0000438402,0.000022183462,0.000005106136,0.000008495535,0.000080266895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902505,0.000042468237,0.000303571,0.0001723053,0.00020625113,0.00025034446],"domain_scores_gemma":[0.9985907,0.00043004114,0.00012250288,0.00048346727,0.00020475987,0.00016851994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021558182,0.000108126515,0.00019912541,0.000020048526,0.00024913822,0.0000800707,0.0008405167,0.000036115216,0.000008818225],"category_scores_gemma":[0.0011396424,0.000071721006,0.00009570978,0.00043073684,0.000075813514,0.00015098903,0.0002958396,0.00010649763,0.00013554824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024256974,0.000018030176,0.000015126448,0.000018703733,0.000021929185,0.0000022884756,0.0010645648,0.00005600531,0.0005788786,0.9964577,0.00081633066,0.0009480002],"study_design_scores_gemma":[0.0011325768,0.0005032021,0.0006526269,0.00011745914,0.000109095745,0.000028937338,0.0011028327,0.228635,0.01408352,0.6735761,0.07934105,0.00071760773],"about_ca_topic_score_codex":0.0000011101839,"about_ca_topic_score_gemma":0.0000011345809,"teacher_disagreement_score":0.92978555,"about_ca_system_score_codex":0.000022394128,"about_ca_system_score_gemma":0.000051941595,"threshold_uncertainty_score":0.29246977},"labels":[],"label_agreement":null},{"id":"W4400794568","doi":"10.1142/s0219498825503608","title":"Exceptional sequences in semidistributive lattices and the poset topology of wide subcategories","year":2024,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Sherbrooke","funders":"","keywords":"Partially ordered set; Mathematics; Topology (electrical circuits); Pure mathematics; Combinatorics; Discrete mathematics","score_opus":0.010182981918892898,"score_gpt":0.26558169717650815,"score_spread":0.25539871525761526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400794568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67020184,0.035090514,0.26745746,0.026100697,0.00022050395,0.0003228756,0.000023825367,0.00002497644,0.0005572734],"genre_scores_gemma":[0.99708235,0.0014656802,0.00124624,0.000106581596,0.00005058193,0.000011538321,0.0000012396856,0.0000018123409,0.000033994664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939144,0.000045560213,0.0002656174,0.00010995809,0.00010240107,0.00008501896],"domain_scores_gemma":[0.99906176,0.0006088339,0.00013179904,0.000075897304,0.00008717742,0.00003450873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003166377,0.000060968705,0.00014546697,0.000079352314,0.00006979848,0.00005548866,0.00022513577,0.000030962667,0.000006836644],"category_scores_gemma":[0.00004672042,0.00003616929,0.000031297506,0.0002739444,0.0002379406,0.00037634504,0.00006362709,0.00013789836,0.0000013438495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008381789,0.000013274716,0.0004963324,0.000018121542,0.000016225538,0.0000032236899,0.000685154,0.000014068208,0.00032775407,0.99410427,0.00006186467,0.0042513437],"study_design_scores_gemma":[0.0003221648,0.00008766446,0.010343661,0.000034099117,0.000020411218,0.00021768878,0.00045537273,0.0016278467,0.000863374,0.98179525,0.004158394,0.00007409494],"about_ca_topic_score_codex":0.0000035183377,"about_ca_topic_score_gemma":0.000005938836,"teacher_disagreement_score":0.32688046,"about_ca_system_score_codex":0.000010977715,"about_ca_system_score_gemma":0.00006852662,"threshold_uncertainty_score":0.14749408},"labels":[],"label_agreement":null},{"id":"W4401044570","doi":"10.1007/978-3-031-59850-0_5","title":"Module Theory of C*-Algebras","year":2024,"lang":"en","type":"book-chapter","venue":"Birkhäuser advanced texts. Basler Lehrbücher","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Algebra over a field; Pure mathematics; Mathematics","score_opus":0.019015795152712588,"score_gpt":0.23827804832443875,"score_spread":0.21926225317172615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401044570","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011289679,0.021372719,0.16152357,0.0005302549,0.0023843232,0.000915637,0.00009025857,0.0013250923,0.8117452],"genre_scores_gemma":[0.016553102,0.0009712348,0.031661425,0.00086417457,0.0004473688,0.00008229431,0.000037116755,0.00037123324,0.94901204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522924,0.00006413511,0.0011055868,0.0019151632,0.00081203115,0.00087381265],"domain_scores_gemma":[0.9957679,0.0003397414,0.0005774419,0.0026961977,0.0003049506,0.00031376132],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004589326,0.0011873757,0.0012399376,0.0006080687,0.00013610067,0.00013406837,0.0024333629,0.0007351524,0.0014274588],"category_scores_gemma":[0.000066802655,0.001047332,0.0007328658,0.00033231688,0.00040179968,0.0009443728,0.00118082,0.0012421921,0.0023649856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003165036,0.00005518408,0.000004205625,0.00019618717,0.00020288631,0.00009238114,0.00023830122,0.00018333826,0.00048354332,0.90463275,0.0012596924,0.09261987],"study_design_scores_gemma":[0.00038668848,0.00013173428,0.000038559516,0.00036610113,0.00007740327,0.000024043042,0.000009954204,0.0002014192,0.0012549121,0.68189037,0.31473488,0.0008839444],"about_ca_topic_score_codex":0.0000024116148,"about_ca_topic_score_gemma":0.0000076604,"teacher_disagreement_score":0.3134752,"about_ca_system_score_codex":0.00019196705,"about_ca_system_score_gemma":0.000225152,"threshold_uncertainty_score":0.9994854},"labels":[],"label_agreement":null},{"id":"W4401183784","doi":"10.1016/b978-0-443-16147-6.00025-6","title":"Approximate reasoning","year":2024,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.014027336944676451,"score_gpt":0.23583193264735344,"score_spread":0.221804595702677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401183784","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.1230265e-7,0.003695102,0.006115729,0.00009837751,0.000940125,0.0002545185,0.000005902524,0.00061639247,0.98827296],"genre_scores_gemma":[0.00012979114,0.000070514405,0.016596727,0.00037674626,0.0003475931,0.000025365003,0.0000055413598,0.00007136535,0.98237634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814445,0.00000982484,0.00032681043,0.00081757084,0.00033274092,0.00036860097],"domain_scores_gemma":[0.99865675,0.00004109643,0.00014579494,0.00097384286,0.000049794504,0.00013269566],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016557012,0.00043420686,0.00041435953,0.00016119635,0.000110967245,0.00022274535,0.001008577,0.0002470776,0.000059188642],"category_scores_gemma":[0.000007858661,0.0003714252,0.00024422433,0.000023803595,0.000082491424,0.00011910082,0.00066570606,0.0006364951,0.0013419124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.188269e-7,8.9486343e-7,6.412646e-8,0.00003707857,0.000019939615,0.00009927971,0.00007635435,9.466807e-7,0.0000034930792,0.49719843,0.000049260674,0.50251377],"study_design_scores_gemma":[0.00003794626,0.000020168038,2.5890182e-7,0.0002951369,0.00001862052,0.00004319786,9.017789e-7,0.00038969418,0.000017846802,0.42478135,0.5741204,0.0002744796],"about_ca_topic_score_codex":6.0078456e-8,"about_ca_topic_score_gemma":0.0000013465537,"teacher_disagreement_score":0.5740711,"about_ca_system_score_codex":0.00007222297,"about_ca_system_score_gemma":0.00007859135,"threshold_uncertainty_score":0.99987376},"labels":[],"label_agreement":null},{"id":"W4401820192","doi":"10.1007/s00220-024-05074-8","title":"Smooth Min-entropy Lower Bounds for Approximation Chains","year":2024,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Complex system; Mathematics; Nonlinear system; Statistical physics; Mathematical physics; Pure mathematics; Physics; Quantum mechanics; Computer science","score_opus":0.05207766242611702,"score_gpt":0.3321732494757961,"score_spread":0.2800955870496791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401820192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005174348,0.00042684135,0.9912201,0.0023549616,0.00011663727,0.00036120176,0.000004224721,0.00021644139,0.0047821323],"genre_scores_gemma":[0.5017411,0.000052491705,0.4974168,0.00015336479,0.000057465535,0.0002703191,0.000017871518,0.000015690455,0.00027489284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991067,0.000049533,0.000275103,0.00022738268,0.00013553436,0.0002057568],"domain_scores_gemma":[0.99749076,0.00073783903,0.0000432735,0.0016356411,0.000051169554,0.000041306335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025965893,0.00011854549,0.00016086544,0.000060190683,0.00014146307,0.00020099906,0.0014224007,0.000047836806,0.0000060296297],"category_scores_gemma":[0.00010609309,0.000104657745,0.00009047417,0.0005051533,0.00012983174,0.0004682609,0.00037942542,0.00019311866,0.000095843374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1491086e-7,0.000207583,0.0000016846509,0.00008198211,0.0000056524223,5.034523e-7,0.0006258276,0.00006200177,0.0001502787,0.97015786,0.00020481467,0.028500909],"study_design_scores_gemma":[0.00006555871,0.000016614851,0.00000714551,0.000055957218,0.000003826838,9.240181e-7,0.00001942344,0.43388566,0.00006887605,0.56175834,0.004044141,0.00007354983],"about_ca_topic_score_codex":4.511975e-7,"about_ca_topic_score_gemma":0.000001120961,"teacher_disagreement_score":0.5012237,"about_ca_system_score_codex":0.000075592245,"about_ca_system_score_gemma":0.000046228943,"threshold_uncertainty_score":0.4267819},"labels":[],"label_agreement":null},{"id":"W4402305041","doi":"10.4310/joc.240906223550","title":"Toggling, rowmotion, and homomesy on interval-closed sets","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Interval (graph theory); Mathematics; Combinatorics","score_opus":0.011817660074200402,"score_gpt":0.2638531070008877,"score_spread":0.25203544692668733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402305041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55740356,0.0071135066,0.41866806,0.005638995,0.008196132,0.000109555294,0.0000012281491,0.00016166971,0.0027072737],"genre_scores_gemma":[0.99769044,0.00023769174,0.001576389,0.00020583201,0.0000829949,5.006658e-7,1.4429345e-7,0.0000075004555,0.00019852724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991262,0.0000427415,0.00027351666,0.00013841302,0.00028051334,0.00013862102],"domain_scores_gemma":[0.9993589,0.00013505464,0.00011827307,0.00015942953,0.00012317907,0.00010515356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032341125,0.000101109275,0.00016797926,0.0001916118,0.000057880396,0.00019257852,0.0003560377,0.00004656093,0.000004810622],"category_scores_gemma":[0.00007088161,0.00007587309,0.000078680256,0.00034159125,0.000021729384,0.000513798,0.00008509645,0.0003097639,0.000014603719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007322179,0.00011391295,0.0003334835,0.0000440339,0.000036566835,0.00039888982,0.000529207,0.000067695866,0.00014242572,0.951721,0.003414663,0.043190785],"study_design_scores_gemma":[0.00053406676,0.0010960908,0.00396258,0.00025584927,0.00001677788,0.0004899442,0.00003412061,0.006002263,0.00092076836,0.95910686,0.027399475,0.00018119774],"about_ca_topic_score_codex":2.765603e-7,"about_ca_topic_score_gemma":1.5830989e-7,"teacher_disagreement_score":0.44028684,"about_ca_system_score_codex":0.00006295693,"about_ca_system_score_gemma":0.000056814486,"threshold_uncertainty_score":0.30940148},"labels":[],"label_agreement":null},{"id":"W4402928268","doi":"10.5070/c64264251","title":"Promotion permutations for tableaux","year":2024,"lang":"en","type":"article","venue":"Combinatorial Theory","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund; Österreichischen Akademie der Wissenschaften; Natural Sciences and Engineering Research Council of Canada; Johns Hopkins University; North Dakota State University; National Science Foundation","keywords":"Promotion (chess); Combinatorics; Computer science; Mathematics; Political science","score_opus":0.0195827637029911,"score_gpt":0.28797508935451854,"score_spread":0.26839232565152743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402928268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015065618,0.00047215624,0.9835977,0.00044287927,0.0094936695,0.00026067384,0.000002456566,0.0004597403,0.0037641535],"genre_scores_gemma":[0.994776,0.000005623425,0.0035520184,0.000050933253,0.00043798215,0.00009964458,0.000006591987,0.0000102517715,0.0010609563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933183,0.000050383598,0.000105705076,0.00025222532,0.000094565854,0.00016530797],"domain_scores_gemma":[0.99936515,0.00030320996,0.00001825207,0.0002157146,0.000054264612,0.000043380653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000340074,0.0000797465,0.00008169887,0.00006140101,0.0001391613,0.00016185829,0.00031693914,0.000044298937,0.00002524671],"category_scores_gemma":[0.0001230537,0.000068655296,0.0000633651,0.00025122438,0.000030717772,0.00044312916,0.00006339952,0.00007820781,0.00005901775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041960143,0.00003273323,8.9324925e-7,0.000019097368,0.0000076285355,0.000002944638,0.00022975574,0.000022137785,0.0004758961,0.9797746,0.0005668365,0.018863292],"study_design_scores_gemma":[0.00018873744,0.0001183998,0.000008263946,0.000017239256,0.000006398957,0.0000046682876,0.000014615723,0.0084048845,0.0013027274,0.9720327,0.017808577,0.000092755945],"about_ca_topic_score_codex":2.5353097e-7,"about_ca_topic_score_gemma":8.3193484e-8,"teacher_disagreement_score":0.99326944,"about_ca_system_score_codex":0.000037316488,"about_ca_system_score_gemma":0.000068315036,"threshold_uncertainty_score":0.27996814},"labels":[],"label_agreement":null},{"id":"W4403096726","doi":"10.37236/12328","title":"Cyclic Orderings of Paving Matroids","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Computer science; Combinatorics; Mathematics","score_opus":0.004072584411164965,"score_gpt":0.2238813585092814,"score_spread":0.21980877409811644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403096726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22347255,0.022395626,0.7505856,0.0016760284,0.0010271504,0.000062224295,1.6032969e-7,0.000057694364,0.00072292174],"genre_scores_gemma":[0.9986376,0.0008441661,0.00022682549,0.000047248464,0.000066444154,7.628185e-7,5.730325e-8,0.000009755061,0.00016712122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988048,0.000058784102,0.0003422787,0.000102548285,0.00032826193,0.0003633485],"domain_scores_gemma":[0.999197,0.00020128819,0.00019465791,0.00025670786,0.000107806125,0.000042538293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000755308,0.00010262701,0.00019274605,0.00011500477,0.00006552035,0.000067455425,0.0010765735,0.00003412762,0.0000046717546],"category_scores_gemma":[0.000047043344,0.0000644612,0.00012874336,0.0006855894,0.000040710667,0.00037426667,0.000117456715,0.00056288415,0.0000063238876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003873033,0.00002591795,0.000026372234,0.00001796551,0.000037824077,0.000015247601,0.00027830835,0.00011513819,0.0019189373,0.99320483,0.00010419542,0.0042513823],"study_design_scores_gemma":[0.00017741759,0.0004245985,0.00009812944,0.000053046442,0.000019971592,0.00036749966,0.00003455412,0.0014968198,0.004387622,0.986333,0.006525941,0.00008140581],"about_ca_topic_score_codex":0.000001541899,"about_ca_topic_score_gemma":4.7724e-7,"teacher_disagreement_score":0.7751651,"about_ca_system_score_codex":0.00014028358,"about_ca_system_score_gemma":0.00031143776,"threshold_uncertainty_score":0.26286513},"labels":[],"label_agreement":null},{"id":"W4403100003","doi":"10.1016/j.aim.2024.109963","title":"The category of topological spaces and open maps does not have products","year":2024,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research","keywords":"Mathematics; Category of topological spaces; Topological space; Pure mathematics; Concrete category; Topology (electrical circuits); Topological tensor product; Functor; Combinatorics; Functional analysis","score_opus":0.022682382539150444,"score_gpt":0.30833949128197874,"score_spread":0.2856571087428283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403100003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18580835,0.13502203,0.57915187,0.033467542,0.004474497,0.0038624832,0.000032316766,0.00070734246,0.057473548],"genre_scores_gemma":[0.853916,0.003022441,0.14166935,0.00007433831,0.000040505634,0.000037648824,5.0321364e-7,0.000007970793,0.0012312774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991441,0.000035601523,0.00023957399,0.00026616626,0.0001401447,0.00017444853],"domain_scores_gemma":[0.9989035,0.00061247346,0.00007285939,0.00035815538,0.000029014293,0.000023972712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042286815,0.00010297026,0.00018136286,0.0000352224,0.00007912234,0.00020974292,0.0008870709,0.000030630687,0.0000031413622],"category_scores_gemma":[0.00020159603,0.000049335446,0.000021327643,0.00018603135,0.00021994571,0.0007252246,0.0005505243,0.00011767378,0.000004808185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021526182,0.000027729997,0.0001220246,0.0001734058,0.000004870845,0.000014196846,0.0012809242,0.000029016968,0.00014119998,0.9705283,0.000022855967,0.027653312],"study_design_scores_gemma":[0.00006619663,0.000047148067,0.00017757935,0.00008102872,0.0000035210633,0.000016698796,0.0006974507,0.003418449,0.0036017054,0.98326784,0.008523862,0.00009849139],"about_ca_topic_score_codex":0.000003092591,"about_ca_topic_score_gemma":0.000036038644,"teacher_disagreement_score":0.6681076,"about_ca_system_score_codex":0.000011926549,"about_ca_system_score_gemma":0.000027248849,"threshold_uncertainty_score":0.20225558},"labels":[],"label_agreement":null},{"id":"W4403306763","doi":"10.1017/9781009302180.016","title":"Some Simple Examples of Recursive Algorithms","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Simple (philosophy); Computer science; Algorithm; Philosophy; Epistemology","score_opus":0.02734042683492628,"score_gpt":0.21613300956069054,"score_spread":0.18879258272576427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403306763","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024036797,0.0012691232,0.034335304,0.000026523247,0.00051727815,0.00029335724,0.00025635544,0.00027359813,0.9630044],"genre_scores_gemma":[0.00034369752,0.0002537484,0.0030596133,0.000056594814,0.00019612197,6.145613e-7,0.000029516788,0.000033583216,0.9960265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841446,0.000022218026,0.00022416058,0.0007276424,0.00030908475,0.000302456],"domain_scores_gemma":[0.99849087,0.00011695369,0.00024071426,0.00085034646,0.00015154031,0.0001495882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000072957206,0.00036476878,0.00046928244,0.00025282294,0.000108301276,0.000050498355,0.0013662345,0.00027823413,0.0000025700845],"category_scores_gemma":[0.000006876445,0.00039463726,0.00027466903,0.000019717592,0.00024878164,0.0002648722,0.0011413809,0.00043073308,0.000029202816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009345536,0.0000060708476,1.3400594e-7,0.00009350839,0.00009892013,0.00040085037,0.00007647943,0.000007736503,0.000036262416,0.98806244,0.0072743366,0.00393394],"study_design_scores_gemma":[0.00024736158,0.000109901994,0.0000029851071,0.00017688207,0.0001068142,0.00002250618,0.000024066345,0.00038217977,0.00095646846,0.023002042,0.97447956,0.0004892147],"about_ca_topic_score_codex":0.00004759989,"about_ca_topic_score_gemma":8.4384925e-7,"teacher_disagreement_score":0.9672052,"about_ca_system_score_codex":0.00012711015,"about_ca_system_score_gemma":0.00011389994,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W4403428870","doi":"10.28924/2291-8639-22-2024-183","title":"External Direct Product JU-Algebras","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Thailand Science Research and Innovation; University of Phayao","keywords":"Mathematics; Product (mathematics); Direct product; Pure mathematics; Algebra over a field; Geometry","score_opus":0.008395227395700236,"score_gpt":0.2856424501488448,"score_spread":0.27724722275314456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403428870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084221475,0.0033760075,0.9841964,0.0023879472,0.00021660082,0.000044772118,0.0000046920945,0.00003464071,0.0013167824],"genre_scores_gemma":[0.97963977,0.0005232332,0.018820707,0.00014423694,0.00054203725,0.0000096851045,0.0000023479797,0.000003951497,0.00031404675],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903834,0.0000211642,0.00031573948,0.00020865432,0.00033134816,0.00008477797],"domain_scores_gemma":[0.9992821,0.00008442042,0.00013833489,0.00016459251,0.0002582764,0.00007227472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024061234,0.000079103746,0.00015268355,0.0004782197,0.00005356428,0.00033711942,0.0006381368,0.000017207309,0.00003373405],"category_scores_gemma":[0.000017803759,0.000059488226,0.00019435998,0.0007336352,0.00003493904,0.00047474212,0.00008928563,0.00011896358,0.000014847895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006082775,0.000107426305,0.0032005105,0.000008255304,0.0017607855,0.000073604286,0.00022101965,0.0011105548,0.0033521047,0.48995706,0.0004592485,0.49974334],"study_design_scores_gemma":[0.00067748595,0.00019911357,0.07253406,0.00019295476,0.0017843029,0.0012213936,0.00011575554,0.07022097,0.01108628,0.39609298,0.4450333,0.0008413757],"about_ca_topic_score_codex":0.000005231879,"about_ca_topic_score_gemma":0.0000035434762,"teacher_disagreement_score":0.97121763,"about_ca_system_score_codex":0.000029948174,"about_ca_system_score_gemma":0.000046861744,"threshold_uncertainty_score":0.32508504},"labels":[],"label_agreement":null},{"id":"W4403435706","doi":"10.1515/ms-2024-0080","title":"Completely hereditarily atomic OMLS","year":2024,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Algebraic number; Extension (predicate logic); Property (philosophy); Predicate (mathematical logic); Pure mathematics; Algebra over a field; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.02131559496584618,"score_gpt":0.25979423825605436,"score_spread":0.23847864329020818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403435706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020241518,0.0012605164,0.9486171,0.0013857705,0.00074657775,0.0001918344,0.000003252888,0.0011102376,0.026443172],"genre_scores_gemma":[0.87234634,0.000014007227,0.12559396,0.00042159532,0.00017794874,0.000048096437,0.000002151485,0.000023522722,0.0013723978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987311,0.000028141403,0.00026629536,0.00040276273,0.0002612537,0.0003104419],"domain_scores_gemma":[0.99899143,0.0002549374,0.00003513873,0.00059550616,0.000025968042,0.000097043616],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015910954,0.00017273995,0.00021875839,0.000103374936,0.0000906835,0.0002767312,0.00083206105,0.000056070818,0.00024285738],"category_scores_gemma":[0.0000383006,0.00013480317,0.000106704574,0.00042004307,0.00004885612,0.00043435604,0.00025472307,0.00017433718,0.0031771087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.3617755e-7,0.000029050694,0.0000031409763,0.00011723849,0.000020614845,0.000087999964,0.00063753425,0.000008068577,0.00039246562,0.9787736,0.008466699,0.011462741],"study_design_scores_gemma":[0.00010658664,0.000042327993,0.000090858186,0.00011726655,0.000010075491,0.00013799529,0.000041710107,0.08010591,0.0006226114,0.868387,0.0500904,0.0002472679],"about_ca_topic_score_codex":0.0000012863907,"about_ca_topic_score_gemma":6.932043e-7,"teacher_disagreement_score":0.8521048,"about_ca_system_score_codex":0.00004128263,"about_ca_system_score_gemma":0.000046655714,"threshold_uncertainty_score":0.997599},"labels":[],"label_agreement":null},{"id":"W4403445318","doi":"10.48550/arxiv.2408.03192","title":"Combinatorial proof of a Non-Renormalization Theorem","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Krembil Foundation; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Renormalization; Combinatorial proof; Mathematics; Proof of concept; Analytic proof; Discrete mathematics; Combinatorics; Mathematical physics; Computer science; Mathematical proof; Geometry","score_opus":0.033367103811313054,"score_gpt":0.18939461014321438,"score_spread":0.15602750633190132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403445318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102473095,0.000086630826,0.8859621,0.00004049943,0.001961552,0.00029898036,0.000008709667,0.00017428814,0.008994136],"genre_scores_gemma":[0.9986404,0.000027879205,0.0007745815,0.000020801926,0.00009010691,8.992972e-7,0.000010483333,0.000013035679,0.00042181235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987405,0.00006753256,0.00018522331,0.00070507824,0.00009136839,0.00021028303],"domain_scores_gemma":[0.99874055,0.00004977896,0.000205865,0.0007835787,0.00014429759,0.00007594854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015953717,0.00021786866,0.00027575484,0.00021313102,0.000059080707,0.00005407355,0.0012538276,0.0002121514,0.000014048483],"category_scores_gemma":[0.000019834944,0.00022269762,0.0001633497,0.00064951414,0.0001008907,0.00020112876,0.0023751473,0.0003999548,0.000030380548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001412483,0.000060936403,0.000107319465,0.00015301615,0.00003944616,0.00008567089,0.00023285182,0.064331435,0.000045702694,0.93414086,0.00006481791,0.00072380353],"study_design_scores_gemma":[0.00022631077,0.000058246085,0.00006390004,0.0000932252,0.00003438326,0.0000015869256,0.000016041444,0.27586335,0.0013216964,0.7220292,0.00010161551,0.00019040816],"about_ca_topic_score_codex":0.000021144144,"about_ca_topic_score_gemma":0.0000040003642,"teacher_disagreement_score":0.8961673,"about_ca_system_score_codex":0.00008812681,"about_ca_system_score_gemma":0.00018910643,"threshold_uncertainty_score":0.9081346},"labels":[],"label_agreement":null},{"id":"W4403459200","doi":"10.1088/1751-8121/ad8791","title":"Multi-headed lattices and Green functions","year":2024,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics","score_opus":0.018152676081332045,"score_gpt":0.2668263654717245,"score_spread":0.24867368939039247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403459200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077241436,0.00059902563,0.9195191,0.002069608,0.00010324023,0.000040329145,0.0000011365144,0.00003077032,0.000395312],"genre_scores_gemma":[0.94363445,0.00002936796,0.05600906,0.00008796186,0.00016010375,0.0000011408902,9.490593e-8,0.000005876106,0.000071962546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932873,0.00003402678,0.0002187954,0.00012845782,0.00016187444,0.00012809993],"domain_scores_gemma":[0.999262,0.00041916323,0.00004269821,0.00009747776,0.000043258147,0.00013542158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023158405,0.000091753274,0.00018919875,0.00003603482,0.00005434137,0.00015431271,0.00014622697,0.000036066922,0.00002408073],"category_scores_gemma":[0.00005428211,0.000055351702,0.00006547692,0.00012271735,0.00030113978,0.0003373502,0.00010456757,0.00021531858,0.000017543163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034860805,0.000067759414,0.0000054699826,0.00007397734,0.000025053545,0.00003298356,0.0003687625,0.0000012344581,0.0003919144,0.97623724,0.000012691372,0.022779416],"study_design_scores_gemma":[0.00014024018,0.00012077106,0.000043083837,0.00009400484,0.000030358642,0.0002811165,0.000040447394,0.07781951,0.00017294177,0.9210692,0.00012073269,0.0000675864],"about_ca_topic_score_codex":1.0851784e-7,"about_ca_topic_score_gemma":3.81962e-8,"teacher_disagreement_score":0.86639297,"about_ca_system_score_codex":0.0000056860904,"about_ca_system_score_gemma":0.000019345447,"threshold_uncertainty_score":0.2257177},"labels":[],"label_agreement":null},{"id":"W4404953224","doi":"10.1090/proc/17153","title":"Birkhoff-James classification of finite-dimensional 𝐶*-algebras","year":2024,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Pacific Institute for the Mathematical Sciences","keywords":"Pure mathematics; Mathematics; Algebra over a field; Computer science","score_opus":0.021868431636604364,"score_gpt":0.26968086826176046,"score_spread":0.2478124366251561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404953224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9371886,0.000532103,0.04609141,0.009200295,0.00043216263,0.00090959825,0.000037140606,0.00044053438,0.005168131],"genre_scores_gemma":[0.84029406,0.00003717869,0.15900385,0.00033689963,0.00007440019,0.000052112217,0.0000013022038,0.00002878522,0.00017136901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758905,0.0000152540715,0.00069735094,0.00063029875,0.00076459703,0.00030346817],"domain_scores_gemma":[0.9974227,0.00039901317,0.0012377325,0.0004941947,0.0003579756,0.00008840034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004809264,0.00032684274,0.0007500854,0.000057500045,0.00008253059,0.00008846552,0.0020579929,0.00014344492,0.000014154042],"category_scores_gemma":[0.00038293723,0.00021203961,0.00081204914,0.00081935426,0.0009660367,0.00011167796,0.004008,0.00077399315,0.00002468664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009818392,0.00028673434,0.00023342232,0.0026940021,0.00025426561,3.08613e-7,0.0026578493,0.0001248978,0.014650559,0.9683124,0.0054549905,0.005320761],"study_design_scores_gemma":[0.00006610081,0.000061330604,0.000935909,0.0005211905,0.00007928313,0.0000051365623,0.0003930715,0.07299647,0.0068151914,0.91780037,0.000082854705,0.00024306883],"about_ca_topic_score_codex":0.00000701366,"about_ca_topic_score_gemma":6.847442e-8,"teacher_disagreement_score":0.11291245,"about_ca_system_score_codex":0.000079126934,"about_ca_system_score_gemma":0.00014067075,"threshold_uncertainty_score":0.8646724},"labels":[],"label_agreement":null},{"id":"W4405075473","doi":"10.21136/hs.2024.13","title":"The Rosický Tangent Categories of Algebras over an Operad","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Tangent; Mathematics; Pure mathematics; Algebra over a field; Geometry","score_opus":0.01261076098948388,"score_gpt":0.26803310357744276,"score_spread":0.2554223425879589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405075473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1213022,0.0069288113,0.85124916,0.0031033119,0.0017150956,0.00022351215,0.0000025826696,0.0005950655,0.0148802465],"genre_scores_gemma":[0.99242365,0.0000777749,0.005175353,0.00025128046,0.00006135798,0.000007783307,7.408128e-7,0.000005437191,0.001996644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933755,0.000024571762,0.00012229288,0.00020553562,0.00015345812,0.00015658952],"domain_scores_gemma":[0.9994414,0.000080040314,0.000015456208,0.00039255142,0.000026047544,0.000044531593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012101805,0.000075802476,0.00007099226,0.000023877887,0.00010137824,0.00018630766,0.00057833677,0.000020972975,0.000047227906],"category_scores_gemma":[0.000008734205,0.000039720853,0.000038045102,0.00023844007,0.000067508736,0.0004892579,0.0001469391,0.0000642005,0.000040774677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.890384e-7,0.000010315473,0.0000418089,0.0000042355855,0.0000075602525,0.0000054862867,0.0004411984,0.00002739002,0.000844493,0.9622771,0.0007130132,0.035626497],"study_design_scores_gemma":[0.00021075732,0.0003944985,0.005220949,0.00002491824,0.000015136901,0.00003130464,0.00040700444,0.07541754,0.03968231,0.71800417,0.1601627,0.00042871854],"about_ca_topic_score_codex":0.000030561238,"about_ca_topic_score_gemma":0.000045544413,"teacher_disagreement_score":0.8711214,"about_ca_system_score_codex":0.0000135654645,"about_ca_system_score_gemma":0.00004387864,"threshold_uncertainty_score":0.17965691},"labels":[],"label_agreement":null},{"id":"W4405640137","doi":"10.29169/1927-5129.2024.20.20","title":"Intuitionistic Fuzzy Subalgebras of Several Types in Sheffer Stroke Hilbert Algebras","year":2024,"lang":"en","type":"article","venue":"Journal of Basic & Applied Sciences","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics; Psychology; Linguistics; Philosophy","score_opus":0.014453422401380932,"score_gpt":0.25586235272385055,"score_spread":0.24140893032246963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405640137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7499526,0.0022150083,0.22515324,0.0018864854,0.0016578783,0.0002109424,0.000004327164,0.00007118868,0.018848347],"genre_scores_gemma":[0.98509306,0.00004521236,0.014417843,0.00019922647,0.00014195988,0.0000034139757,2.7919913e-7,0.000006058962,0.000092923525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980059,0.000054340006,0.000609913,0.0003192631,0.0006905239,0.00032006038],"domain_scores_gemma":[0.9990576,0.00035535247,0.00023592563,0.00017375233,0.0000763957,0.00010101109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138234,0.00015827443,0.00033916216,0.0004902899,0.00011210458,0.00022580085,0.0010857491,0.000060825314,0.00005037067],"category_scores_gemma":[0.00006450792,0.000114458344,0.00011630905,0.0012208967,0.00034502766,0.0007852884,0.00013681654,0.00032407136,0.000028232953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002344786,0.0001047752,0.000643291,0.000059185702,0.00002965856,0.00009700533,0.0009156688,0.0031513227,0.008324174,0.9545578,0.00043369818,0.031660017],"study_design_scores_gemma":[0.00085128687,0.00093607337,0.011871981,0.00038877118,0.000045533117,0.0003770032,0.00045367843,0.0173123,0.014626562,0.95061433,0.0019628778,0.0005595714],"about_ca_topic_score_codex":0.0000074389823,"about_ca_topic_score_gemma":0.000012625547,"teacher_disagreement_score":0.23514049,"about_ca_system_score_codex":0.000070971335,"about_ca_system_score_gemma":0.0003738758,"threshold_uncertainty_score":0.46674758},"labels":[],"label_agreement":null},{"id":"W4406635653","doi":"10.1016/b978-044488002-4/50021-x","title":"10.1016/b978-044488002-4/50021-x","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.009510637105802662,"score_gpt":0.1761097146638233,"score_spread":0.16659907755802064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406635653","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.684457e-8,0.00037514107,0.0008792905,0.00023423131,0.000009976491,0.00029142966,0.000019774037,0.00048428492,0.9977058],"genre_scores_gemma":[7.357984e-7,0.000001217911,0.0029336675,0.00018830705,0.000334883,0.000015402247,0.00002335539,0.00006344251,0.996439],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99785894,0.000019300287,0.00035960454,0.0008560762,0.00042766443,0.00047841985],"domain_scores_gemma":[0.9981885,0.00008403035,0.00013882855,0.0012234038,0.00007710399,0.00028813528],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010508198,0.0005042893,0.00049390446,0.00024035206,0.00012841802,0.00013632282,0.0016224806,0.0002963432,0.98966557],"category_scores_gemma":[0.000014339476,0.00048626948,0.00020914784,0.00010164463,0.00006541924,0.0002643807,0.00043382766,0.00041689817,0.9970327],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012033276,0.000014452966,9.524064e-10,0.0000071667855,0.000025685458,0.000067301255,0.000011981796,0.00005780258,0.000002473121,0.0083525,0.07391591,0.9175327],"study_design_scores_gemma":[0.00013123515,0.00018863392,3.70881e-7,0.00006925953,0.000017007582,0.00003495251,5.8159735e-8,0.00020223981,0.000010158083,0.016694563,0.98204124,0.00061025977],"about_ca_topic_score_codex":0.0000021456005,"about_ca_topic_score_gemma":1.2548348e-7,"teacher_disagreement_score":0.91692245,"about_ca_system_score_codex":0.00007965407,"about_ca_system_score_gemma":0.00008153724,"threshold_uncertainty_score":0.9997589},"labels":[],"label_agreement":null},{"id":"W4406655839","doi":"10.1016/b978-044488002-4/50010-5","title":"10.1016/b978-044488002-4/50010-5","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.009404014334365428,"score_gpt":0.176545806515536,"score_spread":0.16714179218117056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406655839","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.721109e-8,0.00032264256,0.0008406088,0.00022783747,0.000010416292,0.0003144805,0.000020496587,0.0004966775,0.9977668],"genre_scores_gemma":[6.8226274e-7,0.0000010593031,0.002848116,0.00018827828,0.00032690694,0.000017073373,0.00002430607,0.000062913125,0.99653065],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788815,0.000018506218,0.00035505145,0.00084298424,0.00041889076,0.00047642874],"domain_scores_gemma":[0.99821097,0.00008202419,0.0001370344,0.001214019,0.00007472442,0.00028124393],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000104368686,0.00049886515,0.00048421387,0.00023939263,0.00012747553,0.00013329517,0.001622093,0.0002971526,0.98929566],"category_scores_gemma":[0.000013823967,0.00048031894,0.00020384048,0.00009897121,0.00006520877,0.00025931836,0.00042805678,0.00041976903,0.9969856],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013175709,0.000014301924,8.672037e-10,0.0000070303454,0.00002518295,0.00006375732,0.000011509933,0.000053722943,0.0000026588964,0.0077595147,0.07797031,0.91407883],"study_design_scores_gemma":[0.00013253237,0.00019242863,3.4941434e-7,0.00006246524,0.000016699318,0.000035139976,5.4533125e-8,0.00019184957,0.000009874443,0.016976284,0.9817792,0.0006031318],"about_ca_topic_score_codex":0.0000022406261,"about_ca_topic_score_gemma":1.3127924e-7,"teacher_disagreement_score":0.9134757,"about_ca_system_score_codex":0.000079082485,"about_ca_system_score_gemma":0.000081170256,"threshold_uncertainty_score":0.99976486},"labels":[],"label_agreement":null},{"id":"W4406671661","doi":"10.1016/b978-0-08-051430-7.50015-2","title":"10.1016/b978-0-08-051430-7.50015-2","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.010006958951190238,"score_gpt":0.18008260697430348,"score_spread":0.17007564802311323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406671661","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.044718e-8,0.0004224212,0.0009932359,0.00024784412,0.000012515208,0.00031706592,0.00002399854,0.0005233045,0.99745953],"genre_scores_gemma":[8.2687785e-7,0.0000013895752,0.0030192393,0.00020124989,0.00035473055,0.000016633978,0.000029558909,0.00006849893,0.99630785],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997706,0.000021564028,0.00038629398,0.0009057304,0.00045785043,0.0005225468],"domain_scores_gemma":[0.9980945,0.000086094755,0.00015153016,0.0012771257,0.00008579807,0.00030495803],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011998508,0.00053981564,0.0005284631,0.00025602835,0.00013945621,0.00014408167,0.001713534,0.0003213278,0.98580074],"category_scores_gemma":[0.000015626967,0.0005202485,0.00021951307,0.00010994002,0.00007279013,0.00028403683,0.00047372567,0.0004486256,0.9971119],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015208929,0.000016300459,1.154891e-9,0.000008230479,0.000029582889,0.000074943615,0.000013531217,0.00006417426,0.0000030464657,0.008572865,0.07298496,0.9182171],"study_design_scores_gemma":[0.00015666761,0.00020081976,4.118348e-7,0.00007524706,0.000018939745,0.000039705006,7.1002354e-8,0.00021292864,0.00001120262,0.017335817,0.98130286,0.00064534316],"about_ca_topic_score_codex":0.0000025337174,"about_ca_topic_score_gemma":1.542377e-7,"teacher_disagreement_score":0.9175718,"about_ca_system_score_codex":0.00008859604,"about_ca_system_score_gemma":0.00009487015,"threshold_uncertainty_score":0.9997249},"labels":[],"label_agreement":null},{"id":"W4407127671","doi":"10.1007/978-3-031-48825-2_5","title":"Canonical Varieties","year":2025,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.013438186833235539,"score_gpt":0.23465306702290756,"score_spread":0.22121488018967203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407127671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.943658e-7,0.00044087347,0.73793846,0.00019682826,0.00013909266,0.00013444766,0.00015091852,0.00007534532,0.26092353],"genre_scores_gemma":[0.00058838294,0.00086500397,0.79935884,0.0006858189,0.000086824715,0.000023738521,0.000012808981,0.000047242418,0.19833133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985435,0.000016805332,0.00037318346,0.00046181286,0.0003538116,0.0002508574],"domain_scores_gemma":[0.9964763,0.0024937224,0.0002035219,0.000646889,0.000081916136,0.000097663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013561781,0.00040860742,0.0005713732,0.0001479436,0.00018214759,0.00018835659,0.00053590495,0.00026984132,0.00011196131],"category_scores_gemma":[0.00045154287,0.0003241615,0.00007878388,0.000032756452,0.00013794072,0.00003534863,0.0002081722,0.0003806584,0.000034561657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027805927,0.000019709618,1.0582698e-7,0.00020683,0.000058821402,0.000031829495,0.00012055148,0.000010614366,0.0000021839173,0.9374569,0.0066471687,0.055442527],"study_design_scores_gemma":[0.000049294278,0.00007017126,0.0000022675194,0.00022468962,0.00006744773,0.000011804112,0.0000034760278,0.005023942,0.000056469515,0.9509251,0.04322686,0.00033846914],"about_ca_topic_score_codex":0.0000017552258,"about_ca_topic_score_gemma":0.000012110836,"teacher_disagreement_score":0.06259219,"about_ca_system_score_codex":0.00004302624,"about_ca_system_score_gemma":0.00015137081,"threshold_uncertainty_score":0.999921},"labels":[],"label_agreement":null},{"id":"W4407657197","doi":"10.28924/2291-8639-23-2025-24","title":"Exploring the Difference Paralindelöf in Topological Spaces","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Topological space; Pure mathematics; Topology (electrical circuits); Combinatorics","score_opus":0.046198208078719466,"score_gpt":0.31861032144550616,"score_spread":0.2724121133667867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407657197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22082634,0.00015912898,0.7717583,0.006874309,0.000058193647,0.00002929986,5.989482e-7,0.0000044647827,0.00028934504],"genre_scores_gemma":[0.9951475,0.00044601096,0.0039781476,0.0002814621,0.00005216472,0.000019550787,5.099822e-7,6.089499e-7,0.00007400295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994164,0.000028109594,0.00023832721,0.00010371963,0.00015123574,0.00006217222],"domain_scores_gemma":[0.9994464,0.00016611729,0.00012260777,0.000118695694,0.00012349854,0.000022715774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017258673,0.000047359703,0.00011485938,0.0002885619,0.000057719757,0.00011013972,0.00066733896,0.000012477567,0.0000044931953],"category_scores_gemma":[0.00002509505,0.000028291372,0.00008081902,0.0006790859,0.00004505043,0.00018583058,0.00010604923,0.000111074005,8.573712e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056626805,0.000075071854,0.042399414,9.917446e-7,0.00026940243,0.0000057622615,0.00016674645,0.0014755816,0.0002501584,0.825469,0.000009748824,0.12987247],"study_design_scores_gemma":[0.00025456666,0.000023979324,0.782967,0.00001904643,0.00010065621,0.000014591845,0.00027921415,0.008353327,0.00057639956,0.20242555,0.004894028,0.000091671274],"about_ca_topic_score_codex":0.000017824997,"about_ca_topic_score_gemma":0.000042197622,"teacher_disagreement_score":0.7743212,"about_ca_system_score_codex":0.000019866404,"about_ca_system_score_gemma":0.000019781392,"threshold_uncertainty_score":0.1240093},"labels":[],"label_agreement":null},{"id":"W4407744062","doi":"10.1090/proc/17251","title":"DTC sets for convolution algebras","year":2025,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convolution (computer science); Mathematics; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.021172692226169305,"score_gpt":0.29224305499164416,"score_spread":0.27107036276547486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407744062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08398708,0.00016492522,0.9018301,0.006413087,0.00037466892,0.0018140209,0.00005350383,0.00037732712,0.0049853213],"genre_scores_gemma":[0.26344115,0.000069120084,0.73369706,0.0016048815,0.000104459636,0.0003475466,0.0000027040292,0.000022648797,0.0007104686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817955,0.000009467412,0.00047023591,0.00058028207,0.00038387792,0.0003766022],"domain_scores_gemma":[0.9979159,0.0003053464,0.0009244038,0.00041007163,0.00036775495,0.00007647527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043438037,0.00029909267,0.00068925915,0.00002963324,0.00017131357,0.00009873366,0.0023243267,0.00013441977,0.000003679711],"category_scores_gemma":[0.00037714557,0.00020695639,0.0008356735,0.00045606302,0.0005433406,0.00014432608,0.00258492,0.0004385664,0.000003691777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010739612,0.00016567302,0.0001781983,0.0021356454,0.00017870203,4.7216112e-8,0.0015550165,0.00003921689,0.0009233424,0.979189,0.009840994,0.005783428],"study_design_scores_gemma":[0.00015087891,0.00005716235,0.00032202355,0.00031114795,0.00007096934,0.000002426021,0.00027076993,0.049553525,0.0024597482,0.94614756,0.00040491784,0.00024888825],"about_ca_topic_score_codex":0.0000049261066,"about_ca_topic_score_gemma":8.916739e-8,"teacher_disagreement_score":0.17945406,"about_ca_system_score_codex":0.000119178265,"about_ca_system_score_gemma":0.00012504063,"threshold_uncertainty_score":0.84394366},"labels":[],"label_agreement":null},{"id":"W4408043275","doi":"10.1007/978-3-031-78416-3_2","title":"2-Normed Groups: Unraveling Computational Properties of 2-Norms","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kwantlen Polytechnic University","funders":"","keywords":"Pure mathematics; Mathematics","score_opus":0.02829970943487299,"score_gpt":0.22284696695976947,"score_spread":0.1945472575248965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408043275","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047744532,0.0020621459,0.46276832,0.00028695673,0.0005337311,0.00020306099,0.0000056284966,0.0003096349,0.5337828],"genre_scores_gemma":[0.11718206,0.00011659953,0.05295775,0.000445955,0.00025519065,0.00001253155,0.0000226744,0.000059789727,0.8289474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844885,0.0000047187054,0.00043212177,0.0004989685,0.00042215388,0.00019320627],"domain_scores_gemma":[0.9992257,0.000049864822,0.00014835989,0.00036303807,0.00014949971,0.00006353577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009477777,0.00028459483,0.00035036594,0.00020350181,0.000055035056,0.00007861471,0.000664725,0.00015948231,0.00010539487],"category_scores_gemma":[0.000008771543,0.00019775996,0.0001645737,0.00006484235,0.00011507308,0.00023881976,0.00039520027,0.00027950978,0.00033667043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025091601,0.000007309145,6.492243e-7,0.00014145982,0.000046461806,0.00001596674,0.00018060574,0.0014698493,0.000052304717,0.99233246,0.00015963045,0.0055908184],"study_design_scores_gemma":[0.00010341692,0.000069164555,0.000004733803,0.00040906083,0.000017489221,0.000028862154,0.000013649053,0.027864018,0.00030516772,0.9593461,0.011493365,0.00034495274],"about_ca_topic_score_codex":0.0000039638157,"about_ca_topic_score_gemma":0.0000044964168,"teacher_disagreement_score":0.40981057,"about_ca_system_score_codex":0.000045640547,"about_ca_system_score_gemma":0.00011971412,"threshold_uncertainty_score":0.8064417},"labels":[],"label_agreement":null},{"id":"W4408444479","doi":"10.5070/c65165017","title":"A generalization of perfectly clustering words and band bricks for certain gentle algebras","year":2025,"lang":"en","type":"article","venue":"Combinatorial Theory","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Generalization; Cluster analysis; Mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.009319500039994913,"score_gpt":0.2555879722844736,"score_spread":0.2462684722444787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408444479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0858404,0.0006887618,0.90930945,0.00007439453,0.002192281,0.00024976558,0.0000015123657,0.00005528718,0.0015881346],"genre_scores_gemma":[0.9957263,0.000024977127,0.0036699635,0.00012808833,0.00009337159,0.000025388124,0.000002562136,0.0000062723307,0.00032307193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927324,0.00008588855,0.00017033328,0.00023736736,0.000078466,0.00015471029],"domain_scores_gemma":[0.99933964,0.0002582751,0.000066766224,0.00023900084,0.000061019076,0.000035309913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035407487,0.00009789189,0.00016305913,0.00008544714,0.00011088248,0.000045096203,0.00028364777,0.000059988073,0.000005612216],"category_scores_gemma":[0.00014522752,0.000091918795,0.00004543716,0.00023446298,0.000052545056,0.00015928624,0.00015168401,0.00004927416,5.313212e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043430508,0.000030517276,0.00014997898,0.000046968824,0.000014445177,4.9683473e-7,0.00035496367,0.00008640446,0.0035038649,0.98351085,0.00009247183,0.012165623],"study_design_scores_gemma":[0.0010437163,0.00010317699,0.00018148018,0.00003343969,0.000011458836,0.0000012504177,0.00003792905,0.006707384,0.012797579,0.9777689,0.0012050859,0.00010859874],"about_ca_topic_score_codex":0.0000030446179,"about_ca_topic_score_gemma":0.000001110342,"teacher_disagreement_score":0.9098859,"about_ca_system_score_codex":0.00002478591,"about_ca_system_score_gemma":0.0000428808,"threshold_uncertainty_score":0.37483397},"labels":[],"label_agreement":null},{"id":"W4408798881","doi":"10.28924/2291-8639-23-2025-69","title":"Derivations of Bd-Algebras were Constructed into Semigroups","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field; Semigroup","score_opus":0.00428336007056095,"score_gpt":0.2723973572376481,"score_spread":0.2681139971670871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408798881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0677811,0.00030218635,0.9290404,0.0019471687,0.00006493716,0.000046513556,0.000004058863,0.000009967012,0.0008036725],"genre_scores_gemma":[0.9584689,0.00016598843,0.04104544,0.00020053568,0.00004538229,0.000006975221,0.0000060403227,0.0000016112316,0.000059133257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990815,0.000022706901,0.00047919172,0.00013177909,0.00022204671,0.00006277234],"domain_scores_gemma":[0.99868613,0.00013554316,0.00029331827,0.00018231537,0.0006575943,0.000045091256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013502395,0.000069767884,0.00020350471,0.0005955888,0.00007319563,0.00006364746,0.0006539427,0.000032299875,0.000018203727],"category_scores_gemma":[0.000040275456,0.000059569244,0.00015518621,0.0010200188,0.000084667765,0.0002518027,0.000114668655,0.00009211697,0.0000010366547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052621913,0.00009720018,0.017603803,0.0000055351247,0.0012240951,0.0000020602474,0.00015070711,0.0006167828,0.004743384,0.9316048,0.00012895743,0.043817427],"study_design_scores_gemma":[0.001493523,0.00010673268,0.18068543,0.00011558118,0.0012837016,0.000093655195,0.00088032166,0.02124582,0.019135905,0.74510604,0.029434027,0.0004192297],"about_ca_topic_score_codex":0.000012004776,"about_ca_topic_score_gemma":0.000014283759,"teacher_disagreement_score":0.8906878,"about_ca_system_score_codex":0.000027652664,"about_ca_system_score_gemma":0.00007153731,"threshold_uncertainty_score":0.24291632},"labels":[],"label_agreement":null},{"id":"W4409187229","doi":"10.1007/s00012-025-00890-y","title":"On the structure of modal and tense operators on a boolean algebra","year":2025,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Algebra over a field; Modal operator; Modal; Boolean algebra; Stone's representation theorem for Boolean algebras; Complete Boolean algebra; Two-element Boolean algebra; Free Boolean algebra; Pure mathematics; Modal logic; Discrete mathematics; Filtered algebra","score_opus":0.005553129082872746,"score_gpt":0.20730947313449521,"score_spread":0.20175634405162246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409187229","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97716737,0.00009949817,0.013709422,0.0039288285,0.00022512497,0.00023286382,0.000017862554,0.000102270664,0.004516771],"genre_scores_gemma":[0.99569345,0.000020289868,0.0008095662,0.0030920706,0.00001710366,9.480691e-7,0.0000022564823,0.0000076027736,0.00035670205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989468,0.00009258446,0.00015002114,0.000388538,0.00019834918,0.00022370392],"domain_scores_gemma":[0.9988448,0.00032382988,0.00007058556,0.00063742744,0.00005988526,0.00006349878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007511804,0.00018712209,0.00019121951,0.00016894797,0.00018918807,0.00006089354,0.00071811734,0.00007966054,0.00003919091],"category_scores_gemma":[0.000075535594,0.00012405834,0.000059753205,0.0005475887,0.00015979787,0.00024180733,0.00023323137,0.00021704254,0.00000616778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023351575,0.000024713598,0.00009527593,0.000006634709,0.0000337458,0.000014218402,0.00045277682,0.00016578673,0.0014027127,0.9924423,0.001214399,0.004124061],"study_design_scores_gemma":[0.001982055,0.0009403259,0.0063810498,0.00023798534,0.000066973415,0.000018545004,0.0012654156,0.008956631,0.068720154,0.9041679,0.006526759,0.00073621573],"about_ca_topic_score_codex":0.00003181247,"about_ca_topic_score_gemma":0.000015015828,"teacher_disagreement_score":0.08827443,"about_ca_system_score_codex":0.000036992766,"about_ca_system_score_gemma":0.000065986824,"threshold_uncertainty_score":0.5058952},"labels":[],"label_agreement":null},{"id":"W4409708748","doi":"10.1007/978-3-031-85352-4_5","title":"Semantics","year":2025,"lang":"en","type":"book-chapter","venue":"Computer science foundations and applied logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.021291313101472403,"score_gpt":0.25449671842905314,"score_spread":0.23320540532758074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409708748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006979891,0.000115022325,0.6789565,0.00052630086,0.00054385053,0.00021217922,0.0000026509665,0.00018435455,0.31945217],"genre_scores_gemma":[0.026833659,0.00040225213,0.8285445,0.003965085,0.0005352845,0.00004135215,0.000034604993,0.000030926953,0.13961233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976952,0.0000059936883,0.000335352,0.0011419387,0.00041612374,0.00040540702],"domain_scores_gemma":[0.9984087,0.0001130158,0.00018932483,0.0009639904,0.00016472013,0.0001602747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002932392,0.00036266464,0.00035575303,0.00046953224,0.00089455483,0.0008385451,0.0017502982,0.00015205289,0.000032471726],"category_scores_gemma":[0.000009234799,0.00031846514,0.000072747825,0.00038318336,0.0008590508,0.00043072665,0.001586522,0.000319809,0.00012179144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.493273e-7,0.000009729342,6.6087e-7,0.000013400246,0.000006136987,0.0000035947737,0.000035624358,0.00009934981,0.000019607825,0.85705465,0.0004089484,0.14234786],"study_design_scores_gemma":[0.0001501139,0.00005955811,0.000048695834,0.000056406756,0.000016113914,0.000022007707,0.0000022916145,0.023440516,0.00003118375,0.8819299,0.09376867,0.00047458636],"about_ca_topic_score_codex":5.9283724e-7,"about_ca_topic_score_gemma":0.0000013289356,"teacher_disagreement_score":0.17983983,"about_ca_system_score_codex":0.000077842844,"about_ca_system_score_gemma":0.0003638647,"threshold_uncertainty_score":0.99992675},"labels":[],"label_agreement":null},{"id":"W4409790426","doi":"10.1142/s179355712540011x","title":"A note on β-classes","year":2025,"lang":"en","type":"article","venue":"Asian-European Journal of Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Computer science","score_opus":0.016206555412009736,"score_gpt":0.2663543653024105,"score_spread":0.2501478098904008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409790426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030230766,0.000096917225,0.87267804,0.0027190207,0.0003771298,0.000045880683,2.9336604e-7,0.0000384977,0.12102113],"genre_scores_gemma":[0.6933976,0.000034885008,0.30435157,0.0011629775,0.00010490353,3.5652508e-7,9.7748455e-8,0.000013270309,0.00093439454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988843,0.00012650949,0.00046490054,0.00011678177,0.00024272082,0.00016478305],"domain_scores_gemma":[0.9988962,0.00019247447,0.00034837914,0.00038246048,0.00011016605,0.00007035912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006030252,0.00012300488,0.00021473522,0.00017520382,0.00007128145,0.00009947388,0.0009940262,0.000016589034,0.000008918076],"category_scores_gemma":[0.00028154752,0.000088997425,0.00014669022,0.00028396264,0.000032511456,0.00023200415,0.00012911615,0.00023659093,0.00012081797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011886733,0.0004968296,0.000028582595,0.00010650867,0.00008976451,0.0009293577,0.0022398913,0.0003276362,0.00094877754,0.7521613,0.008523771,0.23413566],"study_design_scores_gemma":[0.004072086,0.0027957878,0.004672103,0.0031685364,0.00018879374,0.0015885691,0.0014733459,0.011877315,0.011483553,0.7951471,0.16240391,0.001128882],"about_ca_topic_score_codex":3.977808e-8,"about_ca_topic_score_gemma":1.3901911e-7,"teacher_disagreement_score":0.6903745,"about_ca_system_score_codex":0.00003068154,"about_ca_system_score_gemma":0.000059073263,"threshold_uncertainty_score":0.36292097},"labels":[],"label_agreement":null},{"id":"W4410590685","doi":"10.37236/12962","title":"3-Cluster-Free Families of Subspaces","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear subspace; Cluster (spacecraft); Mathematics; Combinatorics; Computer science; Pure mathematics; Programming language","score_opus":0.003592812360183899,"score_gpt":0.22310507720525183,"score_spread":0.21951226484506792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410590685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17165673,0.012537761,0.80551434,0.0058006737,0.0009451479,0.000101626625,2.928766e-7,0.00002712888,0.003416323],"genre_scores_gemma":[0.9980298,0.0011437897,0.00024942335,0.00015495103,0.000023494189,9.1476016e-7,5.3982006e-8,0.0000038507337,0.0003936772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988233,0.00010672125,0.00034757608,0.000090859954,0.0002983993,0.00033315766],"domain_scores_gemma":[0.99853,0.0003332112,0.0003569966,0.00051761186,0.00023261823,0.000029575318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073218334,0.00010413053,0.00024199944,0.00015308605,0.00009372648,0.00002995727,0.0022163559,0.000039278682,0.0000015241066],"category_scores_gemma":[0.00016835352,0.00006542438,0.00011168808,0.0007669254,0.0000762643,0.00026116797,0.00025895858,0.00041139335,0.0000011993403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015788102,0.000055689718,0.00017924025,0.000010403298,0.000046061938,0.000002036083,0.00020690745,0.0001600525,0.00019209756,0.9964704,0.000706897,0.0019544458],"study_design_scores_gemma":[0.00066257396,0.00034590703,0.00041504312,0.000028463768,0.0000210469,0.00003496991,0.00012002433,0.0004541274,0.00463492,0.98976344,0.0034559467,0.00006350898],"about_ca_topic_score_codex":0.0000029443963,"about_ca_topic_score_gemma":0.0000048009915,"teacher_disagreement_score":0.8263731,"about_ca_system_score_codex":0.000111901674,"about_ca_system_score_gemma":0.0004672299,"threshold_uncertainty_score":0.41185775},"labels":[],"label_agreement":null},{"id":"W4410610668","doi":"10.61091/jcmcc126-14","title":"Counting of lattices having nullity up to two","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Materials science","score_opus":0.014920220513295458,"score_gpt":0.2881407797913041,"score_spread":0.27322055927800865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410610668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6475881,0.00032307915,0.33187512,0.00028672014,0.01828876,0.00022847597,6.973621e-7,0.000047724505,0.0013613316],"genre_scores_gemma":[0.9611282,0.000010889037,0.03834866,0.00006948596,0.00041792542,0.0000010471167,1.6149986e-7,0.000011659548,0.00001200369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973723,0.00010565972,0.0013047,0.0002693148,0.0006018496,0.00034613998],"domain_scores_gemma":[0.9964304,0.0010594674,0.0011612558,0.00038650402,0.00080269825,0.00015969892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020162612,0.00025173396,0.0008219092,0.00031926687,0.00026116916,0.00026249938,0.0010731241,0.00009695214,0.0000021216981],"category_scores_gemma":[0.00085907703,0.00022449932,0.00016714813,0.00077233557,0.00006871703,0.00043056137,0.0006873015,0.00038770406,0.0000013853817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003694055,0.00018402941,0.00038718045,0.00018293537,0.000061507766,0.000008609638,0.0012800297,0.00013922866,0.0010689645,0.99145484,0.000078752004,0.005117005],"study_design_scores_gemma":[0.0028853882,0.00041311284,0.00034182105,0.00077363034,0.00006203158,0.00003080937,0.00032944712,0.011650556,0.0039471,0.97861284,0.0006886316,0.00026460574],"about_ca_topic_score_codex":0.000010098218,"about_ca_topic_score_gemma":4.423301e-7,"teacher_disagreement_score":0.31354007,"about_ca_system_score_codex":0.000074763884,"about_ca_system_score_gemma":0.00019398467,"threshold_uncertainty_score":0.9154817},"labels":[],"label_agreement":null},{"id":"W4410632580","doi":"10.22215/etd/2025-16456","title":"Topics in the Generation of Ideals of Posets","year":2025,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Art","score_opus":0.032528437750507566,"score_gpt":0.30149892624209457,"score_spread":0.268970488491587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410632580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5303457,0.0016087535,0.2359473,0.0012589381,0.0020025657,0.00089079916,0.000007946665,0.000053027925,0.22788501],"genre_scores_gemma":[0.97981954,0.00008178738,0.011621884,0.0002658419,0.000052142383,0.000013309101,0.00010428617,0.0000023954242,0.008038822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944615,0.00003745929,0.00021909874,0.000115941926,0.00012745823,0.000053910426],"domain_scores_gemma":[0.999526,0.000045092194,0.00011519057,0.00024942425,0.00005957939,0.000004700123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010791715,0.00005879098,0.00012542352,0.0000789022,0.00001266364,0.000009397413,0.00044504993,0.00006631084,0.000006227334],"category_scores_gemma":[0.000030407462,0.000038167967,0.00003540399,0.00022345969,0.0000043224754,0.00006727172,0.000012628917,0.00006462068,5.782869e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022049535,0.00003452956,0.00007049968,0.000088834466,0.0000051375378,0.0000013023562,0.0014457076,0.00015617974,0.0022838118,0.938592,0.00036629467,0.056953497],"study_design_scores_gemma":[0.001019927,0.00048018977,0.09298755,0.0005403536,0.000056176694,0.000004379367,0.0022733998,0.030658236,0.34371588,0.52295655,0.0044812653,0.0008260908],"about_ca_topic_score_codex":0.000031817803,"about_ca_topic_score_gemma":0.00042006944,"teacher_disagreement_score":0.44947386,"about_ca_system_score_codex":0.000005817357,"about_ca_system_score_gemma":0.00006068562,"threshold_uncertainty_score":0.15564446},"labels":[],"label_agreement":null},{"id":"W4411084403","doi":"10.56754/0719-0646.2701.083","title":"Congruences of infinite semidistributive lattices","year":2025,"lang":"en","type":"article","venue":"Cubo","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Mathematics; Pure mathematics","score_opus":0.010718648334977656,"score_gpt":0.27225860518439,"score_spread":0.26153995684941234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411084403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12609537,0.0011639373,0.8232167,0.0009575019,0.00058209745,0.0001165491,0.000010446525,0.00013131136,0.0477261],"genre_scores_gemma":[0.99493116,0.000019428237,0.004477014,0.00021108417,0.000009562541,0.0000032744638,0.0000013211638,8.2040157e-7,0.0003463481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995574,0.000018986844,0.00011125908,0.00013778293,0.000069097565,0.00010551854],"domain_scores_gemma":[0.9995249,0.00013930735,0.00005424679,0.00020042511,0.000060918486,0.000020186946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006889942,0.000049145405,0.000096102594,0.000040341118,0.00004197486,0.000020790949,0.0004147282,0.000025145833,0.00000880732],"category_scores_gemma":[0.00006682522,0.000042226453,0.000026532987,0.00034447567,0.00007181534,0.0001948254,0.00012602167,0.000049058057,0.000012921798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021764201,0.000019664012,0.004450796,0.000018001734,0.000012353086,0.000003429389,0.00019658648,0.000058200134,0.00066174637,0.9704303,0.00040098553,0.023745725],"study_design_scores_gemma":[0.00058800826,0.00014614187,0.055576067,0.00016689514,0.000019822273,0.0000040382797,0.00028955616,0.0063613583,0.0853654,0.80409765,0.04705612,0.00032893784],"about_ca_topic_score_codex":0.0000073538304,"about_ca_topic_score_gemma":0.0000034625016,"teacher_disagreement_score":0.8688358,"about_ca_system_score_codex":0.000008284178,"about_ca_system_score_gemma":0.000047126545,"threshold_uncertainty_score":0.17219448},"labels":[],"label_agreement":null},{"id":"W4411217276","doi":"10.4153/s0008439525100775","title":"$B_h$-sets of real and complex numbers","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"City University of New York","keywords":"Mathematics; Pure mathematics","score_opus":0.013718034261716363,"score_gpt":0.24957619290895455,"score_spread":0.2358581586472382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411217276","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093954824,0.00020044595,0.27605808,0.034572974,0.00023328833,0.0005152089,0.000016341963,0.00016468557,0.5942842],"genre_scores_gemma":[0.9505718,0.00001123718,0.046047587,0.0015497007,0.000008766416,0.0000079160045,0.0000017963365,0.0000052360842,0.00179596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992795,0.000026362599,0.00018369603,0.00019055518,0.00008326537,0.0002366392],"domain_scores_gemma":[0.9992595,0.00016130999,0.000031971114,0.00028433892,0.000031546457,0.00023135405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119427474,0.00008693398,0.0001806744,0.00009191785,0.00006687426,0.000031859094,0.0003302316,0.000048759055,0.0007557058],"category_scores_gemma":[0.0001040516,0.00007850422,0.000029933362,0.00016933662,0.000117453135,0.000027416492,0.00007550057,0.000071916314,0.00032618133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.386685e-7,0.0000106309335,0.00009429841,0.000055310633,0.0000068332965,0.000013871609,0.000115787436,0.0000019692754,0.000038296883,0.98380435,0.011113827,0.0047439886],"study_design_scores_gemma":[0.0003826251,0.00004654422,0.0053945943,0.00012300529,0.000012361145,0.000027508526,0.00011204837,0.0042964863,0.0001423515,0.89419496,0.095015734,0.00025179307],"about_ca_topic_score_codex":0.0007106427,"about_ca_topic_score_gemma":0.00063304,"teacher_disagreement_score":0.856617,"about_ca_system_score_codex":0.000038545655,"about_ca_system_score_gemma":0.000108070475,"threshold_uncertainty_score":0.8274449},"labels":[],"label_agreement":null},{"id":"W4411345232","doi":"10.28924/2291-8639-23-2025-145","title":"On the Discrete Extension and Neighborhood Assignments","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Extension (predicate logic); Pure mathematics; Algebra over a field; Calculus (dental); Computer science; Medicine; Programming language","score_opus":0.007268531354564154,"score_gpt":0.2816971610908978,"score_spread":0.27442862973633364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411345232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011225996,0.00018037786,0.9782416,0.009028342,0.00004156143,0.000039332863,0.0000015310169,0.00000418229,0.001237077],"genre_scores_gemma":[0.9969206,0.00018379465,0.0018346377,0.0009120672,0.000033536206,0.000005775854,8.5900314e-7,9.2629585e-7,0.0001078148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994746,0.000021760407,0.00017319183,0.00011000821,0.00017570806,0.000044730925],"domain_scores_gemma":[0.9993765,0.00017954179,0.0001401849,0.00013447486,0.0001405559,0.000028789327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014979183,0.000047527712,0.00008775236,0.00018381543,0.000092952985,0.00011049922,0.0003570155,0.000013767712,0.0000074079203],"category_scores_gemma":[0.000027598293,0.00002763499,0.0000642283,0.00032186895,0.00003184647,0.00012344346,0.00008956304,0.000074016876,0.0000011323184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003983434,0.000032838583,0.0014895216,4.638703e-7,0.0003546416,0.0000015237482,0.000027179827,0.00025392423,0.00036505115,0.954968,0.0001096906,0.042393222],"study_design_scores_gemma":[0.00037027875,0.000060173807,0.09282558,0.000032524335,0.00028386878,0.000019107116,0.00010067898,0.030461486,0.00055689,0.869134,0.006047574,0.000107808555],"about_ca_topic_score_codex":0.0000015962684,"about_ca_topic_score_gemma":0.0000012499863,"teacher_disagreement_score":0.9856946,"about_ca_system_score_codex":0.00001324466,"about_ca_system_score_gemma":0.000013540911,"threshold_uncertainty_score":0.112692215},"labels":[],"label_agreement":null},{"id":"W4411409639","doi":"10.1109/ismvl64713.2025.00047","title":"On the Contributions to Multiple-Valued Logic by Prof. Kenneth C. Smith","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Mathematical economics; Mathematics","score_opus":0.011154139614688965,"score_gpt":0.2831303816011226,"score_spread":0.2719762419864336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411409639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017700698,0.00011658758,0.9430456,0.039566554,0.00019852,0.00045267743,0.000010243893,0.0002216229,0.01461812],"genre_scores_gemma":[0.94329244,0.00000820137,0.012415484,0.026722178,0.00002578079,0.00013449519,0.0000031690074,0.0000042917286,0.017393982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908054,0.00007602834,0.00013030229,0.00031047207,0.00012991494,0.00027275365],"domain_scores_gemma":[0.9988283,0.00048851396,0.00002687383,0.000505629,0.00008598654,0.00006467565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019274904,0.00011099811,0.00010770605,0.000047061818,0.00025624514,0.00008012124,0.00075096963,0.00003962343,0.000033508953],"category_scores_gemma":[0.00049899064,0.000060700753,0.000043359898,0.0005086629,0.000036167956,0.00009293206,0.00020923388,0.00013174927,0.00019136294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032829946,0.000043971573,0.00003294155,0.0000012049911,0.000006354523,8.8433916e-7,0.00002581841,0.00015429554,0.00045877878,0.8968684,0.10085896,0.0015451246],"study_design_scores_gemma":[0.0010718531,0.000388092,0.001994968,0.00005068496,0.000010267725,0.0000027747235,0.00007130914,0.06775042,0.022520939,0.76610214,0.13960937,0.00042717953],"about_ca_topic_score_codex":0.0000112900725,"about_ca_topic_score_gemma":0.000006630766,"teacher_disagreement_score":0.94152236,"about_ca_system_score_codex":0.000053056483,"about_ca_system_score_gemma":0.000055243443,"threshold_uncertainty_score":0.24753049},"labels":[],"label_agreement":null},{"id":"W4411873658","doi":"10.1007/s43037-025-00435-4","title":"Publisher Correction Note to: Correction to: On the numerical ranges of matrices in max algebra","year":2025,"lang":"en","type":"article","venue":"Banach Journal of Mathematical Analysis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Algebra over a field; Mathematics; Matrix algebra; Pure mathematics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.010334128307109437,"score_gpt":0.27358299220139204,"score_spread":0.2632488638942826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411873658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027177842,0.00006051682,0.9622452,0.0071297977,0.00092033803,0.00011911398,2.5140307e-7,0.000015327429,0.002331587],"genre_scores_gemma":[0.9801618,0.000013061064,0.018222772,0.0007666114,0.000040111787,0.0000080151585,2.6138378e-7,0.000004698576,0.00078267977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998232,0.0001812485,0.00068964687,0.00020671188,0.00049462164,0.00019575522],"domain_scores_gemma":[0.9978691,0.0011737202,0.00029670406,0.00033685938,0.00021992018,0.000103727216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010448395,0.00013377535,0.00052175496,0.0010337932,0.00006410308,0.000114549344,0.0007428305,0.000051249455,0.00008195922],"category_scores_gemma":[0.0013992501,0.000079934995,0.0003085786,0.0048973914,0.000026134712,0.00029292313,0.000111924935,0.00027970606,0.00002249795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006522657,0.0031662069,0.009804075,0.0001830224,0.0024949487,0.000112904156,0.0050264536,0.16374147,0.0011041531,0.30113605,0.14144118,0.37113726],"study_design_scores_gemma":[0.00126412,0.0015817089,0.059307892,0.0010829679,0.0017281519,0.00010918235,0.0015354161,0.56406236,0.0045905807,0.36051586,0.0034118549,0.0008098635],"about_ca_topic_score_codex":0.000023421964,"about_ca_topic_score_gemma":0.000026650063,"teacher_disagreement_score":0.952984,"about_ca_system_score_codex":0.000098001314,"about_ca_system_score_gemma":0.000049194154,"threshold_uncertainty_score":0.32596546},"labels":[],"label_agreement":null},{"id":"W4412022751","doi":"10.37236/12851","title":"Characterizations of Perfectly Clustering Words","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Natural language processing; Computer science; Artificial intelligence; Mathematics","score_opus":0.004797784448982438,"score_gpt":0.23334965078588837,"score_spread":0.22855186633690594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412022751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08049219,0.0015444953,0.91495353,0.0013393817,0.0005847774,0.000056373658,1.4140682e-7,0.00001479229,0.0010143166],"genre_scores_gemma":[0.9989855,0.0003939046,0.00017155574,0.000118602184,0.000027260588,0.0000010800014,1.3194004e-7,0.0000038016535,0.00029811924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990805,0.00007574466,0.00031898404,0.00007468415,0.0001871216,0.00026301522],"domain_scores_gemma":[0.99908704,0.00013972889,0.000302926,0.00027078378,0.00017379284,0.000025762027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049178634,0.0000805219,0.00018210361,0.00012715932,0.000104191924,0.000030651692,0.0009958307,0.000030357613,0.0000027550143],"category_scores_gemma":[0.000067745306,0.000054763812,0.000084531945,0.00075060874,0.000034825378,0.00025089795,0.00013323316,0.00035441143,0.0000011135235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000812512,0.000051163363,0.00013995502,0.000008412751,0.0000330736,0.0000015525027,0.0002133021,0.0002650681,0.001964456,0.9940073,0.000028063996,0.0032795663],"study_design_scores_gemma":[0.0005279236,0.00035974898,0.0016063516,0.000056112218,0.000028177838,0.000066009015,0.00005244332,0.0039092866,0.00491799,0.98570806,0.002678214,0.000089678986],"about_ca_topic_score_codex":7.439773e-7,"about_ca_topic_score_gemma":9.987738e-7,"teacher_disagreement_score":0.91849333,"about_ca_system_score_codex":0.00011443375,"about_ca_system_score_gemma":0.00036709133,"threshold_uncertainty_score":0.22332034},"labels":[],"label_agreement":null},{"id":"W4412304091","doi":"","title":"Leigh, Oliver. Unweighted Donaldson-Thomas theory of the banana 3-fold with section classes. Q. J. Math. 71 (2020), no. 3, 867--942.","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Section (typography); Fold (higher-order function); Mathematics; Combinatorics; Philosophy; Computer science; Programming language","score_opus":0.006822094231473191,"score_gpt":0.18878300923909125,"score_spread":0.18196091500761805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412304091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12712319,0.0007232771,0.78118664,0.0023167632,0.002858427,0.00091171433,0.000024020603,0.000583512,0.08427247],"genre_scores_gemma":[0.97495365,0.000029485871,0.011358172,0.0011082187,0.00013351112,0.000044883967,0.0000046035,0.000020562746,0.012346892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980547,0.00029176933,0.00027100256,0.00047863007,0.00058163493,0.0003222578],"domain_scores_gemma":[0.9985717,0.00019041143,0.0002205388,0.00079825247,0.00014796658,0.00007112454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039024808,0.00020073519,0.00021697218,0.000076629025,0.00048734105,0.00004976267,0.0012038708,0.000048264137,0.00036829902],"category_scores_gemma":[0.000027601634,0.000120421995,0.0001055353,0.0011007809,0.00012010497,0.00036755166,0.00068711437,0.00033942898,0.000026111595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007683199,0.00017279557,0.0009120882,0.000023416127,0.00005925389,0.000032250806,0.00043502403,0.0013983552,0.0032380733,0.984572,0.0066664936,0.002413453],"study_design_scores_gemma":[0.005032424,0.0032876905,0.067861006,0.00012648242,0.00020941501,0.0009199643,0.002151946,0.08736304,0.027069708,0.38518277,0.41820458,0.0025909762],"about_ca_topic_score_codex":0.000040469644,"about_ca_topic_score_gemma":0.000045216646,"teacher_disagreement_score":0.8478305,"about_ca_system_score_codex":0.00010151191,"about_ca_system_score_gemma":0.00015972959,"threshold_uncertainty_score":0.49106663},"labels":[],"label_agreement":null},{"id":"W4412617745","doi":"10.55016/ojs/cdm.v12i1.62277","title":"Independence complexes and incidence graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Independence (probability theory); Mathematics; Combinatorics; Independence number; Genealogy; Discrete mathematics; Graph; Statistics; History","score_opus":0.01821556129790029,"score_gpt":0.3112182112554097,"score_spread":0.2930026499575094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036113888,0.00013109496,0.9591743,0.0026716173,0.00011048899,0.00027692897,0.00004231281,0.00012394303,0.0013554695],"genre_scores_gemma":[0.9171025,0.000019824676,0.08250148,0.00017581576,0.000021938396,0.000030888397,0.0000018760146,0.000005592728,0.00014006521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988837,0.000022201455,0.000224921,0.00031156463,0.00024832698,0.00030924552],"domain_scores_gemma":[0.9981125,0.00014516347,0.00017109068,0.0011841969,0.00019193836,0.000195083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030069146,0.0001496396,0.00022205235,0.00006958991,0.0010577947,0.00058171817,0.0013325816,0.000059367947,0.000008364652],"category_scores_gemma":[0.0011112436,0.00012608206,0.0000590726,0.000118615615,0.0001849028,0.00074381125,0.00090340246,0.00013874886,0.00007196467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.864648e-7,0.000019225956,0.0005552816,0.00001226085,0.000009068739,0.0000094086145,0.00034699807,0.000011654182,0.00055883464,0.9965305,0.00011398793,0.0018318061],"study_design_scores_gemma":[0.00027936007,0.00006573916,0.016037695,0.00008996136,0.000014944054,0.000055895845,0.00006804611,0.010808256,0.0013714321,0.97025007,0.0006668226,0.00029177038],"about_ca_topic_score_codex":0.00001149997,"about_ca_topic_score_gemma":0.000022051967,"teacher_disagreement_score":0.88098866,"about_ca_system_score_codex":0.000030442508,"about_ca_system_score_gemma":0.000040399544,"threshold_uncertainty_score":0.8135808},"labels":[],"label_agreement":null},{"id":"W4412647483","doi":"10.55016/ojs/cdm.v2i2.61973","title":"Priestley duality for some algebras with a negation operator","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Negation; Mathematics; Duality (order theory); Operator (biology); Algebra over a field; Combinatorics; Pure mathematics; Linguistics; Chemistry; Philosophy","score_opus":0.014864322971557814,"score_gpt":0.3054678893635603,"score_spread":0.29060356639200247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021804284,0.000055456465,0.9744075,0.0020944152,0.00010328178,0.0009657339,0.00008580898,0.00021220007,0.0002713249],"genre_scores_gemma":[0.5778777,0.0000018719596,0.42093122,0.0006545518,0.00011667418,0.00014399589,0.000029321413,0.000014934743,0.00022972324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986279,0.00002082561,0.00035706937,0.00031384936,0.00023280612,0.00044751933],"domain_scores_gemma":[0.9983979,0.00033998457,0.00012028521,0.0005766746,0.00035745164,0.00020773074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006565829,0.00017626393,0.00024093357,0.00008599706,0.00033883928,0.00016719296,0.00045701265,0.00005470275,0.000006003478],"category_scores_gemma":[0.00061409123,0.00013314428,0.000081430124,0.00044025196,0.000060600225,0.00056715443,0.00012602053,0.00008850474,0.000045418048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012195794,0.00006492608,0.000030283056,0.000026113345,0.000021434442,0.0000038295193,0.0005243407,0.00007644595,0.0005857053,0.9974383,0.00022693639,0.0009895011],"study_design_scores_gemma":[0.0021918688,0.00075541914,0.0015716447,0.00016212813,0.00008843242,0.00006633105,0.0004753327,0.016282776,0.042749256,0.9212606,0.013434501,0.00096173835],"about_ca_topic_score_codex":0.0000016262953,"about_ca_topic_score_gemma":0.000012763766,"teacher_disagreement_score":0.5560734,"about_ca_system_score_codex":0.000120283876,"about_ca_system_score_gemma":0.000101544545,"threshold_uncertainty_score":0.5429466},"labels":[],"label_agreement":null},{"id":"W4412647517","doi":"10.55016/ojs/cdm.v2i2.61963","title":"Aspects of singular cofinality","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cofinality; Mathematics; Combinatorics; Uncountable set","score_opus":0.015302729185797751,"score_gpt":0.30302730938609956,"score_spread":0.28772458020030184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145557495,0.00009394441,0.976547,0.00057990436,0.00009749484,0.00022269877,0.000022883813,0.000110216715,0.0077701323],"genre_scores_gemma":[0.84200865,0.000001415081,0.15777987,0.00010307942,0.000029186953,0.0000046078626,0.0000036423673,0.000004829122,0.00006469625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998844,0.00002062821,0.00037912,0.00019653451,0.00023824716,0.00032144826],"domain_scores_gemma":[0.9985926,0.00023286736,0.00013686421,0.000619859,0.00027131903,0.00014649959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065994106,0.000115901894,0.00023502685,0.00008958119,0.00011902621,0.000036203477,0.00052725035,0.000050152037,0.000012907204],"category_scores_gemma":[0.0006953742,0.00009977908,0.00010690971,0.00054190925,0.0000637396,0.00015431418,0.00019287124,0.00008364045,0.000055736607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018850649,0.000066845765,0.000026785738,0.00001847138,0.000012052081,0.000008522147,0.00033800397,0.00003375424,0.002311795,0.99579483,0.000055800112,0.0013312633],"study_design_scores_gemma":[0.00035188446,0.00013297667,0.0017020098,0.00007363971,0.000025462463,0.000026671105,0.00011619918,0.0045511,0.043426555,0.94653434,0.0027914776,0.0002676745],"about_ca_topic_score_codex":0.0000026378855,"about_ca_topic_score_gemma":0.000004733909,"teacher_disagreement_score":0.8274529,"about_ca_system_score_codex":0.00006977579,"about_ca_system_score_gemma":0.00005240163,"threshold_uncertainty_score":0.4068873},"labels":[],"label_agreement":null},{"id":"W4412826069","doi":"10.28924/2291-8639-23-2025-179","title":"The Existence of Weak Relative Pseudo-Complements in Almost Distributive Lattices","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Distributive property; Mathematics; Pure mathematics","score_opus":0.010691162975328346,"score_gpt":0.320054039981263,"score_spread":0.3093628770059347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412826069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021281136,0.0003734235,0.9732955,0.0030852337,0.000047377333,0.00006366486,0.000013915649,0.0000027763112,0.0018369813],"genre_scores_gemma":[0.99297523,0.00030552267,0.0065119965,0.000052382413,0.000018543209,0.0000088688685,0.000003572135,7.660671e-7,0.00012313017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921167,0.000034097764,0.0003887126,0.0001018906,0.00019905186,0.000064577864],"domain_scores_gemma":[0.9987731,0.00032113795,0.0003730817,0.00012565349,0.00038507555,0.00002195219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026012203,0.000049569157,0.00013169617,0.00020708315,0.00008047121,0.00005616579,0.00067355396,0.000014276684,0.0000036707754],"category_scores_gemma":[0.000042378106,0.000033150438,0.00008061551,0.000749662,0.00007452935,0.00023565933,0.00011569793,0.00008726828,6.578365e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092924765,0.00007134628,0.027272526,0.0000014054937,0.0005879485,0.0000014489389,0.00013767758,0.0003514495,0.00016167077,0.9430947,0.000035719393,0.028274816],"study_design_scores_gemma":[0.00076170487,0.00006755156,0.42434803,0.00007044286,0.00032011815,0.000011937359,0.0011455606,0.019685129,0.0009194492,0.52829367,0.024226038,0.00015033563],"about_ca_topic_score_codex":0.000017408242,"about_ca_topic_score_gemma":0.00005326391,"teacher_disagreement_score":0.97169405,"about_ca_system_score_codex":0.000033903445,"about_ca_system_score_gemma":0.000036696456,"threshold_uncertainty_score":0.13518356},"labels":[],"label_agreement":null},{"id":"W4412847296","doi":"10.1142/s1793525325500256","title":"Discrete inclusions of C*-algebras","year":2025,"lang":"en","type":"article","venue":"Journal of Topology and Analysis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.005979392322440436,"score_gpt":0.28138295629925486,"score_spread":0.2754035639768144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412847296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17198211,0.0017104673,0.82057786,0.004528964,0.00012645994,0.000012712304,8.0016946e-7,0.000004908601,0.0010557183],"genre_scores_gemma":[0.98647445,0.0002092028,0.01274898,0.0003024227,0.000015900057,1.816953e-7,2.2599791e-7,6.79364e-7,0.00024797613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993997,0.00006108967,0.00029266157,0.00008748977,0.00007461112,0.00008442323],"domain_scores_gemma":[0.9993742,0.00012507309,0.00023022405,0.00014766463,0.00008450799,0.000038291208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021681082,0.000052285217,0.00029877576,0.0004555974,0.00008935197,0.000009427952,0.0003161449,0.0000448038,0.000024698353],"category_scores_gemma":[0.00007102018,0.000036308913,0.00017262093,0.0008182972,0.00010641974,0.00014866365,0.00018989717,0.000110320936,3.8455127e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028417055,0.000095778574,0.08538463,0.000016845837,0.0019001918,0.00005597365,0.00052850915,0.0010169554,0.0013424829,0.8784143,0.00023150224,0.030984454],"study_design_scores_gemma":[0.00085878384,0.00037990988,0.1877096,0.000046487752,0.0018960955,0.00008173111,0.00038382018,0.011996862,0.0028655187,0.7906992,0.00287269,0.00020928637],"about_ca_topic_score_codex":0.000005645769,"about_ca_topic_score_gemma":0.00001102084,"teacher_disagreement_score":0.81449234,"about_ca_system_score_codex":0.0000073231586,"about_ca_system_score_gemma":0.00003755476,"threshold_uncertainty_score":0.14806345},"labels":[],"label_agreement":null},{"id":"W4413186789","doi":"10.55016/ojs/cdm.v5i1.61894","title":"A characterization of the base-matroids of a graphic matroid","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Matroid; Combinatorics; Graphic matroid; Mathematics; Characterization (materials science); Base (topology); Oriented matroid; Matroid partitioning; Discrete mathematics; Physics","score_opus":0.006365721138295434,"score_gpt":0.2445884879603464,"score_spread":0.23822276682205099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32858554,0.0000073921387,0.66967493,0.0009389725,0.00016444897,0.0002894546,0.00012165281,0.000038447924,0.00017913054],"genre_scores_gemma":[0.96943885,0.0000023469293,0.030366914,0.0000664068,0.000025411695,0.000028595972,0.0000068176973,0.0000066280677,0.000058038866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990202,0.000033037384,0.00038188286,0.00015541178,0.00022245933,0.00018699569],"domain_scores_gemma":[0.9984349,0.00011209297,0.00026796895,0.0008451735,0.00027198633,0.000067856265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023975741,0.00011188221,0.00022489669,0.00009088482,0.000112311616,0.000027860353,0.0007954804,0.000057018206,0.000016982855],"category_scores_gemma":[0.00052211486,0.00007532271,0.00016267401,0.0007074948,0.00010445208,0.00017949128,0.0002463566,0.00013853748,0.000010387655],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011238768,0.000046645877,0.00009621796,0.000025203866,0.00000890965,1.9656704e-7,0.00029383838,0.000009439028,0.43889496,0.5604443,0.000011865726,0.00016731798],"study_design_scores_gemma":[0.0008532704,0.00023982138,0.017833829,0.000343054,0.00012117101,0.000055645032,0.0001701951,0.0371863,0.58742225,0.35380885,0.0013822265,0.00058339076],"about_ca_topic_score_codex":0.0000013560548,"about_ca_topic_score_gemma":0.0000055553787,"teacher_disagreement_score":0.6408533,"about_ca_system_score_codex":0.000012068541,"about_ca_system_score_gemma":0.000058714264,"threshold_uncertainty_score":0.30715707},"labels":[],"label_agreement":null},{"id":"W4413302318","doi":"10.1007/978-3-032-01475-7_12","title":"Improved Upper Bounds for Determinizing NIDPDAs with Limited Nondeterminism","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.014362662823750346,"score_gpt":0.24837662059048546,"score_spread":0.23401395776673511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413302318","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011250795,0.000274405,0.9936057,0.0006023959,0.0016140302,0.00089784164,0.0000098812925,0.0002774886,0.0026057821],"genre_scores_gemma":[0.063976,0.000024719458,0.92927295,0.003963424,0.00044125947,0.000075507145,0.000010520213,0.000056590106,0.0021790075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553907,0.000023115559,0.00059680827,0.0021875268,0.00062066654,0.001032825],"domain_scores_gemma":[0.99643046,0.0008850692,0.00037046455,0.0017481778,0.000364357,0.00020148582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004848814,0.0007826207,0.00076356105,0.0009831078,0.0004993546,0.0007636178,0.0036595303,0.00041013758,0.000006574307],"category_scores_gemma":[0.00011725542,0.00063338596,0.00020812293,0.00070676056,0.0007129327,0.00080804253,0.0012177948,0.0007505559,0.0000070282026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034020402,0.0000350641,0.000037865968,0.000107621265,0.000025379055,0.00008884956,0.00052039255,0.0019735403,0.00040323532,0.028421512,0.000022623548,0.9683299],"study_design_scores_gemma":[0.0011389217,0.001164758,0.00007432034,0.00088507804,0.000033191453,0.00014460678,4.7150849e-7,0.75841534,0.0037065605,0.22683771,0.0060595414,0.001539519],"about_ca_topic_score_codex":0.000004960566,"about_ca_topic_score_gemma":0.000054678272,"teacher_disagreement_score":0.9667904,"about_ca_system_score_codex":0.00026961643,"about_ca_system_score_gemma":0.0010129431,"threshold_uncertainty_score":0.99961174},"labels":[],"label_agreement":null},{"id":"W4413459445","doi":"10.2139/ssrn.5393619","title":"A Practitioner's Note on the Shapley-Owen-Shorrocks Decomposition","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Shapley value; Mathematical economics; Mathematics; Chemistry; Game theory; Organic chemistry","score_opus":0.011567449065954626,"score_gpt":0.28863826713211527,"score_spread":0.27707081806616063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413459445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019295032,0.001528896,0.97377044,0.014926655,0.0012889307,0.00033259834,0.000006714011,0.00014675104,0.0060695144],"genre_scores_gemma":[0.9813681,0.005543764,0.005711798,0.0036209426,0.0009978787,0.000085739804,0.000022315844,0.000027404094,0.0026220432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627864,0.00032279355,0.0004184012,0.0006030105,0.0005150832,0.001862087],"domain_scores_gemma":[0.99804455,0.0003483998,0.0005148156,0.00082942186,0.00017523438,0.000087599125],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015345064,0.0003692535,0.00030090252,0.0002345256,0.0006880021,0.0004248778,0.0021509507,0.00025280865,0.000023419985],"category_scores_gemma":[0.0001303891,0.0002583281,0.00030551336,0.00029783213,0.000044428,0.0003522951,0.0007721203,0.0076961387,0.00006851154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038636907,0.00008953766,0.0000067648157,0.000008997182,0.00011035115,0.000011932852,0.00014447626,0.006207118,0.000060796152,0.96632606,0.0005210315,0.026474314],"study_design_scores_gemma":[0.00022632735,0.0002802039,0.00004973392,0.00015948895,0.00003427147,0.0004218314,0.00008115253,0.010196049,0.00018419864,0.98505366,0.0030104818,0.0003025885],"about_ca_topic_score_codex":0.000018670715,"about_ca_topic_score_gemma":0.00014555125,"teacher_disagreement_score":0.9794386,"about_ca_system_score_codex":0.0015242933,"about_ca_system_score_gemma":0.0038087144,"threshold_uncertainty_score":0.9999869},"labels":[],"label_agreement":null},{"id":"W4413804481","doi":"10.2989/16073606.2025.2546648","title":"Locally hulled topologies","year":2025,"lang":"en","type":"article","venue":"Quaestiones Mathematicae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Network topology; Base (topology); Topology (electrical circuits); Weak topology (polar topology); Comparison of topologies; Regular polygon; Pure mathematics; Discrete mathematics; General topology; Combinatorics; Topological space; Extension topology; Mathematical analysis; Computer science","score_opus":0.010099576034595057,"score_gpt":0.27217731166704023,"score_spread":0.2620777356324452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413804481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039701974,0.00018251134,0.9702345,0.004995274,0.00023930578,0.00012799584,2.5764774e-7,0.00047067102,0.019779265],"genre_scores_gemma":[0.7143131,0.000022905135,0.2806964,0.00077863847,0.000026101672,0.000057507834,9.1567483e-7,0.000005635866,0.004098823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991991,0.0000359753,0.00021384245,0.0002395263,0.00012349516,0.00018806972],"domain_scores_gemma":[0.9991028,0.00023691017,0.000053120213,0.00051626633,0.000057578596,0.00003336738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016401394,0.00010776989,0.00016706162,0.000091698384,0.00012802983,0.00007646471,0.00060523226,0.0000493602,0.000037148213],"category_scores_gemma":[0.00026976195,0.00008391556,0.000050817478,0.0003620503,0.00007246891,0.00022107667,0.00018937621,0.00007826075,0.0002692134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014667492,0.000046668552,0.00003735839,0.000033274813,0.000007003785,0.0000042319793,0.00011063526,0.000058546633,0.00009279884,0.98445576,0.0006905157,0.014461748],"study_design_scores_gemma":[0.00015686388,0.0000323397,0.000616307,0.000060246824,0.0000054033344,0.000008757539,0.00007676786,0.010563459,0.00064948946,0.9858863,0.0018319893,0.000112086964],"about_ca_topic_score_codex":0.0000014090093,"about_ca_topic_score_gemma":0.0000014233167,"teacher_disagreement_score":0.7103429,"about_ca_system_score_codex":0.000021303884,"about_ca_system_score_gemma":0.000043067997,"threshold_uncertainty_score":0.34602836},"labels":[],"label_agreement":null},{"id":"W4413838596","doi":"10.24908/iqurcp19826","title":"The Lattice property of biclosed sets for infinite root systems","year":2025,"lang":"en","type":"article","venue":"Inquiry Queen s Undergraduate Research Conference Proceedings","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Root (linguistics); Property (philosophy); Lattice (music); Mathematics; Pure mathematics; Physics; Philosophy; Epistemology; Linguistics","score_opus":0.10707645897624034,"score_gpt":0.38253733267791334,"score_spread":0.275460873701673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413838596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052625917,0.0014101774,0.7822108,0.12841107,0.001793987,0.0067428434,0.0000187733,0.0007079306,0.026078453],"genre_scores_gemma":[0.9921471,0.00032078073,0.0030316142,0.00008287005,0.00007402812,0.0005262698,0.0000024461688,0.000016825097,0.0037980827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965802,0.00014910586,0.00061417476,0.0007213284,0.00094530487,0.0009898795],"domain_scores_gemma":[0.99407053,0.0014909516,0.0002229267,0.0005391239,0.0035148568,0.00016160209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029954365,0.00025631106,0.00037843327,0.0003991902,0.0008640604,0.0009492596,0.0024757192,0.00014368857,9.618661e-7],"category_scores_gemma":[0.0014973813,0.00014863216,0.00010272599,0.0017701485,0.0008291684,0.00088710454,0.00080737384,0.0005541854,0.000016010263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079769554,0.00006182437,0.0005822333,0.0003846769,0.00006056446,0.0000018615623,0.0007966956,0.000013730907,0.0017383448,0.9757224,0.0041514216,0.01640653],"study_design_scores_gemma":[0.0011036971,0.0006109284,0.0006919429,0.000676706,0.000018363517,0.000008197371,0.0019028126,0.06639759,0.006439239,0.86066693,0.061080694,0.00040291768],"about_ca_topic_score_codex":0.00012591683,"about_ca_topic_score_gemma":0.000016219594,"teacher_disagreement_score":0.9395212,"about_ca_system_score_codex":0.00013627198,"about_ca_system_score_gemma":0.0008386395,"threshold_uncertainty_score":0.91537327},"labels":[],"label_agreement":null},{"id":"W4413847441","doi":"10.4310/cntp.250829232403","title":"The enumerative geometry and arithmetic of banana nano-manifolds","year":2025,"lang":"en","type":"article","venue":"Communications in Number Theory and Physics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of British Columbia","funders":"","keywords":"Mathematics; Geometry; Arithmetic","score_opus":0.01346813379888296,"score_gpt":0.29630502890143445,"score_spread":0.2828368951025515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413847441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07235715,0.014688936,0.837347,0.0028045208,0.00023127806,0.00050922204,0.000033962333,0.000085011336,0.07194297],"genre_scores_gemma":[0.9898223,0.0011166417,0.008579866,0.00015723004,0.000004798272,0.000021006275,0.0000029174325,0.0000021928126,0.00029301216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993289,0.00029401993,0.00013528859,0.00011310251,0.000042051197,0.00008664542],"domain_scores_gemma":[0.99681604,0.0021136554,0.000054206634,0.0009612272,0.000039927105,0.000014964317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037708067,0.00006542511,0.00009905089,0.000018981373,0.0003061185,0.000041145755,0.00076543464,0.00002550172,0.0000030027],"category_scores_gemma":[0.000079662525,0.000049342227,0.000018129847,0.0004507206,0.00036852015,0.00015447073,0.00061531796,0.00013215156,0.0000017043251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027465246,0.000031706477,0.00061712065,0.0000059192857,0.000010335089,9.150956e-8,0.0005516605,0.0000053326457,0.00003223956,0.912265,0.000034455374,0.08644341],"study_design_scores_gemma":[0.0001092755,0.000008143634,0.0025507533,0.000034020813,0.000005307409,0.0000012177971,0.00023344097,0.0017114301,0.0003174471,0.99113894,0.0038336213,0.000056379835],"about_ca_topic_score_codex":0.0000050538792,"about_ca_topic_score_gemma":0.00001237104,"teacher_disagreement_score":0.9174652,"about_ca_system_score_codex":0.000008150397,"about_ca_system_score_gemma":0.000023956543,"threshold_uncertainty_score":0.23544471},"labels":[],"label_agreement":null},{"id":"W4413965759","doi":"10.70930/tac/4a69y3pq","title":"A syntactic characterization of weakly Mal'tsev varieties","year":2024,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Characterization (materials science); Computer science; Mathematics; Physics","score_opus":0.006551341502341584,"score_gpt":0.23321796251836854,"score_spread":0.22666662101602697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413965759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038868442,0.00073036825,0.9585618,0.00021846934,0.000045884088,0.00012927194,0.0000073546425,0.00008648512,0.0013519588],"genre_scores_gemma":[0.99809206,0.0001555628,0.0012246835,0.000022152431,0.000028920911,0.00006418825,0.000007997145,0.000004285024,0.00040017822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995241,0.00003544806,0.00015154899,0.00014988547,0.000069417016,0.000069609196],"domain_scores_gemma":[0.9994533,0.00018074043,0.00006007509,0.00023633923,0.000048686376,0.00002086162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020191328,0.00006551184,0.00010373171,0.0000696208,0.00006184989,0.00004004113,0.00018583937,0.000028611035,0.000013732763],"category_scores_gemma":[0.000012589337,0.000054764052,0.000023130438,0.0002968504,0.00016381938,0.00036453383,0.00006457342,0.000047437796,0.0000058557025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000644148,0.00001547965,0.000015462774,0.00009702428,0.00001018456,2.2632666e-7,0.00064243743,0.0000026172845,0.029980682,0.9383566,0.000002177225,0.030870715],"study_design_scores_gemma":[0.000026998481,0.000032159816,0.000804146,0.0000138504065,0.000013898287,0.0000074276395,0.00015166473,0.00026804922,0.040509854,0.9534343,0.004669211,0.00006848204],"about_ca_topic_score_codex":0.0000013950258,"about_ca_topic_score_gemma":1.8154077e-7,"teacher_disagreement_score":0.95922357,"about_ca_system_score_codex":0.0000038704334,"about_ca_system_score_gemma":0.00003075968,"threshold_uncertainty_score":0.22332132},"labels":[],"label_agreement":null},{"id":"W4413965778","doi":"10.70930/tac/lcrdpe95","title":"Categorical-Algebraic Properties of Lattice-ordered Groups","year":2023,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Categorical variable; Lattice (music); Mathematics; Algebraic number; Pure mathematics; Combinatorics; Statistics; Physics; Mathematical analysis","score_opus":0.016797602216730947,"score_gpt":0.2416123855211108,"score_spread":0.22481478330437987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413965778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24790314,0.0017412512,0.7469099,0.00048815188,0.00005454343,0.00042203628,0.000005150763,0.000320142,0.002155685],"genre_scores_gemma":[0.99822015,0.00016575365,0.0009959418,0.00003227454,0.000026327505,0.00012718396,0.0000047225817,0.0000065935765,0.0004210849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992209,0.00006285335,0.00023438655,0.0002102625,0.00011892858,0.00015266758],"domain_scores_gemma":[0.9991303,0.00018738434,0.00011771271,0.00042899876,0.000092623,0.000042948635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034937417,0.00009987969,0.00018616121,0.00010991704,0.00012885376,0.000019832944,0.00044068194,0.000041045427,0.0000061515643],"category_scores_gemma":[0.000045104287,0.000077720906,0.000034813813,0.00078530057,0.00033867816,0.0002406939,0.00018137507,0.0000630027,0.000019024359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012219161,0.000030857846,0.000048841008,0.0000711189,0.000011509834,3.1641622e-7,0.00091564766,0.000030251966,0.0047504124,0.9786472,0.000017905792,0.015463764],"study_design_scores_gemma":[0.000114109054,0.000039286904,0.00044373862,0.0000059967456,0.000009958524,0.0000039831684,0.00065578474,0.00024659853,0.032195453,0.9652896,0.0008966609,0.0000988082],"about_ca_topic_score_codex":0.000005243096,"about_ca_topic_score_gemma":0.000001038005,"teacher_disagreement_score":0.750317,"about_ca_system_score_codex":0.0000045066404,"about_ca_system_score_gemma":0.00003358555,"threshold_uncertainty_score":0.31693667},"labels":[],"label_agreement":null},{"id":"W4413965789","doi":"10.70930/tac/hpwt711g","title":"Categories which are varieties of classical or ordered algebras","year":2025,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.009621424417508198,"score_gpt":0.2578848875257709,"score_spread":0.2482634631082627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413965789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01214707,0.0013457225,0.9803158,0.001013837,0.000060191247,0.00025864664,0.00000872073,0.0000996482,0.00475037],"genre_scores_gemma":[0.99425936,0.00016638891,0.0037561592,0.00008920989,0.0000230303,0.00012769572,0.0000052078867,0.000004922554,0.0015680045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909127,0.000083541854,0.00029939623,0.000261201,0.00011447813,0.00015009298],"domain_scores_gemma":[0.9984318,0.0005611476,0.00017375639,0.0005372843,0.00025737897,0.000038633527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819402,0.00013427503,0.00028041203,0.00010849807,0.00018892954,0.000038216673,0.0005473089,0.00007602153,0.000017739365],"category_scores_gemma":[0.00012994005,0.00010120686,0.000034208282,0.0008823296,0.0005544236,0.00024983962,0.0002231008,0.000101428224,0.0000025997647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006521244,0.00006775819,0.00021392679,0.00009865346,0.00002745314,2.6523608e-7,0.0004968809,0.000017766364,0.00036941818,0.98185945,0.00009705987,0.016686158],"study_design_scores_gemma":[0.000174141,0.000049128113,0.00127116,0.000012567948,0.0000221306,0.0000028729003,0.0013125346,0.000070648806,0.014361854,0.9769107,0.0057050246,0.00010720548],"about_ca_topic_score_codex":0.0000061821406,"about_ca_topic_score_gemma":0.000018265848,"teacher_disagreement_score":0.9821123,"about_ca_system_score_codex":0.000007520702,"about_ca_system_score_gemma":0.00014008355,"threshold_uncertainty_score":0.4127096},"labels":[],"label_agreement":null},{"id":"W4413965834","doi":"10.70930/tac/ugrides5","title":"Categorical aspects of congruence distributivity","year":2024,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centro de Matemática, Universidade de Coimbra; Fundação para a Ciência e a Tecnologia; Ministério da Ciência, Tecnologia e Ensino Superior; Universidade de Coimbra","keywords":"Distributivity; Congruence (geometry); Categorical variable; Mathematics; Pure mathematics; Statistics; Distributive property; Geometry","score_opus":0.007729936963129655,"score_gpt":0.25478488760490264,"score_spread":0.247054950641773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413965834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010369937,0.0020943037,0.982678,0.00017789952,0.00003997691,0.00011468445,0.000012130969,0.000085114625,0.0044279844],"genre_scores_gemma":[0.99895245,0.00007448362,0.000800685,0.000011298932,0.000023741792,0.000039618106,0.000004388941,0.0000028110294,0.00009052735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994417,0.000040823263,0.00014840646,0.00019061484,0.00008314897,0.00009533996],"domain_scores_gemma":[0.99917775,0.00039884038,0.00004611526,0.0002849886,0.000055527285,0.000036765014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026645238,0.0000715664,0.00012782436,0.0000421444,0.00006224279,0.000027638132,0.00029016167,0.000029691046,0.000007666885],"category_scores_gemma":[0.000030224284,0.000057204525,0.0000292707,0.00038431404,0.00033746104,0.00023574363,0.00010088601,0.000067471316,0.0000053338927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003982361,0.00002242022,0.000025719051,0.000053295025,0.000007852875,0.0000010478343,0.00017140256,0.0000060952316,0.0013178925,0.9647071,0.000010593649,0.03367261],"study_design_scores_gemma":[0.000031961936,0.000028514303,0.0003757276,0.0000054849925,0.000008073099,0.000010307908,0.000070161994,0.00016913237,0.027747449,0.9687435,0.0027477741,0.00006191843],"about_ca_topic_score_codex":0.0000055382397,"about_ca_topic_score_gemma":8.013984e-7,"teacher_disagreement_score":0.9885825,"about_ca_system_score_codex":0.0000072017333,"about_ca_system_score_gemma":0.000052139774,"threshold_uncertainty_score":0.23327328},"labels":[],"label_agreement":null},{"id":"W4413965960","doi":"10.70930/tac/3g5tvlro","title":"Colimits of representable algebra-valued functors","year":2008,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Functor; Mathematics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.014413452161847588,"score_gpt":0.2444595555039284,"score_spread":0.2300461033420808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413965960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.154187,0.0009360951,0.83758456,0.000058953916,0.000026927335,0.00020745279,0.0000042315223,0.00006249425,0.0069322935],"genre_scores_gemma":[0.99366164,0.00011528896,0.0054342137,0.00003495726,0.000021176187,0.000053958385,0.0000030039973,0.0000037421485,0.000672016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993813,0.000049687125,0.00018721128,0.000177641,0.00010008423,0.00010405402],"domain_scores_gemma":[0.999115,0.00019044102,0.00011682601,0.000454643,0.000083209794,0.00003987633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020049463,0.000073776144,0.00015352434,0.000052489628,0.00014063221,0.0000065158083,0.00033579476,0.000030141917,0.000014065516],"category_scores_gemma":[0.000031187392,0.00006275653,0.000030108533,0.00032123041,0.00038161807,0.0002214753,0.00011729896,0.00004377197,0.000004591441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014159107,0.000039862232,0.0004233529,0.000015148824,0.00000893085,3.2736136e-7,0.0004897543,0.000025914982,0.0015276767,0.9937586,0.000064848966,0.0036313822],"study_design_scores_gemma":[0.000154169,0.00004780564,0.0026847566,0.000003578774,0.000008184501,0.000014909475,0.00023273888,0.00006462469,0.061509103,0.93314576,0.002043737,0.00009061517],"about_ca_topic_score_codex":0.000006568879,"about_ca_topic_score_gemma":3.663363e-7,"teacher_disagreement_score":0.8394747,"about_ca_system_score_codex":0.0000034751924,"about_ca_system_score_gemma":0.000033631015,"threshold_uncertainty_score":0.2559137},"labels":[],"label_agreement":null},{"id":"W4413966048","doi":"10.70930/tac/xzph5s23","title":"The category of L-algebras","year":2023,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mathematics","score_opus":0.009666653877642425,"score_gpt":0.2504604461145131,"score_spread":0.2407937922368707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060084336,0.002175215,0.9289794,0.0008025876,0.00007572265,0.0003332641,0.000005682535,0.00022018047,0.0073236288],"genre_scores_gemma":[0.9985276,0.00031210322,0.00044257913,0.000022802718,0.00001977835,0.00008098197,0.0000023740201,0.0000033229587,0.000588466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999486,0.00004948535,0.00015604972,0.00011984538,0.0000816152,0.000106970976],"domain_scores_gemma":[0.99880564,0.00061122986,0.00008961556,0.00040985705,0.000059443555,0.000024240664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004977534,0.000057436577,0.00009041729,0.000045150446,0.00021051717,0.000017373548,0.00046636886,0.000022224325,0.0000026250295],"category_scores_gemma":[0.000035311466,0.000037878406,0.000025078001,0.0004985576,0.00039165423,0.0001186883,0.00014165547,0.00004376613,0.000013011296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005115058,0.0000072679854,0.00003927715,0.000011506015,0.0000061144287,1.0116045e-7,0.00032612003,0.000011732512,0.0006986595,0.94941455,0.00005721824,0.04942232],"study_design_scores_gemma":[0.00004658901,0.000018118195,0.0010950434,0.000001561701,0.000003826827,0.0000016021924,0.0005339426,0.00006614097,0.010990313,0.9812938,0.0059047197,0.000044374734],"about_ca_topic_score_codex":0.0000024850642,"about_ca_topic_score_gemma":0.0000010821927,"teacher_disagreement_score":0.93844324,"about_ca_system_score_codex":0.0000020818309,"about_ca_system_score_gemma":0.000024928917,"threshold_uncertainty_score":0.16191491},"labels":[],"label_agreement":null},{"id":"W4413966075","doi":"10.70930/tac/my3fx2hq","title":"Partial linearity and partial natural Mal'tsevness","year":2016,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linearity; Natural (archaeology); Mathematics; Computer science; Geography; Physics; Archaeology","score_opus":0.008483357857775285,"score_gpt":0.24800802416511258,"score_spread":0.2395246663073373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14589743,0.0006091982,0.85241896,0.00052581,0.000057671725,0.00012619061,0.0000040363534,0.00006400838,0.0002967054],"genre_scores_gemma":[0.99796796,0.00006792724,0.0015400086,0.000049240378,0.000080957034,0.00005757978,0.0000011765717,0.0000029025186,0.00023223659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944097,0.000050928007,0.00012599298,0.00019936355,0.000064498374,0.00011823221],"domain_scores_gemma":[0.9993498,0.00023813844,0.00005915685,0.0002608845,0.000044646407,0.00004741513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023228512,0.000076959754,0.00010652242,0.000025053552,0.00013678295,0.000034975685,0.0002101572,0.000031639844,0.000008026464],"category_scores_gemma":[0.000030462857,0.000048965536,0.000016964983,0.00010496661,0.00036998244,0.00036906,0.00013327098,0.000044880802,0.0000050518333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013806469,0.000014231872,0.00017110494,0.00000732008,0.00000414603,2.2141961e-7,0.0001273892,6.6430755e-7,0.002002845,0.89760053,0.0000050427548,0.100052714],"study_design_scores_gemma":[0.000200071,0.000029431492,0.001463528,0.0000054769293,0.000008477135,0.000010064898,0.00008091909,0.00013034242,0.04520538,0.94629294,0.006452271,0.00012112666],"about_ca_topic_score_codex":0.0000017352843,"about_ca_topic_score_gemma":6.2239053e-7,"teacher_disagreement_score":0.85207057,"about_ca_system_score_codex":0.000003072737,"about_ca_system_score_gemma":0.000016468875,"threshold_uncertainty_score":0.19967566},"labels":[],"label_agreement":null},{"id":"W4413966114","doi":"10.70930/tac/kd8tfhlc","title":"-modules are -suplattices","year":2007,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.00932382961107256,"score_gpt":0.25650270356039456,"score_spread":0.247178873949322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04347154,0.00090766523,0.95130473,0.000104027116,0.000018622928,0.000085105916,0.0000014811362,0.00006509624,0.0040417286],"genre_scores_gemma":[0.990431,0.00004170099,0.00921045,0.000066194865,0.00003756225,0.000018141567,0.0000012707972,0.0000025185109,0.0001911681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956393,0.000017254843,0.0001185232,0.00013741576,0.00006115279,0.00010172324],"domain_scores_gemma":[0.9992934,0.00026889943,0.00008485929,0.00027203196,0.00004467273,0.000036159472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040317085,0.00005899578,0.00008403651,0.00004510603,0.00011713863,0.000020209278,0.00028106497,0.000025252977,0.000005348649],"category_scores_gemma":[0.000016901044,0.00004848967,0.000016048458,0.00018445852,0.00018125746,0.00021684573,0.000071808376,0.00004046637,0.000006765223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000596646,0.00001640913,0.0002295285,0.000010808536,0.0000035468443,3.2196957e-7,0.00021447515,0.000004947309,0.00038373767,0.93313795,0.0000061583164,0.06598618],"study_design_scores_gemma":[0.00005436731,0.000014208529,0.0043392796,0.0000028156635,0.000003983676,0.0000047194226,0.00055851514,0.000018667419,0.013450095,0.9764811,0.0050062677,0.00006600984],"about_ca_topic_score_codex":0.0000011393647,"about_ca_topic_score_gemma":0.000002281011,"teacher_disagreement_score":0.94695944,"about_ca_system_score_codex":0.0000027606077,"about_ca_system_score_gemma":0.0000062516524,"threshold_uncertainty_score":0.19773513},"labels":[],"label_agreement":null},{"id":"W4413966121","doi":"10.70930/tac/et85mnq7","title":"Coequalizers and free triples, II","year":2019,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mathematics","score_opus":0.007275075951022698,"score_gpt":0.23464717420023337,"score_spread":0.22737209824921067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15395816,0.0022160618,0.8331833,0.00040342112,0.000039060284,0.00033329873,0.000007839386,0.000090975955,0.009767894],"genre_scores_gemma":[0.9952564,0.00011017944,0.0035359168,0.000089467016,0.000014301375,0.000035658184,0.0000022359727,0.0000028437478,0.00095295004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957293,0.00003011494,0.00010243028,0.00015927338,0.00005527546,0.00007999211],"domain_scores_gemma":[0.9993166,0.00016691831,0.000055045228,0.00040107785,0.000027504711,0.000032853033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021609422,0.000061284234,0.0001032718,0.000034317047,0.00011841396,0.000018904342,0.000294827,0.000025332805,0.000012955725],"category_scores_gemma":[0.000016063274,0.000050738043,0.000012961826,0.00013643736,0.00015922148,0.00019052107,0.00020708053,0.0000392896,0.000005115459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075408484,0.000011788177,0.00009424797,0.000014421111,0.0000042408874,5.4146863e-8,0.00042958194,0.0000035311987,0.0007007186,0.9783526,0.000029180208,0.02035211],"study_design_scores_gemma":[0.0001908682,0.000047249257,0.0003247562,0.0000024757774,0.000004072568,0.000003736579,0.00030899013,0.000045231853,0.002906095,0.9833083,0.012788169,0.000070055525],"about_ca_topic_score_codex":0.0000022831666,"about_ca_topic_score_gemma":5.77745e-7,"teacher_disagreement_score":0.8412983,"about_ca_system_score_codex":0.0000023444366,"about_ca_system_score_gemma":0.000013182862,"threshold_uncertainty_score":0.20690374},"labels":[],"label_agreement":null},{"id":"W4413966128","doi":"10.70930/tac/dt9mik71","title":"Nearly locally presentable categories","year":2018,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israel Science Foundation; Grantová Agentura České Republiky","keywords":"Computer science; Mathematics","score_opus":0.008508780536328397,"score_gpt":0.2487255233343698,"score_spread":0.24021674279804142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121052135,0.0006265948,0.97419035,0.00020286858,0.000046594643,0.00018484952,0.0000028542877,0.00010880321,0.012531869],"genre_scores_gemma":[0.9919307,0.00004620796,0.0063796653,0.00010477245,0.00011881328,0.000086559696,0.0000031251882,0.0000056522854,0.0013244816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992956,0.000048506994,0.0001631157,0.00023024598,0.00009965648,0.00016287797],"domain_scores_gemma":[0.9990726,0.00016211244,0.000079306956,0.00048399027,0.00014552518,0.000056427776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026796944,0.00009759502,0.00012866895,0.000049556067,0.00026204484,0.00006548299,0.00048785578,0.000038654944,0.000027127959],"category_scores_gemma":[0.000024206209,0.00008142797,0.000022392589,0.00033039498,0.0007279483,0.00044876256,0.00017856417,0.000057853606,0.00003452706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014892497,0.000024479346,0.000088452885,0.0000114626,0.000007932097,1.9408274e-7,0.00064861483,0.00000424306,0.000592729,0.97062784,0.0000835639,0.027895616],"study_design_scores_gemma":[0.00009828358,0.00008228446,0.0003935556,0.0000025886313,0.0000066725547,0.0000068211853,0.00031898095,0.00009564848,0.026677513,0.9550706,0.017145569,0.00010147465],"about_ca_topic_score_codex":0.000013265455,"about_ca_topic_score_gemma":0.0000050495787,"teacher_disagreement_score":0.9798255,"about_ca_system_score_codex":0.00000512397,"about_ca_system_score_gemma":0.000043744603,"threshold_uncertainty_score":0.33205363},"labels":[],"label_agreement":null},{"id":"W4413966131","doi":"10.70930/tac/6vubmnkc","title":"Groupoids in categories with pretopology","year":2015,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mathematics","score_opus":0.010992750839266346,"score_gpt":0.24677318440993545,"score_spread":0.2357804335706691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069843665,0.00087792496,0.923004,0.00028585942,0.00002321517,0.00019745354,0.0000013940079,0.00006577613,0.0057007624],"genre_scores_gemma":[0.9944926,0.000026837579,0.005080119,0.000053647236,0.000020539903,0.00012262134,0.0000030474148,0.000003861467,0.00019675915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994277,0.000059148922,0.00013222618,0.00018267268,0.00007247499,0.00012580692],"domain_scores_gemma":[0.9993806,0.00012871077,0.00006118307,0.00031044453,0.000066018205,0.000053044194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031551623,0.000082329534,0.00013624603,0.000069878835,0.000052724474,0.0000182979,0.00030043186,0.00003569618,0.0000027069796],"category_scores_gemma":[0.00001938397,0.00006182243,0.0000091754555,0.00033138736,0.00040740048,0.0002861644,0.000085318636,0.000065746324,0.000003689729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030770603,0.000027330227,0.0010593914,0.000008643038,0.0000036213828,8.381351e-7,0.0014528367,0.000047850972,0.00004724788,0.9891914,0.0000074083146,0.008122642],"study_design_scores_gemma":[0.00022080583,0.00010057593,0.0008349075,0.0000023292246,0.0000036415702,0.00001572157,0.001347571,0.00003919333,0.0020856329,0.99332297,0.0019406804,0.000085985026],"about_ca_topic_score_codex":0.000016038157,"about_ca_topic_score_gemma":0.000018426132,"teacher_disagreement_score":0.9246489,"about_ca_system_score_codex":0.0000088195175,"about_ca_system_score_gemma":0.00005467656,"threshold_uncertainty_score":0.25210455},"labels":[],"label_agreement":null},{"id":"W4413966139","doi":"10.70930/tac/nsowlnwy","title":"A note on the categorical congruence distributivity","year":2019,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Distributivity; Congruence (geometry); Categorical variable; Mathematics; Computer science; Pure mathematics; Statistics; Distributive property; Geometry","score_opus":0.0077001634637289896,"score_gpt":0.24447156624623345,"score_spread":0.23677140278250447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05367656,0.00015189603,0.9401367,0.0012031706,0.00003724654,0.00030383866,0.000006610566,0.000054727392,0.004429266],"genre_scores_gemma":[0.9991221,0.000021361295,0.0003028354,0.00017257441,0.000018787026,0.000075233045,0.0000025820896,0.00000252257,0.00028199377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994142,0.00007530156,0.000106695945,0.00019300425,0.00009608876,0.00011471209],"domain_scores_gemma":[0.99847203,0.0008677544,0.000067879264,0.0005138279,0.000046762263,0.000031740023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035786294,0.00007933548,0.00010575783,0.00001908315,0.0001396678,0.00003063523,0.00046415924,0.000028698732,0.000018693387],"category_scores_gemma":[0.000043451557,0.000048789185,0.000025224295,0.00023262922,0.000233489,0.00014202652,0.000110276946,0.00009644734,0.00005002372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103652965,0.000024307286,0.00009608905,0.000005786989,0.0000030055587,1.549362e-7,0.0001279941,0.000013970176,0.00046810563,0.98666227,0.000016585933,0.012571391],"study_design_scores_gemma":[0.00006519229,0.000044845467,0.0010958343,0.000002053864,0.0000033051701,0.0000038239773,0.000092510076,0.00015232788,0.007962712,0.98467773,0.0058263293,0.00007336258],"about_ca_topic_score_codex":0.000003328185,"about_ca_topic_score_gemma":5.304986e-7,"teacher_disagreement_score":0.94544554,"about_ca_system_score_codex":0.000007931869,"about_ca_system_score_gemma":0.000025279076,"threshold_uncertainty_score":0.19895652},"labels":[],"label_agreement":null},{"id":"W4413966177","doi":"10.70930/tac/5bdk760i","title":"Lax distributive laws for topology, II","year":2017,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"York University","funders":"Sichuan University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; York University","keywords":"Distributive property; Topology (electrical circuits); Computer science; Mathematics; Pure mathematics; Combinatorics","score_opus":0.012585599839672374,"score_gpt":0.2873239014351571,"score_spread":0.27473830159548474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074264295,0.00021912677,0.98772925,0.00077801454,0.000031821175,0.00020967113,0.000026775706,0.000032792246,0.0035461122],"genre_scores_gemma":[0.99435246,0.000026254716,0.0047453973,0.000036033136,0.000042313804,0.00018471181,0.000007058883,0.0000021202432,0.0006036721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963427,0.000015097127,0.000084203486,0.00014390654,0.000029223347,0.00009329706],"domain_scores_gemma":[0.9991526,0.00016650055,0.000105998915,0.0004888085,0.00005983536,0.000026243235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020339241,0.000055534965,0.000095484276,0.000013751066,0.00082094624,0.00003551429,0.0005116063,0.000028947165,0.0000033868216],"category_scores_gemma":[0.000058630238,0.000045552264,0.000023302462,0.000030160872,0.0004635702,0.00021891107,0.00020406603,0.000031332416,0.0000016209158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001002269,0.000016469161,0.000055561246,0.0000069468906,0.000005232228,5.1761745e-8,0.00015920379,8.20044e-7,0.00022522606,0.96844506,0.000033372737,0.031042008],"study_design_scores_gemma":[0.000111808564,0.000046642992,0.00078191375,0.0000013974407,0.0000055334526,0.0000016781432,0.00011764792,0.000029905208,0.0085579045,0.9706892,0.019600691,0.00005568133],"about_ca_topic_score_codex":0.0000030414158,"about_ca_topic_score_gemma":0.0000022984073,"teacher_disagreement_score":0.986926,"about_ca_system_score_codex":0.0000033538424,"about_ca_system_score_gemma":0.000015067516,"threshold_uncertainty_score":0.6314138},"labels":[],"label_agreement":null},{"id":"W4413966266","doi":"10.70930/tac/c16x3xtf","title":"Category-theoretic models of Linear Abadi &amp; Plotkin Logic","year":2008,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear logic; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.02317091671588067,"score_gpt":0.25616876484467105,"score_spread":0.23299784812879037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044599663,0.0010144336,0.949477,0.00009559964,0.000017924143,0.00019474837,0.0000056237586,0.00007910442,0.0045158947],"genre_scores_gemma":[0.98324925,0.00035556842,0.01583849,0.00006966858,0.000028572604,0.00007263883,0.000006891357,0.0000075430917,0.0003713923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913424,0.000075431475,0.00027127503,0.00024229042,0.00012343733,0.00015333877],"domain_scores_gemma":[0.99882764,0.00026231326,0.00015698416,0.0005740379,0.00012218884,0.0000568523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029537868,0.00012383952,0.00022303863,0.00008311625,0.00019077533,0.000007490655,0.0005089669,0.000055768378,0.000013246188],"category_scores_gemma":[0.00002539054,0.00010250237,0.000048113685,0.00033032635,0.0007923196,0.00027419705,0.00012984399,0.0000845977,0.00001105365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001600684,0.00006061651,0.000027797545,0.00003043842,0.0000089715195,4.6745123e-7,0.0011832931,0.000749446,0.00083037553,0.9943549,0.000012068723,0.0027256378],"study_design_scores_gemma":[0.00012367759,0.000043208012,0.000072759794,0.000003878992,0.000009389408,0.000024527659,0.00012032274,0.0006614296,0.008411315,0.9896889,0.00072790263,0.00011272213],"about_ca_topic_score_codex":0.0000071720237,"about_ca_topic_score_gemma":0.0000010354662,"teacher_disagreement_score":0.9386496,"about_ca_system_score_codex":0.000005710813,"about_ca_system_score_gemma":0.000046558354,"threshold_uncertainty_score":0.41799253},"labels":[],"label_agreement":null},{"id":"W4413972871","doi":"10.70930/tac/1b18bqig","title":"The *-autonomous category of uniform sup semi-lattices","year":2012,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Computer science; Pure mathematics","score_opus":0.00981165245152533,"score_gpt":0.2467021762497245,"score_spread":0.23689052379819917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413972871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066786714,0.007555303,0.9109652,0.0003385596,0.000071616014,0.00032809228,0.000006200391,0.00008685119,0.013861454],"genre_scores_gemma":[0.9980096,0.00020283597,0.0012782211,0.0000329411,0.000044188015,0.00006204441,0.0000021129486,0.000003872903,0.00036416604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940604,0.000051592557,0.00019213257,0.00010405567,0.00008082353,0.00016533576],"domain_scores_gemma":[0.9987734,0.0005354379,0.00014312287,0.0004366171,0.0000636393,0.000047760375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058835244,0.0000797235,0.00011409662,0.000032215212,0.00023423882,0.000021320955,0.00047263736,0.000031657848,0.000005139108],"category_scores_gemma":[0.000022124741,0.00005200114,0.000027765009,0.00020420516,0.0004365185,0.0003684963,0.00012788661,0.00005972869,0.0000057007683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006639816,0.000027333046,0.00019320128,0.000016164016,0.00000928397,2.5314751e-8,0.00090163463,0.000017151968,0.0002516102,0.96296096,0.000011617637,0.03560439],"study_design_scores_gemma":[0.00007011986,0.000026623567,0.0009045533,0.0000023970856,0.000012681955,0.0000060894477,0.0012164089,0.00012269865,0.0126952855,0.9680861,0.016772669,0.00008433224],"about_ca_topic_score_codex":0.0000051107954,"about_ca_topic_score_gemma":9.5159265e-7,"teacher_disagreement_score":0.9312229,"about_ca_system_score_codex":0.000005458235,"about_ca_system_score_gemma":0.000028629582,"threshold_uncertainty_score":0.2120545},"labels":[],"label_agreement":null},{"id":"W4413972932","doi":"10.70930/tac/hg8zc6yj","title":"Connecting generalized Priestley duality to Hofmann-Mislove-Stralka duality","year":2024,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Duality (order theory); Mathematics; Mathematical economics; Pure mathematics","score_opus":0.016725302764617787,"score_gpt":0.2950997350261663,"score_spread":0.2783744322615485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413972932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07006619,0.0008677793,0.9251677,0.0012864945,0.000080501035,0.00028695303,0.000017533192,0.0002714346,0.0019554049],"genre_scores_gemma":[0.9844927,0.00004486234,0.014472057,0.00018265998,0.000087996435,0.000113952316,0.000008505903,0.000008135324,0.0005891108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899083,0.00010948457,0.0002492678,0.0003624827,0.00011459334,0.0001733408],"domain_scores_gemma":[0.99889594,0.00041055318,0.00005641884,0.00047962225,0.00007148552,0.000086001906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007789092,0.00012476042,0.00017673582,0.000065176,0.00019728654,0.0001323827,0.00036526134,0.000044123222,0.000021895168],"category_scores_gemma":[0.00007367423,0.00009599928,0.00004392717,0.00045055742,0.00012851974,0.00032379982,0.00018747782,0.00009497462,0.000021791573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010731766,0.000018596838,0.000012519582,0.000058969057,0.0000140269185,9.027475e-7,0.0015247433,0.000055255994,0.0020908278,0.946313,0.00004325698,0.04985716],"study_design_scores_gemma":[0.00007076143,0.0000297269,0.0001590733,0.0000118628,0.000011445547,0.0000109872135,0.00039694432,0.0001445942,0.01861134,0.9524979,0.027909815,0.0001455798],"about_ca_topic_score_codex":0.00001222164,"about_ca_topic_score_gemma":0.0000041301673,"teacher_disagreement_score":0.9144265,"about_ca_system_score_codex":0.000012245745,"about_ca_system_score_gemma":0.000041721432,"threshold_uncertainty_score":0.39147374},"labels":[],"label_agreement":null},{"id":"W4413994680","doi":"10.1017/fms.2025.10040","title":"Meta algebras and biorthogonal rational functions: The Hahn case","year":2025,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Biorthogonal system; Mathematics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.028655372219252927,"score_gpt":0.2577038614709113,"score_spread":0.22904848925165835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413994680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012194529,0.0010443631,0.9807669,0.0036045252,0.00032539037,0.0001937312,0.000008762795,0.000049872695,0.001811908],"genre_scores_gemma":[0.8617769,0.000025194477,0.13507222,0.0008250747,0.0000650543,0.000069887035,0.0000035612004,0.000008129218,0.0021539684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992324,0.000028326853,0.00025370816,0.00017134676,0.00017367186,0.00014052587],"domain_scores_gemma":[0.99895585,0.00044856474,0.00010698327,0.0003828591,0.00007654505,0.000029193807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875167,0.000104843806,0.00018348351,0.000070808695,0.0002150627,0.000054746863,0.00028760737,0.00003941782,0.00003250156],"category_scores_gemma":[0.00008697194,0.000063532956,0.00008911335,0.00026112638,0.00010348765,0.00020013438,0.00022190326,0.00008546414,0.000007561668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012296066,0.00006657486,0.000055556786,0.000038364433,0.00017838726,0.000011594456,0.0002187425,0.00008961178,0.000102842605,0.9947911,0.0023893132,0.002056701],"study_design_scores_gemma":[0.00027852968,0.00006699871,0.00011770065,0.000025674912,0.00023925763,0.000453331,0.00070374465,0.032546666,0.00095935975,0.9589412,0.00552051,0.0001470176],"about_ca_topic_score_codex":0.0000037344957,"about_ca_topic_score_gemma":0.000018912719,"teacher_disagreement_score":0.8495824,"about_ca_system_score_codex":0.000007062656,"about_ca_system_score_gemma":0.00004962705,"threshold_uncertainty_score":0.25907987},"labels":[],"label_agreement":null},{"id":"W4414063189","doi":"10.28924/2291-8639-23-2025-219","title":"Generalized \\((f_q, h_q)\\)-Derivations and Their Structural Role in BP-Algebras","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Phayao","keywords":"Endomorphism; Commutative property; Algebraic number; Algebra over a field; Identity (music); Fuzzy logic","score_opus":0.005801676230385604,"score_gpt":0.27111294088976184,"score_spread":0.26531126465937627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414063189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32225522,0.0007160372,0.673586,0.0030241213,0.000045215525,0.000053606447,0.0000050187464,0.000008621471,0.00030614482],"genre_scores_gemma":[0.98779726,0.00024243986,0.011375606,0.00044547624,0.00006002494,0.0000113331635,0.0000053815647,0.0000018590213,0.000060632952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925774,0.000028370689,0.00034916794,0.0001569892,0.000126514,0.00008122291],"domain_scores_gemma":[0.99932617,0.000089781955,0.00018589142,0.00013775645,0.00021475874,0.00004566144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013176088,0.00008184053,0.0001836697,0.0005973309,0.00007954824,0.00013650364,0.0004488588,0.000029115352,0.000010626942],"category_scores_gemma":[0.00001840002,0.00006228114,0.000090874964,0.00076457806,0.000045337514,0.0002986987,0.00011656828,0.00010276283,5.37346e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010689497,0.000052431486,0.03008137,0.0000025264883,0.00064802624,0.0000029018995,0.00035454766,0.0024709569,0.0027107834,0.8771963,0.00004029812,0.08642916],"study_design_scores_gemma":[0.0009592231,0.000037486345,0.2799257,0.000025361243,0.00015682088,0.000047034835,0.00035922692,0.0755506,0.0015430934,0.6324474,0.008731338,0.00021666884],"about_ca_topic_score_codex":0.000023172795,"about_ca_topic_score_gemma":0.000045134188,"teacher_disagreement_score":0.665542,"about_ca_system_score_codex":0.00002933003,"about_ca_system_score_gemma":0.000038260052,"threshold_uncertainty_score":0.25397512},"labels":[],"label_agreement":null},{"id":"W4414180032","doi":"10.4153/s0008439525101203","title":"Green’s relations and left amenable semigroups","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Iran National Science Foundation; National Science Foundation","keywords":"Semigroup; Measure (data warehouse); Countable set; Second-countable space; Zero (linguistics); Amenable group","score_opus":0.00595610978781048,"score_gpt":0.20598344317821835,"score_spread":0.20002733339040787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414180032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013008162,0.00041915238,0.70046806,0.073513374,0.00011938246,0.0003021197,0.0000052025184,0.00018213168,0.21198238],"genre_scores_gemma":[0.86451626,0.000010622092,0.057561014,0.0072507113,0.000034006986,0.000020541922,0.0000026658088,0.000011640663,0.07059251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921536,0.00002488087,0.00015432,0.00023717222,0.00007501284,0.00029327188],"domain_scores_gemma":[0.9991856,0.00017225472,0.000020964613,0.00031376907,0.000028541577,0.0002788703],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001326451,0.000096023,0.00013015074,0.00012511159,0.00018573165,0.00008636539,0.0002998806,0.00006295107,0.0015163061],"category_scores_gemma":[0.00014469695,0.00008756715,0.000027185604,0.0001607823,0.00006732043,0.00006448777,0.000079055055,0.00012638155,0.002146028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.7330822e-7,0.000007430711,0.00011883917,0.000022459062,0.000005511328,0.000015714479,0.00014620234,0.000006587678,0.000010892948,0.98200846,0.015558599,0.0020990213],"study_design_scores_gemma":[0.00012400618,0.0000141619375,0.00066478783,0.00005462054,0.0000066191633,0.000023573708,0.00005156865,0.004231096,0.00003157572,0.7424673,0.25218818,0.00014254931],"about_ca_topic_score_codex":0.00047460783,"about_ca_topic_score_gemma":0.0012711005,"teacher_disagreement_score":0.85150814,"about_ca_system_score_codex":0.00008089397,"about_ca_system_score_gemma":0.00012453846,"threshold_uncertainty_score":0.99939644},"labels":[],"label_agreement":null},{"id":"W4414576892","doi":"","title":"Faithful universal graphs for minor-closed classes","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Agence Nationale de la Recherche; Deutsche Forschungsgemeinschaft","keywords":"Graph; Block graph; Planar graph; Clique-width; Line graph; Countable set; Outerplanar graph; Cograph","score_opus":0.04062308229522311,"score_gpt":0.27990484325920184,"score_spread":0.23928176096397874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414576892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3437539,0.0005047678,0.64532363,0.0014494031,0.002534553,0.000785049,0.000056686305,0.00057705794,0.0050149364],"genre_scores_gemma":[0.9501703,0.000114845905,0.043198574,0.0009469593,0.00018682219,0.00010479395,0.000052351632,0.000019520878,0.0052058767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798906,0.000062229155,0.00029936945,0.0009986715,0.00019227104,0.0004584167],"domain_scores_gemma":[0.9980784,0.00028380644,0.00020821947,0.0011465955,0.00016975937,0.00011323541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013126375,0.00036536617,0.00041470278,0.00023225026,0.00017761174,0.00009810352,0.0019631,0.00030100453,0.000015497702],"category_scores_gemma":[0.000085311614,0.00035026163,0.00031411427,0.000343724,0.00009035443,0.00026756994,0.0015154777,0.0004581252,0.000042182128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009664414,0.00041485697,0.14292762,0.00092399586,0.00048137511,0.00015028068,0.0013397097,0.001972516,0.0010381984,0.798817,0.011528762,0.04030907],"study_design_scores_gemma":[0.003158567,0.00050648773,0.17676899,0.0006535958,0.00026308515,0.000014895884,0.00036831078,0.015052597,0.008475922,0.65333587,0.13840011,0.0030015914],"about_ca_topic_score_codex":0.000029616576,"about_ca_topic_score_gemma":0.000026507716,"teacher_disagreement_score":0.60641634,"about_ca_system_score_codex":0.000085937245,"about_ca_system_score_gemma":0.0003149847,"threshold_uncertainty_score":0.9998949},"labels":[],"label_agreement":null},{"id":"W4414581274","doi":"10.61091/jcmcc127-13","title":"Counting of lattices containing up to four comparable reducible elements and having nullity up to three","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Isomorphism (crystallography); Partially ordered set; Cover (algebra); Class (philosophy); Algebra over a field","score_opus":0.028592245136805163,"score_gpt":0.29708836767136315,"score_spread":0.268496122534558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79408306,0.0002486605,0.19325244,0.0002904195,0.011238597,0.0003591103,0.0000010475311,0.000037002697,0.000489694],"genre_scores_gemma":[0.957232,0.000010491479,0.042328503,0.0000945893,0.00030068058,0.0000027661008,2.4693247e-7,0.000015265829,0.000015439917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690884,0.000099340694,0.0014881853,0.000390523,0.00064599444,0.0004671008],"domain_scores_gemma":[0.9965068,0.00095028436,0.0011162173,0.0003952723,0.00076775765,0.00026363647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026937092,0.0003082077,0.0010069537,0.00036293498,0.00041297148,0.00041041616,0.0008996208,0.00010917061,0.0000022073364],"category_scores_gemma":[0.00085921225,0.00028786575,0.000113743896,0.0006389238,0.00006077928,0.00045577832,0.0009354848,0.0003905269,0.0000012660801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014547697,0.000157939,0.002709288,0.00030871434,0.00012230701,0.000011290412,0.0034806922,0.00024230956,0.0015366309,0.9853476,0.00015991768,0.0057777883],"study_design_scores_gemma":[0.0046638423,0.0013088462,0.0016609837,0.0017992684,0.00010575639,0.00004881581,0.0011733193,0.026343703,0.0026589395,0.958897,0.0008565246,0.00048298514],"about_ca_topic_score_codex":0.000022748529,"about_ca_topic_score_gemma":0.0000026327768,"teacher_disagreement_score":0.16314898,"about_ca_system_score_codex":0.000094737276,"about_ca_system_score_gemma":0.00018415967,"threshold_uncertainty_score":0.9999573},"labels":[],"label_agreement":null},{"id":"W4415033443","doi":"10.48550/arxiv.2505.22603","title":"Oscillating subalgebras of the atomless countable Boolean algebra","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Akademie Věd České Republiky; Grantová Agentura České Republiky; European Commission; National Science Foundation","keywords":"Countable set; Complete Boolean algebra; Stone's representation theorem for Boolean algebras; Boolean algebra; Two-element Boolean algebra; Free Boolean algebra; Boolean algebras canonically defined; Extension (predicate logic)","score_opus":0.03120390919087418,"score_gpt":0.2662707630602782,"score_spread":0.235066853869404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415033443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91377,0.00089585566,0.06979236,0.00088772783,0.0023596152,0.00051321107,0.00002612717,0.00027811897,0.011476934],"genre_scores_gemma":[0.9929843,0.00006568177,0.0037815424,0.00088421884,0.00014389976,0.000031609692,0.0000064083874,0.000018426883,0.002083929],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9972969,0.00015871906,0.0006168329,0.000924115,0.0004919679,0.000511422],"domain_scores_gemma":[0.99664706,0.0002359015,0.00057337567,0.0022447472,0.0002113713,0.000087563414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039966233,0.00040878484,0.0005635208,0.000116389834,0.00028634508,0.00010076129,0.0033974354,0.0002916405,0.00003392083],"category_scores_gemma":[0.0001630572,0.000308395,0.00030876455,0.0006499997,0.00017361993,0.00025925817,0.0049423305,0.00086738495,0.00004114996],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010575743,0.00013055188,0.7067524,0.0005915142,0.00016027932,0.000017656213,0.0012573936,0.0038240245,0.0010730698,0.27740636,0.0010424267,0.007733721],"study_design_scores_gemma":[0.0013340093,0.00012632526,0.6101036,0.0025830166,0.00020722204,0.000031246058,0.00029941896,0.021038521,0.04930431,0.29592684,0.016597824,0.0024476808],"about_ca_topic_score_codex":0.00011712973,"about_ca_topic_score_gemma":0.000036467267,"teacher_disagreement_score":0.096648835,"about_ca_system_score_codex":0.00012232429,"about_ca_system_score_gemma":0.00046936248,"threshold_uncertainty_score":0.9999368},"labels":[],"label_agreement":null},{"id":"W4415649730","doi":"10.4153/s0008439525101409","title":"Not every complete lattice can support a unital quantale","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Unital; Lattice (music); Complete lattice; Algebra over a field; Subclass","score_opus":0.020591811481869875,"score_gpt":0.24033349953982308,"score_spread":0.21974168805795322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415649730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075478315,0.000104469065,0.50755715,0.117556855,0.00080757565,0.00096475874,0.00014022435,0.0005753768,0.29681528],"genre_scores_gemma":[0.95026314,0.0000023807977,0.023170225,0.014789989,0.000039178023,0.000030294204,0.000011220571,0.0000144680225,0.011679103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854094,0.000054166525,0.0002839722,0.00036508904,0.00018139622,0.00057445886],"domain_scores_gemma":[0.9985168,0.00031050795,0.000042195123,0.00058034493,0.00006271914,0.00048745773],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021598868,0.00017999021,0.00025750566,0.00018494183,0.00020512828,0.00012172124,0.00084116694,0.00008415322,0.0023355572],"category_scores_gemma":[0.00024885574,0.00016964266,0.00007887823,0.00036685413,0.000120513236,0.0000626338,0.00014178753,0.00020782089,0.0056898473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002172362,0.000027737233,0.000044674416,0.000053492564,0.00001495147,0.00016741795,0.0001783808,0.000006004703,0.000048280846,0.98151153,0.01656739,0.0013779824],"study_design_scores_gemma":[0.0007082955,0.00013330785,0.001976162,0.00016361142,0.000035678244,0.00016596242,0.00025297428,0.0055931946,0.00038760013,0.37296376,0.6168394,0.00078004337],"about_ca_topic_score_codex":0.000668362,"about_ca_topic_score_gemma":0.0018479902,"teacher_disagreement_score":0.8747848,"about_ca_system_score_codex":0.00016497046,"about_ca_system_score_gemma":0.00046210276,"threshold_uncertainty_score":0.99857646},"labels":[],"label_agreement":null},{"id":"W4416187213","doi":"10.28924/2291-8639-23-2025-295","title":"Birkhoff Centre of Paradistributive Latticiods","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Thailand Science Research and Innovation; University of Phayao","keywords":"Bijection; Distributive property; Element (criminal law); Associative property; Algebra over a field; Decomposition","score_opus":0.00639517789547511,"score_gpt":0.29568602119586523,"score_spread":0.2892908433003901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416187213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015344907,0.0020827665,0.9759932,0.0050552473,0.00019776319,0.000094058465,0.00007944428,0.0000047635926,0.0011478041],"genre_scores_gemma":[0.9923721,0.0012630511,0.005645072,0.00019942937,0.00013639439,0.000003466595,0.000010691754,0.000002725018,0.0003670564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981694,0.000066785695,0.0009509793,0.00024691888,0.00042168595,0.00014421211],"domain_scores_gemma":[0.99686396,0.00024093842,0.0010310148,0.00026169664,0.0015011247,0.00010125602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140968,0.00014576316,0.0004588541,0.00080294954,0.00009960897,0.00012404872,0.001011793,0.000067856374,0.000068155234],"category_scores_gemma":[0.000059166265,0.00012723461,0.00043523827,0.001805091,0.00018482174,0.0002733825,0.00020768403,0.0001941223,0.0000031292448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045015968,0.0006079146,0.031046811,0.000020766682,0.007934308,0.000013247997,0.00037145443,0.002830112,0.00054492586,0.7395786,0.00029501406,0.21671182],"study_design_scores_gemma":[0.004035423,0.00038468555,0.3146667,0.0006348602,0.012751274,0.00011228231,0.0018575572,0.1323861,0.01459612,0.3767255,0.14080682,0.0010426786],"about_ca_topic_score_codex":0.000015636435,"about_ca_topic_score_gemma":0.000011942665,"teacher_disagreement_score":0.9770272,"about_ca_system_score_codex":0.00007046462,"about_ca_system_score_gemma":0.00017571289,"threshold_uncertainty_score":0.5188477},"labels":[],"label_agreement":null},{"id":"W4416966254","doi":"10.1007/s00009-025-03021-y","title":"Ordered Structures with No Finite Monomorphic Decomposition: Application to the Profile of Hereditary Classes","year":2025,"lang":"en","type":"article","venue":"Mediterranean Journal of Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Partition (number theory); Bounded function; Class (philosophy); Subclass; Finite set; Domain (mathematical analysis)","score_opus":0.014354588956449865,"score_gpt":0.2669614780759953,"score_spread":0.25260688911954543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416966254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026603868,0.00018230395,0.9697468,0.0023232934,0.0003613531,0.00025133672,0.000003473375,0.000016089962,0.00051145407],"genre_scores_gemma":[0.6392397,0.000009519906,0.3601456,0.0003510767,0.00019175815,0.000010592502,0.000001875442,0.000006396092,0.00004343779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892855,0.00004663421,0.00046966292,0.000112224334,0.00031834154,0.0001246049],"domain_scores_gemma":[0.99845123,0.0003370906,0.0004259549,0.00037773678,0.00034897873,0.00005900757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002920206,0.00011844738,0.00025477228,0.00012448705,0.00007956373,0.00003893801,0.00083052187,0.00003487353,0.000017926353],"category_scores_gemma":[0.00010249294,0.000065992215,0.00006635157,0.00037123196,0.000057132467,0.00019723986,0.00007646015,0.00016821726,0.000007122894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001009861,0.0028997879,0.0011511174,0.0044860085,0.0019967784,0.0004994432,0.04862694,0.08825692,0.01869389,0.4270697,0.08496834,0.3203412],"study_design_scores_gemma":[0.0043991995,0.004295976,0.004967139,0.002548061,0.00042724857,0.0016298514,0.0036381197,0.28149658,0.021739898,0.6571693,0.016621837,0.0010667867],"about_ca_topic_score_codex":6.3111236e-7,"about_ca_topic_score_gemma":0.000002368379,"teacher_disagreement_score":0.6126359,"about_ca_system_score_codex":0.00002020448,"about_ca_system_score_gemma":0.00009144791,"threshold_uncertainty_score":0.26910844},"labels":[],"label_agreement":null},{"id":"W4417046796","doi":"10.1090/tran/9573","title":"Conjugating trivial automorphisms of 𝒫(ℕ)/`ch","year":2025,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Automorphism; Conjugacy class; Upper and lower bounds; Conjugate; Automorphism group; Automorphisms of the symmetric and alternating groups","score_opus":0.010552145850366842,"score_gpt":0.26419351895591936,"score_spread":0.2536413731055525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417046796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042621467,0.000017041217,0.9546,0.0013479532,0.0000685061,0.00012917566,0.0000035411294,0.000059942136,0.0011524112],"genre_scores_gemma":[0.7957835,0.0000067898063,0.20379528,0.00020811948,0.0000046084615,0.000008711302,8.313755e-8,0.00000332733,0.00018956013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991291,0.000050752347,0.00031948808,0.00015247954,0.0001959819,0.00015215609],"domain_scores_gemma":[0.9988308,0.00038105086,0.0002205325,0.00047975878,0.00005865236,0.000029191946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017964537,0.000092269765,0.00030528777,0.000020949032,0.00012449072,0.000010174356,0.0007162119,0.000026143762,0.000026892452],"category_scores_gemma":[0.000041576084,0.00006262342,0.00037022296,0.00085736206,0.00060902484,0.000092566224,0.000042994034,0.00014654586,0.0000030381239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018815403,0.0009165868,0.00027653322,0.00044279222,0.00039684225,5.017013e-7,0.0041110115,0.0031753103,0.029655043,0.8447951,0.00054106157,0.11567042],"study_design_scores_gemma":[0.00085787656,0.00024857183,0.003024969,0.00023495255,0.00015896704,0.000009914327,0.0012161459,0.16454448,0.067822605,0.76132894,0.00026124937,0.00029137247],"about_ca_topic_score_codex":0.000014974123,"about_ca_topic_score_gemma":5.97091e-7,"teacher_disagreement_score":0.753162,"about_ca_system_score_codex":0.000025984724,"about_ca_system_score_gemma":0.00006464381,"threshold_uncertainty_score":0.2553709},"labels":[],"label_agreement":null},{"id":"W4417051684","doi":"10.1007/s00012-025-00912-9","title":"Functional monadic ortholattices and locally finite $$\\sigma $$-free polyadic ortholattices","year":2025,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Algebra over a field; Finite set; Reduction (mathematics); Locally compact space; Finite field","score_opus":0.00939267949421989,"score_gpt":0.21258010289739182,"score_spread":0.20318742340317192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417051684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110961206,0.0037576496,0.85116166,0.0068988157,0.00091433676,0.0003183381,0.000020073956,0.0006635592,0.02530434],"genre_scores_gemma":[0.98099273,0.00022519396,0.011925562,0.0024535665,0.0000698007,0.000008396874,0.00001435196,0.000015178153,0.004295242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982376,0.00009511652,0.0002639147,0.00067708036,0.0003013645,0.00042488432],"domain_scores_gemma":[0.99826306,0.00049029576,0.00012567843,0.00083164603,0.00011758107,0.00017173337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020003143,0.00027132663,0.00025702288,0.00039729473,0.00040074516,0.0002340827,0.0010330435,0.00013055238,0.000088889545],"category_scores_gemma":[0.0001455994,0.00025981004,0.000091697846,0.0009784912,0.00024386476,0.0015963898,0.0006840444,0.00026488848,0.00003583346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003668451,0.00005952975,0.00636761,0.000041842944,0.00011189271,0.00011823885,0.00044097213,0.00038153693,0.00020198763,0.95745116,0.0023038597,0.032484706],"study_design_scores_gemma":[0.0062302984,0.00060517143,0.15675755,0.00035197128,0.00034324004,0.000132387,0.0011346848,0.05391051,0.0016230274,0.6384198,0.13834357,0.0021477728],"about_ca_topic_score_codex":0.00008511584,"about_ca_topic_score_gemma":0.0001126276,"teacher_disagreement_score":0.8700315,"about_ca_system_score_codex":0.00005390346,"about_ca_system_score_gemma":0.00018383689,"threshold_uncertainty_score":0.9999854},"labels":[],"label_agreement":null},{"id":"W4417272087","doi":"10.28924/2291-8639-23-2025-334","title":"Structural Properties of (l,r)- and (r, l)-Derivations in IUP-Algebras","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Thailand Science Research and Innovation; University of Phayao","keywords":"Algebraic number; Algebra over a field; Foundation (evidence); Binary number; Algebraic properties; Algebraic structure","score_opus":0.01480003333472569,"score_gpt":0.28669824952719536,"score_spread":0.2718982161924697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417272087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60383284,0.005107894,0.38676444,0.0037980385,0.000109940935,0.0001405591,0.0000118272155,0.0000041409016,0.0002303082],"genre_scores_gemma":[0.9942548,0.0014966766,0.0038957573,0.00015465698,0.000073557574,0.000010268201,0.00000245872,0.0000029885678,0.00010878218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998299,0.00005651365,0.00096130755,0.00024211356,0.000319158,0.000121889614],"domain_scores_gemma":[0.9982172,0.00009853158,0.00064825173,0.00019650365,0.0007740984,0.000065377324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002660226,0.0001398505,0.00040773602,0.0012795182,0.00009999169,0.00015875485,0.0006380675,0.000059799524,0.000017175307],"category_scores_gemma":[0.000067854,0.0001162282,0.00016654939,0.0015416272,0.00023218876,0.0004791468,0.00022978651,0.00019429738,4.0313589e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006622291,0.00029593223,0.09986033,0.00006767842,0.0032576965,0.000008489613,0.0013980533,0.006968434,0.0076865563,0.6265559,0.000028499118,0.25380617],"study_design_scores_gemma":[0.002268131,0.00018025583,0.6071361,0.0005934445,0.0018784455,0.000095126095,0.0014279464,0.18467033,0.0076455185,0.19081531,0.0027346294,0.00055481336],"about_ca_topic_score_codex":0.000050283186,"about_ca_topic_score_gemma":0.00007407049,"teacher_disagreement_score":0.5072757,"about_ca_system_score_codex":0.00004661046,"about_ca_system_score_gemma":0.0001406844,"threshold_uncertainty_score":0.47396484},"labels":[],"label_agreement":null},{"id":"W4417323639","doi":"10.1016/j.dam.2025.12.001","title":"Non-adaptive prophet inequalities for minor-closed classes of matroids","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Inequality; Class (philosophy); Omega; Construct (python library)","score_opus":0.019543219072344565,"score_gpt":0.27368628426838837,"score_spread":0.2541430651960438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417323639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014587949,0.000055478857,0.96461654,0.00012581969,0.00008706315,0.0007687751,0.000017415736,0.00009733235,0.019643651],"genre_scores_gemma":[0.55247056,0.0000044142607,0.44669777,0.00010189987,0.00001959341,0.00018761944,0.0000054966245,0.000010168491,0.00050247856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988273,0.000007539949,0.00042916616,0.00028095866,0.00018616248,0.00026891474],"domain_scores_gemma":[0.99881124,0.00029972644,0.00021479203,0.000544588,0.000090339454,0.000039299986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016894791,0.00019464595,0.0003914579,0.000102224185,0.000085200314,0.000046594283,0.00064624747,0.000072339266,0.000004208085],"category_scores_gemma":[0.000037079713,0.00015578119,0.00012687783,0.000293099,0.00009811781,0.0001305095,0.000216537,0.00007756308,0.0000070895744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016005744,0.000070134396,0.0000066126977,0.00050969305,0.000042873944,5.3607096e-7,0.0012468994,0.000051252897,0.0047329306,0.9911831,0.00028105525,0.0018588894],"study_design_scores_gemma":[0.0006476315,0.00012395406,0.000059385202,0.00010103032,0.00004056007,0.0000010732223,0.0018115074,0.018797236,0.040469028,0.9373217,0.00038096652,0.00024593264],"about_ca_topic_score_codex":0.0000016770322,"about_ca_topic_score_gemma":0.000001572963,"teacher_disagreement_score":0.5378826,"about_ca_system_score_codex":0.000025538002,"about_ca_system_score_gemma":0.000081101134,"threshold_uncertainty_score":0.63525724},"labels":[],"label_agreement":null},{"id":"W591226764","doi":"10.1017/cbo9780511809835.003","title":"Combinatory logic","year":2012,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science","score_opus":0.02690515699241689,"score_gpt":0.1978688376213852,"score_spread":0.17096368062896833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W591226764","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010830305,0.00076516584,0.03551854,0.000020617592,0.0004960246,0.00023095551,0.000024503295,0.00039020978,0.96254313],"genre_scores_gemma":[0.0026727207,0.00011805639,0.0011578086,0.00023467926,0.00010414339,4.917408e-7,0.000011708901,0.000027294602,0.9956731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985406,0.00003734668,0.0001548552,0.0005750501,0.0002752743,0.00041692247],"domain_scores_gemma":[0.99836344,0.00006754759,0.00021969015,0.0009845794,0.00010885397,0.00025588073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000089786525,0.00038452577,0.00037224928,0.00016197358,0.00021197765,0.000050109295,0.0015839024,0.00035645437,0.0000064857013],"category_scores_gemma":[0.0000044573367,0.00042505926,0.00021453973,0.000010277492,0.00021076325,0.00030363502,0.0010929201,0.00052523596,0.00016509564],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006597927,0.000008730144,8.416142e-7,0.000026664155,0.000038907056,0.00024015477,0.000031102558,0.0000013039717,0.000011803555,0.9876776,0.008220328,0.003735975],"study_design_scores_gemma":[0.00034036319,0.000049751816,0.00001448991,0.000046852383,0.000053635576,0.000030511479,0.000005854953,0.00006887646,0.000117146286,0.0016903874,0.99704003,0.0005420948],"about_ca_topic_score_codex":0.000008615159,"about_ca_topic_score_gemma":2.0888886e-7,"teacher_disagreement_score":0.9888197,"about_ca_system_score_codex":0.00017600876,"about_ca_system_score_gemma":0.00007820782,"threshold_uncertainty_score":0.9998201},"labels":[],"label_agreement":null},{"id":"W592220735","doi":"10.1007/978-3-319-06413-0_6","title":"Combinatorics in finite lattices","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Distributive property; Distributive lattice; Lattice (music); Dedekind cut; Combinatorics; Mathematics; Dedekind sum; Discrete mathematics; Pure mathematics; Physics","score_opus":0.020136584848289715,"score_gpt":0.22775561019278387,"score_spread":0.20761902534449417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W592220735","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024606807,0.00018953286,0.26689056,0.00017314035,0.0003219748,0.000063632295,4.6901533e-7,0.000108807115,0.73224944],"genre_scores_gemma":[0.015641933,0.00012104875,0.007832097,0.000948026,0.00007128613,0.0000038164444,0.0000040067507,0.000019687137,0.97535807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990396,0.000009666348,0.00020881632,0.0003696107,0.00018752192,0.00018480021],"domain_scores_gemma":[0.99907166,0.0002136075,0.00010756789,0.00051596604,0.000034096094,0.000057088273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011035362,0.00019723634,0.00025317725,0.00014221243,0.00003073124,0.000055493543,0.000778847,0.00018201851,0.00011822418],"category_scores_gemma":[0.00001749339,0.00016725574,0.000058921247,0.000046614055,0.000031088057,0.00012852014,0.00026294022,0.00027470136,0.000545395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.8773615e-7,0.000004355538,0.000011801183,0.000009500573,0.0000027956244,0.000020622378,0.00002189643,0.000030974632,2.5228343e-7,0.98948777,0.00030215655,0.010107509],"study_design_scores_gemma":[0.00010772123,0.000037468813,0.000022848011,0.00002996406,0.0000017955589,0.0000019328743,4.648736e-7,0.0024511593,0.00000409647,0.7261932,0.27095124,0.00019810809],"about_ca_topic_score_codex":0.0000028296847,"about_ca_topic_score_gemma":0.0000159026,"teacher_disagreement_score":0.27064908,"about_ca_system_score_codex":0.00003083014,"about_ca_system_score_gemma":0.000027021822,"threshold_uncertainty_score":0.7010131},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014423833772234376,"score_gpt":0.24729903256124464,"score_spread":0.23287519878901025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W597985463","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001583873,0.0000404915,0.52123654,0.00016206164,0.0000400507,0.0002228104,0.0000041678913,0.00034674632,0.4779313],"genre_scores_gemma":[0.0016512175,0.000041330215,0.14666624,0.011662651,0.00029593942,0.00009224944,0.000010319309,0.00012330011,0.83945674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969972,0.00008810552,0.00048645982,0.0009502604,0.0007433271,0.00073467457],"domain_scores_gemma":[0.9969387,0.00094074174,0.00040788949,0.0013698216,0.00006518381,0.00027764274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003335828,0.0006845997,0.0009376259,0.00005976793,0.00024687077,0.00014062013,0.0017023578,0.00029246672,0.00008615353],"category_scores_gemma":[0.0000712934,0.0005324836,0.0008538251,0.00011163417,0.0009874443,0.000078415724,0.00044888773,0.0009689521,0.00045819802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052959094,0.00005010506,7.077467e-8,0.000052191903,0.000100999874,0.000014082933,0.0010397439,0.00017715823,0.0000116416795,0.9346989,0.020061208,0.043788597],"study_design_scores_gemma":[0.0001423185,0.0002018969,4.6600047e-7,0.00011517963,0.000042886495,0.000023099783,0.000040725747,0.026445322,0.00003735749,0.95949274,0.012840256,0.00061775726],"about_ca_topic_score_codex":8.404967e-7,"about_ca_topic_score_gemma":4.1151827e-7,"teacher_disagreement_score":0.3745703,"about_ca_system_score_codex":0.0002573548,"about_ca_system_score_gemma":0.00035652134,"threshold_uncertainty_score":0.99971265},"labels":[],"label_agreement":null},{"id":"W59929550","doi":"","title":"Constrained classes closed under unions and ne.c. structures.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.01542517154865266,"score_gpt":0.24936255073956046,"score_spread":0.2339373791909078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59929550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9534427,0.00046066896,0.033817977,0.0022584768,0.0017898717,0.00020532962,0.0000022385807,0.00037694242,0.0076458096],"genre_scores_gemma":[0.9948819,0.000080623555,0.004164869,0.0006944509,0.000009732704,0.0000047177527,0.00000277711,0.000008238298,0.00015267135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903035,0.000052101215,0.00015148676,0.00032518315,0.00015683843,0.00028405632],"domain_scores_gemma":[0.9992312,0.00014118654,0.000058702168,0.00038261505,0.000053207317,0.00013304099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007696003,0.0001483701,0.00015731019,0.00006512411,0.00018383407,0.0001057775,0.00039839942,0.00007472872,0.000025126448],"category_scores_gemma":[0.000034033754,0.00013161644,0.00003374532,0.0003407851,0.00013662365,0.0003441782,0.0001617855,0.00015244237,0.0000132016785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026361581,0.000025200878,0.0009443715,0.000002005473,0.00001018197,0.000026129253,0.00006836312,0.00003300609,0.00032388826,0.99320656,0.00024581893,0.005111829],"study_design_scores_gemma":[0.0007483745,0.000071272516,0.015675995,0.000005402274,0.0000039164943,0.00006606163,0.00005537406,0.001004391,0.0001946021,0.97819155,0.0038063133,0.00017672921],"about_ca_topic_score_codex":0.000008393344,"about_ca_topic_score_gemma":0.000004752654,"teacher_disagreement_score":0.04143923,"about_ca_system_score_codex":0.000025025707,"about_ca_system_score_gemma":0.000058519887,"threshold_uncertainty_score":0.5367163},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0326006419618631,"score_gpt":0.2449626669036918,"score_spread":0.2123620249418287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60726562","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.70877e-7,0.000284308,0.4219355,0.00025653347,0.00027733477,0.00010240568,9.722222e-7,0.00030767557,0.5768346],"genre_scores_gemma":[0.0003549592,0.00019595525,0.034905974,0.0026386373,0.00024760197,0.0000056450795,0.000007537192,0.000029025245,0.96161467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832606,0.000011050002,0.00027447994,0.0007152204,0.0003268869,0.0003462815],"domain_scores_gemma":[0.99862224,0.000047287507,0.00014166672,0.0009988718,0.00006171602,0.0001282318],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000091842194,0.000374287,0.00035618115,0.0001423453,0.000094630675,0.000089119,0.0012603485,0.00027518722,0.0022853282],"category_scores_gemma":[0.00000814293,0.00029591587,0.00018692124,0.000056132856,0.00006712033,0.0002346172,0.00041521416,0.00034357395,0.003112779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011231608,0.0000070845513,0.000001098496,0.000005868982,0.0000122683405,0.00015020497,0.0000102662025,0.000009327772,0.000002889797,0.970208,0.0030704814,0.026521405],"study_design_scores_gemma":[0.00010163938,0.00005613276,0.00000793827,0.00001976433,0.0000068288664,0.000053936226,8.409698e-7,0.00070367364,0.0000098979635,0.64495003,0.35376817,0.00032115303],"about_ca_topic_score_codex":0.0000025116233,"about_ca_topic_score_gemma":0.0000041200697,"teacher_disagreement_score":0.38702953,"about_ca_system_score_codex":0.000058470498,"about_ca_system_score_gemma":0.00004979134,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null},{"id":"W63421133","doi":"","title":"Excess Problem for Modular Lattices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modular design; Mathematics; Pure mathematics; Computer science; Programming language","score_opus":0.023054994259248618,"score_gpt":0.2416237437916444,"score_spread":0.21856874953239577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63421133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40947098,0.0031401897,0.5427774,0.005768362,0.008010248,0.0021837144,0.000008341461,0.0017425069,0.026898274],"genre_scores_gemma":[0.9667512,0.000019223968,0.03196021,0.0003022541,0.00001363551,0.00007548273,0.0000013569357,0.000012267469,0.00086433464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989665,0.000024536268,0.00016502434,0.0003513818,0.00016871086,0.00032384598],"domain_scores_gemma":[0.9991938,0.00009485964,0.00007524977,0.0004712546,0.00007581213,0.000089064364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012513656,0.0001279863,0.00015117024,0.00004708191,0.00015142198,0.000093437615,0.0007754671,0.00005761886,0.000023973414],"category_scores_gemma":[0.000029557616,0.00011763967,0.00006427269,0.0002662317,0.00002955902,0.00054417364,0.00013005339,0.000088400324,0.00009813236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010508304,0.00008492646,0.000117041665,0.000016498614,0.000007977465,0.000005818953,0.00019768922,0.00010570554,0.00012103421,0.9872757,0.0015607004,0.010505834],"study_design_scores_gemma":[0.000646694,0.00010961306,0.00017328188,0.00000953443,0.0000044142384,0.000004678003,0.000005534767,0.0461064,0.00054356654,0.9375053,0.014707527,0.00018344363],"about_ca_topic_score_codex":0.0000020251032,"about_ca_topic_score_gemma":5.50375e-7,"teacher_disagreement_score":0.55728024,"about_ca_system_score_codex":0.0000269621,"about_ca_system_score_gemma":0.000008795089,"threshold_uncertainty_score":0.47972065},"labels":[],"label_agreement":null},{"id":"W66087286","doi":"10.1007/978-0-387-77487-9_4","title":"Constructions of Algebras","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Algebra over a field; Pure mathematics; Computer science; Mathematics","score_opus":0.019895535085658007,"score_gpt":0.21678490156424934,"score_spread":0.19688936647859134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66087286","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050428653,0.00028532345,0.2187816,0.00006972805,0.00024261534,0.00006243722,0.0000033129122,0.00011214037,0.78043777],"genre_scores_gemma":[0.0025746792,0.00060189737,0.15466206,0.00025540125,0.000094369425,0.0000025618247,0.0000047794447,0.000017700666,0.84178656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919564,0.0000037459886,0.00023198221,0.00027695013,0.00017511004,0.000116595205],"domain_scores_gemma":[0.999154,0.000046530233,0.00014735367,0.00052018964,0.00007745715,0.000054523876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000020192165,0.00015968623,0.00024462168,0.000111150344,0.00005642353,0.000008964259,0.00049675506,0.00013692962,0.0004260704],"category_scores_gemma":[0.0000054277275,0.00013688132,0.00012269185,0.000033882723,0.0001862741,0.0001300132,0.00016294379,0.00015616548,0.00017854816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.2434613e-7,0.0000034260556,0.0000017547586,0.0000041286617,0.000014168524,0.000011599351,0.00002419377,0.0000039118568,0.000007891521,0.97603524,0.0026625367,0.021230828],"study_design_scores_gemma":[0.0001168947,0.000056536042,0.000017711056,0.000029464238,0.000008327183,0.00024596846,0.000002651201,0.000103233826,0.00027766338,0.5902709,0.4085928,0.00027787135],"about_ca_topic_score_codex":0.0000019682407,"about_ca_topic_score_gemma":0.0000022756954,"teacher_disagreement_score":0.40593025,"about_ca_system_score_codex":0.000014606654,"about_ca_system_score_gemma":0.00007963337,"threshold_uncertainty_score":0.5581859},"labels":[],"label_agreement":null},{"id":"W6888808698","doi":"10.22103/jmmr.2024.23142.1599","title":"Extension of stabilizers on subtraction algebras","year":2024,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Etobicoke General Hospital","funders":"","keywords":"Bounded function; Ideal (ethics); Stabilizer (aeronautics); Intersection (aeronautics); Subtraction; Class (philosophy); Separable space; Quotient","score_opus":0.24691885857709325,"score_gpt":0.5475892996960137,"score_spread":0.3006704411189204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888808698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9028696,0.018555295,0.068765454,0.0005453064,0.0027207637,0.0005094128,0.000013662026,0.00020405247,0.0058164643],"genre_scores_gemma":[0.9939019,0.0038245532,0.0016862641,0.00024277609,0.000112422276,0.000013900777,0.0000029344826,0.000028971874,0.00018625527],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99733317,0.00019910058,0.0007205379,0.00063349796,0.0007832161,0.00033045275],"domain_scores_gemma":[0.997809,0.0005782689,0.00045806778,0.00072918326,0.0002399312,0.00018553645],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010314138,0.00026837594,0.00053132366,0.0008223772,0.00015468516,0.0009679263,0.0027442954,0.00009872269,0.0016895005],"category_scores_gemma":[0.00023225852,0.00021922645,0.00021615982,0.0014913252,0.00010870798,0.004364965,0.0007333333,0.00043836943,0.00004255946],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026259583,0.0006953211,0.019728012,0.000361853,0.00023444774,0.00028245794,0.0006364455,0.0030337302,0.56984,0.05375099,0.024858179,0.32631594],"study_design_scores_gemma":[0.000652812,0.00012981362,0.39374572,0.0016844335,0.00008598842,0.00008634974,0.00012370833,0.006401786,0.2732342,0.30543873,0.017445805,0.0009706529],"about_ca_topic_score_codex":0.00009976423,"about_ca_topic_score_gemma":0.000008359091,"teacher_disagreement_score":0.37401772,"about_ca_system_score_codex":0.00010206014,"about_ca_system_score_gemma":0.00014547753,"threshold_uncertainty_score":0.9992231},"labels":[],"label_agreement":null},{"id":"W6910440504","doi":"10.48550/arxiv.1701.00140","title":"A Finite Presentation of CNOT-Dihedral Operators","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unitary state; Set (abstract data type); Operator (biology); Presentation (obstetrics); Algebra over a field; Finite set; Electronic circuit","score_opus":0.06244501705855813,"score_gpt":0.20155196863394506,"score_spread":0.13910695157538694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910440504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21417455,0.000033260458,0.7822763,0.000074326155,0.00041763383,0.00017467787,0.000013529812,0.0001157018,0.0027200219],"genre_scores_gemma":[0.9964604,0.00005982093,0.002126686,0.000052255826,0.00005643278,8.2458666e-7,0.0000062408435,0.000009527549,0.0012278524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986779,0.000104892584,0.00018244855,0.00071069924,0.00008488328,0.00023914604],"domain_scores_gemma":[0.9985056,0.00013607011,0.00024521328,0.0008675335,0.00014454755,0.00010105057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097963144,0.0002088759,0.00025832234,0.00019427901,0.00007230551,0.000038381673,0.0013497383,0.0001719836,0.000035479454],"category_scores_gemma":[0.000042386095,0.00019172522,0.00015459217,0.00035287076,0.000110801244,0.00050142925,0.0013765583,0.00022167654,0.00005595218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035315545,0.00009380864,0.0043310253,0.00008475381,0.00007968279,0.00017367875,0.0004223315,0.121287934,0.0004756626,0.871277,0.00016886613,0.0015699607],"study_design_scores_gemma":[0.0012280211,0.00015695006,0.002829206,0.00023092238,0.000062885956,0.000004122216,0.00009352654,0.32701483,0.005441015,0.6614656,0.00064489746,0.0008280017],"about_ca_topic_score_codex":0.000019555031,"about_ca_topic_score_gemma":0.0000068212566,"teacher_disagreement_score":0.7822858,"about_ca_system_score_codex":0.0000747936,"about_ca_system_score_gemma":0.0001376105,"threshold_uncertainty_score":0.78183275},"labels":[],"label_agreement":null},{"id":"W6925307323","doi":"10.17632/ns77shhvw7.2","title":"Effects of Ozone and Biological Degradation on the Removal and Transformation of Highly Hydrophilic DOC in a Conventional Water Treatment Process","year":2024,"lang":"en","type":"dataset","venue":"Data Archiving and Networked Services (DANS)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Dissolved organic carbon; Ozone; Biodegradation; Water treatment; Degradation (telecommunications); Trihalomethane; Water quality; Fraction (chemistry)","score_opus":0.016232953159856366,"score_gpt":0.2495983262525689,"score_spread":0.23336537309271252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925307323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8631533,0.0014390505,0.0015902681,0.00029418236,0.00011061984,0.0005782384,0.13279533,0.000026341751,0.00001265946],"genre_scores_gemma":[0.53413886,0.0041684997,0.00035244253,0.000103436854,0.00007748664,0.000046567715,0.46109912,0.000008861281,0.000004717608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872774,0.00017365694,0.00030690443,0.00045935312,0.00015522931,0.00017709509],"domain_scores_gemma":[0.9990547,0.0003932044,0.00011241594,0.00038844792,0.00001100004,0.00004025826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030213787,0.00021489963,0.00029884515,0.00011496662,0.00008167849,0.00006328084,0.0005570384,0.00007868853,0.0000010477311],"category_scores_gemma":[0.0000050285075,0.00010998803,0.000023822746,0.00014228182,0.00011423087,0.00035393264,0.0002931552,0.00016284565,0.0000018007398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057263263,0.007460245,0.004114029,0.11715224,0.0038713885,0.0015139218,0.087251745,0.007530063,0.035747148,0.07277847,0.03628476,0.62056965],"study_design_scores_gemma":[0.007973736,0.0067227064,0.03140403,0.015759027,0.0010233367,0.0006870406,0.0011561327,0.668564,0.007540912,0.09742764,0.15887694,0.0028645047],"about_ca_topic_score_codex":0.00009366209,"about_ca_topic_score_gemma":0.00014825571,"teacher_disagreement_score":0.6610339,"about_ca_system_score_codex":0.0000103269,"about_ca_system_score_gemma":0.000014124033,"threshold_uncertainty_score":0.44851816},"labels":[],"label_agreement":null},{"id":"W6929326100","doi":"10.48550/arxiv.2103.05191","title":"Exponential Modalities and Complementarity (extended abstract)","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Unitary state; Categorical variable; Complementarity (molecular biology); Quantum; Exponential function; Modalities; Algebra over a field","score_opus":0.0903744463005921,"score_gpt":0.19869389218331446,"score_spread":0.10831944588272235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929326100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61009395,0.00012277237,0.38779834,0.00008860011,0.00040196846,0.00013050939,0.000014747168,0.0001471329,0.0012019585],"genre_scores_gemma":[0.99486125,0.00017734703,0.004305792,0.00012863011,0.000059088172,7.8669245e-7,0.000039758466,0.0000091644115,0.0004181776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983061,0.00007681974,0.0001794912,0.0010217008,0.000092533286,0.00032336896],"domain_scores_gemma":[0.99870485,0.000071940856,0.00016405387,0.00081376557,0.000094361676,0.00015102727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012264597,0.00027197567,0.00031188774,0.00011207365,0.00020202524,0.00022744159,0.0009297955,0.00015736496,0.00011087902],"category_scores_gemma":[0.000011713478,0.00032124782,0.00013459485,0.00018037485,0.00014318999,0.00053162815,0.0027971065,0.00046622986,0.000011006087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030696614,0.00023549334,0.0024432885,0.0001918195,0.00018545531,0.0013352508,0.0011641552,0.02222679,0.00022978736,0.96932596,0.0001529755,0.0024783495],"study_design_scores_gemma":[0.0017017719,0.000109129214,0.054615024,0.00017528275,0.00013563436,0.00003923002,0.001867331,0.20627363,0.0009463671,0.73141897,0.001057913,0.001659737],"about_ca_topic_score_codex":0.0003160051,"about_ca_topic_score_gemma":0.00016268183,"teacher_disagreement_score":0.3847673,"about_ca_system_score_codex":0.00010043692,"about_ca_system_score_gemma":0.00012255501,"threshold_uncertainty_score":0.99992394},"labels":[],"label_agreement":null},{"id":"W6930358764","doi":"10.5281/zenodo.10486393","title":"Fig. 1 in Regulation of liver cell glucose homeostasis by dehydroabietic acid, abietic acid and squalene isolated from balsam fir (Abies balsamea (L.) Mill.) a plant of the Eastern James Bay Cree traditional pharmacopeia","year":2015,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institutes of Health Research","funders":"","keywords":"Abies balsamea; Balsam; Glucose homeostasis; Abietic acid; Homeostasis; Insulin; Liver cell; Gluconeogenesis","score_opus":0.028516479535015873,"score_gpt":0.21555362322477922,"score_spread":0.18703714368976335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930358764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33896148,0.14430293,0.13880722,0.0039599775,0.0020861623,0.010928179,0.058637418,0.0037112485,0.29860538],"genre_scores_gemma":[0.98200107,0.0024152277,0.002059854,0.00015953818,0.00012564306,4.1244053e-7,0.003074516,0.001721093,0.008442642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974593,0.0006068526,0.00046490566,0.0005638873,0.00062112143,0.00028396508],"domain_scores_gemma":[0.99849975,0.000053730593,0.00046649898,0.0006104807,0.00023612515,0.00013343367],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039467358,0.0002708153,0.00038038244,0.00028847088,0.00023061121,0.00016298522,0.0014746401,0.00015375939,0.0051894695],"category_scores_gemma":[0.00016797679,0.00022934475,0.00006849322,0.0006256271,0.0002849075,0.00024412146,0.0009628771,0.00028439303,0.0002912251],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022278656,0.0006674795,0.000042883014,0.000484412,0.00015507563,0.000021450149,0.0030591313,0.00016765455,0.08273001,0.001044595,0.8695888,0.041815747],"study_design_scores_gemma":[0.002551604,0.0005725231,0.0030160064,0.00059728214,0.000075602205,0.000060550185,0.00018934184,0.019278837,0.013749812,0.0018783414,0.9573294,0.0007007023],"about_ca_topic_score_codex":0.00005766122,"about_ca_topic_score_gemma":0.000004394754,"teacher_disagreement_score":0.6430396,"about_ca_system_score_codex":0.00007851717,"about_ca_system_score_gemma":0.000015329744,"threshold_uncertainty_score":0.9957199},"labels":[],"label_agreement":null},{"id":"W6930479592","doi":"10.5281/zenodo.15150567","title":"Charactoceras undefined-A Strand 1934","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Whorl (mollusc); Aperture (computer memory); Apex (geometry); Shell (structure); Foramen","score_opus":0.025848981076245555,"score_gpt":0.2494034656349053,"score_spread":0.22355448455865976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930479592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079160705,0.00016092013,0.6607596,0.003654297,0.00025385807,0.00038797475,0.000030815583,0.0017981107,0.3250383],"genre_scores_gemma":[0.99383277,0.00007089444,0.0022526567,0.00080512336,0.00006942412,3.3652835e-8,0.00016495818,0.00031828374,0.002485886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987671,0.00013532488,0.00017581775,0.00040049234,0.00021892524,0.00030237914],"domain_scores_gemma":[0.99905014,0.000027679422,0.000054772878,0.0005306917,0.00023718723,0.000099526624],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029879165,0.00011263078,0.00011471996,0.00020169959,0.0014224427,0.00077594694,0.0015665983,0.00004553817,0.0016897586],"category_scores_gemma":[0.00021000132,0.00011149447,0.000042100193,0.0007953653,0.000080868864,0.00042923455,0.0010959229,0.00020487011,0.0031835511],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002057333,0.00010726097,0.0000068589998,0.00003731344,0.00002887644,0.000016355494,0.0003772244,0.00007583335,0.0026634706,0.622344,0.047445666,0.32687655],"study_design_scores_gemma":[0.00045091604,0.000101783706,0.0018250616,0.000022190488,0.000004714921,0.00003217902,0.000046800465,0.0013501676,0.00065141625,0.0140632875,0.98130137,0.00015010392],"about_ca_topic_score_codex":0.0000029360797,"about_ca_topic_score_gemma":1.2157572e-7,"teacher_disagreement_score":0.9859167,"about_ca_system_score_codex":0.00007496772,"about_ca_system_score_gemma":0.000005330432,"threshold_uncertainty_score":0.9998776},"labels":[],"label_agreement":null},{"id":"W6966998578","doi":"10.48550/arxiv.1205.1050","title":"Width and size of regular resolution proofs","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); Mathematical proof; Set (abstract data type); Contrast (vision); Calculus (dental)","score_opus":0.053718335946769606,"score_gpt":0.17461627110489894,"score_spread":0.12089793515812933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966998578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3258122,0.0004687099,0.67119986,0.000067217145,0.0002746122,0.00022840864,0.0000046828163,0.0001237131,0.0018206218],"genre_scores_gemma":[0.98936254,0.00015336461,0.00962558,0.000028054834,0.000044934415,4.3755088e-7,0.0000023838854,0.000007402603,0.00077528984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887073,0.00008665001,0.00013741147,0.000589909,0.00006651972,0.00024877777],"domain_scores_gemma":[0.99868727,0.00008542352,0.00023155846,0.00079594256,0.00008558877,0.00011422016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001793879,0.00018117747,0.00024432456,0.000070465634,0.000076661876,0.000022316528,0.0007275662,0.0001889592,0.00000958582],"category_scores_gemma":[0.000041252842,0.00019278566,0.000084375286,0.00027114135,0.00014474339,0.00037033015,0.0014410744,0.00026328996,0.0000088374445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033205808,0.00010553389,0.0037576642,0.00017978215,0.00005454569,0.00006432911,0.00033870374,0.020895137,0.00034032261,0.97080845,0.00009977205,0.0033225666],"study_design_scores_gemma":[0.00071246736,0.00011388397,0.024916034,0.00017571579,0.00009930364,0.00001435224,0.000044175104,0.12599075,0.001071466,0.84496474,0.001203406,0.0006936667],"about_ca_topic_score_codex":0.000020231268,"about_ca_topic_score_gemma":0.0000049851665,"teacher_disagreement_score":0.6635504,"about_ca_system_score_codex":0.00006279565,"about_ca_system_score_gemma":0.000055585704,"threshold_uncertainty_score":0.78615713},"labels":[],"label_agreement":null},{"id":"W6977126202","doi":"10.6084/m9.figshare.19424381","title":"[FIGURE] Relativity of π as a function of the N-sided unit regular polygon circumscribing a circle [published in JMR / 2022]","year":2022,"lang":"en","type":"other","venue":"Figshare","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Inscribed figure; Perimeter; Polygon (computer graphics); Unit circle; Unit (ring theory); Unit square; Star-shaped polygon; Simple polygon","score_opus":0.02195745187215149,"score_gpt":0.22920177665458824,"score_spread":0.20724432478243676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977126202","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011732933,0.006530909,0.0011853806,0.0007232856,0.001459243,0.0028380528,0.04308196,0.0007392301,0.94226867],"genre_scores_gemma":[0.55320364,0.000030084608,0.0010379769,0.001229173,0.00048765616,0.0009496889,0.035686225,0.00077305053,0.40660247],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982185,0.0002465909,0.00031552988,0.00049599144,0.00048420063,0.00023923119],"domain_scores_gemma":[0.99793625,0.00014982028,0.0006449611,0.0011684379,0.000058249243,0.000042273787],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014455947,0.00020283124,0.0003624458,0.00031655186,0.000065037704,0.000032768952,0.0012311356,0.00021005554,0.16696452],"category_scores_gemma":[0.0011422449,0.00018127708,0.00015992143,0.0013779866,0.000017380464,0.0002770511,0.0007658623,0.0005299784,0.00008664371],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023030032,0.00020432853,0.00034968057,0.00063614955,0.00008683674,0.0000409448,0.00061527797,0.00027600015,0.0007964863,0.0069877207,0.96428436,0.025699213],"study_design_scores_gemma":[0.0017694077,0.00041115863,0.03961906,0.009289351,0.00004530256,0.000025907042,0.000249755,0.0011020785,0.0014858204,0.03206306,0.91275173,0.0011873893],"about_ca_topic_score_codex":0.000081122445,"about_ca_topic_score_gemma":0.00009108307,"teacher_disagreement_score":0.5520304,"about_ca_system_score_codex":0.000072881565,"about_ca_system_score_gemma":0.00020622474,"threshold_uncertainty_score":0.833797},"labels":[],"label_agreement":null},{"id":"W6979258957","doi":"","title":"Counting Specific Classes of Relations Regarding Fixed Points and Reflexive Points","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Université Laval","funders":"","keywords":"Class (philosophy); Cardinality (data modeling); Fixed point; Idempotence; Set (abstract data type); Limiting; Reflexivity; Function (biology)","score_opus":0.03516925259962042,"score_gpt":0.285282571526991,"score_spread":0.25011331892737054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979258957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86013466,0.00042707284,0.12633036,0.0015436483,0.0002889975,0.0001054239,0.0000013487792,0.00010255459,0.011065952],"genre_scores_gemma":[0.97471845,0.00006237829,0.024111446,0.0002838137,0.000033921257,0.0000041567964,0.000001590323,0.0000055251876,0.0007786997],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99902004,0.00004901616,0.00026719365,0.00034190246,0.00012215217,0.00019968257],"domain_scores_gemma":[0.9990816,0.00026619926,0.00013244107,0.00038083497,0.0000993829,0.00003953261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002238104,0.00011004348,0.00017930518,0.00012486707,0.00018860216,0.0000417872,0.00030497395,0.000057210687,0.000014366809],"category_scores_gemma":[0.00018403315,0.00010258085,0.000044884906,0.00048347405,0.00008378442,0.0004950356,0.00024393307,0.0001495381,0.000035741705],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001288774,0.000044303604,0.5865246,0.00003586669,0.000037169742,0.000014601653,0.0005185178,0.0000415479,0.0057394668,0.40019566,0.001115947,0.0057194433],"study_design_scores_gemma":[0.00085241586,0.000075092394,0.8672998,0.0002932884,0.000020714353,0.000011918141,0.00031616513,0.0018659771,0.0126808705,0.103083275,0.013174115,0.00032634477],"about_ca_topic_score_codex":0.00000425354,"about_ca_topic_score_gemma":0.0000043471664,"teacher_disagreement_score":0.29711238,"about_ca_system_score_codex":0.00003609423,"about_ca_system_score_gemma":0.00003921659,"threshold_uncertainty_score":0.41831255},"labels":[],"label_agreement":null},{"id":"W69796697","doi":"10.1023/a:1006445124778","title":"Epimorphisms in Certain Varieties of Algebras","year":2000,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Lemma (botany); Surjective function; Bounded function; Pure mathematics; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.009129982892657219,"score_gpt":0.22436083910600965,"score_spread":0.21523085621335244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69796697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6899004,0.0006155902,0.25069168,0.0024090766,0.00022492651,0.00019783685,0.000001344589,0.00015758387,0.055801548],"genre_scores_gemma":[0.97442853,0.000028405011,0.023040542,0.00037584925,0.000015058787,0.000005644602,7.2946415e-7,0.000004297756,0.0021009177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999402,0.000027822527,0.00013680637,0.00016682337,0.00010549356,0.0001610747],"domain_scores_gemma":[0.99962354,0.00003904777,0.000025441617,0.0002632899,0.000022368302,0.000026298929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007982373,0.00006761141,0.00010889618,0.000049334394,0.000022678245,0.000013058976,0.0003370004,0.000036025183,0.0007983891],"category_scores_gemma":[0.000015679008,0.0000581755,0.000021754773,0.0004035028,0.00004192064,0.00020563771,0.00004235846,0.00006847527,0.00012275898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011961296,0.00014513964,0.0036565717,0.000012860746,0.0000074776362,0.000029981182,0.0015706032,0.0023726334,0.00056278636,0.7112455,0.0005514883,0.27983302],"study_design_scores_gemma":[0.0010284209,0.00020034553,0.052684914,0.00003065759,0.0000040728255,0.000020603931,0.00007785839,0.012974223,0.0035975878,0.88376886,0.045133863,0.00047857335],"about_ca_topic_score_codex":0.00003433988,"about_ca_topic_score_gemma":0.000016021846,"teacher_disagreement_score":0.28452814,"about_ca_system_score_codex":0.000008789401,"about_ca_system_score_gemma":0.000026013637,"threshold_uncertainty_score":0.87418},"labels":[],"label_agreement":null},{"id":"W7106782718","doi":"","title":"Extremality in semidistributive lattices","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Counterexample; Lattice (music); Chromatic scale; Complete lattice; Congruence (geometry); Galois connection; Torsion (gastropod); Distributive property","score_opus":0.04182551705983525,"score_gpt":0.30406114591942923,"score_spread":0.262235628859594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106782718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8489918,0.0032340284,0.13428088,0.0028624728,0.0012559316,0.00032596753,0.000015042576,0.00011081978,0.0089230435],"genre_scores_gemma":[0.9953149,0.00022848895,0.0007876109,0.0011443143,0.000092451155,0.000023557839,0.000005953574,0.000008556613,0.0023941696],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9968186,0.00029318454,0.00067798473,0.0011182649,0.00025789358,0.00083405507],"domain_scores_gemma":[0.99806124,0.00040781285,0.00021717417,0.0010255686,0.00014556301,0.00014261664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059009134,0.00037869072,0.0004964627,0.00018212118,0.00027336398,0.00013251131,0.0013150431,0.00022239333,0.0001240789],"category_scores_gemma":[0.00036948532,0.00037487294,0.00015203156,0.0019821073,0.00027609355,0.000893098,0.00091097853,0.00060038216,0.00030716],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030032688,0.00030514805,0.9151279,0.00008816391,0.000039119735,0.00012800124,0.0007290273,0.00017331367,0.00041226097,0.06380999,0.00019425241,0.018962814],"study_design_scores_gemma":[0.00071903336,0.00007878179,0.9576566,0.00028437815,0.000026662245,0.0000037729706,0.00020721648,0.006938292,0.0035867183,0.02478372,0.005284857,0.00042995965],"about_ca_topic_score_codex":0.00008745452,"about_ca_topic_score_gemma":0.00012968402,"teacher_disagreement_score":0.14632308,"about_ca_system_score_codex":0.00023723475,"about_ca_system_score_gemma":0.0003029241,"threshold_uncertainty_score":0.9998703},"labels":[],"label_agreement":null},{"id":"W7110653406","doi":"","title":"Review of forall x: Calgary An Introduction to Formal Logic","year":2024,"lang":"","type":"article","venue":"ScholarWorks @ UTRGV (The University of Texas Rio Grande Valley)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Formal methods; Philosophy of logic; Theory; Formal system","score_opus":0.01698445129767888,"score_gpt":0.24370197638207455,"score_spread":0.2267175250843957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110653406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014370223,0.15121274,0.799448,0.026933817,0.003063306,0.0023216156,0.0000420365,0.0003450678,0.0022632093],"genre_scores_gemma":[0.65080297,0.24560985,0.08448897,0.006930178,0.0022077432,0.0000054135076,0.00015649965,0.0001597823,0.009638614],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99598885,0.00059405685,0.00070406956,0.0012062951,0.0007308974,0.0007758349],"domain_scores_gemma":[0.9967602,0.00016837406,0.00036202924,0.0016822831,0.0005332995,0.0004938421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022171321,0.00049884635,0.00086282974,0.0004885276,0.00071098265,0.0001611063,0.002873138,0.0003089272,0.0008756054],"category_scores_gemma":[0.00021352906,0.00042605322,0.000689902,0.0025409812,0.0005425331,0.0034677167,0.001154132,0.0013203047,0.00017712452],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008814463,0.0010116928,0.00043018186,0.013839061,0.00080478174,0.0002586704,0.0065962244,0.005533397,0.00069439417,0.18699752,0.033087365,0.74986523],"study_design_scores_gemma":[0.0028439162,0.0040440257,0.005285767,0.021606255,0.00149774,0.00022811822,0.0009952803,0.03626134,0.0005665873,0.03182945,0.89264834,0.0021931657],"about_ca_topic_score_codex":0.00010698615,"about_ca_topic_score_gemma":0.00008706759,"teacher_disagreement_score":0.85956097,"about_ca_system_score_codex":0.00017264784,"about_ca_system_score_gemma":0.0003400489,"threshold_uncertainty_score":0.9998191},"labels":[],"label_agreement":null},{"id":"W7117079217","doi":"","title":"A matrix approach to the enumeration of naturally labeled posets","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Partially ordered set; Enumeration; Matrix representation; Matrix (chemical analysis); Algebraic number; Ideal (ethics); Representation (politics); Hasse diagram","score_opus":0.020446590944409156,"score_gpt":0.2808449591915838,"score_spread":0.26039836824717466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117079217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6622579,0.0024255728,0.32324103,0.006751629,0.0012212202,0.00079577323,0.000006229698,0.000072054514,0.0032285778],"genre_scores_gemma":[0.98364943,0.000060724742,0.010311704,0.0022603425,0.00012514272,0.00003829712,0.000005773684,0.000010496003,0.0035380686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99774504,0.0002082978,0.0005540737,0.0006892393,0.00034021662,0.0004631529],"domain_scores_gemma":[0.99819684,0.00016120673,0.00021301708,0.0010687831,0.00026476083,0.00009541031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043657067,0.0002827129,0.0003500569,0.00015693741,0.0003709836,0.000121024,0.0015684214,0.00014506103,0.000017367774],"category_scores_gemma":[0.00021776876,0.00020225722,0.00014582524,0.001721332,0.00010176395,0.000431274,0.0006242938,0.00038940823,0.00014894018],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002858291,0.0014663012,0.07457586,0.00050546456,0.0004639361,0.000025282154,0.012424771,0.012724649,0.05571905,0.70869464,0.005628839,0.12748541],"study_design_scores_gemma":[0.0038956946,0.0012470884,0.6820533,0.000634413,0.00033267646,0.000054627428,0.00093301834,0.1886785,0.060087513,0.024073761,0.035964463,0.002044904],"about_ca_topic_score_codex":0.000023494818,"about_ca_topic_score_gemma":0.000012368273,"teacher_disagreement_score":0.68462086,"about_ca_system_score_codex":0.00006118957,"about_ca_system_score_gemma":0.00021526021,"threshold_uncertainty_score":0.82478094},"labels":[],"label_agreement":null},{"id":"W7128744579","doi":"10.4153/s0008439526101817","title":"Is it true that most sets of naturals are Sidon?","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algebra over a field; Key (lock); Group (periodic table); Omega","score_opus":0.02299227025456496,"score_gpt":0.2663389288009481,"score_spread":0.24334665854638315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128744579","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07225946,0.0014693764,0.23470709,0.40763816,0.0008582379,0.0012710947,0.00012175117,0.000281534,0.2813933],"genre_scores_gemma":[0.96385795,0.000008621715,0.013139584,0.016021457,0.000015555976,0.00001602657,0.0000020303544,0.000008656788,0.006930129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886817,0.00003726359,0.00024926447,0.000298004,0.0001744779,0.00037282196],"domain_scores_gemma":[0.99875116,0.00025544403,0.000079909005,0.0005635668,0.00006990794,0.00028001933],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015126815,0.00014933835,0.0002846483,0.00015253076,0.00009402123,0.00005889333,0.0007577907,0.00010584797,0.0024522725],"category_scores_gemma":[0.00027843317,0.00012712732,0.000078498306,0.00035118606,0.00008569974,0.000056027067,0.00010254369,0.00016384808,0.0014022724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025695972,0.00004298121,0.00021024543,0.0002252382,0.00003422349,0.00008238515,0.00055502827,0.000011335476,0.000054930762,0.76435244,0.2287353,0.0056933463],"study_design_scores_gemma":[0.0005329836,0.0000530568,0.0018830264,0.0006531851,0.00002656011,0.000036306013,0.00052526576,0.0041630007,0.004297337,0.74091095,0.24637194,0.000546373],"about_ca_topic_score_codex":0.00019558126,"about_ca_topic_score_gemma":0.00042429668,"teacher_disagreement_score":0.89159846,"about_ca_system_score_codex":0.00007672953,"about_ca_system_score_gemma":0.00018448531,"threshold_uncertainty_score":0.9993752},"labels":[],"label_agreement":null},{"id":"W7132875657","doi":"","title":"The Stable Rank of Diagonal ASH Algebras","year":2021,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Diagonal; Rank (graph theory); Conjecture; Simple (philosophy); Class (philosophy); Diagonal matrix; Matrix (chemical analysis); Triangular matrix","score_opus":0.018029529653448347,"score_gpt":0.3124637938534705,"score_spread":0.29443426420002217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132875657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55307287,0.08447355,0.27522582,0.004812078,0.015087973,0.0019850284,0.00003174101,0.00026987982,0.06504107],"genre_scores_gemma":[0.79509366,0.00786392,0.011823173,0.00041687058,0.0006492418,0.00013303253,0.0002832018,0.00011022722,0.18362667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99628836,0.00030364067,0.00071163254,0.0009311812,0.00096234644,0.00080284796],"domain_scores_gemma":[0.99592495,0.0010162322,0.00081578514,0.0013981003,0.0006573508,0.00018758322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058201735,0.00052956684,0.00069244136,0.00009679879,0.0007800557,0.0003463145,0.0018730181,0.00031346778,0.000518378],"category_scores_gemma":[0.00038516914,0.00041074704,0.00037693093,0.0010728721,0.00022413087,0.00033611304,0.00036215855,0.00069667894,0.0001097131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031851867,0.0005797557,0.00039208893,0.0007476077,0.0005964129,0.00018046002,0.053431664,0.0017638127,0.01977827,0.701587,0.0046127304,0.21601167],"study_design_scores_gemma":[0.0057082884,0.0018798037,0.027979756,0.0030284496,0.0008329087,0.0001603434,0.113369346,0.030899461,0.3683405,0.20622107,0.23515248,0.006427594],"about_ca_topic_score_codex":0.0001167155,"about_ca_topic_score_gemma":0.00021849033,"teacher_disagreement_score":0.49536592,"about_ca_system_score_codex":0.00006756403,"about_ca_system_score_gemma":0.000931834,"threshold_uncertainty_score":0.9998344},"labels":[],"label_agreement":null},{"id":"W7132917202","doi":"","title":"Representation Theorems for Mereologies","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Extensional definition; Representation (politics); Mereology; Representation theorem; Conjecture; Set (abstract data type); Algebra over a field","score_opus":0.04970749076568156,"score_gpt":0.40765540783965193,"score_spread":0.3579479170739704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132917202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05638917,0.0051088165,0.89000833,0.0027005987,0.00989591,0.0031751273,0.000026161017,0.00060466176,0.032091223],"genre_scores_gemma":[0.71582156,0.0016098393,0.07641288,0.00088211044,0.0008193088,0.0027592399,0.002178086,0.00017273995,0.1993442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968072,0.00024428524,0.0004900453,0.0012833895,0.000547435,0.0006276443],"domain_scores_gemma":[0.99694115,0.0009249726,0.00071387086,0.0010703261,0.00024632382,0.000103360195],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045557093,0.00048190576,0.0005757932,0.00022613467,0.0009411645,0.00021456518,0.0015394257,0.00023333753,0.0012516056],"category_scores_gemma":[0.000564069,0.0004838138,0.00037665074,0.000862394,0.00011273044,0.00044909105,0.00033367175,0.00047002517,0.000056682307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041387673,0.00017198334,0.000117025564,0.00025096347,0.0001474125,0.000026015037,0.06204383,0.0052347677,0.0027238666,0.78376085,0.003085021,0.14202438],"study_design_scores_gemma":[0.002284673,0.0019532016,0.0028232844,0.00013237282,0.0002984342,0.000040166135,0.14481685,0.057457827,0.022813492,0.68932194,0.0754922,0.0025655543],"about_ca_topic_score_codex":0.00009246039,"about_ca_topic_score_gemma":0.00003576163,"teacher_disagreement_score":0.8135955,"about_ca_system_score_codex":0.00012899289,"about_ca_system_score_gemma":0.00023305148,"threshold_uncertainty_score":0.99976134},"labels":[],"label_agreement":null},{"id":"W7140154111","doi":"","title":"Fuzzy Logic &amp; Vagueness","year":2005,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"","score_opus":0.053305258066296095,"score_gpt":0.3449130218255975,"score_spread":0.2916077637593014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7140154111","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051324766,0.0009333811,0.015810117,0.00030231246,0.0019854668,0.00076422375,0.000013595517,0.000019866233,0.9288463],"genre_scores_gemma":[0.07992115,0.00013525765,0.4575384,0.0004625987,0.00062016904,0.00011412981,0.0011365094,0.000055391596,0.46001637],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984541,0.000041734307,0.00026520362,0.00070239976,0.00023661222,0.00029997187],"domain_scores_gemma":[0.9988071,0.000040323335,0.00021568133,0.00076294516,0.00008153959,0.000092434755],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016377424,0.00026080472,0.0003109108,0.0000908999,0.00014483517,0.00048355924,0.002820179,0.00022212241,0.0011021239],"category_scores_gemma":[0.000029378243,0.00022972442,0.00007795294,0.0002745486,0.00001598867,0.0006546719,0.00027188877,0.00025002295,0.0042506126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017448949,0.000084454,0.000015792575,0.000015759864,0.000020082936,0.00003251772,0.0012244972,0.00012503105,0.00039953957,0.017010178,0.0005758368,0.9804789],"study_design_scores_gemma":[0.00062511826,0.00009516354,0.0020410852,0.0001610404,0.000035864097,0.00003460978,0.0003381355,0.000120673714,0.0037389232,0.075836405,0.9156756,0.0012973913],"about_ca_topic_score_codex":0.000010323524,"about_ca_topic_score_gemma":0.00060978625,"teacher_disagreement_score":0.97918147,"about_ca_system_score_codex":0.000043904136,"about_ca_system_score_gemma":0.00016715923,"threshold_uncertainty_score":0.999811},"labels":[],"label_agreement":null},{"id":"W7147343688","doi":"10.29284/sd9e2d38","title":"Study On Pruning In The Boolean Triple Construction","year":2025,"lang":"","type":"article","venue":"International Journal of Advances in Signal and Image Sciences","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Pruning; Boolean function; Feature (linguistics); Sequence (biology); Standard Boolean model","score_opus":0.01689430798678427,"score_gpt":0.3409525002507094,"score_spread":0.3240581922639251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7147343688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8042744,0.011455773,0.14760889,0.011765398,0.0074661598,0.0006177327,0.0000046844707,0.000011387235,0.016795607],"genre_scores_gemma":[0.99214935,0.0012033589,0.0056271013,0.0008074415,0.0001651858,0.0000040037926,1.1082779e-7,0.000002113866,0.000041320975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711215,0.00036313065,0.00085430004,0.00038110846,0.0010258104,0.0002634762],"domain_scores_gemma":[0.9982735,0.00076394714,0.0005419787,0.00011633391,0.0002628559,0.000041402534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024024711,0.00018828879,0.0002915524,0.0009028361,0.00022502668,0.00059072644,0.002022789,0.000034791497,0.000018881756],"category_scores_gemma":[0.0003650712,0.00012072735,0.00007478012,0.001189977,0.00087163673,0.0033456238,0.00019856541,0.00052726665,0.000001810829],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004917688,0.0017204394,0.107502125,0.00002154867,0.00006623473,0.0011059331,0.010812875,0.010421332,0.0006534242,0.109508574,0.00009350948,0.7576022],"study_design_scores_gemma":[0.009777011,0.009928864,0.2313087,0.0032610714,0.00006033655,0.001138808,0.118420005,0.026236989,0.0024306062,0.589519,0.0069497563,0.00096885],"about_ca_topic_score_codex":0.000011289633,"about_ca_topic_score_gemma":0.000034375527,"teacher_disagreement_score":0.7566334,"about_ca_system_score_codex":0.00008608138,"about_ca_system_score_gemma":0.00023313779,"threshold_uncertainty_score":0.56963885},"labels":[],"label_agreement":null},{"id":"W84438073","doi":"","title":"Some Decomposition Invariants of Crowns.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Pure mathematics; Chemistry; Organic chemistry","score_opus":0.01163160348875944,"score_gpt":0.24985452090623791,"score_spread":0.23822291741747847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84438073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492166,0.0006085735,0.03941855,0.00024029768,0.003494374,0.00019968627,0.0000013001207,0.00017423967,0.006646362],"genre_scores_gemma":[0.9904298,0.000017881937,0.009314263,0.000172092,0.000004018344,0.0000051308716,9.89374e-7,0.000005432778,0.000050357663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918324,0.00007327909,0.00018156931,0.00021433781,0.00015982072,0.00018774542],"domain_scores_gemma":[0.999335,0.00006610361,0.00009167194,0.00038704937,0.000056682937,0.00006350704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015683039,0.000092194394,0.00014122618,0.000060458537,0.00007070174,0.000027906695,0.00040161956,0.00004775103,0.00001390678],"category_scores_gemma":[0.00005309764,0.00008813887,0.000044375876,0.00026837876,0.0000344111,0.0005552455,0.000070115755,0.00007874377,0.000045949164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015288845,0.00007969035,0.00045230612,0.0000049286064,0.0000058745586,0.000007005345,0.00007578097,0.000023282706,0.002506422,0.99601436,0.00017716025,0.0006516829],"study_design_scores_gemma":[0.00044873284,0.00008453212,0.0019930766,0.000009600627,0.0000026335442,0.000009817615,0.000005947144,0.0003287875,0.0259668,0.9705898,0.00045319842,0.000107077314],"about_ca_topic_score_codex":0.0000031558598,"about_ca_topic_score_gemma":3.125904e-7,"teacher_disagreement_score":0.041213218,"about_ca_system_score_codex":0.000023769984,"about_ca_system_score_gemma":0.00004248945,"threshold_uncertainty_score":0.35941988},"labels":[],"label_agreement":null},{"id":"W878577827","doi":"10.1007/s10998-015-0088-x","title":"On congruence extension properties for ordered algebras","year":2015,"lang":"en","type":"article","venue":"Periodica Mathematica Hungarica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"Eesti Teadusfondi","keywords":"Mathematics; Congruence (geometry); Extension (predicate logic); Property (philosophy); Pure mathematics; Categorical variable; Transferability; Commutative property; Computer science","score_opus":0.05940409920224543,"score_gpt":0.27302938003622684,"score_spread":0.2136252808339814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W878577827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045145888,0.00029806793,0.94097507,0.004224355,0.00040520905,0.0011064961,0.0000042625074,0.0006774503,0.0071631824],"genre_scores_gemma":[0.83762544,0.0000063483017,0.16003242,0.0011212219,0.000057898545,0.00022781763,0.0000025673032,0.000024692506,0.00090158085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980603,0.00006005895,0.0003631138,0.00058746047,0.00046438118,0.00046468302],"domain_scores_gemma":[0.9981645,0.00026186797,0.00014989139,0.00090467284,0.00025080403,0.00026830565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003837313,0.00025940733,0.00037076164,0.000099138626,0.0002986717,0.00025650352,0.0009498152,0.00008718277,0.000029665194],"category_scores_gemma":[0.001354399,0.00018598871,0.00010278854,0.00027637125,0.00017377088,0.0003826775,0.00022910995,0.00014897232,0.00032058783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009189509,0.00047384918,0.000013430435,0.0001477959,0.000033709497,0.00002870269,0.0055973246,0.00012532892,0.0032420838,0.9682892,0.011061236,0.010895439],"study_design_scores_gemma":[0.0016088006,0.0013239168,0.00010852727,0.00019683846,0.00003176898,0.00013288106,0.0003943672,0.10610469,0.005748765,0.8653295,0.018161984,0.0008579467],"about_ca_topic_score_codex":0.0000028848974,"about_ca_topic_score_gemma":0.000001510011,"teacher_disagreement_score":0.7924796,"about_ca_system_score_codex":0.000061003546,"about_ca_system_score_gemma":0.00017447995,"threshold_uncertainty_score":0.75843996},"labels":[],"label_agreement":null},{"id":"W890570853","doi":"10.1017/cbo9780511809835.010","title":"Correspondence between λ and CL","year":2012,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Correspondence analysis; Correspondence problem; Psychology; Mathematics; Computer science; Artificial intelligence; Statistics","score_opus":0.028994420869883648,"score_gpt":0.20575904449369017,"score_spread":0.17676462362380652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W890570853","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012417215,0.0006339231,0.072941676,0.000017376191,0.00022032265,0.0002014204,0.000050497438,0.00020748336,0.92560315],"genre_scores_gemma":[0.004432037,0.00013223334,0.0016616903,0.000074450174,0.00016210265,2.8790348e-7,0.000008888126,0.0000202232,0.9935081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987149,0.00003343964,0.00013520008,0.00054964086,0.0002342475,0.00033252747],"domain_scores_gemma":[0.9986722,0.00014014907,0.00017740876,0.0006696548,0.00007433166,0.0002662747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009649847,0.0003158806,0.00034425082,0.00014713468,0.00019574209,0.000063764506,0.0010094674,0.00028509327,0.0000032902058],"category_scores_gemma":[0.0000066615416,0.0003511824,0.00009758633,0.000010131931,0.00022717961,0.0003398682,0.0011434744,0.00042287694,0.000040893512],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009173369,0.0000023110035,0.000018596771,0.000022381037,0.000030690953,0.000107889544,0.000044677636,3.382538e-7,0.000014902137,0.978629,0.0030157664,0.018104251],"study_design_scores_gemma":[0.00024922012,0.000046261404,0.00021656495,0.00006747555,0.00007274191,0.000026836402,0.000004839001,0.00005512209,0.00014864466,0.0003062907,0.99833703,0.00046899045],"about_ca_topic_score_codex":0.000010789953,"about_ca_topic_score_gemma":3.0298938e-7,"teacher_disagreement_score":0.9953213,"about_ca_system_score_codex":0.00008021272,"about_ca_system_score_gemma":0.000060086815,"threshold_uncertainty_score":0.999894},"labels":[],"label_agreement":null},{"id":"W907704857","doi":"10.1007/978-3-319-16655-1_8","title":"A Remark on a Relational Version of Robinson’s Arithmetic Q","year":2015,"lang":"en","type":"book-chapter","venue":"Boston studies in the philosophy of science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Arithmetic; Simple (philosophy); Interpretation (philosophy); Mathematics; Computer science; Philosophy; Epistemology; Linguistics","score_opus":0.13201740390240063,"score_gpt":0.32429467984868077,"score_spread":0.19227727594628014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W907704857","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068614184,0.006570878,0.0018359883,0.0038369275,0.0010706391,0.0005861144,0.000024660407,0.000042763866,0.9853459],"genre_scores_gemma":[0.97304124,0.00089355884,0.016464356,0.0006058014,0.00021061674,0.000020321673,0.0000030044016,0.000021953729,0.00873918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718624,0.000039320188,0.00045674804,0.0005709033,0.0015209295,0.00022586923],"domain_scores_gemma":[0.99770254,0.00043103448,0.0005110005,0.0008465271,0.00046045374,0.000048434937],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015640606,0.00024687097,0.0004610622,0.0004811041,0.00020120069,0.000011109317,0.0020742186,0.000084709325,0.000004165078],"category_scores_gemma":[0.00035633973,0.00016723858,0.000110860325,0.00045193062,0.0035726004,0.00030338974,0.00073005474,0.00032326326,0.000024652662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002055133,0.00003795214,0.00000474816,0.000035553323,0.000013020685,0.000010635597,0.0015242553,0.00026946433,0.00003460716,0.9964693,0.0005302928,0.0010496198],"study_design_scores_gemma":[0.00026561867,0.00047598616,0.000119975695,0.00058982585,0.000013545209,0.000015585316,0.000101077436,0.00023314545,0.000059585767,0.99362266,0.004304751,0.00019824681],"about_ca_topic_score_codex":0.0000021752076,"about_ca_topic_score_gemma":0.000001085995,"teacher_disagreement_score":0.9766067,"about_ca_system_score_codex":0.00018544876,"about_ca_system_score_gemma":0.00020527326,"threshold_uncertainty_score":0.99913913},"labels":[],"label_agreement":null},{"id":"W9137767","doi":"10.1002/(sici)1099-0801(199703)11:2<89::aid-bmc654>3.0.co;2-8","title":"Problems on Hall t-chromaticity.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromaticity; Mathematics; Computer vision; Computer science","score_opus":0.014002170188243505,"score_gpt":0.23435728609779732,"score_spread":0.2203551159095538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9137767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8892035,0.00031510481,0.028740395,0.0056846836,0.0028578176,0.0005623139,0.0000011723648,0.0011555557,0.07147947],"genre_scores_gemma":[0.9897412,0.00000787331,0.008860975,0.00090237934,0.000016212332,0.00001788766,8.9546273e-7,0.000009129075,0.00044345745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894863,0.000038099413,0.00017528629,0.00030838928,0.0002419159,0.00028768103],"domain_scores_gemma":[0.99918216,0.00008190858,0.00006751299,0.0005354125,0.00003756057,0.000095446965],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012965343,0.00013618018,0.00014134053,0.000058748923,0.00011323639,0.00007541562,0.00070423423,0.00005165493,0.000029020011],"category_scores_gemma":[0.000028706716,0.00011832906,0.00004864873,0.00020369071,0.000028829085,0.00040367353,0.00013390313,0.00014149958,0.0009574839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010965205,0.00012855636,0.00010263172,0.000005162863,0.000005207935,0.0000058892347,0.00019935062,0.00049792184,0.0001956736,0.98659587,0.0011011871,0.011161473],"study_design_scores_gemma":[0.0005301339,0.00020667695,0.0011508279,0.000022001652,0.0000023262926,0.000008684087,0.000004790166,0.010376693,0.001837509,0.97567385,0.009977515,0.00020897698],"about_ca_topic_score_codex":0.0000036671106,"about_ca_topic_score_gemma":0.0000031696554,"teacher_disagreement_score":0.1005377,"about_ca_system_score_codex":0.000057159345,"about_ca_system_score_gemma":0.000024388572,"threshold_uncertainty_score":0.9998204},"labels":[],"label_agreement":null}]}